I'm basically trying to install a package that requires snappy compiled in c for speed. I have already downloaded and installed the required compiler from here .  This  is the error I'm getting.  I can't figure out why it's not able to get stdint.h. It should come with the compiler right?   Any tips would be appreciated.
To my amazement I just discovered that the C99 stdint.h is missing from MS Visual Studio 2003 upwards.  I'm sure they have their reasons, but does anyone know where I can download a copy?  Without this header I have no definitions for useful types such as uint32_t, etc.
Book wherein humans were most dangerous/aggressive of numerous species I recall there were two warring alien empires, one of which was led by a race that could telepathically inflict pain on others, but when they tried to do it to humans, it would backfire. something about human's animal instincts being much closer to the surface than the other species.  Humans made the most aggressive and dangerous fighters, so both empires tried to reruit humanity, since the other races involved in the war were fairly monolithic and sided all with one empire or the other. Humanity was all splintered though.  The empire led by the telepathic race claimed that everyone in it was equal but in reality the telepathic race was in charge. Where is the open source project for the WMD editor used on this site? Biblatex: URL-breaking not working in DVI-mode I'm preparing my bibliography and noticed that biblatex-printbibliography produces Overfull \hbox several times.  Examples (gray lines indicates text margins, red line is the physical page margin):        Why is hyperref line-breaking not working as expected using pdflatex or even latex -&gt; dvipdfm BUT not using latex -&gt; dvips -&gt; ps2pdf?  Also it would be great if someone could point out how I can raise the indentation of the second (and following) lines, as this might look better.  edit: Customized question, as the answer given by lockstep solved the third problem. The second problem seems to be identical to the first.  \documentclass[12pt]{scrbook} \usepackage[english]{babel} \usepackage[utf8]{inputenc} \usepackage[T1]{fontenc} \usepackage[ps2pdf]{hyperref} %\usepackage[ps2pdf,breaklinks=true]{hyperref} %This doesn't change anything. %\usepackage{breakurl} %That makes no difference either.  \usepackage[a4paper,twoside,showframe]{geometry} %show text margins  \usepackage[style=alphabetic,backend=biber,maxnames=4,minnames=3,maxbibnames=99]{biblatex} \bibliography{biblatex-issue}  \begin{document} \nocite{*}  \printbibliography[heading=subbibliography,type=article,prefixnumbers={A-}] \printbibliography[heading=subbibliography,type=book,prefixnumbers={B-}] \printbibliography[heading=subbibliography,type=online]  \end{document}   And the bib-file:  @online{GLS:datasheet,     title         = "GLS Datasheet",     organization  = "Optoelectronics Research Centre",     howpublished ="Website",     date = "2004-09",     urldate="2013-07-01",     url ="http://www.southampton.XXXX",     address       = "Southampton, United Kingdom" } @book {Lifante:Fundamentals,     title = "Integrated Photonics: Fundamentals",     author = "Lifante, Ginés",     publisher = "J.Wiley",     address = "Chichester",     year = "2003",     type = "text",     isbn = "9780470848685" } @article{Labadie:First_fringes,     author = {Labadie, L. and Mart\'{\i}n, G. and Anheier, N. C. and Arezki, B. and Qiao, H. A. and Bernacki, B. and Kern, P.},     title = {First fringes with an integrated-optics beam combiner at 10},     DOI= "10.1051/0004-6361/201116727",     journal = {A\&amp;A},     year = 2011,     volume = 531,     pages = "A48" }     P.S.: I noticed that the visiting-date of the GLS-datasheet is wrong ;-) Can this intuition give a proof that an isometry $f:X \to X$ is surjective for compact metric space $X$? A prelim problem asked to prove that if $X$ is a compact metric space, and $f:X \to X$ is an isometry (distance-preserving map) then $f$ is surjective. The official proof given used sequences/convergent subsequences and didn't appeal to my intuition. When I saw the problem, my immediate instinct was that an isometry should be "volume-preserving" as well, so the volume of $f(X)$ should be equal to the volume of $X$, which should mean surjectivity if $X$ is compact. The notion of "volume" I came up with was the minimum number of $\epsilon$-balls needed to cover $X$ for given $\epsilon &gt; 0$. If $f$ were not surjective, then because $f$ is continuous this means there must be a point $y \in X$ and $\delta &gt; 0$ so that the ball $B_\delta(y)$ is disjoint from $f(X)$. I wanted to choose $\epsilon$ in terms of $\delta$ and use the fact that an isometry carries $\epsilon$-balls to $\epsilon$-balls, and show that given a minimum-size cover of $X$ with $\epsilon$ balls, that a cover of $X$ with $\epsilon$-balls could be found with one fewer ball if $f(X) \cap B_\delta(y) = \emptyset$, giving a contradiction. Can someone see a way to make this intuition work? miktex-makepk - PK font HieroB could not be created I am depressed, after trying to install HieroTeX with MikTex 2.9 and TeXnicenter for four weeks without succeeding. I installed hieroglf, it works perfectly, but has only 60 signs. I followed the main advices, so I created a folder texmf-Local , throwed in  the content of HieroTex3.5 and Hiero-Type1.3.1.4 , put the axmf , mf and sty files where I think they belong, put that directory  texmf- local in the path searched by Miktex, updated map and file databases fo Miktex. Still the files can be compiled but Hiero fonts are not found.  Te main errors I can detect from log are the following:   " No file egypto.sty.tex found" and  "  "miktex-makepk - PK font HieroB could not be created." and similar for other fonts Thanks Quotient ring of Gaussian integers A very basic ring theory question, which I am not able to solve. How does one show that    $\mathbb{Z}[i]/(3-i) \cong \mathbb{Z}/10\mathbb{Z}$. Extending the result: $\mathbb{Z}[i]/(a-ib) \cong \mathbb{Z}/(a^{2}+b^{2})\mathbb{Z}$, if $a,b$ are relatively prime.   My attempt was to define a map, $\varphi:\mathbb{Z}[i] \to \mathbb{Z}/10\mathbb{Z}$ and show that the kernel is the ideal generated by $\langle{3-i\rangle}$. But I couldn't think of such a map. Anyhow, any ideas would be helpful. After running a VM and logging out, I got a black screen. I powered off and re-started but got the same after the bios option in start up passed. Several attempts went bye with the same result. So I fiddled with bios boot options a bit and was able to get to a different looking Ubuntu start up screen which, after entering pass key would run a series of commands that were too numerous and frantic to make out. They appeared to be overlapped/layered (the text that is) and seemingly repeating endlessly. I had to power down to get it to stop and re-booting just had the same effect. Finally, I hit the down arrow key when prompted for "disk sda5_crypt" at the pseudo Ubuntu log-in screen I mentioned before. This brought me to an all black screen which read something like:  lvmetad not active cannot process volume group "umbuntu-vg" unlock disk sda5_crypt**   From here I entered a password and Ubuntu start up ran.  That was an unsettling hour or so and I'd like to avoid that in the future. Any ideas what caused it and how to avoid it going forward?  Should have said this before but Ubuntu is the only OS on my machine and my optical drive cannot be opened manually. I would like to draw a squiggly line with an arrow somewhere in the middle of it. TikZ has a pathmorphing decoration that draws a squiggly line and a markings decoration to place an arrow tip. So a solution would be to use them together:  \documentclass{article} \usepackage{tikz} \usetikzlibrary{decorations,decorations.pathmorphing,decorations.markings} \begin{document}  \begin{tikzpicture}  \draw[          decoration={snake},          decorate,          postaction={decoration={markings,mark=at position 0.6 with {\arrow{>}}},decorate}      ]         (0,0) -- (2,0); \end{tikzpicture}  \end{document}   Unfortunately this does not work and results in  ! Dimension too large. &lt;to be read again&gt;                     \relax  l.11         (0,0) -- (2,0);   I suspect there is an infinite recursion going on somewhere.  Is there a workaround? If not, is there a different simple solution to the problem?  (Note: This is probably related to my previous question ) Is it possible to recover an email that has been clicked "delete forever" in the trash folder? Where is this picture from? How do I use Reverse Image Search to find the source of an anime/manga image? So I see an image that I believe is from either an anime or a manga. What are some ways that I can go about finding what series it's from? Try these options:   (browser built-in support and plugins)        Note: Please note that as of May 9, 2016, ALL  questions are now . Therefore, you can't ask an identification request question on this site. However, such questions are still welcome  for users with at least  (globally on StackExchange).    Protip: If you are using Google Image Search in a non-English language,  or just use  for better, more accurate results. I'm learning Neural Networks and I grasped the algebra behind them. I'm now interested in understanding how normalization and centering of the input data affect them. In my personal learning project (Regression with NN) I've transformed my input variables to a range between 0 and 1 using the following function:  normalize &lt;- function(x) {return((x - min(x))/ (max(x) - min(x)))}   The NN model fits well and has an acceptable out-of-sample prediction error.   However, I read in other  that scaling the inputs to have mean 0 and a variance of 1 is advised for NN. I don't fully understand:   how this transformation works better for NN against the min-max normalization between 0 and 1. how can I assess which transformation to apply in my data? I have an odd error that I have been unable to find anything on this. I wanted to change the user comment with the following command.  $ sudo usermod -c "New Comment" user   This will work while logged onto a server but I want to automate it across 20+ servers. Usually I am able to use a list and loop through the servers and run a command but in this case I get a error.  $ for i in `cat servlist` ; do echo $i ; ssh $i sudo usermod -c "New Comment" user ; done  serv1 Usage: usermod [options] LOGIN  Options: lists usermod options  serv2 Usage: usermod [options] LOGIN  Options: lists usermod options . . .   When I run this loop it throws back an error like I am using the command incorrectly but it will run just fine on a single server.  Looking through the ssh man pages I did try -t and -t -t flags but those did not work.  I have successfully used perl -p -i -e within a similar loop to edit files.  Does anyone know a reason I am unable to loop this? What is difference between int.class and Integer.TYPE in java? I have been trying to show these two inequalities hold for all positive integers n, but I don't know how to proceed at all... I have tried playing around with them but I didn't find anything helpful. I have also tried induction but I couldn't make it work. Why do many sites leave half of each webpage empty? Isn't this a waste of screen space?  One nice example of this is the Stack Exchange Network sites:    As you can see, there is a ton of whitespace left on both sides of each page.  Does the whitespace make sites compatible with certain screen sizes? Does leaving the space help make sites mobile friendly? Does space make pages seem less crowded, and thus, more usable? Or, is there no good reason and people just do it because they don't realize they shouldn't?  I've worked on sites that use both designs and haven't had users complain either way.  Examples of sites that have space: , ,  Examples of sites without space: , , Why doesn't the frequency of light change during refraction? Further anonymize deleted accounts by changing the username in close/delete notices When an account is deleted, the username in the user's posts and comments is changed to a generic user&lt;userID&gt;. But the username stays the same on close and delete notifications on posts the user had voted to close / delete1. I think it shouldn't, especially for users who used their real name as their username, if they chose to distance themselves from the site and remove their accounts, it makes sense that they wouldn't really want their name plastered on close and delete notifications.   A perhaps easy way to avoid the actual username remaining visible would be to change it to the generic user&lt;userID&gt; (or anything generic enough, like "anonymous") prior to deletion, and wait a bit for the generic username to propagate all over the site. If I'm not horribly misreading , this was part of the process in the old days.   This could be automated or added as a suggestion to the .  Glaring example can be seen , where the deleted user also posted a comment where their name is properly anonymized:        1 I've seen it on close notifications and self deleted answers. I'm not sure it happens on deleted questions, or deleted answers that aren't self deletions, and I don't have a way to verify it - other than stumbling on them accidentally Discuss convergence of the series $\sum \frac{(1+n)^n}{n!}x^n$. Let    $$a_n = \dfrac{(1+n)^n}{n!}$$   Discuss convergence of the series $\displaystyle \sum a_nx^n$.   I've shown that the series converges absolutely when |x| &lt; 1/e and diverged when |x| > 1/e. I can't seem to determine what happens at |x| = 1/e What packages do you use and recommend for creating graphics in your LaTeX documents?     As this is a community wiki post, please add your package to the accepted answer (or add a comment, and someone with >100 rep will add it to the CW answer), and include a brief description of what differentiates it from others and how it can be used (GUI drawing tool which generates code, type in raw text, or generates image for inclusion in document).   We'll eventually sort these answers under headings. Closed formula for the sums $\sum\limits_{1 \le i_1 < i_2 < \dots < i_k \le n} i_1 i_2 \cdots i_k $? I've worked out a few summation formulas, and I am hoping to find a pattern. Unless I have made a mistake somewhere, we have the following identities:  $$\sum_{1 \le i \le n} i = \frac{(n+1)n}{2} $$  $$\sum_{1 \le i &lt; j \le n} ij = \frac{(3n+2)(n+1) \, n \, ( n-1)}{24}$$   $$\sum_{1 \le i &lt; j &lt; k \le n} ijk = \frac{(n+1)^2 \, n^2 \, (n-1)(n-2) }{48}$$   It seems clear that $$p_k(n)= \sum_{1 \le i_1 &lt; i_2 &lt; \dots &lt; i_k \le n} i_1 i_2 \cdots i_k $$ is a polynomial in $n$ of degree $2k$. But is there a nice closed-form formula for it? Maybe in terms of its factorization?  Comment: I realize that what I am looking for is the coefficient of $t^k$ in the expansion $$(1+t)(1+2t) \dots (1+nt),$$ so maybe generating function techniques could be helpful. But the main way I know to extract the coefficient of $t^k$ is to take derivatives $k-1$ times and on the surface of things that looks like a huge mess.