So I read a book back in school (2000s), didn't finish it for whatever reason, and have been unable to remember the name or anything outside of a few small details.  Note, it's not Ender's Game or The Giver.  The details I know are:   Main characters are boys aged 8-17ish. They're raised in a school/facility of sorts where everything adheres to a strict schedule. They sleep in 'pods' and have very little freedom. The main boys (I forget but I think there are 2-3) want to escape or to at least see the outside world. When they try to do so, the 'teacher' of sorts (as well as a security team) go after them. The teacher is an ex-soldier or special force unit, as when he gets hit in the face and his nose is broken, he is able to mentally move the pain around. As in, concentrate and move it from his broken nose to another part of his body to 'deal with later', so he can continue to chase after the boys.   That's all I have, but I would really appreciate any help! I've been looking for years. :(
I can't really remember how long ago it was, but I think the book was marketed towards children/teens.  All I remember is the basic premise of the story.  Some story about these unusual little blue electric critters that only certain people could see, and these kids took it upon themselves to go about destroying them since they fed off energy or something like that.  Not sure whether they fed off people or off electricity... or both maybe?  I think the dominant method of destroying them was an electric baton that was taken from law enforcement.  I wanna call them buzz batons, but that's probably thanks to Artemis Fowl.
So, I know that $\max(-X_{(1)},X_{(n)})$ is a sufficient statistic for the parameter $\theta$. But can I also say that $(X_{(1)},X_{(n)})$ are jointly sufficient for the parameter $\theta$ ?  In other words, can a single parameter have jointly sufficient statistics? On every boot up I get this:    For about 10 seconds (or more) before the "normal" Ubuntu Gnome loading screen and the login screen comes up.  I've read some questions and a bug report about this already, but this problem was dismissed as a minor inconvenience or there were no real solutions (that worked for me). For me, this problem leads to an unacceptable slow boot compared to Ubuntu (Unity) or Windows.  Does anybody know how to fix this or is this a "feature" of Ubuntu Gnome and not a bug? Prove that for all integers $ a $ and $ b $, if $ a $ divides $ b $, then $ a^{2} $ divides $ b^{2} $. Let $I = \{a +ib \in \Bbb Z[i] : a$ and $b$ are both multiple of $5\}$. Let $I = \{a +ib \in \Bbb Z[i] : a$ and $b$ are both multiple of $5\}$. Show that $I$ is an ideal of $\Bbb Z[i]$. Is $I$ a maximal ideal? And to find the numbers of elements of the quotient ring $\Bbb Z[i]/ I$.  I have shown that $I$ is an ideal of $\Bbb Z[i]$. But how to verify that $I$ a maximal ideal or not?   And to find the numbers of elements of the quotient ring $\Bbb Z[i]/ I$.   Is there any general way to verify when  $I = \{a +ib \in \Bbb Z[i] : a$ and $b$ are both multiple of $n\}$ will be maximal or not? I want to know the general formula for $\sum_{n=0}^{m}nr^n$ for some constant r and how it is derived.  For example, when r = 2, the formula is given by: $\sum_{n=0}^{m}n2^n = 2(m2^m - 2^m +1)$ according to   Thanks! First post review queue: answers are questions, questions are answers I believe there is a typo in the  review queue. When reviewing a question, the information message asks the user to review the answer. Take a look at the image below.    Similarly, when an answer is posted in the queue, the description box calls it a question instead. Has anyone else noticed this? Set of left cosets is a group Let $N$ be a normal subgroup of $G$. Let $G/N = \{gN : g \in G \}$. Show that the $(G/N, \circ, 1_{G/N})$ is a group, where:  $\circ : G/N \times G/N \rightarrow G/N$ is defined by $(gN \circ hN) = ghN$ and $1_{G/N} = 1*N$.  Thanks for your help. How does the telepathy supernatural ability work? According to the MM books, telepathy is described as:     A creature with this ability (supernatural) can communicate telepathically with any other creature within a certain range (specified in the creature's entry, usually 100 feet) that has a language. It is possible to address multiple creatures at once telepathically, although maintaining a telepathic conversation with more than one creature at a time is just as difficult as simultaneously speaking and listening to multiple people at the same time.   Source: MM, MM3   My questions:   If a creature with telepathy knows that someone is within 100ft, can the creature communicate with that person, even if there is no line of effect or sight?  My answer would be yes, because no book says that telepathy is blocked by walls, etc. Normally, a supernatural ability is a standard action to start. If the creature wanted to communicate for more than one round using telepathy, does the creature need to use up a standard action every round they are communicating or only in the first round?  My answer is only in the first round, since the description says that maintaining telepathy is hard as speaking and listening normally. If a person the creature is communicating with moves out of the 100ft range, and then moves back into the range. Does the telepathic link need to be established again?  My answer is yes, another standard action is needed to establish the telepathy between the two creatures.   I should add the telepathy is supernatural, and a character is looking at getting it from the Mindbender class (from Complete Arcane). And also get the Mindsight feat (Lords of Madness). I couldn't find anywhere to rule whether a supernatural ability should take a standard action every round it is on. Quoting columns with spaces in PostgreSQL? I migrated a database from SQL Server to PostgreSQL.  Most column names contain double words, for example:  SELECT [Column Name] FROM table;   ...which does not work in PostgreSQL.  What is the correct syntax for PostgreSQL? If $a_k\geq0$ is a decreasing sequence converging to $0$, do we have $\lim_{n\to\infty}\frac{\sum_{k=1}^n a_k}n = 0$? Can anyone help me with this problem?     Let $f:[0,\infty)\longrightarrow \mathbb R$ be a continuous function such that for each $x&gt;0$, we have $\lim_{n\to \infty}f(nx)=0$. Then prove that $\lim_{x\to \infty}f(x)=0$.   Our teacher told first to prove Baire's theorem, and then show that this is a consequence of that theorem. I proved Baire's theorem, and I spend a few hours thinking on how Baire's theorem is related to this problem, but I couldn't find anything. I'd really appreciate your help. How to write permutations as product of disjoint cycles and transpositions $$\sigma=\begin{pmatrix} 1 &amp; 2 &amp;3 &amp; 4&amp; 5&amp; 6&amp;7 &amp;8 &amp;9 &amp;10 &amp; 11 \\ 4&amp;2&amp;9&amp;10&amp;6&amp;5&amp;11&amp;7&amp;8&amp;1&amp;3    \end{pmatrix}$$  (1) I am asked to write this permutation in $S_{11}$ as a product of disjoint cycles and also as a product of transpositions.   (2) Also find the order of the element. Is this permutation even or odd?  I think these are the disjoint cycles  $E_{1}=(1,4,10)$, $\;\operatorname{order}E_1 =3$  $E_{2}= (3,9,8,7,11),\;$ $\operatorname{order}E_{2} =5$  $E_{3}=(5,6),\;$ $\operatorname{order}E_{3} =2$  $S_{11}$=  $E_{1} \cdot E_{2}\cdot  E_{3}$  The order of $\operatorname{order}E_{3}$ is even so the order of the permutation is even. Why are they asking this? And what is the significance of it being even or odd?  Transpositions – I have read this a couple times but the one example in my textbook is rather unclear, I am not sure what this means?  I think the transposition for $E_{1}$ is $(1,4)(1,10)$ but I'm not sure what this means. I have some survey response data that are inconsistent and I'm not sure what is the best way to handle them.  This is the nature of the inconsistency:    Have you ever had a food poisoning episode that you think might have been caused by the food in a particular restaurant ? a) Yes b) No Did any of these episodes prevent you from eating at that restaurant again?  a) Does not apply, never have had a food poisoning episode b) Yes c) No Following these episodes, did you come back to your normal condition after 24 hours?  a) Does not apply, never have had a food poisoning episode b) Yes c) No   I believe that the intent of the designers of the survey was that anyone answering "No" to 1) should answer "Does not apply" to 2) and 3), but that's not how it worked. A large group of respondents picked "No" for 1) and "No" for at least one of 2) or 3).    What is the best way to deal with this inconsistency?    Where are some good references (books, papers, websites, etc.) to look at discussions and solutions for issues of this kind, and data cleaning in general? Get Label value for specified language In German, we often use "Elfhundert" (literally, "eleven hundred") for 1100 or "neunzehnhundert" ("nineteen hundred") for 1900; but is this correct in English? Let $A$ be an infinite set. For each $a \in A$, let $x_a$ be a non-negative number. Let the value of the series $\sum_{a \in A} x_a$ be the value of the supremum of its finite partial sums, i.e.:      $$\sum_{a \in A} x_a = \sup_{n \geq 0} \sup_{(a_1, \ldots , a_n) \subset A} \left(x_{a_1} + x_{a_1} + \ldots + x_{a_n}\right)$$   (Supremum is well defined even when its value is infinite)       If $\sum_{a \in A} {x_a}$ is finite, prove that the set $A' = \left\{{a \in A | a &gt; 0}\right\}$   is countable.   My guess is that we have to write $A$ as a union of finitely many sets. Is it always better to use the whole dataset to train the final model? A common technique after training, validating and testing the Machine Learning model of preference is to use the complete dataset, including the testing subset, to train a final model to deploy it on, e.g. a product.      My question is: Is it always for the best to do so? What if the   performance actually deteriorates?   For example, let us assume a case where the model scores around 65% in classifying the testing subset. This could mean that either the model is trained insufficiently OR that the testing subset consists of outliers. In the latter case, training the final model with them would decrease its performance and you find out only after deploying it.   Re-phrasing my initial question:     If you had a one-time demonstration of a model, such as deploying it   on embedded electronics on-board an expensive rocket experiment, would you trust a   model that has been re-trained with the test subset in the final step without being   re-tested on its new performance? Increase resolution to 4K in VMware or Virtualbox I have a laptop with a 4K (3860×2160) display, but there are a lot of problems. A lot of virtualization programs aren't compatible with 4K resolution.  VMware Workstation and VirtualBox don't support 4K display in the list of the display's resolution. How I can set the resolution of the display in a virtual machine to 4K? class C {   T a; public:   C(T a): a(a) {;} };   Is it legal? I'm trying to prove : Given a simple graph $G$ with $n$ vertices, where $n$ is even, prove that if every vertex has degree $\dfrac n2 + 1$, then $G$ must contain a (simple) $3$-cycle. A (simple) $3$-cycle is a set of $3$ (distinct) vertices, $a, b, c$ such that $ab$ is an edge, $bc$ is an edge and $ac$ is an edge.  I know there are similar ones already on here, but I can't comprehend any of the answers. This is what I have so far:  Base Case: Since the graph has to have at least $3$ vertices to have a simple $3$-cycle, the lowest possible even number of vertices is $n = 4$.   $\dfrac42 + 1 = 3$ degree (edges attached to node). This means each vertex connects to each of the other $3$ vertices since $G$ is a simple graph. Thus, any combination of $3$ vertices will be a simple $3$-cycle.  Inductive Hypothesis: Assume a simple graph with $k$ vertices, where $k$ is even, contains a simple $3$-cycle if each vertex has degree $\dfrac k2 + 1$.  Inductive Step: Since only concerned about when the graph has an even number of vertices, going to show a simple graph with $k + 2$ vertices, where $k$ is even, contains a simple $3$-cycle if every vertex has degree $\dfrac{k+2}{2} + 1$   This is as far as I get and don't know how to finish the Inductive Step (Also please feel free to let me know if I messed anything up, up to this point)