Is there tool or application that can set the brightness of the screen below the system minimum?
I have an Optimus Elite, and it has a minimum brightness setting. In certain apps, I can reduce the brightness below the safe minimum, but when I leave the app, the brightness is increased to the system-wide minimum.  Using , I can permanently set the brightness below the safe amount, and it will stay even after going to other apps. Or using , I can accomplish almost the same thing even without needing root (it displays a translucent 'filter' over the whole screen, reducing brightness/contrast but not actually changing the backlighting power amount).  What I want to know is where the minimum screen brightness is stored. I have a rooted phone with CyanogenMod 9, so I have permissions to edit anything and could change a config or sqlite entry, but I don't know where this value is stored. What I would like to do is use the status bar brightness slider to be able to slide to the actual minimum of the screen, rather than the OS-controlled minimum. Having an app is useful, but having the functionality without the app seems to be within reach, if only I knew where the OS is getting it's safe minimum setting.  Where is this "safe minimum brightness" setting stored? If I can change it, I can remove my apps and use native controls.
How to reduce memory usage on a Unix webserver I'm currently using a Joyent Accelerator to host my webapps, and it's working fine, however I need to reduce costs so I'm downgrading my current plan and that imposes some new memory limits (256M rss, 512M swap). I wasn't too far over them yesterday, but after restarting Apache several times today, I'm now 411M rss, 721M swap (prstat -Z -s cpu).  Searching in Server Fault only gives me lots of ways and specific tools to monitor the server, but no advice on how to reduce/optimize it's memory usage. I've also seen , but I don't think it's good for this particular (or may I say generic?) situation.  The server is running Solaris on a shared CPU, and I'm using a Apache + MySQL + PHP stack.  I'm interested in knowing the steps one can take to troubleshot this and solve the issues. However, I'm also running out of time to lower my memory foot print and downgrade the plan before the current ends, so anything that can make magic and save the day is welcome as well :) Test -n gives unexpected result I understand test -n &lt;expression&gt; to return false if the expression evaluates to a string length of greater than 0.  Why then does the following happen?  Macbook:~ echo ${#undeclared_variable} 0 Macbook:~ test -n $undeclared_variable &amp;&amp; echo Foo Foo   Bash 4.x  My expectation is that since test -n $undeclared_variable should evaluate false, that Foo should not be echoed.  If I use [[  ]] instead of test, it works as expected. Looking for succinct way of describing the act of solidifying an idea into reality Looking for a succinct way of describing the act of solidifying an idea into reality. "Building [idea] out" seems too generic but I'm trying to avoid a long winded, step by step explanation of the process.  Any ideas would be greatly appreciated. Thanks! I read news on the BBC (on its website) this morning. When I was reading the news I noticed the definite article the was missing in a sentence. As per my opinion, the reporter missed the article the. But I also thought that the reporter also had some point as he did not use the article there. So I just wanted to confirm so landed here to get some help on it.     On the website:      It also proclaimed the group's leader, XYZ  (name), as caliph and   "leader for Muslims everywhere".      As per my opinion it should have been:      It also proclaimed the group's leader, XYZ  (name), as the caliph and   "leader for Muslims everywhere".   Source link: This code won't compile:  \documentclass{article} \usepackage{listings} \lstset{     language=C,     basicstyle=\small }  \begin{document} lorem ipsum\footnote{% \begin{lstlisting} // some C code or whatever... printf("Blah blah\n"); \end{lstlisting}} \end{document}   It says Illegal parameter number in definition of \lst@insertargs. I know listings is really picky about where it goes, but there must be a way to cram a listing into a footnote, right?  (This is a MWE and my tex files are a bit more complex; my actual error is Paragraph ended before \lst@next was complete. but they are hopefully related; I couldn't get this error with the MWE.) Per the title, does $\displaystyle\sum_{n=1}^{\infty} \sin(\pi(2+\sqrt{3})^n)$ converge? Converge absolutely?   I'm stuck on this question, not sure how to approach it.  Thank you! jQuery call function from a string For groups $A,B,C$, if $A\times B$ and $A\times C$ are isomorphic do we have $B$ isomorphic to $C$? The motivation for this question is in my answer to this post :       (1) If I take $A$, $B$ and $C$ three groups such that $A\times B$ is isomorphic to $A\times C$ then do we have $B$ is isomorphic to $C$ ?   In the post a counter example is given when $A$ is an infinitely generated group. However I cannot get a counter-example when $A$, $B$ and $C$ are assumed to be finite groups. Note that there is no reason a priori if $\phi$ is an isomorphism from $A\times B$ to $A\times C$ that $\phi(A\times\{1_B\})=A\times\{1_C\}$.   In the case of finite groups it is true because of the Krull-Schmidt theorem : .  A slightly more general question is the following :     (2) If $B$ and $C$ are two finitely generated groups, can I always find a finitely generated group $A$ such that $A\times B$ is isomorphic to $A\times C$?   If $A$ is not assumed to verify any property but to be a group we can take :  $$A=B^{\mathbb{N}}\times C^{\mathbb{N}} $$  Furthermore replacing :$ \prod_{\mathbb{N}}$ by $\bigoplus_{\mathbb{N}}$ (or more likely the restricted product for groups but I am not sure of a well known notation, it is the subgroup of the product with all but a finite number components being trivial) will give you the same result for countably infinite groups.   $\underline{\text{Edit}}$ : To be clear about what I am asking. (1) is kown to be true for finite groups whereas (2) is known to be true when we are considering groups without restriction (even just for countably infinite groups). Let us pretend we are working on the smaller class of groups : the finitely generated groups. Is there any counter example to $(1)$? Is there any counter example to $(2)$?   $\underline{\text{Edit 2}}$: Here is a partial answer, from the classification of finitely generated abelian groups $(1)$ is always true if all groups are assumed to be abelian finitely generated groups. Now assume that $A\times B=G=A\times C$. Then you have (derived groups) :  $$D(G)=D(A)\times D(B)=D(A)\times D(C) $$  So the abelianizations verify :  $$A^{ab}\times B^{ab}=A^{ab}\times C^{ab}$$  Because we are now in the realm of finitely generated abelian groups we get :  $$B^{ab}=C^{ab} $$  So $(2)$ cannot be true in general for instance you can take $B:=\mathbb{Z}$ and $C=\mathbb{F}_5$, those two groups have different abelianizations.   The new question can be found here : When searching for "Skype" I always see these 2 entries.  There is this duplicate blank Skype icon. Both of them seem to run Skype in the same way.    But I've checked both /usr/share/applications, and ~/.local/share/applications, and can't find the extra icon so I can delete it.    Also as described , sometimes similar ghost icons are present even after removing associated applications. Short story set in the near future where all wars are settled on the moon using automated machines? Plot Details/Summary  Another one where I have only sketchy memories of the tale, I fear.   The setting for this one is the near future (from the writer's perspective, which I think was the 1970s).  Man's reached a point where bloodshed and loss of life are no longer necessary to settle conflicts.  Instead, all disputes are settled through an annual combat held on the surface of the moon, using the best combat machines each nation can come up with.  The protagonist, as I recall, is an engineer for the Americans.  He recollects past conflicts, and the circumstances for this years fracas.  Much of the combat is told from his observers' perspective.  The actual conflict is a rather clever affair, with a description of each team's designs and all the tricks and gee-whiz things they built into them.  The protagonist's team manages to prevail, when they managed to use an attack as a feint, with the real attack being a swarm of microscopic machines (they did not use the term nanites) that destroyed the opposing machine from the inside.  Timeframe/Other Details  I think this one dates from the 1970s.  I don't think it more recent, given my recollections of when I read it, and also the technology descriptions they used in it.  There is an outside chance that the combat is not between rival nations, but rival corporations.  That would change the premise of "man evolving beyond bloodshed", of course.  I think it's nations fighting, though.  I am almost 100% certain this was in a sci-fi magazine, not an anthology. Am I technically allowed to look up cards during a Magic tournament match? Am I allowed to look up a card during a game, if it's being played with serious Rules Enforcement? Either to read the full card from the Gatherer, or to try to find the exact card I'm vaguely thinking of.  Two possible scenarios:   An opponent has revealed a card previously, and I want to remember the exact details. (Something like the exact wording of a sorcery, mana cost, keywords on a creature, subtypes, etc. etc.) I have a "name a card and remove it from the opponent's deck" type card, and I want to, say, ask google for "Blue Gearhulk" to remember that it's that that one is called "Torrential Gearhulk".   Obviously, in casual or semi-casual games neither of these are a problem. Any reasonable opponent will just re-reveal the known card (assuming it IS still guaranteed to be known) or will accept "I name the Blue Gearhulk".  Also obviously, it seems unlikely that I (or anyone else) would get to the stage of playing at the REL without knowing the cards too thoroughly for this to be relevant.  But in principle... is it permitted? Or not? (and if not, is there a good reason, or just "we decided 'No'"?) How can I know what speed card to get for my camera? Cameras rarely specify exactly what speed cards you should be using in them - I just checked the manual for my DSLR, and all it says is to use an SDHD card, and a "high speed" card should be used for recording video.  On the other hand, there are a number of different rating systems for memory card speed (33x! 150x! Class 2! Class 10!) and price seems to increase with speed.  Is there any way to test the maximum write speed the camera is capable of?  Are the read/write speeds documented anywhere? Many other solutions of the Cauchy's Functional Equation By reading the  on the Wiki,  it is said that      On the other hand, if no further conditions are imposed on f, then (assuming the axiom of choice) there are infinitely many other functions that satisfy the equation. This was proved in 1905 by Georg Hamel using Hamel bases. Such functions are sometimes called Hamel functions.   Could anyone give a more explicit explanation of these many other solutions?   Besides the trivial solution of the form $f(x)=C x$, where $C$ is a constant, and the solution above constructed by the Hamel Basis, are there any more solutions existing? How do I select an object in the 3D viewport? Showing that $X^2$ and $X^3$ are irreducible but not prime in $K[X^2,X^3]$ Show that $X^2$ and $X^3$ are irreducible but not prime in $K[X^2,X^3]$.   My reasoning is as follows:  Since the only ways $X^2$ and $X^3$ can be factored in $K[X^2,X^3]$ are $X^2 = X^2 * 1$ and $X^3=X^3*1$ it follows that $X^2$ and $X^3$ are irreducible.  To show that they are not prime in $K[X^2,X^3]$ I argue that $X^2\mid X^3*X^3$ but $X^2\nmid X^3$ and $X^3\mid X^4*X^2$ but $X^3\nmid X^4$ or $X^3\nmid X^2$.  Is that correct? DEFINE vs Variable in PHP What's the thing with $\sqrt{-1} = i$? Do they really teach this in the US? It makes very little sense, because $-i$ is also a square root of $-1$, and the choice of which root to label as $i$ is arbitrary. So saying $\sqrt{-1} = i$ is plainly false!  So why do people say $\sqrt{-1} = i$? Is this how it's taught in the US? I have a set of predictors in a linear regression, as well as three control variables. The issue here is that one of my variables of interest is only statistically significant if the control variables are included in the final model. However, the control variables themselves are not statistically significant.  Here is how the multicollinearity of all my variables look like (including control variables):   &gt; vif(lm(return ~ EQ + EFF + SIZE + MOM + MSCR + UMP, data = as.data.frame(port.df)))        EQ      EFF     SIZE      MOM     MSCR      UMP   3.687171 3.481672 2.781901 1.064312 1.438596 1.003408   &gt; vif(lm(return ~ EQ + MOM + MSCR, data = as.data.frame(port.df)))        EQ      MOM     MSCR   1.359992 1.048142 1.412658    My variables of interest are EQ, MOM and MSCR, and the control variables are EFF, SIZE and UMP. EQ is only significant if the three control var are included, and becomes insignificant when they are not:   Here are the coefficients (1rst row) and t-stats (2nd row) when control variables are included (notice that EQ is statistically significant)         intercept           EQ          EFF        SIZE         MOM       MSCR          UMP [1,] 0.005206246 -0.006310531 0.0001229055 0.004125551 0.007738259 0.00473377 5.838596e-06 [2,] 1.866628909 -1.746583234 0.0388823612 1.178460997 2.145062820 2.08131100 1.994863e-01  Now, here is the result of the regression when the control variables are excluded (notice that EQ is NOT statistically significant anymore)         intercept           EQ         MOM       MSCR [1,] 0.007313402 -0.002111833 0.007128606 0.00668364 [2,] 2.652662996 -0.595391117 2.036985378 2.80177366    The problem is that when I include my control variables, all my variables of interest are significant, but my control variables are not.  Which variables should I include in my final model? How should I structure my final model then, given the fact that the model will be used for forecasting?  Thank you, Let R be a commutative ring with an identity such that for all $r\in$ R, there exists some $n&gt;1$ such that $r^n = r$. Show that any prime ideal is  maximal. (Atiyah and MacDonald, Introduction to Commutative Algebra, Chapter 1, Exercise 7.)    Any hints? Check if user is using IE