"@" in the password breaks exporting proxy variable
Apt-get update with an @ in password error
Redundant prepositions? This is a tooltip in an application:     Identifies the site name to which the GL code belongs to.   Can I say that it is incorrect to use "to" twice here and we should remove 1 of them?  Other examples:       Identifies the vendor to which the port speed is associated with.   Provides the vendor to which the milestone is associated with.   (They are both tooltips, too)  The repetitions here are incorrect, aren't they? Please confirm. Hamiltonian Monte Carlo for dummies Could you provide a step-by-step for dummies explanation of how Hamiltonian Monte Carlo work?  PS: I've already read the answers here, , and here, , and here,  and they do not address it in a step-by-step way. Convergence of exponential Brownian martingale to zero almost surely Define the exponential Brownian martingale as $N_t = \exp\left\{a W_t - \frac12 a^2 t \right\}$ which is a martingale with respect to the natural filtration of $W$ which stands for a standard Brownian motion.  I now want to prove that $N_t \rightarrow 0$ a.s. for $t \rightarrow \infty$. As $N_t$ is a martingale it is by definition in $L^1$ hence Doob's martingale convergence theorem tells us that there exists a $N_\infty \in L^1$ such that $N_t \rightarrow N_\infty$ a.s., but how could I prove that $N_\infty \equiv 0$? Any help is greatly appreciated! If/Else with Selenium IDE - when confirmation message comes up I have a scenario, in case of the user registration successful, it will display a success message on the next page otherwise an error message shows on the same page. How to automate the test case to return as passed if it is success and failure in case of error message comes up.  Please help me out here. Extension of degree 2 with characteristic not 2 I am told that $K \leq L$ is a field extension of degree 2 and that $K$ has characteristic not 2. I am then asked to show that $\exists \: \alpha \in L$ such that $L = K(\alpha), \; \alpha^2\in K $  So far I have that:  $\exists \; \alpha_1, \alpha_2 \in L$ such that $L = K( \alpha_1, \alpha_2)$  $\Rightarrow |L:K| = |L:K(\alpha_1)| |K(\alpha):K| $ so $|K(\alpha):K| = 1$ or $2$  $|K(\alpha_1):K| = 2 \Rightarrow L = K(\alpha_1)$ and $deg(f_{\alpha_1}(t)) = 2  $ where $f_{\alpha_1}(t)$ is the minimal polynomial of $\alpha_1$ over $K$   So $f_{\alpha_1}(t) = t^2 + at + b$ for some $a,b \in K$  Also, $|K(\alpha_1):K|=1 \Rightarrow K(\alpha_1) = K$ and $L = K(\alpha_2)$ which means $degf_{\alpha_2}(t) = 2$ where $f_{\alpha_2}(t)$ is the minimal polynomial of $\alpha_2$ over $K$.   So $f_{\alpha_2}(t) = t^2 + at + b$ for some $a,b \in K$  Given that we consider the same polynomial each time, relabel to consider:   $f_{\alpha}(t) = t^2 + at+ b $ for some $a,b \in K$  We have already demonstrated that $L=K(\alpha)$ for some $\alpha \in L$ so now we much show that $\alpha^2 \in K$  $\alpha^2 \in K \Leftrightarrow a = 0_K$  I now have no idea how to show that this coefficient of $f_{\alpha}(t)$ is necessarily $0$.   I know that $f_{\alpha}(t)$ has two roots in $L$ and that because $K$ and thus $L$ has characteristic not 2, they cannot be the same root, but I don't know how to then conclude that they must sum to $0$  Any help would be greatly appreciated. alias multi commands as one alias I made an alias for youtube-dl  with some options  like that  yd="youtube-dl -cit -f 18"   so I can download it like   yd URL   I want to modify it to show only the two lines from the output using   grep -e "Downloading video #" -e ETA  I can make it in two aliases using the |   but is there a way to make it one alias I can't not be pregnant $X$ is Hausdorff if and only if the diagonal of $X\times X$ is closed Can't execute terminal commands: "the command 'sudo' is available in '/usr/bin/sudo'" I have been using Ubuntu 12.04 for quite a while and have never had a problem come at me out of the blue like this. I'm trying to install python 3.2 on my Ubuntu system and every time I run the code to compile the python source, I get this error:  'Command 'sudo' is available in '/usr/bin/sudo' The command could not be located because '/usr/bin' is not included in the PATH environment variable. sudo: command not found'   I've also tried running gksudo command to view what my environment shows but I pretty much get the same error. How can edge rings be selected in a predictable way? When trying to select multiple edge-rings Shift-Alt-RMB sometimes loops get selected in the one (green) way or the other (red) way.  I couldn't derive a general rule.   How can two or more face-rings following one direction be selected ?  (Easy to reproduce with a default torus mesh.) Understanding Clip Warning 000117 for Polygons? This error makes little sense because 95% of the time this works without any problem, but here is the situation:  I am clipping polygon A by polygons B-H.  While most of the time this works perfectly, occasionally this happens:   All layers are from the same coordinate system, and the processing extent is the same as polygon A when I setup the clip. Polygons C-H clip just fine without any errors, so it is usually polygon B that has the issue; however, most of the time there are no issues whatsoever. The polygons do overlap each other. I have repaired the geometry, but the results are the same.  Given that it isn't a coordinate problem, a processing extent problem, or even a geometry problem, what else could it be causing this error, and what would I have to do to resolve this problem?  UPDATE:  The error happened again with my largest set of Polygon A; however, I then deleted 75% of the Polygon A set and it worked just fine. So my question now is: how limited is the Clip feature when it comes to large areas, and is there a way around this without having to divide the Polygon A shapefile into several segments? Given that indexing is so important as your data set increases in size, can someone explain how indexing works at a database-agnostic level?  For information on queries to index a field, check out . Why is the Yang–Mills existence and mass gap problem so fundamental? Ref:   Can anyone please explain why the Yang–Mills Existence and Mass Gap problem is so important / fundamental to contemporary mathematics (and, presumably, theoretical / mathematical physics)?  If possible, please include the following in your answer / response:  (1) Why the problem is so fundamental / important - for both mathematics and theoretical / mathematical physics; (2) How the solution to the problem would impact research in the above two fields; (3) (If applicable) What progress has been made so far in resolving it; (references to papers, books, other resources would be helpful).  I'm an upper-level undergraduate in theoretical physics, and so am seeking an answer / response at such level. More informative flagging history for comments Can't deep learning models now be said to be interpretable? Are nodes features? For statistical and machine learning models, there are multiple levels of interpretability: 1) the algorithm as a whole, 2) parts of the algorithm in general 3) parts of the algorithm on particular inputs, and these three levels split into two parts each, one for training and one for function eval. The last two parts are much closer than to the first. I'm asking about #2, which usually leads to better understanding of #3). (if those are not what 'interpretability' means then what should I be thinking?)  As far as interpretability goes, logistic regression is one of the easiest to interpret. Why did this instance pass the threshold? Because that instance had this particular positive feature and it has a larger coefficient in the model. It's so obvious!  A neural network is  the classic example of a model that is difficult to interpret. What do all those coefficients mean? They all add up in such complicated crazy ways that it is hard to say what any particular coefficient is really doing.  But with all the deep neural nets coming out, it feels like things are becoming clearer. The DL models (for say vision) seem to capture things like edges or orientation in early layers, and in later layers it seems like some nodes are actually semantic (like the proverbial ). For example:    ()  This is a graphic () created by hand for presentation so I am very skeptical. But it is evidence that somebody thinks that is how it works.  Maybe in the past there just weren't enough layers for us to find recognizable features; the models were successful, just not easy to post-hoc analyze particular ones.  But maybe the graphic is just wishful thinking. Maybe NNs are truly inscrutable.  But the many graphics with their nodes labeled with pictures are also really compelling.    Do DL nodes really correspond to features? Provide a means to reward users and their answers (decoupled from bounties) Can we move "Start a bounty" to a more intuitive location? When I apply to a PhD program, may I ask a postdoc who closely supervised me to write a recommendation letter? My supervisor also has written one for me, but I believe the postdoc can comment on my research skills in a more detailed and precise way. Does a postdoc have enough authority to convince admission committee? Is it possible to determine the exact date and time (if possible) of creation of an Apple ID?   Is there any official or unofficial way to establish this if you don't have the initial sign up information recorded? How do you start Windows 10 in safe mode? I've been through the Windows 10 upgrade, and am experiencing a recurring "INTERNAL_POWER_ERROR", which is stopping me from logging in.  I'd like to be able to try to boot to safe mode, but it appears that pressing F8 during boot is no longer enough, so how can I boot in safe mode (or any of the other recovery options) on a Windows 10 PC that doesn't let me log on?