I'm currently working on my Thesis in LaTex and have successfully used TexStudio (2.11.2) and MiKTeX (2.9.6069-x64) for two years now. Since a couple of days TexStudio always needs to be forced to save the File by holding down STRG+S for 3-4 seconds and when I compile my file any changes since that last forced save are not included but an older version of the Code is compiled.  I also noticed that everytime I compile the code a new copy of my .tex-file with an obscure file-ending is created (Base File is "Thesis.tex"; new Files are e.g. "Thesis.tex.if2720", "Thesis.tex.JC2720" et cetera).  Cutting almost all text from the file won't change anything, updating packages and completely wiping MiKTeX and TexStudio didn't help. Neither cutting  TexWorks does not suffer from the same problem.   Additional Information: The Files are saved inside a Dropbox-folder and I am using Windows File History for backup.   Has anyone encountered this issue before?
I need to compile between two and four times before I see changes I make in the editor (TeXstudio) and each time I compile, a new .tex file is created with random letters and numbers at the end.   For example, If I create the file hello.tex and compile two to four times I'll get the file,   hello.tex.QU6664      then I make some small changes in the editor and compile two to four times I'll get the additional file,   hello.tex.Ak6664   After continuing to do this (each time compiling between two to four times before I see the changes I made), I now have many files that look like  hello.tex.QU6664, hello.tex.Ak6664, hello.tex.YX6664, hello.tex.sN6664, hello.tex.Ss6664, ...   A little bit of additional information (in case it's relevant): Everything was working fine up until a few days ago, i.e. only needed to compile once and only the file hello.tex was created. I still only get one .aux,  .synctex and .pdf files. I use TeXstudio to write and compile. I don't think it has anything to do with the bibliography (I tried removing bibliography altogether and still having the same problem).  How do I prevent these additional files from appearing and only compiling once like I used to? Has anyone had a similar problem?
Evaluation of $\int_{0}^{1}\frac{x\ln (x)}{\sqrt{1-x^2}}dx$ Evaluation of $\displaystyle \int_{0}^{1}\frac{x\ln (x)}{\sqrt{1-x^2}}dx$   $\bf{My\; Try::}$ Let $\displaystyle I = \int_{0}^{1}\frac{x\ln x}{\sqrt{1-x^2}}dx\;,$ Put $x=\cos \phi\;,$ Then $dx = -\sin \phi d\phi$  and Changing Limit, We get  $$\displaystyle I = -\int_{\frac{\pi}{2}}^{0}\cos \phi \cdot \ln(\cos \phi )d\phi = \int_{0}^{\frac{\pi}{2}} \ln(\cos \phi)\cdot \cos \phi d\phi$$  Now Using Integration by parts, We get  $$\displaystyle I = \left[\ln(\cos \phi)\cdot \sin \phi\right]_{0}^{\frac{\pi}{2}}+\int_{0}^{\frac{\pi}{2}}\frac{\sin^2 \phi}{\cos \phi}d\phi$$  So $$\displaystyle I = \left[\ln(\cos \phi)\cdot \sin \phi\right]_{0}^{\frac{\pi}{2}}+\int_{0}^{\frac{\pi}{2}}\frac{(1-\cos^2 \phi)}{\cos \phi}d\phi$$  So $$\displaystyle I = \left[\ln(\cos \phi)\cdot \sin \phi\right]_{0}^{\frac{\pi}{2}}+\int_{0}^{\frac{\pi}{2}}\sec \phi d\phi-\int_{0}^{\frac{\pi}{2}}\cos \phi d\phi$$  So $$\displaystyle I = \left[\ln(\cos \phi)\cdot \sin \phi\right]_{0}^{\frac{\pi}{2}}+\left[\ln\left|\sec \phi+\tan \phi\right|\right]_{0}^{\frac{\pi}{2}}-\left[\sin \phi\right]_{0}^{\frac{\pi}{2}}$$  So $$\displaystyle I = \left[\ln(\cos \phi)\cdot \sin \phi\right]_{0}^{\frac{\pi}{2}}+\left[\ln\left|\sec \phi+\tan \phi\right|\right]_{0}^{\frac{\pi}{2}}-1$$  Now How can I solve after that, Help Required, Thanks Can you explain the "Axiom of choice" in simple terms? As I'm sure many of you do, I read the  webcomic regularly. The  involves a joke about the Axiom of Choice, which I didn't get.     I went to Wikipedia to see what the Axiom of Choice is, but as often happens with things like this, the Wikipedia entry is not in plain, simple, understandable language. Can someone give me a nice simple explanation of what this axiom is, and perhaps explain the XKCD joke as well? How do you get the index of the current iteration of a foreach loop? Is there some rare language construct I haven't encountered (like the few I've learned recently, some on Stack Overflow) in C# to get a value representing the current iteration of a foreach loop?  For instance, I currently do something like this depending on the circumstances:  int i = 0; foreach (Object o in collection) {     // ...     i++; } Get latest Flash player on Ubuntu Hi I would like to know whether the trace of the inverse of a symmetric positive definite matrix $\mathrm{trace}(S^{-1})$ is convex.  Actually I know that the trace of a symmetric positive definite matrix $S\in M_{m,m}$ is convex since we can find $B\in M_{n,m}$ such that $S=B^T\times B$ then we can write the trace as the sum of scalar quadratic forms, i.e. $\mathrm{trace}(S)=\mathrm{trace}(B^T\times B)=\sum_{j=1}^mb_j^T\times b_j$ where $b_j$ is the $j^{th}$ column of $B$.  for instance if we have  $trace([\begin{array}{cc} 1 &amp; 2  \\ 3 &amp; 4  \\ \end{array}] \times [\begin{array}{cc} 1 &amp; 3  \\ 2 &amp; 4  \\ \end{array}])= [\begin{array}{cc} 1 &amp; 2  \\ \end{array}]\times [\begin{array}{c} 1   \\ 2   \\ \end{array}]+ [\begin{array}{cc} 3 &amp; 4  \\ \end{array}]\times [\begin{array}{c} 3   \\ 4   \\ \end{array}]=30$  And so I wonder if $\mathrm{trace}(S^{-1})$ is convex too.. How are cellphone IP addresses assigned? What sort of waves are produced by tuning forks? Is it transverse, longitudinal or both? We often know tuning forks are used to to produce wave in various experiments that we do in lab. But the matter of concern is what sort of waves are produced by it? Is it transverse, longitudinal or both? Unable to start Oracle database We have an Oracle database, one data file (users tablespace) of the instance got corrupt and another data file (containing application data) was deleted due to some issue.  The database is in ARCHIVELOG mode, but we neither have data file backup of both data files nor the pertaining archive logs. Hence, I guess we cannot go ahead with the recovery of data files. I am unable to open the database as the data files are not available and face.   ORA-01589: must use RESETLOGS or NORESETLOGS option for database open    I am just able to STARTUP MOUNT the database  I wanted to ask if we can somehow we can open the database by taking both the tablespaces offline after STARTUP MOUNT the database instance. Or if there is any other way I can start the database.   There was a power issue and the  server got abruptly shutdown. When we tried to restart the database and found that we were facing ORA-01589: must use RESETLOGS or NORESETLOGS option for database open. On further analysis we found that 2 of datafiles were creating problem as one got corrupt other deleted as mentioned. As of now if I try to restart the database it says one datafile which belongs to users tablespace need recovery. I wanted to confirm as if we can start the instance by bringing the tablespace offline.  I tried:  SQL&gt; select open_mode from v$database;  OPEN_MODE ---------- MOUNTED  SQL&gt; alter database open resetlogs; alter database open resetlogs * ERROR at line 1: ORA-01194: file 1 needs more recovery to be consistent ORA-01110: data file 1: '/flowsystems/oradata02/flsta02/system01.dbf'   I don't have any archive logs. What are the criteria used to represent Stack Exchange sites on the sites page? (Grid view) I noticed that  has been changed, and by default sites are shown by balloons.  What is not clear to me is why some sites are shown with a bigger balloon than other sites. For example, WordPress Answers has less questions, answers and users than Programmers, but its balloon is bigger. What are the criteria used to show the sites on that page? How do I see the extensions loaded by PHP? Is it a bad practice to catch Throwable? custom button visibility list view I have addded a custom button to list views in the Contact object. I have multiple list views but I just need to show the custom button in some of the list views and it should be hidden in the remaining lists views.  Is this possible? Thanks! Prove that $\sum_{k=0}^n a_k x^k = 0$ has at least $1$ real root if $\sum_{k=0}^n \frac{a_k}{k+1} = 0$ Knowing that $$ \frac{a_0}{1} + \frac{a_1}{2} + \frac{a_2}{3} +\cdots + \frac{a_n}{n+1} =0$$ Prove that  $$ a_0 + a_1x + a_2x^2 + \cdots + a_nx^n = 0$$ has at least one real solution.  I suspect that it's proven with the intermediate value theorem. But can't find two numbers that satisfy it. If/When to move to secondary fermentation Digression from   What are the good rules of thumb for determining a. whether to use secondary fermentation at all and b. when to move from primary to secondary.  Preferably any rule of thumb should have both chemical and anecdotal rationale supporting it. PSTricks error "Undefined control sequence  \c@lor@to@ps" I have a problem with this file tex:  \begin{document} \begin{figure} \begin{center} \begin{pspicture}(0,0)(1,3.8) \psline{-&lt;}(0,0)(0,.2) \psline{-}(0,.2)(0,.4) \psline{*-&gt;}(0,.4)(0,.9) \psline{-*}(0,.9)(0,1.4) \psline{-&lt;}(0,1.4)(0,2.4) \psline{-}(0,2.4)(0,3.4) \psline{*-}(0,3.4)(0,3.6) \psline{&gt;-}(0,3.6)(0,3.8) \rput(1,.4){$y=0$}%testo \rput(1,1.4){$y=1$} \rput(1,3.4){$y=3$} \end{pspicture} \end{center} \caption{} \end{figure} \end{document}   but I don't understand where is the error. Evaluate the limit of $\lim_{n\to\infty}\frac{1}{n^2}\left(\frac{2}{1}+\frac{9}{2}+\frac{64}{9}+\cdots+\frac{(n+1)^{n}}{n^{n-1}}\right)$ What is Skynet's ultimate goal after defeating the resistance? Is it stated in any expanded universe what Skynet's plans were after wiping out the Human race (assuming that was its plan)?  Maybe space travel to colonise different planets or something else entirely? Here's the question: Prove that $\lim_{n \to \infty} (\sqrt{n^2+n}-n) = \frac{1}{2}.$  Here's my attempt at a solution, but for some reason, the $N$ that I arrive at is incorrect (I ran a computer program to test my solution against some test cases, and it spits out an error). Can anyone spot the error for me?  $\left|\sqrt{n^2+n}-n-\frac{1}{2}\right| &lt; \epsilon$  $\Rightarrow \left|\frac{n}{\sqrt{n^2+n}+n} - \frac{1}{2}\right| &lt; \epsilon$  $\Rightarrow \frac{1}{2}-\frac{1}{\sqrt{1+\frac{1}{n}}+1} &lt; \epsilon$  $\Rightarrow \frac{1}{\sqrt{1+\frac{1}{n}}+1} &gt; \frac{1}{2} - \epsilon = \frac{1-2 \epsilon}{2}$  $\Rightarrow \frac{1}{\sqrt{1+\frac{1}{n}}} &gt; \frac{1-2 \epsilon}{2}$  $\Rightarrow \frac{1}{\sqrt{\frac{1}{n}}} &gt; \frac{1-2 \epsilon}{2}$  $\Rightarrow \sqrt{n} &gt; \frac{1-2 \epsilon}{2}$  $\Rightarrow n &gt; \frac{4 {\epsilon}^2-4 \epsilon +1}{4}$ How do I transition to SSL without affecting PageRank? Fitting an infinite collection of balls in an infinite dimensional unit ball Given an infinite dimensional normed linear space, how would one show that it is possible to fit an infinite collection of non-overlapping balls of radius $\frac{1}{4}$ in the unit ball?  I guess one can immediately reduce the problem to a normed linear space of countably infinite dimensions. The solution seems clear if the concept of orthogonality exists, but not every normed linear space has an inner product so it's not possible to apply something like Gram-Schmidt to produce an orthogonal basis. Is there any way around this, or there another approach that can be used?