I have two network cards/interfaces: enp5s0 (which is connected to a 15m distant router connected to the internet) and enp4s0 (which is connected to another router not connected to the internet). I would like to use enp4s0 router wifi to extend enp5s0 internet connection. I tried to successfully create a bridged connection but when I connect to enp4s0's wifi I still can't connect to the Internet. Any hint?
I have a laptop running 11.10 with 2 network interfaces, wired and wireless.  Wireless interface connects to the router with DHCP and connects to the internet. Wired interface is connected to a switch. I want the computers on the switch to get their IP addresses from the router not my laptop.     How would I go about setting this up? Bridging the interfaces?
Reporting Mann-Whitney U-Test without homogenity of variance The Mann-Whitney test requires homogeneity of variance if a median difference is suppossed to be statistically significant.  In case homogenity of variance is not met, but the test is significant:  Which aspects of the test can I report? When I create beamer frame, the content is centred in the slide. How do I make the content move to the top of the slide by default? When is it correct to use upper case letters for nouns that may only be unique in a given context? Definition of the Pauli group and the Clifford group There seem to be two definitions of the Pauli group. In Nielsen and Chuang, the Pauli group on 1 qubit is defined as \begin{align*} \mathcal{P}_1 = \{\pm I, \pm iI, \pm X, \pm iX, \pm Y, \pm iY, \pm Z, \pm iZ\} = \langle X, Y, Z\rangle. \end{align*} But in other references, such as ,  \begin{align*} \mathcal{P}_1 = \{\pm I, \pm X, \pm iY, \pm Z\} = \langle X, Z\rangle. \end{align*} The second definition makes more sense in the stabilizer formalism, since we usually only consider the action of Pauli strings of $X$ and $Z$. What bothers me is that by the second definition, the phase gate $S$, which is an element of the Clifford group, results in \begin{align*} SXS^\dagger = Y \notin \mathcal{P}_1. \end{align*} I know that the prefactor $\pm i$ somehow doesn't matter, but can someone justify it from a more mathematical/group-theoretical perspective? Where did the practice of using apostrophes for possessive nouns but not pronouns originate? Where did the practice of using apostrophes for possessive nouns but not pronouns originate?  For example, possessive nouns (both proper and common) are written with a apostrophe before the final s:        Bill’s, not Bills   Sarah’s, not Sarahs   the bear’s, not the bears   the lizard’s, not the lizards      On the other hand, several possessive pronouns do not have apostrophes before the s:        his, not hi’s   hers, not her’s   its, not it’s   theirs, not their’s   ours, not our’s   yours, not your’s      When and where did this usage originate? Was there any technical advantage of this usage? Suppose that $f : \mathbb{C} \to \mathbb{C}$ is entire. Let $\Omega = \{ z : \frac{1}{2} &lt; |z| &lt; 2\}$. Furthermore, suppose that $ \mathcal{F} = \{f(kz) : k \in \mathbb{C}\}$ is a normal family of analytic functions defined on $\Omega$; the family $\mathcal{F}$ is normal on $\Omega$ iff each sequence from $\mathcal{F}$ has a subsequence converging uniformly on compact subsets of $\Omega$. Prove that $f$ is a polynomial.  I'm studying for my qualifying exam in complex analysis, and this question appears on an old exam. Usually, when I want to show that some entire $f$ is a polynomial, I just try to show that there exists some $N$ so that $f^{(k)}(0) = 0$, all $k \ge N$, but I'm having trouble getting that strategy to work here. I've been looking at the sequence $f(\frac{z}{n})$ trying to make something work, but have not had any success.   I would prefer to receive a hint or two, and then I'll try to post my own solution. Thanks in advance! ROC vs Precision-recall curves on imbalanced dataset I just finished reading  discussion. They argue that PR AUC is better than ROC AUC on imbalanced dataset.   For example, we have 10 samples in test dataset. 9 samples are positive and 1 is negative. We have a terrible model which predicts everything positive. Thus, we will have a metric that TP = 9, FP = 1, TN = 0, FN = 0.  Then, Precision = 0.9, Recall = 1.0. The precision and recall are both very high, but we have a poor classifier.  On the other hand, TPR = TP/(TP+FN) = 1.0, FPR = FP/(FP+TN) = 1.0. Because the FPR is very high, we can identify that this is not a good classifier.  Clearly, ROC is better than PR on imbalanced datasets. Can somebody explain why PR is better? Determining the Orbits/Orbit Space of $O(3)$ on Real 3 by 3 Traceless Symmetric Matrices Let $O(n)$ be the set of $3 \times 3$ orthogonal matrices, and $S$ be the set of traceless real symmetric $3 \times 3$ matrices.  Now  $O(n)$ will act on $S$ by conjugation. Note that by the spectral theorem $ \forall A \in S$ in the orbit of $A$ there is a diagonal matrix $D=diag(\lambda_1, \lambda_2,\lambda_3)$ with $\lambda_1\le\lambda_2 \le\lambda_3 $.  Determine the all the orbits of the action &amp; the orbit space of the action.  What I've done:  Since all elements of $S$ are diagonlizable that the orbit of any element should be the orbit of its' diagonalized form because $\forall A \in S,   \exists P \in O(3)$ st  $PAP^t=D $ with $D$ a diagonal matrix and moreover for any other  $Q\in O(3)$ we get $QDQ^t=QPAP^tQ^t=(QP)A(QP)^t=RAR^t$.   And so would that imply the orbit space is just the set of traceless diagonal matrices as $tr(QDQ^t)=tr(DQ^tQ)=tr(Q)$ (cyclic property of trace) and $Q\in S$.  Any help is appreciated. Subdivision Surface not making things smooth as they are in the tutorial I am following Does Reincarnation allows skills to be passed into other classes I'm mainly asking this for Disgaea: Afternoon of Darkness, given I have enough Mana to reincarnate a character into 4 different types of Mages (Green, Blue, Red, Star), a Cleric and then a Warrior, would the Warrior have all the spells learned from the previous classes? referring to Eqn. 1a) and 1b) in a sentence as eqn. (1) I am trying to solve this exercise from Royden's 3rd edition.     The question is as follows: Let $f$ be a real-valued function defined for all real numbers. Show that the set of points at which $f$ is continuous is a $G_{\delta}$.    Let $$A_n = \{y : \text{there is a }~\delta_y \gt 0 : |f(s)-f(t)|\lt 1/n ~ \text{whenever}~ s,t \in (y-\delta, y+\delta)\}\;.$$     Then by the definition of open sets, $A_n$ is open.     To complete the proof, I need help in showing that $f$ is continuous at say $x$ if and only if $x\in \cap A_n$.     If $f$ is continuous at $x$, the there is a $\delta \gt 0$ such that $|f(x) - f(a)| \lt 1/n$ whenever, $x\in (a-\delta, a+\delta)$. so $x \in A_n$ son it must be in $\cap A_n$.  Thanks. In Harry Potter and the philosophers stone Harry was "receiving" his letters in a way that was so labour intensive. First, one was sent in the mail, and the others where then sent, either shoved into the letterbox or through the door cracks. It then it got, "out of hand," as twenty four letters found their way inside the house. The letter sender (Minerva, I do believe, Deputy Headmistress) must, obviously have known they were not getting to Harry, so why keep sending them? I cannot even believe Minerva sending more than thirty letters! Why not either,  A) Send the letters directly to Harry  OR  B) Show up at the house, to explain everything.  Why not do a more logical way of sending/explaining Harry's being? I'm doing some architectural cleanup that involves moving a bunch of classes into different projects and/or namespaces. Currently I'm moving the files by hand, building, and then manually adding using Foo statements as needed to resolve compilation errors. Anyone know of a smarter way of doing this? (We're a CodeRush and Refactor! shop, but I'd be interested to hear if Resharper has support for this) This dreaded issue started at some time after upgrade to OS X (Yosemite) 10.10.3. accountsd uses about 60% CPU constantly, making the laptop hot and noisy.  I'm not using iCloud at all.  Killing it doesn't help, because it starts again quickly.  Probably related question, but it's about iOS: Flag as Broken Link I keep finding broken links in posts, currently I add a comment in the hope someone will return to update it or if I find a link I edit the answer.   I imagine this will only increase over time so I wonder if there could be a standard way to manage this?  My idea is adding a new flagging reason like "contains broken links", then it will go to a review queue where people will be able to have a look and fix the broken links. Is “might could” a correct construct? How is canonicity of derivative works determined for Star Wars? Intuitive explanation of the bias-variance tradeoff? I am looking for an intuitive explanation of the bias-variance tradeoff, both in general and specifically in the context of linear regression. Recently I had to change the folder permissions of /usr folder. Now the whole sudo is not working. If I try to update my system using this command:  sudo apt-get update   I get the following message:  sudo: /usr/lib/sudo/sudoers.so must be only be writable by owner sudo: fatal error, unable to load plugins   So I tried to change the folder permissions by opening Nautilus as root by using this command  gksudo nautilus   But nothing happened. Nautilus didn't open. This is an emergency as the whole of sudo is not working. when I tried searching the solution from Google many suggested re-installation. I don't prefer re-installation. so is there any other solution?