I would like to bind "enter" to a combination of keys at the left side of my keyboard. How do I go about doing this? (I would like the combination of keys to be Ctrl+Shift+Q, or maybe there is a better one out there?). It's sort of becoming tedious to reach around or let go of the mouse from my right hand whenever I enter something.
I recently upgraded to Snow Leopard, from Leopard and I was using an awesome app called  that let you remap your keys, set scripts/macros and even had repeat functionality.   However, this app doesn't seem to be in active development anymore, and 10.6 broke the ability to bind certain modifier keys (Shift) with other keys.   I totally miss things like Shift+Insert for paste (Linux/Windows), setting Ctrl+Shift+Esc for Activity Monitor, and Ctrl+Alt+Del for the login window.   So, how can I achieve this instead?
Nonconstant polynomials do not generate maximal ideals in $\mathbb Z[x]$ How to write the Fibonacci Sequence? One Object won't Show up in Final Render even though it shows up in the Preview Render The Crumple-Horned Snorkack is one of various weird and wacky things which Luna Lovegood believes in and most people (especially the ever-rational Hermione) don't. Now we know that Luna is a bit ... odd, and believes in a lot of nonsense; but on the other hand, Hermione's pooh-poohing isn't always to be believed either - Divination, for instance, is a real thing in the Potterverse.  Is it ever established for sure, in canon, in-universe, whether or not Crumple-Horned Snorkacks exist? Kinetic energy conservation in a collision Kinetic energy conservation in collision.  In any type of collision type of collision if we take the system to comprised of both bodies then the net external force is zero. So the work done by external force is also zero. By the relation $W=K_f-K_i$ as $W$ is zero hence kinetic energy is conserved. But this not the case.   Can you tell me what is the flaw in my argument? Some people say that the argument has neglected the fact that some kinetic energy is transformed into heat. But heat is created due to the interactions between bodies during collision which is thus an internal force and thus shouldn't affect kinetic energy. I have some cites in my captions. But I do not want to appear them in the table of figures or listings. With figures I managed to display an different caption like this:  \begin{figure}   \centering   \includegraphics[width=0.55\linewidth]{images/FIPA_Message-Transport-Reference-Model}   \caption[FIPA Message Transport Reference Model]{FIPA Message Transport Reference Model (\cite{FIPA2000}).}   \label{fig:FIPA_Message-Transport-Reference-Model} \end{figure}    But with lstlisting I have some troubles because the caption is an option of the listings and that seems not to have an optional caption label.  \begin{lstlisting}[ language=Scala, label={lst:Publisher}, caption={Publisher notify\cite{Zenger2013}}]    protected def publish(event: Evt) {     filters.keys.foreach(sub =&gt;       if (!suspended.contains(sub) &amp;&amp; filters.entryExists(sub, p =&gt; p(event)))         sub.notify(self, event)     )   } \end{lstlisting}   Any Ideas how to solve this? Thanks in advance! Is RSA key size the size of private key exponent? POSTFIX main.cf permission denied glBufferData not working outside main function How does the speed of electrons change around a circuit? I have been thinking about ways of teaching electronics and I'm wondering if the following is true...  For starters, when we talk about voltage as energy per unit charge, is this energy manifest simply as the kinetic energy of the electron?  So, all other things being equal, will the electrons coming out of a 4 volt battery will have twice the velocity of electrons coming out of a 1 volt battery because of ${1 \over 2}mv^2$?  This would seem to imply that the voltage drop across different parts of the circuit is essentially a comparison of the electron speeds at those points.  Furthermore doesn't this imply that the electrons are nearly halted by the time they reach the positive terminal of the battery? This makes intuitive sense to me, it seems pedagogically sound, and it provides an explanation for how electrons "know" to give up their energy across the circuit -- electrostatic repulsion communicates later resistances to earlier parts of the circuit.  How much of the above is correct? The one things that makes me suspicious is that, in this picture, electron density at the positive terminal of the battery is very high, and repulsive forces would prohibit this. On the other hand, if the Joules per Coulomb are not coming from kinetic energy, then what? The field? But wouldn't that just dissipate as light?  Something is wrong but I don't know what. The Most Efficient Way To Find Top K Frequent Words In A Big Word Sequence Input: A positive integer K and a big text. The text can actually be viewed as word sequence. So we don't have to worry about how to break down it into word sequence. Output: The most frequent K words in the text.  My thinking is like this.    use a Hash table to record all words' frequency while traverse the whole word sequence. In this phase, the key is "word" and the value is "word-frequency". This takes O(n) time.  sort the (word, word-frequency) pair; and the key is "word-frequency". This takes O(n*lg(n)) time with normal sorting algorithm.  After sorting, we just take the first K words. This takes O(K) time.    To summarize, the total time is O(n+nlg(n)+K)， Since K is surely smaller than N, so it is actually O(nlg(n)).  We can improve this. Actually, we just want top K words. Other words' frequency is not concern for us. So, we can use "partial Heap sorting". For step 2) and 3), we don't just do sorting. Instead, we change it to be  2') build a heap of (word, word-frequency) pair with "word-frequency" as key. It takes O(n) time to build a heap;  3') extract top K words from the heap. Each extraction is O(lg(n)). So, total time is O(k*lg(n)).  To summarize, this solution cost time O(n+k*lg(n)).  This is just my thought. I haven't find out way to improve step 1). I Hope some Information Retrieval experts can shed more light on this question. Invalid signature for Kali Linux repositories : "The following signatures were invalid: EXPKEYSIG ED444FF07D8D0BF6 Kali Linux Repository" Can a ring of positive characteristic have infinite number of elements? For curiosity: can a ring of positive characteristic ever have infinite number of distinct elements? (For example, in $\mathbb{Z}/7\mathbb{Z}$, there are really only seven elements.) We know that any field/ring of characterisitc zero must have infinite elements, but I am not sure what happens above. Hi I'm solving some exercise problems in my text : "A Course in Mathematical Statistics".  I'm in the chapter "Point estimation" now, and I want to find a UMVUE of $\theta$ where $X_1 ,...,X_n$ are i.i.d random variables with the p.d.f $f(x; \theta)=\theta e^{-\theta x}, x\gt0$.   I know that $E(X_i)=1/\theta,$ for each $i$, and also have that $\bar{X}$ (or equivalently $\sum_1^n X_i$) is a complete sufficient statistic for $\theta$. But I cannot go any further here. Somebody can help me? Page layout assignments with XML metadata API How do I define page layout assignments for different record types via metadata XML files? Uncertainty and wave-trains My textbook and the following extract from feynman's lectures present the same idea regarding wavetrains and uncertainty in their wavelengths. Why is it that a wavetrain confined to some space has an uncertainty in its wavelength or the wave number? Is not a confined wave-train equivalent to a burst of successive pulses which can have a definite wavelength according to their origin or nature of origin.   Next, i understand that the De Broglie relation relates the uncertainty in wavelength to the uncertainty in momentum but what links the finiteness of the wave-train to the uncertainty in position? How do I find a recursion formula to solve the following question:  In how many sequences of length $n$, with elements from $\{{0,1,2,3,4}\}$, the difference between every 2 adjacent elements is $1$ or $-1$?  I've been trying to solve the problem for the last 5 hours maybe, I'm sure that I'm missing something..   This is a problem in combinatorics, and the solution must be by finding a recursion formula for the problem.   best solution I've come so far is that if we say that $a_n$ is the solution to the question, so let's count how many sequences of size $n-1$ there are that meet the requirement, and we complete the first element to make it a sequence of $n$ elements. so for $n-1$ there $a_{n-1}$ sequences, and for each sequence we have $2$ options to choose the first element (one option is to take a plus $1$ number from the number that start the $n-1$ sequence, and the other option to to take a minus $1$ number from the number that start the $n-1$ sequence), only problem as you figured out is that if the $n-1$ sequnce starts with $0$ or $4$ there is only $1$ option left for the first element in the sequnce.. so $a_n=2a_{n-1}$ won't work.  I think that the solution may involve using $2$ or maybe $3$ recursion formulas.  Hope I was clear enough. Ignoring programming style and design, is it "safe" to call delete on a variable allocated on the stack?  For example:     int nAmount;    delete &amp;nAmount;   or  class sample { public:     sample();     ~sample() { delete &amp;nAmount;}     int nAmount; } How can I make realistic looking potions as handouts What program can I use to decompile a class file? Will I actually get Java code, or is it just JVM assembly code?  On Java performance questions on this site I often see responses from people who have "decompiled" the Java class file to see how the compiler optimizes certain things.