Why am I seeing people marking technical parts of texts (names of functions, files) a code (e.g. `explorer.exe`), while logically it is not a code? I agree that these things should be somehow highlighted, but I don't see the code marking an appropriate way of doing it.
When reviewing Suggested Edits on Stack Overflow, I often come across "fixed formatting" suggestions that use  to place emphasis on certain keywords, but isn't actual code.  For example:     I am having a difficult time with a background task in iOS. The problem I seem to be facing is that iOS is silently terminating the App if my background task runs for too long. What can I do to increase time iOS will wait for my background task to complete?   Gets edited to:     I am having a difficult time with a background task in iOS. The problem I seem to be facing is that iOS is silently terminating the App if my background task runs for too long. What can I do to increase time iOS will wait for my background task to complete?   This seems like an invalid use of an inline code span because, well, it isn't code, and it is distracting. There are a    of these edits being made. Often enough they get approved, which reinforces the behavior.  Is this a valid use of inline code spans? If not, should it be edited and corrected? Should edits suggesting these changes be rejected?
Punctuating a quoted question within a quoted statement I'm working on a story, and I find myself faced with something of a quandary.  Specifically, I need to know the proper style for the following:     “I have thousands of them,” the commissioner answered, “but I’ll start with ‘What do you need?’.”   Is it proper form to have both the question mark and period, or should one of them be dropped? Difference between decimal, float and double in .NET? What is the difference between decimal, float and double in .NET?  When would someone use one of these? C# Regular Expressions with \Uxxxxxxxx characters in the pattern What is a lambda (function)? When I type $\overset{\circ}{Z}^\lambda$ the lambda is placed slightly above and to the right of the circle. Is there a way to make it appear as a superscript on the Z? I tried $\overset{\circ}{Z^\lambda}$, but then the circle is too high and to the right.  As a bizarre aside: a friend uses the exact same code with no problem. However, when I type it into MathOverflow it looks the same as in my compiler (i.e. bad). I am running centos 5.8 with cpanel. Lately I am getting reports that my swap is full , but there is a lot of free memory  to use.  top - 10:33:43 up 133 days, 17:00,  1 user,  load average: 0.05, 0.03, 0.05   Tasks: 170 total,   1 running, 169 sleeping,   0 stopped,   0 zombie   Cpu(s):  2.1%us,  0.5%sy,  0.0%ni, 97.2%id,  0.0%wa,  0.0%hi,  0.2%si,  0.0%st   Mem:  24726100k total,  8255368k used, 16470732k free,   599560k buffers   Swap:  1046520k total,   984740k used,    61780k free,  3641828k cached     How do I solve this? The unused ram memory should be used instead of the swap. Or should I increase the swap ( and how do I do that ? ).  Thanks Does "notified by [date]" include the end date? I have read the Rules of a competition. The text of the Rules include a sentence as follows:     As per stated in the Rules the entrants will be notified by May 30th 2010.   Does the sentence above mean that May 30th is included in the term of notification or not? Title is the question itself.  How can I show below without L’Hospital’s Rule  $$ \lim_{x\to \infty} ( 1 + x )^\frac{1}{x} = 1 $$ Proof of upper-tail inequality for standard normal distribution $X \sim \mathcal{N}(0,1)$, then to show that for $x &gt; 0$, $$ \mathbb{P}(X&gt;x) \leq \frac{\exp(-x^2/2)}{x \sqrt{2 \pi}} \&gt;. $$ Can it hurt to put my GRE score on my resume? If my score is good and if I'm applying for an MS program in Europe, can it give me any kind of edge? The university I'm applying to requires GRE scores for certain programs but not the one I'm applying for. And if it won't be advantageous, can it hurt my prospects in anyway? Questions with no close votes appearing in the close vote queue? I've just been offered the wonderful opportunity to review .        ... but on closer inspection ?        Is this  (e.g I'm assuming this post did previous have a close vote, but has now aged away in ways I don't understand), or should questions with no active close votes be removed from the queue.  p.s. If it's , please expect my  asking for this not to be the case ;). The first given name of an author or editor in my bibliography should be written out, but all further first names should be abbreviated (initials with a period -- and space if there are multiple first names/initials, see below). I am using style=authoryear with BibLaTeX (v. 2.7) and Biber (v. 1.7).  My bibliography looks like this:     Doe, John Arthur Kyle (2013). The secret life of John Doe.   It should look like this:     Doe, John A. K. (2013). The secret life of John Doe.   Minimal example:  example.tex  \documentclass{scrartcl}  \usepackage[ngerman]{babel} \usepackage[babel,german=quotes]{csquotes} \usepackage[backend=biber,style=authoryear]{biblatex} \bibliography{bibliography}  \begin{document}  \cite[123]{Doe} \printbibliography  \end{document}   bibliography.bib  @book{Doe,     title = {The secret life of John Doe},     author = {Doe, John Arthur Kyle},     year = {2013} }   (Worked with said versions of BibLaTeX and Biber, Texmaker (v. 4.0.3) and MiKTeX (v. 2.9.4813).)  I could not find a solution in biblatex.def and firstinits=true abbreviates all first names, including the first one. There are several ideas on hard determinism, but the core seems to be that in an interconnected existence, there can be no "actions" (free will), but only "reactions" (determinism). An action of free will would have to be a separate entity outside of existence, so we'd say it can't occur.   Now fast forward to Joe Schmo the robbing/murdering/rapist.  Joe wasn't born in some infinite bliss utopia, then decided one day to invent the concept of scumbaggery.  He's a product of an incomprehensible number of variables - maybe some are apparent like his dad was a violent alcoholic or whatever, but most likely it's far more complicated than that.    So that's fine - I get all that - but if that's the case, then how can you ethically deal with people like that?  You can't hardly let them do what they please at the expense of society, but then how can you get medieval on them when they're basically riding a wave?  I think that's a big reason why people fight concepts of determinism that mitigate or eradicate the concept of free will - now everyone has a license to do what they want and how can you punish them, it's not their fault!  How would/could/should you consolidate hard determinism with responding to criminal acts? Arrays in Unix Bourne Shell I am trying to use arrays in Bourne shell (/bin/sh). I found that the way to initialize array elements is:  arr=(1 2 3)   But it is encountering an error:  syntax error at line 8: `arr=' unexpected   Now the post where I found this syntax says it is for bash, but I could not find any separate syntax for Bourne shell. Does the syntax stand the same for /bin/sh as well? Lets say I have a loop in Bash:  for foo in `some-command` do    do-something $foo done   do-something is cpu bound and I have a nice shiny 4 core processor. I'd like to be able to run up to 4 do-something's at once.  The naive approach seems to be:  for foo in `some-command` do    do-something $foo &amp; done   This will run all do-somethings at once, but there are a couple downsides, mainly that do-something may also have some significant I/O which performing all at once might slow down a bit. The other problem is that this code block returns immediately, so no way to do other work when all the do-somethings are finished.  How would you write this loop so there are always X do-somethings running at once? $$\lim_{n\to\infty} (1+\frac{2}{n})^{n^2} e^{-2n} = ? $$         $e$   $e^2$   $e^{-1}$   $e^{-2}$      My answer is 1. Since $$\lim_{n \to \infty} \left(1+\frac{2}{n}\right)^{n} =e^{+2}.$$  Therefore $$\lim_{n\to\infty} \left(1+\frac{2}{n}\right)^{n^2} =e^{2n}.$$  Where am I wrong? Labelled spanning trees of $K_n-e$ Let $e$ be an edge of $K_n$- the complete graph on $n$ vertices. Prove that the number of labelled spanning trees of $K_n-e$ is $(n-2)n^{n-3}$.  I think the answer lies in using some modified form of Prüfer's sequence but I can't quite nail it. PermGen elimination in JDK 8 Avoiding NullPointerException in Java I use object != null a lot to avoid . What is an alternative to: if (someobject != null) {     someobject.doCalc(); } What is the best term to describe the fact that most users have an initial dislike of any change to a UI even though it may really be net better over time?  Note: Question originally appeared