My u-GPA is about 2.8 and GRE is 330, from now on is a hypothetical scenario as I haven't done my masters yet so if you could treat it as an actual case and give me subjective answers that would be great. For the masters I have found this growing researcher who is doing amazing work and is eager for me to join his lab from the start of the program. Assuming that by the end of the MS, I get ~3.7GPA, a couple co-authored pub and 1 first authored pub in reputed journals along with going to conferences to present my work, altogether getting strong recommendations from the advisor and his colleagues. Will this in any way offset my u-GPA. Also apart from research in masters I have had about 2 years of research experience during undergrad (in and out of school) and have published a paper in a peer-reviewed journal.   I am looking to get into the biomedical engineering PhD programs at university of chicago, northwestern university, university of pittsburgh, john hopkins university, york university, and university of pennsylvania. Do you think that I am aiming too high? If so, what else should I look to do to improve my chances? Also if I start MS this Fall should I apply for PhD at Fall 2022 or Fall 2023?  Additional Info:   I did a decent undergrad thesis (not great, 8 months), soon after I did a 2 month internship a another research lab. During my undergrad I worked w/ a prof for 1.2 years (Got two papers out - one in a conf and another in a journal). Currently I am working in a top research lab, now remotely due to covid-19 outbreak. Some people have mentioned other questions thinking that those had the same information that I wanted. But, they did not as the questions talked about how to get into "a/some" PhD Program after a low U-GPA and maybe decent masters. The schools that I have mentioned above are ranked pretty high and  would appreciate if you could tailor your answers to my specific question of getting into these schools. I picked these school not to show of the "rank" or "prestige" which seems stupid honestly. I chose the because of the strength in the field (F1) that I'm looking to do research in. In one of my previous questions I had mentioned that I got a PhD offer from university of houston which does the research in F1 but it isn't very strong in other area such as: number of grants that they pull in to do amazing research on large patient populations, intellectual cohorts, and industrial connections and startup resources. I picked these schools as I believe them to be the best in F1 and NOT for the main purpose of prestige. So if you don't have anything to suggest I IMPLORE you to not ask me to look at other schools as I did not ask for alternatives but solutions or ideas
When applying to a PhD program in the US, how does the admissions process work? If an applicant is weak in a particular area, is it possible to offset that by being strong in a different area?  Note that this question originated from this . Please feel free to edit the question to improve it.
Show that a norm on an inner product space satisfies parallelogram law. Hence use the parallelogram law to show that the space of continuous real functions defined on the interval $[a,b]$ is not a Hilbert space. Here I did the first part. Let $X$ be an inner product space and $x,y\in X$ consider $\Vert x+y\Vert ^2$ and $\Vert x-y\Vert ^2$ Then on adding I get $\Vert x+y\Vert ^2+\Vert x-y\Vert ^2=2(\Vert x\Vert ^2 +\Vert y\Vert ^2)$ For the second part I don’t know how can a parallelogram law prove $C[a,b]$ is not a Hilbert space, help me please. Select current element in jQuery URL to load resources from the classpath in Java Ubuntu on 32-bit UEFI (only) based tablet pc I've created a bootable USB of Ubuntu 16.04 64-bit with Rufus, setting the drive to be a GPT for UEFI. Then I booted my tablet PC and I ran the UEFI BIOS, from which I turned secure boot off. I then restarted and went again on the BIOS to boot from my key, but all I got was a black screen that lasted few seconds and then it brought me back to the BIOS. I read about a bootia32.efi file and other procedures that can be followed, but I didn't find a good explanation of what I need to get done. My tablet PC runs an Intel Core Atom Z3735F and has 2 GB of RAM. If you have the answer please let me know. I cheated on the Disciplined badge, how bad is it? I was looking for badges I didn't have yet, and I saw the Disciplined badge. So I deleted an answer of mine with 3+ votes, and waited. Five minutes later, sweet, a new badge! Then I went to my answer again, and undeleted it. No problem at all, and I keep the badge!   What will happen? Will my badge stay here or not? More generally, what happens when the conditions to get a badge are valid at one time, and then not valid?  Other badge in this case:   Unsung hero - "Zero score accepted answers: more than 10 and 25% of total"   What happens if answers get a vote after getting the badge? Are the badge frequently recalculated? How to approach the modeling of duct work, piping, wiring? A generalized version of the second Borel-Cantelli lemma says     Theorem 5.3.2. Second Borel-Cantelli lemma, II. Let $\mathcal F_n, n \ge 0$ be a filtration   with $F_0 = \{\emptyset, \Omega\}$ and $A_n , n \ge 1$ a sequence of events with $A_n ∈ \mathcal F_n$ . Then   $$ \{A_n \,i.o.\} = \left\{\sum_{n \ge 1} P (A_n |\mathcal F_{n−1}) =\infty \right\}. $$   An exercise of this lemma is     Exercise 5.3.6. Show    $\sum_{n \ge 2} \mathbb P (A_n | \cap_{m=1}^{n−1} A_m^c ) = \infty$ implies $P (∩_{m \ge 1} A_m^c ) = 0$.   I think we can actually prove that $\cap_{m \ge 1} A_m^c = \emptyset$. My proof is like this: Let $B_n = \cup_{m = 1}^n A_n$. Let $\mathcal F_n = \sigma(A_1,\dots,A_n)$, which forms a filtration. It is easy to verify that $$ \mathbb P (A_n | B_{n-1}^c ) = \mathbb P (A_n | \mathcal F_{n-1})(\omega) $$ when $\omega \in B_{n-1}^c$.  Assume there exist $\omega \in \cap_{m \ge 1} A_m^c$. It follows from the previous lemma that $$ \omega \in \left\{\sum_{n \ge 1} P (A_n |\mathcal F_{n−1}) =\infty \right\} = \{A_n \,i.o.\}. $$ In other words, $\omega \in \cap_{m \ge 1} \cup_{n \ge m} A_n$, which contradicts $\omega \in \cap_{m \ge 1} A_m^c$.  Is this the right proof? Prove that the $\lim_{(x,y) \to (0,0)}h(x,y)$ Does not Exist using Polar Coordinates Let $h(x,y)=\frac{x^5y}{2x^{10}+y^2}$. How would I prove that the $\lim_{(x,y) \to (0,0)}h(x,y)$ Does Not Exist?  I think that we might use polar coordinates, but I am not sure. Limit of derivative is zero. Does it imply a limit for f(x)? Prove that, for $p > 3$, $(\frac 3p) = 1$ when $p \equiv 1,11 \pmod{12}$ and $(\frac 3p) = -1$ when $p \equiv 5,7 \pmod{12}$ What is a single word for a person who, as a habit, exaggerates a lot when relating information?   So for example, they relate something that happened but exaggerate so much that they are including clear falsehood and they are well known for doing that. jsFiddle: no connection between html and js? Can't call simple function from button? How is the system call in Linux implemented? When I invoke a system call in user mode,how did the call get processed in OS?  Does it invoke some some executable binary or some standard library?  If yes,what kind of thing it needs to complete the call? How to format a USB drive? Does a fighter's Action Surge trigger Extra Attack? Context  A player in my game will play a fighter with a greatsword. At 5th level he has Extra Attack and the option to use Action Surge. PHB p.72 states:     Action Surge. Starting at 2nd level, you can push yourself beyond your normal limits for a moment. On your turn, you can take one   additional action on top of your regular action and a possible bonus   action.      Once you use this feature, you must finish a short or long rest before   you can use it again. Starting at 17th level, you can use it twice   before a rest, but only once on the same turn.        Extra Attack. Beginning at 5th level, you can attack twice, instead of once,   whenever you take the Attack action on your turn.       The number of attacks increases to three when you reach 11th level in   this class and to four when you reach 20th level in this class.   Confusion  The questions and answers that I find on here deal with multi-classing or Two Weapon fighting specifically, which don't really give a clear yes or no on my question.  The way I read these two features is that when a fighter takes an Attack action, he gets the Extra Attack. After using Action Surge he gets the opportunity to take another Attack action, and with that another Extra Attack. This results in four attacks with the greatsword in one turn, which sounds amazing but also rather powerful. Is this correct, or am I missing something? What is the best way to find out a researcher's current affiliation? Let's say I know a name and a field, but not much more.   A google search seems like the most obvious approach, but unfortunately university personnel or research group pages often seem to be quite poorly maintained, and it is not uncommon that someone is listed even if they left more than a year ago.  Early-career researchers are particularly difficult to track down since they often have less of a "presence" on institution webpages and are likely to be moving relatively frequently. Open all iCloud tabs from iPhone on Mac TLDR; Is there a way to simultaneously open all iCloud tabs saved on iPhone, on a Mac?  I use my iPhone for browsing and as a means of "read it later" I just leave the open tabs there with the purpose of opening them all later on my Mac. Is there a way to open them all (much like Chrome allows in the "Tabs from other devices" in History page)? Matrices $B$ that commute with every matrix commuting with $A$ I get different lightning render with the same scene camera setup.  Cycles render (both experimental and supported feature set) gets weaker lightning and needs more energy.  How can I get the same lightning and reflection setup with EEVEE and Cycles? Distinct Sylow P subgroups