I looked at many posts about the use of latexmk, but wasn't able to find what to write in order to satisfy my requirements. Yet I'm sure it is possible, but my skills in Perl amounts to about nothing.  What I would like to do with a file, say mymainfile.tex:   make a format file including the static part of the preamble, named  mymainfile-xelatex.fmt if I use xelatex, and store it in the fmt/ subdirectory of the directory that contains mymainfile.tex (I can do that just with mylatexformat) regenerate the format if the (static part of the) preamble has changed (loading new packages, defining new commands or modifying existing commands).  Compiling mymainfile.tex with the customised format file.   The difficulty for me is point 2), and possibly point 1) — that is, not having to write a first macro to make the format, and the launching latexmk, but preferably that everything be done from latexmk.   Moreover I prefer not to write the static part of the preamble in a separate file, but keep it in mymainfile.tex as usual, and use the \endofdump command from the mylatexformat package  I use MiKTeX 2.9 on WinEdt 7.
I'm using latex on a small netbook, and with average-sized files (~150 pages at the moment) compilation is already pretty slow. So I am looking for every way to speed up the compilation.  In this search, I found  explaining how to "precompile a preamble", or, latexically-speaking, how to make a custom format file. That works fine enough.  But my preamble isn't as static as it should be, I keep adding or modifying definitions in there. To mix the two solutions, at the moment, I use a Makefile together with latexmk, the makefile handling the regeneration of the .fmt file if needed, and latexmk taking good care of the rest.  But I have two problems with this :   integration with emacs to compile the whole document when working on a single file (make needs to be called in the proper directory) latexmk doesn't recompile the file every time the preamble is modified, because it doesn't count as a dependency.   So I'd like to find a way to get rid of this Makefile, and get all the stuff done by latexmk.  I edited my .latexmkrc to include this :     pdflatex = 'pdflatex -fmt main %O %S';  add_input_ext('pdflatex','fmt');  add_cus_dep('tex', 'fmt', 1, 'compilepreamble'); sub compilepreamble {     print "Preamble compiling...\n";     $command = '&amp;.pdflatex ./fmt/preamble.tex\dump';     system("pdflatex -ini -jobname='$_[0]' '$command'"); };      But with this, if the file main.fmt is not present or if fmt/preamble.tex is updated, the main.fmt file won't be regenerated. Actually, in the first case, I get an error from pdflatex saying the it can't find main.fmt format file. So I understand latexmk doesn't even try to build main.fmt, it's probably not a problem in my custom dependency. However, I think I've added everything necessary for this to work.  So... Did I forget something? Is there a way round? Or is it a hopeless quest?
Removal of statistically significant intercept term increases $R^2$ in linear model In a simple linear model with a single explanatory variable,  $\alpha_i = \beta_0 + \beta_1 \delta_i + \epsilon_i$  I find that removing the intercept term improves the fit greatly (value of $R^2$ goes from 0.3 to 0.9). However, the intercept term appears to be statistically significant.  With intercept:   Call: lm(formula = alpha ~ delta, data = cf)  Residuals:      Min       1Q   Median       3Q      Max  -0.72138 -0.15619 -0.03744  0.14189  0.70305   Coefficients:             Estimate Std. Error t value Pr(&gt;|t|)     (Intercept)  0.48408    0.05397    8.97   &lt;2e-16 *** delta        0.46112    0.04595   10.04   &lt;2e-16 *** --- Signif. codes:  0 ‘***’ 0.001 ‘**’ 0.01 ‘*’ 0.05 ‘.’ 0.1 ‘ ’ 1   Residual standard error: 0.2435 on 218 degrees of freedom Multiple R-squared: 0.316,    Adjusted R-squared: 0.3129  F-statistic: 100.7 on 1 and 218 DF,  p-value: &lt; 2.2e-16    Without intercept:   Call: lm(formula = alpha ~ 0 + delta, data = cf)  Residuals:      Min       1Q   Median       3Q      Max  -0.92474 -0.15021  0.05114  0.21078  0.85480   Coefficients:       Estimate Std. Error t value Pr(&gt;|t|)     delta  0.85374    0.01632   52.33   &lt;2e-16 *** --- Signif. codes:  0 ‘***’ 0.001 ‘**’ 0.01 ‘*’ 0.05 ‘.’ 0.1 ‘ ’ 1   Residual standard error: 0.2842 on 219 degrees of freedom Multiple R-squared: 0.9259,   Adjusted R-squared: 0.9256  F-statistic:  2738 on 1 and 219 DF,  p-value: &lt; 2.2e-16    How would you interpret these results? Should an intercept term be included in the model or not?  Edit  Here's the residual sums of squares:  RSS(with intercept) = 12.92305 RSS(without intercept) = 17.69277 Bijection between an open and a closed interval Recently, I answered to this problem:     Given $a&lt;b\in \mathbb{R}$, find explicitly a bijection $f(x)$ from   $]a,b[$ to $[a,b]$.   using an "iterative construction" (see below the rule).  My question is: is it possible to solve the problem finding a less exotic function?  I mean: I know such a bijection cannot be monotone, nor globally continuous; but my $f(x)$ has a lot of jumps... Hence, can one do without so many discontinuities?    W.l.o.g. assume $a=-1$ and $b=1$ (the general case can be handled by translation and rescaling). Let:  (1) $X_0:=]-1,-\frac{1}{2}] \cup [\frac{1}{2} ,1[$, and  (2) $f_0(x):=\begin{cases}     -x-\frac{3}{2} &amp;\text{, if } -1&lt;x\leq -\frac{1}{2} \\ -x+\frac{3}{2} &amp;\text{,     if } \frac{1}{2}\leq     x&lt;1\\ 0 &amp;\text{, otherwise} \end{cases}$,  so that the graph of $f_0(x)$ is made of two segments (parallel to the line $y=x$) and one segment laying on the $x$ axis; then define by induction:  (3) $X_{n+1}:=\frac{1}{2} X_n$, and  (4) $f_{n+1}(x):= \frac{1}{2} f_n(2 x)$  for $n\in \mathbb{N}$ (hence $X_n=\frac{1}{2^n} X_0$ and $f_n=\frac{1}{2^n} f_0(2^n x)$).  Then the function $f:]-1,1[\to \mathbb{R}$:  (5) $f(x):=\sum_{n=0}^{+\infty} f_n(x)$  is a bijection from $]-1,1[$ to $[-1,1]$.  Proof: i. First of all, note that $\{ X_n\}_{n\in \mathbb{N}}$ is a pairwise disjoint covering of $]-1,1[\setminus \{ 0\}$. Moreover the range of each $f_n(x)$ is $f_n(]-1,1[)=[-\frac{1}{2^n}, -\frac{1}{2^{n+1}}[\cup \{ 0\} \cup ]\frac{1}{2^{n+1}}, \frac{1}{2^n}]$.  ii. Let $x\in ]-1,1[$. If $x=0$, then $f(x)=0$ by (5). If $x\neq 0$, then there exists only one $\nu\in \mathbb{N}$ s.t. $x\in X_\nu$, hence $f(x)=f_\nu (x)$. Therefore $f(x)$ is well defined.  iii. By i and ii, $f(x)\lesseqgtr 0$ for $x\lesseqgtr 0$ and the range of $f(x)$ is:  $f(]-1,1[)=\bigcup_{n\in \mathbb{N}} f(]-1,1[) =[-1,1]$,  therefore $f(x)$ is surjective.  iv. On the other hand, if $x\neq y \in ]-1,1[$, then: if there exists $\nu \in \mathbb{N}$ s.t. $x,y\in X_\nu$, then $f(x)=f_\nu (x)\neq f_\nu (y)=f(y)$ (for $f_\nu (x)$ restrited to $X_\nu$ is injective); if $x\in X_\nu$ and $y\in X_\mu$, then $f(x)=f_\nu (x)\neq f_\mu(y)=f(y)$ (for the restriction of $f_\nu (x)$ to $X_\nu$ and of $f_\mu(x)$ to $X_\mu$ have disjoint ranges); finally if $x=0\neq y$, then $f(x)=0\neq f(y)$ (because of ii). Therefore $f(x)$ is injective, hence a bijection between $]-1,1[$ and $[-1,1]$. $\square$ Is there a difference between copy initialization and direct initialization? php loop through json array Isomorphism between complex numbers minus zero and unit circle How do we show that $\mathbb{C}^{\times}$ and $S^{1}$ are isomorphic as groups? How do I submit .jar file to the ubuntu software center I am writing an app using JAVA Swing for all platforms. After that I want to add this app to Ubuntu Software Center for free Is it possible?   My app is just one *.jar file, its helping to play card games.  I dont know Python language and saying the truth - dont want to learn it now.  What should I do to be able to submit my app? Composition of 2 involutions How can we prove that any bijection on any set is  a composition of 2 involutions ?  Since involutions are bijections mapping elements of a set to elements of the same set, I find it weird that this applies to any bijection.  Thanks for your help ! Git command to show which specific files are ignored by .gitignore I am getting my feet wet with Git and have the following issue:  My project source tree:  / | +--src/ +----refs/ +----... | +--vendor/ +----...   I have code (currently MEF) in my vendor branch that I will compile there and then move the references into /src/refs which is where the project picks them up from.  My issue is that I have my .gitignore set to ignore *.dll and *.pdb.  I can do a git add -f bar.dll to force the addition of the ignored file which is ok, the problem is I can not figure out to list what files exist that are ignored.  I want to list the ignored files to make sure that I don't forget to add them.  I have read the man page on git ls-files and can not make it work. It seems to me that git ls-files --exclude-standard -i should do what I want.  What am I missing? When mounting an NFS share manually using mount and a path of the form &lt;domain/ip&gt;:&lt;path&gt;/&lt;path&gt; or &lt;domain/ip&gt;:/&lt;path&gt;/&lt;path&gt;, umount fails to find the path in /proc/mounts, despite the fact that the path is in fact listed in /proc/mounts.  This is the same problem as in this question:   Steps to reproduce:  # mount --version mount from util-linux 2.24.1 (libmount 2.24.0: debug, assert) # mkdir mountpath # mount 192.168.2.101:/devices mountpath # umount mountpath /home/.../mountpath was not found in /proc/mounts # grep mountpath /proc/mounts 192.168.2.101://devices /home/.../mountpath nfs4 rw,[snip],addr=192.168.2.101 0 0   How can I unmount this mount? I installed Linux Mint in 2 partitions: / and /home  Windows 8 is under UEFI boot mode.  How to hide those linux partitions in Explorer?    When I click on them: Calculate limiting distribution of $\frac{\sum_{i=1}^n X_i}{\sum_{i=1}^n Y_i}$ Optimizer not choosing index union plan Why is the following query slow?  select count(*)   from [dbo].[mt_dispatch_link]     , [dbo].[_mt_dispatch] [_mt_dispatch]  where   (mt_dispatch_link.contract_id_1 = _mt_dispatch.contract_id       and mt_dispatch_link.dispatch_id_1 = _mt_dispatch.dispatch_id)     or   (mt_dispatch_link.contract_id_2 = _mt_dispatch.contract_id       and mt_dispatch_link.dispatch_id_2 = _mt_dispatch.dispatch_id)     It takes over 10 minutes, and then I tend to stop it at that point. My question is more about how to make sense of the query plan.  Looking at the query plan I can see that the bottom clustered index scan is returning about 250000 records, but the cost is 0% and it is being put into a temporary table.  The top index scan is about 25000 records.  But the cost of 95% comes from the nested join. What conclusions should I draw from this?  The above query plan shows two index scans, does that mean it is doing 25000 + 250000 index scans, or does it mean that it is doing 25000 * 250000 index scans?  If I change the query to this (adding FORCESEEK):  select count(*)   from [dbo].[mt_dispatch_link]     , [dbo].[_mt_dispatch] [_mt_dispatch]       WITH (FORCESEEK)  where   (mt_dispatch_link.contract_id_1 = _mt_dispatch.contract_id       and mt_dispatch_link.dispatch_id_1 = _mt_dispatch.dispatch_id)     or   (mt_dispatch_link.contract_id_2 = _mt_dispatch.contract_id       and mt_dispatch_link.dispatch_id_2 = _mt_dispatch.dispatch_id)   I end up with a much better plan and the query runs instantly:    I ran update statistics on both tables. Didn't fix it unfortunately. The table design is not very good, so I think SQL Server doesn't really understand and is thus coming up with a poor query plan. Some more info about the table design at .  Why is the query optimiser not coming up with the optimum plan? How do I get a vanilla GNOME after Ubuntu 17.04? Some people (me) would prefer the straight GNOME experience as opposed to the Unity style desktop offered in Ubuntu 17.10.  How can I get the standard GNOME desktop and interface? Regarding running Watir scripts for UI Automation from Jenkins CI - How to hook up Jenkins and watir-automations pain of browser back button Non in front of hyphenated adjective If one wishes to add "non" in front of a hyphenated adjective, should one add a hyphen after "non?" This question led to a new package:      I'm giving my students an old exam and barely remembered to change the date at the top. A colleague and I joked about how long we could reuse the same exam, and it made me wonder if I could use LaTeX to create an exam that looked like it was written in 1963 on a typewriter.  Here's what I'd like to see:   Typewriter font even in math mode. (Several ways to accomplish this; is there a "best" way?) Slight inconsistencies in the printing of each letter. I attempt this below adapting code taken from . Each word has a random vertical shift, though I'd like to see it reduced to each letter having its own vertical shift. Other typewriter-like irregularities would be great. It would be great if math-mode delimeters \left(, \right}, etc., can be created in a piece-meal fashion as they did in days of old. Fraction bars, tops of square-root symbols -- any horizontal line, really -- is made up of a series of en-dashes that don't quite match up.   Here is what I've come up with so far:  \documentclass[10pt]{article}% This is a document class providing more font size options \usepackage{graphicx} \usepackage{ifthen} \usepackage[textwidth=7.5in,textheight=9.5in]{geometry} \pagestyle{empty}  % thanks to Bruno Le Floch: https://tex.stackexchange.com/q/9331/4012 % and in his comments to https://tex.stackexchange.com/a/29458/4012 \usepackage[first=-1,last=1]{lcg}% you can play around with these values \makeatletter \newcommand{\globalrand}{\rand\global\cr@nd\cr@nd} \makeatother  \newcommand{\randomvshift}[1]{\globalrand\raisebox{\value{rand}pt}{#1}}  %%% thanks to Martin Scharrer: https://tex.stackexchange.com/q/11598/4012 \makeatletter \def\typewriter#1{%     \@typewriter#1 \@empty } \def\@typewriter#1 #2{%    \randomvshift{#1}\space    \ifx #2\@empty\else     \expandafter\@typewriter    \fi    #2% } \makeatother \begin{document}\tt  \typewriter{Math 101 Fall 1963}  \begin{enumerate} \item   \typewriter{$\frac{\texttt{d}}{\texttt{dx}}\texttt{(x)}^2$}  \item \typewriter{State the Fundamental Theorem of Calculus.}  \end{enumerate}  \end{document} wpa_supplicant store password as hash (WPA-EAP with phase2="auth=PAP") Is there a way to store my password in /etc/wpa_supplicant/wpa_supplicant.conf as some hash instead of plaintext?  By "password" I refer here to the password used for phase2 authentification. I do not refer to the Preshared Key (PSK) which could be hashed using wpa_passphrase.  For phase2 MSCHAPv2 or MSCHAP authentification I could store the password as MD4 hash using nt_password_hash (see example wpa_supplicant.conf line 659).  Is there any way to store my PAP password as hash?  Or: Is there a way to store the password in some sort of external storage? The example wpa_supplicant.conf suggests the use of such an external storage (using ext:????) but I could not find any documentation about it.  I am aware that storing the password as hash does not increase wifi security. But as the password MUST be the same as the password for other services (account management, subscriptions, payments ...) I don't want it to be stored as plaintext. I used MiKTeX 2.9 on windows. I have downloaded a package I want to install from the internet (manually, not through MiKTeX). The archive (*.lmza) containing the package was saved to a directory on my C:\ drive. Through MikTeX -> Maintenance -> Settings -> Packages -> Change... I can select the directory in which I have saved the archive containing the package. However, if I choose Packages shall be installed from a directory and choose the location of the package, I get this error message: C:\my\package\is\here does not seem to be a local package repository. What does it take for a directory/folder to become a local package repository? I would like to convert tab to spaces in gVim. I added the following line to my _vimrc:  set tabstop=2   It works to stop at two spaces but it still looks like one tab key is inserted (I tried to use the h key to count spaces afterwards).  I'm not sure what should I do to make gVim convert tabs to spaces?