Whenever I am  updating my Ubuntu 14.04.5 LTS Desktop, the following error occurs in terminal:  W: Failed to fetch http://archive.ubuntu.com/ubuntu/dists/trusty/Release     Unable to find expected entry 'restricted/source/Sources' in Release file    (Wrong sources.list entry or malformed file)   Can anyone shed some light on how to fix this?  cat -n /etc/apt/sources.list gives me this  1 # deb cdrom:[Ubuntu 14.04.1 LTS _Trusty Tahr_ - Release amd64 (20140722.2)]/ trusty main restricted 2 3 # See http://help.ubuntu.com/community/UpgradeNotes for how to upgrade to 4 # newer versions of the distribution. 5 deb http://in.archive.ubuntu.com/ubuntu trusty main restricted 6 deb-src http://in.archive.ubuntu.com/ubuntu trusty main restricted 7 8 ## Major bug fix updates produced after the final release of the 9 ## distribution. 10 deb http://in.archive.ubuntu.com/ubuntu trusty-updates main restricted 11 deb-src http://in.archive.ubuntu.com/ubuntu trusty-updates main restricted 12 13 ## N.B. software from this repository is ENTIRELY UNSUPPORTED by the Ubuntu 14 ## team. Also, please note that software in universe WILL NOT receive any 15 ## review or updates from the Ubuntu security team. 16 deb http://in.archive.ubuntu.com/ubuntu trusty universe 17 deb-src http://in.archive.ubuntu.com/ubuntu trusty universe 18 deb http://in.archive.ubuntu.com/ubuntu trusty-updates universe 19 deb-src http://in.archive.ubuntu.com/ubuntu trusty-updates universe 20 21 ## N.B. software from this repository is ENTIRELY UNSUPPORTED by the Ubuntu 22 ## team, and may not be under a free licence. Please satisfy yourself as to 23 ## your rights to use the software. Also, please note that software in 24 ## multiverse WILL NOT receive any review or updates from the Ubuntu 25 ## security team. 26 deb http://in.archive.ubuntu.com/ubuntu trusty multiverse 27 deb-src http://in.archive.ubuntu.com/ubuntu trusty multiverse 28 deb http://in.archive.ubuntu.com/ubuntu trusty-updates multiverse 29 deb-src http://in.archive.ubuntu.com/ubuntu trusty-updates multiverse 30 31 ## N.B. software from this repository may not have been tested as 32 ## extensively as that contained in the main release, although it includes 33 ## newer versions of some applications which may provide useful features. 34 ## Also, please note that software in backports WILL NOT receive any review 35 ## or updates from the Ubuntu security team. 36 deb http://in.archive.ubuntu.com/ubuntu trusty-backports main restricted universe multiverse 37 deb-src http://in.archive.ubuntu.com/ubuntu trusty-backports main restricted universe multiverse 38 39 deb http://security.ubuntu.com/ubuntu trusty-security main restricted 40 deb-src http://security.ubuntu.com/ubuntu trusty-security main restricted 41 deb http://security.ubuntu.com/ubuntu trusty-security universe 42 deb-src http://security.ubuntu.com/ubuntu trusty-security universe 43 deb http://security.ubuntu.com/ubuntu trusty-security multiverse 44 deb-src http://security.ubuntu.com/ubuntu trusty-security multiverse 45 46 ## Uncomment the following two lines to add software from Canonical's 47 ## 'partner' repository. 48 ## This software is not part of Ubuntu, but is offered by Canonical and the 49 ## respective vendors as a service to Ubuntu users. 50 deb http://archive.canonical.com/ubuntu trusty partner 51 deb-src http://archive.canonical.com/ubuntu trusty partner 52 53 ## This software is not part of Ubuntu, but is offered by third-party 54 ## developers who want to ship their latest software. 55 deb http://extras.ubuntu.com/ubuntu trusty main 56 deb http://archive.canonical.com trusty partner 57 # deb-src http://archive.canonical.com trusty partner 58 deb-src http://extras.ubuntu.com/ubuntu trusty main

I have unistalled and reinstalled the Ubuntu Software Center as per info I found in a similar thread and I got the same response about line 91 or something like that.  I just tried to upload a screen shot but since I'm new it won't allow me to.  I also can not figure out how to cut and paste anything so I have to hand type what the error screen says, both when I attempt to open the software center and nothing happens, when I try to enter commands into the terminal to uninstall, reinstall, whatever I get the same following:  COULD NOT INTITIALIZE THE PACKAGE INFORMATION An unresolvable problem occured while initializing the package information Please report t:his bug against the 'update-manager' package and include the following error message: 'E: Malformed line 91 in source list/etc/apt/sources.list (dist parse)  E: The list of sources could not be read.,  E: The package list of status file could not be parsed or opened.   How do I report bugs?  What can be done about this.  I have searched and everything everyone says to do leads me back to the same line error message.  So, I don't know how to get to line 91 in the source list; to tell you what it says. Sorry, I'm really new to this. That is what I need is to find out how to get there and fix what it says. I would really like to NOT have to re partition my hard drive and start from scratch, so I'm really looking forward to getting this problem solved. I need to be able to install new software.


If I want to install a program by:  sudo apt-get install package_name  I always get the error:  E: Could not open lock file /var/lib/apt/lists/lock - open (2 No such file or directory) E: Unable to lock the administration directory (/var/lib/dpkg) , are you root?   I am root, but still get the error. Any idea ?

I get this error when trying to use apt-get:  E: Could not get lock /var/lib/dpkg/lock - open (11 Resource temporarily unavailable) E: Unable to lock the administration directory (/var/lib/dpkg/) is another process using it?     How can I fix this?


In some languages a word on the form abcxxdef (note that there is only two occurrences of the letter x) is the compound of the two words abcxx and xdef. Sometimes the hyphenation rule is to break the word into its two parts: abcxx-xdef. Note that the letter x now occurs three times. How can I, for a specific word, tell LaTeX to hyphenate this way?

Swedish writing conventions states that in compound words, when three successive identical consonants occur, one of them should be omitted. An example of this is glass (ice cream) and strut (cone), which form the compound word glasstrut (ice cream cone), not glassstrut.  Another example is ägg and gula, which forms äggula (egg yolk), not ägggula.  It might seem like a strange rule, and sometimes it creates strange results. As an example, it is impossible to distinguish between the written words glass-strut (ice cream cone) glass-trut (a gull made of ice cream) and glas-strut (a cone made of glass), but most words don't have this ambiguity (äggula can't mean anything else besides egg yolk regardless how it's pronounced).  However, if a hyphenation occur between the two consonants, the third one should be added. This means that äggula should be hyphenated as ägg-gula. Other examples would be till-låta, till-lämpa, topp-position.  Is it possible to achive this kind of hyphenation with Latex? Ideally, I am searching for a solution both for the whole document (like \hyphenation works, for i.e. äggula) and in the text, for cases like glasstrut which could be hyphenated differently depending on the meaning (glass-strut, glass-trut).  Testing shows that none of the above words gets correct hyphenation (using Polyglossia and Xelatex). If I add an entry manually with \hyphenation, I get the hyphenation at the correct place, but I don't know how I could add the "missing" letter.   \documentclass{article} \usepackage{polyglossia} \setmainlanguage{swedish} \begin{document} \hyphenation{glass-trut} Oh Norrmalmsregleringen, ho samt Västerbron och Tranebergsbron. glasstrut krigsåren var Larsson även en ledande nordisk  \end{document}   (Hyphenation should occur in the word "glasstrut", the other words are just there for filling)


