I don't have enough reputation (1K) to view the individual up and downvote counts on a post on Stack Overflow. Therefore, the cursor is the default one when I hover a post's score.  However, when an answer is added to the list of answers via a "There's 1 new answer to this question" message, the cursor is a pointer, like I can view the individual counts. This is only front-end: when I click on it, I get an "error during vote count fetch".  How to reproduce:   Go to any site where you have less than 1K rep Go to any question Wait for someone to post an answer Try to view the individual votecounts
When a user has the  privilege, they can click on the post score to see the individual counts for upvotes and downvotes.  When a user doesn't have this privilege this functionality isn't present, except after loading newly added answers without refreshing the page. After clicking the "new answers to this question" link the click functionality to view vote counts is added to all posts, though actually clicking on it results in a dialog stating that an error occurred (I'd assume due to not having the required reputation).  May be related to the fix for this previous bug report:
Greatest and Least Resistance and Current Characteristics of Parallel vs Series circuits Which type of circuit would have the greater resistance?  Which type would have the greater current? and Why?  My book says that parallel has the greater resistance than current as parallel wiring if thought as water pump tubes has greater resistance during water flow.  Contrary to my book, if I make up numbers to solve for which has the greater resistance, i find that  series has greater resistance.  Equivalent resistance of 2 Ohm resistor in series is greater than that of 2 resistors with 2 ohms in parallel. I Data   I want operator users on this machine to mount their own cifs shares The sudoers file already contains the /bin/mount -t cifs //*/* /media/* -o username=* command for all operators I want the users to mount a cifs share through a script typing the password only once, not twice. The sudo password and the cifs password are identical.   What I already have  This script works:  #!/bin/bash sudo 'mount -t cifs //192.168.1.1/home /media/$USER/home -o username=$USER'   ...but it requires the users to type the same password twice!     Once for sudo Once for the mount itself   This would also work:  #!/bin/bash echo -n Password:  read -s szPassword echo $szPassword | sudo -S sh -c 'echo $szPassword | mount -t cifs //192.168.1.1/home /media/$USER/home -o username=$USER'   ...but this would require me to allow all operator users to be able to sudo sh (major security problem)  Question  How to mount a cifs share in bash¹ without putting sh in the sudoers file nor creating a permanent/temporary file???  Note 1: no python, perl, C, Go, ... please? Note 2: I know I can just remove the password through the sudoers file, but I'm trying to tighten security, not loosen it, without giving up convenience... Is my expansion of the state $| x \rangle$ correct? In my quantum mechanics textbook it says that the relation between the basis $|x\rangle$ and $|p\rangle$ is given by:  $\langle p | x \rangle = \Large \frac{e^{-ip x/ \hbar}}{\sqrt{2\pi \hbar}} \, .$  However, i'm not sure how to go about proving this relation. My idea was that the eigenstates of momentum can be written as below:  $\phi(x,p) = \Large \frac{1}{\sqrt{2\pi \hbar}} e^{-ipx/\hbar},$  which form an orthogonal basis.  But, we can expand any state, $|\text{state}\rangle$, in terms of the othorgonal basis right? So is my notation below correct for the expansion of the state $| x \rangle$ ?  $|x\rangle = \int_{-\infty}^{+\infty} \phi(p', x) |p'\rangle dp'$  If it were correct then the following would also be correct?  Using the fact that $\langle p | p' \rangle = \delta(p - p')$, $\langle p | x \rangle$ can be computed:  \begin{align} \langle p | x \rangle =&amp; \int_{-\infty}^{+\infty} \phi(p', x) \langle p | p' \rangle dp' \\ =&amp; \int_{-\infty}^{+\infty} \phi(p', x) \delta(p - p') dp' \\ =&amp; \phi(p, x) \\ =&amp; \Large \frac{e^{-ip x/ \hbar}}{\sqrt{2\pi \hbar}} \end{align} as required.  Does the logic work here? How to test if a player is near coordinates in 1.13? find and echo file names only with pattern found I used this a lot, the improvement I try to achieve is to avoid echo file names that did not match in grep. Better way to do this?      for file in `find . -name "*.py"`; do echo $file; grep something $file; done TeX Live 2016: minted doesn't work with LuaLaTeX (bug fixed in June 2016) I've installed TeX Live 2016 as it was released today (thanks to the developers for that).  Now I have the following MWE:  \documentclass{article} \usepackage{minted} \begin{document}  \begin{minted}{ruby} class Foo   def init     pi = Math::PI     @var = "Pi is approx. #{pi}"   end end \end{minted}  \end{document}   When running pdflatex --shell-escape test.tex it runs through the file and produces the PDF as expected. Doing the same with lualatex --shell-escape test.tex fails with  This is LuaTeX, Version 0.95.0 (TeX Live 2016)   system commands enabled. (./test.tex LaTeX2e &lt;2016/03/31&gt; Babel &lt;3.9r&gt; and hyphenation patterns for 1 language(s) loaded. (/opt/texlive/2016/texmf-dist/tex/latex/base/article.cls Document Class: article 2014/09/29 v1.4h Standard LaTeX document class (/opt/texlive/2016/texmf-dist/tex/latex/base/size10.clo)) (/opt/texlive/2016/texmf-dist/tex/latex/minted/minted.sty (/opt/texlive/2016/texmf-dist/tex/latex/graphics/keyval.sty) (/opt/texlive/2016/texmf-dist/tex/latex/oberdiek/kvoptions.sty (/opt/texlive/2016/texmf-dist/tex/generic/oberdiek/ltxcmds.sty) (/opt/texlive/2016/texmf-dist/tex/generic/oberdiek/kvsetkeys.sty (/opt/texlive/2016/texmf-dist/tex/generic/oberdiek/infwarerr.sty) (/opt/texlive/2016/texmf-dist/tex/generic/oberdiek/etexcmds.sty (/opt/texlive/2016/texmf-dist/tex/generic/oberdiek/ifluatex.sty)))) (/opt/texlive/2016/texmf-dist/tex/latex/fancyvrb/fancyvrb.sty Style option: `fancyvrb' v2.7a, with DG/SPQR fixes, and firstline=lastline fix  &lt;2008/02/07&gt; (tvz)) (/opt/texlive/2016/texmf-dist/tex/latex/float/float.sty) (/opt/texlive/2016/texmf-dist/tex/latex/base/ifthen.sty) (/opt/texlive/2016/texmf-dist/tex/latex/tools/calc.sty) (/opt/texlive/2016/texmf-dist/tex/latex/ifplatform/ifplatform.sty (/opt/texlive/2016/texmf-dist/tex/generic/oberdiek/pdftexcmds.sty (/opt/texlive/2016/texmf-dist/tex/generic/oberdiek/ifpdf.sty) (/opt/texlive/2016/texmf-dist/tex/generic/oberdiek/luatex-loader.sty (/opt/texlive/2016/texmf-dist/scripts/oberdiek/oberdiek.luatex.lua))) (/opt/texlive/2016/texmf-dist/tex/generic/oberdiek/catchfile.sty) uname -s &gt; "test.w18"  ! Package catchfile Error: File `test.w18' not found.  See the catchfile package documentation for explanation. Type  H &lt;return&gt;  for immediate help.  ...                                                l.93     \CatchFileDef\@tempa{\ip@file}{}  ?    As mentioned, it's a freshly installed TeX Live 2016; I've also checked the installed Pygmentize version, which is 2.1.3 (installed via pip). Testing with TeX Live 2015, the above code, however, works without problems with both pdflatex and lualatex.  Does anybody have a hint for me on how to fix this, or is it a bug in lualatex or minted (or whatever other package) that should be reported?  Update: With minted version 2.2 (2016-06-08), the package loads the shellesc package automatically, as mentioned by @David Carlisle and @egreg in the comments; therefore, the problem should not occur any more, if you have this version installed. Visual Flow: How to set Date field to Null / Blank? I'd like to see if somebody has been trying to log-in by brute-force into my Ubuntu 12.04 server over SSH. How can I see if such activities have been taking place? sstatic.net SSL certificate is for an incorrect domain Where to set proxy ignore list? I upgraded to ubuntu 11.10 from 11.04, shocked to see few things...    My system is behind a proxy, so I did set a proxy setting. Being a web developer, I want to remove a lot of addresses that I type in browser address bar to not hit proxy. There's no such ignore list in ubuntu 11.10, what/where do I do it? What was the requirement to change the way network gui worked? Below, the  of second-order logic is used.    My question is about a second-order analogue of $ZFC$ other than the usual "second-order $ZFC$." Rather than define the latter, I'll just state that its (set-sized) models are exactly the $V_\kappa$s with $\kappa$ strongly inaccessible (or if you prefer, the uncountable Grothendieck universes).  Specifically, I'm interested in the second-order theory consisting of the usual (first-order) axioms of Pairing, Extensionality, Union, Choice, Infinity, and Powerset, and the Separation and Replacement schemes ranging over second-order formulas. I'll call this "$ZFC_2^{scheme}$."    Specifically, for each formula $\varphi(x, y_1,...,y_k)$ of second-order logic with only the displayed variables, each of which is first-order, we have a corresponding Separation and Replacement instance. We do not allow second-order parameters here, so formulas with second-order free variables don't yield Separation/Replacement instances.   The passage from $ZFC$ to $ZFC_2^{scheme}$ has a nice uniformity: it's an example of a more general operation $\mathcal{ZFC}$ which spits out a $ZFC$-analogue given a logic at least as strong as first-order logic.    This is the reason for the parameter restriction above: I want $ZFC_2^{scheme}$ to look just like $\mathcal{ZFC}(\mathcal{L})$ for any other logic $\mathcal{L}$, and not take into account the particular feature that we now have a new kind of variable at our disposal - and in particular, take as "syntax-free" an approach to logics as we can get away with. (This is a choice of arguable value, but it's the one I'm making for now.)   It's easy to show that every model of $ZFC_2^{scheme}$ is well-founded, so to understand its models we only need to look at transitive sets. A natural hope at this point is that $ZFC_2^{scheme}$ is just second-order $ZFC$ in disguise, that is, that for a transitive set $M$ we have $M\models ZFC_2^{scheme}$ iff $M=V_\kappa$ for some strongly inaccessible $\kappa$. However, this isn't at all obvious to me (although it is easy to show the right-to-left direction).     Question. What are the (set-sized) models of $ZFC_2^{scheme}$?   (Note by contrast that the "arithmetic analogues" $PA_2^{scheme}$ and second-order $PA$ are equivalent since each pins down $\mathbb{N}$ up to isomorphism - although that leads to .)  (I'm happy to drop Choice if that would help.)  EDIT: As Hanul Jeon pointed out below,  shows that consistently $ZFC_2^{scheme}$ (there called "$ZFC_2^{def}$") has countable models, so we have a partial answer. However, I don't see at the moment a way to get an outright $ZFC$ proof that $ZFC_2^{scheme}$ is strictly weaker than second-order $ZFC$. Show a connected metric space (X,d) is $\epsilon$-chainable for $\epsilon &gt;0$       $\epsilon$-chainable Definition      (X,d) is $\epsilon$-chainable if given any two points $a,b \in X$, $\exists$ a finite set $\{ x_0,x_1,...,x_n\}$ of points in X with $x_0 = a$, $x_n=b$ and $d(x_{n-1},x_n)&lt;\epsilon$, $\forall$ n      Clopen Definition      A set is clopen $iff$ its boundary is empty      Connected Metric Definition      Let $(X,d)$ be a metric space. It is connected $iff$ it has no proper subsets which are clopen      The following are equivalent:         $X$ is connected   The only subsets of $X$ that are clopen are $\emptyset$ and $X$   $\nexists$ non-empty, disjoint, open sets $A$ and $B$ such that $X=A\bigcup B$   $\nexists$ non-empty, disjoint, closed sets $A$ and $B$ such that $X=A\bigcup B$         Theorem      Let $(X,d)$ be a metric space, and let $S$ be any subset of $X$. Then $S$ is closed $iff$ $S^c$ is open.     So how would someone show this exactly?  Let the set $A$ be the set of all elements in $(X,d)$ that can be reached from $a\in X$ in a finite number of steps with length less than $\epsilon$.  Does this mean that there should be no isolated points? (an isolated point would be at distance infinity from any other point, or distance zero from itself, since $\epsilon &gt;0$ we don't want this?)  Knowing that $X$ is connected $\implies$the only subsets of X that are clopen are $\emptyset$ and $X$  Also, by construction of A;   A is the set of all $\epsilon$-chains between any element and $a$  And, so $A^c = \emptyset$ if $A$ was $\epsilon$-chainable (because A has to have a path from all elements to a, for this to be true, the complement wouldn't have anything in it)  Leaving only $A$ as the remaining clopen set  Does this make any sense? Or should an alternative be used, and how to formalize it.  Thanks. If I wanted to say something occurred occurred between 1627 and 1629, I would use &quot;the late 1620s&quot;. However, if I wanted to say something occurred between 1607 and 1609, I couldn't use &quot;the late 1600s&quot; because that would imply it occurred between 1670 and 1699. How to calculate polygon areas and perimeters using QGIS? Command run in terminal, not with shortcuts As explain in this , I want to add shortcuts to switch workspaces (in Mate).  I found a way to switch workspace for the terminal: wmctrl -s $(wmctrl -d | grep "*" | awk '{print $1+1}').  But this command line does not work when I add it in the shortcut manager. Does any one know why ? brute force password guessing on SSH server isn't going to work? I'm running an SSH server on my personal computer. The log had many people(or bots?) repeatedly trying to log in to my server (that is before I changed the default port), which made me a little freaked out. I was worried about their dictionary attacks or brute force password guessing.  But then if you type wrong password (or wrong username), the server waits for about 2 seconds before it asks for password again. So an attacker can try one password per 2 seconds. So I concluded that these attacks aren't that great a threat (as long as your password does not consist of dictionary words.) Am I correct? Equivalence of the definition of the Subbasis of a Topology I came to know about 2 definitions of a subbasis of a topology. 1. A collection of subsets of X viz. S is said to be a subbasis of a topology T on X if S covers X and the finite intersections of elements of the subbasis form the basis elements (H.L.Royden). 2. If we consider the all the topologies on X containing S, then their intersection is also a topology on X and it is the smallest topology containing S. Then S is said to be a subbasis of the smallest topology, and the topology is said to be generated by S.  Now I want to prove their equivalency, i.e. S is a subbasis of a topology T iff T is generated by S. I have tried in the way: First let T is generated by S. Then by 2nd definition T is a topology containing S. Let B be the set of all finite intersections of elements of S.Then S is a subset of B and B is a subset of T (as T is a topology). LET T1 be the collection of possible unions of elements of B, we will show that T = T1. After this I am not able to proceed. Also I am unable to sketch the converse part. If something is wrong, please let me know, and also I hope to get help. Thank You. Proving that $\left( \frac{\partial^2}{\partial x^2} + \frac{\partial^2}{\partial y^2} \right) \lvert f(z) \rvert^2 = 4 \lvert f'(z) \rvert^2$ Given $f$ entire show that $$ \left( \frac{\partial^2}{\partial x^2} + \frac{\partial^2}{\partial y^2} \right) \lvert f(z) \rvert^2 = 4 \lvert f'(z) \rvert^2 $$ I've come close to getting the exact answer by writing $f(z)$ as $u(x,y)+iv(x,y)$ and realizing the Laplacian of f is equal to zero. This leads to a lot of cancellations but I'm still making mistakes in my computations and I can't figure out where. Any help is appreciated. Why should I use the keyword "final" on a method parameter in Java? I can't understand where the final keyword is really handy when it is used on method parameters.    If we exclude the usage of anonymous classes, readability and intent declaration then it seems almost worthless to me.   Enforcing that some data remains constant is not as strong as it seems.    If the parameter is a primitive then it will have no effect since the parameter is passed to the method as a value and changing it will have no effect outside the scope.  If we are passing a parameter by reference, then the reference itself is a local variable and if the reference is changed from within the method, that would not have any effect from outside of the method scope.    Consider the simple test example below. This test passes although the method changed the value of the reference given to it, it has no effect.  public void testNullify() {     Collection&lt;Integer&gt; c  = new ArrayList&lt;Integer&gt;();           nullify(c);     assertNotNull(c);            final Collection&lt;Integer&gt; c1 = c;     assertTrue(c1.equals(c));     change(c);     assertTrue(c1.equals(c)); }  private void change(Collection&lt;Integer&gt; c) {     c = new ArrayList&lt;Integer&gt;(); }  public void nullify(Collection&lt;?&gt; t) {     t = null; } A lot of people recommend to use the maximum node for glass setup, but I can't find that node. Nothing comes up when I search for it.  Where do I find it?