I have this in references.bib ​  @online{sep,     author = "Barry W. Boehm",     title = "Seven Basic Principles of Software Engineering",     year = "2008",     url = "http://sunset.usc.edu/TECHRPTS/1983/usccse83-500/usccse83-500.pdf",     urldate = "2018-11-14" }   ​​ ​ Then I have this in the main .tex: ​  \usepackage[backend=biber,style=authoryear-ibid,sorting=ynt]{biblatex} \addbibresource{references.bib}  \begin{document}  \maketitle  \tableofcontents ​ \section{SE}  \parencite{sep}  \printbibliography  \end{document} ​   But this gives me an "undefined citation" error.  I'm using TeXmaker on to of MacTeX.
Running the minimal example  \documentclass{article} \usepackage{filecontents} \begin{filecontents*}{\jobname.bib} @ARTICLE{example,   author  = {Other, Anthony Norman},   title   = {Some things I did},   year    = {2014},   journal = {J.~Irrep. Res.},   volume  = {1},   number  = {1},   pages   = {1-10} } \end{filecontents*} \usepackage[backend=biber]{biblatex} \addbibresource{\jobname.bib} \begin{document} Hello\cite{example}. \printbibliography \end{document}   I get the warning There were undefined references.  I have read  and know that I need to run:   LaTeX Biber LaTeX   However, my editor is only set up to run BibTeX. How do I go about setting up my editor/IDE to be able to run Biber, and how do I run the LaTeX/Biber/LaTeX cycle?  Answers (sorted alphabetically by editor name)                    Answer guidelines   Each answer should be for one editor. If the editor is cross-platform, if possible give a single answer with notes covering the minor platform variations. Please edit the question to include new answers in the 'link list' Each answer should be 'stand alone', i.e. don't say 'It's almost the same as editor Y but ...' for the editor part Instructions for 'build tools' such as arara or latexmk are welcome but should explain how to set up the editor in question as not all editors allow simple addition of arbitrary tools
Clarification on Clausius Inequality Consider a heat reservoir which gains heat $Q$ irreversibly at temperature $T$ from the surroundings which is at temperature $T_0$. The entropy change of reservoir is then given by $\frac{Q}{T}$, while that of the surroundings is $-\frac{Q}{T_0}$.  My question is, how is this possible? According to the Clausius inequality, the entropy change of a irreversible process is greater than that due to heat transfer. Please help, thank you! For some reason, I have a server that if ssh into another server...you don't need to enter the  password.  How is this done? Can someone give me step by step instructions please? A proof by strong induction that $a_n\le3^n$ where $a_n=a_{n-1}+a_{n-2}+a_{n-3}$ I am not sure whether this is right. Can anyone verify, whether this proof is valid? Thanks!        Define a sequence $\{a_n\}_{n\ge0}$ as follows:   $$a_0=1,\qquad,a_1=3,\qquad,a_2=9,\qquad,a_n=a_{n-1}+a_{n-2}+a_{n-3}\text{ for }n\ge3.$$   Prove that for any positive integer $n$, $a_n\le3^n$.        Proof. Let $P(n)$: $a_n\le 3^n$, $n$ is a non-negative integer.      (i) Base case:         Consider when $n=0$. LHS$=a_0=1$, RHS=$3^0=1$ $\therefore$ LHS$\le$RHS, then $P(0)$ holds.   Consider when $n=1$. LHS$=a_1=3$, RHS=$3^1=3$ $\therefore$ LHS$\le$RHS, then $P(1)$ holds.   Consider when $n=1$. LHS$=a_2=9$, RHS=$3^2=9$ $\therefore$ LHS$\le$RHS, then $P(2)$ holds.         (ii) Inductive case:   Assume $P(i)$ is true for $0 \le i \le k$, $k\ge2$.      (iii) Inductive conclusion: Consider $n=k+1$.   $$ \begin{align*} \mathrm{LHS}=a_{k+1}&amp;=a_k+a_{k-1}+a_{k-2} \qquad\text{(by definition, since $k\ge 2$)}\\                     &amp;\le 3^k+3^{k-1}+3^{k-2} \qquad\text{(by Induction Hypothesis)}\\                     &amp;=3^k(3^{-1}+3^{-2}+3^{-3})\\                     &amp;=3^k\left(\frac13+\frac19+\frac1{27}\right)\\                     &amp;=\frac{13}{27} 3^k\\                     &amp;\le 3^{k+1} = \mathrm{RHS} \end{align*} $$   Therefore, by the Principle of Strong Induction, $P(n)$ is true for all non-negative positive integers $n$. How can I list the contents of a .zip folder in c#? Prove that $z^2 \equiv ab\pmod p$ is solvable if and only if both or neither of $x^2 \equiv a \pmod p$, $x^2 \equiv b \pmod p$ are solvable. Suppose the $p$ is an odd prime not dividing $ab$.  Prove that $z^2 \equiv ab \pmod p$ is solvable if and only if both or neither of $x^2\equiv a\pmod{p}$ and $x^2 \equiv b \pmod p$ are solvable. I have a very large codebase (read: thousands of modules) that has code shared across numerous projects that all run on different operating systems with different C++ compilers. Needless to say, maintaining the build process can be quite a chore.   There are several places in the codebase where it would clean up the code substantially if only there were a way to make the pre-processor ignore certain #includes if the file didn't exist in the current folder. Does anyone know a way to achieve that?  Presently, we use an #ifdef around the #include in the shared file, with a second project-specific file that #defines whether or not the #include exists in the project. This works, but it's ugly. People often forget to properly update the definitions when they add or remove files from the project. I've contemplated writing a pre-build tool to keep this file up to date, but if there's a platform-independent way to do this with the preprocessor I'd much rather do it that way instead. Any ideas? Can the Hubble constant be measured locally? Shells have a useful feature where pressing the keyboard UP arrow replaces the contents of the current command line with the previous command that was entered. (And if you do it again, the command before that, and so on.)  I would like a similar feature, where pressing (some other button) replaces the contents of the current command line with the last line of output from the previous command (and if you do it again, the previous line of output , and so on.)  Is there any shell that provides a feature like this?  The motivation is that you often want to run a command, and then run another command with part of the previous commands's output as input. (No, I don't want to do anything involving piping the output of one command into the next. I'm looking for an interactive experience, where you run the first command, see its output, and then get a line of that output into your next command, without having to reach for the mouse to do a clumsy copy-and-paste.) What are the rules about take a bike on the London Tube? Can I take a bike on the Tube (underground) in London, if so how much does it cost? A story where technology is forbidden, but used by priests I am looking for a story I remember reading in the mid-90s. I can't remember if it was a trilogy or just a three part book, but I know it was in paperback book form. I also know it was found in the Young Adult section of the library at that time.  The general premise was that there had been some sort of war in the past and machines were outlawed. People visited priests who used magic. I remember that the main character discovers that the priest aren't using magic but are actually using machines.  I can also remember the main character ends up leaving the nation he is in and ends up in a neighboring nation where machines are allowed. I remember there being a scene where he watches a "movie" which I think was more like an old fashioned moving picture.  For some reason I keep wanting to tie this whole thing back to a sword, or blue sword, or something like that, but I might be mixing stories. Other things I keep linking to it: the character was in training to be a priest, he was forced to leave, he ended up using the neighboring nation to conquer his homeland. Again, still not sure if I am mixing things but they keep popping up.  I do know that it is not The Blue Sword by Robin McKinley, or its prequel, The Hero and the Crown. I updated the chrome to version 61, and the auto-scroll stopped working, it is necessary to scroll down the page manually. The problem does not occur in the previous version or in firefox.  Also, the reply icon no longer working when the message replied to is not in the current chat page. (Middle click still works and opens the link in new tab.) Find a recurrence relation for the number of $n$-digit binary sequences with no pair of consecutive $1$s Find a recurrence relation for the number of $n$-digit binary sequences with no pair of consecutive $1$s.  I know my base case:$$a_1 = 2$$ for either $1$ or $0$. Normally to construct the recurrent relation I would say fill in $n-1$ spaces then add a $1$ or $0$, which is simply:$$a_n = 2\cdot a_{n-1}$$However, I don't believe this is right, because this doesn't take into account that there can't be any consecutive $1$s.  Even when I use the base case of $2$ digits:$$a_2 = 3$$for either $01$, $10$, or $00$, I still get the recurrence relation of:$$a_n = 3\cdot a_{n-2}$$which also does not account for $01$ and $10$ occurring consecutively.   So how would I express this? Prove there are k consecutive non-squarefree integers So, I've got a question for class that asks me to prove the existence of arbitrarily long runs of consecutive integers where $\mu(n)$ is zero.   I've started the proof, but I need a bit of help midway through.  Assume there exists a run of length n, which we currently assume is the longest possible chain.  If we induct on n, we can assume there is a run of the form $m_1p_1^2, m_2p_2^2, ..., m_np_n^2$ (where each of the $p_i$ are prime).  If I add $M =  lcm(m_1p_1^2, m_2p_2^2, ..., m_np_n^2)$ to each number, I get another run of length n.  So here's where the issue starts. When I talked to my advisor about it, he referenced a theorem where there exists a prime $p$ congruent to $1\ mod\ M$.  I am unfamiliar with this theorem, so I'm not sure how to use this information. Any chance I can get some help? Or else is there a simpler way to go about this problem? heredoc for Windows batch? Why can't I install iOS 9.3? I saw an update for my iOS 9.2.1 device to iOS 9.3.  However, it said that the update cannot be verified, although it was downloaded.  I even deleted all data and applications from the device, but I still cannot update the device to 9.3; it just says "Your software is up to date" on iOS 9.2.1.  Can you force an update to 9.3? Formatting Keyboard Shortcuts for Comments LCM is associative: $\ \text{lcm}(\text{lcm}(a,b),c)=\text{lcm}(a,\text{lcm}(b,c))$ Definition: The least common multiple of $a.b\in\Bbb{Z}$ is the smallest  $k\in\Bbb{N}$ that is divisible by both a and b.         Proposition: $\text{lcm}(\text{lcm}(a,b),c)=\text{lcm}(a,\text{lcm}(b,c))\tag{2}$    Proof: We want to show $\text{lcm}(\text{lcm}(a,b),c)\mid\text{lcm}(a,\text{lcm}(b,c))$ and $\text{lcm}(a,\text{lcm}(b,c))\mid \text{lcm}(\text{lcm}(a,b),c)$ such that $\text{lcm}(\text{lcm}(a,b),c)=\text{lcm}(a,\text{lcm}(b,c))$.  Let $k=\text{lcm}(\text{lcm}(a,b),c)$, then $c\mid k$ and $\text{lcm}(a,b)\mid k$, but if we let $l=\text{lcm}(a,b)$, then $a\mid l\,\,\text{and}\,\, b\mid l$. Therefore $c\mid k\,\,,a\mid k\,\,\text{and}\,\, b\mid k$, but then $\text{lcm}(b,c)\mid k$. Thus $\text{lcm}(a,\text{lcm}(b,c))\mid k$      Question: Does this makes sense, ifso can I do the same for $\text{lcm}(\text{lcm}(a,b),c)\mid \text{lcm}(a,\text{lcm}(b,c))$? Let $A$ and $B$ be two $n \times n$ symmetric and positive definite matrices.   If $A \prec B$, then is it true that $B^{-1} \prec A^{-1}$?  Here, $A \prec B$ means that $B-A$ is positive definite. Testing Classification on Oversampled Imbalance Data I am working on severely imbalanced data. In literature, several methods are used to re-balance the data using re-sampling (over- or under-sampling). Two good approaches are:   SMOTE: Synthetic Minority Over-sampling TEchnique () ADASYN: Adaptive Synthetic Sampling Approach for Imbalanced Learning ()   I have implemented ADASYN because its adaptive nature and ease to extension to multi-class problems.  My question is how to test the oversampled data produced by ADASYN (or any other oversampling methods). It is not clear in the mentioned two paper how they performed their experiments. There are two scenarios:  1- Oversample the whole dataset, then split it to training and testing sets (or cross validation).  2- After splitting the original dataset, perform oversampling on the training set only and test on the original data test set (could be performed with cross validation).  In the first case the results are much better than without oversampling, but I am concerned if there is overfitting. While in the second case the results are slightly better than without oversampling and much worse than the first case. But the concern with the second case is if all minority class samples goes to the testing set, then no benefit will be achieved with oversampling.  I am not sure if there are any other settings to test such data. Invariance of a maximally entangled state under unitary operation $U \otimes U^\dagger$