What is this about?  The close vote review workflow is currently like this:   You are given a question. You read the question and decide whether to close it or not. If you click on Leave Open, goto 5 If you click on Close, you are given a list of close reasons, along with how many people has voted on each close reason.   If you select the appropriate close reason and click on Vote To Close, goto 5 If you click on the cross or outside of the dialog box, goto 2  You are done with this question.   I must emphasize that, the question is not closed when the reviewer click on Close, but only when the reviewer has chosen a close reason and clicked on Vote To Close.  The reviewer may sometimes need to see the wordings of the close reasons again to be sure, so the reviewer may click on the Close button before he/she has a decision. Even if the reviewer thinks that a particular question should be kept open, he/she can still click on the Close button to bring up the close reason list to see which close reasons other users has chosen.  Now consider how the current review audit work:   You are given a question. You read the question and decide whether to close it or not. If you click on Leave Open, goto 5 If you click on Close, goto 5 If you clicked on what the audit expects, it shows "Congratulations", otherwise it shows "STOP! Look and Listen"   It is pretty obvious that clicking on the Close button yields different results for real review items and review audits. While you can click on Close to view the close reasons and existing votes for real review items without actually voting to close, you cannot do that for review audits because this will immediately cause you to fail the audit.  Also, sometimes the reviewer may  actually search for duplicates, and when he/she try to vote to close as duplicate, he/she fails the audit, which is counter-productive.  My suggestions:  I think that the review audit items which expect you to vote to leave open should have consistent behaviour like real review items, so I request the close vote review audits to not be fail when the reviewer click on Close. Instead it should show the list of close reasons with one (or two) fake close vote(s).  In addition, care should be taken when assigning fake close votes with the following reasons:   duplicate of... This depends on how the system pick the duplicate question. If it is picked randomly, care should be taken to avoid similar questions to be chosen as the duplicate, unless the  is implemented. off-topic because... Other reasons Try not to create custom reasons which actually make sense to avoid confusions. too broad There are probably questions of this type which is not yet closed, so the  may also be needed.   Moreover, if the reviewer decided to close the question as a duplicate of an unlisted question, it should be considered as a real and normal close vote and recorded, then the question should be thrown into the close vote review queue. It should not be counted as a failed audit.  Due to the above changes, audit items which expect the reviewer to close them will also require the reviewers to choose the close vote (because if they don't, robot reviewer can always just click Close and then go back to click Leave Open to cheat through audits). I think that the audit should be passed no matter what reason the reviewer chose because the system cannot assess whether the reason chosen is absolutely wrong.     Related:

Having just  from any of the queues, it was reviewing close votes; however, this audit was flawed in that I didn't even cast a close vote.  Often I press the Close button to preview greater detail and sentiment of the closure, spawning the Why should this question be closed dialog box:    Especially for duplicates, where functionality is solely dependent on spawning this dialog.  From Closing > Duplicate, I can search or view selected duplicates:    Although, I realize general closure reasons are summarized on the page:    This question had 6-upvotes, but seemed very localized referencing subjective query is "taking too long" and even had a sqlfiddle link.  Maybe overly broad regarding performance tuning, the OP was posting like a forum with two answer posts to his own question  and  with one of those answers asking follow-up questions.    Wanting to gauge community response, current closure totals struck my curiosity.  So, I pressed the Close button and boom - oh, the humanity!  I failed, and didn't even cast a close vote.    Votes are not cast until a reason for closure is selected and Vote to Close is pressed.  Taking any review very seriously on this site, it only seems fair that my review quality is tested through actionable steps instead of clicking for more detailed information, leveraging the functional design of the close vote user interface.  Sure, it's complex to seed fake vote totals, and then there's controversy of mindless voting in the majority or people who simply cherry pick 4-vote questions.  Still though, it seems unfair I should hesitate to review further information of vote totals and duplicates before skipping due to the implementation of this audit.


For any three real random variables $X,Y,Z$, prove or disprove that $\langle XY\rangle$, $\langle XZ\rangle$, $\langle YZ\rangle$ can't all be negative.  Here $\langle \cdot \rangle$ denotes an expectation over the joint probability distribution of the three variables.  Intuitively I think they can't all be negative, because if $X,Y$ are anticorrelated, and $X,Z$ are anticorrelated, how can $Y,Z$ also be anticorrelated? But I am not sure how to prove this, or if there is a counterexample.  It might be necessary to assume that $X,Y,Z$ have zero means.

There are three random variables, $x,y,z$. The three correlations between the three variables are the same. That is,  $$\rho=\textrm{cor}(x,y)=\textrm{cor}(x,z)=\textrm{cor}(y,z)$$  What is the tightest bound you can give for $\rho$?


I'm currently starting my internship, and I need to gather knowledge related with the integration of cloud services (SaaS).  I'm currently comparing integration platforms available in the market (iPaaS and similars), and the next steps are to analyze approaches to integrate services, and also look for open-source libraries related with the integration of services.  My question is in which Stack Exchange site should I ask for people's opinion on these issues?

After my lie down, I posted  on SO. As I suspected would happen, it got moved to programmers. Unfortunately, the kind of people I'm interested in getting answers from (litb,skeet et al - the top SO programmers in their respective disciplines) don't frequent Programmers much. So my question is, where to ask somewhat non-specific questions of high-powered users?


Please Note I am asking how to cite a paper under blind-reviewed in an accepted paper, NOT a new paper to be submitted.   Chronologically,   First, I submitted paper A that requires double-blind review.  Then, I cite it in another paper B. (In paper B, I explained that paper A is not available since it is under a double-blind review process) Paper B is accepted while paper A is still under review. Now I have to submit the camera ready version of Paper B before the notification of Paper A.   Solution I  Put my blind review article into a pre-print archive (e.g. arXiv) so that it can be available for citing. But, would it "spoil" the blind review process?  Solution II  place an anonymized version of paper A in a dropbox folder and cite it with a link to that dropbox file in the reference.  (Inspired by dsfgsho's answer to )  What's the better solution? Is there any other solutions?    Related Questions:    (for a new paper)

This is my case: I've recently co-authored and sent an article to a journal that follows a double-blind review process, so that reviewers shouldn't be able to know the name of the authors. ---I mean, I (as the corresponding author) am responsible for hiding any authoring information to them.  Now I am writing another paper and I want to cite the article that is under double-blind review.  So, it is not only that I should add the typical "under review" label when citing that article, but moreover I can't give any information about the article that may spoil the double-blind process. For instance, if I add the name of the authors and the name of the journal it was sent to, then I can't include the title of the article (because it could happen that the citing article is sent for reviewing to one of the blind reviewers of the first article, or that it is even published before the first one...).  Anyway... How can/should I cite an article that is under review by a journal that follows a double-blind review process without potentially revealing too much information?? How is this problem usually solved?  I must say that I usually publish pre-prints as technical reports, but I didn't do it this time, in order not to reveal any information that could be accessed by the blind reviewers.  EDIT:  I was thinking about putting this label instead of the title of the cited article: "[Title is omitted to protect the double-blind review process]". But I still have some doubts. If I mention the name of the journal it was sent to, could the article be potentially recognized by the blind reviewers?


I m trying to install Ubuntu on my hp laptop which he has Win 7. I followed the steps for installing but got some problems now, like I don't have the option to "install-alongside-windows ". Also I have unallocated space for the Ubuntu partition but nothing shows when i go to "Choose Something else".

I have a notebook HP 650 and I removed Windows 8 to install Windows 7. I have disabled Secureboot and installed Win7 successfully.  When I boot Ubuntu live cd, the installation manager is unable to detect Windows partition and it is showing all the HDD as "unallocated" so I have no way to resize partition and install Ubuntu without destroying Windows partition.  Same thing is happening with Gparted that prompts me that cant detect if HDD is GPT or not.  Searching internet I found that HP notebooks have a RAID controller that prevents Windows to be properly detected but using the command  sudo dmraid -rE  I get the "No RAID detected"  I have been setting dual boot frequently for friends etc but this is the first time I can't find a solution.  The most strange is that this notebook is Ubuntu certified


Lets say $a_1, a_n$ are normed vectors.  Why is the set $C = \{\Sigma_{i=1}^n \lambda_ia_i: \lambda_i \ge0\}$ closed? The $\lambda$'s can be any non-negative numbers. So C is the set of all non-negative linear combinations of the n vectors.  I tried both the method with open balls, and the method with a converging sequence(show that the point the series is convergin to is in C), but still I do not see why. (PS: If it is untrue in the generalized version, you can assume that the vectors are in $\mathbb{R}^n$.)

Looking for the proof of the lemma asserting that the conical surface (envelope) is a closed space. Thank you.


Let $a,b,c>0$ be real numbers. Prove that:  $$\sqrt{\frac{2a}{b+c}}+\sqrt{\frac{2b}{a+c}}+\sqrt{\frac{2c}{a+b}}\leq\sqrt{3\left(\frac{a}{b}+\frac{b}{c}+\frac{c}{a}\right)} $$

In the pdf which you can download  I found the following inequality which I can't solve it.     Exercise 2.1.11 Let $a,b,c  \gt 0$. Prove that    $$\sqrt{\frac{2a}{b+c}}+\sqrt{\frac{2b}{c+a}}+\sqrt{\frac{2c}{a+b}} \leq \sqrt{3 \left(\frac{a}{b}+\frac{b}{c}+\frac{c}{a}\right)}.$$   Thanks :)


If 'horizontal' follows the horizon, and 'vertical' ascends from the horizon, is there a word for a line from the viewer to the horizon? Otherwise, is there a broadly accepted business term for describing data where there are two horizontals, but one is an iterative representation of the first?  Specifically, this word would be used in a business sense to represent a second horizontal of accompanying data that would be something of a Y axis to an X axis. (This is not immediately for purposes of verbal presentation.) Is there a specific term that describes this relation in a business context? I want a word that won't alienate listeners unfamiliar with unrelated fields of study.  While 'longitudinal' is helpful in , this does not differentiate itself from 'horizontal', which is a common term used in business to describe a broad area, as opposed to a 'vertical' describing a focused area of specialization.  Alternatively, is there a business construct that addresses horizontality, verticality, and adds the ability to describe depth that can be utilized instead that relies on these concepts?

When working in a 2D coordinate system you could say that X is the horizontal axis and Y is the vertical axis.  Extending this to 3D, is there a similar word for the Z axis?  (I'm aware of Width, Height and Depth, but obviously horizontal and vertical aren't synonymous to width and height, which is why I don't want to call the Z axis the depth axis.)


here is a code snippet:  $regex_match = "(.*).txt"; $replacement = "\$1.pdf"; my $new_replacement = ""; #??? my $new_regex_match = quotemeta ($regex_match); #??? $from = "test.txt"; (my $to = $from) =~ s{$regex_match}{$replacement}g; print "From " . $from . " To " . $to  . "\n";   Output : From test.txt To $1.pdf  I believe the $1 is not being interpolated. What needs to change? What does new_replacement and/or new_regex_match be?

I would like to do the following: $find = "start (.*) end"; $replace = "foo \1 bar";  $var = "start middle end"; $var =~ s/$find/$replace/;  I would expect $var to contain "foo middle bar", but it does not work. Neither does: $replace = 'foo \1 bar';  Somehow I am missing something regarding the escaping.


I cant send or receive anything after connecting to FTP, but can remove files. I know that I didn't do a 'good job' with the iptables and now I need help.  Here is the output from iptables -L -n -v  Chain INPUT (policy DROP 16184 packets, 4360K bytes)  pkts bytes target     prot opt in     out     source               destination           930  149K ACCEPT     all  --  *      *       127.0.0.1            0.0.0.0/0             4672 3279K ACCEPT     all  --  *      *       0.0.0.0/0            0.0.0.0/0            state RELATED,ESTABLISHED     1    71 ACCEPT     udp  --  *      *       0.0.0.0/0            0.0.0.0/0            udp dpt:53     1    60 ACCEPT     tcp  --  *      *       0.0.0.0/0            0.0.0.0/0            tcp dpt:20000    90  5200 ACCEPT     tcp  --  *      *       0.0.0.0/0            0.0.0.0/0            tcp dpt:10000    28  1632 ACCEPT     tcp  --  *      *       0.0.0.0/0            0.0.0.0/0            tcp dpt:443    39  2140 ACCEPT     tcp  --  *      *       0.0.0.0/0            0.0.0.0/0            tcp dpt:80     1    60 ACCEPT     tcp  --  *      *       0.0.0.0/0            0.0.0.0/0            tcp dpt:993     1    60 ACCEPT     tcp  --  *      *       0.0.0.0/0            0.0.0.0/0            tcp dpt:143     1    60 ACCEPT     tcp  --  *      *       0.0.0.0/0            0.0.0.0/0            tcp dpt:995     3   160 ACCEPT     tcp  --  *      *       0.0.0.0/0            0.0.0.0/0            tcp dpt:110     1    60 ACCEPT     tcp  --  *      *       0.0.0.0/0            0.0.0.0/0            tcp dpt:53     1    60 ACCEPT     tcp  --  *      *       0.0.0.0/0            0.0.0.0/0            tcp dpt:587     1    60 ACCEPT     tcp  --  *      *       0.0.0.0/0            0.0.0.0/0            tcp dpt:20     5   300 ACCEPT     tcp  --  *      *       0.0.0.0/0            0.0.0.0/0            tcp dpt:21    21  1240 ACCEPT     tcp  --  *      *       0.0.0.0/0            0.0.0.0/0            tcp dpt:25  Chain FORWARD (policy ACCEPT 0 packets, 0 bytes)  pkts bytes target     prot opt in     out     source               destination           Chain OUTPUT (policy ACCEPT 6260 packets, 4251K bytes)  pkts bytes target     prot opt in     out     source               destination     If i change the input policy to accept everything works again but I dont want to do that. I tried to enable all the states for port 21 but still didn't work.

My current scenario involves allowing various rules, but I need ftp to be accessible from anywhere.  The OS is Cent 5 and I am using VSFTPD.  I can't seem to get the syntax correct.  All other rules work correctly.  ## Filter all previous rules *filter  ## Loopback address -A INPUT -i lo -j ACCEPT  ## Established inbound rule -A INPUT -m state --state ESTABLISHED,RELATED -j ACCEPT  ## Management ports -A INPUT -s x.x.x.x/24 -p icmp -m icmp --icmp-type any -j ACCEPT -A INPUT -s x.x.x.x/23 -p icmp -m icmp --icmp-type any -j ACCEPT -A INPUT -s x.x.x.x/24 -p tcp -m state --state NEW -m tcp --dport 22 -j ACCEPT -A INPUT -s x.x.x.x/23 -p icmp -m icmp --icmp-type any -j ACCEPT -A INPUT -s x.x.x.x/23 -p tcp -m state --state NEW -m tcp --dport 22 -j ACCEPT -A INPUT -i lo -j ACCEPT  ## Allow NRPE port (Nagios) -A INPUT -s x.x.x.x -p tcp -m state --state NEW -m tcp --dport 5666 -j ACCEPT -A INPUT -s x.x.x.x -p tcp -m state --state NEW -m tcp --dport 5666 -j ACCEPT  ##Allow FTP  ## Default rules :INPUT DROP [0:0] :FORWARD DROP :OUTPUT ACCEPT [0:0] COMMIT   The following are rules I have tried.  ##Allow FTP -A INPUT --dport 21 any -j ACCEPT -A INPUT --dport 20 any -j ACCEPT  -A INPUT -p tcp --dport 21 -j ACCEPT -A INPUT -p tcp --dport 20 -j ACCEPT  -A INPUT -p tcp -m state --state NEW -m tcp --dport 21 -j ACCEPT -A INPUT -p tcp -m state --state NEW -m tcp --dport 20 -j ACCEPT   -A INPUT -p tcp -s 0/0 -d 0/0 --destination-port 20 -j ACCEPT -A INPUT -p tcp -s 0/0 -d 0/0 --destination-port 21 -j ACCEPT  -A INPUT -s 0.0.0.0/0 -p tcp -m state --state NEW -m tcp --dport 21 -j ACCEPT -A INPUT -s 0.0.0.0/0 -p tcp -m state --state NEW -m tcp --dport 20 -j ACCEPT


We are given an array $[a_1,a_2,\dots,a_n]$  Define an operation :  select any one element of array and multiply by $-1$  We apply this operation $x$ times.  How many distinct arrays we can get after the operation is done $x$ times ?

I am provided with a multi-set, let's say S with elements as [num1, num2, num3] and these elements are integers (both negative as well as non negative). As this is a multi-set, elements in the multi-set can be present multiple times. I need to choose an element from this multi-set and multiply it with -1. I need to perform this operation m times. I want to find out how many multi-sets are there which can be made from this multi-set. This is home work, so really sorry but I am not able to proceed. I need some help in this. Please give me some hints. I am providing one example.  S = [2, 3, 2] and m=2 then there are 4 possible multisets   [2, 3, 2] [-2, -3, 2] [-2, 3, -2] [2, -3, -2].   Any help would be appreciated.


I'm defining a class named Roster below. I've already defined the class Student. I'm trying to create an array of pointers of type Student in the Roster class to add the students to the Roster. I'm super new to programming and C++, and I'm trying to figure out why this is giving me errors. The IDE is saying it expects a ; before the * and it's missing a type specifier, which doesn't make sense to me. Thanks in advance for any help! class Roster { private:     int studentIndex = -1;     const static int numStudents = 5;     Student* classRosterArray[numStudents]; public:     void parse(string row);

I often find myself in a situation where I am facing multiple compilation/linker errors in a C++ project due to some bad design decisions (made by someone else :) ) which lead to circular dependencies between C++ classes in different header files (can happen also in the same file). But fortunately(?) this doesn't happen often enough for me to remember the solution to this problem for the next time it happens again.  So for the purposes of easy recall in the future I am going to post a representative problem and a solution along with it. Better solutions are of-course welcome.     A.h  class B; class A {     int _val;     B *_b; public:      A(int val)         :_val(val)     {     }      void SetB(B *b)     {         _b = b;         _b->Print(); // COMPILER ERROR: C2027: use of undefined type 'B'     }      void Print()     {         cout<<"Type:A val="<<_val<<endl;     } };       B.h  #include "A.h" class B {     double _val;     A* _a; public:      B(double val)         :_val(val)     {     }      void SetA(A *a)     {         _a = a;         _a->Print();     }      void Print()     {         cout<<"Type:B val="<<_val<<endl;     } };       main.cpp  #include "B.h" #include <iostream>  int main(int argc, char* argv[]) {     A a(10);     B b(3.14);     a.Print();     a.SetB(&b);     b.Print();     b.SetA(&a);     return 0; }


Suppose I have a parallel plate capacitor with a vacuum between the plates, a voltage $V$ across them and a capacitance of $C$.  What will this arrangement look like to an observer in a uniformly moving frame of reference with velocity $v$ at right angles to the capacitor plates? Obviously the apparent plate separation is changed, so presumably the capacitance changes, but what about the electric field between the plates and the stored energy?  (Not a homework question - though I'm exploring whether it could be...!)

Suppose I look at a parallel plate capacitor in its rest frame and calculate the electrostatic energy, $E$.  Next, I look at the same capacitor in a primed frame boosted in the direction perpendicular to the plane of the plates. In this frame, the $E$-field is the same strength, there is no magnetic field, and the volume over which the $E$-field extends is less by a factor $1/\gamma$. This suggests $E' = \frac{1}{\gamma} E$, but relativity states that energy transforms as $E' = \gamma E$.   Where is the missing energy?


I am doing a project for my CHS Java course that models the Monty Hall gameshow. But for some reason, this if statement wont 'activate' even though it is true... any ideas?  System.out.println("There is a goat behind Door #" + (goatSpot));    System.out.println("Would you like to switch your door? (yes or no) "); String switchChoice = input.next(); switchChoice = switchChoice.toUpperCase(); if (switchChoice == "YES") {                if (choice == 1 && goatSpot == 2)     {         choice = 3;     }     else if (choice == 1 && goatSpot == 3)     {         choice = 2;     }     else if (choice == 2 && goatSpot == 3)     {         choice = 1;     }     else if (choice == 2 && goatSpot == 1)     {         choice = 3;     }     else if (choice == 3 && goatSpot == 1);     {         choice = 2;     }     if (choice == 3 && goatSpot == 2)     {         choice = 1;     } }   It just completely ignores everything inside the if statement....

I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug.  Is == bad? When should it and should it not be used? What's the difference?


I have a extended class, in class have a var, I define this by value, but say this is null !!!!  public class CalendarCell extends TextView {      public static final String TAG = "CalendarCell";      protected ArrayList<Integer> cellStates = new ArrayList<>();  public CalendarCell(Context context) {     super(context); }  public CalendarCell(Context context, AttributeSet attrs) {     super(context, attrs); }  public CalendarCell(Context context, AttributeSet attrs, int defStyle) {     super(context, attrs, defStyle); }  @Override protected int[] onCreateDrawableState(int states) {     int newStatesSize = cellStates.size();  // Error here (null)     if (newStatesSize > 0)     {          ...     }     else     {         return super.onCreateDrawableState(states);     } }  public void resetStates() {     cellStates.clear(); }  public void addState(int state) {     if(!cellStates.contains(state))         cellStates.add(state);     } }   I defined 'cellStates' by value.but say this is null. Why???  java.lang.NullPointerException  at yaran.CalendarSection.ViewSection.CalendarCell.onCreateDrawableState(CalendarCell.java:44)

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


In some situations I would open my macbook in a public place or library, and I still have something open that produces sound, such as music or a chat program giving notifications. I would like to have my sound be muted by default when I open the lid. Anyway to achieve this?

I was wondering if there was any way to mute my macbook whenever I physically close it, so if there was anything playing prior to closing it that it does not continue to make noise when I open it later.  Seems like a weird request, but I have a bad habit of forgetting to pause my music/youtube  when I leave for class, than when I open my laptop in class it disrupts the class.   The easy answer would be, "just pause your stuff", but I thought it would be nice if there was something that could accomplish this.


I'm trying to determine what could cause an influx of referrer spam traffic in Google Analytics. My company launched a website in September. Since the launch, the website has seen a slow but steady increase of traffic. Last month we suddenly saw a sharp drop in organic traffic, and an increase in spam referrer traffic (which made up 50% of our visits for November). I've created filters to stop this from happening again, but I was wondering if there are specific causes of this type of spam traffic, especially occurring over a short period of time and very suddenly.

Last months I have lots of referrer spammers in my GA statistics. Their count is ~10x higher than count of legit visitors (my site is not very popular yet). I've turned on an option to hide known spammers in GA settings, but it didn't help at all. It seems these spammers are using scripts to spam directly to GA (i.e. they are not logged in my IIS).  Is there anything I can do to stop these spammers?    UPD 10 months later, and they started spamming using fake target page names... and Google is still doing nothing about it.


I'm travelling to Orlando for 14 nights at the end of August, for a nice holiday break. I travelled to Orlando last year in June, for 2 weeks. My question involves whether my visa waiver is still valid?  If so, do I just print it off again and take it to the airport in August, My hotel details will be different than last time? Is that something to be worried about?  Thanks

I visited the USA in May this year, on an ESTA which I applied for in April. It was approved and I was allowed entry into the country.    I'm re-visiting again this November for two weeks. Am I able to use the same ESTA again or do I need to re-apply for a new one? I know it says it's valid for two years, but is that valid for every use within those two years, or I have to use it within two years, and once I have visited on that visa, it's invalid?


In .NET, there is something that can automatically run a piece of code in a referenced assembly when the assembly is loaded.   For example, you can have a class decorated with a sort of attribute that lives in project Foo(A Class Library). And project Bar(A Web App) simply references project Foo. When Bar loads, that decorated code in Foo gets run somehow. I believe this is a newer feature.  Can someone tell what this feature is called??  Update: Thanks Shiva! Not Module Initialize. Although it lead me to the right answer.  Thanks all!!

Is it possible to run some code when an assembly is loaded, without doing anything specific in the loading code? What I am looking for is like a static constructor on a type.  Eg:  Assembly A does not know about Assembly B, but B does know about A. Assembly A needs to know certain things about B if B is loaded. When Assembly B is loaded by the runtime (referenced, or explicit), I want a piece of code (static method or attribute) to be executed that calls a method in Assembly A.  The root cause of this problem is unknown types being encountered when serializing a type in A that contains types from B not known at compile time as interfaces are used.


I just started using XFCE and I'm loving it so far but I've yet to figure this out.   I'm having trouble removing a duplicate Google Chrome file in this folder. The main thing is I want to remove it from my menu since I have one under the Internet sub-folder in the menu and also one under Other. I'm OCD so this is driving me insane.   In the applications folder, the only thing that differentiates the two is that the duplicate just has the command entry (as "google-chrome" filled under properties while the other has a description and comment which is the one I want to keep.   I don't know how to remove the duplicate since the rm command says it can't find that directory (and I'm not sure how to word it exactly since they are both named the same).   I tried the fix of the "NoDisplay=true" but I'm not sure how to differentiate between the two since they both have the same name.   I also tried changing the duplicate to renaming it to the desktop.old extension but it said that it doesn't exist.   I'm ok with uninstalling and installing again if I can be absolutely sure it removes both.    Edit: Sorry for the late response and thanks for those who responded. I should have clarified better, I'm currently using the crouton installation of ubuntu on an Acer C720. I have just removed Google Chrome but this second application in the /usr/share/applications folder is still there, although its grey and doesn't launch anything since it's uninstalled. I tried this way (How to remove single file from /usr directory?) by using the command BUT, the file name is Google Chrome (and I've tried google-chrome, google-chrome.desktop) and I can't remove it by command because it doesn't recognize the space, so it looks for Google and Chrome separately and it says No such file or directory for both (including google-chrome and google-chrome.desktop). Anyone have any ideas of getting rid of this thing?

When I search in applications of Gnome for Chrome, I get two entries: the left one in the picture is OK with a high resolution icon, the right one has a low resolution icon.  I couldn't figure out where the second one is coming from. Does anyone have an idea?  I would like to remove it.


Can I try to trip with the Maneuvers (Strikes) of a Crusader?

If a ToB Maneuver such as Daunting Strike calls for a melee Attack as part of the maneuver, can this melee attack be resolved as a trip attack/include a trip attempt?


I used  this command to zip all files in a folder : zip -r fixedrom.zip /sdcard/dbtools/zipfix/fix/ ;  It works fine but the zip should be like this : Meta-inf  Recovery System Boot.IMG Etc...  But after unziping  its like this Sdcard>dbtools>zipfix>fix>(and files and folders above ) How to fix this ? Thanks in advance

I'm trying to make a zip function that'll do all the steps I typically do when zipping a file or folder. Say my current directory is ~, and I want to zip a folder named Folder1, whose file path is ~/Folder2/Folder1.  Issuing  cd ~/Folder2 && zip -r Folder1 Folder1 && cd -   does exactly what I want. Namely, it zips so that the output Folder1.zip does not contain folders that lead up to the folder I'm zipping (namely, /home/user/Folder2), it zips recursively, and it takes in the first argument of zip with the exact name as the file or folder I'm zipping (Folder1.zip).  So I want to make a function in my .zshrc something akin to  coolerzip() { cd /path/to/file && zip -r file file && cd - }   where it need only take in one argument, which in this case, it will be ~/Folder2/Folder1. Then Folder1 will be the name for both files in coolerzip, and I will cd right into ~/Folder2 so Folder1 lies in my current directory before zipping. Is there any way I can achieve this so that coolerzip only requires one argument rather than three?


Find the sum of the series $\frac{1}{1\cdot 2}+\frac{1\cdot3}{1\cdot2\cdot3\cdot4}+\frac{1\cdot3\cdot5}{1\cdot2\cdot3\cdot4\cdot5\cdot6}+...$. This type of questions generally require a trick or something and i am not able to figure that out. My guess is that it has something to do with exponential series or binomial series. Any help?

I have a question where i couldn't find any clue. The question is  $$\frac{1}{1\cdot 2}+\frac{1\cdot3}{1\cdot2\cdot3\cdot4}+\frac{1\cdot3\cdot5}{1\cdot2\cdot3\cdot4\cdot5\cdot6}+\cdots$$  I could get the general term as $t_n=\frac{1\cdot3\cdot5\cdot7\cdots(2n-1)}{1\cdot2\cdot3\cdot4\cdot5\cdot6\cdots2n}$  I have also tried it to form the sequence in the telescopic form.But couldn't get. Any hint will be appreciated.


I need to alter the MAC address for eth1 ethernet device on my embedded system permanently so it retains this MAC address on every boot.  The OS I'm using:  VERSION_ID="v2015.12" NAME="Angstrom" ID="angstrom" PRETTY_NAME="The Ångström Distribution v2015.12" ANSI_COLOR="1;35" HOME_URL="http://www.angstrom-distribution.org"   The version of Linux I am using is:  Linux arria10 4.1.33-ltsi-altera #1 SMP Mon Oct 30 10:14:22 PDT 2017 armv7l GNU/Linux   I am able to set the MAC address for eth0 by altering the following bootarg:  setenv ethaddr 00:11:22:33:44:55 save run bootcmd   Once booted, eth0 takes this MAC address as expected.  When I try to do the same for eth1, using eth1addr a random MAC address is defined when I boot.  I can however alter the MAC address of eth1 once booted by using the following:  ifconfig eth1 down ifconfig eth1 hw ether 00:11:22:33:44:56 ifconfig eth1 up   This is not a permanent solution for me as I would need to set the MAC every time I have booted the device.  Is there a way to set the MAC address of eth1 from the bootargs? Also any ideas on why I wouldn't be able to set the MAC address using setenv eth1addr?  Edit: eth0 is RGMII, eth1 is SGMII

QUESTION:  How might I be able to specifically change the Mac Address of the enp3s0 and wlp2s0 interfaces through the /etc/network/interfaces file? What code would I have to include inside? I have been trying for some time now without success sadly enough.    ELABORATING:  So I found this great article online explaining how to change a Mac Address permanently through the /etc/network/interfaces file on my Ubuntu.  In the article, it says:      On Debian, Ubuntu, and similar systems, place the following in the   appropriate section of /etc/network/interfaces (within an iface   stanza, e.g., right after the gateway line) so that the MAC address is   set when the network device is started:      hwaddress ether 02:01:02:03:04:08   Source:   Now when I use the following code:  cat /etc/network/interfaces   I get the following output  # interfaces(5) file used by ifup(8) and ifdown(8) auto lo iface lo inet loopback   And when I do ifconfig on my ubuntu, I get back 3 different interfaces:   enp3s0 lo wlp2s0   I would like to change the mac address of all of my interfaces (enp3s0, wlp2s0) (lo is loopback so no need there), but I am unfamiliar with the commands in the /etc/network/interfaces file. I have been looking at tutorials online though I can't seem to get stuff right, and my computer even started acting very strangely a few times afterwards.


I have this function:  //We will store any failed subscriptions and retry them until the succeed (if ever) addFailedSubscription: function(streamId) {   failedSubscriptions[streamId] = true;   $timeout(function() {     failedSubscriptions[streamId] = null;   }, 5000); }   Is this safe? How is it that streamId is available to the timeout function after the function has returned? Is it effectively creating a closure for this function?  Thanks

How would you explain JavaScript closures to someone with a knowledge of the concepts they consist of (for example functions, variables and the like), but does not understand closures themselves?  I have seen  given on Wikipedia, but unfortunately it did not help.


I tried my best to find an example of how to post a math equation on Stack Overflow, but nothing worked. I'm familiar with  though. I found some people are saying you just need to add your equation between two doubled $s ( $$ f(x) = 2x $$), but it doesn't work for me. What should I do to make it work?

in questions, answers, and comments. Can we get something like this going on Stack Overflow?  I think it’d be appropriate as I at least pretty often want to write something like n^2 and would benefit greatly from prettier markup.


I tried to assign a calculation result to a variable, and print it out. However, depending on the type of the variable it's assigned to, the results are different. But the unexpected results only happened for certain values for this specific calculation.   int main() {      // anything above 64.02 give unexpected results     // e.g. (100.02 - 100.0) * 100.0      int a ((64.02 - 64.0) * 100.0);      double b ((64.02 - 64.0) * 100.0);      cout<<"result: "<<a<<endl; // result: 1, expected result: 2     cout<<"result: "<<b<<endl; // result: 2, expected result: 2      // anything below 64.02 give right results      int c ((63.02 - 63.0) * 100.0);      double d ((63.02 - 63.0) * 100.0);      cout<<"result: "<<c<<endl; // result: 2, expected result: 2     cout<<"result: "<<d<<endl; // result: 2, expected result: 2      return 0; }   I know this question is very specific, but I suspect it has something to do with implicit type cast. But why only for values >=64.02?  This is my first ever question on stack overflow, please don't -1 me!!!

Consider the following code:   0.1 + 0.2 == 0.3  ->  false   0.1 + 0.2         ->  0.30000000000000004   Why do these inaccuracies happen?


We are doing a study on livability and quality of life in high-density cities pulling information from sources that, when crunched, can provide an insight into the density ratio of apartments so as to hopefully determine “free space per human” and “concentration per human” in apartment complexes.  In the below example we are looking for the end result of enumerated apartment unit numbers for ONLY the units in parenthesis, all else can be ignored except zipcodes.  The word APT can be removed. The left and right parenthesis can be removed. The main address, for example, below, 7 Dense Road can be removed (we are not interested in precise address). New York NY and zip code should remain as we are studying density by zipcode.  You will notice that there are some entries with just one apartment with no range - it would be good to keep that but not necessary as one unit apartments are generally penthouses or similar which have an abundance of space - we are interested in "how close people live next to one another, what configuration and how many neighbors they have".  So, for example, in the below submitted list of apartment ranges, the end result would be each unit number on its own line:  Our input text file looks like:  7 Dense Road  APT (Range 4A - 4D) NEW YORK NY 10023-5040 7 Dense Road  APT (Range 5A - 5K) NEW YORK NY 10023-5042 7 Dense Road  APT (Range 6A - 6E) NEW YORK NY 10023-5043 7 Dense Road  APT 2A NEW YORK NY 10023-5040 7 Dense Road  APT 2B NEW YORK NY 10023-5040 7 Dense Road  APT 2C NEW YORK NY 10023-5040 7 Dense Road  APT (Range 6F - 6J)   End result needed:  4A NEW YORK NY 10023-5040 4B NEW YORK NY 10023-5040 4C NEW YORK NY 10023-5040 4D NEW YORK NY 10023-5040 5A NEW YORK NY 10023-5042 5B NEW YORK NY 10023-5042 5C NEW YORK NY 10023-5042 5D NEW YORK NY 10023-5042 5E NEW YORK NY 10023-5042 5F NEW YORK NY 10023-5042 5J NEW YORK NY 10023-5042 5K NEW YORK NY 10023-5042 6A NEW YORK NY 10023-5043 6B NEW YORK NY 10023-5043 6C NEW YORK NY 10023-5043 6D NEW YORK NY 10023-5043 6E NEW YORK NY 10023-5043 . . . .

I have the following repeating pattern of text that needs to be reformatted.  Normally this should be easy, even with a standard text editor, but in this case I need to expand the information in the parenthesis and enumerate them.  Best I give an example:  "Gene Code (1A - 1F) D2 fragment, D74F"   I need to be able to have the final product look like this:  Gene Code, 1A, D2 fragment, D74F Gene Code, 1B, D2 fragment, D74F Gene Code, 1C, D2 fragment, D74F Gene Code, 1D, D2 fragment, D74F Gene Code, 1E, D2 fragment, D74F Gene Code, 1F, D2 fragment, D74F   The snag is that the initial string contained in the parenthesis, could be anything like 1A-1F, or 3D-3H, etc.  That is the only shifting bits of information. The numeric in the parenthesis is always the same, just the alphabetic letters need expansion with their associated number.  So someway of correlating the alphabet with the numbers is needed.  This looks like a mind-bender to me. Any help much appreciated. New to this, by the way.


I have a new Samsung 840 250GB SSD on the way, and I want to make sure that everything is running optimally after install.  I've spent many frustrating hours on the internet trying to understand how I should align the partitions of the SSD when it arrives (and even how to partition everything; my other drive is a 1TB HDD with files already on it). I'd like to know a foolproof way of setting everything up.  Now, the only place I could find the erase block size of the 840 is here:    I simply can't understand why such information isn't made freely accessible by manufacturers! But, anyway, this would suggest the EBS is 1536kb, which seems odd to me.  It is to my understanding that you should now align by MiB (usually set at 1MiB). I assume that the figure above should actually be 1536k B=1.5MiB? This seems to suggest the partition alignment will be somewhat non-standard.  So my question is: How do I align my partitions given this information? Please bear in mind that I have never used linux before; I'm doing my best to get everything set up so that I can begin to learn but am finding this process incredibly opaque and time consuming. If possible, a step by step guide through GParted would be great; at the moment I'm considering an NTFS partition ~20GB for Windows (playing games), an EXT4 ~20GB for ubuntu (for doing everything else) and a shared documents+games partition for everything else in NTFS file format. I'm not going to have any swap partition and use swap files instead.

I am in the process of building my first RAID5 array. I've used mdadm to create the following set up:  root@bondigas:~# mdadm --detail /dev/md1 /dev/md1:         Version : 00.90   Creation Time : Wed Oct 20 20:00:41 2010      Raid Level : raid5      Array Size : 5860543488 (5589.05 GiB 6001.20 GB)   Used Dev Size : 1953514496 (1863.02 GiB 2000.40 GB)    Raid Devices : 4   Total Devices : 4 Preferred Minor : 1     Persistence : Superblock is persistent      Update Time : Wed Oct 20 20:13:48 2010           State : clean, degraded, recovering  Active Devices : 3 Working Devices : 4  Failed Devices : 0   Spare Devices : 1           Layout : left-symmetric      Chunk Size : 64K   Rebuild Status : 1% complete             UUID : f6dc829e:aa29b476:edd1ef19:85032322 (local to host bondigas)          Events : 0.12      Number   Major   Minor   RaidDevice State        0       8       16        0      active sync   /dev/sdb        1       8       32        1      active sync   /dev/sdc        2       8       48        2      active sync   /dev/sdd        4       8       64        3      spare rebuilding   /dev/sde   While that's going I decided to format the beast with the following command:  root@bondigas:~# mkfs.ext4 /dev/md1p1  mke2fs 1.41.11 (14-Mar-2010) /dev/md1p1 alignment is offset by 63488 bytes. This may result in very poor performance, (re)-partitioning suggested. Filesystem label= OS type: Linux Block size=4096 (log=2) Fragment size=4096 (log=2) Stride=16 blocks, Stripe width=48 blocks 97853440 inodes, 391394047 blocks 19569702 blocks (5.00%) reserved for the super user First data block=0 Maximum filesystem blocks=0 11945 block groups 32768 blocks per group, 32768 fragments per group 8192 inodes per group Superblock backups stored on blocks:          32768, 98304, 163840, 229376, 294912, 819200, 884736, 1605632, 2654208,          4096000, 7962624, 11239424, 20480000, 23887872, 71663616, 78675968,          102400000, 214990848  Writing inode tables: ^C 27/11945 root@bondigas:~# ^C   I am unsure what to do about "/dev/md1p1 alignment is offset by 63488 bytes." and how to properly partition the disks to match so I can format it properly.


Finding  value of $\lim_{n\rightarrow \infty}\sin(\sin(\sin(.......(\sin \left(\frac{\pi}{2}\right))))$  Attempt: $\displaystyle \sin(\frac{\pi}{2})=1$  so $\displaystyle \sin(\sin \frac{\pi}{2})= \sin(1)$  could  some help me how to  solve it,thanks

I need your help with evaluating this limit:  $$ \lim_{n \to \infty }\underbrace{\sin \sin \dots\sin}_{\text{$n$ compositions}}\,n,$$  i.e. we apply the $\sin$ function $n$ times.  Thank you.


In a game of fate where each player has +3, +2, +2, +1, +1, +0. What is a Cheat sheet ladder to have. I.E. There is a large Iron door in the way, the brute says he's gonna force his way through it. This would be "Hard" whereas the other player wants to spend time picking the lock, this would be "Easy" over 2 turns. Then I look at the ladder and use the number for the amount of challange against their approach value. I've seen the Ladder for character creation but I would prefer something with better wording.

In a recent game of Diaspora, I pitted three of my "5 cap" player characters against four "3 cap" and one "4 cap" character in physical combat, and was surprised to see that the characters came away with barely a scratch: no consequences taken, and two stress taken total.  While I had expected them to be successful, I hadn't expected the encounter to be such a pushover (it was intended for five "5 cap" PC's).    How can I estimate the opposition required to pose a credible challenge to a given group of player characters in FATE based games?


I want to know what is the different between force push and normal push and at what kind of situations i should do force push in git?Is it a good practice to do force push into master branch?

I wrote the wrong thing in a commit message.  How can I change the message? The commit has not been pushed yet.


It does not make sense that you can put a question on hold without an explanation.   StackOverflow is a great resource but the way in which users wield their power leads to a lot of frustration and anger on the part of the users.   I believe Stack would be more successful if it was required that a user leave a comment in the On Hold question with information about where a question should be asked and specifically why it was put on hold.  My question is why is this not a requirement of users?  Example Question:

I recently had a  which attracted 1 close vote. I don't know why this vote was cast. If I have not conformed to the site's protocol in any way I am left 'none the wiser'.    Should it be made mandatory for a user to comment on why they are voting to close a question?  If this site is to remain 'clean', part of this will be achieved incorporating processes that educate users.


I have a csv file that I bring into QGIS 2.14 with standard lat and long formatting. The file displays fine but when I try to save it as an ESRI shapefile I get an error:  Export to vector file failed.     Error: Feature write errors:   Feature creation error (OGR error: Error in psSHP->sHooks.FSeek() while writing object to .shp file.)   I have tried many other files including examples from various sites on the internet and get the same error. In other words, I cannot get this functionality to work at all and I do not think it is file specific.  Note the below has been ruled out as a cause of the problem, but I am leaving it in for future reference: I will also note that when I try to start QGIS 2.14 Desktop I get an error as follows:     Runtime Error!   Program: C:\PROGRA~1\QGIS Essen\bin\qgis-bin.exe   R6034   An application has made an attempt to load the C runtime library incorrectly.   I suspect that is probably the problem although it hasn't affected any functionality up to this point.

I just downloaded QGIS 2.0 and every time I open it I get this error message window popping up:    Does anyone know what this means or how I might be able to fix it?


I was working on a script that logs in to UAT server, reroute to necessary folder and activates the virtual environment. Following is the script: function gotouat(){     branch=`getBranchName`;     echo "Logging into uat for branch $branch";     ssh -t uat "cd ../projects/$branch && source envproj/bin/activate; zsh"; }  This script reroutes to the necessary branch, but does not start virtual environment. Following are the debug logs:  debug1: Sending command: cd ../projects/test-branch && source envproj/bin/activate; zsh debug2: channel 1: request exec confirm 1 debug2: callback done debug2: channel 1: open confirm rwindow 0 rmax 32768 debug2: channel_input_status_confirm: type 99 id 1 debug2: PTY allocation request accepted on channel 1 debug2: channel 1: rcvd adjust 2097152 debug2: channel_input_status_confirm: type 99 id 1 debug2: exec request accepted on channel 1  Any help would be appreciated! Also this is my first post, so apologize for any missing information/issues. Thanks!

Probably it is a weird thing I would like to achieve but: I would like to SSH to a remote host and then execute some bash commands like "alias" automatically to use them afterwards in an interactive mode. The remote host does not allow the personal environment.    Is this possible? Would "expect" do it? Or is there any other way to achieve this? Basically I would like to have my bashrc without modifying any files on the remote host.


I have protected a few questions on a Stack Exchange website. Is it possible to know which ones? I don't remember them anymore.

Having a record of all actions taken on a site, as is provided by the "activity" and "votes" tabs of our profile, comes in handy very often. Perhaps the most common case is being able to find a question I've interacted with in the past, to see if anything has changed about it. This applies to questions a user has protected as much as anything else. Users are theoretically encouraged to unprotect questions when it's no longer necessary, as emphasized , but in practice they often do not. In many cases it's hard to blame them: unless they specifically marked it as a favourite, the site doesn't keep any record of the question to allow them to find it again. We should help users more easily review their own protections in the future.    For personal review, the votes tab is adequate, but there may also be value in displaying this publicly in the activity tab. There may be users with a history of repeatedly protecting questions over-eagerly. It would be useful to be able to review other users' protection histories to see if this is the case. Even if this is not available to regular users, it may be helpful to moderators, unless their user activity views already allow them to filter down to see this.


Say I have a class myClass with 3 attributes in the constructor (string value, int pos, int pos_2).  Now I make a vector of objects of said class.  How would I search through vector<myClass> to find the index of any class objects with a string that matches a given string?    Example:  Here's a (non-functional) attempt at finding a class object that has the string hello as its string value:  std::string to_find = "hello"; std::vector<myClass>::iterator duplicate_it; duplicate_it = std::find(subrelation_vector.begin()->value, subrelation_vector.end()->value, to_find); int duplicate_pos = *duplicate_it->pos;

Again me with vectors. I hope I'm not too annoying. I have a struct like this :  struct monster  {     DWORD id;     int x;     int y;     int distance;     int HP; };   So I created a vector :  std::vector<monster> monsters;   But now I don't know how to search through the vector. I want to find an ID of the monster inside the vector.   DWORD monster = 0xFFFAAA; it = std::find(bot.monsters.begin(), bot.monsters.end(), currentMonster);   But obviously it doesn't work. I want to iterate only through the .id element of the struct, and I don't know how to do that. Help is greatly appreciated. Thanks !


I've already posted this on area51 meta but as it is a tumbleweed question over there doesn't get a lot of traction,  (link only works for 10K+ users) and posting here instead (and probably be downvoted back into the stone age). OK, so I'm a total security and privacy nazi nerd, so I actively refuse all cookies everywhere except for the sites I visit more than once/week. So  is allowed to store session cookies only as are all the other sites in the SE network which I regularly visit like Ask Ubuntu, Super User, Server Fault, Stack Overflow, sstatic.net etc and it works nicely. For some or other reason, if I authenticate on area51 I can see some kind of avatar when I'm on :  And I was able to post and subsequently edit this question over there... but (and that's a big but)  if I go to the main area51 site (), it looks like I never logged on:  And if I try to log in, it won't let me! What am I missing here? Additional info: Just noticed that surfing to  gives the following output under FireFox: discuss.area51.stackexchange.com uses an invalid security certificate.  The certificate is only valid for the following names:   *.stackexchange.com, stackoverflow.com, *.stackoverflow.com, stackauth.com, sstatic.net,  *.sstatic.net, serverfault.com, *.serverfault.com, superuser.com,  *.superuser.com, stackapps.com, openid.stackauth.com, stackexchange.com,  *.meta.stackexchange.com, meta.stackexchange.com, mathoverflow.net,  *.mathoverflow.net, askubuntu.com, *.askubuntu.com, stacksnippets.net,  *.blogoverflow.com, blogoverflow.com, *.meta.stackoverflow.com,  *.stackoverflow.email, stackoverflow.email, stackoverflow.blog  Error code: SSL_ERROR_BAD_CERT_DOMAIN   Correlation, causation or not related?

In the Area 51 Discussion Zone (DZ), the log in link is for area51.stackexchange.com, not area51.meta.stackexchange.com.  Because of domain restrictions, etc., after successfully logging in you get redirected back to the Discussion Zone, and although you are logged into the main Area 51 site, you aren't logged into the DZ. If you come to meta.stackexchange.com then you can log in and the single sign in will carry across to the DZ.


i know how to get url regex of Url with 'http'. but what if i dont have 'http' and the url start with 'www'? How can i get the regex?  String urlRegex = "((https?):((//)|(\\\\))+[\\w\\d:#@%/;$()~_?\\+-=\\\\\\.&]*)";

How can I check if a given string is a valid URL address?  My knowledge of regular expressions is basic and doesn't allow me to choose from the hundreds of regular expressions I've already seen on the web.


I have a database with simple recovery mode. For that database I have a job running every morning. This job imports data and executes plenty stored procedures that inserts data, updates records, delete records, makes calculations... The job takes approximately 30 minutes and makes the transaction log be 10GB big. To avoid growth of the log file during the job I set the log size to 11GB. With that amount it is never autogrowing. Nevertheless it is blocking 11GB. I think it is useless knowing that I will never need to make a recovery (every job empties all the tables and populate them from scratch every morning).   I just read that putting checkpoints truncates the log. So my idea is to put checkpoints at several location in my stored procedures in order to be able to minimize the size of the log (from 11GB to lot less: 3GB for instance).  Question: is it dangerous to do that take into consideration once again that I will never have to make recoveries?

I have a database with simple recovery mode. For that database I have a job running every morning. This job imports data and executes plenty stored procedures that inserts data, updates records, delete records, makes calculations... The job takes approximately 30 minutes and makes the transaction log be 10GB big. To avoid growth of the log file during the job I set the log size to 11GB. With that amount it is never autogrowing. Nevertheless it is blocking 11GB of disk space.  I just read that putting checkpoints truncates the log. So my idea is to put checkpoints at several location in my stored procedures in order to be able to minimize the size of the log (from 11GB to lot less: 3GB for instance).  Question: is it dangerous to do that take into consideration once again that I will never have to make recoveries?


I am looking for a good drop down terminal that can be split for gnome. At work I use KDE and Yakuake and it works really good but I don't really like KDE that much. I installed Yakuake in gnome and it is really buggy so I removed it and I am looking for a good one.   I also see that there are similar topics but they are all out of date. I have looked into terra but the last update to the ppa was in 2013 so was avoiding that one a bit. I am already using screens so having screens nested inside tmux for multi panel terminal doesn't really sound like it will work that well.  Ubuntu 15.04 with Gnome.

The most common Quake-style terminal in Gnome seem to be Guake and Tilda, but they can't split to show several shells in single tab like Yakuake can. Is there any alternative which can do so?


I had Windows on my hard drive and with tons of data on that. Windows got corrupted and all tried failed to repair it and in absence of windows media I tried installing Linux but by accident it got formatted and Linux got ready. I thought it will create a different partition where it it will keep the windows partition unchanged. Post format I don't see my personal data.  Let me know how I can restore and recover my data.

What steps can I take to try to recover lost or inaccessible data from any storage device?  Answers:   This applies to any computer storage device, e.g. internal/external hard drives, USB sticks, flash memory. The most important thing is to STOP using it, any type of I/O can ruin your chances of a recovery.     We have separate questions covering common problems with USB flash drives in greater detail:


When reading about chaos theory, I am often presented with a picture of a butterfly shape formed by two spirals - Lorenz' strange attractor.  I presume that there is a specific function that generates the most natural example.  If it is a meaningful question, what is the angle between the two planes on which the paths of the spiral, more or less, are located?

How can I make the equation for the planes of the wings of the lorenzattractor,  I know that the critical point should be used.  But I don't know how I should make this plane, the figure shows in yellow which plane I want.


Let $V$ be a finite-dimensional vector space and $f$ be a normal operator on $V$. Let $f=PU$ be polar decomposition of $f$, where $P$-nonnegative, self-adjoint and $U$ - unitary(orthogonal) operator. Prove that $PU=UP$.  My attempt: Since $f$ is normal then $ff^*=f^*f$ and $f^*=U^*P$ then $ff^*=PUU^*P=P^2$ and $f^*f=U^*PPU=U^*P^2U.$ Combining them we get that $$P^2=U^*P^2U \Leftrightarrow UP^2=P^2U$$  I don't know what to do next.   Can anyone show how to prove this, please?

Assume $A$ is a normal matrix. Suppose $A=SU$ is a polar decomposition of $A$. Prove that $SU=US$.  I have no idea to prove this.  $A$ is normal then $AA^*=A^*A$. And then we have $$ SS^*=U^*S^*SU. $$ But I don't know how to continue.


I usually sleep my laptop. After waking, the swap usage has increased.

I need a step-by-step, simple and easy way to configure swappiness.


When we have an inner function that access a variable x1 defined in the lexical environment of its outer function, how the JavaScript engines handle keeping the x1 in the memory ?  Do they keep the already created execution context with its lexical environment of the outer function or they create a new lexical environment and copy the variable binding into it then link it as the outer lexical environment for the lexical environment of the inner function and destroy the execution context with the lexical environment of the outer function.  Can we consider a closure as a Lexical Environment ?   The outer function is func1. The inner function is func2. The outer variable is x1 defined inside func1.   In the following code:  function func1() {    var x1 = 1;    return function func2() {      var x2 = 2;      return [x1, x2];    }  }  func1()();

How would you explain JavaScript closures to someone with a knowledge of the concepts they consist of (for example functions, variables and the like), but does not understand closures themselves?  I have seen  given on Wikipedia, but unfortunately it did not help.


I am not referring to the F test, which could be misleading. Ok, so I have one set of Data and two models to describe the data. Problem is, the second model has the same exact parameters of model 1, and the only difference is algebraic, as in we add a 1 to some of the terms in the model. That being said, it makes it hard to compare the two models using an F-test, because there are no extra parameters to fix and compare. What I have been doing so far is to run bootstraps and confidence interval analysis on both my models. I have been thinking of using a t-test on the two residual datasets that I get from bootstrapping. What I mean is that the residual obtained in each bootstrap to be listed as a data set 1 and 2, for both models, and then to run a paired t-test on them. But is that going to tell me anything about the better-ness of one model over the other?

I know I can only use the log-likelihoods of two models as selection criterion if they are nested. However, I don't understand this completely. Why isn't it possible to apply this reasoning to non-nested models? I think the higher the log-likelihood the better fits the model the data. I am also aware of other criteria as AIC but this doesn't helps me to understand the issue with the log-likelihoods.


I am trying to make a login and registration activity login system works fine with same method  but in register system it gives the error and i cant find whats the error is as in logcat and my code is   public class Register extends Activity implements OnClickListener {  private Button btnLinkToLogin; private EditText user, pass; private Button mRegister; private ProgressDialog pDialog;  JSONParser jsonParser = new JSONParser();  private static final String LOGIN_URL = "http://http://portfolio.webuda.com/register.php";  private static final String TAG_SUCCESS = "success"; private static final String TAG_MESSAGE = "message";   @Override public void onCreate(Bundle savedInstanceState) {     super.onCreate(savedInstanceState);     setContentView(R.layout.activity_register);      user = (EditText) findViewById(R.id.username);     pass = (EditText) findViewById(R.id.password);      mRegister = (Button) findViewById(R.id.register);     mRegister.setOnClickListener(this); }   @Override public void onClick(View v) {     // TODO Auto-generated method stub      new CreateUser().execute(); }  class CreateUser extends AsyncTask<String, String, String> {      /**      * Before starting background thread Show Progress Dialog      */     boolean failure = false;      @Override     protected void onPreExecute() {         super.onPreExecute();         pDialog = new ProgressDialog(Register.this);         pDialog.setMessage("Creating User...");         pDialog.setIndeterminate(false);         pDialog.setCancelable(true);         pDialog.show();     }      @Override     protected String doInBackground(String... args) {         // TODO Auto-generated method stub         // Check for success tag         int success;         String username = user.getText().toString();         String password = pass.getText().toString();         try {             // Building Parameters             List<NameValuePair> params = new ArrayList<NameValuePair>();             params.add(new BasicNameValuePair("username", username));             params.add(new BasicNameValuePair("password", password));              Log.d("request!", "starting");              //Posting user data to script             JSONObject json = jsonParser.makeHttpRequest(                     LOGIN_URL, "POST", params);              // full json response             Log.d("Login attempt", json.toString());              // json success element             success = json.getInt(TAG_SUCCESS);             if (success == 1) {                 Log.d("User Created!", json.toString());                 Intent ii = new Intent(Register.this,HomeActivity.class);                 finish();                 startActivity(ii);                 return json.getString(TAG_MESSAGE);             } else {                 Log.d("Login Failure!", json.getString(TAG_MESSAGE));                 return json.getString(TAG_MESSAGE);              }         } catch (JSONException e) {             e.printStackTrace();         }          return null;      }      protected void onPostExecute(String file_url) {          pDialog.dismiss();         if (file_url != null) {             Toast.makeText(Register.this, file_url, Toast.LENGTH_LONG).show();         }     } } }

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


Usually, I just use one "to", in sentences like "To address this problem and share our ideas with others, we would like to ...". But I also see people use multiple "to"s, like "To address this problem and to share our ideas with others, we would like to ..." Are they both correct?

Is there a stated rule on use of infinitives in a sequence? Or is it a question of style?  For example,     It is vital for a viewer of this movie to listen for its main character's underlying position, to contrast it with those of the other characters, and ultimately to determine which view is true.


I am a physics enthusiast and came upon an article regarding time crystals and didn't understand many things.  What exactly are ? and what sets them apart from Normal crystals?

In very recent publications, two groups in Maryland  and Harvard  have separately worked on constructing  following the path paved by the previous works of Norman Yao (e.g.  ). For example Chris Monroe et al. (Maryland) have realised (or claim to have) a time crystal by entangling the electron spins of a set of ytterbium ions while keeping the system out of equilibrium by alternately hitting the ions by a laser (to apparently create an effective magnetic field) and by another laser to flip their spins, in a repetitive manner.   Now time crystals have been previously theoretically predicted to exist  and , representing an out-of-equilibrium form of matter, in contrast to the commonly well known equilibrium forms of matter (solid, gas, liquids, liquid crystals...). So it is really great to see such works emerging and the field gaining steam on an experimental level.   That said, admittedly, it is very difficult to grasp these works for someone not involved in the field, but it would be incredibly valuable if, briefly, just the idea of time crystals could be explained at a conceptual level.  As in, what qualifies them as a new form of matter? Surely this form is dependent on some external drive to be kept out of equilibrium, right?   Which then begs to ask "how can it be a naturally occurring form of matter". On the other hand, what does it have in common with the usual concept of crystals, whose whole structure can be represented by spatially replicating the unit cell.  Is the time crystal an addendum to the latter by extending its spatial symmetry to also include a time symmetry?    This is merely an attempt to get more input in order to understand some of the main ideas involved in the original works of Frank Wilczek and Norman Yao. These new experimental realizations (see first paragraph) are very exciting to find out about.


I've got a notebook with a AMD Athlon(tm) 64 X2 Dual-cor processor TK-53 on 1,70 GHz whith 2 gig RAM  Should i pick the 32 or the 64-bit version?  Greetz

What is the difference between 32-bit and 64-bit Ubuntu? I've heard the 64-bit platform performs better and can detect more than 4GB of RAM. Also, while some apps haven't ported to 64-bit yet, ia32-libs lets a 64-bit machine run them.  If so, why not promote 64-bit over 32-bit?


How to write '$a$ is divisible by $b$' in a Latex formula? The symbol \vdots does not look satisfactory.

In addition to the "divides" relation, denoted b | a, there is also a "divisible by" relation expressing the converse (a is divisible by b), often designated with three vertical dots.  Up until now, I've settled with  \mathrel{\vdots}     But there are two problems with the symbol:   It is too high relative to the numbers It is also somewhat too long   A search with  and the  doesn't reveal anything more suitable. How do I get a good looking "divisible by" symbol?


How to prove   $$ \frac{\sqrt{8}}{9801}\sum_{n=0}^{\infty}\frac{(4n)!(1103+26390n)}{(n!)^4 396^{4n}}=\frac{1}{\pi}, $$  which actually looks like coincidence?

The following formula for $\pi$ was discovered by Ramanujan: $$\frac1{\pi} = \frac{2\sqrt{2}}{9801} \sum_{k=0}^\infty \frac{(4k)!(1103+26390k)}{(k!)^4 396^{4k}}\!$$   Does anyone know how it works, or what the motivation for it is?


For instance, if I wanna write: one should not be judgmental if they don't know the truth. Is this correct?  I found this structure e.g. One is said to communicate successfully when he or she is able to express what he or she feels is a bit redundant, I have to repeat he or she all the time.  So, what pronoun should I use in order to refer the previous ONE when I'm writing in the way in the example sentence?

(a) When one reads the Hindi literature of the twentieth century, he finds a striking contrast between the writings of Munshi Premchand and later day writers of popular Hindi fiction.      (b)  When one reads the Hindi literature of the twentieth century, one finds a striking contrast between the writings of Munshi Premchand and later day writers of popular Hindi fiction.   According to me, (b) should be the correct one as "one" cannot be used interchangeably with other pronouns when referring to the same thing. But the correct answer is (a). Can someone explain?


My son was travelling using multiple carriers from Dar-Quito via Nairobi, Amsterdam and Panama City. He had through tickets for both onward and return journeys.  Ecuador issues visas on arrival for Indian citizens.  A letter from the Ecuador embassy in India, downloaded from their website, was also shown to them along with all valid documentation.  The airline, KLM, which was flying him from Nairobi to Panama City, did not allow him to board at Nairobi.  Are they right in doing this and why? If not what needs to be done?

Is it the airport security at the country you flying from? I highly doubt it because I have been to countries where it's so corrupted that you buy the airport officials for the price of a dinner.   Is it the aircrew' responsibility? Again I don't think they care much - unless there is severe punishments - in corrupted third world countries.   I have been personally in a situation when an officer at a certain airport insisted on examining my British passport before he allowed me to move to the gate because I refused to slip him a $100 note. I was travelling to the UK yet I have another passport which is valid and it is issued by the country I was flying from, which means he had no reason whatsoever - nor I think he cared - to examine my British passport to check if it's valid.  Edit to summarize it, I want to expose as little as possible of information about my dual nationality. For that I need to know whom I am obligated to show my passport(s)


My headset gives louder sound on the right side. And I change the balance in Windows to hear equal. But I couldn't find where I can balance my audio.  I searched for it but couldn't find.  This is the volume control:  My OS is Xubuntu

I don't know how to tune speakers well, so I wanted to know if there is a program that will create a balanced sound output when connected to my 2.1 system for all sounds. Using Macbook Pro 2010 15 inch.


In variational quantum eigensolver, it is common to transform the Hamiltonian to a qubit form by Jordan-Wigner transformation, for example. After that, the algorithm needs to measure the qubit Hamiltonian, which consist of Pauli strings. I am wondering how qiskit get this done, can somebody provide me the source code that measures the qubit Hamiltonian (Pauli strings) in qiskit?

I am using qiskit to get some measurement results of observables similar to the Hamiltonian. Can someone provide the way how qiskit measures the Hamiltonian (Jordan-Wigner transformed) when using VQE? Or can they just provide the source code link.


There are several questions with similar titles, but all of them seem to have more complicated queries than what I am working with.  I'm trying to use a variable as part of a select query. The variable $theindex indicates the value for the field theindex which I am selecting for.  This is the code I am trying to use, which generates HTTP ERROR 500...  $sql_stmt = "SELECT * FROM products WHERE theindex='$theindex'"; $result = mysqli_query($conn,$sql_stmt);   This works...  $sql_stmt = "SELECT * FROM products WHERE theindex='1'"; $result = mysqli_query($conn,$sql_stmt);   Clearly the apostrophes around $theindex may be causing the problem, but all the approaches that I've tried thus far don't help and just generate HTTP ERROR 500. How can I use a variable in this select query?  Thank you for taking a look at this.

If user input is inserted without modification into an SQL query, then the application becomes vulnerable to , like in the following example:  $unsafe_variable = $_POST['user_input'];   mysql_query("INSERT INTO `table` (`column`) VALUES ('$unsafe_variable')");   That's because the user can input something like value'); DROP TABLE table;--, and the query becomes:  INSERT INTO `table` (`column`) VALUES('value'); DROP TABLE table;--')   What can be done to prevent this from happening?


I have two machines, In my machineA I have a jar file with these permissions -   -rwxr-xr-x 1 cronus app 16758150 2013-03-19 13:35 exhibitor-1.5.1-jar-with-dependencies.jar   In my another machineB, I have a same jar file but with different permissions -   -rw-r--r-- 1 root messagebus 19340260 Nov 25 14:28 exhibitor-1.5.1-jar-with-dependencies.jar   How to make the permission of machineB jar file same as machineA jar file? In short, how do I get this permission -rwxr-xr-x which I can apply on machineB jar file?  And apart from this, can anybody explain me how does this permission work and what does it mean?  UPDATE:-  Thanks Jordan for the link, I am able to understand its meaning now..

i wanted to know the Read / Write Access on to a file , so i did this way   ls -l Denem.sh   This command displayed   -rwxr-xr-x  1 pavan employee 672 DEC 20  2000 pavan.sh   Could anybody please tell me what -rwxr-xr-x  indicates ?? From Wikipedia.com i found that  -rwxr-xr-x  indicates     -rwxr-xr-x   for a regular file whose user class has full permissions and whose group and others classes have only the read and execute permissions.   Now my  question is Should we take the middle thing (-xr-) into considiration ??


I Wanted To Use Ubuntu From USB So I Burned The Iso File By Using "Rufus.exe",,  It Worked Fantastic! But There Is a Problem Which Is, If I Installed Google Chrome Browser For Example, I Can't Find It The Next Time I Boot From The Usb!   So How To Keep Everything I Install For The Next Time I Boot From That USB? Is That Possible Or I Have To Install Ubuntu Side By Side With Windows To Do It ??

I want to make a persistent live Ubuntu USB drive with more than 4GB of storage.   I know there is an option of installing directly on the drive but I don't want to do this as it will restrict the drive from working on different computers.   One option is to make an additional partition with extra space but if I do this how can I get newly installed software to be stored on this partition?


So I have a drop down list like this:  <select name="store-cost" class="target">     <option value = '100'>100</option>     <option value = '500'>500</option>     <option value = '1500'>1500</option> </select>   and jquery to see what the user has chosen  $( ".target" ).change(function() {     console.log($( this ).val()); });   and i have a button that calls jquery function:  Donate   How do I change the value in the function donateNow according to the user's option?  Many thanks  EDIT, sorry didn't make myself clear, I would like to change I would like to change the function donateNow() param according to the user's chosen option

I have a drop-down list with known values. What I'm trying to do is set the drop down list to a particular value that I know exists using jQuery.  Using regular JavaScript, I would do something like:  ddl = document.getElementById("ID of element goes here"); ddl.value = 2; // 2 being the value I want to set it too.   However, I need to do this with jQuery, because I'm using a CSS class for my selector (stupid  client ids...).  Here are a few things I've tried:  $("._statusDDL").val(2); // Doesn't find 2 as a value. $("._statusDDL").children("option").val(2) // Also failed.      How can I do it with jQuery?     Update  So as it turns out, I had it right the first time with:  $("._statusDDL").val(2);   When I put an alert just above it works fine, but when I remove the alert and let it run at full speed, I get the error     Could not set the selected property. Invalid Index   I'm not sure if it's a bug with jQuery or Internet Explorer 6 (I'm guessing Internet Explorer 6), but it's terribly annoying.


I want to show that any integer of the form $n=4^m(8k+7)$ with $m,k\ge0$ cannot be expressed as a sum of 3 squares.  The case for $m=0$ is easy to prove since the sum of 3 squares cannot be $\equiv7\bmod8$.  However, I am very confused with the proof for the general case, because   if $m=1$ then $n\equiv4\bmod8\not\equiv7\bmod8$, so can be expressed as a sum of 3 squares if $m>1$, $8\mid n$, so is also a sum of 3 squares   I might be overlooking something here, can anyone shed some light?

I have figured out a (long, and tedious) way to do it. But I was wondering if there is some sort of direct correlation or another path that I completely missed.  My attempt at the program was as follows:   A number of the form, $8k + 7 = 7 (mod 8)$. That is, we are looking for integers a, b, c such that $a^2 + b^2 + c^2 = 7 (mod 8)$.   LONG and TEDIOUS way: $$(8k)^2 = 0 (mod 8)$$ $$(8k+1)^2 = 1 (mod 8)$$ $$(8k+2)^2 = 4 (mod 8)$$ $$(8k+3)^2 = 1 (mod 8)$$ $$(8k+4)^2 = 0 (mod 8)$$ $$(8k+5)^2 = 1 (mod 8)$$ $$(8k+6)^2 = 4 (mod 8)$$ $$(8k+7)^2 = 1 (mod 8)$$  That is, using three of these modulo there is no way to arrive at  $$a^2 + b^2 + c^2 = 7 (mod 8)$$


In MSSQL TABLE I have 3 columns.  ID (IDENTITY), KeptValue(NVARCHAR), SPENT(MONEY).   I have multiple KeptValues that are duplicated. I need to delete all duplicates and keep 1. But I need to keep the one with the greatest spent. I have 2 views created. a list of the duplicated kept values VW_DUPLICATE1.

What is the best way to remove duplicate rows from a fairly large SQL Server table (i.e. 300,000+ rows)?  The rows, of course, will not be perfect duplicates because of the existence of the RowID identity field.  MyTable  RowID int not null identity(1,1) primary key, Col1 varchar(20) not null, Col2 varchar(2048) not null, Col3 tinyint not null


How can we give select access at database level in postgreSQL.   At present I had created new user with select access on all tables in a schema using below syntax.   grant select on all tables in schema public to readonly;   But again if any new table gets created, the user readonly is not able to access the newly created table. I need to again execute the same syntax for giving access.  Is there any generic way, where we can give select privilege at database level just like MySQL. So that if any new table is created, the new table will be accessed by user automatically.

I'm new to Postgres and trying to migrate our MySQL databases over.  In MySQL I can grant SELECT, UPDATE, INSERT, and DELETE privileges on a low privileged user and enable those grants to apply to all tables in a specified database.  I must be missing something in Postgres because it looks like I have to grant those privileges for each table one at a time.  With many databases and hundreds of tables per database that seems like a daunting task just to get off the ground.  In addition, once a database is in operation, adding tables happens frequently enough that I wouldn't want to have to grant permissions each time unless absolutely necessary.  How is this best accomplished?


My question might sound  stupid, but does there exist a script that could find out where in database, for which tables, is the desired data located? Say for example, i need to found where Texas is located in database, in which tables and in which column.  There exists a script that could find out the tables, SP, views based on the column name provided. Is there any script that could find out tables, column name etc based on the actual data?  Hope the question is understood.  Best Regards

Given a number, how do I discover in what table and column it could be found within? I don't care if it's fast, it just needs to work.


I want to setup an ubuntu server in which some users are limited to a specific download/upload speed.Is it possible?  I know about Wondershaper, Trickle or similar tools but I don't want to limit programs or an interface bandwidth because the machine will have different kind of users.  A solution for limiting speed for a group or specific users would be great.

How to control bandwidth upload and download per user or each ip/mac? i tried squid3.0stable25 with delay_pools but its not work. is it really possible to control bandwidth for each host by squid? my isp have 400 more host but they are using open bw. i want to limit there upload and download how to do it? i also try htb but setup failed or not working and didn't get perfect example. please help!!


In the definition of valuation I have, the axioms are:  $val: K \rightarrow \mathbb{R} \cup \infty$, $K$ is a field  $val(a) = \infty \Leftrightarrow a = 0$  $val(ab) = val(a) + val(b)$  $val(a+b) \geq min(val(a), val(b))$  In other texts, I have seen a strengthening of the second rule  $val(a) \neq val(b) \Rightarrow val(a+b) = min(val(a), val(b))$  I'm struggling to prove this from my axioms, any hints will be greatly appreciated

Let $F$ be a field and $v:F\rightarrow G\cup\{\infty\}$ be a valuation on $F$ so $G$ is a totally ordered abelian group with $\infty$ having the properties $\infty+\infty=g+\infty=\infty+g=\infty$ and $\infty\leq\infty$ for all $g\in G$, $\infty \notin G$.     Show if $v(a)\neq v(b)$ then $v(a+b)=\min(v(a),v(b)$).   I must be missing some trick here on how to show this is true.  My approach has been to use that $G$ is a totally ordered group so I start by assuming $v(a)\neq v(b)$ and letting my first case be $v(a)<v(b)$ as trichotomy holds in $G$. By $v$ being a valuation on $F$, we then have that $v(a+b)\geq \min(v(a),v(b))=v(a)$. From here what I've tried doing doesn't seem to help much.  I've said lets assuming $v(a+b)>\min(v(a),v(b))=v(a)$ and we also have $$v(a+b)> v(a) \Rightarrow v(a+b)+v(a^{-1}) > 0 \Rightarrow v(1+ba^{-1}) > 0$$ and $$v(a)<v(b) \Rightarrow 0< v(b)+v(a^{-1}) \Rightarrow 0 < v(ba^{-1})$$ also $$v(1+ba^{-1})\geq\min(v(1),v(ba^{-1}))=\min(0,v(ba^{-1}))=0.$$  How does one solve this?


I have a HTML page with the UTM parameters which it can be also use for the leaf form.   I have English button in the page. How to add the UTM parameters after the eng URL ()?  Thanks YanTra

In a web application that makes use of AJAX calls, I need to submit a request but add a parameter to the end of the URL, for example:  Original URL:         Resulting URL:     &enabled=true   Looking for a JavaScript function which parses the URL looking at each parameter, then adds the new parameter or updates the value if one already exists.


Is there a way to open Chrome (or other browser) using terminal?   Something like: $ chrome www.google.com ?

about how to open a URL in your default browser using the Terminal. Basically, you use the command   xdg-open http://google.com   My default browser is Firefox. But lets say that I wanted to open a specific website in Chrome, instead of Firefox. Is there a command to open it in Chrome instead of Firefox?


Today I read a beautiful metaphor for being forced to perform more brain activity than needed if there would have been a proper and clear explanation:     The essay lacked a proper structure: "The reader had to perform mental gymnastics to understand it."   I think it's a beautiful phrase but I would like to have a larger arsenal of similar phrases with a similar meaning.  Do you know any?

Can someone help me to identify some English synonyms/idioms meaning to "wonder so hard"? The word or phrase I'm looking for could be used in a situation where somebody tries to solve a very confusing riddle or is unable to manage what is going on.  I thought one example might be "breaking [somebody's] head open" (like in other languages: "den Kopf zerbrechen" or "rompersi la testa"), but I realized that the English meaning is literal in that case.


When clicking 'Add comment' a popover appears about reputation if it applies to you (e.g. not logged in or not enough rep).  This popover is not visible on mobile unless you scroll right (see screenshot), meaning when you tap 'Add comment', nothing appears to happen.  Unsure if this affects a number of SE sites, or just codegolf.

It appears that the error notifications about comments in Mobile Stack Exchange do not work (in-browser mobile site), on many stacks. Something should be done, do we report bugs here?  My original problem was that I've tried to post comments on answers for various boards, and the button wouldn't do anything, no error message or anything. I recently found out that it's because I don't have enough reputation points, but there was no note explaining the rule like in the desktop version. A couple boards I tried it on are the User Experience one and StackOverflow.  Also, user Mooseman is eating pizza claims the same about "your message is not long enough" error.


When I went to Turkey, I was warned that my beard would make police think I was a member of a group that is "not popular" with the authorities.  So I removed it.  I was glad I did, because in Amsterdam, they spent about three minutes comparing my face to the photo (the photo was taken before I let the beard grow, so it was actually a good match IMHO).  But two years later, the beard is back on the face but still not in the passport.  I brush it out, but it still tends to look like the clowns on Duck Dynasty.  Is that likely to cause a problem entering U.K. or Spain?  I do have driver licenses (Oklahoma and international) that show the beard.  I'd reference a related question but I can't figure out how to do that in the IOS app.  Someone has done it for me in the comments.  The behavior he described is how the guy in Amsterdam behaved when I DID look like my picture.  That's why I wonder if I should shave.  It's the British Border Force and the Spanish people that I will have to deal with next week.

I just recently renewed my passport with a picture taken just after I shaved. I haven't shaved since (>3 weeks) and I kind of like it. I am even looking into how to maintain a beard, but that is a question for another platform.  Regarding traveling I am a bit worried that I look a bit different now then when I renewed my passport. On all my other photo IDs I don't have a beard either.   Long story short, should I shave before boarding my next flight, or are Immigrations/Customs/Airline staff trained to look through the beard?


I have one 500GB HDD. I did not formated it, but have selected "Erase disk and install Ubuntu 18.04" option.  Now, when I open System Monitor it shows 70 partitions. And 490,7 GB one is shown 16 times.  What is happening?

As of Ubuntu 18.04 running lsblk shows 16 snap loops (2-3 times for each snap). The question is, why are they being listed as results for lsblk, fdisf-l, and blkid?    It creates a lot of clutter from the actual disks drive partitions I need to see, namely /dev/ partitions. I know a purported duplicate of this question exists, but it only asks why three loops are being listed per snap. I want to know why these snaps are being listed in the first place, and the purported duplicate does not answer this (perhaps those marking this as duplicate could help me by explaining why it is a duplicate). Technically, they qualify as file systems (which I neither created nor asked for), but they are getting in the way of the information output for the /dev/ partitions I am interested in. This becomes a problem when fdisk -l outputs a three page+ list filled mainly with snaps.  The output of a recent (1 week old) Ubuntu install and I have not installed any snaps:    $ lsblk   NAME   MAJ:MIN RM   SIZE RO TYPE MOUNTPOINT   loop0    7:0    0  14.5M  1 loop /snap/gnome-logs/37   loop1    7:1    0   2.3M  1 loop /snap/gnome-calculator/170   loop2    7:2    0  86.6M  1 loop /snap/core/4486   loop3    7:3    0  86.6M  1 loop /snap/core/4650   loop4    7:4    0   1.6M  1 loop /snap/gnome-calculator/154   loop5    7:5    0  14.5M  1 loop /snap/gnome-logs/34   loop6    7:6    0   3.3M  1 loop /snap/gnome-system-monitor/36   loop7    7:7    0   2.3M  1 loop /snap/gnome-calculator/178   loop8    7:8    0    13M  1 loop /snap/gnome-characters/101   loop9    7:9    0   3.7M  1 loop /snap/gnome-system-monitor/45   loop10   7:10   0 139.5M  1 loop /snap/gnome-3-26-1604/64   loop11   7:11   0   140M  1 loop /snap/gnome-3-26-1604/59    loop12   7:12   0   3.7M  1 loop /snap/gnome-system-monitor/41   loop13   7:13   0    21M  1 loop /snap/gnome-logs/25   loop14   7:14   0  12.2M  1 loop /snap/gnome-characters/69   loop15   7:15   0    13M  1 loop /snap/gnome-characters/96   sda      8:0    0 298.1G  0 disk   ├─sda1   8:1    0   512M  0 part /boot/efi   └─sda2   8:2    0 297.6G  0 part /   sr0     11:0    1  1024M  0 rom     (supplemental screen capture of above text):     My snap list shows 6 results:       core   gnome-3-26-1604   gnome-calculator   gnome-characters   gnome-logs   gnome-system-monitor     Meanwhile, gnome-disk-utility shows nothing at all for snaps, only showing my HDD and optical drive.    It won't be very efficient if every installed snap gets listed as a block device (2-3 times each to add). Should I expect future updates to deal with this?  Edit: fdisk-l also dumps out a very long list with 16 instances of these "disk loops" (Disk /dev/loop0, Disk /dev/loop1, etc., each with details which I won't show here because it's too long). This can't be intended behaviour, can it? blkid also lists 16 loops, as TYPE="squashfs". At least parted -l works as expected, only outing my actual disk partitions.    I just tested this, and installing more snaps does add more to the lsblk output. Therefore, fdisk, lsblk, blkid could have potentially huge output lists, according to the number of snaps available, and installed.