Is it possible for me to make a Q&amp;A site like Stack Overflow for a different topic? How much money will it cost?  I have my own VPS; can I host the site there?
Is the Stack Exchange engine that powers Stack Overflow available to download or install internally for an enterprise or company?  I think Stack Exchange's engine is very great and could be very cool to use for internal enterprise patterns and practices, like the engine of Wikipedia.
I believe there's a way to find the kth largest element in an unsorted array of length n in O(n).  Or perhaps it's "expected" O(n) or something.  How can we do this? Why I think tension should be twice the force in a tug of war I'm going to provide my argument for why I think the tension in a rope should be twice the force exerted on either side of it.  First, let's consider a different example. Say, there is a person named A and a block in space. A pushes on the block with a force of 100 N. Then, the block will also push A with a force of 100 N by Newton's third law. Now, consider the case where instead of the block, there is a person B who is also pushing on A with a force of 100 N while A is pushing on him. A will experience a force of 100 N because he pushed on B, AND another 100 N because he is being pushed by B. Hence he will experience a force of 200 N. Similarly, B also experiences 200 N of force.  Now, back to the original problem. There are two people A and B in space with a taut rope (no tension currently) in between them. If only A is pulling and B is not, then I agree that the tension is equal to the force A exerts. This situation (in my opinion) becomes analogous to the above if B is also pulling. So, say both of them pull from either side with a force of 100 N. Then the rope at the end of B will pull B with a force of 100 N (this pull is caused by A). By Newton's third law, the rope will experience a pull of 100 N. But B is also pulling his end of the rope with 100 N. Therefore, the tension should be 200 N. Similarly, the end of the rope at A must pull A with 100 N of force (because B is pulling from the other side) and hence experience a force of 100 N itself by Newton's third law plus another 100 N because A is pulling on the rope.  Apparently, the answer is not this (according to my searching on the web). So, could anyone tell me why this reasoning is wrong? Thanks.  EDIT : So apparently people don't agree with my first example, leave alone the second. This is to the downvoters and the upvoters of the highest-rated answer: You all agree that if only A pushes B with a force of 100 N, then A and B both will get pushed by a force of 100 N in opposite directions, right? Then, in the case where B is also pushing with a force of 100 N, it doesn't make sense that the answer would be exactly the same. It doesn't seem right that no matter what B does, B and A will always experience the same force as they would have if B hadn't applied any force.  EDIT 2 : I'm going to provide here a link to a question that I posted:  According to the answer and the comments there, the reason as to why my first example is incorrect is different to the one provided here. So maybe you should all read the answer and the comments provided by the person and reconsider what you think. How can I create an executable JAR with dependencies using Maven? Avoiding labeling features if overlapped by another layer in QGIS? With QGIS 2.12.2, how can I set up layer labeling to avoid placing labels where features from another layer already exist?  For example, if I have a stream/river polyline layer that contains lake "centerlines", and I place a "lake" polygon layer above it in the drawing order, I don't want the river layer to place a label inside the lake.  Instead, I would rather have the river labeled outside of the lake (as needed).  That way, I can place labels from the lakes layer and I don't run into label collisions.  Here is an example, where (I have intentionally put the lines on top for visual purposes) what I am hoping to achieve is no river center-line labels shown inside the lake polygon: Export nodes from Drupal 4? Fiction novel or movie about sentient dinosaurs Books for self-studying time series analysis? Executing Java programs through Python How do I do this? I've heard that Lubuntu consumes less resources than Ubuntu. Is it because of the fact that Lubuntu uses different desktop environment and window manager?  If so, would it be equivalent to install lubuntu-desktop on top of Ubuntu rather than doing a fresh install? what is the surface area of a cap on a hypersphere? According to , let the sphere have radius $R$, then the surface area a spherical cap of height $h$ and base radius $a$ is given by $$S=2\pi Rh=2\pi(a^2+h^2).$$  What is this value for an n-dimensional hypersphere? If it helps simplify the problem we can assume $R=1$ and $a=0.5$.   Many thanks. The question asks it all really. When referring to a master's degree, do you use an apostrophe or not? That is, is it "a master's" or "a masters"? How can I use robots.txt to disallow subdomain only? My code base is shared between several environments (live, staging, dev) &amp; sub-domains (staging.example, dev.example, etc.) and only two should be allowed to be crawled (ie. www.example and example). Normally I'd modify /robots.txt and add Disallow: /, but due to shared code base I cannot modify /robots.txt without affecting all (sub)domains.  Any ideas how to go about it? Align images with text without using tables Here is the top output which I gathered:    I noticed that top is showing vlc's cpu usage is > 100%.  Can anybody please justify me why it is showing like this, whether this is a bug in top application or something else. I have a homework question that asks     Find necessary and sufficient conditions on $1 \leq i &lt; j \leq n$ so that $(i \, j)$ and $(1 \, 2 \, \dotsc \, n)$ generate $S_n$.   Here is what I have done so far.  Call $c = (1 \, 2 \, \dotsc \, n)$.  I made the observation that $$ \overbrace{c c \dotsb c}^{n - j + 1} (i \, j) \overbrace{c^{-1} c^{-1} \dotsb c^{-1}}^{n - j + 1} = (1 + i - j + n \, 1). $$ Thus, $\langle (i \, j), c \rangle = \langle (1 \, i - j + n + 1), c \rangle$, so it suffices to look at $\langle (1 \, k), c \rangle$ for positive integers $2 \leq k \leq n$.  I've checked that, for the value $k=2$, $\langle (1 \, 2), c \rangle = S_n$.  This immediately implies $\langle (1 \, n), c \rangle = S_n$.  I suspect that no other values of $k$ will work, but am not sure how to prove it. my email limit is exceeded after sending 10-12 emails..what could be the problem..as i have seen the limit is 1000 emails/day.i am not able to find out what could be the problem..Can some give me some suggestions. As i also know we can send 10 emails in a single transaction.I am sending emails in a batch class.  I am calling this batch class on button click and filling emailList with emailsId's.                      String query='Select id from Lead';//No use of this query                     Batch_send_emails bse=new Batch_send_emails();                     bse.query=query;                                                         bse.resendEmails=emailList;                     database.executebatch(bse);           **Batch Class**           if(!resendEmails.isEmpty())           {               for(String s:resendEmails)                {                   emailsLeads.add(s);                }           }           Messaging.SingleEmailMessage mail = new Messaging.SingleEmailMessage();         mail.setToAddresses(emailsLeads);        // mail.setCcAddresses(ccAddresses);         String subject='GoToMeeting Invitation Details for '+subject;         String body='test';          mail.setHtmlBody(body);          mail.setSubject(subject);         Messaging.sendEmail(new Messaging.SingleEmailMessage[] { mail });          } What do you call snow that has collected between a car body and the tire? I am trying to identify the general case algorithm for counting the different ways dice can add to a given number.  For instance, there are  with two 6-dice.  I've spent quite a bit of time working on this (for a while my friend and I were using Figurate numbers, as the early items in the series match up) but at this point I'm tired and stumped, and would love some assistance.  So far we've got something to this effect (apologies for the feeble attempt at mathematical notation - I usually reside on StackOverflow):  count(x):    x = min(x,n*m-x+n)    if x = n       1    else       some sort of (recursive?) operation   The first line simplifies the problem to just the lower numbers - where the count is increasing.  Then, if we're looking for the count of the minimum possible (which is also now the max because of the previous line) there is only one way to do that so it is 1, no matter the n or m. Can you use a readied action to teleport out of the way of a weapon attack? Let's say that a player uses the ready action and says "If a character aims at me with a weapon, I'll use Teleport to move behind cover."  What happens? Does this work? If not, please cite the rules to explain why not. Add chat rooms for Android app Being able to join chat rooms from the Android app would be a plus! It would truly make us connected on the go, instead of having to sit down at our desks and open a browser window. This will allow more users to fully utilize the chat system and join events no matter where they are.