For some network reasons, my previous SSH sessions to server have disconnected. When I create a new session, I find the previous session still exist:    [root@localhost ~]# who root     pts/0        2015-03-25 21:35 (10.1.1.1) root     pts/1        2015-03-25 21:36 (10.1.1.1) root     pts/2        2015-03-26 01:44 (10.1.1.1)   The pts/0 and pts/1 are previous session terminals. And there are still some progresses running on them, such as vim:    root      2953  2906  0 Mar25 pts/0    00:00:01 vim getpasswd.sh   I want to re-login pts/0 to continue running vim progress, Is it possible? How can I do it?
I have a virtual instance of redhat running that I can ssh to from any host on the corporate network.  My ssh session was dropped while running some scripts that may or not have caused me to disconnect.  The who command locally still lists the dropped connection. Reconnecting with ssh starts a whole new session.  Is there a way to connect to the original session?  If not can I kill it?  I have root and physical access.  I was not using screen in the original session.
How do I share internet with Windows from my Linux box? I have a Linux (Ubuntu 12.04) PC connected to the internet with a Greenpacket WiMax USB modem. I want to share the Internet connection with another computer running Windows 7 Home Premium, connected to the Linux PC over a LAN. Is this possible? How? Is the reverse possible instead (connecting the internet to the Windows computer and sharing it with Linux)? Is there a way to programmatically change the screen resolution or enable/disable multiple monitors in Windows XP?  For example to change from 1024x768 with one monitor to 1280x104 on two monitors?  I would be most interested in a win32 function to do this but anything that can be tied to a windows shortcut would suffice. How would you explain JavaScript closures to someone with a knowledge of the concepts they consist of (for example functions, variables and the like), but does not understand closures themselves?  I have seen  given on Wikipedia, but unfortunately it did not help. How to add a program as a startup application from a terminal? I am using Ubuntu 12.04 and I know the GUI way to maintain the startup program list but now I want to find out the way to add/remove startup applications using a command line interface (CLI). Why have we chosen our number system to be decimal (base 10)? After learning about the binary number system (only 2 symbols, i.e. 0 and 1), I just thought why did we adopt the decimal number system (10 symbols) after all?  I mean if you go to see, it's rather inefficient when compared to the octal (8 symbols) and the hexadecimal (16 symbols)? Solve $\sum nx^n$ I am trying to find a closed form solution for $\sum_{n\ge0} nx^n\text{, where }\lvert x \rvert&lt;1$.  This solution makes sense to me:  $\sum_{n\ge0} x^n=(1-x)^{-1} \\ \frac{d}{d x} \sum_{n\ge0} x^n = \frac{d}{d x} (1-x)^{-1} \\ \sum_{n\ge0} nx^{n-1} = (1-x)^{-2} \\ x \sum_{n\ge0} n x^{n-1} = x(1-x)^{-2} \\ \sum_{n\ge0} nx^n=\frac x{(1-x)^2}$  However, a  I am reading used the following method:  $$\sum_{n\ge0}nx^n=\sum_{n\ge0}x\frac d{dx}x^n= x\frac d{dx}\sum\limits_{n\ge0}x^n=x\frac d{dx}\frac1{1-x}=\frac x{(1-x)^2}$$  This seems closely related to the solution I described above, but I am having difficulty understanding it.  Can someone explain the method being used here? Historical locks are sometimes applied to questions.   What is a historical lock? What is the purpose of a historical lock? How are questions affected by historical locking? When is it appropriate to lock a question for historical reasons?  When is it not appropriate? How do I request a historical lock for a question? What should I do if I notice a serious problem with a historically-locked question or one of its answers? File /etc/ld.so.nohwcap is missing in Debian 7 What is the file /etc/ld.so.nohwcap used for?. In my machine (Debian 7), this file is not found. Therefore, Which package or library this file belongs to? I want to implement the EM algorithm manually and then compare it to the results of the normalmixEM of mixtools package. Of course, I would be happy if they both lead to the same results. The main reference is Geoffrey McLachlan (2000), .  I have a mixture density of two Gaussians, in general form, the log-likelihood is given by (McLachlan page 48):      $$ \log L_c(\Psi) = \sum_{i=1}^g \sum_{j=1}^n z_{ij}\{\log \pi_i + \log f_i(y_i;\theta_i)\}. $$ The $z_{ij}$ are $1$, if the observation was from the $i$th component density, otherwise $0$. The $f_i$ is the density of the normal distribution. The $\pi$ is the mixture proportion, so $\pi_1$ is the probability, that an observation is from the first Gaussian distribution and $\pi_2$ is the probability, that an observation is from the second Gaussian distribution.   The E step is now, calculation of the conditional expectation:      $$ Q(\Psi;\Psi^{(0)}) = E_{\Psi(0)}\{\log L_c(|\Psi)|y\}. $$ which leads, after a few derivations to the result (page 49):      \begin{align} \tau_i(y_j;\Psi^{(k)}) &amp;= \frac{\pi_i^{(k)}f_i(y_j;\theta_i^{(k)}}{f(y_j;\Psi^{(k)}}  \\[8pt]                        &amp;= \frac{\pi_i^{(k)}f_i(y_j;\theta_i^{(k)}}{\sum_{h=1}^g \pi_h^{(k)}f_h(y_j;\theta_h^{(k)})} \end{align} in the case of two Gaussians (page 82):      $$ \tau_i(y_j;\Psi) = \frac{\pi_i \phi(y_j;\mu_i,\Sigma_i)}{\sum_{h=1}^g \pi_h\phi(y_j; \mu_h,\Sigma_h)} $$ The M step is now the maximization of Q (page 49):      $$ Q(\Psi;\Psi^{(k)}) = \sum_{i=1}^g\sum_{j=1}^n\tau_i(y_j;\Psi^{(k)})\{\log \pi_i + \log f_i(y_j;\theta_i)\}. $$ This leads to (in the case of two Gaussians) (page 82):      \begin{align} \mu_i^{(k+1)} &amp;= \frac{\sum_{j=1}^n \tau_{ij}^{(k)}y_j}{\sum_{j=1}^n \tau_{ij}^{(k)}}  \\[8pt] \Sigma_i^{(k+1)} &amp;= \frac{\sum_{j=1}^n \tau_{ij}^{(k)}(y_j - \mu_i^{(k+1)})(y_j - \mu_i^{(k+1)})^T}{\sum_{j=1}^n \tau_{ij}^{(k)}} \end{align} and we know that (p. 50)      $$ \pi_i^{(k+1)} = \frac{\sum_{j=1}^n \tau_i(y_j;\Psi^{(k)})}{n}\qquad (i = 1, \ldots, g). $$ We repeat the E, M steps until $L(\Psi^{(k+1)})-L(\Psi^{(k)})$ is small.        I tried to write a R code (data can be found ).    # EM algorithm manually # dat is the data  # initial values pi1       &lt;-  0.5 pi2       &lt;-  0.5 mu1       &lt;- -0.01 mu2       &lt;-  0.01 sigma1    &lt;-  0.01 sigma2    &lt;-  0.02 loglik[1] &lt;-  0 loglik[2] &lt;- sum(pi1*(log(pi1) + log(dnorm(dat,mu1,sigma1)))) +               sum(pi2*(log(pi2) + log(dnorm(dat,mu2,sigma2))))  tau1 &lt;- 0 tau2 &lt;- 0 k    &lt;- 1  # loop while(abs(loglik[k+1]-loglik[k]) &gt;= 0.00001) {    # E step   tau1 &lt;- pi1*dnorm(dat,mean=mu1,sd=sigma1)/(pi1*dnorm(x,mean=mu1,sd=sigma1) +            pi2*dnorm(dat,mean=mu2,sd=sigma2))   tau2 &lt;- pi2*dnorm(dat,mean=mu2,sd=sigma2)/(pi1*dnorm(x,mean=mu1,sd=sigma1) +            pi2*dnorm(dat,mean=mu2,sd=sigma2))    # M step   pi1 &lt;- sum(tau1)/length(dat)   pi2 &lt;- sum(tau2)/length(dat)    mu1 &lt;- sum(tau1*x)/sum(tau1)   mu2 &lt;- sum(tau2*x)/sum(tau2)    sigma1 &lt;- sum(tau1*(x-mu1)^2)/sum(tau1)   sigma2 &lt;- sum(tau2*(x-mu2)^2)/sum(tau2)    loglik[k] &lt;- sum(tau1*(log(pi1) + log(dnorm(x,mu1,sigma1)))) +                 sum(tau2*(log(pi2) + log(dnorm(x,mu2,sigma2))))   k         &lt;- k+1 }   # compare library(mixtools) gm &lt;- normalmixEM(x, k=2, lambda=c(0.5,0.5), mu=c(-0.01,0.01), sigma=c(0.01,0.02)) gm$lambda gm$mu gm$sigma  gm$loglik   The algorithm is not working, since some observations have the likelihood of zero and the log of this is -Inf. Where is my mistake? Cropping Shapefiles in QGIS? I'm a bit overwhelmed by the available options in regards to the three major photo editing apps from Adobe.  Does anyone know of an article or site that lists the features of Lightroom, PS Elements, and PS, side by side?  I know that Lightroom revolves around edits and workflow, and that PS is the big kahuna of image editing.  Where does Elements fit in to this understanding? How to apply for a UK standard visitor visa as a family? How to reference constants in EL? General trigger bulkification - best practices A general question asked from time to time on stack exchange is question of trigger bulkification.  Therefore I have 2 questions:   Which best practices are you using? What is the best way to handle updates of more than 200 records? (In case of more than 200 records the trigger is executed more than once.) mysql_insert_id alternative for postgresql is there an alternative for mysql_insert_id() php function for PostgreSQL? Most of the frameworks are solving the problem partially by finding the current value of the sequence used in the ID. However, there are times that the primary key is not a serial column.... In Java, are there clear rules on when to use each of access modifiers, namely the default (package private), public, protected and private, while making class and interface and dealing with inheritance? pkexec command in a .desktop file I made a .desktop file for Androxyde's Flashtool (utility for Sony Xperia devices that I have to open with an executable file in its folder) that requires root privileges to use fastboot utilities. I used to make it work with gksu, but I'm on Ubuntu 15.04 and gksu is now old.  I tried to modify the exec line from Exec=gksu /home/natasha/FlashTool/FlashTool to Exec=pkexec /home/natasha/FlashTool/FlashTool Then, I read about pkexec doesn't allow to run X11 applications and so I override in this way:      The problem now is: It asks me the password but the Flashtool's GUI doesn't start. BUT if I execute that command in terminal, the program starts without problems. What can I do? Why Was It 'Essential' That Voldemort Kill Harry Potter? Can a lingering injury that requires "magical healing of 6th level or higher" be healed by an upcast lower-level spell? The  table in the DMG (p. 272) contains some wounds that can only be fixed by powerful healing magic, for instance:     Horrible Scar. You are disfigured to the extent that the wound cannot be easily concealed. You have disadvantage on Charisma (Persuasion) checks and advantage on Charisma (Intimidation) checks. Magical healing of 6th level or higher, such as heal and regenerate, removes the injury.   Can the necessary magical healing described here be a lower-level spell (such as cure wounds) that is upcast to 6th level? Or must it be a healing spell that is already 6th level or above before upcasting? What is wrong in this proof: That $\mathbb{R}$ has measure zero Consider $\mathbb{Q}$ which is countable, we may enumerate $\mathbb{Q}=\{q_1, q_2, \dots\}$. For each rational number $q_k$, cover it by an open interval $I_k$ centered at $q_k$ with radius $\epsilon/2^k$.  The total length of the intervals is a geometric progression that sums up to $\epsilon$.  Each real number is arbitrarily close to a rational number since $\mathbb{Q}$ is dense in $\mathbb{R}$. Thus, each real number is in one of the open intervals.  Thus the entire real line is covered by the union of the $I_k$, thus $\mathbb{R}$ is a null set with measure zero.  Clearly there is something wrong in the above proof, however I am not sure where is it?  Thanks for any help.