I found answers, but I have to clearly understand what to do with its. I had reinstalled Ubuntu, mounted home, and question appears  When I look files in home I found snap folders with my last apps names. How I understood snap is a app versioning. Is it only info about versions or or are these the applications themselves?
What's the difference between the snap folder in /home/&lt;UserName&gt; and the snap folder in root (/)?  I'm trying to get a grasp on where programs and their files are stored when you install them.  The first and only program I have installed on my machine is Spotify.    I noticed that there were two spotify folders within two separate snap folders.  One in the home directory and one in the root directory.    Questions   Why are there two snap folders? Why are there two spotify folders? Are they different in any way (the snap and spotify folders)?     NOTE: I installed Spotify via the Ubuntu Software application, not via the Terminal.
Unable to post - login problems with Area 51 ... again I recently signed up for Area 51 with my stackexchange network account/ID, verified the account and logged in.  I see the main page  where I confirm that I am logged in.  I click on the discuss link on the black menubar at the top, which takes me to the discussion zone. From here I click on ask question, which asks me to add  a login even though I have already logged in with my stackexchange ID.  Here if I choose the stackexchange login option then it takes me back to the main page, from where the cycle begins again. How to import Apple Mail archive files in Outlook 2013? I need to import Apple Mail archived files in Outlook 2013 on Windows, but every time I open the import wizard and reach the file selection step, I cannot select the archived file. It doesn't even show in the dialog box.  I don't know what the issue is. Is it the file size issue as the archive file is large (about 7 GB) or there is any other fault? Is there any way to know when I will receive my UK visa? SQL Select Upcoming Birthdays I'm trying to write a stored procedure to select employees who have birthdays that are upcoming.    SELECT * FROM Employees WHERE Birthday &gt; @Today AND Birthday &lt; @Today + @NumDays  This will not work because the birth year is part of Birthday, so if my birthday was '09-18-1983' that will not fall between '09-18-2008' and '09-25-2008'.    Is there a way to ignore the year portion of date fields and just compare month/days?   This will be run every monday morning to alert managers of birthdays upcoming, so it possibly will span new years.    Here is the working solution that I ended up creating, thanks Kogus.    SELECT * FROM Employees  WHERE Cast(DATEDIFF(dd, birthdt, getDate()) / 365.25 as int)     - Cast(DATEDIFF(dd, birthdt, futureDate) / 365.25 as int)  &lt;&gt; 0 Typesetting long division with tabular and overlining repeating part Using sed with special characters Does black hole formation contradict the Pauli exclusion principle? A star's collapse can be halted by the  due to the Pauli exclusion principle. In extreme relativistic conditions, a star will continue to collapse regardless of the degeneracy pressure to form a black hole. Does this violate the Pauli exclusion principle? If so, are theorists ok with that? And if it doesn't violate the Pauli exclusion principle, why not? How do I get started creating an Ubuntu Desktop App? I want to create an Ubuntu desktop app, specifically to replace Gwibber.  I can code in Java, Python and a few other technologies. Adobe Flex would have been an option until Adobe decided to suck some more and stopped support for AIR on Linux.  Note - I don't care about supporting other OS's. It will be a personal Ubuntu specific app. It can I open-source, I don't mind extra help.  It should integrate seamlessly with Ubuntu, notifications and all.  I guess Python it is, is that correct? How do I get started? To seek the maximum value of $S=x_1x_2+x_2x_3+\cdots+x_nx_1$ on this domain:  $x_1+x_2+\cdots+x_n=0$ and  $x_1^2+x_2^2+\cdots+x_n^2=1$.  I have made some trivial observations:  1) $S\in[-1,1)$ by the rearrangement inequality.  2) We can make $S$ arbitrarily close to $1$ by increasing $n$.  3) An equivalent problem is to minimise $(x_1-x_2)^2+\cdots+(x_n-x_1)^2$.  But does the maximum have a meaningful closed form  for each $n$? Check to see if an email is already in the database using prepared statements Is it possible to combine processing power of 2 computers? Here are a few questions, I wish you could enlighten me.   Is it possible to combine processing power of 2 computers? How do I do it? Let $\mathbb F$ be a field and $\mathbb  K $ be an extension field of $\mathbb F$  such that $\mathbb K$ is algebraically closed.   Let $\mathbb L$ be the field of all elements of $\mathbb K$ which are algebraic over $\mathbb F$. Then $\mathbb L_{|\mathbb F}$ is an algebraic extension.   My question is : Is $\mathbb L$ algebraically closed ?  I am trying to prove the existence of algebraic closure, so please don't assume that every field has an algebraic closure. How can I adjust Cycles material displacement amount? The outlet for my range hood was misplaced. It needs to be 4 inches to the side. I can make the junction and move the wiring to the new location but I really don't want to have the empty plate exposed.   The wire is not long enough to reach the required location, so I will make a junction in the existing box, and add a new box at the correct location.  Is there any acceptable circumstance where I could tile over the "old" in-wall junction box?  I'm guessing not, but I figured I'd ask.  EDIT: I should clarify, based on the answers below... I know for a fact that this outlet is the only line on this entire circuit, all the way back to the panel. I am asking explicitly if there is any way to acceptably splice the wiring without exposing a junction box. When does a .com domain become available after it expires? (With status clientTransferProhibited) Declare a const array How to draw a Sankey Diagram using TikZ I tried to prove this question but without a success: Let $K_1$ and $K_2$ be definable sets, prove that $K_1\cup K_2$ is definable.  What I tried to do is to assume: $K_1=Ass(X)=\{ v|v \vDash X \}$ and $K_2=Ass(Y)=\{ v|v \vDash Y \}$ and to say that $K_1\cup K_2=Ass(X \cap Y)$. but I couldn't prove that: $K_1\cup K_2 \supseteq Ass(X \cap Y)$ .   I would like to get help with this proof Prove ${n - 1 \choose k - 1} + {n - 2 \choose k - 1} + {n - 3 \choose k - 1} + \dots + {k - 1 \choose k - 1} = {n \choose k}$ Variablity in cv.glmnet results I am using cv.glmnet to find predictors. The setup I use is as follows:  lassoResults&lt;-cv.glmnet(x=countDiffs,y=responseDiffs,alpha=1,nfolds=cvfold) bestlambda&lt;-lassoResults$lambda.min  results&lt;-predict(lassoResults,s=bestlambda,type="coefficients")  choicePred&lt;-rownames(results)[which(results !=0)]   To make sure the results are reproducible I set.seed(1). The results are highly variable. I ran the exact same code 100 times to see how variable the results were. In the 98/100 runs had one particular predictor always selected (sometimes just on its own); other predictors were selected (co-efficient was non-zero) usually 50/100 times.  So it tells me that each time the cross-validation is running it's going to probably select a different best lambda, because of the initial randomization of the folds matter. Others have seen this problem () but there isn't a suggested solution.  I am thinking that maybe that one which shows up 98/100 is probably pretty highly correlated to all the others? The results do stabilize if I just run LOOCV ($\text{fold-size} = n$), but I am curious why they are so variable when $\text{nfold} &lt; n$.