I've got the Early-2015 13" MacBook Pro (2.7 GHz i5) and whilst I was building Smart Previews for all my 1600+ photos in Lightroom 5 I noticed that the fan had come on (unusually) and that the laptop was starting to get rather hot.  When I had a look at Activity Monitor, I saw that Lightroom was using around 300% CPU. Fair enough, I'm sure it's an intensive process. However, I also saw the usage for Lightroom jump higher than 400% on several occasions (usually up to around 410%).  I understand how my CPU is Hyper-Threaded so that it has 4 cores/400% CPU available, but how could it possibly use more than that (bearing in mind several other processes were running as well)?  Cheers, Dan
Several responses to a question  suggested I try Opera kiosk mode, so I decided to download it and give it a try. Once the download had completed and the disk image was being verified, Safari hung for over a minute and there were periods where Safari used a very high %CPU:    In Mac OS X 10.5, I was accustomed to seeing Safari freeze, but it never used up more than 200% CPU (2 cores x 100%). Is this a bug in Activity Monitor? Or does this mean that %CPU is now more akin to ?
How many different (circular) garlands can be made using $3$ white flowers and $6m$ red flowers? This is my first question here.   I'm given $3$ white flowers and $6m$ red flowers, for some $m \in \mathbb{N}$. I want to make a circular garland using all of the flowers. Two garlands are considered the same if they can be rotated to be the same. My question is: how many different garlands can I make?  I tried an approach in which I divided the question into three parts:   No. of ways in which the white flowers are all together No. of ways in which two white flowers are together No. of ways in which no two white flowers are together   Can you please help?  The answer is $3m^2+3m+1$ in the book that I saw  Thanks Wire transfer to an intermediary bank account I sent money from a bank that doesn't have a space for intermediary bank, so I put the intermediary bank statement information where the beneficiary bank information is supposed to be.  I  don't know what will happen now. Attributive or Possessive noun: the Dell Company's staff. or the Dell Company staff? In the following is it better to use a possessive noun with an apostrophe or an attributive noun without an apostrophe?     The following list details the assumptions that have been made in   conjunction with the Dell Company’s staff.   Or      The following list details the assumptions that have been made in   conjunction with the Dell Company staff.   Assume Company is the name of a company, such as Dell. Proof that $S_3$ isomorphic to $D_3$ Is there a way to scale up the bevel object on one end of a curve, a little bit over each point?  I notice the vertex "weight" slider will tweak how much influence each vertex has on the others, is there something like this that can scale the bevel object up a little bit?  Preferably with the option to constrain X,Y,Z independently Question about preposition -of- No newline after (sub)section? I want my text to appear right after the call to \subsection{Name} but  I can't find how to do it. I'm using the article class.  An example of command:  \subsection{a)} Blah blah bla...   produces:     a)      Blah blah bla...   instead of what I want:     a) Blah blah bla...   Anything I could do? As far as I understand, one of the main claimed problems with initializing e.g. a feed-forward neural network (with several $\text{tanh}$ or $\text{ReLU}$ layers) with $W=0$ is that it doesn't break "network symmetry", meaning, backpropagation would propagate the same error through all such units (i.e. "nudging all weights in the same direction"). This is, I presume, undesirable because we would not be learning "different" calculations through different paths of the network.  However, I'm confused why that even matters in this case given the fact that if $W$ ever drops to 0, we will effectively be propagating no gradients at all through the network, since W=0 would multiply all errors from the output and prevent any learning.  Put another way, even if $W=0$ does not break network symmetry (wasting calculations and paths in the network) is it correct to say that if $W=0$ (e.g. by initialization) we are effectively killing gradients in a neural network, and thus no learning can take place? How can I remap a keyboard key? Best way to make a shutdown hook? Since Ubuntu relies on upstart for some time now, I would like to use an upstart job to gracefully shutdown certain applications on system shutdown or reboot. It is essential that the system's shutdown or reboot is stalled until these applications are shut down.  The applications will be started manually on occasion, and on system shutdown should automatically be ended by a script (which I already have). Since the applications can't be ended reliably without (nearly all) other services running, ending the applications has to be done before the rest of the shutdown begins.  I think I can solve this by an upstart job which will be triggered on shutdown, but I am unsure which events I should use in which manner. So far, I have read the following (partly contradicting) statements:   There is no general shutdown event in upstart Use a stanza like start on starting shutdown in the job definition Use a stanza like start on runlevel [06S] in the job definition Use a stanza like start on starting runlevel [06S] in the job definition Use a stanza like start on stopping runlevel [!06S] in the job definition   From these recommendations, the following questions arise:   Is there or is there not a general shutdown event in Ubuntu's upstart? What is the recommended way to implement a "shutdown hook"? When are the events runlevel [x] triggered; is this when having entered the runlevel or when entering the runlevel? Can we use something like start on starting runlevel [x] or start on stopping runlevel [x]? What would be the best solution for my problem?   Thank you very much How to test multiple variables against a single value? url completion in cartoDB info windows How do I make animations a steady speed? Number of solutions of an arithmetic function's equation Say, an equation is given below \begin{equation} 2\pi(x) - \pi(2x)=\omega(x) \end{equation}  where $x$ is a positive integer, $\pi(x)$ is the prime-counting function, and $\omega(x)$ is the number of distinct prime factors of $x$.  I would like to know if this equation holds for finitely many values of $x$ or infinitely many.  If one uses asymptotic formula (from number theory) it can be written that \begin{equation} \omega(x) \sim \ln x / \ln \ln(x) \end{equation} (from )  and  \begin{equation} \pi(x) \sim x/\ln(x), \end{equation} so the above equation can be rewritten (after simplification) as \begin{equation} 2x\ln(2)=\ln(x)\ln\ln(x)\ln(2x) +f(x) \end{equation}  where $f(x)$ is an error term.  If  I plot left side (which is linear, supposed to be a straight line) and right side(a curve),assuming $ f(x) $ is 100% accurate, then the equation implies(?!) that the right will intersect left side. Since line can intersect a curve ($ln  $ function) finite times, so there are finite intersection point. So, can I say that there are only finitely many values of $x$?  graph example-   here f(x) is assumed as x + sinx  without the f(x)- Calculation of $\lim_{n\to \infty}\prod_{r=1}^{n} \left(1+\frac{r}{n}\right)^{\frac{1}{n}}$ Suppose $G$ is a group and $K\lhd H\lhd G$ are normal subgroups of $G$. Is $K$ a normal subgroup of $G$, i.e. $K\lhd G$? If not, what extra conditions on $G$ or $H$ make this possible?  Applying the definitions, we know $\{ghg^{-1}\mid h\in H\}=H$ and $\{hkh^{-1}\mid k\in K\}=K$, and want $\{gkg^{-1}\mid k\in K\}=K$. Clearly, the best avenue for a counterexample is if $gkg^{-1}\not\in K$ for some $k\in K$ and $g\in G-H$.  If no such element exists, $\{gkg^{-1}\mid k\in K\}\subseteq K$ implies $\{gkg^{-1}\mid k\in K\}=K$ because if $k'\in K$, $gk'g^{-1}=k\in K\Rightarrow k'=g^{-1}kg\in\{gkg^{-1}\mid k\in K\}$. To be honest I find it hard to keep up with all the changes, and very frequently I have to go look at the privileges list to see whether a user (that I'm looking at, so I have his reputation value) has a certain privilege or not.  However, I still don't know what that user will actually see or how the site actually behaves for that user.  There's quite a number of posts here on meta about "where did this go" and "why can't I" and I can't really tell either way how a site behaves for a user with a reputation level of 2500.  So, I propose the following functionality:   For all users, be able to view the site as though you had less reputation than you actually have Bonus-feature: For all users, be able to use the site at that reputation level, unless some features of low-level users conflict with your actual functionality For mods, be able to view the site as a specific users (be able to see all he sees, exactly the way he sees it), but of course not pose as that user (ie. things I do would still be me)   The UI could be merged into the mod menu and the privileges menu:    (Note, I chose a user randomly, Olivier Pons is in no way related to this question or flags, or whatever that I know of.) Can I smoothly upgrade from one LTS to next LTS release? How to fix broken taskbar icons in Windows 7 Proper Way to Combine Feature Selection and Hyperparameter Tuning?