was recently closed on Stack Overflow as a duplicate of another question.  That original question did not have any answers.  However, the close reason clearly states:     This question has been asked before and already has an answer. If those answers do not fully address your question, please .   First off, there are no answers, so the non-existant answer couldn't address the question.    Secondly, this makes it sound like if your question is closed as a duplicate, you should ask a new question.  That's not at all what we want, right?  I don't remember the text being like that before, but I could be wrong.
I just had a case of a user who re-posted his question because his first question was closed as a duplicate. And, logically, I closed his re-post as a duplicate of his original, asking him to edit his original and explain why it's not a duplicate, so we can reopen it.  This process has worked like that for years now, but suddenly I realized that with the new message, question repetition is even encouraged:     This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.   Clearly, a new user who finds their questions closed will now be happy to just post their question again and again, until it's not a duplicate anymore, instead of just fixing their original post.  We need to be more explicit about this, and show this message to the OP of the question:     If those answers do not fully address your question, please edit your question and explain why it is not a duplicate.   The original message should still be visible to other users and visitors, as they can't fix that question, of course.
1970s scifi/horror novel where protagonist is used by a crablike creature to feed its larvae, goes mad, and is defeated by retraumatising him I read this book once as a teenager, I think it might have been written in the 1970s but could be late 1960s or early 1980s.  The protagonist is left to die hideously by enemies. He is paralysed and left on some planet (I don't believe it was earth) in the habitat of some kind of crablike creature, which injects him with its young, and periodically returns to force nutrient and a paralytic agent down his throat, as the larvae grows inside him.  He is rescued, and his body rebuilt to some kind of superhuman abilities, but he is traumatised and bent on indiscriminate revenge for his suffering. He proves hard to defeat.   He is eventually defeated by trickery, when he is shown (or demands to see) something by some kind of video link or remote TV/monitor - perhaps he is told that people he wants revenge on, are held captive for him, I can't be sure.   I think maybe he takes hostages or makes a severe threat, and his demands relate to the people he wants revenge on. But he can't be physically reached, so what can be done?  They set up a video feed, to negotiate, or more likely, to purportedly show him they have what (or who) he wants, and he looks to see.  When he looks at the video stream, it's actually an image of the crablike creature. The shock of repressed memories flooding back, renders him re-traumatised and perhaps catatonic, and defeats him. How to read a csv file and use the values as x and y points in blender? How can i use the value in column 'lon' and 'lat' as the position of my uv_sphere? For example,read the values from line 4, (116.4559081, 39.9139083), and make these 2 numbers as my uv_sphere x and y position in blender? and gives different colors for different mode, for example i have 4 modes in the csv , i want to make the uv sphere that represents the bus mode to be red, and subway to be green , rail to be blue and tram to be yellow., and use the row ['from'] and ['to'] to connect the nodes with a cylinder with x scale 0.5 , y scale 0.5 and the z scale with the value in ['length'] value. Galois group of the product of two fields being the product of Galois groups? I'm just wondering if the following theorem is reasonable and whether the proof is makes sense or not? Also I have an application of it which I was trying to do earlier but I made a lot of mistakes so I would be very grateful if anyone would give some comments on this in case I have some very strong misunderstandings about Galois theory.    Theorem Let $E_1$ and $E_2$ be Galois field extensions of $F$ with trivial intersection ($E_1 \cap E_2 = F$), then $E_1 E_2$ has Galois group $\text{Gal}(E_1/F) \times \text{Gal}(E_2/F)$.  Proof   $E_1$ and $E_2$ are splitting fields (over $F$) of some polynomials $f_1$ and $f_2$ so $E_1 E_2$ is the splitting field of $f_1 f_2$ over $F$ and therefore it is Galois and we are justified using the "Gal" notation. Let $\sigma_1 \in \text{Gal}(E_1/F)$ and $\sigma_2 \in \text{Gal}(E_2/F)$ then by the fundamental theorem of Galois theory we can lift these both into elements of $\text{Gal}(E_1 E_2/F)$. The claim is that $\sigma_1 \sigma_2 = \sigma_2 \sigma_1$, to see this consider an element $\alpha \in E_1$, we have both $\sigma_2 \alpha = \alpha$ and $\sigma_2 \sigma_1 \alpha = \sigma_1 \alpha$ because it is invariant with respect to $\sigma_2$, but we can combine these equalities to get $\sigma_1 \sigma_2 \alpha = \sigma_2 \sigma_1 \alpha$. Both groups $\text{Gal}(E_i/F)$ ($i = 1,2$) are included in $\text{Gal}(E_1 E_2/F)$ and the degrees say there are no more elements, furthermore since they commute we can conclude $\text{Gal}(E_1 E_2/F) = \text{Gal}(E_1/F) \times \text{Gal}(E_2/F)$.     So hopefully that theorem is, if not correct, fixable.. and can be used to prove that $\mathbb Q (\sqrt{a_1},\sqrt{a_2},\cdots,\sqrt{a_n})$ has Galois group $C_2^m$ ($m \le n$) over $\mathbb Q$? How can I set conditional formatting on a particular cell that depends on another cell's value? Tweaking AStar to find closest location to unreachable destination I've implemented AStar in Java and it works ok for an area with obstacles where the chosen destination is reachable.  However, when the destination is unreachable, the calculated "path" is in no way to the closest location (to the unreachable location) but is instead some random path.  Is there a feasible way to tweak AStar into finding the path to the closest location to an unreachable destination? Optimizing logical sector size for physical sector size 4096 HDD What is DOCTYPE and why do I want to use it? What are the different DOCTYPEs I can use? What is the difference between standards and quirks mode, and what are some quirks I may run into with differently set DOCTYPEs?   Lastly, what is the proper DOCTYPE that I should be using? Suggested edit review should show custom rejection reasons Somewhat similar to , but rather more limited: when Rejecting an edit, not only the count of custom rejection reasons but the actual text of the reasons should be shown, IMO. Just now I  on SO that tidied some code in a trivially correct and substantially superior way because it looked perfectly legitimate and I couldn't understand why anyone would bother with a custom rejection reason. As it turned out, it was code in a question, of course.  In this case, the rejection reason correctly identified the problem, and had I seen it, I would have been reminded of that aspect I had neglected to check. Physics are not simulated past a certain frame? Normalizer of upper triangular group in ${\rm GL}(n,F)$ The following question has already appeared on mathstack:     If $B$ is the subgroup of ${\rm GL}(n,F)$ consisting of upper triangular matrices then normalizer of $B$ in ${\rm GL}(n,F)$ is $B$ itself.   I know a proof of this using Bruhat decomposition of ${\rm GL}(n,F)$.   Question: Can we prove above theorem without using Bruhat decomposition?    Why came to this question: Consider the general linear Lie algebra $L=\mathfrak{gl}(n,F)$; in it, let $T=\mathfrak{t}(n,F)$ be the upper triangular sub-algebra. Then normalizer of $T$ in $L$ is $T$ itslef, and this can be proved just by considering a very simple decomposition of ${\mathfrak gl}(n,F)$: write any element as sum of upper triangular matrix and lower triangular matrix whose diagonal is $0$.   But then for problem above, is it necessary to use Bruhat decomposition? Covariance between sum of iid random variables and sum of indicator functions The question is-     Let $X_1,X_2,..,X_n$ be iid random variables from a continuous distribution whose density is symmetric about $0$. Suppose $\mathbb{E}(|X_1|)=2$ and define $Y=\sum_{i=1}^{n}X_i$ and $Z=\sum_{i=1}^{n}I(X_i&gt;0)$. Then calculate covariance between $Y$ and $Z$.   My attempt:  $E(X_i)=0$ for all $i=1(1)n$ because $X$ is symmetric about $0$ and $E(|X|) $ exists.   Now,  $Cov (Y,Z)=E(YZ)-E(Y)E(Z)$ $=E(YZ)-0$ $=E[(\sum_{i=1}^{n}X_i)(\sum_{i=1}^{n}I(X_i&gt;0)]$  $=(\sum_{i=1}^{n}E[(X_i.I(X_i&gt;0))]$ $+\sum\sum_{i \neq j}E(X_i)E(I(X_j&gt;0)$ as $X_i,X_j$ are independent.   $=\sum_{i=1}^{n}E[(X_i.I(X_i&gt;0)] +0 $ as $E(X_i)=0$  $ =\sum_{i=1}^{n}\{E[X_i.I(X_i&gt;0)|I(X_i&gt;0)=1]×1/2] + E[X_i.I(X_i&gt;0)|I(X_i&gt;0)=0]×1/2]\}$  $=\sum_{i=1}^{n}E[X_i.I(X_i&gt;0)|I(X_i&gt;0)=1]×1/2] +0$  $=\sum_{i=1}^{n}E[X_i|X_i&gt;0]×1/2]$  $=2n×(1/2)$ $=n$  Is my reasoning correct ? Thanks in advance! Say I have a huge text file (>2GB) and I just want to cat the lines X to Y (e.g. 57890000 to 57890010).  From what I understand I can do this by piping head into tail or viceversa, i.e.   head -A /path/to/file | tail -B   or alternatively  tail -C /path/to/file | head -D   where A,B,C and D can be computed from the number of lines in the file, X and Y.  But there are two problems with this approach:   You have to compute A,B,C and D. The commands could pipe to each other many more lines than I am interested in reading (e.g. if I am reading just a few lines in the middle of a huge file)   Is there a way to have the shell just work with and output the lines I want? (while providing only X and Y)? Join tables from two different server Forward/Inverse Search Does Not work on certain tex files I have this weird issue with forward and inverse searches. I am using WinEdt + Sumatra combination. The forward and inverse search works perfectly on certain some .tex files, but fails on some others.  Currently, I am working on a .tex file and the inverse search always points to the end of a section. Where ever I double click in a particular section of the pdf, the inverse search points to the end of that section in the .tex file.  Moreover, when I try to perform forward search (Shift+F8) from the .tex file, the section in the pdf file doesn't get highlighted.  There are other .tex files where both the searches work perfectly. What could be the issue with this .tex file? Check if partition is encrypted Finding critical points (extrema) directly without using eigenvalues If we have a function $f: \mathbb R^3\rightarrow \mathbb R$ of the form:  $$f(x)=(a_1x_1^2+a_2x_2^2+a_3x_3^2)e^{-x_1^2-x_2^2-x_3^2}$$  where $a_1&gt;a_2&gt;a_3&gt;0$.   We can find the critical points by:  $$\frac{\partial f}{\partial x_1} =2x_1e^{-x_1^2-x_2^2-x_3^2}(a_1-a_1x_1^2-a_2x_2^2-a_3x_3^2)=0$$  And solving symmetrically for $x_2$ and $x_3$. We get critical points: $(0,0,0) , (\pm 1,0,0) , (0,\pm 1, 0) , (0,0,\pm 1)$   We could determine the nature of them by looking at the eigenvalues of the Hessian, but is there a way to just analyse it directly? Obviously $(0,0,0)$ is a strict global minimum, but I can't quite see that the other points are. Any pointers/hints would be appreciated. Mid 2012 MBP shuts down claiming no power with charge at 30% or 40% or more a, b are integers. p is prime. I want to prove: $(a+b)^{p} \equiv a^p + b^p \pmod p$  I know about Fermat's little theorem, but I still can't get it I know this is valid: $(a+b)^{p} \equiv a+b \pmod p$ but from there I don't know what to do.  Also I thought about $(a+b)^{p} = \sum_{k=0}^{p}\binom{p}{k}a^{k}b^{p-k}=\binom{p}{0}b^{p}+\sum_{k=1}^{p-1} \binom{p}{k} a^{k}b^{p-k}+\binom{p}{p}a^{p}=b^{p}+\sum_{k=1}^{p-1}\binom{p}{k}a^{k}b^{p-k}+a^{p}$ Any ideas?  Thanks! Update Manager asking me to update kernel but apt-get upgrade does not? Consequences of a master thesis with errors I finished my master thesis 6 years ago, since then I gained a lot of experience on my field and also in academia. I can say that in that time I was a "child" , very inexperienced. I think that also my advisor did not help a lot, and I tried to do  a lot of things by my own, without someone to really review my things. Despite that, I still received a good mention by the master committee on final results.   Some days ago, I just decided to read part of master thesis, and I just realized a big nightmare coming. I identified a lot of typos, some references errors, and some improvements that I should do, but I did not. The worst thing is that I wrote a paper to a conference with my master thesis results (and some errors are there). The conference is not a high impact conference, but still the paper has my name and is available for everyone...   As I am finishing my PhD studies for now, I am concerning a lot that situation. My dream and goal is to pursue a Professor career. So, my questions are: What are (or could be) the consequences of a master thesis and paper with errors (some minor and some major) in academia? Revoke degree after years by errors in master is possible ( I am concerning a lot this situation that I thought on it)? How can I minimize it (I thought that I can put a fixed version of my thesis and paper in the future, for instance on my personal website)? How those errors can impact me in a Professor recruitment process?  Sorry for the long text, I am blaming myself all the time, and really afraid about the possibilities since I know that Academia career is really competitive.