How to get back Dropbox Icon xubuntu 14.04
Xubuntu Dropbox icon fail
I'm using Xubuntu 14.04 64 bit. I know that question been asked a billion times, but all of them consist of editing following file:  /etc/polkit-1/localauthority/50-local.d/com.ubuntu.enable-hibernate.pkla   That file does not exist on my system. I tried com.xubuntu.enable-hibernate.pkla but doesn't exist either, locate command doesn't find it. Python: List vs Dict for look up table I have about 10million values that I need to put in some type of look up table, so I was wondering which would be more efficient a list or dict?  I know you can do something like this for both:  if something in dict_of_stuff:     pass   and  if something in list_of_stuff:     pass   My thought is the dict will be faster and more efficient.  Thanks for your help.  EDIT 1  Little more info on what I'm trying to do.  .  I'm making a look up table to see if a value calculated has all ready been calculated.   EDIT 2  Efficiency for look up.  EDIT 3  There are no values assosiated with the value...so would a set be better? What are the Windows A: and B: drives used for? In Windows you have a C-drive. Everything labeled beyond that is with the following letter.   So your second drive is D, your DVD is E and if you put in a USB stick it becomes F and the following drive G. And so on and so forth.  But then, what and where are A and B-drives? Which of the following sets are compact in $\mathbb{M}_n(\mathbb{R})$[NBHM_PhD Screening Test-2013, Topology] Which of the following sets are compact in $\mathbb{M}_n(\mathbb{R})$ (a) The set of all upper triangular matrices all of whose eigenvalues satisfy $|\lambda|≤2 $. (b) The set of all real symmetric matrices all of whose eigenvalues satisfy $|\lambda|≤2 $. (c) The set of all diagonalizable matrices all of whose eigenvalues satisfy $|\lambda|≤2 $.  (a) &amp; (c) are not true. But I am not sure about (b).can anybody help me please. $(a,b) \mathbin\# (c,d)=(a+c,b+d)$ and $(a,b) \mathbin\&(c,d)=(ac-bd(r^2+s^2), ad+bc+2rbd)$. Multiplicative inverse? Let $r\in \mathbb{R}$ and let $0\neq s \in \mathbb{R}$. Define operations $\#$ and $\&amp;$ on $\mathbb{R}$ x $\mathbb{R}$ by $(a,b) \mathbin\#(c,d)=(a+c,b+d)$ and $(a,b) \mathbin\&amp;(c,d)=(ac-bd(r^2+s^2), ad+bc+2rbd)$ as addition and multiplication, respectively. Do these operations form a field?  I have shown that every axiom of the field is satisfied except for the "existence of multiplicative inverses" axiom. This is where I need help. We either need to show that this axiom fails and so we don't have a field or that the axiom $aa^{-1}=1$ is satisfied for every $a\neq 0 \in \mathbb{R}$  The multiplicative identity in this problem is $(1,0)$.  Any solutions or hints are greatly appreciated. There is a statement that maximizing the likelihood is equivalent to minimizing the cross-entropy.  Are there any proof for this statement? Why wasn't Sauron invisible when he wore the Ring? When Sauron is shown killing Elendil and then being destroyed by Isildur he is clearly not invisible and he is wearing the Ring.  But any time Bilbo or Frodo put on the Ring they went invisible without fail.  Did the Ring change after Sauron was destroyed or is Sauron capable of controlling the rings power unlike anyone else? gedit "cannot open display" , on remote computer , using ssh - Ubuntu 12.04 Possible Duplicate:          I am getting the following error message when using ssh to log into a remote machine:      gedit: cannot open display   I am using ssh in - Ubuntu 12.04. Matrix with labels nested in braces Why is this sentence correct? “She suggested that he go to the cinema.” How can I calculate the age of a person in year, month, days? $\ker \phi = (x_1-a_1, ..., x_n-a_n)$ for a ring homomorphism $\phi: R[x_1, ..., x_n] \to R$ Let $R$ be a commutative ring, $a_1, ..., a_n$ its elements and  $\phi: R[x_1, ..., x_n] \to R$  defined by  $ \phi(f(x_1, ..., x_n)) = f(a_1, ... ,a_n)$  a ring homomorphism.  Prove: $\ker \phi = (x_1-a_1, ..., x_n-a_n)$  It is obvious that $(x_1 - a_1, ..., x_n -a_n) \subseteq \ker \phi$. I'm not sure how to prove the converse.  At this point I don't know any division algorithms for multivariable polynomials, only for the ones in $R[x]$(and the book from where I taken the exercise doesn't assume the reader to know something beyond basics of rings and ideals, and the division algorithm for $R[x]$). Though I know this could be solved for $i = 1$ by dividing by $x-a$:   Let $f(x) \in \ker \phi$, divide by $x-a: f(x) = q(x)(x-a) + r, f(a) = r = 0$, so $f(x) = q(x)(x-a) \in (x-a)$. How to clear the BIOS security password on this notebook? I recently got an Acer Aspire E11 (E3-112m) and in order to install another OS I had to set a Supervisor password, so I used a well known password to me, the problem is that such password contains a special character ! which the password prompt won't let me input, though it let me when I had to set the password (buggy prompt I believe). Now everytime I need to change something in the BIOS I have to fail 3 times and go to  to generate a master key.  I have already tried several different methods to clear it:   Removing the CMOS battery Looking for the reset jumper (which doesn't even exist).   I also noticed there were 2 weird buttons on the front and back sides of the motherboard, I don't know what they are for but I also pressed them (while both the CMOS and the regular battery were disconnected). All of this without luck, the password just won't reset (though the RTC did).  Are there other ways to reset the Supervisor/Admin password on this model? For any symbol, how can I get the full context-qualified name of the symbol as a string? I've been trying a simple recipe I found on the internet, which is a simple recipe consisting mostly of gelatin.  The problem is that the end result is basically just a fruit-flavoured jelly (Jell-O?), rather than the more chewy gummy-bears (Haribo) style of jelly confectionery.  Can anyone suggest what I need to do to make them less springy and more chewy.  It's all difficult to articulate!  Here's what I used for the first test-batch:   12 tbsp sugar 12/3 cup fruit juice 8 tbsp Golden Syrup 8 tbsp gelatin   soften the gelatin in 1/2 cup of cold water. place sugar, syrup and the juice in a pan and gently heat until sugar dissolves. Stir in the gelatin and stir until dissolved. Pour into moulds and wait until set.    Thanks of Stack Overflow, all content posted on Stack Exchange sites by their users (i.e. you wonderful people) has been provided to the whole universe under . For my fellow non-lawyers, that license basically means:   Anyone can use any Stack Exchange posts at any time without having to ask for permission Making money off of the copied content is permitted You don't even have to copy stuff from here verbatim; you can just use it as a starting point and make whatever edits you want There are just two rules you have to follow:   You have to provide . Simple links to the original post and author info are just fine. You have to  and allow other people to use your content, as long as they follow these very same rules. How meta!    (If you ever forget any of that, and want to refresh your memory, the license info is linked to in the footer of every page.)  There are, in fact, a lot of people who republish varying amounts of our content for assorted reasons. Unfortunately, there are some Stack Content Republishers Attributing Poorly and/or Excelling at Ranking (SCRAPERs, for short).  In this context, "attributing poorly" means any use that doesn't follow our attribution rules or make any other reasonable attempt at give credit. This can get pretty egregious; I've seen SCRAPERs that not only don't link back to SE originals, but also use fake author info and post dates to make it harder to find originals. By "excelling at ranking," I'm referring to copycat sites that end up higher in Google results than the original SE sites do for the same content. That's not necessarily wrong, but in some cases, it indicates inappropriate SEO hackery.  So, the question is: what can you do if you spot a SCRAPER? I posted a question and a couple of respondents asked for the source code. I could only post portions of the code.  If attachments were allowed I could have uploaded a .zip file with the whole application.  Will this be a feature in SO? How can I get the size of an array from a pointer in C? I've allocated an "array" of mystruct of size n like this:  if (NULL == (p = calloc(sizeof(struct mystruct) * n,1))) {  /* handle error */ }   Later on, I only have access to p, and no longer have n. Is there a way to determine the length of the array given just the pointer p?  I figure it must be possible, since free(p) does just that. I know malloc() keeps track of how much memory it has allocated, and that's why it knows the length; perhaps there is a way to query for this information? Something like...  int length = askMallocLibraryHowMuchMemoryWasAlloced(p) / sizeof(mystruct)   I know I should just rework the code so that I know n, but I'd rather not if possible. Any ideas? How can we prove that $D(f)\backsimeq\operatorname{Spec} A_f$? Let $$D(f)=\operatorname{Spec}A - V(f)=\{p\in \operatorname{Spec} A:f\notin p\}$$ be the principal open subsets of $\operatorname{Spec}A$ with the Zariski topology. I'm trying to prove that $D(f)\backsimeq \operatorname{Spec} A_f$, where $A_f$ is the localization of $A$ at $f$.  If we consider the canonical homomorphism $\varphi:A\to A_f$ given by $\varphi (a) = \frac {a}{1}$, we can define $\varphi':\operatorname{Spec} A_f\to \operatorname{Spec} A$, given by $\varphi'(p)=\varphi^{-1}(p),\forall p\in \operatorname{Spec}A_f$.  I'm having trouble proving that this map is surjective.  Thanks. I've updated my Ubuntu to 19.10 couple of weeks ago and on installation system suggests to change or add shortcut for input source selection despite one was already defined previously. I've added ctrl+shift shortcut and just realized that it somehow overlapped any other ctrl+shift+something shortcuts globally, i.e. when I want to open new window in vscode, it opens new tab and it looks like system doesn't see the shift button press.   I tried to search this combination in shortcuts settings, but it's just not there.