Emails sent via Amazon SES going to spam in Gmail
How can I prevent my mail from being classified as spam?
Defragmenting an SSD drive is a bad idea and Windows 7 is (should be?) smart enough not to schedule defragmentation on such drives.  However, I've opened up Disk Defragmenter on my system and found, to my surprise, that my SSD has indeed been defragmented... recently!  Then I checked the disks selected for the scheduled defrag (I have one SSD and one normal disk), and there the list correctly shows only the non-SSD drive.   MSDN forum post seems to suggest that, at least on Windows 8, defragmenting an SSD drive will just cause the TRIM command to be sent to the drive, but there's no word on what actually happens if you try to defrag an SSD drive on Windows 7 (aside from the fact that it shouldn't happen automatically).  What happens in Windows 7 if one chooses to defrag and SSD? What could possibly have been the reason my SSD drive got been defragmented?  EDIT:  I just remembered - I've moved some folders (Users and ProgramData) from my SSD drive to my normal drive using junctions.  question suggests that this shouldn't have any effects at all on the defragmentation process, but could it have an effect on the "last run" in Disk Defragmenter? I'm trying to use the ant migration tool to retrieve all the Custom Metadata records for a single Custom Metadata Type.  However, I can't figure out the syntax.  I would think that something like this would work:    &lt;Package xmlns="http://soap.sforce.com/2006/04/metadata"&gt;     &lt;types&gt;         &lt;members&gt;State_Sales_Tax.*&lt;/members&gt;         &lt;name&gt;CustomMetadata&lt;/name&gt;     &lt;/types&gt;     &lt;types&gt;         &lt;members&gt;State_Sales_Tax__mdt&lt;/members&gt;         &lt;name&gt;CustomObject&lt;/name&gt;     &lt;/types&gt;     &lt;version&gt;36.0&lt;/version&gt; &lt;/Package&gt;   but no dice. I'm using IEEEtran to format an article, and I wanted to include an image. I included the graphicx and hyperref packages, and used the following code, like normal, to include an image.  \begin{figure}[!t] \centering \includegraphics[width=3in]{fetch} \caption{Pipeline: Fetch Instruction} \label{fig:fetch} \end{figure}   What appears, however, is this:    Fetch.png is a file in the directory, and if I remove it, pdflatex errors instead of producing an output. I'm using MiKTeX 2.9 on Windows 7. Any ideas? Forcing linebreaks in \url Is there a way to stream Netflix content to my Ubuntu machine? Plurals of acronyms, letters, numbers — use an apostrophe or not? Can commuting matrices $X,Y$ always be written as polynomials of some matrix $A$? Consider square matrices over a field $K$. I don't think additional assumptions about $K$ like algebraically closed or characteristic $0$ are pertinent, but feel free to make them for comfort. For any such matrix $A$, the set $K[A]$ of polynomials in $A$ is a commutative subalgebra of $M_n(K)$; the question is whether for any pair of commuting matrices $X,Y$ at least one such commutative subalgebra can be found that contains both $X$ and $Y$.  I was asking myself this in connection with frequently recurring requests to completely characterise commuting pairs of matrices, like . While providing a useful characterisation seems impossible, a positive anwer to the current question would at least provide some answer.  Note that in many rather likely situations one can in fact take $A$ to be one of the matrices $X,Y$, for instance when one of the matrices , or more generally if its  (so coincides with the characteristic polynomial). However this is not always possible, as can be easily seen for instance for diagonal matrices $X=\operatorname{diag}(0,0,1)$ and $Y=\operatorname{diag}(0,1,1)$. However in that case both will be polynomials in $A=\operatorname{diag}(x,y,z)$ for any distinct values $x,y,z$ (then $K[A]$ consists of all diagonal matrices); although in the example in  the matrices are not both diagonalisable, an appropriate $A$ can be found there as well.   I thought for some time that any maximal commutative subalgebra of $M_n(K)$ was of the form $K[A]$ (which would imply a positive answer) for some $A$ with minimal polynomial of degree$~n$, and that a positive answer to my question was in fact instrumental in proving this. However I was wrong on both counts: there exist (for $n\geq 4$) commutative subalgebras of dimension${}&gt;n$ (whereas $\dim_KK[A]\leq n$ for all $A\in M_n(K)$) as shown in , and I was forced to correct  in the light of this; however it seems (at least in the cases I looked at) that many (all?) pairs of matrices $X,Y$ in such a subalgebra still admit a matrix $A$ (which in general is not in the subalgebra) such that $X,Y\in K[A]$. This indicates that a positive answer to my question would not contradict the existence of such large commutative subalgebras: it would just mean that to obtain a maximal dimensional subalgebra containing $X,Y$ one should in general avoid throwing in an $A$ with $X,Y\in K[A]$. I do think these large subalgebras easily show that my question but for three commuting matrices has a negative answer.  Finally I note that  to the cited MO question mentions a result by Gerstenhaber that the dimension of the subalgebra generated two commuting matrices in $M_n(K)$ cannot exceed$~n$. This unfortunately does not settle my question (if $X,Y$ would generate a subalgebra of dimension${}&gt;n$, it would have proved a negative answer); it just might be that the mentioned result is true because of the existence of $A$ (I don't have access to a proof right now, but given the formulation it seems unlikely that it was done this way).  OK, I've tried to build up the suspense. Honesty demands that I say that I do know the answer to my question, since a colleague of mine provided a convincing one. I will however not give this answer right away, but post it once there has been some time for gathering answers here; who knows somebody will prove a different answer than the one I have (heaven forbid), or at least give the same answer with a different justification. Is there a reason behind the ordering of letters in the English alphabet? Is there a reason behind the ordering of letters in the English alphabet? i.e. why are we taught “A,B,C,D,E,F,...,Z”? Why not “L,A,S,U,I,Z,...,C”?  I am asking this because, in some of the languages I know, I am told that the ordering of the letters in the alphabet is based on the ease with which they can be pronounced or the frequency with which they are used or depending on the part of the vocal cord that needs to be stressed to pronounce the letter.  Is there a similar rationale?  EDIT  You can see a couple of references for arrangement of letters in Sanskrit  and . '+' and 's' in permission strings If the ls -l command gives me a permission string like  rwsr-s--x   What does the 's' mean? The only sources I found mention that it can be present sometimes but do not elaborate.  What does a '+' instead of a '-' mean? I have found mentions of 'extended permission' but nothing clear. How do I find the privileges I have earned and will earn in Stack Overflow? It used to be off the top bar, now its gone  Where has it moved?  EDIT:  It moved onto the profile page !  Right side same row as your name in profile:    Thank you How do I monitor the computer's CPU, memory, and disk usage in Java? I would like to monitor the following system information in Java:   Current CPU usage** (percent) Available memory* (free/total) Available disk space (free/total)  *Note that I mean overall memory available to the whole system, not just the JVM.   I'm looking for a cross-platform solution (Linux, Mac, and Windows) that doesn't rely on my own code calling external programs or using JNI. Although these are viable options, I would prefer not to maintain OS-specific code myself if someone already has a better solution.  If there's a free library out there that does this in a reliable, cross-platform manner, that would be great (even if it makes external calls or uses native code itself).  Any suggestions are much appreciated.  To clarify, I would like to get the current CPU usage for the whole system, not just the Java process(es).  The SIGAR API provides all the functionality I'm looking for in one package, so it's the best answer to my question so far. However, due it being licensed under the GPL, I cannot use it for my original purpose (a closed source, commercial product). It's possible that Hyperic may license SIGAR for commercial use, but I haven't looked into it. For my GPL projects, I will definitely consider SIGAR in the future.  For my current needs, I'm leaning towards the following:   For CPU usage, OperatingSystemMXBean.getSystemLoadAverage() / OperatingSystemMXBean.getAvailableProcessors() (load average per cpu) For memory, OperatingSystemMXBean.getTotalPhysicalMemorySize() and OperatingSystemMXBean.getFreePhysicalMemorySize() For disk space, File.getTotalSpace() and File.getUsableSpace()   Limitations:  The getSystemLoadAverage() and disk space querying methods are only available under Java 6. Also, some JMX functionality may not be available to all platforms (i.e. it's been reported that getSystemLoadAverage() returns -1 on Windows).  Although originally licensed under GPL, it  to , which can generally be used for closed source, commercial products. What are tag synonyms and merged tags? How do they work? What are tag synonyms? How can tag synonyms be distinguished from "real" tags? How are new tag synonyms created? Who can create tag synonyms? How can I delete/reverse/undo bad tag synonyms? What are merged tags? Using Illustrator CS6 to create shape out of multiple paths I am very new to Illustrator, in fact I am only experimenting with it in an attempt to help my friend develop a logo for a new business venture. I managed to draw out the shell of the logo using the line tool and modifying the lines with the anchor tool to get the shape I wanted.  However, I would like to somehow take all of these paths and create one object, or symbol which I can then apply a drop shadow, fill and various other effects too. Currently when I try to do this I get unwanted effects...  I'd appreciate any help on the subject. Saleforce Too many future calls: 11 What is a lambda (function)? How many characters have appeared in both Marvel and DC comics? I would like to see the icons in the 'Hot Network Questions' right panel clickable, leading to the homepage of the site where the question comes from.  It would make it more comfortable to switch to the site when you want rather to visit it than to see that specific "hot" question. Down arrow button for choosing the desired site Example where union of increasing sigma algebras is not a sigma algebra I believe there are several ways to prove that $\sum\limits^{\infty}_{n=1}\left(1-\frac{1}{\sqrt{n}}\right)^n$ converges. Can you, please, post yours so that we can learn from you?  HERE IS ONE   Let $n\in\Bbb{N}$ be fixed such that $a_n=\left(1-\frac{1}{\sqrt{n}}\right)^n.$ Then, \begin{align} a_n&amp;=\left(1-\frac{1}{\sqrt{n}}\right)^n \\&amp;=\exp\ln\left(1-\frac{1}{\sqrt{n}}\right)^n\\&amp;=\exp \left[n\ln\left(1-\frac{1}{\sqrt{n}}\right)\right] \\&amp;=\exp\left[ -n\sum^{\infty}_{k=1}\frac{1}{k}\left(\frac{1}{\sqrt{n}}\right)^k\right]\\&amp;=\exp\left[ -n\left(\frac{1}{\sqrt{n}}+\frac{1}{2n}+\sum^{\infty}_{k=3}\frac{1}{k}\left(\frac{1}{\sqrt{n}}\right)^k\right)\right]\\&amp;=\exp \left[-\sqrt{n}-\frac{1}{2}-\sum^{\infty}_{k=3}\frac{n}{k}\left(\frac{1}{\sqrt{n}}\right)^k\right]\\&amp;\equiv\exp \left(-\sqrt{n}\right)\exp \left(-\frac{1}{2}\right)\end{align} Choose $b_n=\exp \left(-\sqrt{n}\right)$, so that  \begin{align} \dfrac{a_n}{b_n}\to\exp \left(-\frac{1}{2}\right).\end{align} Since $b_n \to 0$, there exists $N$ such that for all $n\geq N,$ \begin{align} \exp \left(-\sqrt{n}\right)&lt;\dfrac{1}{n^2}.\end{align} Hence, \begin{align}\sum^{\infty}_{n=N}b_n= \sum^{\infty}_{n=N}\exp \left(-\sqrt{n}\right)\leq \sum^{\infty}_{n=N}\dfrac{1}{n^2}&lt;\infty,\end{align} and so, $\sum^{\infty}_{n=1}b_n&lt;\infty\implies \sum^{\infty}_{n=1}a_n&lt;\infty$ by Limit comparison test.