I have a server which runs Debian 8. I wish to install various security updates however, prior doing so, i would like to know if any of the updates will restart a running service.    Is there a way (command - script) which can help me found out if a package will restart any process-daemon?  I would like to pinpoint here that i am interested if an update will automatically restart a service and not if a service requires a reboot after the update.
I have 4 servers with Debian Wheezy OS. I have Apticron installed that informs me about updates. Debian updates are realized so often that when I finish to update the last of 4 servers I get new email about new updates on the first server. I try to update all servers when I get a notification but I never know if there is a need to reboot the servers. I have read that if the directory "/var/run" contains file "reboot-required" I have to reboot the server. But I never have seen this file in "/var/run". How can I know when reboot is required? I don't want reboot my servers every time when I install new updates if it's not needed.  I understand that if I update PHP or MySQL, etc I don't need to reboot the server but updates usually contain many "lib...".  Below are 9 updates (I have received this week).  krb5-locales 1.10.1+dfsg-5+deb7u3 libdbus-1-3 1.6.8-1+deb7u6 libgssapi-krb5-2 1.10.1+dfsg-5+deb7u3 libk5crypto3 1.10.1+dfsg-5+deb7u3 libkrb5-3 1.10.1+dfsg-5+deb7u3 libkrb5support0 1.10.1+dfsg-5+deb7u3 libruby1.8 1.8.7.358-7.1+deb7u2 libxml2 2.8.0+dfsg1-7+wheezy3 ruby1.8 1.8.7.358-7.1+deb7u2   I have no idea what is "libkrb,libgssapi", etc. How can I detect if reboot is needed? Please do not suggest to install UnattendedUpgrades to let the servers update automatically because this can cause websites going offline if something updates not correct.
This is a Q&amp;A that I recently have figured out, so I have posted the answer below.  After installing Windows 10, every time I get a kernel update or I run the update-grub2 it always shows Windows 7 or Windows Recovery Environment instead of Windows 10.  How do I fix this permanently? Shape of a string/chain/cable/rope/wire? The height of a string in a gravitational field in 2-dimensions is bounded by $h(x_0)=h(x_l)=0$ (nails in the wall)  and also $\int_0^l ds= l$. ($h(0)=h(l)=0$, if you take $h$ as a function of arc length) .  What shape does it take?  My try so far: minimise potential energy of the whole string,  $$J(x,h, \dot{h})=\int_0^l gh(x) \rho \frac{ds}{l}=\frac{g \rho }{l}\int_0^l h(x) \sqrt{1+\dot{h}^2} dx$$  With the constraint  $$\int_0^l \sqrt{1+\dot{h}^2} dx- l=0$$ If it helps, it's evident that $\dot{h}(\frac{l}{2})=0$.  Generally, this kind of equation is a case of a constrained variational problem, meaning that the integrand in  $$\int_0^l \frac{g \rho }{l}h(x) \sqrt{1+\dot{h}^2} +\lambda(\int_0^l \sqrt{1+\dot{h}^2} dx- l)dx$$  Must satisfy the Euler Lagrange equation. The constraint must also be satisfied.  But, in truth, by this point I am clueless. $\lambda$ is worked through $\nabla J  = \lambda \nabla(\int_0^l \sqrt{1+\dot{h}^2} dx- l)$. I have tried this , but get nonsensical answers.  Is this method the best? If so, in what ways am I going about it wrongly thusfar? Isometric Embedding of a separable Banach Space into $\ell^{\infty}$ When did UX start being called UX? When did people start talking about User Experience as a role/domain similar to the way that it's used today?  The earliest reference I can find is the Norman, Miller, Henderson CHI 95 piece on Apple's set up (Donald Norman, Jim Miller, Austin Henderson: What You See, Some of What's in the Future, And How We Go About Doing It: HI at Apple Computer. Proceedings of CHI 1995, Denver, Colorado, USA)  Anything earlier?  [Edit - after @Andrew's nice answer we have 1993 as an earlier date     "I invented the term because I thought Human Interface and usability   were too narrow: I wanted to cover all aspects of the person's   experience with a system, including industrial design, graphics, the   interface, the physical interaction, and the manual." - Don Norman   ]  (I'm writing a talk on communities of practice relating to UX - and want to get my time lines right ;-) Clean URLs and php extension on nginx I've looked at dozens of other questions and references on the web - and by all my calculations, my setup should work, but it doesn't.  I have nginx installation with php-fpm.  If I try to access a .php file, it runs correctly and I get the correct results.  I got this in my config file:  location ~ \.php$ {     try_files $uri =404;     fastcgi_pass unix:/var/run/php5-fpm.sock;     include fastcgi_params;     fastcgi_param SCRIPT_FILENAME  $document_root$fastcgi_script_name; }   Now, I want to setup my web app so that /somedir/file automatically executes /somdir/file.php while still displaying /somdir/file in the browser's address bar.  So I modified my config to contain the following:  location / {     try_files $uri $uri/ $uri.php?query_string }   This kind of works, that is, the server does access the .php file.  Yet, instead of executing it using the existing location ~ \.php$ block above, it simply spits the php source code as the download into the browser.  If I append the .php manually to the requested URL, then the php is executed.  It feels as if once the server matches try_files to $uri.php, it then does not do another pass at locations to see that what it needs to do with the php files.  I tried putting the php block above and below the location /, but it makes no difference.  How can I get the php to be executed? Avoid footnotes from appearing before mark I have these \footnotetext and \footnotemark as illustrated in the figure below. I used these tags to enforce my own numbering (and because using only \footnote was not working the way I expected).    The code I use for generating the mark is:   \caption{Lista de notas presentes em um piano de 88 teclas,  com notação em Inglês, frequência em Hertz e comprimento de  onda em centímetros.\protect\footnotemark[1]}   Is there any way I can enforce my \footnotetext to appear in the same page as my \footnotemark? What is the best backup strategy for macbook pro laptop? I have a lot of data on my macbook pro retina laptop and i am looking for the best backup strategy.  I have previously had a windows desktop with an external harddrive connected all of the time and a backup program that copied to the external harddrive incrementally.  I am trying to figure out the best backup strategy given its a laptop that i move around with and travel with alot (so can't really have a external hard drive always connected)  What is the recommended backup solution for map laptops? Instead of relying on my host to send an email, I was thinking of sending the email messages using my Gmail account. The emails are personalized emails to the bands I play on my show.   Is it possible to do it? I accidentally opened too many menus (or windows) and I want to reset them to default.  It is really annoying, and effecting my animation.  Thanks Spoiler warning!  During the first escape attempt in Portal 2 (when GLaDOS is still in charge) she opens a door for you which you can choose to go through instead of following Wheatley (the blue-eyed ball). What happens if you go there? Is there PvP in Diablo 3? How does it work? Subgroups of Symmetric groups isomorphic to dihedral group Is $D_n$, the dihedral group of order $2n$, isomorphic to a subgroup of $S_n$ ( symmetric group of $n$ letters) for all $n&gt;2$? When will my device get the Android 4.1 update (Jelly Bean)? Android 4.1 (Jelly Bean) was announced at Google I|O 2012 on June 27, 2012.  (You can review  at the official Android Developer's site.)  Of course, not all devices will get this update right away and others won't get it at all. Each manufacturer and carrier often choose to add their custom modifications which tend to delay the official release.  When will each device get Android 4.1, either officially or unofficially, if ever?  See also: Are ores replenished over time? What does recursive cosine sequence converge to? I have a sequence defined as follow:  $a_0 = 1, a_n=\cos\left(a_{n-1}\right)$.  I want to count $\lim_{n\rightarrow\infty} a_n$ - it definitely does have limit by looking at the graph, the first few numbers of the limit are 0.7390851, but I have no idea, if that number is related to some other real number ($\pi$ or something like that).  The sequence is from , but they don't provide actual result for their own sequence. Allow deleting a tag wiki or excerpt Sometimes a tag wiki excerpt or body ends up with unacceptable or useless content: plagiarized text that must be removed, or a totally unhelpful dictionary definition. (For example:  — and I've seen this situation many times before.)  The only way to get rid of that content is to submit replacement text that meets the minimum length requirement. This is not always easy as writing a decent wiki, and especially a decent excerpt, requires subject knowledge.  Currently the users or even moderators who are alerted to unacceptable content in a tag wiki cannot remove that content without providing their own, which they are not always in a position to do. Yet these wikis would be better off with no content than with either unacceptable or unhelpful content, or some content written by a non-expert in a hurry.  Please provide a way for users to blank a tag wiki excerpt or body. I'm not sure what the reputation requirement should be: same mechanism as for tag wiki edits (suggested edits with approval), or only done directly by a user with the trusted user (20k) privilege, or moderator-only. As a non-native speaker of English, it can often be hard to spot some of the errors that a native speaker would find. For a long time, I've been thinking about getting a native speaker to help me with proof-reading my texts (articles, theses, application, etc), but I don't quite know where to look. What are some good ways to get proofreading for your texts?  For example, are there any websites on the Internet where one can exchange proofreading services between different languages? (Say, if you help me proofread my text in language x, I'll help you with yours in language y.) I know that we shouldn't being using the registry to store Application Data anymore, but in updating a Legacy application (and wanting to do the fewest changes), what Registry Hives are non-administrators allowed to use?    Can I access all of HKEY_CURRENT_USER (the application currently access HKEY_LOCAL_MACHINE) without Administrator privileges? Navigation to section/subsection from Beamer headline titles Beamer infolines themes, like CambridgeUS, insert the titles of the current section and subsection in the headline. These titles appear to be clickable (the screen pointer changes as if they were so) but nothing happens when one clicks them.   Is there a way to link the headline titles to the first frame of the corresponding section or subsection? Something like this already works on the theme footline: clicking on the presentation title takes you to the title page.   Edit: MWE  \documentclass{beamer} \usetheme{CambridgeUS}  \setbeamertemplate{navigation symbols}{} \title{Click on Headline} \author{A.~U.~Thor} \institute{X-University} \date{2015} \begin{document} \begin{frame}   \titlepage \end{frame} \begin{frame}[t]{Contents}   \tableofcontents[subsectionstyle=hide]  \end{frame} \section{Section 1} \begin{frame}{Section 1}   \centering \Large Section 1 \end{frame} \begin{frame}[t]{Section 1: Contents}   \tableofcontents[currentsection,hideothersubsections] \end{frame} \subsection{Subsection 1.1} \begin{frame}{Frame 1.1.1}   A frame of subsection 1.1 \end{frame} \begin{frame}{Frame 1.1.2}   Another frame of subsection 1.1 \end{frame}   \subsection{Subsection 1.2} \begin{frame}{Frame 1.2.1}   A frame of subsection 1.2 \end{frame} \begin{frame}{Frame 1.2.2}   Another of subsection 1.2 \end{frame} \section{Section 2} \begin{frame}{Section 2}   \centering \Large Section 2 \end{frame} \begin{frame}[t]{Section 2: Contents}   \tableofcontents[currentsection,hideothersubsections] \end{frame} \subsection{Subsection 2.1} \begin{frame}{Frame 2.1.1}   A frame of subsection 2.1 \end{frame} \end{document} How to write this boolean expression using only NOR gates? I'm having some trouble understanding how I can convert a boolean expression to a NOR-gate only expression.   What I'm working with looks like \$T = A B' C + A' B C' + A B\$. How would I go into implementing it with NOR gates?