I'm trying out new desktop environments, and just downloaded KDE. I like having Plank on Gnome, but would like to disable it on startup for KDE. How do you start Plank on one desktop environment, but disable startup of Plank on another?
I use both GNOME and KDE SC. In GNOME, I use Docky but I do not use it with KDE. So, I would like Docky to start up only when I login into GNOME not KDE. In KDE, there is an option to make a program autostart only in KDE. But I cannot find any such option in GNOME.    How can I do this?    Thanks in advance.
Find total number of relations that are equivalence as well as partial order set. Assume set contains total $n$ elements.     My attempt:  As equivalence relation has property reflexive, symmetric and transitive and POSET has property reflexive, antisymmetric and transitive.  Symmetric and antisymmetric will cancle each other except reflexive relation and transitive relation can case antisymmetric, so it's also absent on resultant relation.  Therefore, all diagonal element should be present to satisfy conditions of equivalence as well as POSET.  So, it's independent of number of total number of element of set and answer will be $1$.     Can you explain in formal way, please? Are Newton's "laws" of motion laws or definitions of force and mass? Frequency of the sound when blowing in a bottle I'm sure you have tried sometime to make a sound by blowing in an empty bottle. Of course, the tone/frequency of the sound modifies if the bottle changes its shape, volume, etc.   I am interested in understanding how the tone/frequency of this sound can be (approximately) calculated from the shape of the bottle. Is there some formula?  If you have any references about this please post them in your answers.  Being a mathematician I keep hearing that the principal tone is given by the first eigenvalue of the Laplace operator, and I'd like to understand the physical explanation. Facebook authorization fails on iOS6 when switching FB account on device The total number of subsets is $2^n$ for $n$ elements In my probability book, it says that to count the total number of subsets of n elements is a process of $n$ stages with binary choice of either adding this element to the subset or not to add it. Therefore, the total number is $$2^n$$  But, for instance, we have 3 elements, according to this formula, there are 2 to the power of 3 elements, namely 8, which are $${\emptyset},A,B,C, AB, AC, BC, ABC$$  However, I have a hard time of imagining the process or N stages binary choice that form this many subsets. Can anyone explain/help me to understand it? I mean, ABC, if we are making the choice of A, put it in or do not put it in, exactly which subset are we choosing to put in or not? Thank you. mod_pagespeed : install earlier version compatible with libc6 2.13 (Debian Wheezy) What is a reasonable sample size for correlation analysis for both overall and sub-group analyses? How to find all the used IP addresses on a network In my work there is a lot of computer and I want make a joke. I can close computer over the network but finding IP addresses is hard to me.  How can I easily find all online IP adresses from 192.168.1.aa to 192.168.1.zz? How can a file size be zero? Just something I ran into and couldn't think of a proper explanation. If I create an empty *.txt file on my PC and then look at its size, it shows 0. But how is that possible? I mean even if the file itself is empty, it still must have some size, just to store its own name. How can this be explained? (Non OS specific) What steps can I take to try to recover lost or inaccessible data from any storage device?  Answers:   This applies to any computer storage device, e.g. internal/external hard drives, USB sticks, flash memory. The most important thing is to STOP using it, any type of I/O can ruin your chances of a recovery.     We have separate questions covering common problems with USB flash drives in greater detail: How fill face between irregular curves? Hello Blender Stack Exchange,  I am trying to fill a face between 4 surfaces. Two are straight edges and two are a curved line made up of short vertices that came from a SketchUp export.  The problem: I select the vertices on the top and bottom and fill the hole. It creates a strange face that ruins the curve. I would prefer it create some sort of complex curve. I want it to be smooth.  Images attached to better explain. I want to get random decimal digits out of a 6-faced die.  Let's say the die is fair, with an equal probability for each outcome. (But feel free to share any consequences of that not being true, if you feel like it.)  I will represent the outcome of a die roll as a base-6 number:   In base-6 there are only 6 possible digits: $\{0,1,2,3,4,5\}$. The die has faces numbered 1 to 6. Face $f$ corresponds to digit $f-1$.   Thus, I can represent as many die rolls as I like with a base-6 number:   If the die is rolled once:   Let's say the die stopped on face $5$. The final base-6 number will be $4$.  If the die is rolled twice:   Let's say the die stopped on face $5$. And then on face $3$. The final base-6 number will be $42$.  If I roll the dice 10 times:   Let's say the die stopped sequentially on faces $5$, $3$, $4$, $6$, $2$, $3$, $3$, $3$, $2$, and $4$. The final base-6 number will be $4235122213$.    Since I want decimal digits, I need to convert to base-10.   Base-6: $4235122213$ Base-10: $44753985$   For any given number of die rolls, how many different combinations exist? If there are $r$ die rolls, the total of possible combinations is $6^r$.   $r$ rolls — $6^r$ different combinations. $0$ rolls — only $1$ combination. $1$ roll — $6$ different combinations. $2$ rolls — $36$ different combinations. $3$ rolls — $216$ different combinations. $4$ rolls — $1296$ different combinations. $5$ rolls — $7776$ different combinations. $6$ rolls — $46656$ different combinations. $7$ rolls — $279936$ different combinations. $8$ rolls — $1679616$ different combinations. $9$ rolls — $10077696$ different combinations.   $n_r$ ($\in \mathbb{N_0}$) is the number obtained after $r$ die rolls through the process described previously: "If the die is rolled once, twice, ..."  It is impossible for $n_r$ to reach the number of possible different combinations ($6^r$). It will be always short by least $1$:  $$ 0 \leqslant n_r &lt; 6^r $$   $r$ rolls — $n_r$ never surpasses $6^r-1$. $0$ rolls — $n_r$ never surpasses $0$. $1$ roll — $n_r$ never surpasses $5$. $2$ rolls — $n_r$ never surpasses $35$. $3$ rolls — $n_r$ never surpasses $215$. $4$ rolls — $n_r$ never surpasses $1295$. $5$ rolls — $n_r$ never surpasses $7775$. $6$ rolls — $n_r$ never surpasses $46655$. $7$ rolls — $n_r$ never surpasses $279935$. $8$ rolls — $n_r$ never surpasses $1679615$. $9$ rolls — $n_r$ never surpasses $10077695$.   I can never trust the leftmost nor the rightmost digit (fringe digits), since the possible values are potentially restricted.   For $0$ rolls, the outcome is always $0$. For $1$ roll, the fringe digit never surpasses $5$. For $2$ rolls, the leftmost digit never surpasses $3$, and the rightmost, $5$. For $3$ rolls, the leftmost digit never surpasses $2$, and the rightmost, $5$. For $4$ rolls, the leftmost digit never surpasses $1$, and the rightmost, $5$. For $5$ rolls, the leftmost digit never surpasses $7$, and the rightmost, $5$. For $6$ rolls, the leftmost digit never surpasses $4$, and the rightmost, $5$. For $7$ rolls, the leftmost digit never surpasses $2$, and the rightmost, $5$. For $8$ rolls, the leftmost digit never surpasses $1$, and the rightmost, $5$. For $9$ rolls, the leftmost digit never surpasses $1$, and the rightmost, $5$.   The other digits seem perfectly random to me though. Am I wrong? Moving from SQL 2005 [SQL_Latin1_General_CP1_CI_AS] to 2008 - will I lose any features by using 'backwards compatibility' It has been a long time since I have used calculus, and I am trying to understand how the mean and variance of the Laplace distribution with pdf $$f(x|\mu,\sigma) = \dfrac{1}{2 \sigma}\,e^{-\Large\frac{|x-\mu |}\sigma}$$ are derived.  I know that E$[X] = \mu$ and Var$[X] = 2\sigma^2$, but I don't understand how that happens.   Many thanks. Scenario: SQL Server 2014 CU6. 1 AG with 2 databases (compatibility level 100). Failover Cluster with 3 nodes on Windows Server 2012 R2. Primary Availability Replica on node 1 and node 2. Secondary Availability Replica on node 3 (no votes). Async commit, manual failover, readable secondary. Node 3 is used to run reports on these 2 databases (out of 8 databases running outside AG on node 1 and 2).   Problem: Looking to patch these from SQL 2014 to SP1 and latest CU. Not my build and no experience with AG or FC so far. My "test" environment is also used for development, so no room for mistakes.   Questions:  What's the best order to patch the 3 nodes ?   Do I first have to remove the databases from AG on the node I'm patching ?  Do I need to take the Secondary out when patching it ?  No experience on this, and I can't find clear answers for my scenario (maybe not supported?) in the docs: Why do two bodies of different masses fall at the same rate (in the absence of air resistance)? Word for a temporary project name Suppose you have a group isomorphism given by the first isomorphism theorem: $$G/\ker(\phi) \simeq \operatorname{im}(\phi)$$ What can we say about the group $\ker(\phi)\times \operatorname{im}(\phi)$? In particular, when does the following hold: $$G\simeq \ker(\phi)\times \operatorname{im}(\phi)?$$ I ask this question because i want to prove that $GL_n^+(\mathbb{R}) \simeq SL_n(\mathbb{R}) \times \mathbb{R}^*_{&gt;0}$, with $GL_n^+(\mathbb{R})$ the group of matrices with positive determinant. I proved that $SL_n(\mathbb{R})$ is a normal subgroup and that $GL_n^+(\mathbb{R})/  SL_n(\mathbb{R}) \simeq \mathbb{R}^*_{&gt;0}$, using the surjective homomorphism $\det(M)$. I tried something with semidirect products but I got stuck. So basically in SQL Server a NULL means there is no value and thus can't be compared which returns some unexpected results.  For example, the following query doesn't return rows where value IS NULL but I want it to:  SELECT * FROM table WHERE   (value != 26)   AND date IS NULL   AND last_modified &gt;= '5/21/2014'   I understand I can do the following as a workaround but seriously? Having to add parentheses and check if is null for every single field every single time I want to include it? Seems ugly, not intuitive and crazy.  SELECT * FROM table WHERE   (value != 26 OR value is null)   AND date IS NULL   AND last_modified &gt;= '5/21/2014'   I mean I know NULL is not a value and thus can't be compared but can't you infer that it is, in fact, definitely not 26? If 26 is something and NULL is nothing and nothing is not something then NULL is not 26. Seems logical to me.  Does anyone know how I can, in a cleaner way, include nulls in my results when using comparisons without having to include an explicit check each and every time. Also turning off nulls on my tables is definitely not an option.  Edit:  My real problem of why I don't want to do it the way I showed was not exposed. So here goes. I am writing a program that let's you build queries to database tables and let's the user dynamically create filters and such which essentially at the end of the day constructs a SQL statement and gets the results to display to the user. The fields chosen by the user can be any and/or all fields in a given database and if I have to literally put that ISNULL check on every single field that would be really inefficient and make looking at the SQL super ugly. My program is table-definition-agnostic meaning I don't care what's in your table and don't want to know what your table's definition is. I just want you to pick a table, choose some fields to filter on with equals, not equals, in, not in, etc ... and then click a button to view the results of that request. Libraries module. Where to extract?