(Win 8.1 Pro 64b on Intel i7)  All right, I have this fully-automated backup script running daily. However, it turns out, that one of the saved directories (consuming about 25% of the space,  and consequently, about the same portion of the total backup time) is modified quite rarely.  I'd now opt to save the directory in question just once weekly. Only that I am not able to figure out how to obtain the day of week in a .bat file.   (Of course, I could do what was done on a HP41C back in olden times and do calculations involving day of month, month of year, and year, but well, I think of it as plan B.)  Is there a way to load the day of week into a .bat variable in a somehow more efficient manner?
I want to run a daily incremental backup and append the day of the week to the file name so I end up with:  backup_mon.bak backup_tue.bak  etc.  Not really bothered about what exactly is appended - 0 - 6 is fine.  How do I go about this?
Is there anything in Objective-C similar to C# yield return Is it possible to change the color of a single bar when the bar plot is based on symbolic values? I am beginner in LaTeX, trying to use it for industrial documents. I wonder if there is a way to change the color of only one bar of the plot below, ie "TestDetails", to illustrate it is a local macro and not a LaTeX keyword. I have been trying to experiment with point meta, but could not find a way.  \documentclass{article} \usepackage{filecontents}  \usepackage{pgfplots}  \usepackage{pgfplotstable} \pgfplotsset{width=.95\textwidth, compat=newest}   \begin{document}  \begin{filecontents}{data.csv} {Occurences}, {keyword} 215, item 159, SI 134, subsubsection 106, TestDetails 58, caption \end{filecontents}  \pgfplotstableread[col sep=comma]{data.csv}{\datatable}  \begin{tikzpicture} \begin{axis}[ /pgf/number format/.cd,1000 sep={}, width=0.8\linewidth,height=6cm, xbar, xmin=30, xmax=250, xtick=\empty, enlarge x limits={value=0.1, upper}, enlarge y limits=0.1, ytick=data,  y dir=reverse, xlabel= {}, y tick label style={major tick length=0pt}, yticklabels from table={\datatable}{[index]1}, nodes near coords, nodes near coords align=horizontal, ] \addplot [draw,fill=blue!50]table[ y expr=\coordindex, x index=0]{\datatable}; \end{axis} \end{tikzpicture}  \end{document} Volume of an n-simplex It's rather tedious to show using Fubini's Theorem and induction on $n$ that the volume of the region $x_1+x_2+...+x_n \leq 1$ with $x_1,...,x_n$ nonnegative is $\frac{1}{n!}$.  Is there an easier way to see this? Let's say I have  on the board. He is a 2/2 that says:  Whenever another creature enters the battlefield under your control, creatures you control get +1/+1 until end of turn.  I play a . It says:  Put three 1/1 red Human creature tokens with haste onto the battlefield. Sacrifice those tokens at the beginning of the next end step.  The sacrifice portion is not important to this question. What is important is how these two cards interact with each other. Playing this card in my first main phase, assuming no counters or other shenanigans by my opponent, I will have my Commander and 3 tokens on the battlefield. What will happen in terms of the power/toughness of my tokens and Commander? Option A The tokens will be 1/1 each. They don't see each other come in at all. The Commander is 3/3, as one &quot;enter the battlefield&quot; trigger happens. Option B The tokens will be 1/1. They don't see each other come in at all, because they weren't on the battlefield to see any of the triggers. The Commander is 5/5, as he saw three &quot;enter the battlefield&quot; triggers occur. Option C The tokens will all be different, with one being 3/3 as he saw the other two come in, one being 2/2 as he saw only the last one come in, and 1/1 as the last one saw none come in. Option D The tokens will all be 4/4, as three creatures entered the battlefield this turn. I am obviously hoping for this option. It may be supported by a ruling on Goldnight Commander that says, emphasis mine:  The creature that entered the battlefield will also get +1/+1 until end of turn if it's still on the battlefield when the ability resolves.  The key being the ability resolving. So my thought is thus:  Thatcher Revolt goes on the stack. Thatcher Revolt resolves, and three separate &quot;enter the battlefield&quot; triggers go on the stack as the three humans enter the battlefield as 1/1. The last (it is a stack) &quot;etb&quot; trigger resolves. This puts an ability from Goldnight Commander on the stack. This resolves and the humans are now all 2/2. The next &quot;etb&quot; trigger resolves. This puts a new ability from Commander on the stack, and resolves with the humans being 3/3. The first &quot;etb&quot; trigger finally resolves, puts a Command ability on the stack, which resolves putting the humans at their final state of 4/4.  Option E The tokens will all be 2/2.  Thatcher Revolt goes on the stack. Thatcher Revolt resolves, and one single &quot;enter the battlefield&quot; trigger goes on the stack. The &quot;etb&quot; trigger resolves. This puts an ability from Goldnight Commander on the stack. This resolves and the humans are now all 2/2.  I would really like to have a complete understanding both of the result and how this result is calculated by the game engine. Prove that $A+I$ is invertible if $A$ is nilpotent Possible Duplicate:          Given $A^{2012}=0$ prove that $A+I$ is invertible and find an expression for $(A+I)^{-1}$ in terms of $A$. ($I$ is the identity matrix). A virtual file containing the concatenation of other files Is there a way of creating a filesystem object akin to this:  mknod files p cat file1 file2 ... fileN &gt; files   but such that it can be seeked in, as if it were a regular file? What's the projective limit of these polynomial rings ? Define an inverse system of polynomial rings over a commutative ring $k$ by the canonical projection $k[x_1,...,x_n] \to k[x_1,...,x_m]\;(m&lt; n)$.   Question: What is the projective limit $\varprojlim_n k[x_1,...,x_n]$ ? Reference book on measure theory I post this question with some personal specifications. I hope it does not overlap with old posted questions.  Recently I strongly feel that I have to review the knowledge of measure theory for the sake of starting my thesis.  I am not totally new with measure theory, since I have taken and past one course at the graduate level. Unfortunately, because the lecturer was not so good at teaching, I followed the course by self-study. Now I feel that all the knowledge has gone after the exam and still don’t have a clear overview on the structure of measure theory. And here come my specified requirements for a reference book.   I wish the book elaborates the proofs, since I will read it on my own again, sadly. And this is the most important criterion for the book. I wish the book covers most of the topics in measure theory. Although the topic of my thesis is on stochastic integration, I do want to review measure theory at a more general level, which means it could emphasize on both aspects of analysis and probability. If such a condition cannot be achieved, I'd like to more focus on probability. I wish the book could deal with convergences and uniform integrability carefully, as Chung’s probability book.    My expectation is after thorough reading, I could have strong background to start a thesis on stochastic integration at an analytic level.  Sorry for such a tedious question.  P.S: the textbook I used is Schilling’s book: measures, integrals and martingales. It is a pretty good textbook, but misprints really ruin the fun of reading. Do stone quarries respawn in Hearthfire? How do I keep my character centred on screen? Questions about proving $\lnot \lnot a = a$ This is all in the context of a Hilbert system with modus ponens $A, A\to B \vdash B$ and axioms:  Axiom $1$: $A \to (B \to A)$   Axiom $2$: $(A \to (B \to C)) \to ((A \to B) \to (A \to C))$   Axiom $3$: $(\lnot B \to \lnot A) \to (A \to B)$  So I tried to prove double-negation elimination by doing the following:  \begin{array}{ccc} 1 &amp; \{ \lnot \lnot a \} \vdash \lnot \lnot a &amp; \text{Premise}\\ 2 &amp; \{ \lnot \lnot a \} \vdash \lnot \lnot a \to (\lnot \lnot \lnot \lnot a \to \lnot \lnot a)  &amp; \text{ Axiom } 1\\ 3 &amp; \{ \lnot \lnot a \} \vdash \lnot \lnot \lnot \lnot a \to \lnot \lnot a  &amp; \text{ Modus Ponens } 1, 2\\ 4 &amp; \{ \lnot \lnot a \} \vdash (\lnot \lnot \lnot \lnot a \to \lnot \lnot a) \to (\lnot a \to \lnot \lnot \lnot a)  &amp; \text{ Axiom } 3\\ 5 &amp; \{ \lnot \lnot a \} \vdash \lnot a \to \lnot \lnot \lnot a  &amp; \text{ Modus Ponens } 3, 4\\ 6 &amp; \{ \lnot \lnot a \} \vdash (\lnot a \to \lnot \lnot \lnot a) \to (\lnot \lnot a \to  a)  &amp; \text{ Axiom } 3\\ 7 &amp; \{ \lnot \lnot a \} \vdash \lnot \lnot a \to  a  &amp; \text{ Modus Ponens } 5, 6\\ 8 &amp; \{ \lnot \lnot a \} \vdash a  &amp; \text{ Modus Ponens } 1, 7\\ 9 &amp; \vdash \lnot \lnot a \to a  &amp; \text{ Deduction Theorem } \\ \end{array}  And then I continued on, to prove double negation introduction:  \begin{array}{ccc} 10 &amp; \vdash \lnot \lnot \lnot a \to \lnot a &amp; \text{Double Negation Elimination}\\ 11 &amp; \vdash (\lnot\lnot \lnot a \to \lnot a) \to (a \to \lnot \lnot a) &amp; \text{ Axiom } 3\\ 12 &amp; \vdash a \to \lnot \lnot a &amp; \text{ Modus Ponens } 10, 11\\ \end{array}  My questions:   Am I allowed to invoke the deduction theorem in the middle of a proof like this (step $9$)? Is this considered a context change? Is context-changing allowed? Are the proofs even right/correct? Assuming it's all correct: Are we able to combine them to say that $a \to \lnot \lnot a$ and $\lnot \lnot a \to a$, therefore $a \iff \lnot \lnot a$ or is this symbol not allowed? What ultimately let us say $\lnot \lnot a = a$, the use of the equal sign here? How do I resolve "WILL_NOT_PERFORM" MS AD reply when trying to change password in scala w/ the unboundid LDAP SDK? Why are these estimates to the German tank problem different? Analysing Bounce Rate and Time on Page What is the "canary thread" and why is it starving? The following occasionally appears in /var/log/syslog:  rtkit-daemon[1145]: The canary thread is apparently starving. Taking action. rtkit-daemon[1145]: Demoting known real-time threads. rtkit-daemon[1145]: Successfully demoted thread 1431 of process 1368 (n/a). rtkit-daemon[1145]: Successfully demoted thread 1430 of process 1368 (n/a). rtkit-daemon[1145]: Successfully demoted thread 1368 of process 1368 (n/a). rtkit-daemon[1145]: Demoted 3 threads.   What's going on here? How many squares actually ARE in this picture? Is this a trick question with no right answer? This is one of those popular pictures on sites like Facebook. I always see a huge variation of answers such as $8, 9, 16, 17, 24, 28, 30, 40, 41, 52,$ etc., yet I've never seen a definitive answer on any website.    I counted $16$ whole squares ($4$ going down on left side, $4$ going down on right side, $8$ small squares in the centre). With this method the answer could also be $17$ if you want to count the entire shape as one big square.  I can also see the answer being $24$ if you count the smaller squares separately, as if they were floating above the main grid instead of intersecting with it.  Is there a right answer, or is it possible that there is no 'right' answer and it just depends on your counting method? This is similar to  but I want the iterate tool to run to collect all the values and only then continue to the merge. Any ideas? Currently it just runs the whole process for each file (which works but takes much longer than if the merge is done only once) or I have to manually break the collect-merge link, run the iterate, reconnect the collect-merge link and then continue running the model which is a pain as it is a lot of towers that need processing and this collect values-finish getting all values and then continue will be required in other models as well.    I tried the "Select Data" tool as well but this doesn't allow for wildcard searches like the Iterate does -my Iterate has the "_Graded*" as the search param as the gdb included many other files related to each tower chunk.  My STOP is set to "True" (tried false as well). I also tried to connect the Stop to the Iterate instead of Collect values but same result.  === SCRIPT ADDED  I just created a python tool for this and it collects all the values but it passes them back to the model as a long list -how can I get it to output in a proper format?      import sys, os, arcpy  GDB=arcpy.GetParameterAsText(0) Search=arcpy.GetParameterAsText(1) Type=arcpy.GetParameterAsText(2)  ##GDB=r'P:\2012\044_DM_Radio_Propogation\Working\Propogation\Propogation_28355.gdb' ##Search='_m' ##Type='Polygon'  path=os.path.dirname(GDB) arcpy.env.workspace = GDB List=[] for item in arcpy.ListFeatureClasses('*'+Search+'*',Type):     List.append(path+"\\"+item)     #arcpy.SetParameterAsText(3, item)  arcpy.SetParameterAsText(3, List) arcpy.AddMessage("List: "+str(List)) How do I find the amount of free space on my hard drive? Is there a way to quickly check the amount of free / used disk space in Ubuntu?  I would assume you could right click on 'file system' in the file browser and choose 'properties' or something but there is no such option. Where are some good places to find royalty free stock images? How do I invoke a Java method when given the method name as a string?