Limiting feature to 1 web application
How to deploy wsp to single web application
I am running an HP pavilion dv6000 dual boot win7 and Ubuntu 12.04. (well, up until today).  After a reboot, the boot process drops to the BusyBox shell and I end up at the prompt:  BusyBox v1.18.5 (Ubuntu 1:1.18.5-1ubuntu4) built-in shell (ash) Enter 'help' for a list of built-in commands.  (initramfs)   I've been researching others who have had this same problem, but haven't been able to find any of those solutions to work for me.  I tried the method described , and after the final command   mount -t ntfs-3g /dev/sda1 /root -o force   it does nothing and gives me another (initramfs) prompt.  I can boot to a live CD (USB) and get to a terminal, but it doesn't seem to do much good, as I can see the /dev/sda1 in the ls command, but it doesn't recognize it when I try to cd to it.  One more question: using the command fdisk -l how can I tell which mount point (sda1/sda2) is my windows partition and which one is Ubuntu? How can I model flips until N successes? You and I decide to play a game where we take turns flipping a coin. The first player to flip 10 heads in total wins the game. Naturally, there is an argument about who should go first.  Simulations of this game show that the player to flips first wins 6% more than the player who flips second (the first player wins approx 53% of the time).  I'm interested in modelling this analytically.  This isn't a binomial random variable, as there are no fixed number of trials (flip until someone gets 10 heads). How can I model this?  Is it the negative binomial distribution?    So as to be able to recreate my results, here is my python code:  import numpy as np from numba import jit   @jit def sim(N):      P1_wins = 0     P2_wins = 0      for i in range(N):          P1_heads = 0         P2_heads = 0         while True:              P1_heads += np.random.randint(0,2)              if P1_heads == 10:                 P1_wins+=1                 break              P2_heads+= np.random.randint(0,2)             if P2_heads==10:                 P2_wins+=1                 break     return P1_wins/N, P2_wins/N   a,b = sim(1000000) An awful lot of people seem to use the phrase "substitute X for Y" to mean "replace X with Y", while I've always used and understood it as "replace Y with X". This makes sense to me, given that a substitute is the replacement, not the thing which has been replaced.  I thought I might be able to figure things out from a dictionary, but now after seeing two sorts of definitions, I'm even more confused:   to put or use in the place of another to take the place of; replace   The first one suggests that the object will be the substitute (replacement), the thing put into place, while the second suggests that the object will be the thing which has been replaced.  Is one of these usages more correct in any sense? (I know this is probably a pointless question, since people will continue to speak the way they speak.) Is there perhaps a difference between American and British English?   And most importantly, is there any reliable way to tell what someone means when they ask how to substitute honey for sugar, or is the verb simply guaranteed to cause confusion? A generic list of anonymous class What is a smart pointer and when should I use one? Proof of a basic $AC_\omega$ equivalence On  it is mentioned that "...  in order to prove that every accumulation point $x$ of a set $S\subseteq \mathbf R$ is the limit of some sequence of elements of $S\setminus \{x\}$, one uses (a weak form of) the axiom of countable choice. When formulated for accumulation points of arbitrary metric spaces, the statement becomes equivalent to $AC_\omega$. ..."  I have Herrlich's paper "Choice principles in elementary topology and analysis" where in theorem 2.4. it is stated that these are indeed equivalent. Then I looked up the reference he quotes, [4], which are Bentley H.L., Herrlich H., Countable choice and pseudometric spaces which does not contain the proof and  does also not contain the proof, hence my question:   Where can I see a proof of      "if $S$ is a set in a metric space $X$ with accumulation point $s$   then there exists a sequence $s_n$ in $S$ converging to $s$"   $\implies$ $AC_\omega$   ? (the other implication is clear to me). Thanks. Linux - Help, I'm running out of inodes! Is there a way to crack the password on an Excel VBA Project? I found this math "problem" on the internet, and I'm wondering if it has an answer:     Question: If you choose an answer to this question at random, what is the probability that you will be correct?      a. $25\%$      b. $50\%$      c. $0\%$      d. $25\%$   Does this question have a correct answer? (used to show two posts from MSE)   (there used to be a list of the accounts)   (it was there) seems to be fixed Petersen graph is not a Cayley graph How can I show that the Petersen graph is not a Cayley graph?  I don't know very much about Cayley graphs, I know that they are vertex-transitive, but so is the Petersen graph. It probably has to do with the group structure of $\Gamma$ in $Cay(\Gamma,S)$ (which is a group of order $10$, i.e., it is either the cyclic group $C_{10}$ or the dihedral group $D_{10}$). Then I am guessing we go for some sort of contradiction(?). My group theory is a bit rusty, I would very much appreciate someone showing me how to do this one! The title says it all. I'd like to know how I can install software - an example is the Chromium web browser. Captured variable in a loop in C# The product of a normal and Rademacher variables, independent from each other Let $X\sim N(0,1)$ and let $Z$ be a random variable independent of $X$ such that:  \begin{equation} \Pr(Z=z) = \begin{cases} \frac{1}{2} &amp; \mbox{if $z = -1$ or $z=1$}, \\ \\ 0 &amp; \mbox{otherwise}. \end{cases} \end{equation}   Define $Y = ZX$. Show that $Y \sim N(0,1)$. Determine $\operatorname{Cor}(X,Y)$. Are $X$ and $Y$ independent?   Progress:  I'm basically stuck at the beginning. I got as far as $P(ZX &lt; y) = P(Z &lt; y/X)$, which I'm not even sure is correct. I'm also not clear on what it means by defining $Y = ZX$ - does it mean I need to state the probability density function or something? And how do I show that $Y \sim N(0,1)$? what is the difference between - I make it to go and I make it go? What is the difference between sentences like these:     I make it to go.   I make it go.   or     You make me to cry.   You make me cry. CPT Template Not Showing - Getting 404 I'm developing a Custom Post Type plugin, which works fine in dev. Now that I've moved it to production, I'm getting a 404 when I try to display the template for the CPT.   So, two questions:  1- Is there some mechanism to determine the path WP took to get through the hierarchy?  2- Why wouldn't it just give me the single or index page?  I've dumped $wp_query and a stacktrace at the end of the 404. Here's part of what I found:  [query] =&gt; Array     (         [page] =&gt;          [pagename] =&gt; refletters/proximity     )  [request] =&gt; SELECT   wp_posts.* FROM wp_posts  WHERE 1=1  AND (wp_posts.ID = '0') AND wp_posts.post_type = 'page'  ORDER BY wp_posts.post_date DESC  [posts] =&gt; Array     (     )  [queried_object] =&gt;  [queried_object_id] =&gt; 0   And the stack trace:  2013-04-27 22:16:41 - 24.52.197.40 - TRACE - index.php - 404.php[39] -      wordpress/wp-content/themes/notoriousconsultant/404.php[39] - aaLog-&gt;logtrace     wordpress/wp-includes/template-loader.php[50] - include     wordpress/wp-blog-header.php[16] - require_once     wordpress/index.php[17] - require   Thanks for your help. How to read contacts on Android 2.0 What is an observer in quantum mechanics? How do I compile a C# script at runtime and attach it as a component to a game object The idea here is to let users program the behaviour of an agent in a way that reminds of the "Screeps" game, where you get to develop code which later runs and dictates the behaviour of your units.  My idea is to let users develop the behaviour or their units with C# code, compile that code at runtime and attach it as a MonoBehavior to an existing game object.  How can I achieve this? Why should the minimal class be avoided?