Most modern motorized vehicles are capable of both forward and reverse motion.  In the Star Trek universe, can an unmodified warp drive also be used to move backwards?  I realize that pretty much every ship we've seen has its navigational deflector (that is, the force field generator that pushes space dust and small debris away from the path of the ship) installed at the front of the vessel.  But ; it doesn't make it impossible.  Safety issues aside, is there any technical or engineering reason why warp drives cannot operate in reverse?  If not, have we ever observed a ship warping backwards, perhaps to escape from a dire emergency?  Or have we perhaps observed ships with an extra navigational deflector mounted on the rear?  I'm interested primarily in the canonical TNG-era continuity (including the DS9 and Voyager series), with preference given to evidence from the shows and movies themselves, or alternatively to reliable print sources such as the show's Writers'/Directors' Guide and the Technical Manual.  If this issue is absolutely never discussed in those sources, then an answer based on other Trek series/movies/continuities/canons would be acceptable.
I've seen them maneuver. They definitely can go backwards. How fast can they go in reverse? Is warp speed possible, or is reverse limited to impulse power? If it is limited to impulse power, can they travel backwards under impulse power as fast as they travel forwards under impulse power?
How to make child process die after parent exits? Suppose I have a process which spawns exactly one child process. Now when the parent process exits for whatever reason (normally or abnormally, by kill, ^C, assert failure or anything else) I want the child process to die. How to do that correctly?    Some similar question on stackoverflow:   (asked earlier)  (asked later)      Some similar question on stackoverflow for Windows: Prove that every idempotent element is not nilpotent element. Let $R$ be a ring. Prove that every idempotent element is not nilpotent element.  I've got a problem with proving this question. I was be grateful, if somebody would be help me. What does the “@@…@@” meta line with at signs in svn diff or git diff mean? Help, i tried installing kaltools and my Ubuntu is messed up! I tried installing Kali Linux tools.  I started installing some tools and there were several things I had to "agree" to and one message said add users... something in terminal, and when I came back I saw terminal reporting removing a bunch of core programs that I needed. I canceled the process but I don't know if I should reinstall Ubuntu or not.  How can I repair my system? How does deleting work? What can cause a post to be deleted, and what does that actually mean? What are the criteria for deletion? What circumstances can cause a question or answer to be deleted, and what does that actually mean?    How can a post be deleted? When can't I delete my own post? Can I still see my post even after it's deleted? Can I see a list of my deleted posts? How can I undelete one of my posts? What does deletion mean for a post? How do votes to delete work? What are the criteria for deletion? What else should I know about deleted posts? If I flag my question with a request to delete it, what will happen?       For more information, see the articles about  and  in the . biblatex ieee style same authors I'm creating a function where I need to pass an object so that it can be modified by the function. What is the difference between:  public void myFunction(ref MyClass someClass)   and  public void myFunction(out MyClass someClass)   Which should I use and why? How to add a progress bar to a shell script? When scripting in bash or any other shell in *NIX, while running a command that will take more than a few seconds, a progress bar is needed.  For example, copying a big file, opening a big tar file.  What ways do you recommend to add progress bars to shell scripts? Integral closure of $\mathbb{Z}$ in $\mathbb{C}$ is not finitely generated as a $\mathbb{Z}$-module? Let     $$ \mathbb{Z}^{'}_{\mathbb{C}}=\{ z \in \mathbb{C} | \exists f \in \mathbb{Z}[X] \text{ monic such that } f(z)=0\} $$   be the integral closure of $ \mathbb{Z} $ in $ \mathbb{C} $. Prove that $ \mathbb{Z}^{'}_{\mathbb{C}} $ is not finitely generated as a $ \mathbb{Z} $-module.  My attempt: Suppose $ \mathbb{Z}^{'}_{\mathbb{C}}=\mathbb{Z}\alpha_{1}+...+\mathbb{Z}\alpha_{n} $ for some $ \{ \alpha_{i}\}_{i=\overline{1,n}} \subset \mathbb{Z}^{'}_{\mathbb{C}} $. I know that given $ \alpha , \beta \in \mathbb{Z}^{'}_{\mathbb{C}} $ with minimal polynomials of degrees $ m $ and $ n $ respectively, then we can construct a monic polynomial with integral coefficients $ P(z)=\prod(z-(\alpha_{i}+\beta_{j})) $ where $ \alpha_{i},\beta_{j} $ are the conjugates of $\alpha $ , $\beta $ and therefore the minimal polynomial of $ \alpha + \beta $ has degree $ \leq mn $.   I was thinking that then the degrees of the minimal polynomials of the elements of $ \mathbb{Z}\alpha_{1}+...\mathbb{Z}\alpha_{n} $ could be somehow bounded by a certain constant, whereas $ \mathbb{Z}^{'}_{\mathbb{C}}$ contains elements whose degrees of the minimal polynomials are arbitrarily large, take $ 2^{\frac{1}{n}} $ for example,$ n\geq 2$. I think this works when we are asked to prove that the set of all algebraic numbers $ \overline{\mathbb{Q}} $ is not a finitely dimensional $\mathbb{Q}$-vector space, but I don't know how to proceed in my case.  I would really appreciate any ideas, hints or solutions. Thank you very much! Can I manually limit the %CPU used by a process? Can I access private members from outside the class without using friends? Is the harmonic oscillator potential unique in having equally spaced discrete energy levels? I was wondering if the good old quadratic potential was the only potential with equally spaced eigenvalues. Obviously you can construct others, such as a potential that is infinite in some places and quadratic in others, but that's only trivially different. I am not referring to equally spaced as a limiting behavior either, I mean truly integer spaced.  Any ideas? If not, is there a proof for its uniqueness?  If there are other potentials with equally spaced eigenvalues, can one use them as starting points for a free-field QFT? It would be interesting to know if there is a deeper mathematical relation between all of these potentials and whether they could be used to study interacting systems. Is there a reasonable statistic test one can do to standard random number generators (say, one of those that come built in in Python libs) which shows they are not really random?  (By reasonable I mean to exclude silly things like «generate a looong list and see that it is periodic»)  Later: Notice I am looking for a test that fails on standard generators. Getting opencv error in c++ What is PECS (Producer Extends Consumer Super)? How to show only date after the date of today in JCalendar Do muggleborns get their letter on their 11th birthday or the summer before they start Hogwarts? A lot of the fanfiction seems to like to give Hermione her letter in September to coincide with her birthday. That just doesn't seem very logical for the Statute of Secrecy, as you then have 10 out of every 12 10-year-old wizards and witches knowing about magic while finishing the school year (assuming even distribution of birthdays).   It seems to me that this is just asking at least one of them to brag about knowing magic and spill the secret.   Also this would mean that the poor kid born on 30 of August would only have 2 days to adjust to being magical before being shepherded off to a boarding school in the middle of nowhere.  From another point of view, getting such news on your birthday can screw up a lot of celebration plans.  Also, from rereading the memory from Dumbledore where he introduced magic to Tom, there is no mention of snow or even closeness to his birthday from the caretaker.  I believe this view came from the fact that Harry got his letter on his birthday but that piece of fanon seems to forget that letters were being sent up to at least a week or 2 beforehand (leading to the Dursleys hiding on a rock in the sea in the first place). List has No Rows for Assignment to SObject: Error How to see if certain representation of $SU(2)$ is symmetric/antisymmetric/mixed? I am looking at the tensor product of $n$ spin halfs (fundamental of $SU(2)$): \begin{equation} \left(\frac{1}{2}\right)^n = \frac{1}{2} \times \frac{1}{2} \times ... \times \frac{1}{2} = \frac{n}{2} + ... \end{equation} For example, for $n = 3$ \begin{equation} \frac{1}{2} \times \frac{1}{2} \times \frac{1}{2} = \frac{1}{2} \times \left(1 + 0\right) = \left(\frac{3}{2}\right)_1 + \left(\frac{1}{2}\right)_1 + \left( \frac{1}{2} \right)_0 \end{equation} where lower indexes on the right hand side specify from which tensor product representation came from. My question is how do I read off if a certain term on the right is a symmetric, antisymmetric or a mixed symmetry representation of $SU(2)$? I came up with two ways of approaching the problem.  First is Young Tableaux. As far as I understand rows of Young Tableaux correspond to symmetric indexes while columns to antisymmetric ones. So, for example, a diagram with just one row (like one that corresponds to the highest spin $\frac{3}{2}$ from the example - three boxes in a row) describes a totally symmetric representation. A diagram that has one column (maximum 2 boxes since we are dealing with $SU(2)$) describes totally antisymmetric representation. Everything that has both rows and columns is a mixed symmetry representation. Following this logic it looks like only the highest representation in the product can be totally symmetric, singlet is antisymmetric and everything in between has mixed symmetry. So, for the example \begin{equation} \left(\frac{3}{2}\right)_1: \text{symmetric rep}\\ \left(\frac{1}{2}\right)_{0,1}: \text{mixed symmetry reps}\\ \end{equation} Is this is a correct logic?  Another way to think about this is the following. Let's build representation the way we do in QM starting from the highest one, when all the spins are up. Then all components of the highest multiplet can be generated by applying lowering operators to the highest state. So, all the relative signs in the expressions are &quot;+&quot; and thus the highest representation is always symmetric as 1. also suggests. Then all the other representations must be constructed by writing down expressions orthogonal to components of the highest multiplet, so they will necessary get some &quot;-&quot; signs and as a result must be either antisymmetric or have mixed symmetry, but can not be totally symmetric.   Is this correct logic? Is it true that only the highest representation in the product can be symmetric and all the others have mixed symmetry or antisymmetric? Jordan Canonical Form determined by characteristic and minimal polynomials in dimension $3$, but not beyond