How to remove coolrom.com malware from ubuntu?
Where should I start in tracking down Firefox malware
PCIe Bus error severity=Corrected I have a new HP Pavilion Gaming Notebook and a new installation of Ubuntu 16.04. When I press Ctrl + Alt + F1 I go start seeing the errors shown in the following image and it doesn't allow me to interact with the console:    I also see these errors for a while everytime I boot. I need to do Ctrl + Alt + F1 to access a non graphical terminal to install some Nvidia drivers. What's going on?  What's causing the problem seems to be: 00:1c.5 PCI bridge [0604]: Intel Corporation Sunrise Point-H PCI Express Root Port #6 [8086:a115] (rev f1)  jpiabrantes@joao:~$ lspci -nn 00:00.0 Host bridge [0600]: Intel Corporation Sky Lake Host Bridge/DRAM Registers [8086:1910] (rev 07) 00:01.0 PCI bridge [0604]: Intel Corporation Sky Lake PCIe Controller (x16) [8086:1901] (rev 07) 00:02.0 VGA compatible controller [0300]: Intel Corporation Skylake Integrated Graphics [8086:191b] (rev 06) 00:04.0 Signal processing controller [1180]: Intel Corporation Skylake Processor Thermal Subsystem [8086:1903] (rev 07) 00:14.0 USB controller [0c03]: Intel Corporation Sunrise Point-H USB 3.0 xHCI Controller [8086:a12f] (rev 31) 00:14.2 Signal processing controller [1180]: Intel Corporation Sunrise Point-H Thermal subsystem [8086:a131] (rev 31) 00:16.0 Communication controller [0780]: Intel Corporation Sunrise Point-H CSME HECI #1 [8086:a13a] (rev 31) 00:17.0 SATA controller [0106]: Intel Corporation Sunrise Point-H SATA Controller [AHCI mode] [8086:a103] (rev 31) 00:1c.0 PCI bridge [0604]: Intel Corporation Sunrise Point-H PCI Express Root Port #5 [8086:a114] (rev f1) 00:1c.5 PCI bridge [0604]: Intel Corporation Sunrise Point-H PCI Express Root Port #6 [8086:a115] (rev f1) 00:1c.6 PCI bridge [0604]: Intel Corporation Sunrise Point-H PCI Express Root Port #7 [8086:a116] (rev f1) 00:1f.0 ISA bridge [0601]: Intel Corporation Sunrise Point-H LPC Controller [8086:a14e] (rev 31) 00:1f.2 Memory controller [0580]: Intel Corporation Sunrise Point-H PMC [8086:a121] (rev 31) 00:1f.3 Audio device [0403]: Intel Corporation Sunrise Point-H HD Audio [8086:a170] (rev 31) 00:1f.4 SMBus [0c05]: Intel Corporation Sunrise Point-H SMBus [8086:a123] (rev 31) 01:00.0 3D controller [0302]: NVIDIA Corporation GM107M [GeForce GTX 950M] [10de:139a] (rev a2) 07:00.0 Unassigned class [ff00]: Realtek Semiconductor Co., Ltd. RTS522A PCI Express Card Reader [10ec:522a] (rev 01) 08:00.0 Network controller [0280]: Realtek Semiconductor Co., Ltd. RTL8723BE PCIe Wireless Network Adapter [10ec:b723] 09:00.0 Ethernet controller [0200]: Realtek Semiconductor Co., Ltd. RTL8101/2/6E PCI Express Fast/Gigabit Ethernet controller [10ec:8136] (rev 0a) Postdoc before PhD completion I am in a situation where my PhD funding runs out in 5 months and I need to have secured a job regardless of whether I have submitted due to having a family.   Although I think I may be close to submitting by then, it may take longer. Is it worth applying for postdoc positions or would universities not consider you until you have completed the PhD? I assume that the pass rates of PhDs are very high if the candidate has got to the submission stage.   Edit: This question is aimed at the people that are are the submission stage but haven't yet defended their thesis. It is not a question asking if I can get a post-doc without a PhD. I tried and got this   $$e=\sum_{k=0}^\infty\frac{1}{k!}=\lim_{n\to\infty}\sum_{k=0}^n\frac{1}{k!}$$ $$n!\sum_{k=0}^n\frac{1}{k!}=\frac{n!}{0!}+\frac{n!}{1!}+\cdots+\frac{n!}{n!}=m$$ where $m$ is an integer. $$\lim_{n\to\infty}n\sin(2\pi en!)=\lim_{n\to\infty}n\sin\left(2\pi n!\sum_{k=0}^n\frac{1}{k!}\right)=\lim_{n\to\infty}n\sin(2\pi m)=\lim_{n\to\infty}n\cdot0=0$$  Is it correct? A priori power analysis for generalized linear mixed-effects model Let's say I have a data set (with a binary DV) which I used a generalized linear mixed-effects model on. I am currently trying to run a simulation-based power analysis to determine the sample size I should try to collect for a replication attempt.   I know about the  function for fitted lme4 model objects, which will create simulated responses that follow the size and structure of the actual dataset.  My question is, how can I use this fitted model object to run an a-priori power analysis for my replication?. In other words, is there an easy way to extract the necessary information from the simulate function, vary the sample size, then to simulate responses?  EDIT:  Here is a simple example with ten subjects that should give me a good starting place. The data here are totally fake so the effects are not close to what I have in the pilot data.  The two variables of interest are age in months (between subjects) and whether the stimulus is "similar" or "dissimilar" (within subjects). Each individual is exposed to three items within each similarity group, for a total of six binary responses for each subject. As seen in the model, I am interested in a possible interaction between age and similarity and include a random slope of similarity to do this.   Let me know if I need to modify anything/provide more information to make things easier.   set.seed(28)  fakeData &lt;- data.frame(ID = rep(1:10, each = 6),                        months = rep(round(runif(10, min = 60, max = 80)), each = 18),                        similarity = rep(c("Sim", "Dissim"), each = 3),                        response = sample(c(0, 1), 60, replace = TRUE))  fakeModel &lt;- glmer(response ~ months * similarity + (similarity | ID), family = binomial, data = fakeData) summary(fakeModel) Duplicate explanation should encourage improvement of original Is there anyway to get tuple operations in Python to work like this:  &gt;&gt;&gt; a = (1,2,3) &gt;&gt;&gt; b = (3,2,1) &gt;&gt;&gt; a + b (4,4,4)   instead of:  &gt;&gt;&gt; a = (1,2,3) &gt;&gt;&gt; b = (3,2,1) &gt;&gt;&gt; a + b (1,2,3,3,2,1)   I know it works like that because the __add__ and __mul__ methods are defined to work like that. So the only way would be to redefine them? What are our policies regarding self-harm and suicide? What should I do as a Moderator when I encounter situations regarding self-harm and suicide? Automatically adding user and password to openvpn script I have a working script, which allows me to do a vpn connection. It looks like this:  openvpn --config VPNBook.com-OpenVPN-Euro1/vpnbook-euro1-tcp443.ovpn   All is good, but I have to input the publicly available vpn and password every time I run this script. (Don't worry, I'm not going to do banking or anything serious over a free VPN, this is more for learning).  This is the username and the password available publicly on their website:  Username: vpnbook  Password: he2qv5h   After firing up, the script prompts me for username and password which now I need to copy and paste.   Tue Aug 15 11:54:51 2017 library versions: OpenSSL 1.0.2l  25 May 2017, LZO 2.08 Enter Auth Username: vpnbook Enter Auth Password:    Is there a way of doing it so the script inputs the values on its own?  I tried echoing it, but it isn't that easy.  Or do I have to edit the command itself, somewhere in the files? If yes, can someone point me in the right direction for doing it? Crash course on algebraic geometry with view to applications in physics Could you please recommend any good texts on algebraic geometry (just over the complex numbers rather than arbitrary fields) and on complex geometry including Kahler manifolds that could serve as an informal introduction to the subject for a theoretical physicist (having in mind the applications in physics, e.g. in the string theory)?   What I want for a moment is to get some informal picture of the subject rather than being dug up into the gory details of the proofs and lost in higher and higher layers of abstraction of commutative algebra and category theory. The texts I have found so far are all rather dry and almost completely lack this informal streak, and all of them are geared towards pure mathematicians, so if there exists something like "Algebraic geometry for physicists" and "Kahler manifolds for physicists" (of course, they would probably have different titles :)), I would greatly appreciate the relevant references. Why is the gate charge curve (Miller plateau) of MOSFETs dependent on Vds? Don't show the edit option when I can't really edit (mobile apps) Currently in both  and  when viewing a post on a site where you don't have full edit privilege  (and not your own post) you can still see edit option in the actions menu:        So I choose it, invest time in editing the post, click "Submit".... and greeted with the dreaded "Account is not allowed to suggest edits" message: (and the edit is lost for good, no draft)        Can the "Edit" option be removed from the menu if I don't have edit privilege on the post, at least until suggested edit will be supported in the apps? An example of a lattice that's not totally ordered I'm trying to prove that the following set ($B$) defined by an ellipse is convex, but I am getting stuck.  $$B = \left\{(x_1,x_2):3(x_1-3)^2+2(x_2-3)^2 \leq 1 \right\} $$  My sad attempt:  $$ \textrm{Let }x,y \: \in \: B \:, \: \lambda \: \in \: [0,1]$$  $$ \lambda x+(1-\lambda)y=(\lambda x_1+(1-\lambda)y_1,\: \lambda x_2 +(1-\lambda)y_2  )$$ $$3(\lambda x_1 + (1-\lambda)y_1 -3)^2+2(\lambda x_2+(1-\lambda)y_2-3)^2=3(\lambda ^2x_1^2 +(1-\lambda)^2y_1^2+9+2\lambda x_1(1-\lambda)y_1-6\lambda x_1 -6(1-\lambda)y_1)+2(\lambda ^2x_2^2 +(1-\lambda)^2y_2^2+9+2\lambda x_2(1-\lambda)y_2-6\lambda x_2 -6(1-\lambda)y_2)$$  and this is where I have lost all confidence in proving it. I was able to factor some of the terms into the form $(\lambda x_1 -3)^2$, $((1-\lambda) y_1 -3)^2$, $(\lambda x_2 -3)^2$, and $((1-\lambda) x_2 -3)^2$, but I don't think that helps the situation any. How to use JACK and Pulseaudio/ALSA at the same time on the same audio device? Whenever I launch hydrogen it breaks my audio in all other applications which use Pulse, for example, I can no longer play videos in Chrome after having launched Hydrogen once, until I restart my PC or do sudo alsa force-reload. I have found people with similar issues, but no actual guide to fix this, often there are links to  (which has moved to  ) I am using Ubuntu Studio 14.04 64bit.  ALTERNATIVELY if this is truly impossible to achieve, can someone tell me how to use Jack on one soundcard and Pulse on another? This way I could plug in a USB sound card only when I need JACK.  Please don't make me use windows. How to remove `t=canonical` from Firefox browser searches made on DuckDuckGo? Why does my Nikon D3100 give the error "Lens not attached" with a Vivitar 200 telephoto lens? I'd like to implement a big int class in C++ as a programming exercise&mdash;a class that can handle numbers bigger than a long int.  I know that there are several open source implementations out there already, but I'd like to write my own.  I'm trying to get a feel for what the right approach is.  I understand that the general strategy is get the number as a string, and then break it up into smaller numbers (single digits for example), and place them in an array.  At this point it should be relatively simple to implement the various comparison operators.  My main concern is how I would implement things like addition and multiplication.  I'm looking for a general approach and advice as opposed to actual working code. Output for Print Is there a way to output for Print. I want to save in a higher DPI than the default 72dpi say 300dpi that's a good quality for printed pieces. I tried downloading an add-on but don't know if I am installing it correctly it isn't showing up but the bar in python is green. I'm using the 2.69 version of Blender. If no such feature exists what size have any of you found best for print quality. Thank you What's the value of $\sum\limits_{k=1}^{\infty}\frac{k^2}{k!}$? For some series, it is easy to say whether it is convergent or not by the "convergence test", e.g., ratio test. However, it is nontrivial to calculate the value of the sum when the series converges. The question is motivated from the simple exercise to determining whether the series $\sum\limits_{k=1}^{\infty}\frac{k^2}{k!}$ is convergent. One may immediately get that it is convergent by the ratio test. So here is my question:     What's the value of $$\sum_{k=1}^{\infty}\frac{k^2}{k!}?$$ Finding the convergence interval of $\sum_{n=0}^\infty\frac{n!x^n}{n^n}$. I want to find the convergence interval of the infinite series $\sum\limits_{n=0}^\infty \dfrac{n!x^n}{n^n}$. I will use the ratio test: if I call $u_n = \dfrac{n!x^n}{n^n}$, the ratio test says that, if the following is true for some values of $x$, the series will be convergent for these values of $x$: $$\lim_{n\to+\infty}\left|\frac{u_{n+1}}{u_n}\right|&lt;1$$ So, I will first calculate the value of $\left|\dfrac{u_{n+1}}{u_n}\right|$: $$\left|\dfrac{\dfrac{(n+1)!x^{n+1}}{(n+1)^{n+1}}}{\dfrac{n!x^n}{n^n}}\right|=\dfrac{(n+1)!|x|^{n+1}}{(n+1)^{n+1}}\times\dfrac{n^n}{n!|x|^n}=\frac{(n+1)n^n|x|}{(n+1)^{n+1}}=|x|\left(\frac{n}{n+1}\right)^n$$ So, $\lim\limits_{n\to+\infty}\left|\dfrac{u_{n+1}}{u_n}\right|$ becomes: $$\lim_{n\to+\infty}\left|\frac{u_{n+1}}{u_n}\right|=\lim_{n\to+\infty}|x|\left(\frac{n}{n+1}\right)^n=|x|\lim_{n\to+\infty}\left(\frac{n}{n+1}\right)^n$$ Now I must evaluate the value of $\lim\limits_{n\to+\infty}\left(\dfrac{n}{n+1}\right)^n$. For this, let $y = \left(\dfrac{n}{n+1}\right)^n$; so, instead of calculating $\lim\limits_{n\to+\infty}y$, I will first calculate $\lim\limits_{n\to+\infty}\ln y$: $$\lim_{n\to+\infty}\ln y=\lim_{n\to+\infty}\ln \left(\dfrac{n}{n+1}\right)^n=\lim_{n\to+\infty}n\ln\left(\frac{n}{n+1}\right) =\lim_{n\to+\infty}\frac{\ln\left(\frac{n}{n+1}\right)}{\frac{1}{n}}$$ Applying L'Hôpital's rule: $$\lim_{n\to+\infty}\frac{\ln\left(\frac{n}{n+1}\right)}{\frac{1}{n}} =\lim_{n\to+\infty}\frac{\frac{1}{n(n+1)}}{-\frac{1}{n^2}} =\lim_{n\to+\infty}\left(-\frac{n}{n+1}\right)=-1$$ Now, since we know that $\lim\limits_{n\to+\infty}\ln y = -1$, we have that: $$\lim_{n\to+\infty}y=\lim_{n\to+\infty}e^{\ln y} = e^{-1} = \frac{1}{e}$$. Substituting this back into the expression $\lim\limits_{n\to+\infty}\left|\frac{u_{n+1}}{u_n}\right| = |x|\lim\limits_{n\to+\infty}\left(\frac{n}{n+1}\right)^n$, we have that the limit of $\left|\dfrac{u_{n+1}}{u_n}\right|$ as $n\to+\infty$ is: $$\lim_{n\to+\infty}\left|\frac{u_{n+1}}{u_n}\right|=\frac{|x|}{e}$$ Therefore, the series will certainly be convergent for the values of $x$ for which $\dfrac{|x|}{e}&lt;1$, that is, $|x|&lt;e$. So, I know that the series is convergent for $-e &lt; x &lt; e$, but I have to test whether the series is convergent at $x = e$ or $x = -e$. That is, I have to test whether $\sum\limits_{n=0}^{\infty} \dfrac{n!e^n}{n^n}$ and $\sum\limits_{n=0}^{\infty} \dfrac{(-1)^nn!e^n}{n^n}$ are convergent. Since these limits don't approach zero, I know they are both divergent, but I'm not sure how to find the limits, because of the factorial function. Also, I can't use integral test here, because of the factorial. Probably I should use comparison test, but I haven't found any divergent series to which to compare it. Any hints? Thank you in advance.  Edit: Using the suggestion by Ragib Zaman in the answer below, since the Taylor polynomial $P_n(x)$ of $e^x$ at $a=0$ is $$e^x = 1 + x + \dfrac{x^2}{2!} + \cdots + \dfrac{x^n}{n!}+\cdots,$$ if we substitute $n$ for $x$ we see that $e^n&gt;\dfrac{n^n}{n!}$; therefore, $\dfrac{n!e^n}{n^n} &gt; 1$, and, thus, we show that $\sum\limits_{n=0}^{\infty} \dfrac{n!e^n}{n^n}$ is divergent, because its term doesn't approach zero. $\sum\limits_{n=0}^{\infty} \dfrac{(-1)^nn!e^n}{n^n}$ is also divergent, because, although the absolute value of the ratio between two successive terms, $|e|\left(\frac{n}{n+1}\right)^n$, approaches 1 as $n\to\infty$, it approaches 1 from values bigger than 1; therefore, the absolute value of a term is always greater than the absolute value of the previous term.