How can I enable themes in Gnome Shell? I have installed the GNOME Shell Theming extension and enabled it in the gnome-tweak-tool.  I have installed some themes in my ~/.themes folder but still I cannot select any shell themes.   How can I enable and select GNOME Shell themes?
How can I change GNOME Shell theme? I've installed the GNOME Shell in Ubuntu 12.04 and I want to change the "Shell Theme", But it doesn't allow me to do that.  The alert says something like: "The GNOME-Shell extension is not activated", and I want to install it with the console, But it returns me an error.  How can I solve this problem?
How to select top 10 records from each category Windows 10 high memory usage (unknown reason) A few days ago I updated my PC to Windows 10. However, after some use my PC started to slow down until it was impossible to use – it was due to high memory usage. After a restart, everything came back to normal (total usage around 25% of 8GB of RAM). However, during a few hours of usage the memory builds up again to 70%, and if not restarted it further goes to 100%, and later on even freezes. Task manager does not help very much as it does not show all the processes (added screenshots below). Also tried RAMMap but it gives an error: "error refreshing database". I tried Googling this question, yet without much success.  I do not know much about PCs, but maybe some of you know this issue, or could help to find out what is using my RAM. Allow moderators to fine-tune the effects of a lock Current Situation  When a moderator locks a question or answer, they can choose between different types of post notices: content dispute, off-topic comments, historical significance, wiki answer, or no notice. , but that it works this way is not clear to moderators and it is also not clear what effect a given notice has. The only way to find out for sure is to ask somebody who is not a moderator or use a sock. (This is due to moderator powers possibly overriding the effect of locks.)  Feature Request  Store the effects of a lock separately independent of the post notice. In the interface for locking a post, provide moderators with a checklist regarding the effects of the lock, for example:     This lock prevents:         answers   votes   flags   comments   edits      For questions, also add an option to apply the same lock to all answers to the question. For the canned lock reasons, automatically provide an appropriate choice as defaults.  At the very least make it clear in the dialogue what detailed effects a lock has.  Rationale  Post locks are used rarely, but when they are it is often for important reasons such as avoiding a divide of the community, an escalation of events, or similar. Thus, locks are a tool which moderators have little experience with, but whose correct use (i.e., choosing the right type of effects and knowing what the effects are) may be crucial. Moreover, many locks are used for special cases with individual needs, which in turn require individual locks.  In a specific example, there is a question on Academia, which lead answers and comments, whose appropriateness for the site is subject to a Meta discussion. To avoid further potentially inappropriate comments, answers, etc., I wished to lock question for the remainder of the Meta discussion. I chose content dispute as a lock reason, since it seemed most appropriate notice, however this only prevented edits to the question – which makes sense in other cases but not here. After I noticed this, I chose a historical lock (which I knew to be affecting everything) and removed the post notice (because it was not appropriate). The latter action lead to comments on answers being allowed (), which was not the desired effect either.  Related Questions    – This seems to be partially addressed: The different locks already do have different effects. However, my request goes further than this.  – This is about customising the notice not the effect.  – This would be addressed with this. $$\tan(\theta_1+\theta_2+\cdots+\theta_n)=\frac{S_1-S_3+S_5+\cdots}{1-S_2+S_4+\cdots}$$  where  $S_i$ denotes the sum of product of tangent of angles taken $i$ at a time.     For example,$$\tan(\theta_1+\theta_2)=\frac{S_1}{1-S_2}=\frac{\tan\theta_1+\tan\theta_2} {1-\tan\theta_1\tan\theta_2}$$   (This formula is given  in my textbook with no derivation or background)  How to derive this? I have recently upgraded SQL Server 2000 database to 2008 R2.    What I did was:   Shutdown SQL Server 2000 (express) service on old machine, Move datafiles (mydatabase.mdf and mydatabase.ldf) to new machine, Run SQL Server Management Studio 2008, Connect to local database engine, Attach datafiles to database. Change the compatibility level of database to SQL 2008 (100).     Question: What else should I do to make migration complete?  I want to:   use new features like checksumming and full recovery model, make this database to be exactly as it was created in SQL 2008 R2, make this database to be fully compatibile, correct and be perfect suited for new, SQL 2008 R2 database engine.     In other words: I just want to know how to correctly and completly convert old SQL 2000 database to new 2008 R2 database, be calm that everything is done right and be happy with all new features.    I'm asking this question, because I've found a lot of sites on the Internet that says so many different things that makes me confused: some say that it is required to rebuild indexes, another says to do other things... and now I know nothing so I want to hear experienced person opinion and clear, step-by-step instructions. I work for very small company, I'm on my own and I don't want to screw things up.    Sir, I'm really impressed with your answer, I wasn't expecting so much.    So some comments:   The database is now in production. As I said, it was upgraded using deattach-attach method as I desribed in first post and as described on MSDN:  It had to be done quickly, so I was forced to do it that way. Let's forget about how inappropriate could it was and focus on current situation. The users/persmission is not a problem here - there are only few and permissions are simple. The application which use database is compatibile with SQL 2000 till 2012 so this is not a problem either. The database file (MDF) isn't big - only about 1GB.     Few more questions:   You recommend to use backup/restore method, but I did as written above, so can I encounter any problems now? Everything worked without any problem. About checksumming and full recovery model: it wasn't available/enabled on SQL 2000, so I want to use them now. You said that the only thing I need to do is to enable those options in database properties? I've read somewhere, that it isn't enough and I should also rebuild indexes or something. I really don't know, I just asking. I'm prepairing to migrate this database to SQL 2012 - so first it was from SQL 2000 to 2008 R2, now it will be from 2008 R2 to 2012 (it was impossible to do this directly because of lack of support of SQL 2000 databases in SQL 2012). So I understand that I should follow your guide: backup it in 2008 R2 and restore in 2012, then do the rest of your tips, right? Please explain me the backup/restore method: Is it like a dump of database to SQL queries and then restoring it by executing a bunch of queries? Will this method by the way "defragment" my database? If not, how to defragment/optimize it manually? As we were using SQL 2000 Express for years (no management interface), we were doing backups simply by stopping engine and RAR the DATA directory. For now, as we are on SQL 2008, isn't this still better than using backup function in Management Studio? Full recovery mode with frequent Transaction log backups - Where is the Transaction log stored - is it the LDF file? How sould I backup it properly?     I know that my questions may sound silly, I'm not professional database admin, but I am the only person here who can do such "hard core" task like upgrading the database engine. I'm also sure that your knowleadge will help a lot to other people like me.  Thank you very much for your time and knowleadge, I really appreciate this. PHP: Right way to declare variable before use in loop I have a variable that is built in loop. Something like:  $str = ""; for($i = 0; $i &lt; 10; $i++) $str .= "something";   If $str = "" is ommitted, I get undefined variable notice, but I thought php auto-declare a variable the first time it sees undeclared one?  How do I do this right? The difference between two periodic functions converges to zero, is this two functions identical? If $f(x)$ and $g(x)$ are two periodic functions, that is, $f(x+T_1)=f(x)$ and $g(x+T_2)=g(x)$ for every $x \in \Bbb R$. Now that $\displaystyle\lim_{x\to\infty}(f(x)-g(x))=0$.  Conjecture: $f(x) \equiv g(x)$. "I use to", or "I used to" Which is the correct sentence, if there is a correct one?     I use to be a hitman.        I used to be a hitman.   I've read the second sentence recently in a book, but I was sure it should be I use to be a hitman. What is the difference between a framework and a library? What is the difference between a framework and a library?   I always thought of a library as a set of objects and functions that focuses on solving a particular problem or a specific area of application development (i.e. database access); and a framework on the other hand as a collection of libraries centered on a particular methodology (i.e. MVC) and which covers all areas of application development. Solving Hardy Weinberg problems I really fail to understand Hardy-Weinberg equilibrium and can't find an easy enough source of information.  Can you help me to understand Hardy-Weinberg equilibrium?  My goal is to be able to solve the following kind of problem     In a population with two alleles for a certain locus, B and b, the allele frequency of B is 0.7. What is the frequency of heterozygotes if the population is in Hardy-Weinberg equilibrium? "Do you want to continue[Y/n]?" Why the upper case? I am new to Ubuntu and some little thing start to bug me. Such as when trying to install a program, Ubuntu asks,     Do you want to continue[Y/n]?   What is bugging me is why the letter "Y" is upper case and "n" is lower case. Do they have any significant reason why one is upper and the latter is lower? Whatever case I enter it doesn't change the outcome: it either continues or not. Are they trying to notify us that we can enter both and it won't change anything? How do I upgrade an iPhone 4 from iOS 7.1.2 to iOS 8 or 9 I have an iPhone 4 and I need to upgrade from 7.1.2 to iOS 8 or 9. I would like to ask how I can get iOS 8. Problems enabling Bitlocker on Surface Pro with Windows 8.1 Using a brand new Surface Pro (first generation) out of the box, installed current updates, then 8.1, and any further recommended updates after 8.1 was installed.   I've installed a two other things that don't seem connected to the issue: the Cisco Anywhere VPN client and Visual Studio 2013.  I'd like to enable Bitlocker, but during the verification step, the following error is displayed, with no options to continue:     This PC deosn't support entering a BitLocker recovery password during startup. Ask your   administrator to configure Windows Recovery Environment so that you can use BitLocker.   The "administrator" in this case is me, and I don't:   ... understand why this has happened ... know how to fix the issue, as if it's really necessary to make this change, what would I do? I'm fairly certain this has happened to all of us at some point: You go into a room to get something, but once you're there, you can't remember what you intended to get. It seems like a specific, common phenomenon like this must have a name, but I can't think of it. Does anyone know a name (either formal or slang) for this?  I don't want a general term like forgetfulness or absent-mindedness, which could apply to all sorts of forgetting, or a term for not being able to remember a certain word. I'm looking for a word or phrase that describes this one specific situation of forgetting what you need to get as soon as you go to get it. How to get the location of a program in Ubuntu? For example I have Oracle, how to get the folder racine (location) of Oracle? How can I communicate with a Unix domain socket via the shell on Debian Squeeze? I’m running a Debian Squeeze web server. I’ve installed memcached on it, and configured memcached to listen on a Unix domain socket (at /tmp/memcached.sock), as it only needs to receive messages from the website, which lives on the same server.  It seems to be working fine, but I’d also like to communicate with memcached via the shell, to check that it’s doing what I think it’s doing.  memcached accepts messages via a simple ASCII protocol (if I understand correctly). If it was listening on TCP/IP, I could send messages to it via e.g. nc:  $ echo "stats settings" | nc localhost 11211   But I can’t figure out how to send that text to the domain socket instead.  On my laptop (which runs OS X Lion), both nc and telnet have options (-U and -u respectively) to use domain sockets. However, on my Debian Squeeze web server, these options aren’t present. The keyboard I am trying to create has a lot of Unicode and looks like this:   Being unsuccessful with the following tutorial:    (There are a few errors in the tutorial, and it uses imprecise language such as "Cutting" things instead of "Deleting" them, and it is formatted strangely)   I was wondering if anybody would be so kind to provide a better tutorial with step by step instructions? Does "it is entirely possible that" require the subjunctive form of the verb following "that"? What is the expected minimum euclidean distance between $N$ points uniformly and independently chosen on the shell(sphere) of 3-D ball of radius $R$?   Note that the expected minimum distance might be difficult to compute, so a good lower bound is also fine.   My approach  I take the approach similar to this   .   Suppose we put $N$ circles of radius $r$ uniformly on the surface of the ball. Therefore we could compute the expected minimum distance by the following expression \begin{align} E[D]=\int_0^\infty P(D&gt;t) dt. \end{align}  So, it remains to compute  $P(D&gt;t)$. Actually, since we are after a lower bound on  $E[D]$ it is enought to give a lower bound on $P(D&gt;t)$.  Let $S_i$ be the event that the pair of circles does not intersect which should be given by \begin{align} P(S_i) =  \frac{ Surf(R)-Surf(r)}{Surf(R)}= 1-\frac{  \pi r^2}{ 4\pi R^2}=1-\frac{ r^2}{ 4 R^2} \end{align}  Now the probability that euclidean minimum distance $D$ between $N$ balls is bigger than $t$ should be similar to  \begin{align} P[ D \ge t] \stackrel{?}{=}  P[ \cap S_i] \end{align} However, I think we somehow need to converte from the geodesic distance to euclidean distance but I am not very sure how to do that? I've followed this tutorial to install Ubuntu 15.10:    After restarting my computer I got to the grub menu and chose Ubuntu. Shortly after that I got this error:  /run/lvm/lvmetad.socket: connect failed: No such file or directory WARNING: Failed to connect to lvmetad. Falling back to internal scanning.   These messages keep adding up on a black screen every second. After a while,  I get access to the initramfs ash console.  what am I doing wrong?