So I have monitors stacked vertically.  Is there away to get my cursor to move between the monitors by going to the top of the lower monitor to get to the upper monitor?  Right now I have to go to the right of the primary to get to the other monitor.  I wonder if there's some third party app or system preference setting that I can set.
When I have my external monitor hooked up, I access it by mousing off the left hand side of my Macbook display. Can I switch this so that I can access the external by mousing off to the right of My Macbook display?   The reason I ask, is my monitor is on the right side of my macbook, and it's unintuitive to mouse left to get to a screen on the right.
I normally write using the American English forms, but for some particular words, I tend to naturally write it in the British manner (like with the word favourite rather than favorite).  Is it wrong to mix both styles? If not *wrong*, does it looks weird? How to remove duplicate values from a multi-dimensional array in PHP How can I remove duplicate values from a multi-dimensional array in PHP?  Example array:  Array (     [0] =&gt; Array     (         [0] =&gt; abc         [1] =&gt; def     )      [1] =&gt; Array     (         [0] =&gt; ghi         [1] =&gt; jkl     )      [2] =&gt; Array     (         [0] =&gt; mno         [1] =&gt; pql     )      [3] =&gt; Array     (         [0] =&gt; abc         [1] =&gt; def     )      [4] =&gt; Array     (         [0] =&gt; ghi         [1] =&gt; jkl     )      [5] =&gt; Array     (         [0] =&gt; mno         [1] =&gt; pql     )  ) The absence of some strings in Transifex I cannot find these strings using Transifex:      (name hidden from user)       Regards,   {site name} Moderation Team          There is  and it seems like this string does not work ok (it is translated and approved, but, unfortunately, not rendered on the site).   All of the strings are taken from Moderator Private Messages interface.   Could you please fix it? If $\alpha$ is an algebraic element and $L \subset K$ are both field, does the polynomial ring $L[\alpha]$ is also a field?  I am trying to prove that the ring of fraction $L(\alpha)$ is equal to $L[\alpha]$. To do this, I use an exercise done in class : Let $K$ a field, $\alpha \in K$ and $L$ a subfield of $K$. Then $L(\alpha)$ is the smallest subfield of $K$ containing $L$ and $\alpha$.  Is anyone could help me? Ubuntu software not showing any software How many ways can $b$ balls be distributed in $c$ containers with no more than $n$ balls in any given container? Opinions on closing an older question as a duplicate of a newer question What's everyone's opinion on closing an older question as a duplicate of a newer one, if the newer one is clearly the better resource? I'm looking at a special case right now, where the two were posted by the same person; the  was migrated to SU before a commenter pointed out it was a . Is it considered good practice to close the older as a duplicate of the newer?  More generally, is it ok to do that for separate questions posted by different people, if the older question went unanswered but the newer has a good answer?  (I should probably mention I saw , but I think this is separate) What happens when the Runner stack is empty? When the corporation R&amp;D is empty the corporation loses.  What happens when the Runner's stack is empty?    I think that: He must finish the game with only the cards on the table.  or  I doubt that: He reshuffles the heap into a new stack. How can I prevent false score reports to global highscore tables? Browser and mobile games commonly have global highscore tables. It's also common for those tables to contain scores of 2,147,483,647 &mdash; where people have figured out the webservice call that reports scores and used it to record a fictitious score.  For simple puzzle games, we can defend against this by including a record of every move the player made (and any random seeds used to generate the level) with the score-reporting call. The entire game can then be reproduced and verified on the server.  However, this quickly becomes infeasible for anything larger than Pac-man.  How else can cheating of this kind be prevented? Please let me know how to change the size of the camera view. The red dotted line of the square is too small for me. Introduction to string theory I am in the last year of MSc. and would like to read string theory. I have the Zwiebach Book, but along with it what other advanced book can be followed, which can be a complimentary to Zwiebach. I would like a more mathematically rigorous book or lecture notes along with Zwiebach.   Specifically, mention whether the book discusses string theory   Rigorously? Intuitively?   What's the scope of the book? Does it cover the advanced materials, e.g. Matrix string theory, F-theory, string field theory, etc. Maybe even String Phenomenology? Graphics issues after/while installing Ubuntu 16.04/16.10 with NVIDIA graphics I installed or upgraded to Ubuntu 16.04, but I'm having some problems with my graphics card.   The display is blank The display flickers Items on the screen do not display correctly Certain programs complain of graphics issues The computer boots to low-graphics mode Your specific issue may not be here, but try the solutions described in the answers anyway.   This question is very broad, but each one of these issues likely has one solution.    If you are experiencing a login loop, check the last part of my answer.    If you experience one of the listed issues and have your own solution (mine didn't work, or there's a faster way), feel free to post another POLITE answer, describing your problem and how you fixed it.    Those attempting to install Ubuntu, please refer to the section titled: If you are unable to enter a TTY or are trying to install Ubuntu. Let $R$ be a UFD and $r\in R$ irreducible. If $S=R-(r)$, why is $S^{-1}R$ a PID?   I've finished proving the integral domain part, which was pretty easy.  How to prove it's principal? consider $R \subset S^{-1}R \subset F$, where $F$ is the field of fractions of $R$?  thank you! :p Copy a large data from sql query result In my sql server 2008, after running the query the data return is very huge say in millions. I tried copying but it gives an exception sql memory error. Can you let us know how can i copy the entire data and paste it into excel.  I don't want to export it to txt file as the data is not getting aligned. So i want to manually copy and paste it into excel. Please let me know the solution for thhis Why are the number of false positives independent of sample size, if we use p-values to compare two independent datasets? If I run the R code below, it will generate two independent vectors then test them to see if they are related in some way (i.e. p-value &lt; 0.05).  If I repeat this 1,000 times, then 50 of these (5%) will have a false positive, with a p-value &lt; 0.05. This is a type 1 error.  If we increase sampleSize to 1000, or even 100,000, the results are the same (5% false positives).  I am struggling to understand this, as I would have thought that if we collected enough samples, the chance of a false positive would drop towards 0 (just like correlation).  So, I guess my question is: "How is it possible that the number of false positives, based on p-values generated from comparing two independent datasets, be independent of sample size?".  # R code to demonstrate that with a large dataset, we can still  # get significant p-values, purely by chance.  # Change this to 1000, and we still get the same number of false positives (50, or 5%). sampleSize = 20  cat("Sample size:",sampleSize,"\n")  set.seed(1010093) n=1000 pValues &lt;- rep(NA,n) for(i in 1:n){     y &lt;- rnorm(sampleSize)     x &lt;- rnorm(sampleSize)     pValues[i] &lt;- summary(lm(y ~ x))$coeff[2,4] } # Controls false positive rate fp = sum(pValues &lt; 0.05) cat("Out of ",n," tests, ",fp," had a p-value &lt; 0.05, purely by by chance.\n",sep="")  ----output---- Running "true positives - none.R" ... Sample size: 1000  Out of 1000 tests, 52 had a p-value &lt; 0.05, purely by by chance. Error while writing strcat() using pointers As Scott Myers wrote, you can take advantage of a relaxation in C++'s type-system to declare clone() to return a pointer to the actual type being declared:  class Base {     virtual Base* clone() const = 0; };  class Derived : public Base {     virtual Derived* clone() const };   The compiler detects that clone() returns an pointer to the type of the object, and allows Derived to override it to return a pointer to derived.  It would desirable to have clone() return a smart pointer that implies transfer of ownership semantics, like the following:  class Base {    virtual std::auto_ptr&lt;Base&gt; clone() const = 0; };  class Derived : public Base {     virtual std::auto_ptr&lt;Derived&gt; clone() const; };   Unfortunately, the relaxation of the conventions does not apply to templated smart pointers, and the compiler will not allow the override.  So, it seems I am left with two options:   Have clone() return a "dumb" pointer, and document that clients are responsible for disposing of it. Have clone() return a smart base pointer, and have clients use dynamic_cast to save them to a Derived pointer if they need it.   Is one of these approaches preferred?  Or is there a way for me to eat my transfer of ownership semantics and have my strong type safety too? notation of distribution I have a question:      Does  $$N(0, x)$$ mean a normal distribution with mean $0$ and variance $x$? Or standard deviation $x$?   The notation seems ambiguous sometimes. Proof of property of abelian group I want to show that $\forall x$,$y\in G$, $(xy)^2=x^2y^2 \iff G $ is an abelian group.  Proof of the backward direction seems easy enough:  Assume $G$ is an abelian group. Then consider $(xy)^2=(xy)(xy)$. By associativity, $(xy)(xy)=xyxy$. Since $G$ is abelian, $xyxy=xxyy=x^2y^2$.   Proof of the forward direction I attempt by contrapositive:  That is, assume $G$ is not an abelian group. Then, consider $(xy)^2=xyxy$ as above. Yet, $xyxy\neq xxyy=x^2y^2$ since we no longer have commutativity.  Is this proof by contrapositive completely correct? From Wikipedia: Fermi was known for his ability to make good approximate calculations with little or no actual data, hence the name. One example is his estimate of the strength of the atomic bomb detonated at the Trinity test, based on the distance travelled by pieces of paper dropped from his hand during the blast. Fermi's estimate of 10 kilotons of TNT was remarkably close to the now-accepted value of around 20 kilotons, a difference of less than one order of magnitude.  I have not been able to find any references explaining how he made this calculation. Please provide a reference or an example calculation.  See also: