I am trying to import ArcPy module into spyder and it does not work.     import arcpy Traceback (most recent call last):      File "", line 1, in        import arcpy      ModuleNotFoundError: No module named 'arcpy'   I am using Anaconda 64 bit, Python 3.7, ArcGIS 10.3.1.  I have tried the following, nothing works:   Downloaded Anaconda 32 bit, Python 2.7. I am not sure if have changed everything correctly though. Do I have to change anything else after I installed Anaconda 32-bit with Python 2.7? Change spyder Python interpreter in presettings to C:\Python27\ArcGIS10.3\python.exe. When I restart Spyder the console is broken. Add ";%PYTHON_HOME%" to my environment variables in Windows advanced system settings   What else should I try?    I did not see  before.   My problem is solved now.    The following helped:   Installing Python Anaconda 32-bit with python 2.7 and activating python 2.7 in the Anaconda Prompt () Step 2&amp;3 on the following page:  Adding this to my code: sys.path.append("C:\Python27\ArcGIS10.3\Lib\site-packages") sys.path.append(r'C:\Program Files (x86)\ArcGIS\Desktop10.3\arcpy') sys.path.append(r'C:\Program Files (x86)\ArcGIS\Desktop10.3\ArcToolbox\Scripts') sys.path.append(r'C:\Program Files (x86)\ArcGIS\Desktop10.3\bin') sys.path.append("C:\Python27\ArcGIS10.3\Lib")
This questions has been asked before too and I did go through most of the suggestions. Things I have tried so far: setting up correct  path variable environment, installing anaconda 32 bits, python 2.7, or even switching to python 2.7 in cmd while initially using Anaconda 3 , adding Desktop 10.4.pth file with  following path.  C:\Program Files (x86)\ArcGIS\Desktop10.4\bin C:\Program Files (x86)\ArcGIS\Desktop10.4\ArcPy C:\Program Files (x86)\ArcGIS\Desktop10.4\ArcToolBox\Scripts   I also added those paths in environment variable   These suggestions help me to reduce the error. But Now I am getting a different error. Looks like python can find arcpy but missing another package.  Getting this error while trying to import arcpy in python 3.6.   File "C:\Program Files (x86)\ArcGIS\Desktop10.4\ArcPy\arcpy\__init__.py", line 22, in &lt;module&gt;     from arcpy.geoprocessing import gp    File "C:\Program Files (x86)\ArcGIS\Desktop10.4\ArcPy\arcpy\geoprocessing\__init__.py", line 14, in &lt;module&gt;     from _base import *  ModuleNotFoundError: No module named '_base'   Any suggestions?
How to test for an hold item name in Minecraft? I'm trying to make a command block that spawns an item in front of you if you are holding an item with a specific name. I've got these two working scripts;  /testfor @p[r=10] {Inventory:[{tag:{display:{Name:"Item Name"}}}]}  /testfor @p[r=10] {SelectedItemSlot:0,Inventory:[{Slot:0b,­id:"minecraft:diamond_sword"}]­}   but I can't get them together. The block should only look for an item in the active slot. Do compound subjects like "everyone ... and everyone..." take singular or plural verb agreement? Here are the examples of compound subjects:      Everything on the bed and everything in the closet was organised   in under an hour.   Everybody who witnessed the shooting and everybody   in the room were interviewed.   Anyone on the soccer team and   anybody on the basketball team was eligible for the scholarship.   Should I also use was instead of were in the second example? Or the first and the third examples are incorrect that I should use were instead of was. Variance of Normal Order Statistics Suppose we have $X_1, \cdots, X_n \overset{\textrm{i.i.d.}}{\sim} \mathcal{N}(0, 1)$ with $n &gt; 50$, and let $X_{(1)}, \cdots, X_{(n)}$ be the associated order statistics. Are there any references pointing to formulas that specify (or estimate) the variance of the $k^{\textrm{th}}$ order statistic, i.e. $\textrm{Var}(X_{(k)})$, for $1 \leq k \leq n$? I am looking for formulas can be explicitly evaluated without resorting back to numerical integration.  I have seen this question: , which attracted a number of answers on approximate formula for the mean of the $k^{\textrm{th}}$ order statistic, e.g. Blom (1958) (and modifications based on work by Harter (1961) and Elfving (1947)). Searching on Google also yields a number of work on the variance / standard deviation for the $k^\textrm{th}$ order statistics for small $n$, all of them opting for a computation/tabulation route. They are: Godwin(1949), Teichroew (1956), and Parrish (1992). I have also attempted to derive something myself following the method sketched by @probabilityislogic in , along the lines of: $$\textrm{Var}(X_{(k)}) = \int_{-\infty}^{\infty} \left(x-\mathbb{E}(X)\right)^2 \frac{n!}{(k-1)!(n-k)!} f_X(x)[1-F_X(x)]^{n-k}[F_X(x)]^{k-1}\;\textrm{d}x,$$ with lower case $f$ denoting the PDF of a r.v. $X$, and upper case $F$ denoting the CDF. Noting $x = F^{-1}(F_X(x))$ and using the substitution $u = F_X(x)$ (with corresponding r.v. in upper case $U$), we have: $$\textrm{Var}(X_{(k)}) = \int_{0}^{1} \left(F_X^{-1}(u) - \mathbb{E}\left(F_X^{-1}(U)\right)\right)^2\,\mathcal{B}(u | k, n-k+1) \; \textrm{d}u,$$ where $\mathcal{B}$ denotes the PDF of a beta distribution (not the beta function). This can be rewritten as the variance based on the beta distribution: $$\textrm{Var}(X_{(k)}) = \textrm{Var}_{\mathcal{B}(u | k, n-k+1)}\left(F_X^{-1}(u)\right).$$ Approximating the RHS using (the variance bit of the) delta method, we get: $$\textrm{Var}_{\mathcal{B}(u | k, n-k+1)}\left(F_X^{-1}(u)\right) \approx \textrm{Var}_{\mathcal{B}(u | k, n-k+1)}(U) \cdot \left[(F_X^{-1})'\left(\mathbb{E}_{\mathcal{B}(u | k, n-k+1)}(U)\right)\right]^2,$$ where the prime denotes the derivative. The first term of the product is standard result. For the second part, given $(F^{-1})'(\cdot)=\frac{1}{f(F^{-1})(\cdot)}$ (see e.g. ), we then have: $$\textrm{Var}_{\mathcal{B}(u | k, n-k+1)}\left(F_X^{-1}(u)\right) \approx \frac{k(n-k+1)}{(n+1)^2(n+2)} \frac{1}{\left(f\left(F^{-1}\left(\frac{k}{n+1}\right)\right)\right)^2}.$$ Substituting in the standard normal distribution ($\phi$ for PDF, $\Phi$ for CDF) and scaling it to the desired variance $\sigma^2$ we arrive at: $$\textrm{Var}(X_{(k)}) \approx \frac{k(n-k+1)}{(n+1)^2(n+2)} \frac{1}{\left(\phi\left(\Phi^{-1}\left(\frac{k}{n+1}\right)\right)\right)^2},$$ which we can throw in a $\sigma^2$ term in front if it is not a standard normal. But surely someone must have derived that somewhere (again I am looking for some references), and there is a high chance that I have gone off track somewhere above. Removing trailing newline character from fgets() input I'm in trouble with time dilation: Suppose that there's two people on the Earth (A,B), they are twins and each other has a clock. (So they are at the same reference frame). B travels in a spaceship and is orbiting around the Earth, as B's speed has increased there's some time dilation. So it's supposed that if A "looks" to B, B's clock will run slower than A's, and viceversa. And if one day B decides come back to the Earth, he will be younger than his twin and the hour of his clock would be different (earlier than A's clock) because of time dilation.  My first question is, why each person see the other's clock as the slow one? (In fact, I found some information that may solved it but I'm not sure if it's the right answer, and if it is, I don't understand it. -> It's because everyone thinks about himself as the reference frame. In other words, that for B, he is the stationary and who moves is A, so he sees A's clock run slower as B is "stopped" and the same for A. B is who is moving and A the stationary.)  The other question I have is that if it's true that each one sees the other as the slow one there's something that i missed out. We all agree that B (after going to the space and came back to the Earth) he is younger than his brother. So, why B don't see A moving and aging very fast if A see his brother and his things going very slow? Let's imagine they were looking to each other all the time, if both of them see the other going slowly once they meet and "discover" B is the young one... how is that possible?  [I think that in one episode of Cosmos of Carl Sagan (though may be I'm mistaken) he said that a neutrino "borned" in the Big Bang could have seen the creation of the Universe until today in few seconds due to its high speed, here starts my doubts: or i misunderstood something or there's contradictory information]  (I don't know anything about physics, only what is taught at high school as I'm a teenager so it'd be better to answer with no kind of calculation as I'd not understand it.) How can I keep recent files from appearing in Unity? I sometimes browse erotic media files but I would like to avoid having them appear in files &amp; folders / recent. How can I do that?  The old "making .recently-used.xbel a folder" trick from 10.10 and older doesn't work any more.   Plus I'd prefer to turn off tracking only temporarily.  I also prefer not to use a separate user for this, as switching users sometimes isn't fast enough. Hi I'm solving some exercise problems in my text : "A Course in Mathematical Statistics".  I'm in the chapter "Point estimation" now, and I want to find a UMVUE of $\theta$ where $X_1 ,...,X_n$ are i.i.d random variables with the p.d.f $f(x; \theta)=\theta e^{-\theta x}, x\gt0$.   I know that $E(X_i)=1/\theta,$ for each $i$, and also have that $\bar{X}$ (or equivalently $\sum_1^n X_i$) is a complete sufficient statistic for $\theta$. But I cannot go any further here. Somebody can help me? Admob SMART_BANNER size How do I change how executable files are handled by the file manager? When I double click on text files, nautilus asks me what I would like to do with them. I find this to be intrusive, as I just want them to open.  How can I fix this?  Note: This question is a "canonical" question on the subject; edit if needed. Note 2: Text files can be HTML, CSS, TXT, and more. How to Identify Overfitting in Convolutional Neural network? I understand that dropout is used to reduce over fitting in the network. This is a generalization technique. In convolutional neural network how can I identify overfitting? One situation that I can think of is when I get training accuracy too high compared to testing or validation accuracy. In that case the model tries to overfit to the training samples and performs poorly to the testing samples. Is this the only way that indicates whether to apply dropout or should dropout be blindly added to the model hoping that it increases testing or validation accuracy Why do people sometimes use the past perfect form of a verb when the past would suffice? (e.g. "you had mentioned") I noticed that my American friends tend to use the past perfect form when they use the verb mention in its past form, almost despite of the context of the sentence. I hear them say  "you had mentioned" a lot more often even in situations where the use of simple past would have been perfectly fine. Have you noticed it too and is it one of those unwritten rules, or is there a more formal explanation to it?  It seems like there was more verbs like that, but I am having a hard time remembering it now. If I do, I will edit the post and likely change the title to accommodate other verbs. When is the formula $$S_{\infty} = \dfrac{a}{1-r}$$ valid?   Does |$r| &lt;1$? I want to monitor the output of a command and whenever it contains a certain string I want to run another command.  Example: when command1 outputs 1234 I want to run command2 Let $\alpha$ be a regular curve in $\mathbb{R}^2$ and let all of its tangent lines pass through the origin. Also, let $\beta$ be a regular curve in $\mathbb{R}^2$ and let all of its normal lines pass through the origin.   How can I show that $\alpha$ is contained in a straight line through the origin and that $\beta$ is contained in a circle around the origin?  I know that the tangent line $\alpha(t)$ is the line that points in the direction of the tangent vector $T(t)$ and that the normal line of $\beta(t)$ is the line that points in the direction of $N(t)$, but how can I put this all together to complete the proof? Can I prevent others from editing my question? edited my question,  where I specifically said that our software sending back stacktrace to one of our servers was a user-known public feature.  He then modified the title of my post, along with the entire content, making it sound like I snuck in the feature and that our application was phoning home without our users knowing.    I specifically wrote in the original post that the feature was not sneaky. He completely changed the meaning of my post. I find this to be rather unacceptable.  A few questions:   Is it possible to prevent editing of my posts? How can I retaliate? Can I file a complaint?   Can people with  do anything they want on Stack Overflow? How to use triangle inequality to establish Reverse triangle inequality I need to use $|a+b| \leq |a|+|b|$ to show that $||a|-|b|| \leq |a-b|$ .   I have tried to represent  $||a|-|b||$ as  $||a|+(-|b|)|$ , and then get $||a|+(-|b|)| \leq |a|+|-|b||$ , but that isn't leading me anywhere given $|a-b| \leq |a|+|b|$. What's the easiest way to set up a LAMP stack? Answering your own question? Accept it. Ralink MT7601U (148f:7601) Wi-Fi adapter installation How to achieve echo cancellation with Pulse Audio? I want to use echo cancellation for my Skype calls and Empathy on Ubuntu 12.10 (pulseaudio 2.1).   Does anyone know how to do that?