twitter status updates from command line (via cURL)
How to tweet using terminal?
I'm an android developer and have laptop with 4GB RAM. When I compile my project the RAM is used at 100%.    If I add more RAM will it solve the problem? Does centrifugal force exist? Currently in my last year of high school, and I have always been told that  does not exist by my physics teachers. Today my girlfriend in the year below asked me what centrifugal force was, I told her it didn't exist, and then she told me her textbook said it did, and defined it as "The apparent force experienced towards the outside of a circle is the centrifugal force and is due to the mass of the object resisting the inward centripetal acceleration that the object is experiencing". I was pretty shocked to hear this after a few years of being told that it does not exist.  I did some reading and found out all sorts of things about pseudo forces and reference frames. I was wondering if someone could please explain to me what is going on? Is it wrong to say that centrifugal force does not exist?   This has always nagged me a bit as I often wonder that if every force has a reaction force then a centripetal force must have a reaction centrifugal force, but when I asked my teachers about this they told me that centrifugal force does not exist. Turn a string into a valid filename? I have a string that I want to use as a filename, so I want to remove all characters that wouldn't be allowed in filenames, using Python.  I'd rather be strict than otherwise, so let's say I want to retain only letters, digits, and a small set of other characters like "_-.() ". What's the most elegant solution?  The filename needs to be valid on multiple operating systems (Windows, Linux and Mac OS) - it's an MP3 file in my library with the song title as the filename, and is shared and backed up between 3 machines. Computational complexity of Fibonacci Sequence I understand Big-O notation, but I don't know how to calculate it for many functions. In particular, I've been trying to figure out the computational complexity of the naive version of the Fibonacci sequence:  int Fibonacci(int n) {     if (n &lt;= 1)         return n;     else         return Fibonacci(n - 1) + Fibonacci(n - 2); }   What is the computational complexity of the Fibonacci sequence and how is it calculated? I have read that a holomorphic function in an open disc has a primitive in that disc. Does this mean that for any holomorphic function $f$ in any open set $U,$ that $f$ has a primitive? I say this because I can take a large enough open disc to cover the open set $U$ and find its primitive there. Is this a correct way of thinking? Unchained Flurry of Blows with Natural Weapons and Feral Combat Training using natural attacks as primary Black artifacts when looking through many transparent objects? What is the correct form in the following sentences, "both" and "both of them"?      a) "Both of them are unique."      b) "Both are unique."   If "both" by itself already contains "both of them", so I can conclude that the first option is not correct. Isn't it? The code below compiles, but has different behavior for the char type than for the int types.  In particular     cout &lt;&lt; getIsTrue&lt; isX&lt;int8&gt;::ikIsX  &gt;() &lt;&lt; endl;    cout &lt;&lt; getIsTrue&lt; isX&lt;uint8&gt;::ikIsX  &gt;() &lt;&lt; endl;    cout &lt;&lt; getIsTrue&lt; isX&lt;char&gt;::ikIsX  &gt;() &lt;&lt; endl;   result in 3 instantiations of templates for three types: int8, uint8 and char. What gives?  The same is not true for ints: int and uint32 which result in the same template instantiation, and signed int another.  The reason seems to be that C++ sees char, signed char and unsigned char as three different types. Whereas int is the same as a signed int. Is this right or am I missing something?  #include &lt;iostream&gt;  using namespace std;  typedef   signed char       int8; typedef unsigned char      uint8; typedef   signed short      int16; typedef unsigned short     uint16; typedef   signed int        int32; typedef unsigned int       uint32; typedef   signed long long  int64; typedef unsigned long long uint64;  struct TrueType {}; struct FalseType {};  template &lt;typename T&gt; struct isX {    typedef typename T::ikIsX ikIsX; };   // This  int==int32 is ambiguous //template &lt;&gt;            struct isX&lt;int  &gt;    { typedef FalseType ikIsX; };  // Fails template &lt;&gt;            struct isX&lt;int32  &gt;  { typedef FalseType ikIsX; }; template &lt;&gt;            struct isX&lt;uint32 &gt;  { typedef FalseType ikIsX; };   // Whay isn't this ambiguous? char==int8 template &lt;&gt;            struct isX&lt;char  &gt;  { typedef FalseType ikIsX; }; template &lt;&gt;            struct isX&lt;int8  &gt;  { typedef FalseType ikIsX; }; template &lt;&gt;            struct isX&lt;uint8 &gt;  { typedef FalseType ikIsX; };   template &lt;typename T&gt; bool getIsTrue(); template &lt;&gt;           bool getIsTrue&lt;TrueType&gt;() { return true; } template &lt;&gt;           bool getIsTrue&lt;FalseType&gt;() { return false; }  int main(int, char **t ) {    cout &lt;&lt; sizeof(int8) &lt;&lt; endl;  // 1    cout &lt;&lt; sizeof(uint8) &lt;&lt; endl; // 1    cout &lt;&lt; sizeof(char) &lt;&lt; endl;  // 1     cout &lt;&lt; getIsTrue&lt; isX&lt;int8&gt;::ikIsX  &gt;() &lt;&lt; endl;    cout &lt;&lt; getIsTrue&lt; isX&lt;uint8&gt;::ikIsX  &gt;() &lt;&lt; endl;    cout &lt;&lt; getIsTrue&lt; isX&lt;char&gt;::ikIsX  &gt;() &lt;&lt; endl;     cout &lt;&lt; getIsTrue&lt; isX&lt;int32&gt;::ikIsX  &gt;() &lt;&lt; endl;    cout &lt;&lt; getIsTrue&lt; isX&lt;uint32&gt;::ikIsX  &gt;() &lt;&lt; endl;    cout &lt;&lt; getIsTrue&lt; isX&lt;int&gt;::ikIsX  &gt;() &lt;&lt; endl;  }   I'm using g++ 4.something Non-existence of a Surjective Function from a Set to Its Subsets (Cantor's theorem) Square of a function with an essential singularity Let $a$ be a point on the complex plane such that the function $f$ has an essential singularity. I am trying to prove that the square of that function also has an essential singularity.  I suppose that it does not have an essential singularity. Then $\exists ;k$ such that $(z-z_0)^{2k}f^2(z)$ differentiable. Then if I could take the square root and preserve the differentiability I would have finised. Can I do that? Set the maximum character length of a UITextField How can I set the maximum amount of characters in a UITextField on the iPhone SDK when I load up a UIView? Enumerate behaves differently with beamer 3.42 The following is produced by beamer version 3.41 with enumerate:  \documentclass{beamer} \mode&lt;presentation&gt;     {\usetheme{Rochester}} \begin{document} \begin{frame}   \begin{enumerate}[(a)]     \item Foo     \item Bar   \end{enumerate}   \begin{enumerate}[1]     \item Foo     \item Bar   \end{enumerate} \end{frame} \end{document}     And with beamer version 3.42 the following:    The latter output is so, well, ugly, that it's probably a bug. While waiting for a bug fix (?), how can I temporarily fix this so that I get the output produced by beamer 3.41? When, if ever, should voting override answer acceptance for answer sorting? What is the difference between == and ===?  How exactly does the loosely == comparison work? How exactly does the strict === comparison work?  What would be some useful examples? I am animating a Rubik's cube, and as soon as I get to the second rotation the blocks that have previously been rotated start tripping out even though it should have been reset. I tried making the graph linear which fixed a lagging issue I had, but the blocks still start to spin instead of rotating around a single axis. The limit to solve is $$\lim_{n\to\infty}\left(\frac{n^2+2}{2n^2+1}\right)^{n^2}$$ I tried to use L'Hôpital's rule but the derivatives are quite complex. Find duplicate files Word for the behavior of people who complain at everything you do How to tell if mains voltage is on with microcontroller? I want to be able to tell if the mains voltage is on or off with an Arduino.   How could I do this safely with minimal components (or components from Radio Shack)?