What do I use the curse and coin randomizer cards for?
Dominion randomizer deck confusion
A matrix and its transpose have the same set of eigenvalues/other version: $A$ and $A^T$ have the same spectrum How does one create a custom application launcher for Wine installed apps? QGIS creating a fixed distance buffer over selected areas not the entire layer what im doing is making a fixed distance buffer and it's working splendidly but i need the buffer to be created over certain selected areas not the entire layer, and at the creation wizard is only offers the the option of selecting the entire layer, and i need some areas within that layer to have a different buffer and some none at all.  is there a way around that? Electricity takes the path of least resistance? Electricity takes the path of least resistance!   Is this statement correct?    If so, why is it the case?  If there are two paths available, and one, for example, has a resistor, why would the current run through the other path only, and not both? Highlight a word with jQuery I basically need to highlight a particular word in a block of text. For example, pretend I wanted to highlight the word &quot;dolor&quot; in this text: &lt;p&gt;     Lorem ipsum dolor sit amet, consectetuer adipiscing elit. &lt;/p&gt; &lt;p&gt;     Quisque bibendum sem ut lacus. Integer dolor ullamcorper libero.     Aliquam rhoncus eros at augue. Suspendisse vitae mauris. &lt;/p&gt;  How do I convert the above to something like this: &lt;p&gt;     Lorem ipsum &lt;span class=&quot;myClass&quot;&gt;dolor&lt;/span&gt; sit amet, consectetuer adipiscing elit. &lt;/p&gt; &lt;p&gt;     Quisque bibendum sem ut lacus. Integer &lt;span class=&quot;myClass&quot;&gt;dolor&lt;/span&gt; ullamcorper     libero. Aliquam rhoncus eros at augue. Suspendisse vitae mauris. &lt;/p&gt;  Is this possible with jQuery? Edit: As  , this is quite possible without jQuery - but I was hoping there might be a special method of jQuery which would let you do selectors on the text itself. I'm already using jQuery heavily on this site, so keeping everything wrapped up in jQuery would make things perhaps a bit more tidy. After hours of banging my brain against my skull, I narrowed down an issue I'm having to the fact that \makeatletter doesn't work inside \newcommand. Commands that I call after \makeatletter are registered as undefined, as if \makeatletter didn't do anything.  Why is this the case?  In the example below, I define two commands. Calling one of them from the document body causes the undefined error, while the other doesn't.  \documentclass[11pt]{book} \usepackage{kvsetkeys}  \newcommand{\commandThatFails}{     \makeatletter \comma@parse{}{} \makeatother }  \makeatletter     \newcommand{\commandThatWorks}{         \comma@parse{}{}     } \makeatother  \begin{document}  Hi there.  \commandThatFails \commandThatWorks  \end{document} Change default shell for Terminator I want to change the default shell of Terminator to zsh. In /etc/passwd/ I've changed the default shell to /bin/zsh. This settings changes the default shell in LXTerminal (the default terminal on Lubuntu), but not in Terminator. So I tried chsh -s /bin/zsh, but that doesn't work either. The Terminator  says:  How do I change my default shell? Terminator will always start the shell specified by the SHELL environment variable. (It will fall back to /bin/sh if the SHELL environment variable isn't set.) You could simply influence Terminator's environment, but the best solution is to tell your operating system which shell you'd like, and it will ensure that SHELL is set correctly for all applications, not just Terminator. See the documentation for your operating system for details on how to change your default shell.  So I expected my attempts to work, but they don't. How can I change the default shell in Terminator. Give each site a parallel site for polling, recommendations and subjective-ish stuff Stuff like polls, recommendations based on subjective constraints, puzzles, webcomics etc. do not belong on the serious main SE sites, where professionals should be considered at work and having just a few spare minutes ("code's compiling") to answer questions, so they should not be distracted by such things. However, I'd also like to have a home for these things still using the SE engine. For the reason I mentioned before, this needs to be a separate place though. Let's call it four.[sitename-here].com. Can I recover my deleted world? I was playing terraria today, and my friend came and deleted the my world.  Is there a way for me to recover my world? How to recognise/thank great cabin crew? Those of us who fly a lot will know that there is a bit of a variety in cabin crew. Some (sadly more common on certain airlines) do the very bare minimum to ensure a safe flight, but nothing more. Many (especially on airlines noted for good customer service) provide a good service.  Every so often though, you come across a flight crew who go the extra mile. These are the ones always friendly, always helpful, always thinking ahead and solving the problem before it has happened. One moment they're serving you your drink, the next reassuring a little old lady about the flight, the next magicing a colouring book to turn an impending toddler crisis into a happy small child, then answering queries on arrivals and immigration for a first time travaller, then back to offer you a top up of what you're drinking (which they've remembered exactly). Not very often found, but very much appreciated when you happen across them on your travels!  In the case when you do luck out and find yourself on a flight with a great cabin crew (who go well beyond what you normally experience as "good" on that airline/kind of airline), is there a standard/common way to recognise them at the end of the flight? Not just to thank them then and there, but also to let the airline know that this person/group are what the rest of their staff should be aspiring to. Is there any standard way, or does it vary entirely by carrier? No more disk space: How can I find what is taking up the space? I've run into a problem on one of my servers running 16.04: there is no disk space left.  I have no idea what is taking up the space. Is there a command to list the current directory sizes, so I can traverse and end up in the directory taking up all the space? I created a simple service layer polygon in network analyst (ArcGIS Desktop 10.2) with no hierarchies set in the street network. Now I don't understand why is this polygon created along some particular streets?   Why isn't is properly spread out? For example, why doesn't the polygon cover the areas/streets I have marked in red? Obviously those marked areas are also within 1 km.  The impedance is 1 km and 2 km respectively.   The streets are also well connected individual line elements as you can see the junctions. Let $T:V\to V$ be a linear map, where $V$ is an inner product space. Given $T^2=\frac{T+T^*}{2}$, prove that $T$ is normal and that $T=T^2$. Let $T:V\to V$ be a linear map, where $V$ is a finite-dimensional inner product space. Given $T^2=\frac{T+T^{*}}{2}$, I would like to prove that $T$ is normal and that $T=T^2$. The first part, to prove that $T$ is normal, is quite easy: from $T^2=\frac{T+T^{*}}{2}$ we'll have $\,T^{*}=2T^2 - T$, and as $TT^{*} = 2T^3 -T^2 = T^{*}T$. Now, I need to prove that $T=T^*$, then $T = T^2$ is immediate. I have been thinking about this question for some days and I can't figure out in what technique to prove that $T = T^{*}$. (a) $S_k=\{A\subset\mathbb{N}: |A|=k\}$ for $k\in\mathbb{N}$  (b) $S = \bigcup_{k=1}^\infty S_k$   Work: For (a), I am not too sure about what approach I should use. I think finding a bijective function between the $S_k$ and $\mathbb{N}$ is hard to do . I also thought about using the Schroeder-Bernstein theorem and find injective functions $f:\mathbb{N}\rightarrow S_k$and $g:S_k\rightarrow\mathbb{N}$ in order to prove that $S_k$ and $\mathbb{N}$ are numerically equivalent. However, I have a hard time finding and proving these injective functions. I haven't really looked at (b) as I have yet to complete (a). Why is $\omega$ the smallest $\infty$? I am comfortable with the different sizes of infinities and Cantor's "diagonal argument" to prove that the set of all subsets of an infinite set has cardinality strictly greater than the set itself. So if we have a set $\Omega$ and $|\Omega| = \aleph_i$, then (assuming continuum hypothesis) the cardinality of $2^{\Omega}$ is $|2^{\Omega}| = \aleph_{i+1} &gt; \aleph_i$ and we have $\aleph_{i+1} = 2^{\aleph_i}$.  I am fine with these argument.  What I don't understand is why should there be a smallest $\infty$? Is there a proof (or) an axiom that there exists a smallest $\infty$ and that this is what we address as "countably infinite"? or to rephrase the question "why can't I find a set whose power set gives us $\mathbb{N}$"?  The reason why I am asking this question is in "some sense" $\aleph_i = \log_2(\aleph_{i+1})$. I do not completely understand why this process should stop when $\aleph_i = \aleph_0$.  (Though coming to think about it I can feel that if I take an infinite set with $\log_2 \aleph_0$ elements I can still put it in one-to-one correspondence with the Natural number set. So Is $\log_2 \aleph_0 = \aleph_0$ (or) am I just confused? If $n \rightarrow \infty$, then $2^n \rightarrow \infty$ faster while $\log (n) \rightarrow \infty$ slower and $\log (\log (n)) \rightarrow \infty$ even slower and $\log(\log(\log (n))) \rightarrow \infty$ even "more" slower and so on).  Is there a clean (and relatively elementary) way to explain this to me?  (I am totally fine if you direct me to some paper (or) webpage. I tried googling but could not find an answer to my question) What rolls should players get to see? I'm a new DM and over the last few weeks I've been slowly learning the game and how it runs. My party consists of 5 PCs.   One thing I have been wondering after our last two sessions is: What rolls should all the players see and which rolls shouldn't they see?  Is there a comprehensive list of what rolls are public and which go behind the DM screen, or is it more down to house rules or personal preference? Given an alphabet of size $n$, how many strings of length $c$ contain every single letter of the alphabet at least once?  I first attempted to use a recurrence relation to work it out:  $$ T(c) = \left\{ \begin{array}{cr} 0 &amp;\mbox{ if $c&lt;n$} \\ n! &amp;\mbox{ if $c = n$} \\ T(c-1) \cdot n \cdot c &amp;\mbox{ if $c &gt; n$} \end{array} \right. $$  As there's no strings that contain every letter if c &lt; n, and if c = n then it's just all permutations. When c > n you can take any string of size (c-1) that contains all letters (of which there are $T(c-1)$ to choose from), you choose which letter to add (of which there are $n$ choices) and there are $c$ different positions to put it. However, this gives out results that are larger than $n^c$ (the total number of strings), so it can't be right, and I realised it was because you could count some strings multiple times, as you can make them taking different inserting steps.   Then I thought about being simpler: you choose n positions in the string, put each letter of the alphabet in one of those positions, then let the rest of the string be anything:  $$ {c\choose{n}} \cdot n! \cdot n^{c-n} $$  But again this counts strings multiple times.  I've also considered using multinomial coefficients, but as we don't know how many times each letter appears in the string it seems unlikely they would be much help. I've also tried several other methods, some complicated and some simple, but none of them seem to work.  How would you go about working out a formula for this? I'm sure there's something simple that I'm missing. Using Regular Expressions to Extract a Value in Java I have several strings in the rough form:  [some text] [some number] [some more text]   I want to extract the text in [some number] using the Java Regex classes.  I know roughly what regular expression I want to use (though all suggestions are welcome). What I'm really interested in are the Java calls to take the regex string and use it on the source data to produce the value of [some number].  EDIT: I should add that I'm only interested in a single [some number] (basically, the first instance). The source strings are short and I'm not going to be looking for multiple occurrences of [some number]. Fitting a plane to a set of points in 3D using PCA I am trying to estimate a midplane of a 3D model using the midpoints of paired landmarks, in order to reconstruct missing data (midplane refers here to the middle/saggital plane of the cranium which cuts the skull into two symmetrical halves, left and right).  I therefore need to estimate a plane from 27 points in 3D. I need to get the equation of the plane as $$ax+by+cz=d.$$  I have looked into orthogonal regression and principal component analysis (PCA) as methods, however I didn't take maths past A-levels and am struggling. I know I can supposedly use the eigenvectors to get the equation of the plane of best fit, but need someone to explain exactly how. I am using R for the PCA but am not great at R either.  Alternatively, if there's a better way to estimate the plane I would be glad to hear it! Everything was working fine for a long time. But suddenly the device is getting slower than usual (e.g. apps react slowly when starting an action -- like the RSS reader takes "ages" to open an article). Also, several apps start crashing: force-closes as well as unexpected restarts. Sometimes this even involves some automatic reboot of the device.  Is there anything I can do, besides doing a factory-reset? Preferably it should work on un-rooted devices.  Remark: not all described problems may occur together, so on one device e.g. there might be no automatic reboot involved. Question remains the same, nonetheless.