How to stop a service created in python?
How do you run a Python script as a service in Windows?
What is Snell's law's main formula? My book states it as $(\sin i)/(\sin r)=n$. However, University Physics has a different say.  It says, $n_{a} \sin a =n_{b} \sin b$. Which of the following is correct? Spacings between continuous uniform random variables Every Christmas, Harry receives a mediocre gift from the Dursleys. In Harry Potter and the Chamber of Secrets he gets a toothpick.     At that moment, Hedwig swooped into the room, carrying a very small package in her beak.     “Hello,” said Harry happily as she landed on his bed. “Are you speaking to me again?”     She nibbled his ear in an affectionate sort of way, which was a far better present than the one that    she had brought him, which turned out to be from the Dursleys. They had sent Harry a toothpick    and a note telling him to find out whether he’d be able to stay at Hogwarts for the summer    vacation, too.    They hate owls, but obviously use them to contact Harry at school? How to reconcile the cashless human/Federation society with human traders and merchants From a variety of sources, including , we know that the Federation (or at least the humans) don't use money. This raises the problem that humans frequently visit worlds where there is currency, and, in the case of DS9, operate a station that has currency frequently in use (for example, Federation personnel frequently attend Quark's bar). Additionally, we see human traders.   My question is, how do humans get "money" (credits, latinum, etc.)? How would a human even get the resources to purchase their own merchant ship or the resources to fill its cargo holds with merchandise? If Federation personnel can simply be given money for the asking, why haven't they poured so much money down Quark's throat that he chokes on it? Power of a generator generates the group iff this power is coprime to the group order. Let $\langle g\rangle$ be a cyclic group of order $n$. Suppose $1\leq q \leq n-1$, I want to show that $g^q$ generates $\langle g\rangle$ if and only if $\gcd(n,q)=1$.  Suppose $g^q$ generates $\langle g\rangle$, then   $$ 1,g^q,g^{2q},...,g^{(n-1)q} $$  are all distinct and $g^{nq}=1$, since $n$ is the order of the group. Note that this is the lowest multiple of $q$ for which this is the case. Therefore $\operatorname{lcm}(q,n)=qn$ and it follows that $q$ and $n$ are coprime.  On the other hand, if $\gcd(q,n)=1$, then $\operatorname{lcm}(q,n)=qn$, we have $g^{nq}=1$ and hence all of  $$ 1,g^q,g^{2q},...,g^{(n-1)q} $$  are distinct again and $g^q$ is a generator.  Is my proof correct at all and is there maybe a more elegant argument? Confusion in symbol of subset. If every element of set A ia an element of set B then we say that A is subset of B. A is said to be proper subset if A does not equal B.  My question is - whether the symbol we use to show subset is  same as that for proper subset? I have seen that A is subset of A itself is shown by the same symbol as that for the subset while when we write improper subset, we usually write equal to sign with symbol of subset. So, please help me to know this. Ubuntu 19.04 and Gnome desktop icons Help with proof of $|x+y| \geq |x|-|y|$ My account has 20 (!) sites associated to it.  I only use it for 3-5 sites.  To reduce clutter, I would like to delete my profiles that I do not use much.  I have went through , but when I enter the profile URL as:  http://russian.stackexchange.com/users/5772/alex   it gives the error message:     oops! this isn't a link to a valid profile   What procedure do I go through to delete my profile only on certain sites? Plot above desired region Before today, I would visit Stack Overflow every day and click somewhere in the upper-left corner (I've forgotten what it said, and it's gone now!) and if I didn't have any notifications I would see a list of interesting questions from various sites in the Stack Exchange network which - I believe - were classified as "hot".  Now this new top bar has appeared, and I have no idea how to get this list any more. I'm not really sure what it was called so my searches have been useless as well. Prove $a^\alpha b^{1-\alpha} \le \alpha a + (1 - \alpha)b, \; a,b > 0,\; 0 < \alpha < 1$ I have no idea how to do this. Any help would be appreciated. The chapter I'm on is about differentiation and the mean value theorem.  Prove $a^\alpha b^{1-\alpha} \le \alpha a + (1 - \alpha)b, \; a,b &gt; 0,\; 0 &lt; \alpha &lt; 1$ Calculating centroids of polygon using ArcPy? I am trying to calculate the centroids of a polygon and add the x- and y-coordinate to their respective fields:  arcpy.env.workspace = r"C:/..."  input_fc = "shapefiles/precincts_v.shp" arcpy.AddField_management(input_fc, "X", "DOUBLE") arcpy.AddField_management(input_fc, "Y", "DOUBLE")  arcpy.CalculateField_management(input_fc, "X", "!SHAPE.CENTROID@DECIMALDEGREES!.split()[0]", "PYTHON")  arcpy.CalculateField_management(input_fc, "Y", "!SHAPE.CENTROID@DECIMALDEGREES!.split()[1]", "PYTHON")    but I an invalid syntax error. Where is the mistake?  Edit: exact error message  Traceback (most recent call last):   File "C:\Users\mquentel\Dropbox\PLSS\CA voting data\Python\CONSTRUCT_merge_voting_and_census.py", line 17, in &lt;module&gt;     arcpy.CalculateField_management(input_fc, "X", "!SHAPE.CENTROID@DECIMALDEGREES!.split()[0]", "PYTHON")   File "C:\Program Files (x86)\ArcGIS\Desktop10.4\ArcPy\arcpy\management.py", line 3360, in CalculateField     raise e ExecuteError: ERROR 000539: SyntaxError: invalid syntax (&lt;expression&gt;, line 1) Failed to execute (CalculateField). If an element has a unique right inverse, is it invertible? Andrew Price released a nice tutorial on how to nicely put 3D objects on top of a real image:   I have seen images, such as this:  which have 3D elements over images and have actual reflections from the object showing up on the wet asphalt.  How can this effect be achieved using render passes (or any other way)?  Here is another example (from ): Consider the general linear regression model: $$y_i = \beta_0 + \beta_1x_{i1} + \beta_2x_{i2} + \cdots + \beta_px_{ip} + \epsilon_i = \mathbf{x}_i^t \beta + \epsilon_i$$  where $\textbf{x}_i = (1,x_{i1},x_{i2},\cdots,x_{ip})^T$, $\beta=(\beta_0,\beta_1,\cdots,\beta_p)^T$ and $\epsilon_i$ are iid N(0,$\sigma^2$).  I would like to see a complete proof of the following identity from first principles: $$\sum_{i=1}^n(y_i - \bar{y})^2 = \sum_{i=1}^n(\hat{y}_i - \bar{y})^2 + \sum_{i=1}^n(y_i - \hat{y}_i)^2$$ where $\hat{y}_i= \mathbf{x}_i^t \hat{\beta} $ ($\hat{\beta}$ is the least square estimator, $\bar{y}$ ia the sample mean of $y_i$).  I know that the two terms on the right can be obtained by subtracting and adding $\hat{y}_i$ on the left side. But this introduces a "cross term": $$\sum_{i=1}^n2(\hat{y}_i - \bar{y})(y_i - \hat{y}_i)$$  Many texts claim that this is zero, but I have not seen a general proof of this statement. How can this be shown? Just like if we have any quadratic equation which has complex roots, then we are not able to factorize it easily. So we apply quadratic formula and get the roots.  Similarly if we have a cubic equation which has two complex roots (which we know conjugate of each other) and one fractional root, then we are not able to find its first root by hit &amp; trial.  So my question is like quadratic formula, is there exist any thing like cubic formula which help in solving cubic equations?  For example, I have an equation $$2x^3+9x^2+9x-7=0\tag{1}$$ and I have to find its solution which I am not able to find because it has no integral solution. Its solutions are $\dfrac {1}{2}$, $\dfrac{-5\pm \sqrt{3}i}{2} $, I know these solutions because this equation is generated by myself.  So how can I solve equations like these?  Also while typing this question, I thought about the derivation of quadratic formula, which is derived by completing the square method.  So I tried to apply ‘completing the cube’ method on the general equation $ax^3+bx^2+cx+d=0$ but it didn't help.  So please help me in finding a cubic formula or to solve the equations like given in example by an alternative method. Suppose that $f$ is analytic on a close curve γ. Prove or disprove $\int_\gamma \overline{f(z)}f'(z)dz$ is purely imagine. Suppose that $f$ is analytic on a close curve γ. Prove or disprove   $$\int_\gamma \overline{f(z)}f'(z)dz$$  is purely imagine.  I know that $f$ is analytic on a close curve, then   $$\int_\gamma f(z) dz=0$$  I tried an example with $\gamma =e^{it}$ with $0\leq t\leq 2\pi$, I often get the real part of the integral equal zero.  I tried let $f=u+iv$ so $f'=u_x+iv_x$. Since $f=u+iv$, $\overline{f}=u-iv$  $$\overline{f(z)}f'(z)=uu_x+vv_x+i(uv_x-vu_x)$$  But this doesn't get me anywhere. Any help would be greatly appreciated. Is there a cross-browser onload event when clicking the back button? For all major browsers (except IE), the JavaScript onload event doesn’t fire when the page loads as a result of a back button operation — it only fires when the page is first loaded.  Can someone point me at some sample cross-browser code (Firefox, Opera, Safari, IE, …) that solves this problem? I’m familiar with Firefox’s pageshow event but unfortunately neither Opera nor Safari implement this. I can't destroy blocks in Minecraft Creative Mode (singleplayer)