I did not like unity desktop.I want to install kde desktop enviorment.Please help!!!
I want to have both KDE and Gnome shells on Ubuntu. Ubuntu only has Gnome installed by default. How do I install KDE?
Is stopwatch benchmarking acceptable? Does anyone ever use stopwatch benchmarking, or should a performance tool always be used?  Are there any good free tools available for Java?  What tools do you use?  To clarify my concerns, stopwatch benchmarking is subject to error due to operating system scheduling.  On a given run of your program the OS might schedule another process (or several) in the middle of the function you're timing.  In Java, things are even a little bit worse if you're trying to time a threaded application, as the JVM scheduler throws even a little bit more randomness into the mix.  How do you address operating system scheduling when benchmarking? This is a question in Ahlfors in the section on the argument principle: How many roots of the equation $f(z)=z^4+8z^3+3z^2+8z+3=0$ lie in the right half plane?  He gives a hint that we should "sketch the image of the imaginary axis and apply the argument principle to a large half disk."  Since $f$ is an entire function, I think I understand that the argument principle tells us that for any closed curve $\gamma$ in $\mathbb{C}$, the winding number of $f(\gamma)$ around 0 is equal to the number of zeros of $f$ contained inside $\gamma$.  How would you go about actually applying the hint though? I am having trouble figuring out what the image of a large half disk under $f$ would look like. I'm assuming that the answer to the question in the title is a resounding yes. Since Baryonic matter and dark matter interact via gravitational forces.  If this is the case how is information not lost if, as is presumed, dark matter does not interact via the electromagnetic force? This is a follow-on from my  about samples from a distribution.  Suppose $X_1 \ldots X_{n-1}, X_n$ are random variables all following some fixed distribution $D$. How do I prove that $P(X_n &gt; X_1 \wedge \ldots \wedge X_n &gt; X_{n-1}) = \frac{1}{n}$ (this is true intuitively and experimentally). check the availability of the WCF Web Service I want to check the availability of the WCF web service i.c service is up or down through  the C# code. How to achieve that? I am looking for a way to identify primitives types in a template class definition.  I mean, having this class :  template&lt;class T&gt; class A{ void doWork(){    if(T isPrimitiveType())      doSomething();    else      doSomethingElse();  } private: T *t;  };   Is there is any way to "implement" isPrimitiveType(). My screen has 1280 x 1024 resolution. But unfortunately, rightmost belt of 200 pixels is damaged and unable do display any image.  How can I set that the Xorg will treat my screen as 1080 x 1024 device?  Now I have tried:  Virtual 1080 1024 Viewport 0 0   It doesn't work right - image is scaled to fit vertically, and horizontally I can pan with the mouse. I'm trying to calculate the amount of settings the enigma machine has. I have found several sites regarding this topic, but it seems like there are two answers to my question. The first answer is 158,962,555,217,826,360,000 and the second is 107,458,687,327,250,619,360,000. Where the difference is that in the second answer, it has been taken into account that the notched rings on the enigma could be set as well, giving 26 * 26 = 676 more settings than the first answer.   But which answer is the right one, and why? How many possible different Enigma machine settings are there and how can one determine this number? Why would the command "ls *" generate an error about invalid options? There is a thread that talks about ls "*" not showing any files, but I actually wonder why the simple  ls *   command doesn't output anything in my terminal other than  ls: invalid option -- '|' Try 'ls --help' for more information.   while   ls   will list all the files in the current directories as    1                  ferol                      readme.txt  2                  fichier                    sarku  2018               GameShell                  Templates  22223333          '-|h4k3r|-'                 test  3                  hs_err_pid2301.log         test2  CA.txt             important.top.secret.txt   toto.text  CA.zip             JavaBlueJProject           tp1_inf1070  countryInfo.txt    liendur                   'tp1_inf1070_A19(2) (1)'  currency           liensymbolique             tp1_inf1070_A19.tar  curreny            LOL                        Videos  Desktop            Longueuil                 'VirtualBox VMs'  Documents          Music                      words  douffos            numbers                    Zip.zip  Downloads          Pictures  examples.desktop   Public   Any ideas as to why the globbing doesn't take effect here? I'm on Ubuntu, working in the terminal, I don't know if it makes a difference.  Thanks. Is it possible to apply modifiers to multiple objects at once? Pointwise limit of continuous functions not Riemann integrable What does "Incompatible types: void cannot be converted to ..." mean? I'm completing a problem set, one problem for which I literally have no idea what to do on. The graders would prefer to have a physical copy of the problem so I thought it best to include the ¯\_(ツ)_/¯ emoji as my answer, instead of something like "Dunno" or "No idea."  Option #1 is to include an image.  Beyond that I actually don't understand how this emoji works. The middle character is Japanese kana "tsu" and proves problematic - TeX wants it in math mode then renders "?" when it is. What are the best methods to show a data table in mobile / tablet view? The probability of two dice summing to k is simple enough, make a diagram of the throws,  $$ \begin{array}{c}  &amp;|&amp;1&amp;2&amp;3&amp;4&amp;5&amp;6\\\hline 1&amp;|&amp;2&amp;3&amp;4&amp;5&amp;6&amp;7\\ 2&amp;|&amp;3&amp;4&amp;5&amp;6&amp;7&amp;8\\ 3&amp;|&amp;4&amp;5&amp;6&amp;7&amp;8&amp;9\\ 4&amp;|&amp;5&amp;6&amp;7&amp;8&amp;9&amp;\color{green}{10}\\ 5&amp;|&amp;6&amp;7&amp;8&amp;9&amp;\color{green}{10}&amp;11\\ 6&amp;|&amp;7&amp;8&amp;9&amp;\color{green}{10}&amp;11&amp;12\\ \end{array} $$  and the probability of a sum is just the length of the corresponding diagonal divided by $36$. For instance, $\mathrm{P}(\mathrm{sum} = 10) = \frac{3}{36} = \frac{1}{12}$. However, it's not as easy to draw a diagram for three dice or more, so how would a general formula look? How to show that the nth power of a $n \times n$ nilpotent matrix equals to zero $A^n=0$ I am looking for a closed form (ideally expressed as elementary functions) of the function $\exp_n(x) = \sum_{k=0}^n x^k / k!$.  I am already aware of expressing it in terms of the gamma function. Background / Motivation When counting combinations of objects with generating functions, it is useful to be able to express the partial sum $1 + x + \cdots + x^n$ as $\frac{1-x^{n+1}}{1-x}$. For example, to count the number of ways to pick 5 marbles from a bag of blue, red, and green marbles where we pick at most 3 blue marbles and at most 2 red marbles, we can consider the generating function $f(x) = (1+x+x^2+x^3)(1+x+x^2)(1+x+x^2+\cdots)$. By using the partial sum identity, we can express it as $f(x) = \left(\frac{1-x^4}{1-x}\right)\left(\frac{1-x^3}{1-x}\right)\left(\frac{1}{1-x}\right)$.  Simplify, express as simpler product of series, and find the coefficient of the $x^5$ term. I want to be able to do the same for a generating function in the form $g(x) = \exp_{n_1}(x)^{p_1} \exp_{n_2}(x)^{p_2} \cdots \exp_{n_j}(x)^{p_j}$ The easiest way to extract the coefficient of a given term $x^p / p!$ would be to use a similar closed form expression for $\exp_n(x)$ and a similar technique to $f$. Attempted Solutions Differential equation Recall that the way to prove the identity $1+x+x^2+\cdots+x^n = \frac{1-x^{n+1}}{1-x}$ is to define $S = 1 + x + x^2 + \cdots + x^n$ and notice that: $S - Sx = 1 - x^{n+1}$. Likewise, notice that $y(x) = \exp_n(x)$ satisfies $y - y' = x^n/n!$.  Via SAGE, the solution is $y(x) = \frac{c+\Gamma(n+1,x)}{n!}e^x$.  Our initial condition $y(0) = 0$ so $c=0$.  By , $\Gamma(n+1,x) = n! e^{-x} \exp_n(x)$ so we have $y(x) = \exp_n(x)$. Recurrence Relation Notice that $\exp_n(x) = \exp_{n-1}(x) + x^n/n!$. Using the unilateral Z-Transform and related properties, we find that $\mathcal{Z}[\exp_n(x)] = (z e^{x/z})/(z-1)$. Therefore, $\exp_n(x) = \mathcal{Z}^{-1}\left[(z e^{x/z})/(z-1)\right] = \frac{1}{2 \pi i} \oint_C z^n e^{x/z}/(z-1)\;dz$. $(z^n e^{x/z})/(z-1)$ has two singularities: $z = 1$ and $z = 0$.  The point $z = 1$ is a pole of order one with residue $e^x$.  To find the residue at $z = 0$ consider the product $z^n e^{x/z} (-1/(1-z)) = -z^n \left( \sum_{m=0}^\infty x^m z^{-m} / m! \right) \left( \sum_{j=0}^\infty x^j \right)$.  The coefficient of the $z^{-1}$ term is given when $n - m + j = -1$. The residue of the point $z=0$ is then $-\sum_{m,j} x^m / m! = -\sum_{m=n+1}^\infty x^m / m!$. Let $C$ by the positively oriented unit circle centered at the origin.  By Cauchy's Residue Theorem, $\frac{1}{2 \pi i} \oint_C z^n e^{x/z}/(z-1)\;dz = \frac{1}{2 \pi i} 2 \pi i \left(e^x - \sum_{m=n+1}^\infty x^m / m!\right) = \exp_n(x)$. Finite Calculus I've tried to evaluate the sum using finite calculus, but can't seem to make much progress. jQuery/JavaScript to replace broken images How do I create an .exe for a Java program? how to hard-bypass the input of a line driver with a switch?