I really don't know what to do.  When I enable Unity in CCSM, it doesn't load.  When I close the app, the settings don't stick.  Updating and upgrading didn't help.  Running the unity command in the command line doesn't help.  ANy ideas?
When I login, nothing happens.   I am presented with my desktop wallpaper.    No Dash, no Launcher, nothing.
How is Dru-Zod/General Zod still alive after this character died? Retrieve malicious IP addresses from Apache logs and block them with iptables This is a  about capacity planning for web sites. Related:      What are some recommended tools and methods of capacity planning for web sites and web-applications? Please feel free to describe different tools and techniques for different web-servers, frameworks, etc., as well as best-practices that apply to web servers in general. Switch statement fallthrough in C#? Switch statement fallthrough is one of my personal major reasons for loving switch vs. if/else if constructs. An example is in order here:  static string NumberToWords(int number) {     string[] numbers = new string[]          { "", "one", "two", "three", "four", "five",            "six", "seven", "eight", "nine" };     string[] tens = new string[]          { "", "", "twenty", "thirty", "forty", "fifty",            "sixty", "seventy", "eighty", "ninety" };     string[] teens = new string[]         { "ten", "eleven", "twelve", "thirteen", "fourteen", "fifteen",           "sixteen", "seventeen", "eighteen", "nineteen" };      string ans = "";     switch (number.ToString().Length)     {         case 3:             ans += string.Format("{0} hundred and ", numbers[number / 100]);         case 2:             int t = (number / 10) % 10;             if (t == 1)             {                 ans += teens[number % 10];                 break;             }             else if (t &gt; 1)                 ans += string.Format("{0}-", tens[t]);         case 1:             int o = number % 10;             ans += numbers[o];              break;         default:             throw new ArgumentException("number");     }     return ans; }   The smart people are cringing because the string[]s should be declared outside the function: well, they are, this is just an example.  The compiler fails with the following error:   Control cannot fall through from one case label ('case 3:') to another Control cannot fall through from one case label ('case 2:') to another   Why? And is there any way to get this sort of behaviour without having three ifs? How quickly is antibiotic resistance lost? If $\phi$ is a homomorphism from the group $G$ with identity $e$ to the group $G'$ with identity $e'$, then $\phi$ is injective if and only if $\ker\phi=$?  I think the $Ker\phi = \{x\in G:\phi(x)=1\}$  because you are looking at an identity then it is all reals $0$ does not work a because if $x=0, e'x=0$  but then i realize it is injective how does that affect the kernel? OK, I've been having weird problems for the last 1/2 hour trying to  on StackOverflow, and I keep getting this result (on Firefox 3.6)     The connection was reset      The connection to the server was reset while the page was loading.         The site could be temporarily unavailable or too busy. Try again in a few        moments.   If you are unable to load any pages, check your computer's network        connection.   If your computer or network is protected by a firewall or proxy, make sure        that Firefox is permitted to access the Web.      The problem seems to occur when I try to post some code with 'd--- table' in it, where 'd---' is replaced by the word drop.  I cannot post the following 3 lines, in either SO or this site, if they include the well-known SQL statements DROP.  stat.executeUpdate('d--- table if exists people;'); stat.executeUpdate('create table people (name, occupation);'); prep = conn.prepareStatement(...     'insert into people values (?, ?);');   test again:  'dro* table' 'drop ball' drop the table drop fable drop    t*ble droptable   drop a table  The evil words for me are "drop" and "table"... how come you guys can post? :(  edit: Could someone please suggest another online site that is not stackoverflow that is a quick way to try out a POST request of a text field?  UPDATE: Never mind. I don't know what the answer is, but the same problem occurs on Google's website. So it's not stackoverflow. Now to go to my IT Dept... How can I put the computer to sleep from Command Prompt/Run menu? I know that almost everything on Windows, like opening any sort of application, can be done from the command prompt or from the Run menu.  How can I put my computer to sleep or shut it down? What is the command for that? Natbib -- change author conjunction in citation call-out from 'and' to '&' I'm using natbib, german babel and natbib creates output of the form   Foo and Bar (1337)   I would like to get   Foo &amp; Bar (1337) for citet and (Foo &amp; Bar 1337) respectively for citep. Facebook message notification showing blank message Since I updated the system to 10.11.5, the Facebook message notification is not showing message text.   Is this a bug in this software upgrade of OSX? Combining the first and second law of thermodynamics we can get the following equation  $$TdS=dU-P_{ext}dV$$  First question: Is this equation applicable for irreversible processes such that that $dS≠\dfrac{dQ}{T}$?  Second question:If the system temperature $T_{sys}$ is smaller than the surrounding temperature $T_{sur}$, which temperature should we put in the equation?   I have this question because sometimes people use $T_{sur}$ instead of $T_{sys}$ (e.g. , ) but the equation is supposed to describe changes in the system. What is a StackOverflowError? What is a StackOverflowError, what causes it, and how should I deal with them? Evaluate the following limit of finite sum Evaluate the limit $$\lim_{n\to \infty}\frac{1}{n}\sum_{k=0}^{[n/2]}\cos \left(\frac{k\pi}{n}\right)$$  I tried through considering two cases : (i) When $n$ is even (ii) when $n$ is odd.  When $n$ is even then the limiting value is $\frac{1}{\pi}$. But when $n$ is odd then ??  Case 1 : $n$ is even..  Then , take $n=2p$ where $p$ is positive integer. Then $$\lim_{n\to \infty}\frac{1}{n}\sum_{k=0}^{[n/2]}\cos \left(\frac{k\pi}{n}\right)$$  $$=\lim_{p\to \infty}\frac{1}{2p}\sum_{k=0}^{p}\cos\left(\frac{k\pi}{2p}\right)$$  $$=\frac{1}{2}\int_0^1\cos(\pi x/2)\,dx$$  $$=\frac{1}{\pi}.$$  Case 2 : When $n$ is odd.  Take, $n=2p+1$ , where $p$ is a positive integer. Then ,   $$\lim_{n\to \infty}\frac{1}{n}\sum_{k=0}^{[n/2]}\cos \left(\frac{k\pi}{n}\right)$$  $$=\lim_{p\to \infty}\frac{1}{2p+1}\sum_{k=0}^p\cos\left(\frac{k\pi}{2p+1}\right)$$  From here how I proceed ? This is a  about how to handle email sent from your server being misclassified as spam.  For additional information you may find these similar questions helpful:                    Sometimes I want to send newsletters to my customers. The problem is, that some of the emails get caught as spam messages. Mostly by Outlook at the client (even in my own Outlook 2007).  Now I want to know what should be done to create "good" emails. I know about reverse lookup etc., but (for example), what about a unsubscribe link with an unique ID?  Does that increase a spam rating? How does a  work, and what differentiates it from other linear classifiers, such as the , , or ? *  (* I'm thinking in terms of the underlying motivations for the algorithm, optimisation strategies, generalisation capabilities, and run-time complexity) underline omitting the descenders I'm very well aware that it is considered best practice not to use underlining other than on typewriters and in handwriting. But sometimes it is needed nonetheless.  In my opinion the typographically least offending way to underline in print is to leave out the descenders. This is also how I learned to do it in handwriting. Very few fonts offer a pre-made underlined variant, but some text-processors (e.g. OS X text-engine) do -- depending on the font used -- an acceptable job at emulating this effect:    How would I tweak any of the existing ways/packages for underlining to do the same?  As a bonus, I'd like to be able to tweak the behaviour (extent of the omitted part, apply to which letters) per font and text style, preferably working with XeLaTeX. Suppose all the Associated Primes are Minimal. Let $R$ be a commutative Noetherian ring with unit and let $I$ be a fixed ideal. I am sorry if the following turns out to be a very silly question.  1) Suppose $\operatorname{Ass}(R/I)$ are all minimal, then what can we say about $R/I$?  One conclusion is that $I$ has a unique primary decomposition. If $R/I$ is CM, then $\operatorname{Ass}(R/I)$ are all minimal, but I don't think the converse is true. Can someone provide a counterexample?  2) Suppose $\operatorname{Ass}(R/I)$ are all minimal and have the same height. I still dont think we can conclude that $R/I$ is CM. Can someone provide a counterexample? Theorem 2.1.6 of Bruns and Herzog, CM Rings, gives a result in this direction but it needs additional hypothesis. It says that if every ideal $I$ is generated by height $I$ elements and $\operatorname{Ass}(R/I)$ are all minimal, then $R$ is CM.  It would be nice if someone can say something nice about the ring in the special situation described in 1) and 2).  Thanks. How to set AUTO-SCROLLING of JTextArea in Java GUI? How to Detect workstation/System Screen Lock/unlock in windows OS using java? Parameter Sniffing (or Spoofing) in SQL Server A while ago I had a query that I ran quite a lot for one of my users. It was still being evolved and tweaked but eventually it stablised and ran quite quickly, so we created a stored procedure from it.   So far, so normal.   The stored procedure, though, was dog slow. No material difference between the query and the proc, but the speed change was massive.   [Background, we're running SQL Server 2005.]  A friendly local DBA (who no longer works here) took one look at the stored procedure and said "parameter spoofing!" (Edit: although it seems that it is possibly also known as 'parameter sniffing', which might explain the paucity of Google hits when I tried to search it out.)   We abstracted some of the stored procedure to a second one, wrapped the call to this new inner proc into the pre-existing outer one, called the outer one and, hey presto, it was as quick as the original query.   So, what gives? Can someone explain parameter spoofing?   Bonus credit for    highlighting how to avoid it  suggesting how to recognise possible cause discuss alternative strategies, e.g. stats, indices, keys, for mitigating the situation