Preamble \usepackage[style=apa]{biblatex} \defbibheading{bibliography}[\bibname]{\section{#1}} \addbibresource{sources.bib} % replace this with your actual bibfile name \usepackage{csquotes}  Document \parencite{wikiparsing} \printbibliography  sources.bib @misc{wikiparsing, author = {Wikipedia}, title = {Parsing}, howpublished = {\url{https://en.wikipedia.org/wiki/Parsing}}, month = {}, year = {2020}, note = {Zuletzt aufgerufen am 13.06.2020} }  Log  Data structure  Comment I am using TexStudio as editor. Leistungsüberwachung This is BibTeX, Version 0.99d (TeX Live 2020/W32TeX) Capacity: max_strings=200000, hash_size=200000, hash_prime=170003 The top-level auxiliary file: cs_workshop.aux I found no \citation commands---while reading file cs_workshop.aux I found no \bibdata command---while reading file cs_workshop.aux I found no \bibstyle command---while reading file cs_workshop.aux You've used 0 entries,             0 wiz_defined-function locations,             83 strings with 496 characters, and the built_in function-call counts, 0 in all, are: = -- 0 &gt; -- 0 &lt; -- 0 + -- 0 - -- 0 * -- 0 := -- 0 add.period$ -- 0 call.type$ -- 0 change.case$ -- 0 chr.to.int$ -- 0 cite$ -- 0 duplicate$ -- 0 empty$ -- 0 format.name$ -- 0 if$ -- 0 int.to.chr$ -- 0 int.to.str$ -- 0 missing$ -- 0 newline$ -- 0 num.names$ -- 0 pop$ -- 0 preamble$ -- 0 purify$ -- 0 quote$ -- 0 skip$ -- 0 stack$ -- 0 substring$ -- 0 swap$ -- 0 text.length$ -- 0 text.prefix$ -- 0 top$ -- 0 type$ -- 0 warning$ -- 0 while$ -- 0 width$ -- 0 write$ -- 0 (There were 3 error messages)
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
Can long term sleeping at day damage your health? I've passed half or more of my life, sleeping in very late and often after the sun rises. Now I believe that I'm already feeling its effect. Some of my hormones are under the ideal levels and I have a deficiency in vitamin D.  What are the effects of sleeping during the day and not at night for work reasons or just habit? Is there any effect that can't be reversed simply by sleeping at night? (Assuming that you are sleeping enough time per day like 7-8 hours)  Could this sleep pattern be related to endocrine ills and other ills? What's the Linux equivalent to Windows batch files? I have a batch file which I use to create an .apk file on my Windows machine. Now I need to be able to create the .apk file in Ubuntu but I don't know how translate my .bat file to a script to be able to run it on Ubuntu.  Below is the batch file which works fine on Windows.  Will you please give me some hints on how I can run it on Ubuntu?  @echo off set PAUSE_ERRORS=0 :user_configuration  :: Path to Flex SDK  set FLEX_SDK=C:\sdk\flex_sdk_4.5.1.21328  :: Path to Android SDK set ANDROID_SDK=C:\sdk\android  :validation if not exist "%FLEX_SDK%\bin" goto flexsdk if not exist "%ANDROID_SDK%\platform-tools" goto androidsdk goto succeed  :validation if not exist "%FLEX_SDK%\bin" goto flexsdk if not exist "%ANDROID_SDK%\platform-tools" goto androidsdk goto succeed  :flexsdk echo. echo ERROR: incorrect path to Flex SDK echo. if %PAUSE_ERRORS%==1 pause exit  :androidsdk echo. echo ERROR: incorrect path to Android SDK in 'bat\SetupSDK.bat' echo.  if %PAUSE_ERRORS%==1 pause exit  :succeed set PATH=%PATH%;%FLEX_SDK%\bin set PATH=%PATH%;%ANDROID_SDK%\platform-tools  :: Android packaging set AND_CERT_NAME="PeymanApp" set AND_CERT_PASS=fd set AND_CERT_FILE=cert\SampleApp.p12 set AND_ICONS=icons/android  set AND_SIGNING_OPTIONS=-storetype pkcs12 -keystore "%AND_CERT_FILE%" -storepass     %AND_CERT_PASS%  :: Application descriptor set APP_XML=application.xml  :: Files to package set APP_DIR=bin set FILE_OR_DIR=-C %APP_DIR% .  :: Your application ID (must match &lt;id&gt; of Application descriptor) set APP_ID=air.com.doitflash.SampleApp  :: Output packages set DIST_PATH=dist set DIST_NAME=PeymanApp  :validation %SystemRoot%\System32\find /C "&lt;id&gt;%APP_ID%&lt;/id&gt;" "%APP_XML%" &gt; NUL if errorlevel 1 goto badid goto end_validation  :badid echo. echo ERROR: Application ID (APP_ID) does NOT match Application descriptor '%APP_XML%'     (id)  echo.  :end_validation  set TARGET= set PLATFORM=android  ::call bat\Packager.bat if "%PLATFORM%"=="android" goto android-config  :android-config set CERT_FILE=%AND_CERT_FILE% set SIGNING_OPTIONS=%AND_SIGNING_OPTIONS% set ICONS=%AND_ICONS% set DIST_EXT=apk set TYPE=apk goto start  :start if not exist "%CERT_FILE%" goto certificate :: Output file set FILE_OR_DIR=%FILE_OR_DIR% -C "%ICONS%" . if not exist "%DIST_PATH%" md "%DIST_PATH%" set OUTPUT=%DIST_PATH%\%DIST_NAME%%TARGET%.%DIST_EXT% :: Package  echo true echo. call adt -package -target %TYPE%%TARGET% %OPTIONS% %SIGNING_OPTIONS% "%OUTPUT%"     "%APP_XML%" %FILE_OR_DIR% -extdir lib/ echo. if errorlevel 1 goto failed goto end  :certificate echo Certificate not found: %CERT_FILE% echo.  if %PAUSE_ERRORS%==1 pause exit  :failed echo APK setup creation FAILED.  if %PAUSE_ERRORS%==1 pause exit  :end Linear mixed effect model interpretation with log transformed dependent variable I have a dataset in which the response variable is non normal, but on log transforming, it follows the normal distribution. I constructed a mixed effect model using lme4::lmer() as below (multiple measurements within each region), where A is a continuous variable and there are 7 regions  model&lt;-lmer(log(response)~A + (1|Region), data, REML=FALSE)   My output is   Linear mixed model fit by maximum likelihood . t-tests use Satterthwaite's method ['lmerModLmerTest'] Formula: logresponse ~ A + (1 | Region) Data: df[, -c(6)]   AIC      BIC   logLik deviance df.resid  151.8    159.8    -71.9    143.8       51   Scaled residuals:   Min       1Q   Median       3Q      Max  -2.24856 -0.63631  0.02206  0.59999  1.94895   Random effects: Groups   Name        Variance Std.Dev. Region   (Intercept) 0.8611   0.9280   Residual             0.5814   0.7625   Number of obs: 55, groups:  Region, 7  Fixed effects:               Estimate Std. Error        df t value Pr(&gt;|t|)   (Intercept) -1.112047   0.747373 19.651457  -1.488   0.1526    A           0.008585   0.004250 29.157266   2.020   0.0526 .  Correlation of Fixed Effects: (Intr) A -0.871   1) Would I infer that for A effects the response variable and the response increases by exp(0.008585) +/- exp(0.004250) (std error)? Would that be the right interpretation?  2) exp(Intercept) is not equal to the mean(log response). They are close but not equal. Why are they not equal and should I be concerned?   I know that this is a hard question to answer without knowing the dataset. So please suggest how I can improve the question. In $ \triangle ABC$ show that $ 1 \lt \cos A + \cos B + \cos C \le \frac 32$ In Python 2.5, the following code raises a TypeError:  &gt;&gt;&gt; class X:       def a(self):         print "a"  &gt;&gt;&gt; class Y(X):       def a(self):         super(Y,self).a()         print "b"  &gt;&gt;&gt; c = Y() &gt;&gt;&gt; c.a() Traceback (most recent call last):   File "&lt;stdin&gt;", line 1, in &lt;module&gt;   File "&lt;stdin&gt;", line 3, in a TypeError: super() argument 1 must be type, not classobj   If I replace the class X with class X(object), it will work. What's the explanation for this? Possible Duplicate:             Well, I remembered this after having Algebra II a year ago, is it possible that this is a valid proof that $1 = -1$?  $$ 1 = \sqrt{1} = \sqrt{-1\cdot-1} = \sqrt{-1} \cdot \sqrt{-1} = i \cdot i = i^2 = -1 $$  $$ \therefore 1 = -1 $$  So is this actually fully valid? Or can it be disproved? Reading file contents on the client-side in javascript in various browsers It always takes a  and money to find the next . Why is it so important to do this work and what is the application those numbers? Does eating infected flesh have an effect? I don't remember what actually happends when people eat infected flesh. I have in mind :  Gareth and the cannibals eating bitten Bob's leg in . It seems that the cannibals survive for a while after eating Bob's flesh and they seem OK.  The Saviors eating pigs that ate walkers in . We don't know for how long this process has been on, but  has his routine and looks used to doing that. Can we assume that Saviors are eating infected pig flesh for a while now ?  Does it have negative effect in long term ? Why is my bash prompt getting bugged when I browse the history? Often when I start looking at history of commands some of the characters from a command displayed aren't erased, for example:  What's happening:  prompt$ some_command prompt$ some_commanother_command   What should have happened:  prompt$ some_command prompt$ another_command   I can't erase those characters and bash ignores them when executing the command. They also disappear when a new prompt is being displayed (after pressing Enter for example).  I asked other people who work on Linux at my workplace and they said that they have that problem sometimes too, but they didn't have an idea on how solve that issue.  I have Ubuntu 11.10 and I'm using guake. Here is my PS1:  \e[0;31m\u \A ${PWD##*/}\e[0;32m$(parse_git_branch)\e[0;31m$\e[m   where parse_git_branch is  parse_git_branch () {     git name-rev HEAD 2&gt; /dev/null | sed 's#HEAD\ \(.*\)# (\1)#' }   As far as I know my colleagues have that problem even with less "fancy" PS1. Consider the space of continuously differentiable functions, $$C^1([a,b]) = \{f:[a,b]\rightarrow \mathbb{R}\mid f,f' \text{ are continuous}\}$$ with the $C^1$-norm $$\lVert f\rVert := \sup_{a\leq x\leq b}|f(x)|+\sup_{a\leq x\leq b}|f'(x)|.$$ Prove that $C^1([a,b])$ is a Banach Space.   This was the proof we were given: Assuming $C^1([a,b])$ is a normed linear space all we need to show is completeness. Let $(f_n)$ be a Cauchy Sequence in $C^1([a,b])$ with respect to the $C^1$-norm. Then each $f_n,f'_n\in (C([a,b]),\|\cdot\|_{\sup})$. We know that $C([a,b])$ is complete and thus there exists $f,g\in C([a,b])$ such that $f_n\rightarrow f$, and $f'_n\rightarrow g$ (uniformly) with respect to $\|\cdot\|_{\sup}$. If we let  $$ F_n(x) = \int_a^x f_n(t)dt, \hspace{2mm}  F(x) = \int_a^x f(t)dt $$ then $F_n\rightarrow F$ uniformly because  $$\lVert F_n-F\rVert_{\sup}\leq \sup_{a\leq x\leq b}\int_a^x|f_n(t)-f(t)|dt\leq \lVert f_n-f\rVert_{\sup}&lt;\epsilon.$$ From the fundamental theorem of calculus: $$f_n(x)-f_n(a) = \int_a^x f'_n(t)dt $$ Since $f'_n\rightarrow g$ uniformly then  $$ \int_a^xf'_n(t)dt\rightarrow \int_a^x g(t)dt $$ Since we know that $f_n\rightarrow f$ uniformly, $$f(x)-f(a) = \int_a^x g(t) dt $$ which by the fundamental theorem of calculues implies $f'=g$. So we know have $f_n\rightarrow f$ and $f'_n\rightarrow g=f'$ which mean $f_n\rightarrow f\in C^1([a,b])$ with respect to $C^1$-norm. So every cauchy sequence converges. Hence $C^1([a,b])$ is a Banach Space.   So I understand most of the proof. Where I get confused is that how did we actually show this satisfies the $C^1$-norm? Maybe I don't understand what this norm actually does.   Thank you for any help, comments and advice! Difference between "theoretical computer science" and (beta) "computer science" Possible Duplicate:          Title says it all. From what I can see, "theoretical computer science" questions seem to be slightly more isolated to discussing algorithms, whereas "computer science" seems to have questions that are slightly broader and higher-level. Is there any place on the Stack Exchange sites where they give a longer description?  I'm just curious as to what niche the beta "computer science" site is meant to fill, as I see many topics in both forums that overlap. I've tried to construct examples of rings that match all except one of the properties in the definition of a Dedekind domain. (This is an old number theory qual question from Berkeleys MGSA website).  The only starting point that I can think of would be  $R:=K[X_1,X_2,\ldots]$  for $K$ a field. This is clearly integrally closed as any polynomial relation is contained in $K(X_1,\ldots,X_n)$ for some large enough $n$ and $K[X_1,\ldots,X_n]$ is integrally closed being a UFD.  The problem is then to get rid of enough ideals from this ring $R$, so that its dimension would be 1, but I can't seem to figure out what to do.  Anyone have any other ideas for rings that could work as a starting point? The polynomial ring with an infinite number of variables is pretty much the only example that I know of for how to construct a non-noetherian ring that's still a domain. Is $2^\sqrt{2}$ irrational? Is it transcendental? Subspaces of separable normed spaces Let $X$ be a separable normed space. Is it true that every subspace is separable? If it was Hilbert space I would take the dense set and then their projections.  It sounds trivial but I cannot prove or disprove it...  Thank you. HTML escapes appearing in node titles on bespoke content type — substitutions? How to identify whether a file is normal file or directory Find all $n\in\mathbb N^+$ such that the sum of the digits of $5^n$ is equal to $2^n$.   I've solved this, but I think the proof is a bit weird and I wonder if there's a better one.    My proof:  We can see that $n\neq 1$, $n\neq 2$, $n=3$, $n\neq 4$ and $n\neq 5$.  Let $n&gt;5$. Notice that $5^6$ has $5$ digits, while $\frac{2^6}{9}=7\frac{1}{9}$, so $5^6$ has to have at least $8$ digits in order for the sum of the digits to be able to at least reach $2^6$.  Everytime $1$ is added to the exponent of $5$, the amount of digits $5^n$ gets is at most $1$, while $\frac{2^{n+1}}{9}-\frac{2^n}{9}=\frac{2^n}{9}&gt;3$, so the lowest amount of digits it has to have to reach $2^n$ becomes higher by at least $4$.  When $n=6$, the amount of digits $5^n$ has is already lower than the amount it has to have in order to reach $2^n$, and I've just proved that the amount it has to have in order to reach $2^n$ grows faster than the amount of digits $5^n$ has, therefore $5^n$ will never be able to reach $2^n$ when $n&gt;5$.  Hence the only solution is $n=3$. Updating to latest Blender version I currently have version 2.74. How do I update to version 2.76? I do not see any links in the UI to update my version of Blender Generate multiple PDFs for different document versions in a single build