I'm looking for a group policy setting or a third-party program that can prevent Windows 10 (and earlier) from a logoff, restart, or shutdown command, initiated by either the user or the system.  I didn't have as many issues with this in Windows 7, however Windows 10 has automatically restarted my computer several times from updates in the middle of me working on something. I know other users have complained about this over the past several months as well. I have also accidentally logged off of my computer once or twice before while I have programs and files open, and it doesn't prompt to close programs or anything of that nature.  I would like to be able to totally prevent the system from logging off, restarting, or shutting down unless I manually close all of my open programs and files first. Does anyone know of a way to do this?  As a note, I've already set the local policy item under Computer Configuration > Administrative Templates > System > Shutdown Options for "Turn off automatic termination of applications that block or cancel shutdown" to "Enabled".  :::EDIT:::  I've seen this question:    Unlike that question, I'm asking for a group policy setting (that I haven't already set) or a third-party program that will prevent Windows 10 (and earlier) from not only being shutdown or restarted, but also prevents a log off command. The question linked refers to no program or group policy that will suffice as an answer to my question.
I am running a critical research program on a Windows 7 PC that needs to run uninterrupted for several months. I have had to re-initialize the entire experiment several time due to unexpected restart. Windows Update is disabled, and I have removed automatic updating from all background programs that have an option for it, but I am still getting restarts at random intervals that completely destroy my experiment.   Is there some way to prevent any and all restart requests?
Is there a way to make a true toon shader material in Cycles?  Here's, in order of importance, what would be ideal to find in such a shader:   Must use Cycles Must be an actual shader Must not rely on lighting Must be independent of camera position Must react directly to lighting rather than manually having to change it to emulate it Should be easily made into a node-group Should have the following configurability:   Main color Darkness color Shadow depth (how far the shadow goes from the unlit side)    Below, I'll be listing some already-found methods and their flaws:    Cycles's Toon BDSF:  Source: Blender  Result:    Node setup:    Cons:   Not a clear-cut two-color shading Reacts to diffusion of surrounding objects      Mask &amp; Ramp:  Source:   Result:    Node setup (Compositor):    Cons:   Very grainy Does not support colour textures Not easy to change shadow depth in a nodegroup Not a material, requires compositor Requires use of object indexes     Shadeless Fresnel:  Source:   Result:    Node setup:    Cons:   Uses camera's direction Ignores lighting Not easy to change shadow depth in a nodegroup     Shadeless Normal:  Source:   Result:    Node setup:    Cons:   Ignores lighting Direction of shadow is manually changed Not easy to change shadow depth in a nodegroup   However, this one is easily the best one. It's pretty great, and would work still images very well.    That's all I've got. Does anyone else have any methods that fall under most of the criteria I listed above? Also note that OSL is totally fine, if it works. How to encrypt a file or directory in Linux? What's the most popular command to do such things as encrypting a file or directory in terminal in Linux? I need to convert an arbitrary amount of milliseconds into Days, Hours, Minutes Second.  For example: 10 Days, 5 hours, 13 minutes, 1 second. Got ransomware and Shadow explorer doesn't work indentation of a whole paragraph My problem is that I would like to write something like in LaTeX:   But I can't seem to do it wihtout reading like:   Which is pretty anoying to do all the time, in the middle of writting. Is there a code to do it for a whole paragraph without written \hspace*{1,5 cm} in middle of a sentence If $\mathbb f$ is analytic and bounded on the unit disc with zeros $a_n$ then $\sum_{n=1}^\infty \left(1-\lvert a_n\rvert\right) \lt \infty$ I'm going over old exam problems and I got stuck on this one. Suppose that $\mathbb{f}\colon \mathbb{D} \to \mathbb{C}$ is analytic and bounded. Let $\{a_n\}_{n=1}^\infty$ be the non-zero zeros of $\mathbb{f}$ in $\mathbb{D}$ counted according to multiplicity. Show that  $$ \sum_{n=1}^\infty \left( 1 - \left|a_n \right|\right)\lt\infty $$  I can understand that $\left|a_n \right|$ goes to $1$ since zeros are isolated, but it doesn't help showing the series is convergent. Any help will be appreciated! I'm currently taking Quantum Mechanics in school and I came across a table displaying the following in the given order:   $E_n (\text{energy levels}), g_n (\text{eigen functions})$   $n \ l, [m]$  $E_1, 1$   $1s, [0]$  $E_2, 4$   $2s, [0]$ $2p, [-1,0,1]$  $E_3, 9$   $3s, [0]$ $3p, [-1,0,1]$ $3d, [-2,-1,0,1,2]$    Now, as I understand $n$ defines the size of the orbital, $l$ the shape and $m$ the orientation.  My question is, how does the atoms shell model fit into this if one can have two electrons per orbital? Are $1s$ the same as the orbital $2s$, but just renamed for the sake of higher energy levels? Or do two similarly looking orbits exist for different energy levels? For example two "layers" of spherical electron clouds for an atom with $4$ electrons.  I just can't see how $2$, $8$, $18$ becomes $2$, $8$, $8$ as we were taught in Physics at high school? Am I missing something? Given a recurrence relation:   $$ x_{n+2} = px_{n+1} + qx_n + r $$   Find the general term $x_n$ given initial conditions $x_1 = a$ and $x_2 = b$, where $a,b,p,q,r$ are some given numbers, $n \in \mathbb N$.   Since this is a non-homogeneous linear recurrence relation i've started with solving for $x_n^h$ which is a solution for homogeneous relation:  $$ x_{n+2} - px_{n+1} - qx_n = 0 \\ \lambda^2-p\lambda - q = 0 $$  I'm assuming here that two distinct roots $\lambda_{1,2}$ exist for this equation (single root case is handled similarly). So the general term is in the form:  $$ x_n = C_1\lambda_1^{n-1}+C_2\lambda_2^{n-1} $$  With the initial condition it's possible to find the values for $C_1$ and $C_2$:  $$ C_1 + C_2 = a \\ C_1\lambda_1 + C_2\lambda_2 = b $$  After solving the system of equation with respect to $C_1$ and $C_2$:  $$ C_1 = \frac{b-a\lambda_2}{\lambda_1 - \lambda_2} \\ C_2 = \frac{b-a\lambda_1}{\lambda_2 - \lambda_1} \\ $$  Which eventually results in:  $$ x_n^h = \frac{(a\lambda_2 - b)\lambda_1^{n-1} - (a\lambda_1-b)\lambda_2^{n-1}}{\lambda_2 - \lambda_1} $$  Final solution consists of a sum of particular and homogeneous solutions, but that is where I got stuck. What is the way to find the particular solution for the given problem? I'm pretty new to such kind of problems so any details are very much appreciated.  upd:  Based on the technique in @rtybase answer here are my findings:  $$ \begin{align} x_1 &amp;= a \\ x_2 &amp;= b \\ x_3 &amp;= pb - qa + r \end{align} $$  Writing the system for $c_1, c_2, c_3$:  $$ \begin{align} a &amp;= c_1 + c_2 + c_3 \\ b &amp;= c_1\lambda_1 + c_2\lambda_2 + c_3 \\ pb+qa+r &amp;= c_1\lambda_1^2 + c_2\lambda_2^2 + c_3 \end{align} $$  Now solving for the coefficients gives a huge formula. The answer to this problem suggests that:  $$ x_n = \frac{(\lambda_2(a+\gamma) - b -\gamma)\lambda_1^{n-1} - (\lambda_1(a + \gamma) - (b-\gamma))\lambda_2^{n-1}}{\lambda_2 - \lambda_1} - \gamma $$  Where:  $$ \gamma = \frac{r}{p+q-1} $$  Unfortunately I was not able to arrive at exactly the same result, but testing my solution (not posting since it's monstrously big) using SameQ in Mathematica with the given answer shows that they are equivalent. Those transformations are not very obvious to me, so i skipped them since the answer matches the given one (yet the symbolic expressions are different) Unsubscribe anonymous method in C# Is it possible to unsubscribe an anonymous method from an event?  If I subscribe to an event like this:  void MyMethod() {     Console.WriteLine("I did it!"); }  MyEvent += MyMethod;   I can un-subscribe like this:  MyEvent -= MyMethod;   But if I subscribe using an anonymous method:  MyEvent += delegate(){Console.WriteLine("I did it!");};   is it possible to unsubscribe this anonymous method?  If so, how? How do I delete a board in Trello? Why are irrational numbers uncountable and rationals countable? Question 1: Why are irrational numbers uncountable and rationals countable?  I really struggle to understand this. I initially thought it had something to with the fact that between any two numbers there will always be a irrational number. But now it has come to my attention that the same holds for rational numbers. So I can't really see the difference between them. What is it that makes the difference? Why can we line up all rational numbers one-to-one with the natural numbers, but not the irrationals with the naturals?  Sorry for a perhaps basic question, but I really, really struggle with it. Thanks. What level is a spell if you cast it without expending a spell slot? Characterization convex function. Is there a way to set an "Adventure Mode Boundary" in Minecraft?  I am trying to create this village where players can spawn in, and then set out to explore the world and build and do normal minecraft stuff. I don't want them to destroy this village, so I want them to be in adventure mode when they are in the village and then switch them to survival when they leave, and vice-versa. When they return to the village, they get switched back to adventure mode.  In other words, I want to set an "Adventure Mode Boundary" to protect buildings. I am working without mods. I am hoping there is an simple way using command blocks. I've read a lot about PCA, including various tutorials and questions (such as , , , and ).   The geometric problem that PCA is trying to optimize is clear to me: PCA tries to find the first principal component by minimizing the reconstruction (projection) error, which simultaneously maximizes the variance of the projected data.    When I first read that, I immediately thought of something like linear regression; maybe you can solve it using gradient descent if needed.  However, then my mind was blown when I read that the optimization problem is solved by using linear algebra and finding eigenvectors and eigenvalues. I simply do not understand how this use of linear algebra comes into play.  So my question is: How can PCA turn from a geometric optimization problem to a linear algebra problem? Can someone provide an intuitive explanation?  I am not looking for an answer like  that says "When you solve the mathematical problem of PCA, it ends up being equivalent to finding the eigenvalues and eigenvectors of the covariance matrix." Please explain why eigenvectors come out to be the principal components and why the eigenvalues come out to be variance of the data projected onto them  I am a software engineer and not a mathematician, by the way.  Note: the figure above was taken and modified from . What is the purpose of Microsoft.SharePoint.Runtime.dll in CSOM? I know we need to use Microsoft.SharePoint.Client and Microsoft.SharePoint.Client.Runtime dll's reference in .NET managed CSOM application development. But can someone help me understand why we have to use Microsoft.SharePoint.Client.Runtime and whats it's purpose, in detail. or point me to a reference please. Thank you in advance Prove that functions map countable sets to countable sets One of my homework problems asks to prove that if $f:X\to Y$ is a function and $A$ is a countable subset of $X$, then $f(A)$ is countable.  I believe I have a valid proof by partitioning the set A into equivalency classes based in image under $f$. Then using that partition as domain for a choice function $C_f$ back to $A$. So now the function $f$ restricted to the domain (range $C_f$) $f|_{range(C_f)}$ maps to $f(A)$ 1-1 and onto. Therefore  $$|f(A)|=|range(C_f)|\leq |A|=\aleph_0$$ $\therefore f(A)$ is a countable set. $\quad \blacksquare$  My problem is that I used the axiom of countable choice $AC_\omega$ in my proof but that isn't a part of the course I am taking. Does anyone have a simpler proof or one that does not involve Choice? How to edit command line in full screen editor in ZSH? How to know if something is a primitive concept, a law, a definition or a theorem Some basic Physics books are often misguiding in the sense that they don't make clear whether something is a primitive concept, a law, a definition or a theorem. This is often a little confusing. I've asked here some moments ago if there's a definition of force, and I've been redirected to a question about whether Newton's Laws are laws or definitions of mass and force.  This is just an example, but there are many others, like for instance, the conservation of energy, which some books present as a theorem, and some places says that this is a law of Physics. Time on the other hand, is something that according to Feynman's lectures on Physics, cannot be defined, so we just say how to measure it and leave it as a primitive concept.  In this context: how in general can we identify whether something is a primitive concept, a fundamental law of Physics, a definition or a theorem? What posts should be escalated to staff using [status-review], and how do I escalate them?