Okay, I am typesetting something where there is snippets from something that is typewritten and something that is a medieval manuscript. Naturally, I think it would be funny to mimic those looks. Here's what I have so far:   \documentclass{memoir} \usepackage[T1]{fontenc} \usepackage{aurical} \usepackage{mdframed} \definecolor{light-gray}{gray}{0.95}  % The environments  %% Typewriter page \newenvironment{ttenv} {\begin{mdframed}[innerleftmargin=1.5cm,innerrightmargin=1.5cm,innertopmargin=2em,backgroundcolor=light-gray]\ttfamily} {\vspace{2em}\par\end{mdframed}}  %% Ancient manuscript \newenvironment{sigsand} {\begin{mdframed}[innerleftmargin=1.5cm,innerrightmargin=1.5cm,innertopmargin=1em,backgroundcolor=light-gray]\Fontauri} {\vspace{2em}\par\end{mdframed}}  \begin{document}  \begin{ttenv} This is the faux typewriter page! \end{ttenv}  \begin{sigsand} This is the faux ancient manuscript page! \end{sigsand}  \end{document}   The results are not horrible:     ... but I sure feel they could be better. My questions are:    How can I make the writing was a bit uneven, especially for the "manuscript"? - How can I make the pages appear less flat?  How can I make the edges of the "papers" a little jagged, especially for the "manuscript" one?   I'm open for ideas, also!
[See  for more on this topic, as well as better illustrations of the final product.]  I have a document with a lot of short excerpts from another book scattered through it.  Putting frames around them looks a little too 'clean'. How can I get a 'torn page' type effect, to make it look as if the excerpt has been physically torn out of a book?  (I've occasionally seen this done in printed books, although I can't find an example right now.)  I'm not wedded to a very specific look here --  gives plenty of examples. But just to give this some frame of reference, here are some of the nicer ones:          (The strong colouration in this second example is a probably a little too distracting for actual use, although it might be interesting as an option. It's more the edge effect I'm interested in.)    Edit (again): I tried typesetting my text according to the updated versions of the answers below. Here are the results:    Or with interpolated shading:
How can I stop certain apps from appearing in the Dash? Assume two black holes in the most common size range, spiraling into each other until they merge. The event releases significant amounts of energy via gravitational waves, which warp the space-time.  If the distortion is powerful enough, it would get noticed in daily life, or perhaps even detected by the proprioceptors in the human body.  How close, as an order of magnitude estimate, would you have to be to the merger to perceive it like that, without any instrument? Printing pointers in C $\chi(G)+\chi(G')\leq n+1$ How to prove, that the sum of chromatic numbers of graph and it's complement is smaller then the number of vertices incremented by one?  $\chi(G)+\chi(G')\leq n+1$  The notes from my classes say to color the first graph using sequential algorithm with vertices ordered by their degrees (the ones with lowest appear first). We would get $k_1$ colors, then we color the graph $G'$ in the backwards order and get $k_2$ colors, and the sum $k_1+k_2$ in my notes is magically smaller than $n+1$, but I just don't see why... su command + authentication failure I am having problems with the su command. I know my password and I am typing it correctly but su indicates authentication failure.  So I checked on the internet and then went into recovery mode and changed my username's password to what I was entering before.  Even now entering the same password on su gives me authentication failure.  Please suggest what am I doing wrong?? what are all the open subgroups of $(\mathbb{R},+)$ How to escape quotes in shell? Point vs Pixel: What is the difference? What is the difference between points and pixels? Is "do something by date X" inclusive? \num{100000} prints 100 000  I want to have 1 00 000.  Question: How to set siunitx package to do the above?  Some more  \num{1000} => 1 000  \num{10000} => 10 000  \num{100000} => 1 00 000  \num{1000000} => 10 00 000  \documentclass[12pt]{article} \usepackage{siunitx} \sisetup{group-separator = {,}}  \begin{document}  \num{1000}  \num{10000}  \num{100000}  \num{1000000}  \num{10000000}  \num{100000000}  \num{1000000000}  \SI{1000000000}{m}  \end{document}   The exact rules are described on the :     The Indian Numbering System uses separators differently from the Arabic system; besides the three least significant digits of the integer part, a comma divides every two rather than every three digits. Proving that this function is continuous on $G\times G$ Java equivalent to PHP's preg_replace_callback Can I choose which records are copied in a Partial Copy sandbox? We have a partial copy sandbox that we're using for development and testing.  This is really helpful as some of our applications internally store Salesforce id's.  However, there is a limitation with the partial copy as it only brings in 10,000 records per object from the production environment.  Unfortunately some of the id's we internally store are not being brought down into our partial copy which causes errors.  The 10,000 records that it did copy over aren't needed; I realistically only need 1 or 2.  Is there any way I can achieve copying over a specific record from the production environment? Is there a standard for public key encrypting and signing short messages? Some systems, that operate over flaky bearers, need to send signed, encrypted messages that are entirely self contained - i.e. send a single 300 byte UDP rather than have a 10Kb, two-way, certificate conversation over TCP.  Assume the destination has a private key and already knows the source's public key, and the source has a private key and already knows the destination's public key.  Given this assumption, is there a standard for encrypting/signing a small, but arbitrary length, message?  (I'm well aware of the dangers of rolling my own encryption scheme.)  Would there be a minimum ciphertext size that is related to the public key size?  (I'm thinking plain PKI encryption for plaintexts shorter than the key, and a PKI encrypted AES key for longer plaintexts.) Expansion of $(1+\sqrt{2})^n$ I'm looking to implement a phase lock in an FPGA without using any external components (other than the ADC). For simplicity locking to a simple binary pulse is adequate. The frequency of the signals is ~0.1-1% of the clock. I can't use the onboard clock PLL's because they are typically:   Not configurable (set during synthesis). Jittery. Don't support the frequency I need.   I've been sorting through the literature and found a few binary phase locked loops. Most notable a "pulse steal" design that I can post a link to if desired. I have implemented and synthesized with some success, but its jitter and lock range was not as good as advertised. I've also had success using a external DVCO, but I would prefer if I can implement everything on chip.  A digital circuit design or even a hint in the right direction would be helpful (I've been banging my head against this for a while), a proven FPGA implementation would be wonderful but not expected.   ADDED 10-27-2010   The actual DPLL design that I used has a "Random Walk Filter" as the loop filter (not the "pulse steal" described earlier, going through my notes that didn't work to well), which then drives the clock pulses to the DCO. The lock-in range is set via divider in the DCO. The sensitivity of the loop is established by varying the length of the random walk.   The paper in which this is found is cited at the end of this post. After implementing parts of it myself, I found that it was actually already implemented on OpenCores, however it turns out that in the last few months the project was deleted but I have the Verilog files saved if anyone wants them.  Yamamoto, H.; Mori, S.; , "Performance of Binary Quantized All Digital Phase-Locked Loop with a New Class of Sequential Filter," Communications, IEEE Transactions on , vol.26, no.1, pp. 35- 45, Jan 1978  doi: 10.1109/TCOM.1978.1093972  URL: How to undelete notes on iPhone "Notes" app? iPhone has a default "Notes" app which allows us to store notes. Stored notes can be deleted by hitting the "Delete Note" button:    How do we recover a note that is accidentally deleted?  Is there anyway to undo the delete? I will soon buy a new iPhone. If I log in with my Apple ID in my new phone could I still access my Clash of Clans village without starting from scratch? What is a good book to learn number theory? Additive group contains exactly three elements of the set $\{p,p+q,pq,p^q,q^p\}$ Let $p$ and $q$ be distinct primes. There is a proper subgroup $J$ of the additive group of integers which contains exactly three elements of the set $\{p,p+q,pq,p^q,q^p\}$. Which three elements are in $J$?  I know the solution is $\{p,pq,p^q\}$. However I do not understand why. I thought $J$ can not even be a finite group. Maybe there is serious misunderstanding of the problem. Can anyone give me a hand? Thanks.