Switched from natbib to biblatex, cannot find bib file I had a working file with a natbib setup, but I encoutered difficulties citing in a footnote and it seemed more broadly that biblatex was better for my field. So I switched, and now my .tex file just can't seem to find my .bib file. I have also floated back and forth between certain Biber and Bibtex settings. After four hours of googling I am waving my white flag and crawling desperately for your help.  Here is my preamble:  \documentclass[12pt]{article} \usepackage[utf8]{inputenc}  \usepackage{graphicx} \usepackage{setspace} \usepackage{fullpage} \usepackage{amsmath} \usepackage[style=authoryear]{biblatex} \addbibresource{bibston.bib} \usepackage{url} \usepackage{textcomp}   As for my errors, it tells me that all of my citations are undefined, and at the end it says:  Package biblatex Warning: Please (re)run Biber on the file: (biblatex) "International RBC" (biblatex) and rerun LaTeX afterwards. Package logreq Info: Writing requests to '"International RBC".run.xml'. \openout1 = `"International RBC.run.xml"'   Thank you so much for your help.  George
Biblatex with Biber: Configuring my editor to avoid undefined citations 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
Disable the activation of the menu bar when Alt is pressed in Windows 7 In Windows 7 how can I disable the function that activates the menu bar when Alt is pressed?  Are there some registry values to modify this behaviour? How can I get the Ubuntu shell on Windows 10 to recognize a connected android device? I'm trying to connect adb to my Android device in the Windows 10 Ubuntu shell, but it doesn't seem to be working:    adb does work normally on Windows, so it's not a problem with the phone or the connection.  Do I have to do something like mount the port in the Ubuntu shell?  How?  (The goal is to pass logcat to grep, which would obviously work better in Ubuntu.) Finding $\lim\limits_{x\to1^-}\Bigl(\prod\limits_{n=0}^{\infty}\Bigl(\frac{1+x^{n+1}}{1+x^n}\Bigr)^{x^n}\Bigr)$ Compute : $$L=\lim_{x\to 1^-} \left(\prod_{n=0}^{\infty} \left(\frac {1+x^{n+1}}{1+x^n}\right)^{x^n}\right)$$   My try:   Writing out the first few terms I noticed that the limit can be expressed as $$L=\lim_{x\to 1^-} \frac 12\left(\prod_{n=1}^{\infty} (1+x^n)^{x^{n-1} -x^n}\right)$$ $$L=\frac 12\lim_{x\to 1^-} \left(\prod_{n=1}^{\infty} (1+x^n)^{x^{n-1}}\right)^{1-x}$$  Converting to exponential form I get $$L=\frac 12 \exp {\left(\lim_{x\to 1^-} (1-x)\sum_{n=1}^{\infty} \left(x^{n-1}\ln(1+x^n)\right)\right)}$$  And got stuck here. I did try to use approximation $\ln x\sim x$ hereon to get final answer as $\frac {\sqrt e}{2}$ but I think it was improper to use approximation and hence I believe that the answer I got is flawed. I also noticed that the form I obtained is quite similar to be used for a Riemann Sum but I didn't get a way to tackle the problem using that way.  Can someone please help me with this problem.... SQL injection that gets around mysql_real_escape_string() How do I fix "Error C1033: cannot open program database"? I need to print an image at a certain size. What dimensions and resolution should I use? (This question is meant to be a resource to direct others to given that this is a common question.)  Given the task of creating an image that will be printed at a certain size, what pixel dimensions and resolution should I be setting my file at? Subjunctive mood: 'was' usage after 'I wish' and 'if only' had declared the sentence below as follow: 1) STAR TURN, 2) BEST LINES.      I wish Bernard Cribbins was my grandad. Perhaps he would be willing to   adopt?     Rattigan: “If only that was possible.” The Doctor: “If only that were   possible. Conditional clause.”    Is 'was' after 'I wish', 'if only' and 'if' (in conditional clauses) colloquial?  Does it be used in formal speech and writing? Elsevier article with APA references I'm writing an article for Elsevier Journal which follows APA6e references; everything is fine except that the article starts from page 2 leaving page 1 blank with just double hyphen (==) in the middle. Here is how I write.  \documentclass[preprint,12pt,authoryear]{elsarticle} \usepackage[natbibapa]{apacite} \usepackage{float} \usepackage{hyperref} \usepackage[ruled,vlined,commentsnumbered]{algorithm2e} \journal{Expert Systems with Applications}  \begin{document} \begin{frontmatter}  \bibliographystyle{apacite} \bibliography{myrefers}  \end{document}   How Can I rectify the problem? Finite Index of Subgroup of Subgroup Prove the following: If $H$ is a subgroup of finite index in a group $G$, and $K$ is a subgroup of $G$ containing $H$, then $K$ is of finite index in $G$ and $[G:H] = [G:K][K:H]$.  So this is basically a bijective proof? The number of cosets of $H$ in $G$ equals the number of cosets of $K$ in $G$ times the number of cosets of $H$ in $K$ by the multiplication principle?   Reference: Fraleigh p. 103  Question 10.35 in A First Course in Abstract Algebra How to customize the_archive_title()? How to achieve this 3D "Card" effect How do I create this type of effect with an image? I'm wondering how to get the thick edges and the tilted look. Is there an online tool that will convert a flat image to look like this? Proof of the Hockey-Stick Identity: $\sum\limits_{t=0}^n \binom tk = \binom{n+1}{k+1}$ After reading , the most popular answer use the identity $$\sum_{t=0}^n \binom{t}{k} = \binom{n+1}{k+1}.$$  What's the name of this identity? Is it the identity of the  modified.  How can we prove it? I tried by induction, but without success. Can we also prove it algebraically?  Thanks for your help.    EDIT 01 : This identity is known as the  because, on Pascal's triangle, when the addends represented in the summation and the sum itself are highlighted, a hockey-stick shape is revealed. In Iron Man 3,      When the real villain kidnapped the President of the United States,   it is never explained why none of the other Avengers came to help, or why Tony didn't call them. The only explanation so far is: "it was an Iron Man movie...", but an in universe answer would be good. The official Checkpoint out command line tool from CheckPoint, for setting up a SSL Network Extender VPN is not longer working from the Linux command line. It is also no longer actively supported by CheckPoint.  However, there is a promising  project, that tries to replicate the Java applet for authentication, that talks with the snx command line utility, called snxconnect.   I was trying to put snxconnect text utility to work in Debian Buster, doing:  sudo pip install snxvpn   and  export PYTHONHTTPSVERIFY=0 snxconnect -H checkpoint.hostname -U USER    However, it was mostly dying either with an HTTP error of:   HTTP/1.1 301 Moved Permanently:   or:  Got HTTP response: HTTP/1.1 302 Found   or:  Unexpected response, try again.   What to do about it?  PS. The EndPoint Security VPN official client is working well both in a Mac High Sierra and Windows 10 Pro. How to find and delete identical points? I recently performed  on a merged point feature class in ArcGIS 10.1.  I specified "1 meter" XY tolerance for the Integrate command.  The resulting point feature appears to be what I want except points that were integrated are now stacked on top of each other, which will be problematic in future processing steps.  The attributes for my dataset consist of an OID, Shape, x, y, z.  Where x and y = UTM coordinates and z = buffer distance.  The command  does not appear to work for my dataset (i.e based on Fields: OID, Shape, x, y, z and XY tolerance = 1m) as the output still has stacked points.  I am also working with big data--the integrate output has 37 million points.    There is a related thread, titled , although I would like to open the question up to python solutions too.  What is the best way to find and delete (spatially) duplicate points?  Is there a better solution to integrating such that the output does not contain overlapping points? I have seen many examples of how to render sprites from a spritesheet but I havent grasped why it is the most common way of dealing with sprites in 2d games.  I have started out with 2d sprite rendering in the few demo applications I've made by dealing with each animation frame for any given sprite type as its own texture - and this collection of textures is stored in a dictionary. This seems to work for me, and suits my workflow pretty well, as I tend to make my animations as gif/mng files and then extract the frames to individual pngs.  Is there a noticeable performance advantage to rendering from a single sheet rather than from individual textures? With modern hardware that is capable of drawing millions of polygons to the screen a hundred times a second, does it even matter for my 2d games which just deal with a few dozen 50x100px rectangles?  The implementation details of loading a texture into graphics memory and displaying it in XNA seems pretty abstracted. All I know is that textures are bound to the graphics device when they are loaded, then during the game loop, the textures get rendered in batches. So it's not clear to me whether my choice affects performance.  I suspect that there are some very good reasons most 2d game developers seem to be using them, I just don't understand why. When is it correct to use "yourself" and "myself" (versus "you" and "me")? How do I calculate the determinant of the following $n\times n$ matrices  $$\begin {bmatrix} 0 &amp; 1 &amp; \ldots &amp; 1 \\ 1 &amp; 0 &amp; \ldots &amp; 1 \\ \vdots &amp; \vdots &amp; \ddots &amp; \vdots \\ 1 &amp; 1 &amp; ... &amp; 0 \end {bmatrix}$$  and the same matrix but one of columns replaced only with $1$s?  In the  above matrix all off-diagonal elements are $1$ and diagonal elements are $0$. Problem aligning overlapping corner points in Illustrator I am drawing some overlapping paths in Illustrator. However, some anchor points of different paths do not align correctly, they create some rugged corners. I tried to manually adjust the points with the direct selection tool but it is difficult to handle the corners.  Can anyone help me to fix the corners in the red circles? How to detect if a mob has been hit in minecraft with command blocks? i am making a boss battle for my minecraft adventure map, and using a mob spawned with commands as the boss. When the mob gets hit, some command blocks will give the player a potion effect, but I can't figure out how to activate the command block when the mob gets hit. I am in the latest snapshot (16w03a). please help me (the person who answers my question will be given credit for it in my map)