I and my research advisor have a manuscript that still requires some final polish to be sent for peer review. In the meantime, I am applying for graduate school. Some graduate schools allow me to upload any additional material I think helpful. First note: We are not worried about our idea been stolen even if we expose it on the internet(My advisor even put all his finished manuscripts on arXiv, including those rejected by peer review. He in fact wants his work be read by more people and more people could exchange ideas with him, unlike the majority of academia who would keep their work not openly-accessible before published). I ask my advisor for consent that if I can include the current version of the manuscript as a draft of our work in my application to those schools? The advisor is not familiar with how grad school admission goes in the US so he said he understood that I want to present research experience but he prefers that I state them in SoP instead. He further said nevertheless if I really want to present a draft, I need to follow the ethics code in that the ultimate rule is that I cannot damage his academic reputation, at least point out in the draft that it's not the final version in his view. Although I have this consent, I still hesitate about it. Which one makes a stronger application? Including a Draft? or just state my work in SoP? Or the difference is trivial?
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.
I think this is a very recent design change, because I've not seen it before:    Where before a small box with the bounty value dislocated the title a couple of characters to the right, now the additional text saying how long until it expires dislocates the title by about a quarter of the width of the column.  I find that this makes it much harder to read the title, and is counterproductive to the goal of attracting attention. $f: \mathbb{R} \to \mathbb{R}$ that takes each value in $\mathbb{R}$ twice Does there exist a continuous function $f: \mathbb{R} \to \mathbb{R}$ that takes each value in $\mathbb{R}$ exactly two times? Where are the Unity desktop wallpapers located? Variance of sum of $k$ randomly drawn numbers from $1,...,n$. Resonances in high energy physics I still do not understand what a  precisely is. Is it exactly the same as a particle? Or only an excited state?  And why does it make a peak in some diagrams? And which diagrams? Is it possible to call the base method from a prototype method in JavaScript if it's been overridden?  MyClass = function(name){     this.name = name;     this.do = function() {         //do somthing      } };  MyClass.prototype.do = function() {       if (this.name === 'something') {         //do something new     } else {         //CALL BASE METHOD     } }; Windows 8 hibernation option missing from power options Windows 8 Professional 32-bit running on Laptop. And the Hibernation option is missing from the Power Options in the System Settings. Even after I enable hidden power features by giving admin privileges.  How can I fix this?    Also the option to enable hibernation is missing from the advanced power plan options.      SOLUTION UPDATE:  Thanks to  I have found that you need to enable hibernation using a command prompt.   Get to the Start menu, type 'CMD' this will begin the search. Press the CTRL+SHIFT+ENTER to start the command prompt with administrative privileges. Type powercfg -h on and press enter How can i make my Java Swing GUI Components [Right To Left] for Arabic language from NetBeans Desktop Application? What is the correct pronunciation of the word “processes”? I frequently prefer to look for questions on superuser .    I have never been able to determine how these search results are ordered.  Typically, search results are returned in order of relevance and the search help says they are "weighted heavily towards question title matches", but in this case, you would think that the search would order them based on whatever tab is currently selected (newest, hot, active)?  I ordinarily never stray outside of 'newest', but it's clear the results are not sorted by age. Can we modify "Ask question" to automatically suggests tags based on your question content.   So instead that user needs to type "team-foundation-server" or "TFS" or "TeamFoundationServer" he will see list of tags auto-populated with ajax which he (or she) can then select and it will be associated with the question. So basically only thing we need is code which will cross-match question content with list of known tags while user is typing and display results in some nice ajax-enabled list/cloud/whatever UI control. This should be separate control for tags suggestions so user still has option to use standard tag list input to type-in tags.  In this case, instead of three (or more) tag variations we would have only one tag for Team-Foundation-Server. Expanding GCDs Reasoning: $\gcd(a,c) \cdot \gcd(b,c) = \gcd(ab,bc,ac,cc)$ I'm just wondering the reason behind being able to do this:  $$\gcd(a,c) \cdot \gcd(b,c) = \gcd(ab,bc,ac,cc)$$  Is there an elementary proof to the reasoning behind this? How to see the error messages when I get the white screen of death? How can I see the error messages when the site I am working on gets a white screen? Is SHA-256 secure as a CTR block cipher? Generate a 256-bit random nonce. XOR it with a 256-bit reusable symmetric key. This is x.  We represent numbers in simple binary instead of a counting function. 0 in dec = [256 zeros] in binary, 1 = [255 zeros]1, 23092348 = [241 zeros]1011000000101110001111100, etc.  For each nth block needed for the length of the plaintext, XOR x with n and hash it with SHA-256 to form b[n].  Let p[n] be the nth 256-bit block in the plaintext and c[n] be the nth block in the ciphertext. Then c[n] := b[n] XOR p[n].  Send the unencrypted nonce along with the ciphertext.  To decrypt c[n], XOR it with b[n] to retrieve p[n].  Is this secure? If so, then why do we need AES-256?  If this is not secure, then is there any mode of operation for which SHA-256 is secure as a block cipher? Specifically, it would need to be used in cipher feedback, output feedback, or any other mode that only uses the cipher in the encryption direction. Finding the missing digits of $23!$ Let $I$ and $J$ be ideals of a Noetherian ring $A$. If $JA_P\subseteq IA_P$ for every $P\in \operatorname{Ass}_A(A/I)$, then $J\subseteq I$.   I'm reading Matsumura's Commutative Ring Theory book on my own. This is exercise $6.4$ in that book, and I fail to prove it. Could you help me with this? Thanks in advance. In a ring homomorphism we always have $f(1)=1$? What are the most common pitfalls awaiting new users? Getting computer's UTC offset in Python How to use Terminal to delete all .svn folders recursively?