MikTeX package manager unable to download any packages I used to be able to download packages but recently I have been unable to do so for quite sometime now.  It gives the message:  get proxy host by name failed in tcp_connect()   I don't remember doing anything different except that I have moved from another location and I am using another broadband connect, but I am not sure if it is related to this problem.
Package repository down, how to relocate? I would like to use the function of TeXnicCenter 1.0, where is automatically downloads missing packages used. The problem is, that the repository it wants to download from does not exist anymore (the one on piotrkosoft.net).  How do I get TeXnicCenter to try with another repository?
How does "Reputation" work? Two ethernet ports on motherboard. How can I get double the bandwidth? Direct Question:  My evga classified motherboard has two ethernet ports.  I want to use them simultaneously to improve the speed of a remote connection.  (Yay for programming remotely).  How do I do this?  At present /etc/network/interfaces:  auto lo eth0 eth1  iface lo inet loopback  iface eth0 inet static address 192.168.1.202 netmask 255.255.255.0 gateway 192.168.1.2  ifrace eth1 inet static address 192.168.1.201 netmask 255.255.255.0   What should I change? Is there a package I need to install to bond the two channels.  Background: I do a lot of remote computing both from home to office and office to home.  But (to take my ISP out of the equation), let's frame the question as if I'm really just interested in maximizing the file transfer rate between two computers on the same (local) network.  Both boxes have dual ethernet motherboards.  Using a simple Linksys WRT54GS as a 5 port switch (ignore wireless and isp) -- how do I maximize the transfer rates between the computers?  Please Note: I'm not interested in load balancing -- Correct me if I'm wrong, but I want to bond the two channels together so that the box appears as if it has one connection that's twice as fast. Give us better search-by-score syntax Find all Facebook comments on external websites Is there any way to find all comments on external websites connected with a Facebook account? Let's say I want to find all my Facebook activity on external pages based on profile URL; is there any way to do this? What is "the ground"? meaning of so much as In the following sentence, I want to know if I've understand the correct meaning or not:     This version holds that the wave function does not so much describe the state of the physical system as the state of our knowledge of the system.    Can we say that it means the wave function describes the state of our knowledge  of the system more than it describes the state of the physical system  ?  It is worth noting that in the Cambridge Dictionary, we read:  not so much sth as sth ​ If you say that something is not so much one thing as something else, you mean it is more the second thing: They're not so much lovers as friends. I don't feel angry so much as sad. "It's time something was / were done about the problem." It's time something was done about the problem.   It is a sentence from Murphy's "Grammar". Using was confused me, for me it should be were. It looks like this clause is in subjunctive mood&mdash;something that is unreal / imaginary, and in that case you always use were for any object.  Unless, of course, it is not the subjunctive mood, what would knock me down. How can I make Windows Paint save by default as JPEG format? For subspaces, if $N\subseteq M_1\cup\cdots\cup M_k$, then $N\subseteq M_i$ for some $i$? I have a vector space $V$ over a field of characteristic $0$. If $M_1,\dots,M_k$ are proper subspaces of $V$, and $N$ is a subspace of $V$ such that $N\subseteq M_1\cup\cdots\cup M_k$, how can you tell $N\subseteq M_i$ for some $i$?  I was first trying to show it just in the case $N\subseteq M_1\cup M_2$, and hoping to extend it to finitely many $M_i$. If either of the $M_i$ contains the other, the claim follows, so I suppose neither $M_i$ contains the other.   In hopes of a contradiction, I suppose $N\not\subseteq M_1$ and $N\not\subseteq M_2$, Picking $x_1\in N\setminus M_1$ and $x_2\in N\setminus M_2$, I'd have $x_1+x_2\in N\subseteq M_1\cup M_2$. The only thing I could conclude was that actually $x_1,x_2\notin M_1$ and $x_1,x_2\notin M_2$, which seems like a dead end. What's the right way to do this? When hyperref is loaded I receive the following error:     TeX capacity exceeded, sorry [input stack size=5000].   However, when I remove hyperref package it compiles successfully. I traced it back and found that \maketitle causes the error but don't know how to fix it. Is there any way to use hyperref in my setup.   Code:       %!TEX TS-program = xelatex     \documentclass[journal,transmag,]{IEEEtran}      \usepackage[hyphens]{url}     \usepackage{hyperref}      \usepackage{xunicode}      \usepackage{fontspec}      \usepackage{polyglossia}     \setmainlanguage{english}     \setotherlanguage{arabic}     \newfontfamily\arabicfont[Script = Arabic]{Amiri} % Replace 'Simplified Arabic' with a font from your system       \begin{document}     \title{A Very Nice Title}      \author{\IEEEauthorblockN{             John Doe\IEEEauthorrefmark{1}}%,~\IEEEmembership{Member,~IEEE}         \IEEEauthorblockA{\IEEEauthorrefmark{1}My address}         % &lt;-this % stops an unwanted space         \thanks{Manuscript received mm dd, 20xx; revised mm dd, 20xx.               }     }      % The paper headers     \markboth{headers...}%     {Shell \MakeLowercase{\textit{et al.}}: Bare Demo of IEEEtran.cls for IEEE Transactions on Magnetics Journals}      \IEEEtitleabstractindextext{%         \begin{abstract}My Abstract.\end{abstract}          % Note that keywords are not normally used for peerreview papers.         \begin{IEEEkeywords}             Key 1, Key 2     \end{IEEEkeywords}}      \maketitle       \IEEEdisplaynontitleabstractindextext     % \IEEEdisplaynontitleabstractindextext has no effect when using     \IEEEpeerreviewmaketitle       \section{Introduction}     English Text      \begin{Arabic}      السَلَامُ عَلَيكُمْ     \end{Arabic}       \end{document} Turning off "Update page numbers only" in Word When I update the fields document-wide (Ctrl + A, then F9) in a Word document that has a table of contents, a dialog appears asking if I want to update page numbers only, or update the entire table. I never want to update page numbers only if the document headings have changed, nor will I ever.  (Apparently this is given as an option in case someone has manually changed an automatically generated ToC, which is almost always a really bad idea.)   Unfortunately, "Update page numbers only" is the default selection in the dialog, which means that I have to select the other option every time. I update the fields all the time when I'm working in a document that has figures and cross-references, so this is an annoying extra step I'd really like to get rid of.   Is there any way to tell Word to stop asking me this stupid unnecessary question? Is there a general method (which can be implemented by hand) to finding the $n$-th roots of $2 \times 2$ matrices? Is there a similar method for a general $m \times m$ matrix? (for $n &gt; 1$ and $n\in\mathbb{Z}$) I know how to solve "simple" recurrence relations. For instance, say you have:  $$c_0 = 20$$ $$c_1 = 30$$ $$c_n = 3 c_{n-1} - 2 c_{n-2}$$  We can write the characteristic equation as:  $$3x^{n-1} - 2x^{n-2} = x^n$$  Solving this with $n=2$, we get $x = 1$ or $x = 2$. This lets us write the relation $c_n = \alpha_1 1^n + \alpha_2 2^n$, and we can solve for $\alpha_1$ and $\alpha_2$ with the initial states $c_0$ and $c_1$.  However, this depends on the fact that $3x^{n-1} - 2x^{n-2} = x^n$ has two roots.  Now, I'm stuck on another problem where the characteristic equation has fewer roots than terms.  Say I have this recurrence relation instead:  $$a_0 = 0$$ $$a_1 = 2$$ $$a_2 = −1$$ $$a_n = 9a_{n-1} - 15a_{n-2} - 25a_{n-3}$$  The characteristic equation would be:  $$9x^{n-1} - 15x^{n-2} - 25x^{n-3} = x^n$$  However, solving with $n=3$, we only get two roots: $x=-1$ or $x=5$. There are not enough roots to write a relation in the form of $a_n = \alpha_1 r_1^n + \alpha_2r_2^n + \alpha_3r_3^n$. How do I proceed? Getting a domain name off of the blacklist I have a friend who purchased a domain name recently that he found out (after buying it) is apparently blocked by many corporate firewalls or proxies b/c it's been tagged as porn by the blacklist db they're using.    Are there any common agencies he can appeal to in order to get the domain name off the black lists?  It's not just one corporation, either, he's looking at marketing a subscription-based service to a certain industry, so any contacting a particular firewall/proxy admin and have them manually update the blacklist won't scale well.  Thanks in advance. Paul Assigning values to divergent series I have been looking at divergent series on wikipedia and other sources and it seems people give finite "values" to specific ones. I understand that these values sometimes reflect the algebraic properties of the series in question, but do not actually represent what the series converges to, which is infinity. Why is it usefull to assign values to divergent series?  The only theory I could come up with, is this:  Say you have 2 divergent series, series' A and B, and you assign each a value,   Series ($A= \sum_{n=0}^\infty a_n$), which I assigned the value Q  and series ($B= \sum_{n=0}^\infty b_n$ ), which I assigned the value P  But it just so happens that series $C=A-B= \sum_{n=0}^\infty (a_n-b_n)$ converges. Could that imply that the actual value of series $C$ is the difference of the two assigned values to $A$ and $B$, that is $\sum_{n=0}^\infty (a_n-b_n)=Q-P$ ?  If so, then that would make some sense to me, as to why people sometimes assign values to divergent series. sum numbers in different lines in shell i have 8000 lines similar to this   &lt;Flow flowId="1" timeFirstTxPacket="+0.0ns" timeFirstRxPacket="+924100.0ns" timeLastTxPacket="+199984927558.0ns" timeLastRxPacket="+199675473275.0ns" delaySum="+2287566662167.0ns" jitterSum="+65280162191.0ns" lastDelay="+3511349483.0ns" txBytes="161956" rxBytes="116536" txPackets="3125" rxPackets="2251" lostPackets="640" timesForwarded="0"&gt;   and what i need to do is summing rxPackets in each line together and txPackets too   i mean total sum of them in 8000 lines  thanks in advance  &lt;Flow flowId="1" timeFirstTxPacket="+0.0ns" timeFirstRxPacket="+924100.0ns" timeLastTxPacket="+199984927558.0ns" timeLastRxPacket="+199675473275.0ns" delaySum="+2287566662167.0ns" jitterSum="+65280162191.0ns" lastDelay="+3511349483.0ns" txBytes="161956" rxBytes="116536" txPackets="3125" rxPackets="2251" lostPackets="640" timesForwarded="0"&gt;  &lt;Flow flowId="2" timeFirstTxPacket="+3000000.0ns" timeFirstRxPacket="+3254190.0ns" timeLastTxPacket="+199988489445.0ns" timeLastRxPacket="+199631899307.0ns" delaySum="+12081144328484.0ns" jitterSum="+105606015634.0ns" lastDelay="+9407845452.0ns" txBytes="251896" rxBytes="124840" txPackets="4867" rxPackets="2413" lostPackets="1757" timesForwarded="0"&gt;  &lt;Flow flowId="3" timeFirstTxPacket="+4000000.0ns" timeFirstRxPacket="+4254098.0ns" timeLastTxPacket="+199971756470.0ns" timeLastRxPacket="+198959480315.0ns" delaySum="+5150205600987.0ns" jitterSum="+74009967633.0ns" lastDelay="+9862217799.0ns" txBytes="163044" rxBytes="90532" txPackets="3150" rxPackets="1751" lostPackets="1013" timesForwarded="0"&gt; Find   $$\lim _{x\to \infty }x\Big(\ln\left(x+1\right)-\ln x\Big)$$  Here's how I do it:  $$x\Big(\ln(x+1)-\ln x\Big) = x\Bigg(\ln(x(1+\frac{1}{x}) - \ln x\Bigg)$$ $$x\Big(\ln x + \ln(1+\frac{1}{x}\Big)-\ln x =x\ln\Big(1+\frac{1}{x}\Big)$$ $$\ln\Bigg( \Big(1+\frac{1}{x}\Big)^x \Bigg) \rightarrow \ln 1^\infty = 0$$  What am I doing wrong? The answer is supposed to be $1$, but I get $0$. Testing AuraHandledExceptions? It seems like when I call getMessage on a thrown AuraHandledException, I see "Script-thrown Exception" instead of the message that I have set. Any idea why this may be happening?  Controller:       @AuraEnabled     public static Conversation__c makeConversation(String tonum, String objid)     {         if (tonum.length() != 10)             throw new AuraHandledException('ToNumber length invalid.');     }   TestController:  @isTest     static void testMakeConversationInvalidTo()     {         Boolean testPass = false;         String fromNumber = '1234567890';         String toNumber = '1';          List&lt;ConversationController.ConversationWrapper&gt; test =    ConversationController.getConversations();         System.assertEquals(0, test.size());         try {             ConversationController.makeConversation(toNumber, '0');         } catch (AuraHandledException e) {             System.debug(e.getMessage());             System.debug(e.getTypeName());             System.assert(e.getMessage().contains('ToNumber length invalid'));             testPass = true;         }     }   Return:  16:26:28:477 USER_DEBUG [320]|DEBUG|Script-thrown exception 16:26:28:477 USER_DEBUG [321]|DEBUG|System.AuraHandledException Is "aren't I" correct grammar? How to remove GNOME Shell from Ubuntu 20.04 LTS to install other desktop environment from scratch?