I've lost count of the number of times I've pressed Ctrl+C to copy something in some Microsoft Office app, flipped to another window or app, pressed Ctrl+V to paste, and instead, it pastes whatever had previously been in the clipboard. Annoyed, I flip back to the previous window, press Ctrl+C again, flip, paste, still doesn't work. Sometimes I have to try this three or four times.  Why does Office do this? It's like it's responding to keyboard shortcuts sluggishly, forcing me to slow down for something I shouldn't have to slow down for, making it generally irritating to use.  I haven't noticed this behavior in any other program. I can't remember if it's happened prior to the 2013 version. I've definitely had it happen in PowerPoint and Word.  It isn't . It will stop, and then maybe start again. And then stop again. And start again. (Hence, "randomly".) I don't use Notepad++. I have Skype up, but if it were truly interfering with keyboard shortcuts, it wouldn't suddenly stop interfering. I might try the clipboard lock monitor when I get home, but I can't use it at work. Does it constantly monitor the lock in real time? If it doesn't, it won't be useful to diagnose this problem unless I'm extremely lucky.
Copy-paste functionality stops working after about an hour after each reboot on a Windows 7 64-bit system. Running Google Chrome (with gmail and few other tabs open like Calendar, Reader), MS Outlook (which I don't think has anything to do with the problem — I saw it when outlook was off as well), iTunes (9.1.1.12 if it matters).  Would appreciate hints where and what for to look in a registry, and ideas for possible fix.  That is not an Internet Explorer problem (I don't even run it) — it happens in all applications.  Neither Ctrl-C/Ctrl-V nor context menu right-click Copy-Paste (actually, nothing happens on Copy, so there is nothing in a clipboard to Paste) are working. Drag-and-Drop (where supported) continues working though.
While the etiquette of dealing with duplicate answers , there hasn't been a great way to deal with these, "Uh, yeah, I said this, too" types of behavior than the almighty downvote.   It would be nice to have a "Duplicate Answer" option on the flag menu. Five flags auto-deletes the answer, as with any other flag. In order to prevent abuse, the flagged answer would have to have the last owner edit (including original post) be younger than the original answer's original posting by at least 2 minutes.  Also, this ability should be a 5,000+ rep privilege, since we currently have no fanfare of rep from 3,001 to 9,999, and a power like this has a bit more umph than closing a question.  Thoughts? How to get a random value from dictionary? Why do the $n \times n$ non-singular matrices form an "open" set? How do I disable Aero Shake in Windows 7? I'm always accidentally minimizing most of my windows. This is really annoying. How do I disable Aero Shake? Creation of a matrix Center of a group ring? Let $R$ be a ring with unity and let $G$ be a group. Then what is the center of the group ring $R(G)$? I feel that the center $Z(R(G))$ is $R(Z(G))$. I assumed if $x=\sum_{i=1}^{n} r_i g_i$, then it should commute with every element of $R(G)$. In particular it should commute with $g=1 \cdot g \in R(G)$ Thus we get $$\big(\sum_{i=1}^{n} r_i g_i\big)g=g\big(\sum_{i=1}^{n} r_i g_i\big)$$ Thus I get $$g_i \cdot g=g_i \cdot g \text{ }\text{ }\text{ }\text{ }\text{ }\text{ }\text{ }\text{ }\text{ }\text{ } \forall g \in G$$ Hence $x \in Z(R(G)) $. Is this correct? How to set a maximum execution time for a mysql query? I would like to set a maximum execution time for sql queries like set_time_limit() in php. How can I do ? mod [= remainder] operation (and relation), name and meaning I am trying to write the Euclidean algorithm in the following way:  $A = \lfloor A \div B \rfloor \times B + (\text{remainder of}) \: A \div B $   Now is there any symbol I can use  to say "remainder of A $\div$ B"? I know that in the C programming language there is the operator % for modulus; is that a valid symbol in maths? Can I write A % B? Or is there some other way? Android popup window dismissal How do I defeat the Kayran in the first chapter of the Witcher 2? In the first chapter you are supposed to slay the Kayran, this enormous beast:    I'm having a hard time with it. I drank the Mongoose potion for poison resistance and I have the Kayran trap, but it just hits me too often with its tentacles. Especially when the Kayran swings a tentacle sideways, not from above, I have a very hard time evading it.  Is there any trick besides not getting hit by the tentacles?  With a lot of luck I'm getting as far as the point where it's throwing stones. Any idea what I'm supposed to do then? Levels or First Differences, VECM or VAR for Ultimate Impulse Response Functions? My final goal is to generate Impulse Response Functions in R.  I have variables that are non stationary when I set k = 5 in a Unit Root test, and they are cointegrated which to my understanding prompts the use of the VECM, from which the Vec2Var argument is used to then generate IRFs. However, my response functions from this methodology do not decay over time and mostly do not revert to the zero line.  Furthermore, I noticed that when I input first differenced variables into the VECM as opposed to level data above, response function do revert to the zero line. Therefore my first question is: 1) is it appropriate to use differenced variables in a VECM model?  Secondly, as an alternative I am considering restricting the number of lags used in the Unit Root tests so that the variables are not all non-stationary; in this case 2) would the use of VECM be void and the VAR with first differences be a more appropriate model? Again, using differenced data is giving me better response functions that revert to zero in the long run. However, 3) is it ok to use the VAR for stationary/non-stationary data in levels where these variables are still cointegrated?  Also, I am using growth rate variables, 4) should I still long transform all variables and use logs in all tests?  Thank you for the help! How does Intel Turbo Boost work? Why does `Position` by default return a list of lists of positions instead of a simple list of positions? How would I go about proving this limit?  $\lim_{x\to\infty}\frac{1}{x^4+x^2+5}=0$  so far I have:  $|f(x) -L|&lt; ϵ$ wherever $x &gt; N$  $|\frac{1}{x^4+x^2+5} - 0| &lt; ϵ $ wherever $x &gt; N$  $|\frac{1}{x^4+x^2+5}| &lt; ϵ  ,\; x &gt; ∞$, assuming, $x &gt; 0$  taking the absolute value $\frac{1}{x^4+x^2+5} &lt; ϵ$  ${x^4+x^2+5}$ > $\frac{1}{ϵ}$  i am not sure whether this is correct, but what would be the next step? How to float until on left (or right) page? Using have gone to / been to / been in I understand the difference between these constructions: "has gone to", "has been to", "has been in":   "has gone to" &mdash; there or on his way to; "has been to" &mdash; someone has been there but he is on his way back; "has been in" &mdash; someone is still there;   But now I am puzzled by next statements:   Have you ever been to / in Greece? &mdash; Yes, it's a very beautiful country; When did you last go to Canada? &mdash; I've never been to Canada.   If I use "has you ever gone to Greece" construction in the first case or "I have never gone to Canada" in the second statement will it be uncorrect? Or just will sound odd? May I say "I have never been in Canada" in the second sentence. Or in these case all of the variants are possible, the problem is in how people usually say it (in what how it perfectly sounds)? Closure of the set of degree $n$ polynomials with $n$ real roots A very beautiful (but maybe classic) exercise:   Consider the set $\Omega_n$ of polynomials of degree $n$ with real coefficients and $n$ distinct real roots.   What is the closure of $\Omega_n$ in $R_n[x]$?  ($R_n[x]$ denotes the set of polynomials with real coefficients of degree at most $n$)    The answer is the set of polynomials in $R_n[x]$ all of whose roots are real, plus the constant polynomials. Showing that this set is contained in the closure is not too hard, however the reverse implication is more difficult and I'm wondering what is the most elementary method to prove it (without talking about holomorphic functions for example). How to layout irregular paragraph shape I have found this in the cover of seminar(one tool to make slide) document.  The final result I have captured below:    The complete document can download .  I wonder how to make this. Is there any easy way? When looking at a PDF document I often want to zoom-out to scroll quickly to its contents and get an overview.  However, when I zoom-out past a certain threshold (it seems to differ per PDF) Safari thinks I want to see the tab overview:    I have never found a use for this function, so it only causes annoyance.  Can I turn this tab overview off somehow? A solution that uncouples the pinch-to-zoom gesture from the functionality would also work.  I'm on Mountain Lion 10.8.5 with Safari 6.1.3. Listen for incoming request on port on Linux, then run command I am after as lightweight as possible solution to listen on a port for a specific request, then run a command should the port be hit and the correct request be recedved.  Eg. Send a request to 192.168.0.10 on port 5432 with the string my_token. On the host (eg. 192.168.0.10), then run a command should that port be hit and the string matched.  I was initially thinking of using netstat (eg. nc -l 5000) then running the command on change. However, ideally a string or token of sorts would be ideal alongside this or similar, but without using a full-blown webserver - essentially something that can run in the background with few resources.