I would like to make horizontal lines at each side of some text. I tried to use \rule, but I want the total lenght (text + line) to be the same (and user defined) for several line-text, so the line lenght depends on the text lenght. Example :    Is there a package or a native LaTeX command to do the trick ?
I'd like to have a horizontal line extending from the end of the text on a line to the right margin. So far I've found \hrulefill and \leaders\hrule\hfill, but these draw a line that's flush with the baseline of my text — how can I get it to be vertically centered?
I thought I'd post this as it illustrates a problem often encountered on ELU.     In structures such as 'football manager', is 'football' a modifier or   a complement of the head noun?   I've seen both terms used as if there were only one possible correct answer. However, I've come across widely differing definitions of both 'modify' and 'complement' as used in grammar. I believe that people stating baldly that this is either one or the other are assuming a grammar that they prefer, rather than giving a balanced overview.  Notice that I intend this question to explore the usage/s of the term 'modify' and of the term 'complement' in this context. There may be overlap with the question of which word-class 'football' fits into, but that decision hardly answers the question. If $R$ is a local ring and $M$ and $N$ are finitely generated $R$-modules such that $M\otimes N=0$ then how does it follow from Nakayama's lemma that either $M=0$ or $N=0$?    This is an exercise in Atiyah and Macdonald. The part I could not show in the hints is $({M{\otimes}_R N)}_{k}=0$ implies $M_{k}{\otimes }_{k} N_{k}=0$, where $k=R/\mathfrak m$ and $\mathfrak m$ is the maximal ideal of $R$. I have a PDF that consists of several hundred pages of bilingual text. Since I need to use OCR on each language separately, I want to grab the even and odd pages and make two separate PDFs, using convert or ghostscript. The language I want to do first is on the odd-numbered pages. What convert or ghostscript command can I use to grab these and write them to a new file? As you can see from the image below, I have an issue with the text alignment of extra long chapter names. How can I fix it so that the text will not go further left than the start of the chapter name? That is, I don't want any text to be underneath the "Appendix A" part.  I added that red line just to show how I'd like it aligned, if possible.    Here's my MWE:  \documentclass{book} \let\cleardoublepage\clearpage  \RequirePackage{titletoc} \RequirePackage{tikz} \RequirePackage[explicit]{titlesec} \RequirePackage{DejaVuSansCondensed} \RequirePackage[normalem]{ulem} \RequirePackage[   left=2.25in,   right=0.75in,   top=1.25in,   bottom=1.25in,   marginparwidth=1.75in,   marginparsep=.25in,   asymmetric]{geometry}  \renewcommand*\familydefault{\sfdefault} % Set default font  %%% Table of Contents ---------------------------------------------------------- \setcounter{tocdepth}{1} % Show only Chapters and Sections  %%% Change font/color/layout of TOC \makeatletter \titlecontents{chapter}[-2em] {\color{cyan}\bfseries\LARGE\addvspace{3mm}} {\makebox[4.4em][r]{\@chapapp}\contentslabel{-0.25em}\hspace{1.9em}} {} {\hspace{3em}\contentspage} \g@addto@macro{\appendix}{%   \addtocontents{toc}{\protect\renewcommand*{\protect\@chapapp}{\protect\appendixname}}% } \makeatother  \titlecontents{section}[5.3em] {\color{cyan}\large\itshape\addvspace{3mm}} {\contentslabel{0em}\hspace{3.2em}} {} {\hspace{3em}\contentspage} [\addvspace{0mm}]  %%% Chapter Header ---------------------------------------------------------- \makeatletter \titleformat{\chapter}   {\normalfont\sffamily\Huge\scshape}   {}{0pt}   {\thispagestyle{empty}    % Remove page number on new chapters   %\setcounter{definition}{0}   \begin{tikzpicture}[remember picture,overlay]     \node[yshift=-3cm] at (current page.north west)       {\begin{tikzpicture}[remember picture, overlay]         \draw[fill=cyan] (0,-1) rectangle           (25cm,3cm);         \draw[fill=cyan] (0,-24) rectangle           (25cm,-25cm);         \ifttl@label% &lt;---------------------- Added condition on \ifttl@label           \node[anchor=west,xshift=.21\paperwidth,yshift=-.01\paperheight,rectangle]               {\color{white}\LARGE \MakeUppercase{\@chapapp} \Huge\thechapter};         \fi% &lt;------------------------------- end condition on \ifttl@label        \end{tikzpicture}       };    \end{tikzpicture}\endgraf   \vskip-.7cm   \color{cyan}\Huge\raggedright\leftskip-1cm    \noindent\MakeUppercase{#1}\endgraf   } \makeatother  \titlespacing*{\chapter}{0pt}{10pt}{0pt}{}  \titleformat{\section}{\color{cyan}\itshape\LARGE}{\llap{\thesection} #1}{1em}{}[\titleline{\color{cyan}\titlerule[1pt]}] \titleformat{\subsection}{\color{cyan}\normalfont\large}{\; #1}{1em}{}  \begin{document}   \tableofcontents   \chapter{Turing Machines}     \section{The Turing Machine}     \section{Variations of the Turing Machine}       %\subsection{Non-deterministic Turing Machines}     \section{The Church-Turing Thesis}   \chapter{Decidability}     \section{The Universal Turing Machine}    \appendix   \chapter{ON COMPUTABLE NUMBERS, WITH AN APPLICATION TO THE ENTSCHEIDUNGSPROBLEM} \end{document} For all infinite cardinals $\kappa, \ (\kappa \times \kappa, <_{cw}) \cong (\kappa, \in).$ I don't understand the proof to the a/m claim. How we know that $\eta &lt; \kappa$ and $(\alpha,\beta)&lt;_{cw} (0, \eta) $ and hence $h: \mu \to \eta \times \eta$ is injective? Appreciate if anyone could advise.  Here is an excerpt of the proof:  For an infinite ordinal $\kappa,$ the canonical well-ordering of $\kappa \times \kappa,$ denoted by $&lt;_{cw}$ is defined as follows: $(\alpha_1, \beta_1)&lt;_{cw} &lt; (\alpha_2, \beta_2)$ iff either one of the following holds.  $(1): \max\{\alpha_1,\beta_1\} &lt; \max\{\alpha_2,\beta_2\}$  $(2): \max\{\alpha_1,\beta_1\} =\max\{\alpha_2,\beta_2\}$ and $\alpha_1&lt;\alpha_2$   $(3): \max\{\alpha_1,\beta_1\} =\max\{\alpha_2,\beta_2\}$ and $\alpha_1 = \alpha_2$ and $\beta_1 &lt; \beta_2.$  Claim: For all infinite cardinals $\kappa, (\kappa \times \kappa, &lt;_{cw}) \cong (\kappa, \in).$  Proof: (It has been show that it is true for $\kappa = \omega$) Assume there is a counterexample  $\kappa.$ Let $A= \{\lambda \in \kappa + 1| \lambda\geq \omega \ is \ a \ cardinal \ and \ (\lambda \times \lambda, &lt;_{cw}) \not\cong (\lambda, \in)\}.$ Then, $\kappa \in A.$ Let $\mu$ be least element of $A.$ Thus, $\mu &gt; \omega$ and for all $\lambda,$ if $\omega \leq \lambda &lt; \mu$ and $\lambda$ is a cardinal, then $(\lambda \times \lambda, &lt;_{cw}) \cong (\lambda, \in).$  By Comparability theorem, $(\mu, \in)$ is isomorphic to initial segment of $(\mu \times \mu, &lt;_{cw})$ since $|\mu \times \mu| \geq \mu$ and $\mu$ is cardinal. Let $(\alpha, \beta) \in \mu \times \mu$ such that $(\mu, \in)$ is isomorphic to initial segment of $(\mu \times \mu, &lt;_{cw})$ given by $(\alpha, \beta).$ Let $h$ be the isomorphism. Let $\eta= \max\{\alpha, \beta\}+ \omega.$ Then $\eta &lt; \kappa$ and $(\alpha,\beta)&lt;_{cw} (0, \eta).$ HENCE, $h: \mu \to \eta \times \eta$ is injective. Why is the image of a smooth embedding $f: N \to M$ an embedded submanifold? I'm reading An Introduction to Manifolds (Tu) and got confused on p.123 Theorem 11.13. Let me briefly explain what was done before that.  The author defines an embedding between two manifolds $f: N\rightarrow M$ as an injective immersion (differential is injective everywhere) with the additional property that $f(N)$ as a subspace of $M$ is homeomorphic via $f$ to $N$. Then a canonical form theorem is proven, namely, that for any point $p \in N$, there are charts $(U,\phi = x^1, \ldots, x^n) \ni p$ and $(V,\psi = y^1, \ldots, y^m) \ni f(p)$, such that the transition map takes the following form:  $$\psi \circ f \circ \phi^{-1} : (r^1,\ldots,r^n) \mapsto (r^1,\ldots,r^n,0,\ldots,0).$$  (I guess it is implicitly assumed that $f(U) \subset V$).  Now in the process of proving that $f(N) \subset M$ is an , he states that $f(U) \subset V$ is defined by the vanishing of the coordinates $y^{n+1},\ldots,y^m$. I can prove that $$ f(U) \subset \{q \in V: y^{n+1}(q) = \cdots = y^m(q)\} $$ but not the reverse inclusion. Can anyone explain why this should be true? What is the formula for $\frac{1}{1\cdot 2}+\frac{1}{2\cdot 3}+\frac{1}{3\cdot 4}+\cdots +\frac{1}{n(n+1)}$ How can I find the formula for the following equation?  $$\frac{1}{1\cdot 2}+\frac{1}{2\cdot 3}+\frac{1}{3\cdot 4}+\cdots +\frac{1}{n(n+1)}$$  More importantly, how would you approach finding the formula? I have found that every time, the denominator number seems to go up by $n+2$, but that's about as far as I have been able to get:  $\frac12 + \frac16 + \frac1{12} + \frac1{20} + \frac1{30}...$ the denominator increases by $4,6,8,10,12,\ldots$ etc.  So how should I approach finding the formula? Thanks! How do I enable or disable the global application menu? C# Interfaces. Implicit implementation versus Explicit implementation What are the differences in implementing interfaces implicitly and explicitly in C#?  When should you use implicit and when should you use explicit?  Are there any pros and/or cons to one or the other?    Microsoft's official guidelines (from first edition ) states that using explicit implementations are not recommended, since it gives the code unexpected behaviour.  I think this guideline is very valid in a pre-IoC-time, when you don't pass things around as interfaces.  Could anyone touch on that aspect as well? What does it mean when a %CPU exceeds (# of cores) x 100%? Several responses to a question  suggested I try Opera kiosk mode, so I decided to download it and give it a try. Once the download had completed and the disk image was being verified, Safari hung for over a minute and there were periods where Safari used a very high %CPU:    In Mac OS X 10.5, I was accustomed to seeing Safari freeze, but it never used up more than 200% CPU (2 cores x 100%). Is this a bug in Activity Monitor? Or does this mean that %CPU is now more akin to ? There does not exist an entire function which satisfies $f({1\over n})={1\over 2^n}$, what I tried is if possible then define $g(z)=f(z)-{1\over 2^{1\over z}}$ Then $g({1\over n})=0$ and so $g(z)$ is entire and its $0$ set has limit point in it and so $f(z)={1\over 2^{1\over z}}$ which is not analytic at $0$? Please help!  Edit: OOps! the way I defined $g(z)$ that is not entire! could any one give me hint? I always wondered on what algorihm the best league of mine is chosen.    I am in the 0.16% of this quarter. That is rank 171 this quarter. But I am also ranked 113th this month.  Why is the stat for the quarter displayed when I have a better ranking in the month? Set up a scheduled job? I've been working on a web app using Django, and I'm curious if there is a way to schedule a job to run periodically.   Basically I just want to run through the database and make some calculations/updates on an automatic, regular basis, but I can't seem to find any documentation on doing this.  Does anyone know how to set this up?  To clarify:  I know I can set up a cron job to do this, but I'm curious if there is some feature in Django that provides this functionality.   I'd like people to be able to deploy this app themselves without having to do much config (preferably zero).  I've considered triggering these actions "retroactively" by simply checking if a job should have been run since the last time a request was sent to the site, but I'm hoping for something a bit cleaner. I'm trying to use the \citep command in Latex and my document class is elsarticle. The problem is that it displays numbers not authoryear citations in the text which is what I'm looking for. Here are related parts of my code:      \documentclass[preprint,11pt]{elsarticle}      \usepackage{natbib}   ...      \bibliographystyle{plainnat}      \bibliography{ML}   And I'm obviously using the \citep command like this:      I once read \citep{edelman1993magnetic}   And my .bib file looks like this:  @article{wolf2009regional, title={Regional brain activation changes and abnormal functional connectivity of the         ventrolateral prefrontal cortex during working memory processing in adults with attention-deficit/hyperactivity disorder}, author={Wolf, Robert C and Plichta, Michael M and Sambataro, Fabio and Fallgatter,     Andreas J and Jacob, Christian and Lesch, Klaus-Peter and Herrmann, Martin J and     Sch{\"o}nfeldt-Lecuona, Carlos and Connemann, Bernhard J and Gr{\"o}n, Georg and others}, journal={Human brain mapping}, volume={30}, number={7}, pages={2252--2266}, year={2009}, publisher={Wiley Online Library} }   The result looks like:  I once read[1]   I'm looking for a result like this:  I once read(wolf., 2009)   Elsevier is actually looking for:  Text: All citations in the text should refer to:    Single author: the author's name (without initials, unless there is ambiguity) and the year of publication;  Two authors: both authors' names and the year of publication;  Three or more authors: first author's name followed by 'et al.' and the year of publication.    Thanks in advance Windows using too much RAM, how to diagnose resource hog I have 16GB of system RAM. On startup with no applications open except the task-manager Windows is using about 3gb of RAM. I looked in the processes tab, but nothing seems to be out of the ordinary. How can I find out why my Windows is using so much RAM.    all processes from all users      Reading from the poolmon it seems that my wireless broadcom driver is using about 0.4GB of of RAM. Even if I remove  it would still be using  2.6GB on start-up, which is still too much.      After reinstalling the wireless driver associated with the memory leak. I have a new screenshot and would like to confirm that it was indeed a memory leak. Visit the UK with Schengen tourist short-stay visa I'm Russian, and I have touristic  Schengen short stay visa. I want to know, can I stay for some period in UK without getting UK visa, or it is not possible (I heard about 36 hours free of visa staying or something like that) What do parentheses surrounding an object/function/class declaration mean? I'm new to both JavaScript and . In YUI library examples, you can find many uses of this construct:  (function() {     var Dom = YAHOO.util.Dom,     Event = YAHOO.util.Event,     layout = null,         ... })();   I think the last couple of parentheses are to execute the function just after the declaration.  ... But what about the previous set of parentheses surrounding the function declaration?  I think it is a matter of scope; that's to hide inside variables to outside functions and possibly global objects. Is it? More generally, what are the mechanics of those parentheses? How to create Custom Fields on Standard Objects in the package.xml How do I tell if matrices are similar? I have two $2\times 2$ matrices, $A$ and $B$, with the same determinant. I want to know if they are similar or not.  I solved this by using a matrix called $S$: $$\left(\begin{array}{cc} a&amp; b\\ c&amp; d \end{array}\right)$$ and its inverse in terms of $a$, $b$, $c$, and $d$, then showing that there was no solution to $A = SBS^{-1}$. That worked fine, but what will I do if I have $3\times 3$ or $9\times 9$ matrices? I can't possibly make system that complex and solve it.  How can I know if any two matrices represent the "same" linear transformation with different bases?  That is, how can I find $S$ that change of basis matrix?  I tried making $A$ and $B$ into linear transformations... but without the bases for the linear transformations I had no way of comparing them.  (I have read that similar matrices will have the same eigenvalues... and the same "trace" --but my class has not studied these yet. Also, it may be the case that some matrices with the same trace and eigenvalues are not similar so this will not solve my problem.)  I have one idea. Maybe if I look at the reduced col. and row echelon forms that will tell me something about the basis for the linear transformation? I'm not really certain how this would work though? Please help. How to find all the tables in MySQL with specific column names in them?