Is there any way to toggle it with i.e. osascript? I'm on Yosemite.
I would like to toggle the Do Not Disturb in the notification center with a keyboard shortcut.  I am using BetterTouchTool for some extra keyboard shortcuts but it does not support enabling/disabling the notifications in the default options.  It has an option for executing a terminal command so I'm asking here how to enable/disable Do Not Disturb from the terminal?  I found  and I tried to run the commands but it didn't seem to work.
Is $\mathbb{Z}[\sqrt{-7}]$ a UFD or not? Is $\mathbb{Z}[\sqrt{-7}]$ a UFD or not? I feel like there should be some easy example showing that it is not, but I can not think of one. How to interpret the margin of error in a poll? Recently the media reported on a political poll that stated that "46% of Republican voters in Mississippi think that interracial marriage should be illegal".  One example story (of many around the 'net) is this one from the NY Daily News: .  From that article:     A survey conducted last month shows 46% of GOP voters in the state   believe interracial marriage should be illegal - a plurality of the   people questioned   Given that I know many people in interracial marriages (including in my own family) I was motivated to track down the full story rather than fall to the obvious hysteria.  I located the press release on the poll from Public Policy Polling  (PDF)  which has:     46% of these hardcore Republican voters believe interracial marriage   should be illegal, while 40% think it should be legal. With Barbour   included, Huckabee gets more support (22%) from the former than the   latter (15%), as does Palin (13-6). The support for Bachmann (10-2),   Gingrich (13-8), and Pawlenty (4-1) works the opposite way.   And at the end of the first page they state:     PPP surveyed 400 usual Mississippi Republican primary voters from   March 24th to 27th. The survey’s margin of error is +/-4.9%.   Now what I don't understand is how to interpret the results especially the margin of error value.    From the raw numbers, 46% (~50%) of 400 voters is 200 voters who responded who think that interracial marriages should be illegal.  But from stats of Mississippi in the 2008 Federal election, McCain polled about 725,000 Republican votes (to Obamas 556,000). My gut feeling is that you can't extrapolate that 46% number to the other 724,600 Republican voters and still retain a 5% margin of error.  So is the media misrepresenting the numbers (really? the media would do that?!?!?!) Or are there statistics at work that I don't understand?  Thanks for your help! A generalized version of the second Borel-Cantelli lemma says     Theorem 5.3.2. Second Borel-Cantelli lemma, II. Let $\mathcal F_n, n \ge 0$ be a filtration   with $F_0 = \{\emptyset, \Omega\}$ and $A_n , n \ge 1$ a sequence of events with $A_n ∈ \mathcal F_n$ . Then   $$ \{A_n \,i.o.\} = \left\{\sum_{n \ge 1} P (A_n |\mathcal F_{n−1}) =\infty \right\}. $$   An exercise of this lemma is     Exercise 5.3.6. Show    $\sum_{n \ge 2} \mathbb P (A_n | \cap_{m=1}^{n−1} A_m^c ) = \infty$ implies $P (∩_{m \ge 1} A_m^c ) = 0$.   I think we can actually prove that $\cap_{m \ge 1} A_m^c = \emptyset$. My proof is like this: Let $B_n = \cup_{m = 1}^n A_n$. Let $\mathcal F_n = \sigma(A_1,\dots,A_n)$, which forms a filtration. It is easy to verify that $$ \mathbb P (A_n | B_{n-1}^c ) = \mathbb P (A_n | \mathcal F_{n-1})(\omega) $$ when $\omega \in B_{n-1}^c$.  Assume there exist $\omega \in \cap_{m \ge 1} A_m^c$. It follows from the previous lemma that $$ \omega \in \left\{\sum_{n \ge 1} P (A_n |\mathcal F_{n−1}) =\infty \right\} = \{A_n \,i.o.\}. $$ In other words, $\omega \in \cap_{m \ge 1} \cup_{n \ge m} A_n$, which contradicts $\omega \in \cap_{m \ge 1} A_m^c$.  Is this the right proof? Two seasonal periods in ARIMA using R I'm currently using R to predict a time series with these instructions:  X &lt;- ts(datas, frequency=24) X.arima &lt;- Arima(X, order=c(2,1,0), seasonal=c(1,1,1)) pred &lt;- predict(X.arima, n.ahead=24) plot.ts(pred$pred)   As you can see I've data each hour, and I chose the seasonal period of 24 (one day).  I would like to improve my forecasting using an additional seasonal period in order to include the seasonal component of the week (seasonal length of 7*24=168 data)  Is there any method for this? How do you do it?  UPDATE: I've read  (your) blog page, maybe can I use the external regressors to simulate a second seasonal period? How to automatically generate a stacktrace when my program crashes 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. Is there any option with 'ls' command that I see only the directories? Sometimes, I need to check only the directories not files. Is there any option with the command ls? Or is there any utility for doing that?  EDIT: I'm using Mac OS X, and ls -d gives me . even though I have directories. Proving there is a sequence convergent to a limit point of a set without axiom of countable choice? Often, we use a construction like this: Given a subset $ A $ of a metric space and its limit point $ a $, we know that for every $ \epsilon &gt; 0 $ there is another point $ x $  different from $ a $ such that $ d(x,a) &lt; \epsilon $. So for every natural $ n $ we let $ a_n $ be such a point within $ 1/n $ of $ a $, which gives us a sequence convergent to $ a $.  My question is, is the axiom of countable choice needed for this construction, or is it formally correct just in ZF? Why doesn't saturation current in the photoelectric effect depend on the frequency of light absorbed ny the metal emitter? It is stated as a problem in Spivak's Calculus and I can't wrap my head around it. p:commandbutton action doesn't work inside p:dialog How to make Illustrator not to lie about colors? How do I figure out what package something is in without resorting to Google? I often find myself wanting to install something, but I'm unsure of what package it's in. This is a very common occurrence for me:  $ make html sphinx-build -b djangohtml -d _build/doctrees   . _build/html make: sphinx-build: Command not found make: *** [html] Error 127  $ sudo apt-get install sphinx E: Unable to locate package sphinx  $ sudo apt-get install sphinx-build E: Unable to locate package sphinx-build   googles  $ sudo apt-get install python-sphinx   Is there a better way? looks like someone got happy with the CSS - you can now no longer tell what tab is active, e.g. answer tabs:        Even if you hover over an option - it wont show you what tab is currently selected - it only shows you what tab you are currently hovering over: Plotting solutions to NDSolve Data Dump of Attachments I am trying to do an export of approx 30,000 attachments in our Salesforce Org,  Would anyone have been through a similar exercise and can advise best practice or the best way / tool to do this?  Kind Regards  matt Do we really need a [source-code] tag? The  tag doesn't appear to be very useful.  It's used in a variety of ways (for reading, writing, showing, transforming, compiling, translating, obfuscating, obtaining, ... source code) on 1747 questions right now, and doesn't appear to be adding any classification value to the site.  Can we get rid of it? For $n\geq 3$ there exist $x,y\in S_n$ such that $x$ and $y$ have order $2$ and $xy$ has order $n$. Assume that $n\geq 3$. Let $S_n$ be the symmetric group with $n!$ elements. Prove that there exists $x$ and $y$ in $S_n$ such that $x$ and $y$ have order $2$ and $xy$ has order $n$.  For $n=3$, it is easy to see that $x=(1, 2)$ and $y=(1, 3)$ works. How to prove it for the general case? So I was playing around on Area 51 hoping for further news on the private beta for ebooks, and noticed that my avatar (a hand) was missing. Also the Area 51 has the old toolbar. So I looked at the flair page. The network flair has my hand, the Area 51 flair has a quilt. OK, so time to upload a new image, and WordPress -- WordPress -- I don't want to login to WordPress. Any idea what's up with that?  The following questions did not help, and have different causes and symptoms: Solving Keplerian two-body problem numerically? I'm trying to solve the two-body problem numerically, setting up G, m1 and m2 =1.0.  The masses are placed at the positions -10 and 10 respectively along the x-axis and gave them both 0 on the y-axis. I am having some real issue with the initial conditions fitting for a keplerian orbit with a given eccentricity (e=0.9)! Also how would the initial condition change for different mass ratios?