Auto signin worked fine on boot until I installed Chromium.  Now the computer signs in on boot, but when i start Chrome, there is a popup asking me enter my keyring ... it gets tedious. Auto signin is all set up under 'users' correctly, so i don't know what is going on. I have seen a workaround that involves setting a blank password.  Not keen on that because of security issues.  Anyone got any other ideas?  Thanks.
I read through all the related answers, but they do not apply to Ubuntu 14.04.  I have no .gnome2 folder and no Passwords and Encryption keys item in the system settings. I tried to crawl through every possible menu, but I could not find out how to do it.  The popup usually pops out when I start Chromium.
I'm sorry if this seems a bit too basic, but I guess I'm just looking to confirm understanding here. I get the sense I'd have to do this in two steps, and I've started trying to grok correlation matrices, but it's just starting to seem really involved. I'm looking for a concise explanation (ideally with hints towards a pseudocode solution) of a good, ideally quick way to generate correlated random numbers.   Given two pseudorandom variables height and weight with known means and variances, and a given correlation, I think I'm basically trying to understand what this second step should look like:     height = gaussianPdf(height.mean, height.variance)    weight = gaussianPdf(correlated_mean(height.mean, correlation_coefficient),                          correlated_variance(height.variance,                          correlation_coefficient))    How do I calculate the correlated mean and variance? But I want to confirm that's really the relevant problem here.  Do I need to resort to matrix manipulation? Or do I have something else very wrong in my basic approach to this problem? byte[] to hex string How do I convert a byte[] to a string? Every time I attempt it, I get      System.Byte[]    instead of the value.  Also, how do I get the value in Hex instead of a decimal? I have a number of friends on my battle.net account. However, sometimes I don't want to appear online to some (or all) of them. Is there a way to be hidden from your friends on battle.net? \section*[toc]{normal section title} not working for me for my thesis I want to have a section appear differently in the ToC than in the text.  After googling a bit, I found \section[short]{long} as a proposed answer, but this does not seem to work for me.  Here is a MnotWE:  \documentclass[12pt,a4paper,reqno]{amsbook} \usepackage{fontspec} \setmainfont[SlantedFont={Latin Modern Roman Slanted},          SmallCapsFont = {Latin Modern Roman Caps},          ]{Latin Modern Roman}    \usepackage[activate=true,nocompatibility},final,tracking=true,factor=1100,stretch=10,shrink=10]{microtype}  \usepackage[bindingoffset=1cm]{geometry} \usepackage{polyglossia} \setdefaultlanguage{english} \usepackage{csquotes}  \title{\textsc{Some Title}} \author{me}  \begin{document} \maketitle \frontmatter \tableofcontents \mainmatter  \part[toc part]{normal part} \section*[toc section]{normal section} some text  \end{document}   It just takes "toc part" as normal and as ToC heading for the \part command.  For the section I am interested in the starred version. Here the [toc section] part of the command seems to be completely ignored.  I use LuaLaTeX to build my document. Does anyone have a suggestion how to get a \section* appear with a different title in the ToC? Why does chmod succeed on a file when the user does not have write permission on parent directory? I am trying to understand file/dir permissions in Linux.  A user can list the files in a directory using   cd test ls -l    Even if the user issuing above commands does not have read, write or execute permission on any of the files inside the test directory, still he can list them because he/she has read permissions on the test directory.   Then why in the following scenario user B can change permissions of a file he owns but does not have write permissions of the parent directory?  User A, makes a test directory and gives other users ability to write in it:  mkdir test chmod o+w test   User B, creates a file in test folder.  cd test touch b.txt   User A removes write permission of others from the directory  chmod o-w test   User B, can successfully change permissions, even though permissions are part of directory and this user does not have write permission on the parent directory of the file he owns  chmod g-r b.txt   why does chmod not fail since the user cannot modify the directory which has the file information - permissions etc? Im working in a site, And I need to present many fields to be filled and the page, so accoding to a selecction before, I have all the field but I have the Api Name, and the object name, but, With this api object field name, how can I get the label????  Example. I have "Student__c", I need to present "Student" to the user.  Thanks a lot for ur help!    Ok, thanks for ur answuers but I think I did not explain well this situation.   I have a list of string, where I have the information but in Api's name.  I present this fields in a table, so the user is filling the fields but with an inputText and not with an inputfield!.. So, in this moment, I dont know what is the label of each field.  My question basically, if by means of a query I could know the label of a field, if I know the api field name and the object name.. My question is if there is a way to consult this info!...  I know if I have the object is enough using an inputfield, But I cant do that. Neither set the label with HTML directly 'cause this is something dynamic.   Anyone knows how can I know, or consult, I guess by means of a query, how to get this label names??? Prove that $n=\dfrac{5^{125}-1}{5^{25}-1}$ is a composite number   My attempt,  Let $x=5^{25}$, so that $5^{125}-1=x^5-1=(x-1)(x^4+x^3+x^2+x+1)$  $=(x^4+9x^2+1+6x^3+6x+2x^2-5x^3-10x^2-5x)(x-1)$  $=((x^2+3x+1)^2-5x(x+1)^2)(x-1)$  I'm stuck at this point and don't know how to continue anymore. Hope someone can provide a detailed solution. Thanks a lot. What is a serialVersionUID and why should I use it? Eclipse issues warnings when a serialVersionUID is missing.       The serializable class Foo does not declare a static final   serialVersionUID field of type long   What is serialVersionUID and why is it important?  Please show an example where missing serialVersionUID will cause a problem. Lightning:input type="date": how to change the date fomat - Summer'18 How can you prove that the normal equations: $(X^TX)\beta = X^TY$ have one or more solutions without the assumption that X is invertible?  My only guess is that it has something to do with generalized inverse, but I am totally lost. Update to Windows 10: What is going to happen to my data and apps? I have Windows 8.1 Update, if I update to Windows 10 when it becomes available what is going to happen to my data and apps?  Of course I have to do a backup, but I wonder if the data will be overwritten or not. Induction: Prove that $4^{n+1}+5^{2 n - 1}$ is divisible by 21 for all $n \geq 1$. Induction: Prove that $4^{n+1}+5^{2 n - 1}$ is divisible by 21 for all $n \geq 1$. Why does the review system disable the "First Posts" and "Late Answers" if I reached daily upvote limit? I was reviewing on , and I faced a weird thing. I can review "Close Votes", "Low Quality Posts", and "Suggested Edits" if I reached my daily vote limit, but I can't for "First Posts" and "Late Answers". Why?    If they just deserve an upvote/downvote then they should not include in the review system. But if we can improve them through leaving comments and by editing the posts then why can't we access them? Can you create a strong blockcipher with small blocksize, given a strong blockcipher of conventional blocksize? Let $\alpha$ be an irrational real number and let $a_j$ be a sequence of rational numbers converging to $\alpha$. Suppose that each $a_j$ is a fraction expressed in lowest terms: $a_j = \alpha_j / \beta_j$. Prove that the $\beta_j$ tend to $\infty$  Attempt: AFSOC that $\beta_j$ does not tend to infinity, then it is bounded by some $M$. We can also find an interval $\alpha \in (k, k+1)$. Let $\epsilon &gt; 0$, $\exists N_0$ such that for all $N &gt; N_0$ we have $|a_N - \alpha|  &lt; \epsilon$. So $|\frac{p_N}{q_N} - \alpha| &lt; \epsilon$. We try to use the fact that $q$ is bounded but fail to derive a contradiction. I do not know how to use the fact that $\alpha$ is between two integers, although it might not be relevant at all.  Ideas? Work done against gravity The work done against gravity is $mgh$, well at least that's what my textbook says. I have a question: I can apply a force say 50N, so total work done = $mgh + mah$. Where $ma$ = Force. But the truth is irrespective of the force applied, the work done against gravity is always $mgh$. Why?  For example, when I move an object with a force, the work done is more, so work depends on the Force. But in case of gravity it always depends upon the weight Do save bonuses stack from multiple magic items in AL? I play in Adventurers League and have a character that has a +1 Ring of Protection, which gives +1 to AC and saves. I also have a Stone of Good Luck which gives a +1 to saves and ability checks.  If I equip both items and my base Dex save is +4, would it become +6 due to receiving both bonuses, or +5 with just one? I can't find much in the PHB or Google to answer this. What is attached to this spigot and how to remove Compiling documents online I have heard rumors that you can compile documents online, and more specifically that Google has a free online compiler, but I have never been able to find any. Is there a way to compile documents online, so that I can write and compile documents even if I don't have a TeX distribution installed on my computer? Prove that $\mathbb Z^n$ is not isomorphic to $\mathbb Z^m$ for $m\neq n$ Prove that $\mathbb Z^n$ is not isomorphic to $\mathbb Z^m$ for $m\neq n$.   My try:  Let $\mathbb Z^n\cong \mathbb Z^m $. To show that $m=n$.  Case 1: Let $m&gt;n$. Now that $\mathbb Z^m$ has $m$ generators whereas $\mathbb Z^n$ has $n$  generators and an isomorphism takes a generator to generator ; that is the contradiction.  Please correct me if I am wrong.  The case  $m&lt;n$ also follows similarly.