I want to force ssh to always use the program specified by SSH_ASKPASS. In my case the program is just a bash script returning the passphrase.  The problem is, as the ssh documentation says:     If ssh needs a passphrase, it will read the passphrase from the current terminal if it was run from a terminal.   So if I run ssh from a terminal, SSH_ASKPASS is ignored.   There is a similar question:    which proposes create an alias for ssh, like this  $ alias ssh="setsid ssh"   but doesn't work for me, because I don't call ssh directly, is called from git or rsync.   I also found an  in the OpenSSH Bugzilla asking for a fix, but was opened in 2002, so I don't believe is going to be implemented.  I'm thinking on probably weird solutions:   Make a fake ssh agent, which calls the script and returns the passphrase.  Create a process looking for new ssh processes and detach them from the    terminal before ssh asks for the password.   Any better sugestion?
says:  SSH_ASKPASS    If  ssh needs a passphrase, it will read the passphrase from the    current terminal if it was run from a terminal.  If ssh does not    have  a  terminal associated with it but DISPLAY and SSH_ASKPASS    are set, it will execute the program  specified  by  SSH_ASKPASS    and open an X11 window to read the passphrase.   I'd like SSH to use an askpass program even if it was run from a terminal.  On occasion, I have to connect to servers, where there's some delay in showing a password prompt (maybe due to network issues, maybe due to attempted reverse DNS lookups, …). I get annoyed and switch to something else, and forget about the attempted connection. (Insert joke about attention span of a goldfish.) When I finally get back to it, the prompt's timed out and even a correct password would just result in a closed connection.  Keys would be one solution, but not every system I use has my usual SSH keys. However, I usually use Ubuntu systems, and Ubuntu has an SSH askpass program installed by default.  If an askpass window popped up, however, I'd be immediately aware of it. That's a good enough compromise for me, if only I can get it to work.
I've got two branches that are fully merged together. However, after the merge is done, I realise that one file has been messed up by the merge (someone else did an auto-format, gah), and it would just be easier to change to the new version in the other branch, and then reinsert my one line change after bringing it over into my branch. So what's the easiest way in Git to do this? A grim and tragic question perhaps, but I'm curious:  What happens when a person that co-signed on a loan dies? Is the co-signer's estate potentially liable until the loan is paid off, the same as if the co-signer had borrowed the money themselves?  Or, does the responsibility for the loan die with the co-signer?  Does the bank/lender take on that risk? What is the difference between sector and cluster? I have gone through wikipedia and other sites and here's the information I have obtained.  Sector: Smallest Addressable Unit (mostly 512 bytes) Cluster: Smallest Allocation Unit (equals to 1 or more sectors and the number of clusters depends on the file system).  Let's say in the below example:  sector =512 bytes and a cluster =8 sectors=4096 bytes. Now, I am having a hard time figuring out, when I am trying to create a file what does the file system do? Does it consider 4096 bytes as the smallest write/read unit or 512 bytes?  If the answer is 4096 bytes: When the manufacturer of the disk drives has provided 512 bytes as the smallest addressable unit, why does the file system consider cluster as the smallest unit? I mean, what are the advantages in doing so? I am asked to solve $$u_x+u_y=1$$ If is was homogeneous i.e., $u_x+u_y$ the answer would be $u(x,y)=f(y-x)$ where $f$ is an arbitrary function. I have found the following set of solutions: $$u(x,y)=\lambda x +(1-\lambda)y$$ where $\lambda$ is an arbitrary constant(real or imaginary). I just have no idea what method other then trial and error would have lead me here. Any ideas? Thanks! The problem is to prove that every Hilbert space has a orthonormal basis. We are given Zorn's Lemma, which is taken as an axiom of set theory:  Lemma If X is a nonempty  with the property that every  of X has an upper bound in X, then X has a maximal element.   Given a orthonormal set $E$ in a Hilbert space $H$, it is apparently possible to show that $H$ has an orthonormal basis containing $E$.   I tried to reason as follows: Suppose $E$ is a finite set of $n$ elements. Then one can number the elements of $E$ to create a totally ordered set of orthonormal elements. Then the span $&lt;E&gt;$ can be identified with $R^n$, where each element $v = v_1 e_1 + v_2 e_2 + ... + v_n e_n$ is identified with the vector $(v_1, v_2, ..., v_n)$. On $R^n$ we have a total order, namely the "lexigraphical order" $(x_1,x_2,...,x_n) \leq (y_1,y_2,...,y_n)$ if $x_1 &lt; y_1$ or if $x_1 = y_1$ and $x_2 &lt; y_2$ or if $x_1 = y_1$, $x_2 = y_2$ and $x_3 &lt; y_3$ and so on. Hence $E$ is a totally ordered subset of $H$ and $H$ is a partially ordered set. However, this set doesn't seem to have an upper bound. The set $E$ does have an upper bound. If we define a total order on $E$ only, then X is a partially ordered set satisfying the criteria so X has a maximal element?   This is as far as I got, and I am not sure the entire argument is correct. I don't see how what kind of maximal element I am seeking, since the orthonormal basis of a Hilbert space can have countably infinity number of elements. This should be a very easy question but it might just be that I'm confusing myself. So we have the definition of a function $f$ on $S$ being continuous at $x_0$:     For any $\epsilon$>0, there exists $\delta&gt;0$ such that: whenever $|x-x_0|&lt;\delta$, we have $|f(x)-f(x_0)|&lt;\epsilon$   And I assume the negation is     There exists $\epsilon$>0 such that for all $\delta&gt;0$, $|x-x_0|&lt;\delta$ yet $|f(x)-f(x_0)|\ge \epsilon$.   Now I want to show that the function $f(x)=\sin(\frac{1}{x})$ together with $f(0)=0$ cannot be made into a continuous function at $x=0$. So I need to show that there exists $\epsilon&gt;0$ such that for all $\delta&gt;0$, $|x|&lt;\delta$ yet $|f(x)|\ge\epsilon$.  Let $\epsilon = \frac{1}{2}$. Then no matter what $\delta$ we choose, let $|x|&lt;\frac{1}{2}$. It is certainly possible that $|f(x)|\ge \frac{1}{2}$, because, well, $\frac{1}{x}$ can really take on arbitrarily large value as $x$ is small.  Now, what confuses me is that, as $x$ gets small, $f(x)$ can certainly be greater than $\frac{1}{2}$ for infinitely many times, but it will be less than that infinitely many times, too. But I suppose it doesn't really matter. So I think there's something wrong with my negation but I couldn't figure out where.  Update: The correct version can be found . Watch for Lemma 4.6 Does $P(A\cap B) + P(A\cap B^c) = P(A)$? Sum of Cosine/Exponential Search for ,        ,                        and you will see that "results found containing __" is just a little too close to the header. It's not like there isn't  to have it be a little lower, closer to "Search":          The UI has been updated since I took the above screenshots, and the text you search for is  (which fixes another design issue but not the one in this question): Constraints of relativistic point particle in Hamiltonian mechanics I try to understand constructing of Hamiltonian mechanics with constraints. I decided to start with the simple case: free relativistic particle. I've constructed hamiltonian with constraint:  $$S=-m\int d\tau \sqrt{\dot x_{\nu}\dot x^{\nu}}.$$  Here $\phi=p_{\mu}p^{\mu}-m^2=0$  $-$ .  Then $$H=H_{0}+\lambda \phi=\lambda \phi.$$   So, I want to show that I can obtain from this Hamiltonian the same equation of motion, as obtained from Lagrangian.  But the problem is that I'm not sure what to do with $\lambda=\lambda(q,p)$. I tried the following thing:  $$\dot x_{\mu}=\{x_{\mu},\lambda \phi\}=\{x_{\mu},\lambda p^2\}-m^2\{x_{\mu},\lambda\}=\lambda\{x_{\mu},p^2\}+p^2\{x_{\mu},\lambda\}-m^2\{x_{\mu},\lambda\}$$$$=2\lambda \eta_{\mu b} p^b+p^2\{x_{\mu},\lambda\}-m^2\{x_{\mu},\lambda\}=2\lambda \eta_{\mu b} p^b+p^2\frac{\partial \lambda}{\partial p^{\mu}}-m^2\frac{\partial \lambda}{\partial p^{\mu}},$$  $$\dot \lambda=\{\lambda, \lambda \phi \}=\{\lambda,\lambda p^2\}-m^2\{\lambda,\lambda\}=\lambda\{\lambda,p^2\}+p^2\{\lambda,p^2\}=2\lambda\eta_{ak}p^{a}\frac{\partial \lambda}{\partial x^{k}},$$  $$\dot p_{\mu}=\{p_{\mu},\lambda p^{2}-m^2\lambda \}=p^{2}\{p_{\mu},\lambda\}-m^2\{p_{\mu},\lambda\}=-p^{2}\frac{\partial \lambda}{\partial x^{\mu}}+m^2\frac{\partial \lambda}{\partial x^{\mu}}.$$  If we recall that $p^2-m^2=0$, then we get from the third equation: $\dot p=0$, and from the first: $$\dot x_{\mu}=2\lambda\eta_{ak}p^{a}.$$  So we have    $\dot x_{\mu}=2\lambda\eta_{\mu b}p^{b}.$ $\dot \lambda=2\lambda\eta_{ak}p^{a}\frac{\partial \lambda}{\partial x^{k}}.$ $\dot p=0.$   But I don't know what to do next. Can you help me? deals with various ways of rewarding the finding of duplicates, a tough and increasingly necessary janitorial task.  Here's a concrete suggestion:   Reward the finder of a duplicate with +10 points if the question gets closed as a dupe. If multiple duplicates are found, reward all finders whose suggestion was voted for at least once by another user. (The limitation is to avoid gaming by making frivolous suggestions when it's obvious that a question is going to get closed as a duplicate.) Reward each following closevoter who picks one of the previously suggested dupes with +2 points if the question gets closed. Punish everyone involved (dupe-finders and dupe-voters) with -5 points, and revoke all rep gained from the dupe-voting, if a question closed as duplicate gets reopened.   A punishment for mis-voting is going to be controversial but in my eyes, it is absolutely essential. Finding a good dupe is a work of love: You need to make sure you understand the OP's question, and you need to scan every potential duplicate for whether it really contains an answer that will help the OP. Everyone dupe-votes carelessly from time to time, so the threat of punishment needs to be present to keep everyone on their toes, just as the threat of downvoting does when you post an answer.  If you think +10 is too high a reward: Consider that finding a duplicate can often be more work than writing an answer, and a correct answer usually nets you at least 10 points, if not much more.   If you think -5 is too much of a punishment: -2 might work as well, although I really think there should be a harsh punishment on an unfair dupe-closing. Given (p ∧ q), use the Fitch system to prove (q ∨ r) I'm having trouble solving a Fitch Style Proof and I was hoping someone would be able to help me.  Premises: p ∧ q  Goal: q ∨ r  Would be an assumption (p ∧ q => q ∨ r) in first step a correct one?   Then, q ∨ r Implication Elimination: 2, 1  Why is it not correct?  Thank you very much for any help! Does anyone know what the Inverse Cumulative Distribution Function of Normal Distribution is? Does it have a closed form expression? I did not find any good answer using Google. PhD without previous academic degree: truth or myth? dd aplied to dev USB before connect corrupt /dev/sdX and dont work I have a USB where I'm coping an ISO of 5 Mb aprox with a small OS with its own grub. If I connect the device and check it sudo fdisk -l I get:  ... Device     Boot Start   End Sectors  Size Id Type /dev/sdb1  *        1  9551    9551  4.7M cd unknown   If I copy with dd the ISO sudo dd if=my_os.iso of=/dev/sdb   14852+0 records in 14852+0 records out 7604224 bytes (7.6 MB) copied, 0.538487 s, 14.1 MB/s   It works perfectly. An boot from BIOS in other PC.  The problem is, sometime I forget to connect the USB after update the BIOS, so I do ff WITHOUT the USB connected,  the output is:  14852+0 records in 14852+0 records out 7604224 bytes (7.6 MB) copied, 0.00987684 s, 770 MB/s   Now, the /dev/sdb register is corrupted, the copy speed (770 MB/s) have no sense, and cannot user again dd until reboot.  I have tried to repair it with ddrescue and it doesn't work  sudo ddrescue /dev/zero /dev/sdb conv=noerror,sync   My question is, what is happening exactly and if is possible, how to repair /dev/sdb to avoid reboot and dd start working again?  Thanks. Is transferring to another university an option for an unhappy PhD student? I've heard of people transferring between graduate schools because of their advisor moving to another school and taking their students with them.   Do students ever transfer for other reasons? If a student isn't happy at the school they choose, could transferring be an option? Presumably they would frame it as something positive such as "turns out I really want to work with Professor X" rather than "I hate my school", but does this ever happen? Is there a certain timeframe in which this is possible? (Assume it's a 5 year PhD program.)  If the answer varies by subject please mention the subject in your answer.  (Context: many friends have told me that if it turns out I'm not happy with my choice, I can always transfer. My impression is that this is actually difficult since many schools don't accept transfer students and in any case not being able to stick with a program looks bad -- but I don't have evidence either way so wanted to ask people who are in academia. Of course the ideal would be to pick a school one is happy with in the first place!) Story identification: Old man has hacker neighbor who mysteriously dies Does anyone know this story? It was a novelette published with another one (I don't remember what it was) in . The premise was that the narrator is an old man whose neighbor, a hacker, dies under mysterious circumstances. A younger woman who is an expert in computer security is hired by the police to investigate what happened, and she has a fling with the narrator. After a while she dies as well, and the narrator realizes that it is an evil force that comes through electric lines is responsible for the killings. The title has interesting formatting in that it ends with a square (much like a command prompt cursor: [_] ) Getting the ID of the element that fired an event Is there any way to get the ID of the element that fires an event?  I'm thinking something like:    $(document).ready(function() {   $("a").click(function() {     var test = caller.id;     alert(test.val());   }); }); &lt;script type="text/javascript" src="starterkit/jquery.js"&gt;&lt;/script&gt;  &lt;form class="item" id="aaa"&gt;   &lt;input class="title"&gt;&lt;/input&gt; &lt;/form&gt; &lt;form class="item" id="bbb"&gt;   &lt;input class="title"&gt;&lt;/input&gt; &lt;/form&gt;     Except of course that the var test should contain the id "aaa", if the event is fired from the first form, and "bbb", if the event is fired from the second form. Evaluation inside Button stops after some seconds For what values $s$ does $\int_{0}^{\infty} \frac{\sin x}{x^s}dx$ converge? For what values $s$ does $\int_{0}^{\infty} \frac{\sin x}{x^s}dx$ converge?  Solution says $0&lt;s&lt;2$.  Any ideas?