receive and store SMS to a specific application
Android – Listen For Incoming SMS Messages
My objective here is really simple -- I'm trying to set an NSString to some test data, then return the class, which should be NSString. Here's my code:  NSString* stringer = [NSString stringWithFormat: @"Test"]; NSLog(@"%@", [stringer class]);   The log says that the class is NSCFString, not NSString. What's going on here? runtime error: java.lang.ClassNotFoundException: com.mysql.jdbc.Driver Find orphaned users In SQL Server 2005, is there a way to find users that either don't exist at the server level (an account that was deleted at server level but wasn't disassociated from databases before it was deleted) or accounts that aren't linked (an account may have been deleted at the server level but not db level, then readded but the db level was never cleaned up).  I've got a very messy server and it would be awesome if there was a query to run to find these. I would like to use the same pipe for different applications, like in:  cat my_file | {   cmd1   cmd2   cmd3 }   Cmd1 should consume part of the input. Cmd2 should consume another part and so on.  However, each cmd eats more of the input then it read really needs due buffering.  For example:  yes | nl | {    head -n 10 &gt; /dev/null   cat  } | head -n 10   Outputs from line 912 instead of line 11.  Tee is not a good option, because each command is supposed to consume part of the stdin.   Is there a simple way to get this working? Atiyah-Macdonald, Exercise 8.3: Artinian iff finite k-algebra. Atiyah Macdonald, Exercise 8.3. Let $k$ be a field and $A$ a finitely generated $k$-algebra. Prove that the following are equivalent:   (1) $A$ is Artinian.   (2) $A$ is a finite $k$-algebra.   I have a question in the proof of (1$\Rightarrow$2): By using the structure theorem, we may assume that $(A,m)$ is an Artin local ring. Then $A/m$ is a finite algebraic extension of $k$ by . Since $A$ is Artinian, $m$ is the nilradical of $A$ and thus $m^n=0$ for some $n$. Thus we have a chain $A \supseteq m \supseteq m^2 \supseteq \cdots \supseteq m^n=0$. Since $A$ is Noetherian, $m$ is finitely generated and hence each $m^i/m^{i+1}$ is a finite dimensional $A/m$-vector space, hence a finite dimensional $k$-vector space.  But now how can I deduce that $A$ is a finite dimensional $k$-vector space? "debconf: DbDriver "config": config.dat is locked by another process: Resource temporarily unavailable" while installing packages I'm trying to install the flashybrid but when I enter the apt-get install flashybrid command, I get this error:  root@user-desktop:/home/user# apt-get install flashybrid Reading package lists... Done Building dependency tree Reading state information... Done flashybrid is already the newest version. 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded. 1 not fully installed or removed. After this operation, 0B of additional disk space will be used. debconf: DbDriver "config": /var/cache/debconf/config.dat is locked by another process: Resource temporarily unavailable Setting up flashybrid (0.15+nmu2) ... debconf: DbDriver "config": /var/cache/debconf/config.dat is locked by another process: Resource temporarily unavailable dpkg: error processing flashybrid (--configure): subprocess post-installation script returned error exit status 1 Errors were encountered while processing: flashybrid E: Sub-process /usr/bin/dpkg returned an error code (1)   I also tried this one to find what is already using that file:  root@user-desktop:/home/user# lsof | grep /var/cache/debconf/config.dat lsof: WARNING: can't stat() fuse.gvfs-fuse-daemon file system /home/user/.gvfs Output information may be incomplete. dpkg-prec 4672 root 4rW REG 8,6 39658 1697827 /var/cache/debconf/config.dat   But I don't know how to fix this. Intuitive explanation for dividing by $n-1$ when calculating standard deviation? I need to find a reg ex that only allows alphanumeric. So far, everyone I try only works if the string is alphanumeric, meaning contains both a letter and a number. I just want one what would allow either and not require both. We all use mathematical induction to prove results, but is there a proof of mathematical induction itself? I just realized something interesting. At schools and universities you get taught mathematical induction. Usually you jump right into using it to prove something like   $$1+2+3+\cdots+n = \frac{n(n+1)}{2}$$  However.  I just realized that at no point is mathematical induction proved itself? What's the mathematical induction's proof? Is mathematical induction proved using mathematical induction itself? (That would be mind blowing.) What is the term for the double consecutive use of a word with stress on one of the words to alter its severity? What is the term when a word is used consecutively twice, with intentional stress placed on the first word, as a means to alter the severity of the word's meaning?  I am not referring to a  (had had) or a  (that that), but to the slightly sarcastic use as demonstrated in shows like Seinfeld. Sample sentences, with emphasis:  I know we're going out to eat, but I am only going to pick at an appetizer because I'm not hungry hungry. Don't wear something so formal to the party; I don't think you need to be dressed dressed.  Of personal note, some of my relatives decided a few years ago to nick-name the term a &quot;Celaine&quot; (a combination of their names) due to their own frequent use of it. Note: This question explicitly requests the term of art used by linguists and English scholars when discussing this phenomenon. This question is different from a  which requests a historical explanation for the phenomenon described by this term. None of the answers to the suggested duplicate provide the term.  The author of the similar question requests the term for the pattern in a comment, but does not receive an acceptable answer. The only mention of an acceptable term is in a comment made by the author of this question, in response to the author of the similar question, directing back to this very question. Is it possible to transfer Minecraft PE worlds to Minecraft PC? I have a really cool Minecraft PE world, and I would like to also have it on my Computer. Is there a way to move a Minecraft PE world onto the PC Edition?  My tablet is Android and my Computer is Windows 7. Thanks! If $a$ divides $bc$ and $\gcd(a,b) = d$ then $\frac a d$ divides c I'm trying to prove that if $a$ divides $bc$ and $\gcd(a,b) = d$ then $\frac a d$ divides c. I tried using Bezout identity but couldn't get anywhere. We are familiar with the nifty fact that given the Fibonacci series $F_n = 0, 1, 1, 2, 3, 5, 8,\dots$ then $0.0112358\dots\approx 1/89$. In fact,  $$\sum_{n=0}^{\infty}\frac{F_n}{10^n} = \frac{10}{89}$$  How do we prove that, more generally, for $p &gt; 1$ then,  $$\sum_{n=0}^{\infty}\frac{F_n}{p^n} = \frac{p}{p^2-p-1}$$  (The above simply was the case $p = 10$.) Recently I installed Ubuntu 12.10 x64 Server Edition on my PC. Unfortunately, I attempted to install a lightweight desktop but due to the fact that I have an old graphics card, the PC does not perform so well. I am thinking of re-installing an Ubuntu version but I do not want to lose the contents in my home folder. Is there any way to do that with a Live CD? How do I create silhouettes in a studio environment? The trick to creating silhouettes in the field, as far as I know, is to use spot-metering and to expose for the background. However, this is a bit more difficult in a studio environment. What is the key to creating "artificial" silhouettes?  One solution that I'm considering is placing a bright flash directly behind the subject - would that work? Splitting file based on size, but make sure that it ends with newline Does anyone know the (specific) reasons that it is recommended that old LTS server users wait until the point release to upgrade?  Is it just a matter of bug fixes and waiting for improved stability for production servers, or is there something more fundamental than that? What is the name for moments, a parameter that is calculated Let $z_1, z_2, z_3,$ ...be a sequence of independent random variables s.t. $P(z_i=1)=P(z_i=-1)=\frac 1 2$. Does this sequence converge almost surely?  My intuition is telling me that the sequence will approach the random variable Z? i.e. $z_n-&gt;Z$ as $n-&gt;\infty$ and Z is just another RV s.t. $P(Z=1)=P(Z=-1)=\frac 1 2$.  Here is my confusion, if a sequence converges almost surely, then $z_i$ should be different for each term s.t. it approaches Z in the end; but in this sequence $z-i$ is the same for every term. So I dont udnersntand. Attacks of the MAC construction $\mathcal{H}(m\mathbin\|k)$ for common hashes $\mathcal{H}$?