Center both horizontally and vertically with variable size, maxing 1000px width/height;
Best way to center a  on a page vertically and horizontally?
Why is echo a shell built in command? $ which echo echo: shell built-in command. $ which ls /bin/ls $ which cat /bin/cat   Why is echo not an independent utility like ls, ps, cat etc? Why is it shell specific? Any good reasons? dist$(x,A)=0$ if and only if $x\in \overline{A}$ (closure of $A$) How do I remove an incomplete or broken snap installation of nextcloud on a Raspberry Pi? Casting nines and elevens in other bases (radix) and doing check sums for binary Which one should should I use? For some reason I have always used "towards", but I see some people saying "toward", like :     A great deal of his work in economic   theory has been directed toward   strengthening the foundations of our   understanding of central banking and   social insurance--indeed, one of my   most advanced macroeconomic classes   was nothing but a set of changes rung   upon a particular model that Peter   Diamond had advanced at...   Is there a difference between the two? When should they be used? In Nginx, how can I rewrite all http requests to https while maintaining sub-domain? I'm writing my thesis using MiKTeX and WinEdt 9 for Windows. I write the different chapters individually, and then I have a "masterfille" with the documentclass "report" where I use the command "input" to load the individual chapters. In other words there is only a preamble in the "masterfile".  I have a very general problem which is the following: No matter what kind of mistake I do whatsoever, I will first receive the correct error message, say I forgot to end a table or something (it really does not matter). If I correct this mistake and try to recompile without using the option "Erase Output Files" in Winedt, I will always and very quickly receive a new error message, often containing a mysterious "Undefined control sequence". Having to do this every time and to recompile plus run the Biber (L+B+L+L+D) is very time consuming, since the document is very large. Any ideas what the problem could be? Here is the preamble of my "masterfile" (I am probably including irrelevant information, sorry for that):   \documentclass[12]{report} \setcounter{tocdepth}{2} \usepackage{layout} \setlength{\voffset}{-0.75in} \setlength{\headsep}{5pt} \usepackage[utf8]{inputenc} \usepackage[english]{babel} \usepackage{csquotes} \usepackage{authblk} \usepackage [T1]{fontenc} \usepackage[backend=biber, style=authoryear-comp]{biblatex} \usepackage{xyling} \usepackage[super]{nth} \usepackage{xspace} \usepackage{cgloss4e} \usepackage{abstract} \usepackage{array} \usepackage{multirow} \usepackage{hyperref} \usepackage{xr} \usepackage{gb4e} \noautomath  \let\eachwordone\itshape   \makeatletter \pretocmd{\@footnotetext}{     \@noftnotefalse\setcounter{fnx}{0}%     \renewcommand{\thexnumi}{\roman{xnumi}}     }{}{} \apptocmd{\@footnotetext}{     \@noftnotetrue     \renewcommand{\thexnumi}{\arabic{xnumi}}     }{}{} \@ifpackageloaded{bidi}{% \pretocmd{\@LTRfootnotetext}{     \@noftnotefalse\setcounter{fnx}{0}%     \renewcommand{\thexnumi}{\roman{xnumi}}     }{}{} \apptocmd{\@LTRfootnotetext}{     \@noftnotetrue     \renewcommand{\thexnumi}{\arabic{xnumi}}     }{}{} } \makeatother     \addbibresource{ref.bib}    \title{The origins of Old Romance V2: A comparative study of Late Latin, Old French and Middle High German} \author{XXX} \date{\today}   \begin{document}  \tableofcontents   \chapter{Old French} \input{chapters/OldFrench2}  \printbibliography  \end{document} Performance differences between pipelines and process substitution I tend to use pipelines in my bash scripts over process substitution in most situations, especially in cases of using multiple sets of commands as it seems more readable to do ... | ... | ... over ... &lt; &lt;(... &lt; &lt;(...)).  I'm wondering though why using process substitution is much faster in some situations than using a pipeline.  To test this, I timed two scripts using 10000 iterations of the same attached commands with one using a pipeline and another using process substitution.  Scripts:  pipeline.bash:  for i in {1..10000}; do     echo foo bar |     while read; do         echo $REPLY &gt;/dev/null     done done   proc-sub.bash  for i in {1..10000}; do     while read; do         echo $REPLY &gt;/dev/null     done &lt; &lt;(echo foo bar) done   Results:  ~$ time ./pipeline.bash  real    0m17.678s user    0m14.666s sys     0m14.807s  ~$ time ./proc-sub.bash  real    0m8.479s user    0m4.649s sys     0m6.358s   I know that pipelines create a sub process whereas process substitution creates a named pipe or some file in /dev/fd, but am unclear about how those differences impact performance. How to print fields value in views-view.html.twig in drupal 8 How to print fields value in views-view.html.twig I have created a views-view.html.twig file for my view slider_3. The template name is 'views-view--slider_3.html.twig' The view formatting is done by this template, but I need a field is come at begging position of the view:  &lt;div class="slider-3-main"&gt;{{ rows.required_field }} &lt;div{{ attributes.addClass(classes) }}&gt;   {{ title_prefix }}   {% if title %}     {{ title }}   {% endif %}   {{ title_suffix }}    How can be the field will written to display at {{ rows.required_field }} If-else working, switch not How does PK know better than Jaggu? How can I check if share certificates I found have value? I have been clearing my parents flat and found share certificates from    P and O  European Ferries   Can I find out if they are still valid? If not, is there a market for them as collectibles or the like? Let $G$ be a group, possibly a singleton. Let $M$ be a set, possibly empty. Let $\mu: M \times G \to M$ be a right group action. Let $1_G$ be the identity of $G$.  I understand 's second definition of faithful as follows:     $\mu$ is faithful if for each $g \in G$ such that $g \ne 1_G$, there exists $x \in M$ such that $\mu(x,g) \ne x$. $\tag{1}$   Later  says if $\mu$ is free and $M$ is a non-empty set, then $\mu$ is faithful.  Question: Given the idea that we can have $M$ as an empty set, I would like to clarify: Are these correct?   If $G$ is a singleton, then every action $\mu$ is faithful, whether or not $M$ is empty. If $G$ is not a singleton, but $M$ is empty, then every action $\mu$ is not faithful. How can I quickly get a player back into a session after their character dies? As a GM, what kind of techniques could I use to help a player re-join the gaming session after their character dies? I want to avoid any major interruptions to the flow of the adventure. I would also like to avoid having to end the session immediately or making them sit on the side-lines for the rest of the session. Callback animation to begin only after ALL children have finished animating Generating values from a multivariate Gaussian distribution I am currently trying to simulate values of a $N$-dimensional random variable $X$ that has a multivariate normal distribution with mean vector $\mu = (\mu_1,...,\mu_N)^T$ and covariance matrix $S$.  I am hoping to use a procedure similar to the inverse CDF method, meaning that I want to first generate a $N$-dimensional uniform random variable $U$ and then plug that into the inverse CDF of this distribution, so to generate value $X$.  I am having issues because the procedure is not well documented and there are slight differences between the  and a .  In my case, I am also choosing the parameters of the distribution randomly. In particular, I generate each of the means, $\mu_i$, from a uniform distribution $U(20,40)$. I then build the covariance matrix $S$ using the following procedure:   Create a lower triangular matrix $L$ where $L(i,i) = 1$ for $i=1..N$ and $L(i,j)  = U(-1,1)$ for  $i &lt; j$ Let $S = LL^T$ where $L^T$ denotes the transpose of $L$.   This procedure allows me to ensure that $S$ is symmetric and positive definite. It also provides a lower triangular matrix $L$ so that $S = LL^T$, which I believe is required to generate values from the distribution.  Using the guidelines on Wikipedia, I should be able to generate values of $X$ using a $N$-dimensional uniform as follows:   $X = \mu + L * \Phi^{-1}(U)$   According to the MATLAB function however, this is typically done as:   $X = \mu + L^T * \Phi^{-1}(U)$   Where $\Phi^{-1}$ is the inverse CDF of a $N$-dimensional, separable, normal distribution, and the only difference between both methods is simply whether to use $L$ or $L^T$.  Is MATLAB or Wikipedia the way to go? Or are both wrong? I have a hard time formulating proofs.  For this problem, I  can see that if $n$ is equal to $8,$ this statement is true.  $(\mathbb{Z}/8\mathbb{Z})^{\times}$ includes elements:  $1,3,5,7$, and all of these are roots of $1-x^2 \pmod 8.$  And obviously $8$ divides $24.$  But how do I prove this without depending on number calculations and only using theorems?  Help Please?  I need a step by step walk through of how to do this proof and what theorems would be appropriate to use. Display historical characters "uͤ", "oͤ" and "aͤ"? Wubi with 14.10 doesn't work - failed to partition the selected disk I tried to install Ubuntu 14.10 on my computer with Wubi. The installation appeared to work in Windows, and told me to reboot.   After rebooting the Ubuntu installer continued the installation, until it stopped with an error message: Failed to partition the selected disk with the detail This probably happened because are too many primary partitions in the partition table. $\mathbb{R}$ with the lower limit topology is not second-countable I am trying to prove that $\mathbb{R}$ with the lower limit topology is not second-countable.  To do this, I'm trying to form an uncountable union $A$ of disjoint, half-open intervals of the form $[a, b)$, $a &lt; b$. Is this possible? I think this would imply the $A$ is open but no countable union of basis elements could coincide with $A$ therefore making the real numbers with the lower limit topology not second-countable.  I think there must exist something like $A$ described above but I am having trouble visualizing it and coming up with a formula to represent it.  Maybe there is some other way to show it is not second-countable.