Getting into grad school with a low gpa I'm new to these forums, but I thought I'd take a stab at asking about my situation. I have two BS degrees, one in electrical engineering and the other in physics. I'm wanting to go to grad school in either physics, engineering, or something in between. My problem is that I have a 2.3 cumulative gpa, however I do have a slew of other things going for me that I was wanting to get opinions on how much they would help with admissions.  I've done research in plasma physics for over 2 years. It was due to that project that I was place into the McNair Scholars program and was given the opportunity to travel overseas to perform research at a European fusion energy lab last year. I've graduated, but was hired by the same research group to perform data analysis work for the project. I learned alot about experimental physics: solid state particle detectors, vacuum chambers, spectrum analysis, linux operation systems, and so on.  In my engineering major I become involved with a team that built, tested, programmed and will be launching an amateur radio satellite. I worked on the power systems of the craft, and learned alot about surface mount soldering, solar cells and battery charging power circuits, etc. I'm also planning the building and programming of a rotating machinery for our ground antennas. Out of this might come the chance to work with a mechanical engineering group launching their own satellite.   I also work in the power industry, currently as an intern, where I've done a few projects related to internet monitoring of devices attached to power lines, learned pcb design skills here. My job also had me write a paper (so I'd be first author there) related to cyber security that will be going to a conference later this year. Not sure if this will help specifically since that work isn't necessarily what I want to do graduate research in.   I'm currently taking a year off to work, pay off debts, and study for good scores on the general and subject GRE's. I was also plannig on taking 1 or 2 grad courses and planning to ace them. My bad grades came from my first year courses, not from my junior and senior in-major courses. Come application time I can get plenty of good recommendation letters from various sources (not just in my university). I know my gpa is going to hurt me, but I was wondering if anyone has any experience about how much things I've done outside the classroom would offset that. Thanks for any opinions that might be helpful. Sorry for the wall of text.
How do you get a bad transcript past Ph.D. admissions? I have a master's degree in International Studies, and a double major with Computer Science from undergrad.  My transcripts suck.  There's no other way to dress it up.  I have pretty good teaching experience, and my GRE scores are awesome, and I suspect my recommendations are as bland as everyone else's.  Basically, to an admissions committee, I suspect I'm the model of a student who is probably smart enough but didn't work hard enough.  I want to do a Ph.D. in Political Science, but the response from my applications is looking pretty grim.  Am I permanently out of the running, or is there something I can do for the next few years which will help to counterbalance my unfavorable GPA?
How to factory reset without data loss and undue pain? How do I check if a package is installed on my server? I recently installed Ubuntu Server edition 13.10 (Saucy Salamander). But I have run into a bit of problem. At the end of the installation, it asks about several extra packages whether you want them or not, like OpenSSH server and virtual machine host. Here's what I'm looking at:  Now, my problem is that I can't remember if I have checked the &quot;virtual machine host&quot; checkbox. How do I check if my server has the corresponding packages? What packages come with the virtual machine host? In evaluating integral $\int\sin^{3}x dx $ I am pretty sure we need to use substitution $e^x=t$, but can't go  next step. I am under DDoS. What can I do? This is a  about DoS and DDoS mitigation.   I found a massive traffic spike on a website that I host today; I am getting thousands of connections a second and I see I'm using all 100Mbps of my available bandwidth.  Nobody can access my site because all the requests time out, and I can't even log into the server because SSH times out too!  This has happened a couple times before, and each time it's lasted a couple hours and gone away on its own.  Occasionally, my website has another distinct but related problem: my server's load average (which is usually around .25) rockets up to 20 or more and nobody can access my site just the same as the other case.  It also goes away after a few hours.  Restarting my server doesn't help; what can I do to make my site accessible again, and what is happening?  Relatedly, I found once that for a day or two, every time I started my service, it got a connection from a particular IP address and then crashed.  As soon as I started it up again, this happened again and it crashed again.  How is that similar, and what can I do about it? How do I analyze a .hprof file? If verification is quality control, what is a validation? "going to" vs "will" I know several questions were asked about the difference between "going to" and "will". Based on several answers (see, for instance, ,  and ), I understood that "will" is more spontaneous and "going to" is used with more planned actions.  So, it seems that everything is pretty fine. However, in , Kosmonaut has an answer in which he states: "Let's say that tomorrow you will walk your dog from 7 - 8 AM".  On the one hand, you probably planned to walk your dog long before and thus I should use "Let's say that tomorrow you're going to walk your dog from 7 - 8 am".   On the other hand, since I'm saying "let's say...", I'm deciding right now (thus, unplanned) that you will walk your dog. So, even though in this hypothetical situation you made a plan, I'm in a more spontaneous mood deciding right now that that's what you will do tomorrow, and, thus, I should use "will".  Which one (if any) of the above explanations is right? Bold brackets in equations I want to write an equation with bold extended brackets.  For instance in:   \left[ \frac{1}{2} \vec{\nabla} \times \vec{v} \right]   I want \left[ and \right] to be bold. I already tried  nothing is doing the trick. In logic, a semantics is said to be compact iff if every finite subset of a set of sentences has a model, then so to does the entire set.   Most logic texts either don't explain the terminology, or allude to the topological property of compactness. I see an analogy as, given a topological space X and a subset of it S, S is compact iff for every open cover of S, there is a finite subcover of S. But, it doesn't seem strong enough to justify the terminology.   Is there more to the choice of the terminology in logic than this analogy? How do I change the launcher commands? Adding table of certain attributes to map layout? I am using ArcMap 10.2 and I'm looking for a way to add  a table containing certain fields from select elements from a featureclass to my map. Ive tried the add table option from the attribute table, but it doesn't quite give what I want (the table must be editable to look a certain way).   Are there any options out there for 10.2 like arcpy.mapping.tableview or will upgrading to 10.3 so I can get access to the "graphic table element" function be best? Installation of latest version R for linux First I typed  sudo gedit /etc/apt/sources.list   after that I got one sources list then I typed  deb http://cran.rstudio.com/bin/linux/debian wheezy-cran3/   then I get the error like this  No command 'deb' found, did you mean:  Command 'derb' from package 'icu-devtools' (main)  Command 'deb3' from package 'quilt' (main)  Command 'debc' from package 'devscripts' (main)  Command 'dwb' from package 'dwb' (universe)  Command 'xdeb' from package 'xdeb' (universe)  Command 'debi' from package 'devscripts' (main)  Command 'dab' from package 'bsdgames' (universe) deb: command not found   How should I proceed? Custom right-click action in Unity Launcher keeps cursor busy for 20 seconds To have a "minimize window" option through right click on an icon in the Unity launcher (Ubuntu 14.04), I followed the detailed instructions  about changing a .desktop file and made a custom Firefox launcher in ~/.local/share/applications/ folder. The relevant part of the .desktop file is:  Actions=NewWindow;NewPrivateWindow;Minimize  [Desktop Action NewWindow] Name=Open a New Window Exec=firefox -new-window OnlyShowIn=Unity;  [Desktop Action NewPrivateWindow] Name=Open a New Private Window Exec=firefox -private-window OnlyShowIn=Unity;  [Desktop Action Minimize] Name=Minimize Windows Exec=sh /home/myusername/Documents/xdotool_sh/minimize.sh firefox OnlyShowIn=Unity;   The desktop action "Minimize" invokes a simple shell script, minimize.sh that has the following content:  #/bin/bash name=$1 for i in $(xdotool search --class "$name"); do     xdotool windowminimize $i done   The script uses xdotool, that can be installed from the official repositories, to find all the firefox windows, iterate over them and minimize them.  The script works and the launcher right menu option "Minimize Windows" works as well, but as soon as the windows are minimized, the mouse pointer gets in "busy" mode and stays like this for about 20 seconds (although the mouse actions are still responsive).   Does anyone know why starting a shell script from a right menu option in Unity could lead to this behaviour?  EDIT: Apparently the wait period is inevitable, as explained in Jacob Vlijm's answer. Since the mouse remains responsive, avoiding the transformation of the pointer in the spinning wheel is a partial esthetic workaround, as explained on .  EDIT2: giving the system a fake window is a better solution, as explained by Jacob below. What command can I type into the Terminal so that I can delete all .svn folders within a folder (and from all subdirectories) but not delete anything else? Prove that : $\displaystyle \lim_{n\to \infty} \frac{1}{n+1}+\frac{1}{n+2}+\frac{1}{n+3}+\cdots+\frac{1}{2n}=\ln 2$    the only thing I could think of is that it can be written like this :  $$ \lim_{n\to \infty} \sum_{k=1}^n \frac{1}{k+n} =\lim_{n\to \infty} \frac{1}{n} \sum_{k=1}^n \frac{1}{\frac{k}{n}+1}=\int_0^1 \frac{1}{x+1} \ \mathrm{d}x=\ln 2$$  is my answer right ? and are there any other method ?(I'm sure there are) Every proper ideal is contained in a maximal ideal, in a commutative ring with identity. The statement is:     In a commutative ring with 1, every proper ideal is contained in a maximal ideal.   and we prove it using Zorn's lemma, that is, $I$ is an ideal, $P=\{I\subset  A\mid A\text{ is an ideal}\} $, then by set inclusion, every totally ordered subset has a bound, then $P$ has a maximal element $M$.  My question is why $M$ must contain $I$? Report sites that use Stack Exchange content without following attribution rules here NB The following is a community-generated list of websites that republish Stack Exchange content without attributing it properly. It is no longer being maintained, because the procedure for reporting such sites has changed; see the duplicate for more information. There are a number of license-violating clones of Stack Exchange sites popping up that use Stack Exchange's  data without following our Creative Commons attribution terms. Those terms are , and are also included as a .txt file in every data dump we produce.  Google now has  in search results. Also, you can :  The option to block a site appears when you click a search result and then navigate back to the search results page. Click the &quot;Block&quot; link next to that result to block all pages within the site's entire domain.   This post was created as an attempt to organize information originally posted . You may also be looking for . How to open Nautilus (File Manager) preferences? Is there a formal proof for the superposition theorem? How can I identify what application is using a given file?