I heard from some sources that some applications are discarded before the professors in the committee even looked at it, based on GPA. How true is this? How do they equalize GPAs from different colleges across the world? Isn't this practice flawed?
I am a senior undergraduate (electrical) engineering student, exceedingly interested in physics. 4 years ago when entering university, for some reasons (better: illusions) I chose engineering as my major, while I was interested (and also really knowledgeable) in physics . Soon after the first semester I realized that I've decided wrong, and I must have chosen physics.  Since our university is a technical institute and does not have a strong physics department I decided to study physics on my own, without changing my major.But I took and passed the basic graduate physics courses (advanced quantum mechanics, advanced statistical mechanics, electrodynamics I &amp; II), have done a few research projects and had a paper published (maybe 1 more in the future). I have explored lots of research areas in physics and I think I have a good potential for doing research.  While concentrating on physics, I was inattentive to EE courses. Today, while searching for graduate programs, I saw that some schools require a minimum GPA, usually 3. I just calculated my GPA and found out that it is 2.95!   Do all universities have a GPA threshold?  Since I'm changing my major and also have a good GPA in graduate physics courses, is there any way I can compensate for my (very) low electrical engineering GPA? (like by taking subject GRE, etc.) If I first (somehow) get a masters degree in physics and then apply for a PhD, can I throw away this electrical engineering GPA in my PhD application ?   Any other suggestion is warmly appreciated.
Why is there a magnetic field around a magnet if there are no charges moving? How does Edo Tensei Madara get back his Rinnegan? Madara gave his Rinnegan to Nagato. But after Kabuto brings him back using Edo Tensei, he still has the Rinnegan. How is this possible? How can I prevent inline math formulas from overflowing into the margin? When I compile my document in LaTeX, some formulas in the document in math mode, between $ $, go into the right margin area beyond all the text.  Is there a way to fix this aesthetic problem? How to change horizontal alignment of \frac? Typing \frac{W+W^*}{2} gives a fraction in which the denominator appears to the eye to be in the wrong position. Is there a way to correct this, i.e. place the 2 in under the + (without using arbitrary negative spacing)? How to distribute proprietary Mathematica code Proof that disjoint cycles commute I'm trying to prove that in a symmetric group two disjoint cycles commute. But I suspect that something is not right about my proof (a sense of vagueness). Some hints would be appreciated.  Here's my proof:  Let $\sigma=(s_1 s_2 ... s_n)$, $\tau=(t_1 t_2 ... t_m)$ for some integers $m, n$. That is, $s_i \neq t_j$ for any $i \in [1, n]$, $j \in [1, m]$. Now, $\sigma\tau=(s_1 ... s_n)(t_1 ... t_m)$ is a cycle of disjoint permutations, which cannot be represented by any other disjoint permutations. Thus $\sigma\tau=\tau\sigma$. Why is lock(this) {...} bad? The  says that public class SomeObject {   public void SomeOperation()   {     lock(this)     {       //Access instance variables     }   } }  is &quot;a problem if the instance can be accessed publicly&quot;. I'm wondering why? Is it because the lock will be held longer than necessary? Or is there some more insidious reason? How can Zeno's dichotomy paradox be disproved using mathematics? A brief description of the paradox taken from :     Suppose Sam wants to catch a stationary bus. Before he can get there, he must get halfway there. Before he can get halfway there, he must get a quarter of the way there. Before traveling a quarter, he must travel one-eighth; before an eighth, one-sixteenth; and so on.      This description requires one to complete an infinite number of tasks, which Zeno maintains is an impossibility. This sequence also presents a second problem in that it contains no first distance to run, for any possible (finite) first distance could be divided in half, and hence would not be first after all. Hence, the trip cannot even begin.      The paradoxical conclusion then would be that travel over any finite   distance can neither be completed nor begun, and so all motion must be   an illusion.   How can this be disproved using math, as obviously we can all move a walk from one place to another? How to Tail -f output with colors using only Awk and show the rest of the output? I was able to do a tail -f output with colors using the awk command. But I'm unsure how to output the rest of the log as it seems to be filtering only those 2 lines. I also want to see the other lines as the log is written.  What do I need to put in the awk command to show the rest of the output?  Image of my issue. The red text above is without using awk and displays the entire tail -f log. And below that is the same command with the awk color filtering. Foreign words reborrowed back into English Wikipedia mentions several English words that have been :   Anime comes from animation and has been reborrowed into English to mean Japanese-style animation. Puroresu comes from professional wrestling and is a term for Japanese-style professional wrestling. Kosupure comes from cosplay (an abbreviation of costume play) and refers to the practice of dressing in costumes of anime and video game characters.    Do you know other examples of word reborrowings from Japanese or other languages back into English, or vice versa? I'm curious why PCBs have one square pad in row for 0.1" headers. What is purpose of putting one square pad? What it indicates? Can you push more amps through square pad than round? Test -n gives unexpected result I understand test -n &lt;expression&gt; to return false if the expression evaluates to a string length of greater than 0.  Why then does the following happen?  Macbook:~ echo ${#undeclared_variable} 0 Macbook:~ test -n $undeclared_variable &amp;&amp; echo Foo Foo   Bash 4.x  My expectation is that since test -n $undeclared_variable should evaluate false, that Foo should not be echoed.  If I use [[  ]] instead of test, it works as expected. I'm well aware of the combinatorial variant of the proof, i.e. noting that each formula is a different representation for the number of subsets of a set of $n$ elements. I'm curious if there's a series of algebraic manipulations that can lead from $\sum\limits_{i=0}^n \binom{n}{i}$ to $2^n$. Whats the difference between Unix, Linux and Ubuntu? What is Unix, Linux, Ubuntu?  Are they the same thing or different versions or completely different stuff?  This has always made me confused, any explanation would be great. I use Lasso logistic regression in order to identify a smaller subset of important variables. I start with N=51 (28/23) and 32 predictors.   So far it looks pretty promising, because I can identify four important predictors in my optimal model.   Now I would like to take those four predictors and examine them along with some control variables in a standard logistic regression.   My question is, does that analysis strategy make sense? Is there a better way to include controls or other variables that might be interesting?  For a better understanding:   Identify important variables via Lasso logistic regression Do further analysis including identified predictors and other control variables using standard logistic regression (using AIC to check model fit) What command should I use to rotate wood to S,N,W,E,D and U?  I read the entire world edit guide and tried some things but all the results are not satisfactory. Draw power from a portable mobile charger to power circuits How are the age restrictions followed by ICC for under 19 cricket tournaments? I have some doubts under this topic,   Can a player aged 19 play under 19 international cricket match? (Since 19 is not under 19) Consider a player having birthday during the series/tournament. How the age will be calculated for him? What is the reasoning behind the design decision to allow users to create a display name which matches another existing users exactly?    This is opposed to the common practice of enforcing unique user names, and I'd really like to learn something. How would you count occurrences of a string (actually a char) within a string? I am doing something where I realised I wanted to count how many /s I could find in a string, and then it struck me, that there were several ways to do it, but couldn't decide on what the best (or easiest) was.  At the moment I'm going with something like:  string source = "/once/upon/a/time/"; int count = source.Length - source.Replace("/", "").Length;   But I don't like it at all, any takers?  I don't really want to dig out RegEx for this, do I?  I know my string is going to have the term I'm searching for, so you can assume that...  Of course for strings where length > 1,  string haystack = "/once/upon/a/time"; string needle = "/"; int needleCount = ( haystack.Length - haystack.Replace(needle,"").Length ) / needle.Length;