I' m looking at books that take the historical aproach (like  &quot;A Radical Approach to Real Analysis&quot; by David M. Bressoud does for calculus) but with all of the formalism. i.e most of the math should be there but also the history (the failures and the experiments) and the philosophy (justifications)  of the great thinkers/founders of the subject. Of course such a book would have to be enormous if it contained everything! so a curated connected path through major achivements with plenty of references for what's left out is also required. In short: something not for the layman but for someone that already has some exposure to the subject and needs some encompassing view of its devellopment . The level of the math could be at least of graduate engineer level.
I learned thermodynamics and the basics of statistical mechanics but I'd like to sit through a good advanced book/books. Mainly I just want it to be thorough and to include all the math. And of course, it's always good to give as much intuition about the material.  Some things I'd be happy if it includes (but again, it mostly just needs to be a clear book even if it doesn't contain these) are:   As much justifications for the postulates if possible, I'm very interested in reading more about how Liouville's theorem connects to the postulates. Have examples of calculating partition functions, hopefully not just the partition function for the ideal gas.
Do we have negative prime numbers?   $..., -7, -5, -3, -2, ...$ Move item to folder when added/edited (SP2013 or O365) How to move item to folder automatically when it has been added or edited in a library? The folder is in the same library. The correct folder will be defined by metadata. This should happen automatically when the item has been added or edited. The listitem Id should be preserved. No server-side code should be deployed.  Can this be done using workflows (SP2010/SP2013)? If not then what would be the other options? I'm looking for an idiom that is equivalent to the Portuguese:  Quem tudo quer, tudo perde. Who wants everything, loses everything.  It basically points out that being too ambitious will have bad consequences: not only does one not get what one's striving for, but one also ends up losing what one already had (and probably took for granted). This idiom should be usable in everyday speech. let $a,b,c$ be postive real numbers ,and such $$ab+bc+ac=3$$   show that   $$\dfrac{a^2}{a+2b^2}+\dfrac{b^2}{b+2c^2}+\dfrac{c^2}{c+2a^2}\ge 1$$   This problem is from Secrets In Inequalities volume 1  page 30,example 1.24. the comment.the  author this case is a bit more diffcult,But this author can't post solution.Thank you How to use exclamation marks in Minecraft commands? mod Distributive Law, factoring $\!\!\bmod\!\!:$ $\ ab\bmod ac = a(b\bmod c)$ I stumbled across this problem  Find $\,10^{\large 5^{102}}$ modulo $35$, i.e. the remainder left after it is divided by $35$  Beginning, we try to find a simplification for $10$ to get: $$10 \equiv 3 \text{ mod } 7\\ 10^2 \equiv 2 \text{ mod } 7 \\ 10^3 \equiv 6 \text{ mod } 7$$ As these problems are meant to be done without a calculator, calculating this further is cumbersome. The solution, however, states that since $35 = 5 \cdot 7$, then we only need to find $10^{5^{102}} \text{ mod } 7$. I can see (not immediately) the logic behind this. Basically, since $10^k$ is always divisible by $5$ for any sensical $k$, then: $$10^k - r = 5(7)k$$ But then it's not immediately obvious how/why the fact that $5$ divides $10^k$ helps in this case. My question is, is in general, if we have some mod system with $a^k \equiv r \text{ mod } m$ where $m$ can be decomposed into a product of numbers $a \times b \times c \ \times ...$, we only need to find the mod of those numbers where $a, b, c.....$ doesn't divides $a$? (And if this is the case why?) If this is not the case, then why/how is the solution justified in this specific instance? SQL Server equivalent to Oracle's CREATE OR REPLACE VIEW In Oracle, I can re-create a view with a single statement, as shown here:  CREATE OR REPLACE VIEW MY_VIEW AS SELECT SOME_FIELD FROM SOME_TABLE WHERE SOME_CONDITIONS   As the syntax implies, this will drop the old view and re-create it with whatever definition I've given.  Is there an equivalent in MSSQL (SQL Server 2005 or later) that will do the same thing? biblatex, biber, is it possible to \printbibliography between two years? With biblatex and Biber, is it possible to print all the bibliography (\printbibliography) from (let's say) 2003 to 2008 in one section? And then in another section print all the bibliography from 2009 to 2016? So essentially does margin collapsing occur when you don't set any margin or padding or border to a given div element? I am trying to plot the function 1/x^2 but the result is obviously wrong, here is how it looks like    here is the code  \begin{center}      \begin{tikzpicture}      \begin{axis}[      %xlabel=$x$,     %ylabel={$f(x) = x^2 - x +4$}   ]      \addplot[blue] {1/(x^2)};     \end{axis}     \end{tikzpicture} \end{center}   Any suggestions on how to fix this? We were taught that an independent clause must have a complete thought/idea.     This is the only mammal that can fly.     How can "This is the only mammal" be treated as an independent clause?            It was a grammar lesson and there was no context there. In this situation how can I decide that it is an independent clause? Though for sure, there should be an independent clause in a correct sentence, and the clause starting with 'that' is not independent. But by this way, I can't fit it with the rule that every independent clause must have a complete thought. A simple sentence must have an independent clause. If the sentence has no independent clause how we can call it a sentence? Can even two dependent clauses form a sentence? $1+x+\ldots+x^n$ perfect square Let $p$ be the polynomial $p(x)=1+x+\ldots+x^n$. For which couples $(a, n)\in\mathbb{N}^2$, $p(a)$ is a perfect square? I'm particularly interested in $p(3)$. Gimp: how to remove background noise/artifacts and enhance handwritten text I have a lots of scanned handwritten lecture notes (PDFormat) and I want to improve their readability (I have uploaded an example). In particular I'd like to remove the "squares" on the back. I would appreciate any advice you may have. Thanks in advance. Update 2014-04-17 04:47 UTC: Stable, with some odds and ends to clean up      The main MSO/MSE sites are stable, but there are plenty of corners left to sweep. For details, see:    Not all of them mind you, just Meta Stack Overflow into Meta Stack Exchange.  I'll have you know, factually, that we really did believe this would take place in six-to-eight weeks when it was , but we've finally got a tentative date established.  If things go according to plan, we'll begin the operation shortly after 8:30 PM EDT on the 16th, completing everything within a few hour window. Ideally, all service disrupting endeavors will be completed within the first hour, which include:   The availability of Meta Stack Overflow The availability of Stack Overflow (more on this shortly) The availability of Chat on Meta Stack Overflow   As you know, we'll be bolting on a standard issue per-site meta on Stack Overflow, while breaking the link between what will have become Meta Stack Exchange and Stack Overflow. There's some irritable innards in that particular region, so we'll be asking folks to expect the unexpected during the maintenance window. Affected sites will be in and out of read-only mode, or quite possibly just down for maintenance while we're doing the actual break.  I'll be posting a system message on both Meta Stack Overflow as well as Stack Overflow itself 24 hours before we begin the actual work.   Did I say tentative in a six-to-eight-something time frame again? Why yes, I did - we're currently running some tests on the dev tier to simulate the split as closely as possible, so that we can better anticipate quirks that we need to address prior to actually doing it.  Once the sites have actually been stood up functionally on the production tier, we're going to get to work on finishing touches. This will include things like site settings (which determine bits of text you see in the question prompts, rep thresholds, etc) and all sorts of other fine tuning.  Once we're done:   Stack Overflow will have a blank, empty child meta site just like every other site The new Meta Stack Exchange will be up and running All rooms on Chat Meta Stack Overflow will be moved to Chat Meta Stack Exchange  I'll send over about 150 - 200 questions from MSE to MSO, most of which will be tag or SO-specific feature related posts that got buried by the network stuff without resolution.   If the tentative date moves, I'll update this post with the new date. However, we do not anticipate this happening any later than Saturday, April 19 - in the case that we see down time we can't mitigate and need to do it on a weekend.  The ground work is basically done, we're finishing up sanity now with a great deal of confidence, and we're pretty certain that we'll hit between those dates, if not directly on the tentative 16th.  Questions? Kvetch? Anonymous confessions? Answer below, and I'll address each in comments. Teen fantasy book series about a world where people who showed creativity could learn magic, and were killed for it How do the Treasure Goblins work? Every once in a while I'll come across the sneaky devils and they always flee.  What determines when they flee (time, distance, etc.) and do I get better loot by killing them faster?  Is there anything else I should know in order to get the most out of the encounter?  EDIT: What I mean is: Is the final drop better based on how effectively I defeat them? What is the default order of records for a SELECT statement in MySQL? Suppose you have the following table and data:  create table t (     k int,     v int,     index k(k)     ) engine=memory;  insert into t (k, v) values (10, 1),        (10, 2),        (10, 3);   When issuing select * from t where k = 10 with no order by clause, how does MySQL sort the records by default? Determine $4$ specific digits in $34!$ Find the values of $a,b,c,d\in\mathbb{N}$ such that      $$ 34!=295232799cd9604140847618609643ab0000000 $$   My Attempt:  The factorial of $34$ contains a $3$, so the RHS must be divisible by  $3$. Similarly, it must be divisible by $7$, $11$, $13$, $19$ etc.  But I do not understand how can I calculate $a,b,c,d$ in this equation. How do the radian have a unit? XGBoost Loss function Approximation With Taylor Expansion As an example, take the objective function of the XGBoost model on the $t$'th iteration:  $$\mathcal{L}^{(t)}=\sum_{i=1}^n\ell(y_i,\hat{y}_i^{(t-1)}+f_t(\mathbf{x}_i))+\Omega(f_t)$$  where $\ell$ is the loss function, $f_t$ is the $t$'th tree output and $\Omega$ is the regularization. One of the (many) key steps for fast calculation is the approximation:  $$\mathcal{L}^{(t)}\approx \sum_{i=1}^n\ell(y_i,\hat{y}_i^{(t-1)})+g_tf_t(\mathbf{x}_i)+\frac{1}{2}h_if_t^2(\mathbf{x}_i)+\Omega(f_t),$$  where $g_i$ and $h_i$ are the first and second derivatives of the loss function.   What I'm asking for is convincing arguments to demystify why the above approximation works:  1) How does XGBoost with the above approximation compare to XGBoost with the full objective function? What potentially interesting, higher-order behavior is lost in the approximation?  2) It's a bit hard to visualize (and depends on the loss function) but, if the loss function has a large cubic component, then the approximation will likely fail. How is it that this doesn't cause problems for XGBoost?