echo list / array to xargs
Printing an array to a file with each element of the array in a new line in bash
Motion Tracking objects that go out of frame and re-enter later I am motion tracking a video in which the camera turns away from one scene and then shortly returns to it. However, the segments that went off-screen lose their track and do not continue tracking once the camera returns. I am wondering if there is a manual way to tell a segment where and when to continue looking for it's tracking target. Is this possible to do? Should I use UUID as well as ID Is the use of a hyphen between "non" and an adjective strictly necessary? Do I need to put a "-" between "non" and an adjective? As an example in physics we say "a non isolated photon", "non tight photon"... The context is very formal (paper publications and similar). Is there a general rule? Are there some differences between countries? Is there really any difference between the jackknife and leave one out cross validation? The procedure seems identical am I missing something? Allow applications downloaded from anywhere in macOS Sierra In previous versions of the OS in the security pane, you are provided an option of:    But in this version there is no option anywhere:    Is there a way that I can turn on anywhere? (via Terminal maybe?) What is the optimal path between $2$ fixed points around an invisible obstructing wall? Every day you walk from point A to point B, which are $3$ miles apart. There is a $50$% chance each walk that there is an invisible wall somewhere strictly between the two points (never at A or B). The wall extends $1$ mile in each direction perpendicular to the line segment (direct path) between A and B, and its position can be at any random location between the two points. That is, it can be any distance between A and B such as $0.1$ miles away from A, $1.5$ miles away, $2.9$ miles away.... You don't know if the wall is present or where it is until you walk into it.  You must walk around the wall if present as there is no other way to circumvent it.  Assume the wall is negligible thickness (like a force field), all ground is perfectly flat, and the y coordinates at both A and B are $0$ (although I don't think the optimal path will change much if they weren't).  What strategy minimizes the average expected walk distance between A and B?  How do we know for certain this strategy yields the shortest average walking distance?  To get the $100$ bounty points, I would like a convincing argument from you as to why you feel your solution is optimal and cannot be beaten.  For those of you using computer simulation, anything reasonably close to optimal is a candidate for the bounty.   Can anyone beat the optimal solutions submitted so far?  There are still a few days to try.  Even a slight beat (if not due to roundoff error or some other error) would help prove previous solutions are non-optimal.  You can just use the table of $31$ points (x-y coordinates) and compute that path length and then if you can find better then I will accept that answer.  I think by Sunday night I may have to award the bounty otherwise it may get auto-awarded. Why does my water pressure fluctuate? How do you prevent an ENTER key press from submitting a form in a web-based application? Can you find all classes in a package using reflection? Is it possible to find all classes or interfaces in a given package? (Quickly looking at e.g. , it would seem like no.) $ d = \gcd(a,b)\Rightarrow\ \gcd(a/d,b/d) = 1$ How do I set up an email server? Is there a general formula for finding the primitive of $$e^{ax}\sin(bx)?$$  I've done this manually with $a=9$ and $b=4$ using Euler's formulas. But it takes a bit of time. Is there a pattern here? How to run a program without typing the full path? System utilities such as ls don't need to have the full path typed before executing them. However, to execute Netbeans, I have to type /home/chris/netbeans-7.0.1/bin/netbeans. How can I make it so that I only have to type netbeans? How to find/grep what is between string1 and string2? I am trying to extract a value from a long string that may change over time. So for example the string could look something like this  ....../filename-1.9.0.3.tar.gz"&lt;....   And what I want to extract is the value between filename- and .tar.gz, essentially the file version (1.9.0.3 in this case). The reason I need to do it this way is because I may later run the command and the value will be 1.9.0.6 or 2.0.0.2 or something entirely different.  How can I do this? I'm currently only using grep, but I wouldn't mind using other utilities such as sed or awk or cut or whatever. To be perfectly clear, I need to extract only the file version part of the string, since it is very long (on both sides) everything else needs to be cut out somehow. I posted a question and a couple of respondents asked for the source code. I could only post portions of the code.  If attachments were allowed I could have uploaded a .zip file with the whole application.  Will this be a feature in SO? How can I prove that $\,ax\equiv b\pmod{\! n}\,$ has a unique solution if $\,\gcd(a,n) = 1$?  I suspect that the Bezout identity for $\,\gcd(a,b) = 1$ is the key but I don't see how to proceed. Activate physics by keyframe I'd like to have a group of debris fall from a ceiling onto the floor, but not have them drop all at the same time. Is there a way to set a keyframe that dictates when the object enters the simulation? For example, object 1 starts falling on frame 0, object 2 on frame 5, object 3 on frame 24, etc. Close Vote Review, additionally filter off-topic close reasons Adapt Ubuntu to a high-DPI resolution screen How can I adapt Ubuntu to a high resolution display?  I have a display with 3200x1600px on only 11'' and everything looks really tiny. divisibility question in abstract algebra over a field $d|n \Rightarrow x^{p^d} - x$ divides $x^{p^n} - x$ over $\mathbb{F}_{p}$ where $\mathbb{F}$ is a field.  Attempt:   $d|n \Rightarrow x^{p^d} - x$ divides $x^{p^n} - x \Rightarrow x^{p^d - 1} - 1$ divides $x^{p^n - 1} - 1 \Rightarrow p^d - 1$ divides $p^n - 1$ since $p^n - 1 = (p^d)^{\frac{n}{d}}-1$.  How does this look?