Difference between "sorts" vs. "kinds" vs. "types"
what is the difference between kind, type and sort
Markdown help page is broken (badly presented/formatted) on every site In the  I see:    Is that what the help is supposed to say and look like? Because it doesn't make sense to me.  As animuson points out in a comment, all of the highlighted example text is being shifted to the very left of each line. The entire page is broken. When we implement the Always Encrypted feature in SQL Server 2016, do the .mdf files, .ldf files and .bak files get encrypted as well?  I would like to know if the data/log/backup files gets encrypted or not. Best way to compare 2 XML documents in Java I'm trying to write an automated test of an application that basically translates a custom message format into an XML message and sends it out the other end.  I've got a good set of input/output message pairs so all I need to do is send the input messages in and listen for the XML message to come out the other end.  When it comes time to compare the actual output to the expected output I'm running into some problems.  My first thought was just to do string comparisons on the expected and actual messages.  This doens't work very well because the example data we have isn't always formatted consistently and there are often times different aliases used for the XML namespace (and sometimes namespaces aren't used at all.)  I know I can parse both strings and then walk through each element and compare them myself and this wouldn't be too difficult to do, but I get the feeling there's a better way or a library I could leverage.   So, boiled down, the question is:  Given two Java Strings which both contain valid XML how would you go about determining if they are semantically equivalent?  Bonus points if you have a way to determine what the differences are. Say we have the following sample and we are trying to estimate the variance of the sample mean of the population.  X = [0, -1, 2, 10, -3]   If I take an increasing number of bootstrap (e.g. 100, 1000, 10,000, 100,0000), the bootstrap distribution of the sample mean gets narrower and narrower. In other words, I can make the bootstrap distribution arbitrarily narrow.   Given the above, what's the point of using a different number of bootstrap samples here? And wouldn't this mean that I could make the standard error of the mean arbitrarily small by just taking more and more bootstrap samples? What am I missing?  Please note that I am doing a proper bootstrap sample in the sense that each bootstrap sample has the same exact size as the original sample (input array). Variance (different definitions) I'm new to statistics and reading stats books I found different definitions for Variance.  Definition1: $ s^2 = \frac{1}{n-1} \sum_{i=1}^n (x_i - \bar{x})^2 $  Definition2: $ s^2 = \frac{1}{n} \sum_{i=1}^n (x_i - \bar{x})^2 $  I would like to know why is used different definition for same thing? How to sum $\sum_{x=0}^{N-1} \cos{\left( \frac{2\pi x}{N} \right)}^{2}$? I've tried solving it, but I'm not familiar with these kind of progressions and I couldn't get to a result. Also, I've found that the result is just $N/2$, but I don't get why would that be the answer, as it doesn't work for $N=1$ or $N=2$. Appreciate your help :) Add desktop notifications for Chrome or Firefox How is ISO implemented in digital cameras? If I change the ISO settings on my camera, obviously the gain of the system is increased, amplifying the signal from the sensor. What's not clear to me is where the amplification takes place. I see several possibilities:   In the sensor, by increasing voltage or some other mechanism Via an analog amplifier outside of the sensor Digitally, after the signal has been digitized, but before storing data in the RAW file As a parameter applied solely in creating an image from RAW   If #4 is true, then you could take a 4-stop overexposed RAW picture at ISO 1600, and then in post processing produce a JPEG at ISO 100 that would be the same as if the original photo had been shot at ISO 100.  If #1 or #2 is true, then a RAW file shot at ISO 1600 would actually contain more information about shadows, and an ISO 100 RAW would contain more information about highlights. I'm reading An Introduction to Manifolds (Tu) and got confused on p.123 Theorem 11.13. Let me briefly explain what was done before that.  The author defines an embedding between two manifolds $f: N\rightarrow M$ as an injective immersion (differential is injective everywhere) with the additional property that $f(N)$ as a subspace of $M$ is homeomorphic via $f$ to $N$. Then a canonical form theorem is proven, namely, that for any point $p \in N$, there are charts $(U,\phi = x^1, \ldots, x^n) \ni p$ and $(V,\psi = y^1, \ldots, y^m) \ni f(p)$, such that the transition map takes the following form:  $$\psi \circ f \circ \phi^{-1} : (r^1,\ldots,r^n) \mapsto (r^1,\ldots,r^n,0,\ldots,0).$$  (I guess it is implicitly assumed that $f(U) \subset V$).  Now in the process of proving that $f(N) \subset M$ is an , he states that $f(U) \subset V$ is defined by the vanishing of the coordinates $y^{n+1},\ldots,y^m$. I can prove that $$ f(U) \subset \{q \in V: y^{n+1}(q) = \cdots = y^m(q)\} $$ but not the reverse inclusion. Can anyone explain why this should be true? Suppose $ T \subset \mathbb{C} $. Show that the corresponding set $ S \subset \Sigma $ is  a. a circle if $ T $ is a circle. b. a circle minus (0, 0, 1) if $ T $ is a line.  Here we are defining $ \Sigma $ to be the Riemann sphere, given by the set: $$ \Sigma = \left \{(\xi, \eta, \zeta) : \xi^{2} + \eta^{2} + (\zeta - \frac{1}{2})^{2} = \frac{1}{4} \right \} $$  To take a point from $ \mathbb{C} $ to $ \Sigma $ we can use the following:  $$ \xi = \frac{x}{x^{2} + y^{2} + 1}; \eta = \frac{y}{x^{2} + y^{2} + 1}; \zeta = \frac{x^{2} + y^{2}}{x^{2} + y^{2} + 1} $$  We define a circle on $ \Sigma $ to be the intersection of a plane of the form $ A\xi + B\eta + C\zeta = D $ with $ \Sigma $. We also know the converse of this problem is true, that the intersection above yeilds a set in $ \mathbb{C} $ with the following property:  $ (C - D)(x^{2} + y^{2}) + Ax + By = D $. As you can see, when C = D, then an equation for a line is yeilded, otherwise it is a circle.   I really am at a  loss about how to solve this problem. The only thing I can think to do is to pick 3 points on a circle or radius $ r $ with center $ z_{0} $, use these points to find two vectors in $ \Sigma $, take their cross product to get a normal vector, use this normal vector to get a plane. Once I have the plane in form $ A\xi + B\eta + C\zeta = D $ then I could prove that the circle I had chosen corresponds exactly with $ (C - D)(x^{2} + y^{2}) + Ax + By = D $. Is there not an easier, less computation way to do this? How do I simulate in Photoshop what a piece will look like when printed on non-white paper? I'm designing a box in Photoshop that will be offset printed on unbleached paper. I haven't picked out a printer yet, so I don't know the exact kind of paper I'll be using and don't have access to it for proofs. For now I'm using a lightly-textured layer of tan color as a placeholder to mock it up.  What I'm trying to figure out is, how do I figure out how my design will look printed on natural paper rather than bleached white paper? I know that the brightness will be diminished and the hue will be altered, but I need to know how much so I can compensate for it as much as possible.  Is there a way to get at least a rough but reliably-simulated idea of how my prints will come out? Does it have to do with blend modes, or color separations? I'm at a bit of a loss here. An infinite Penney's game. Context: I need to solve one variation of the . Problem: Two players ($A$ and $B$) throw a coin until one of the victory sequences appears. For player $A$ the victory sequence is $HTT$, for player $B$ the victory sequence is $TTH$. What is the probability that $A$ wins and what is the expected number of throws given that $A$ won? My attempt: Intuitively, it seems that player $B$ is more likely to win. Basically, I reliase that we can use the Markov-Chains, but my idea is only draw a binary tree and consider the sequences on the n-th step. My another idea was to calculate the expected number of throws to get, say, $HH$ that would be equal to $r_{HH}$: $$r_{HH} =  \frac{1}{4}E(number|HH) + \frac{1}{4}E(number|HH)+ \frac{1}{4}E(number|TT)+ \frac{1}{4}E(number|TH) = \frac{1}{4}(9 + \frac{5}{2} r_{HH})$$  And get $r_{HH}$. My issues: I don't really understand how to join these ideas to get a proper solution. Is drawing multiple cards an atomic action? Is drawing multiple cards an atomic action, or do effects triggered by drawing a card trigger for each card drawn instead?  Consider , which reads:     Whenever a player draws a card, Spiteful Visions deals 1 damage to that player.   If a player were to be compelled to draw more than one card, would that player be dealt the damage all at once, or one at a time? For example, how many times would  need to be activated to prevent all damage?  Furthermore, if there exist additional effects that are triggered by damage dealt in this way, are such effects resolved together atomically or is each resultant effect resolved individually?    How about tutors, or other cards not using the word 'draw', eg:      If you would draw a card, look at the top three cards of your library instead. Put one of those cards into your hand and the rest on the bottom of your library in any order. 3/4 circle with plus in it? Here is a problem which i have not been able to do for quite sometime.   For $n \geq 2$, show that $n \nmid 2^{n}-1$.   I have thought of proving this in two ways: One by using induction which didn't actually work. Next by Fermat's little theorem we have $2^{p-1} \equiv 1 \ (\text{mod} \ p)$, which actually says that for $p \mid 2^{p}-2$. But i couldn't proceed more than this. Any ideas by which i can actually solve the problem? How to roll perception checks for characters who aren't actively looking without arousing suspicion? This applies to all d20 systems, but with an example from the from the Pathfinder  (emphasis mine):  Stonecunning: Dwarves receive a +2 bonus on Perception checks to potentially notice unusual stonework, such as traps and hidden doors located in stone walls or floors. They receive a check to notice such features whenever they pass within 10 feet of them, whether or not they are actively looking.  In this case, does the GM roll the check in secret or ask the player roll the check? If the GM asks the player to roll for the check, what stops situations like:  GM: (interrupting) &quot;Gimli, Roll a perception check.&quot; Dwarf player: &quot;Oh, it's a natural one, I guess I don't see anything.&quot; Human player: &quot;Okay, I'll roll a perception check for anything unusual in this room. Nice! 19. How about 19, does 19 work for you?&quot; GM: &quot;Gimli, everything looks kosher to you. Aragon, you notice a rock coloured tarp on the ground here, covering what looks like a pit trap.&quot;  In this case, by telling the dwarf to roll his &quot;free&quot; perception check, he's telegraphed to the players that there is something to notice. How can this be fixed, without bluffing checks for nothing in particular to throw off the signal to noise ratio of similar checks? Prove Equivalence Relation in G Hei, guys!  I'm having some trouble with the next problem:  Let $A$ and $B$ be subgroups of $G$. Show that $\sim$ is an equivalence relation when it is defined as follows: $g\sim g'\Leftrightarrow g' = agb$ for some $a$ from $A$, $b$ from $B$.  Should I prove this is valid for any a and b? It says for some elements a and b. But I might as well take the unit element.   Could you give me a clue on how to solve it?  Cheers! I noticed that Dolores Umbridge was born during the first Wizarding War, so it's very likely she wasn't a Death Eater then (but she is pretty evil -- who knows?).  After that Voldemort was not around in a way that could affect many people, and most wouldn't know he was planning to rise again.  During that time, and up through Voldemort's return (in Goblet of Fire), did Umbridge have any connection with the Death Eaters or with Voldemort?  Was she doing what she did on her own, or was it because of an association with Voldemort or his allies? Why doesn't calling a Python string method do anything unless you assign its output? Why does Beamer not change the itemize symbol when using \setbeamertemplate? This code:  \documentclass[10pt]{beamer} \setbeamertemplate{itemize item}[circle] \setbeamertemplate{itemize subitem}[triangle] \setbeamertemplate{itemize subsubitem}[square]   \begin{document} \begin{frame} \begin{itemize} \item first level     \begin{itemize}     \item second level         \begin{itemize}         \item third level         \end{itemize}     \end{itemize} \end{itemize} \end{frame} \end{document}    produces this output:    I expected the symbol of the first level item to be a circle, not a square. Is there an error in my code? The log file was too long to include in the question, so I .