"Viewed 1 times" bug still around after 10 years Almost a decade ago now, somebody asked about this:   All the replies to that question/bug report are of a very hostile kind.  Why has this bug not been fixed for this long? One of the replies appears to be mentioning that it has been fixed, but it has not, as of today, 2019-08-20.  What gives? A site as "polished" (over-engineered, one might say) as this really has no excuse whatsoever to let such a bug be for 10 years after it was pointed out.  PS: No, I'm not making some kind of "joke". I'm serious.
Pluralization issue on new question statistics underneath title, with views It looks like the new question statistics underneath the question title introduced a pluralization issue with views:        To be clear here, this was not an issue with the old sidebar-based question statistics; that used to properly say "viewed 1 time".
Moderncv package - cventry date width I am writing my CV using moderncv package, everythig is nice but I have a problem with \cventry command. I have something like this:   (it means 2010 - now)  I would want to have this in one line, rather than in two lines. I tried looking into the moderncv style files but with no success. What can I do to achieve the effect I want? Non-principal ideal in $K[x,y]$? Let $K$ be a field. Then $K[x,y]$ is not a PID because $x$ is irreducible but the quotient $K[x,y]/(x)$ is isomorphic to $K[y]$, which is not a field.  So there must be an ideal in there which is not principal. What is an example of such an ideal? $a =\prod_{i = 1}^{r} p_{i}^{ai}$ with $a_{i} > 0$ for each $i$ is the canonical representation of $a$... Why is plain-hash-then-encrypt not a secure MAC? It seems that even in MAC-then-encrypt systems like SSL, something like HMAC is used rather than a plain hash. Why?   Suppose we use some stream cipher; then why can't we use $Encrypt(m | H(m))$ as the MAC-then-encrypted version of the message? Assuming no bad relations between $Encrypt$ and $H$, what are the possible weaknesses? It seems that in this case we are encrypting the hash with part of a secretly keyed stream cipher keystream, and the hash is secure; does this not fulfil an approximation of the ideal MAC?  This must be somehow bad, since no secure protocol seems to use it. Why? Should you declare methods using overloads or optional parameters in C# 4.0? I was watching , and it got me thinking about when optional parameters are available in C# what is going to be the recommended way to declare methods that do not need all parameters specified?  For example something like the FileStream class has about fifteen different constructors which can be divided into logical 'families' e.g. the ones below from a string, the ones from an IntPtr and the ones from a SafeFileHandle.  FileStream(string,FileMode); FileStream(string,FileMode,FileAccess); FileStream(string,FileMode,FileAccess,FileShare); FileStream(string,FileMode,FileAccess,FileShare,int); FileStream(string,FileMode,FileAccess,FileShare,int,bool);   It seems to me that this type of pattern could be simplified by having three constructors instead, and using optional parameters for the ones that can be defaulted, which would make the different families of constructors more distinct [note: I know this change will not be made in the BCL, I'm talking hypothetically for this type of situation].  What do you think? From C# 4.0 will it make more sense to make closely related groups of constructors and methods a single method with optional parameters, or is there a good reason to stick with the traditional many-overload mechanism? Why don't the Ubuntu repositories have the latest versions of software? How do I use the different shutter speeds my camera offers? Inverse metric in linearised gravity From what I've read, in the framework of linearised gravity, one perturbs the metric around a Minkowski background, $\eta_{\mu\nu}$, such that  $$g_{\mu\nu}(x)=\eta_{\mu\nu}+h_{\mu\nu}(x)\tag{1}$$  where $h_{\mu\nu}(x)$ is a small perturbation, i.e. $$\big\lvert h_{\mu\nu}\big\rvert&lt;&lt;1.\tag{2}$$  The inverse metric is then found by assuming the following ansatz:  $$g^{\mu\nu}(x)=\eta^{\mu\nu}+\tilde{h}^{\mu\nu}\tag{3}$$  where $\tilde{h}^{\mu\nu}$ is also small (i.e. $\big\lvert \tilde{h}_{\mu\nu}\big\rvert&lt;&lt;1$).   Using this, it is easy to find that  $$g^{\mu\nu}(x)=\eta^{\mu\nu}-h^{\mu\nu} \tag{4}$$  to first order.   My question is, what is the justification for this ansatz? Is it simply that one expects the inverse metric to have a similar form to the metric in order to satisfy $$g^{\mu\alpha}g_{\alpha\nu}=\delta^{\mu}_{\;\nu}~?\tag{5}$$ What is the XY problem? What is the XY problem?  When asking questions, how do I recognize when I'm falling into it?  How do I avoid it? Pass parameters to program started with Runas I am trying to start Performance monitor as different user. I found runas.exe but syntax for program arguments makes me go crazy. The following syntax works: C:\Windows\System32\runas.exe /user:domain\username perfmon.exe  But since perfmon.exe has the argument */res* the following line doesn't work: C:\Windows\System32\runas.exe /user:domain\username perfmon.exe /res  I tried to escape */res* but without any success. I tried: &quot;/res&quot; \&quot;/res\&quot;&quot; \&quot;\/res\&quot;&quot;  Any ideas? If $\lim_{n\rightarrow\infty} f(n+1) - f(n) = L$, prove that $\lim_{n\rightarrow\infty} f(n)/n = L$ Here's the problem in full. I've stared at it for hours and can't get anywhere, so a hint would be nice.  Suppose that $f:\mathbb N\rightarrow\mathbb R$. If $$\lim_{n\rightarrow\infty}f(n+1)-f(n) = L$$ prove that $\lim_{n\rightarrow\infty}f(n)/n$ exists and equals $L$.  This problem is marked with the word "Cauchy", so I'm guessing Cauchy sequences or something related to them will be necessary, but I can't figure out what.  Edit: It appears as if the Stolz-Cesaro Theorem makes this quite easy. Unfortunately though, we have not discussed this, so I won't be able to use this. What's the difference between a shunt resistor and a four-terminal resistor? I want to know if the four-terminal resistor and the shunt resistor are the same.   Is there another use for the four-terminal resistor except measuring current? Better way of saying "those who are curious"? I am writing a note in which I want to ask (curious) readers to refer another paper. The phrase curious minded comes to mind, but it seems somewhat awkward.  Is there a better way to convey similar import? Calculating the expected values of the min/max of 2 random variables Javascript: negative lookbehind equivalent? Is there a way to achieve the equivalent of a  in javascript regular expressions?  I need to match a string that does not start with a specific set of characters.  It seems I am unable to find a regex that does this without failing if the matched part is found at the beginning of the string.  Negative lookbehinds seem to be the only answer, but javascript doesn't have one.  EDIT: This is the regex that I would like to work, but it doesn't:  (?&lt;!([abcdefg]))m  So it would match the 'm' in 'jim' or 'm', but not 'jam' Prove there are k consecutive non-squarefree integers So, I've got a question for class that asks me to prove the existence of arbitrarily long runs of consecutive integers where $\mu(n)$ is zero.   I've started the proof, but I need a bit of help midway through.  Assume there exists a run of length n, which we currently assume is the longest possible chain.  If we induct on n, we can assume there is a run of the form $m_1p_1^2, m_2p_2^2, ..., m_np_n^2$ (where each of the $p_i$ are prime).  If I add $M =  lcm(m_1p_1^2, m_2p_2^2, ..., m_np_n^2)$ to each number, I get another run of length n.  So here's where the issue starts. When I talked to my advisor about it, he referenced a theorem where there exists a prime $p$ congruent to $1\ mod\ M$.  I am unfamiliar with this theorem, so I'm not sure how to use this information. Any chance I can get some help? Or else is there a simpler way to go about this problem? GR. Einstein's 1911 Paper: On the Influence of Gravitation on the Propagation of Light Ubuntu 12.04 on Amilo LA1703 after istalling graphics doesn't start? How do you make clothes move along with model how do you make clothes move along with your model? Do you rig the model first and then parent it to the body of the character then click cloth simulation? I am a little bit confused with the process. Thanks for the help. Should covariates that are not statistically significant be 'kept in' when creating a model? I have several covariates in my calculation for a model, and not all of them are statistically significant.  Should I remove those that are not?  This question discusses the phenomenon, but does not answer my question:   There is nothing in the answer to that question that suggests that non-significant covariates be taken out, though, so right now I am inclined to believe that they should stay in.  Before even reading that answer, I was thinking the same since a covariate can still explain some of the variance (and thus help the model) without necessarily explaining an amount beyond some threshold (the significance threshold, which I see as not applicable to covariates).  There is another question somewhere on CV for which the answer seems to imply that covariates should be kept in regardless of significance, but it is not clear on that.  (I want to link to that question, but I was not able to track it down again just now.)  So...   Should covariates that do not show as statistically significant be kept in the calculation for the model?  (I have edited this question to clarify that covariates are never in the model output by the calculation anyway.)  To add complication, what if the covariates are statistically significant for some subsets of the data (subsets which have to be processed separately).  I would default to keeping such a covariate, otherwise either different models would have to be used or you would have a statistically significant covariate missing in one of the cases.  If you also have an answer for this split case, though, please mention it.