How does Windows know when your Internet connection (but not your LAN connection) goes down?
How does Windows know whether it has internet access or if a Wi-Fi connection requires in-browser authentication?
Suppose that $\hat{x}$ is the least squares solution of $Ax = b$.  That is, $\min{|r|}, r = Ax - b$ with respect to $x$.  Is $\hat{x}$ also the least squares solution of $JAx = Jb$?  I suspect so, but I'm not sure how to prove it.  If $J$ is invertible, it's easy enough to prove as you can just cancel it out from both sides.  But what if it's not invertible? How to check if installing a package will require a reboot? Reading/writing an INI file Is there any class in the .NET framework that can read/write standard .ini files:  [Section] &lt;keyname&gt;=&lt;value&gt; ...   Delphi has the TIniFile component and I want to know if there is anything similar for C#? Sequence of positive integers such that their reciprocals are in arithmetic progression Word for Negatively Surprising I'm searching for a word representing "Negatively surprising", or "Negatively amused" in an appropriate form. Example: Someone who proclaims he aims to do things in the right way has done something in the completely opposite way.    How could you have done such a thing? That action is very ___.   Said with the purpose of showing the contrast between the expected and the actual, and asking for change to adhere with his set goals, instead of just pointing out disappointment.  It is different from  because it asks there about surprise of being affected by the disappointment. The meaning of surprise here is different. References in externalized pgfplots I was writing on an document with a lot of pgfplots in it. Because of the memory limitation in LaTeX and in order to save some compiling time I tried out the externalize command. With most of the plots it perfectly worked out. But when I use the \ref command, namely \ref{&lt;legendname&gt;} the legend gets lost and instead there is a ??.  I think this question in a way is similar to  and . But no answer to these questions could solve my problem. Even the use of xr and zref packages showed no effect.  Am I just missing something?    MWE of the maindocument:  \documentclass{article} \usepackage{zref-user} \usepackage{xr-hyper} \usepackage{pgfplots} \usetikzlibrary{pgfplots.groupplots} \usepgfplotslibrary{external}  \tikzexternalize \externaldocument{part1}  \begin{document} \input{part1} \end{document}     With part1.tex looking like this:  \begin{tikzpicture}     \begin{groupplot}[       group style= {  columns=3,xlabels at=edge bottom,                 y descriptions at=edge left,                 horizontal sep=2cm,group name=plots},     width=0.4\textwidth,     xtick=data,     legend columns=3]     \nextgroupplot[xlabel=site 1,legend to name=grouplegend]     \addplot coordinates {(1,20)(2,23)(3,24.5)};     \addlegendentry {AaAaA,BbBbB,CcCcC}%     \nextgroupplot[xlabel=site 2]     \addplot coordinates {(1,14)(2,16)(3,17)};     \nextgroupplot[xlabel=site 3]     \addplot coordinates {(1,10)(2,11.5)(3,12.25)};     \end{groupplot}   % Legend     \node at (plots c2r1.north) [anchor=south] {\ref{grouplegend}}; \end{tikzpicture}     I'm writing with MikTeX 2.9 and the latest updates of the packages used. For compiling I used the command pdflatex -enable-write18 &lt;file name&gt;.  I hope the MWE is short enough ;) and some knows how to solve this problem. What does the register keyword do in C language?  I have read that it is used for optimizing but is not clearly defined in any standard.  Is it still relevant and if so, when would you use it? When looking for the path to an executable or checking what would happen if you enter a command name in a Unix shell, there's a plethora of different utilities (which, type, command, whence, where, whereis, whatis, hash, etc).  We often hear that which should be avoided. Why? What should we use instead? $(a_n+a_{n+1})$ is convergent implies $(a_n/n)$ converges to $0$ Let $(a_n)$ be a sequence such that $(a_n+a_{n+1})$ is convergent. Prove that $(a_n/n)$ converges to $0$.   $(a_n+a_{n+1})$ convergent to $L$ means that for all $\epsilon$, there exists $N$ such that for all $n\geq N$, $|L-a_n-a_{n+1}|&lt;\epsilon$, or in other words $L-\epsilon&lt;a_n+a_{n+1}&lt;L+\epsilon$. How to proceed from here? For a moderately complex query I am trying to optimize, I noticed that removing the TOP n clause changes the execution plan.  I would have guessed that when a query includes TOP n the database engine would run the query ignoring the the TOP clause, and then at the end just shrink that result set down to the n number of rows that was requested.  The graphical execution plan seems to indicate this is the case -- TOP is the "last" step.  But it appears there is more going on.  My question is, how (and why) does a TOP n clause impact the execution plan of a query?  Here is a simplified version of what is going on in my case:  The query is matching rows from two tables, A and B.    Without the TOP clause, the optimizer estimates there will be 19k rows from table A and 46k rows from table B.  The actual number of rows returned is 16k for A and 13k for B.  A hash match is used to join these two results sets for a total of 69 rows (then a sort is applied).  This query happens very quickly.  When I add TOP 1001 the optimizer does not use a hash match; instead it first sorts the results from table A (same estimate/actual of 19k/16k) and does a nested loop against table B.  The estimated number of rows for table B is now 1, and the strange thing is that the TOP n directly affects the estimated number of executions (index seek) against B -- it appears to always be 2n+1, or in my case 2003.  This estimate changes accordingly if I change TOP n.  Of course, since this is a nested join the actual number of executions is 16k (the number of rows from table A) and this slows down the query.  The actual scenario is a bit more complex but this captures the basic idea/behavior.  Both tables are searched using index seeks.  This is SQL Server 2008 R2 Enterprise edition. I am currently studying in class 10 and I am unable to do this problem. $$\tan 70 ° -\tan 20° -2 \tan 40° =4\tan 10°$$ Can anybody please help me.  Thanks! Control Cycles/Eevee material nodes and material properties using python? Reviewing suggested edit of own post after completing 20 reviews I've completed 20 suggested edits reviews today. Then, I came across a  and I approved it.   Then, I had a doubt that whether the review count has incremented or not, oh! it's not incrementing. System works fine.  But, take a look at review page,     The edit was already reviewed by one reviewer and then I reviewed it. As I'm the Owner of the post it's enough to approve the edit. But, the review history doesn't show the detail that I had approved it. It's misleading that only one vote of a reviewer who is neither the community user nor the OP nor the moderator, is enough.  So, what should we do in this type of situation?  Is it correct to make OP to review the suggested edit after completing daily limit?  Should we need to display/hide the OP has approved the edit in the review history? If $\sum_{n=1}^{\infty} a_n^{2}$ converges, then so does $\sum_{n=1}^{\infty} \frac {a_n}{n}$ Let $a_1,a_2,a_3,\ldots$ be reals. Prove that if $\sum_{n=1}^{\infty} a_n^{2}$ converges, then so does $\sum_{n=1}^{\infty} \frac {a_n}{n}$.   For this I have shown the case for when $ a_n^{2} \le\frac {|a_n|}{n}$ $\Rightarrow$ $ |a_n|\le\frac {1}{n}$ $\Rightarrow$ $\frac {|a_n|}{n} \le \frac{1}{n^{2}}$ and we know that $\sum_{n=1}^{\infty} \frac {1}{n^{2}}$ converges and hence $\sum_{n=1}^{\infty}\frac {a_n}{n}$ converges by the comparison test. Now considering $ a_n^{2} \ge\frac {|a_n|}{n}$ $\Rightarrow$ $\frac {|a_n|}{n} \le a_n^{2}$ $\rightarrow$ combining the two cases for any n we have: $\frac {|a_n|}{n}\le\frac{1}{n^{2}}+a_n^{2}$ Hence using the comparion test again we know that $\sum_{n=1}^{\infty} a_n^{2}$ converges and $\sum_{n=1}^{\infty} \frac {1}{n^{2}}$ converges hence the sum converges so we can conclude that $\sum_{n=1}^{\infty} \frac {a_n}{n}$ is absoluetly convergent $\Rightarrow$ convergent.  Not to sure if this is correct, any help would be much appreciated, many thanks. How do I fix "Error C1033: cannot open program database"? How can one refute John Searle's "syntax is not semantics" argument against strong AI? My machine is continously making udp dns traffic request. what i need to know is the PID of the process generating this traffic.  The normal way in TCP connection is to use netstat/lsof and get the process associated at the pid.  Is UDP the connection is stateles, so, when i call netastat/lsof I can see it only if the UDP socket is opened and it's sending traffic.  I have tried with lsof -i UDP and with nestat -anpue, but I can't find wich process is doing that request because i need to call lsof/netstat exactly when the udp traffic is sended, if i call lsof/netstat before/after the udp datagram is sended is impossible to view the opened UDP socket.  Call netstat/lsof exactly when 3/4 udp packet is sended is IMPOSSIBLE.  How I can identify the infamous process? I have already inspected the traffic to try to identify the sended PID from the content of the packet, but is not possible to identify it from the contect of the traffic.  Anyone can help me ?  I'm root on this machine FEDORA 12 Linux noise.company.lan 2.6.32.16-141.fc12.x86_64 #1 SMP Wed Jul 7 04:49:59 UTC 2010 x86_64 x86_64 x86_64 GNU/Linux SF Short Story about resetting the world every day Trying to identify a short story. I recall it was quite short, shorter than a novella. I read it within the last few years, but my impression is that it's from the second half of the twentieth century, maybe the sixties. I can't recall if I read it online, in an anthology, or collection. Set in America, a middle-aged man stumbles on a team (maybe like dwarves or gnomes) whose job it is to set up the world for the next day by removing all the previous day's &quot;stuff&quot;, like street furniture? (I know that makes no sense). He disrupts this process and somehow prevents progressing to the next day. I also remember the story was quite lighthearted with the team behaving in a very grumpy way like interrupted workmen. I thought the title was something like &quot;What happened to Tuesday&quot; or similar. For some reason, I thought it was by Keith Laumer, but a search doesn't reveal anything. The trope was similar to &quot;The Tunnel Under the World&quot; by Pohl, and &quot;The Adjustment Team&quot; by Dick, in that reality was constantly changed and controlled by an organisation of some kind. Texmaker generated pdf file not showing the position of cursor I am compiling LaTeX files with Texmaker on Ubuntu 12.04 system.   When I run pdflatex and then view the pdf file (internal), it does not show me the exact place where I am editing on Texmaker i.e. the generated pdf file does not show me the position of the cursor.   But some days before it was working fine. I don't know what causes this problem.  I already tried uninstalling and then reinstalling, I did update and upgrade too. But the problem still persists. Unicode filenames on Windows with Python & subprocess.Popen()