I am trying to list all the ffmpeg processes that are currently running on Debian machine (Ubuntu 15).  I use the following command:  ps aux | grep 'ffmpeg'   If only one ffmpeg process is running, I still get two results. One for the actual process, and one for grep that is looking for ffmpeg in the process list.  max      21599 13.2  3.0 503848 92288 ?        Rl   01:39   1:18 ffmpeg -f video4linux2 -i /dev/video0 -f mpeg1video -b:v 800k -r 30 http://127.0.0.1:8082/oops/1024/640/ -nostdin -nostats -loglevel fatal max      23789  0.0  0.0  13688  2172 pts/3    S+   01:49   0:00 grep --color=auto ffmpeg   How can I modify my request so that the grep result which is actually my request is omitted from the output?
When ever I need to kill a background process I do ps -e | grep &lt;process_name&gt;  Which prints something like this 1766 ? 00:00:13 conky , Then I use the process ID to kill it like so kill 1766 .   Is there any way I can simplify this ? Make it quicker ? reduce the amount of typing ?
Which form should be used for at­tribu­tive nouns like “stu­dent union”: sin­gu­lar or plu­ral, or pos­ses­sive sin­gu­lar or pos­ses­sive plu­ral? What does var prime = num != 1; mean? in a topological space only finite subsets are compact sets If in a topological space only finite subsets are compact sets, is it then the discrete topological space?   Thank you. Disable StringBuilder optimisation in javac How to programmatically remove a field from a node? How to prove that 2017 divides $1^{2017}+2^{2017}+\dots+2017^{2017}$? How can I prove that $2017 \mid 1^{2017}+2^{2017}+\dots+2017^{2017}$? I tried proving it with the use of modulo, however it was to no avail. Afterwards, I  tried researching, for possible theorems, that may help, but that bore no fruit, either. Can you guys please help me proving it, as I am stuck? Thanking you in advance. A charged particle undergoing an acceleration radiates photons.  Let's consider a charge in a freely falling frame of reference.  In such a frame, the local gravitational field is necessarily zero, and the particle does not accelerate or experience any force. Thus, this charge is free in such a frame. But, a free charge does not emit any photons. There seems to be a paradox. Does a freely falling charge in a gravitational field radiate? I have an unusual problem with Chrome when I try to open PDFs. If I have already downloaded a PDF and try to download it again, I can open it by tapping its name; in the screenshot below, I could tap "pdf.pdf" to open the file.   The issue is that tapping this link actually opens RollerCoaster Tycoon Classic! If I choose to download again, Chrome redownloads and opens the PDF correctly, so it's not a huge issue, but still an inconvenience.  In Settings, it says that RollerCoaster Tycoon Classic has no defaults, and I am unable to change the "open supported links" setting.    How do I stop RollerCoaster Tycoon  trying to be a PDF reader? I have a LAMP server with following configuration.  CPU : Intel(R) Xeon(R) CPU   RAM : 32 GB  HDD : 80 GB  Running on virtual environment.  All the things in the server are running smoothly. But I have noticed that the RAM usage is the server is increasing each day without any reason.   This is the current memory usage on my server.  # free -g              total       used       free     shared    buffers     cached Mem:            31         13         17          0          0         10 -/+ buffers/cache:          1         29 Swap:            2          0          2   And you can see the last 8 weeks memory usage below.   And i have executed the following command to find how much memory each process is consuming.  # ps -eo size,pid,user,command --sort -size | awk '{ hr=$1/1024 ; printf("%13.2f Mb ",hr) } { for ( x=4 ; x&lt;=NF ; x++ ) { printf("%s ",$x) } print "" }'          0.00 Mb COMMAND        2253.62 Mb /usr/libexec/mysqld --basedir=/usr --datadir=/var/lib/mysql --user=mysql --pid-file=/var/run/mysqld/mysqld.pid --skip-external-locking --socket=/var/lib/mysql/mysql.sock        1171.66 Mb java -jar /etc/vmagent/bin/VMAgent.jar         138.27 Mb /sbin/audispd         127.75 Mb /usr/sbin/named -u named -c /etc/named.conf -u named -t /var/named/run-root          74.29 Mb auditd          73.03 Mb automount          43.14 Mb /usr/bin/spamd --username=popuser --daemonize --nouser-config --helper-home-dir=/var/qmail --max-children 5 --create-prefs --virtual-config-dir=/var/qmail/mailnames/%d/%l/.spamassassin --pidfile=/var/run/spamd/spamd_full.pid --socketpath=/tmp/spamd_full.sock          43.14 Mb spamd child          43.14 Mb spamd child          37.13 Mb /usr/sbin/httpd          37.02 Mb /usr/sbin/httpd          36.52 Mb /usr/sbin/httpd          36.46 Mb /usr/sbin/httpd          36.23 Mb /usr/sbin/httpd ................   For troubleshooting , i have restarted the MySQL and APACHE servers. But the result was same. Restarting the entire server will fix the issue, but i want to know what is the real issue.  Let me know if you have any idea about this issue.  Thanks,  Arun S I am trying to pass a reference to a two-dimensional array to a function in C++. I know the size of both dimensions at compile time. Here is what I have right now:  const int board_width = 80; const int board_height = 80; void do_something(int[board_width][board_height]&amp; array);  //function prototype   But this doesn't work. I get this error from g++:  error: expected ‘,’ or ‘...’ before ‘*’ token   What does this error mean, and how can I fix it? If $p\in\Bbb Z[X]$ show that: $ \max\limits_{x\in [0,1]}\left|p(x) \right| > \frac{1}{e^{n}}. $ This is problem 10 from the International Mathematical Competition for University Students of 2015, from day 2, in Bulgaria. I think it is an interesting problem!     Let $n$ be a positive integer, and $p(x)$ be a polynomial of degree $n$ with integer coefficients. Prove that   $$ \max_{x\in [0,1]}\left|p(x) \right| &gt; \frac{1}{e^{n}}. $$   Proposed by Géza Kós, Eötvös University, Budapest. How do I make a program auto-start every time I log in? I frequently need to start several programs that I use every time I start my computer. How can I make it so that whenever I login the program is automatically launched? How do I know if my Australian ETA was approved? JavaScript: document.getElementById slow performance? Proof by induction that $\sum_{i=1}^n \frac{i}{(i+1)!}=1- \frac{1}{(n+1)!}$ Prove via induction that $\sum_{i=1}^n \frac{i}{(i+1)!}=1- \frac{1}{(n+1)!}$ Having a very difficult time with this proof, have done pages of work but I keep ending up with 1/(k+2).  Not sure when to apply the induction hypothesis and how to get the result $1- \frac{1}{(n+2)!}$.  Please help! thanks guys, youre the greatest! I originally read this book in the mid- to late '70s.   The premise was a bureaucracy whose job it was to manipulate events in human history by making the smallest possible change that would effect the desired outcome. Not time cops in the sense of going after law breakers.  The intent was to maintain a policy of non-interference as much as possible but when interference was warranted then to make the least possible change and to do so invisibly.  For example, they might take someone's keys off the dresser and put them just out of sight underneath the dresser where they plausibly might have fallen.  The subject would never know of the manipulation but would then be delayed getting out of the house and the ripples grew from there to avert a war or otherwise affect events on a large scale.  After reading that, whenever I would lose something - especially in an improbable way such as dropping a screw at my feet and then finding it on the other side of the room half an hour later - I would take some consolation in the thought that I had just averted some global catastrophe.  I was pretty scatterbrained as a kid (we call that ADHD nowadays) so I experienced this a lot.  Given that I've spent so much time pondering the ideas from the book, I'd love to re-read it. I have a model similar to below with a continuous outcome, continuous predictor and a categorical variable. the goal of this analysis is to make inferences on the group variable. The issue is that y is bounded by x in the form of y >= -x. When the model makes predictions you can see in the plot below that the predicted value is outside the possible range. See the last plot.   How can this be remedied? A custom loss function to penalize going beyond the bound and use gradient descent regression? Or is there some other way? Thank you.   x =   rep(seq(-10,10,1),each=5)  y =  rep(0,length(x) ) weights = sample( seq(1,1000,1) ,length(x)) groups = rep( letters[1:5], times =length(x)/5  )   ## the outcome y has the relationship y &gt;= -x for(i in 1:length(x)){   y[i] = sample(  seq(-x[i],-x[i]+ ifelse(x[i]&lt;0 ,                                            sample(seq(1,10,.1),1),                                           sample(seq(5,40,.1),1) ),1)                        ,1) }   dat =data.frame(x = x, y = y, weights = weights, group = groups) model = lm(dat = dat, y ~ x + group + group * x, weights = weights) dat$FIT= predict(model, dat, allow.new.levels = TRUE)  library(ggplot2) ggplot(data = dat, aes(x = x, y = y, color = group))+geom_point( aes(size = weights))+ geom_line(data = dat, aes(x = x, y = FIT, color = group))    #data for new predictions newdata = data.frame( x = seq(-100,100,1) ,                        group = rep("c", length( seq(-100,100,1) )),                       bound = -seq(-100,100,1)                       )  ## when pridicting new data the outcome y has the relationship y &gt;= -x ## but the predicted vales are below the bound. See how red line is below blue to the left of zero new_preds  = predict(model, newdata, allow.new.levels = TRUE) ggplot(data = newdata, aes(x = x, y = new_preds, color = group))+geom_line()  +   geom_line(data = newdata, aes(x = x, y = bound, color = "green")) Possible (but not serious) glitch in close/reopen I just had one of my questions closed. (Hey - it happens to everyone) When I clicked on reopen - lo and behold - it worked. I cast a reopen vote!  Is this a glitch? I know we need 4 more votes anyway but still...  And no  tag please :) I worked on a Word document and also saved the file on my flash drive.  When it asked me to save, I pressed the Replace document option by mistake.    I can see the missing work under the Properties menu. Will I be able to recover the lost work? build argument lists containing whitespace