i'm currently working on a small script where i need to udate a file on multple servers, i have a long ip list of my servers and currently im using ncftpput to add the files to the servers one at a time.  i can't figure out how to start ncftpput with the next ipadress in my list so that i can have multiple updates running at the same time.  my list is just ip adresses: 192.168.0.1 192.168.0.2 192.168.0.3 ...... until 192.168.0.150   what i need is the first ncftpput to access the first ip the second number two ip and so on for the amount of threads i need / system can handle  lets say 10 at a time and when the first thread finishes it just takes the next ip NOT taken by any of the other threads.  i hope i made myself clear on my problem and that someone can help me figure this out.  so far i'm doing it this way: (runnig one at a time)  while read ip; do  ncftpput -c -A -u "$USER" -p "$PASSWD" "$ip" "/usr/local/program/program.conf" &lt; "~/addthisinfo" 2&gt;/dev/null      if [ $? -eq 0 ]              then                      echo -e "Here goes my succes test" &gt;&gt;/tmp/text_added              else              echo ""      fi  done &lt;"$pathtoiplist""/iplist"   in advance thanks.  -------edit-------------  i have full access to the server so i'm not restricted in and way conserning software to use.  Michael
Lets say I have a loop in Bash:  for foo in `some-command` do    do-something $foo done   do-something is cpu bound and I have a nice shiny 4 core processor. I'd like to be able to run up to 4 do-something's at once.  The naive approach seems to be:  for foo in `some-command` do    do-something $foo &amp; done   This will run all do-somethings at once, but there are a couple downsides, mainly that do-something may also have some significant I/O which performing all at once might slow down a bit. The other problem is that this code block returns immediately, so no way to do other work when all the do-somethings are finished.  How would you write this loop so there are always X do-somethings running at once?
What happens when anti-matter falls into a black hole? Let's say a black hole of mass $M$ and a very compact lump of anti-matter () also of mass $M$ are traveling toward each other. What does an outside observer see when they meet?  Will they blow themselves apart in a  matter/anti-matter reaction? Or will their masses combine, never quite meeting in the infinite time dilation at the event horizon? Why disable Fast Boot on Windows 8 when having dual booting? Finding the limit of $\frac {n}{\sqrt[n]{n!}}$ On this  there are more than 50 links to Stack Overflow questions. However, the last 6 links aren't converted to titles (http://facebook.stackoverflow.com/questions/6530420/control-the-image-that-facebook-shows-when-i-like-a-url should be converted to ).   However:  all http://facebook.stackoverflow.com/... into http://stackoverflow.com/... fixes this, both in the preview and the final result. Also, the preview won't show any title for http://facebook.stackoverflow.com/... links.  My question is, what limitations does this converting have? How are these question titles retreived? Via API? Through database?  I'm not sure about title, feel free to edit that Suppose that $S_0$ and A are positive numbers, let $$S_{n+1} = \frac{1}{2}\left(S_n +\frac{A}{S_n}\right)$$ with $n \geq 0 $.      (a)Show that $S_{n+1} \geq \sqrt{A} $ if $n \geq 0$       (b)Show that $S_{n+1} \leq S_n $ , if $n \geq 1$      (c) Show that $s= \lim\limits_{n \rightarrow \infty} S_n$ exists      (d) find s   (a) Show that $S_{n+1} \geq \sqrt{A} $ if $n \geq 0$  Given $$P_n:  S_{n+1} = \frac{1}{2}\left(S_n +\frac{A}{S_n}\right) \geq \sqrt{A}$$  $$P_0: S_{1} = \frac{1}{2}\left(S_0 +\frac{A}{S_0}\right) \geq \sqrt{A}  $$  We assume that $P_n$ is true  $$P_{n+1}: S_{n+2}= \frac{1}{2}\left(S_{n+1} +\frac{A}{S_{n+1}}\right)$$ by assumption $$S_{n+2}= \frac{1}{2}\left(S_{n+1}\left(1 +\frac{A}{(S_{n+1})^2}\right)\right) \geq \frac{1}{2}\left(\sqrt{A}\left(1 +\frac{A}{(\sqrt{A})^2}\right)\right)$$ $$ S_{n+2}= \frac{1}{2}\left(S_{n+1} +\frac{A}{S_{n+1}}\right) \geq \sqrt{A}  $$  It follows that $S_{n+1} \geq \sqrt{A} $    (b) Show that $S_{n+1} \leq S_n $ , if $n \geq 1$  $$S_{n+1} \leq S_n$$ $$\frac{1}{2}\left(S_n +\frac{A}{S_n}\right) \leq S_n $$ Dividing by $S_n$ $$\frac{1}{2}\left(1 +\frac{A}{S_n^2}\right) \leq 1 $$ $$\frac{A}{2S_n^2} \leq \frac{1}{2}$$ $$A \leq S_n^2$$ $$S_n \geq \sqrt{A}$$ As  $S_{n+1} \leq S_n$ yields a true statement, it follows $S_{n+1} \leq S_n$ is true.    (c) Show that $s= \lim\limits_{n \rightarrow \infty} S_n$ exists  Since $S_{n+1} \leq S_n$, the sequence is non-increasing,   using the non-increasing theorem stating that      if $\{S_n\}$ is non-increasing then $$\lim\limits_{n \rightarrow &gt; \infty} S_n = \inf\{S_n\} $$     (d) find s    Is the argumentation in (a) and (b) appropriate? Also, I have to admit I m getting less confident in my argumentation (c) and (d). How to proceed in (c) and (d)?  Much appreciated for your input or help. Install a single specific package from future distribution I'm currently using precise. I need to upgrade a certain package (namely  and it's dependencies) to a newer version, which is currently found in raring (alfa at the time of writing this). How to do it ?  What will happen if I just add to my sources.list:  deb http://archive.ubuntu.com/ubuntu raring main   Will the next apt-get update / apt-get upgrade, upgrade most of my system to raring then ? Why an abstract class implementing an interface can miss the declaration/implementation of one of the interface's methods? Guid vs INT - Which is better as a primary key? I've being reading around reasons to use or not Guid and int.  int is smaller, faster, easy to remember, keeps a chronological sequence. And as for Guid, the only advantage I found is that it is unique. In which case a Guid would be better than and int and why?  From what I've seen, int has no flaws except by the number limit, which in many cases are irrelevant.  Why exactly was Guid created? I actually think it has a purpose other than serving as primary key of a simple table. (Any example of a real application using Guid for something?)  ( Guid = UniqueIdentifier ) type on SQL Server Export beamer slides to powerpoint/openoffice-impress/keynote editable format I usually prepare my talks using powerpoint/openoffice-impress/keynote, where I explaing programs, pseudocodes, etc. Recently I was thinking about creating text-only, code-only and pseudocode-only slides with beamer and then exporting them somehow to powerpoint where I modify them to add figures or some minor details for polishing the presentation, which are usually hard to do with beamer. I googled a bit around and found that beamer can export to PDF or PS but not to powerpoint. I wonder anyway if you know some possibility of conversion from beamer to on-screen editable powerpoint/openoffice-impress/keynote. Proof : $2^{n-1}\mid n!$ if and only if $n$ is a power of $2$. I want to prove that:  $2^{n-1}\mid n!$ if and only if $n$ is a power of $2$. "You can only post once every 40 minutes" on different sites This morning I posted a question on a SE site. Then realized a different SE site would be more appropriate.   I proceeded to delete the question on the first site and copied it to the second, but I got the dreaded "You can only post once every 40 minutes.", even if the question was deleted from a different SE site.   I have only the affiliation reputation on both of those sites. Now I'm sitting here waiting for the 40 minutes to pass.  Paradoxically, as a trusted user in SO, I'm more likely to come to other SE sites to ask a few things about topics that are new to me (as opossed to answering in SO), yet I feel more limited.   Maybe trusted users from other sites should have slightly lower restrictions than &lt;125 on the fellow communities? In particular in order to ask a couple of questions. Any class of a nonempty $X$ generates a base for a topology on $X$. Theorem Any class $\mathcal{A}$ of subsets of a nonempty set $X$ is the subbase for a unique topology $\tau$ on $X$. That is to say, the finite intersections of members of $\mathcal{A}$ form a base for the topology $\tau$ on $X$. Example Consider $X=\{a,b,c,d\}$ Let $\mathcal{A}=\{\{a,b\},\{b,c\},\{d\}\}$ The finite intersection of members of $\mathcal{A}$ give us: $$\mathcal{B}=\{\{a,b\},\{b,c\},\{d\},\{b\},\varnothing,X\}$$  How is it true that $X \in \mathcal{B}$ ? By definition of subbase, the finite intersection of members of $\mathcal{A}$ are the members of some base $\mathcal{B}$. But for $a_i \in \mathcal{A}, \displaystyle\bigcap a_i \neq X$ for any finite intersection of $a_i$'s. Look: $\{a,b\}\cap\{b,c\}\cap \{d\} \neq \{a,b,c,d\}$ nor do any other intersection of elements of $\mathcal{B}$ result in $X$. Anybody know what's going on here? Why is $X \in \mathcal{B}$? If $a,b$ are positive integers such that $\gcd(a,b)=1$, then show that $\gcd(a+b, a-b)=1$ or $2$. and $\gcd(a^2+b^2, a^2-b^2)=1$ or $2 $ If  $a,b$ are positive integers such that $\gcd(a,b)=1$, then show that $\gcd(a+b, a-b)=1$ or $2$ and $\gcd(a^2+b^2, a^2-b^2)=1$ or $2 $. Progress We have   $\gcd(a,b)=1\implies \exists u,v\in \mathbb Z$ such that $au+bv=1\implies a^2u'+bv'=1, u',v'\in \mathbb Z$. Let $\gcd(a+b, a-b)=d$. Then $\mid (a+b)x+(a-b)y, \forall x,y\in \mathbb Z$. How to show $\gcd(a+b, a-b)=1$ or $2$ and $\gcd(a^2+b^2, a^2-b^2)=1$ or $2 $. Prove $\mathbb{Z}_2 \times \mathbb{Z}_2$ is not isomorphic to $\mathbb{Z}_4$ Why Integer.getInteger does not work? Biasing circuit - Voltage follower circuit I am using , which is and Bias controller/sequencer. I am using this for Providing gate voltage and drain voltage to the . In the datasheet, it is mentioned that the module with combination of EVM can be used in two applications. Application Option 1: Fixed negative gate biasing with pulsed drain biasing. Application Option 2: Pulsed negative gate biasing with pulsed drain biasing. I am trying to design both applications on a single board. The second option for future use. For the 1st application option, he has mentioned a few pins as No connection and he has used those NC pins on the 2nd application.  The issue I am facing:- They have used voltage followers for providing a low impedance output path for pin number 3(GCO). I have reverse-engineered the Ckt from the below-attached image, but I am unable to identify the voltage follower they have used. Pin number 2 of the voltage follower has been connected to pin number 2 (NC/GCP) of the Module. There has been no description of this pin number. I am guessing these:-  Pin numbers 1 and 4 are connected together and output is provided through them. Pin number 5 is +Ve supply hence connected to GND(Highest +Ve supply)? Pin number 3 is connected to -8V Pin number 2 is connected to pin number 2 of MABC-001000-DP000L, which I am unable to understand.  I have mailed component manufacturer regarding full schematic, till now I haven't heard from them. Can anybody help me with this? Thanks in Advance. Low-resolution pic of EVM. I don't think it helps in any way.   Layout Image At the end of every day you will be required to write a review.   At the end of each day you will be required to write a review.   Which one of those sentences is better if this action will repeat itself every day for longer period of time, several weeks for example, maybe even months? Is it acceptable to begin a declarative sentence with "Am"? I want to know firstly if it's grammatically correct to start a declarative sentence with "Am". For example:     Am excited about the game today.   Secondly, if it is grammatically incorrect, then I wanted to ask how much "head room" there is for the above usage. I can't think of an example now, nor find one here at english.stackexchange. However I imagine there are usages of the english language that grammatically are illegal, yet have somehow become accepted as colloquial or idiomatic perhaps. Scenario 1: A grimlock hits Alice with a Spiked Bone Club, dealing 5 bludgeoning damage, plus 2 piercing damage. Alice's HP was 12.   Using the optional Massive Damage rules on page 273 of the DMG, does this count as more than half the HP from a single source, or less than half, but twice?  Scenario 2: Assume the same grimlock hits Bob with the same attack, this time rolling 6 bludgeoning damage, plus 3 piercing damage. Bob's Max HP is 8, and he had 1 HP remaining before he was hit.  Using the Instant Death rules on page 197 of the PHB, does the character die, or are the two damage types tracked separately? Does the character have to make a death saving throw for the second part of the damage? Why does WCF return myObject[] instead of List like I was expecting?