What would be the most technically unaltered/numerically close camera-to-monitor workflow using common software?
What does an unprocessed RAW file look like?
The equivalence of sample correlation and R statistic for simple linear regression Is there a way to "auto login" in PuTTY with a password? Is there a way to configure a password for a stored session in ?  I know there is the capability to specify an "auto-login username" (under Connection/Data), but is there a way to do the same with the password? HTTP vs HTTPS performance Are there any major differences in performance between http and https?  I seem to recall reading that HTTPS can be a fifth as fast as HTTP.  Is this valid with the current generation webservers/browsers?  If so, are there any whitepapers to support it? TeXnicCenter & Adobe Reader DC I just read a book "Linear Algebra and Its Applications 4E" by David C. Lay. The book is (should be) LaTeX typeset. The matrix and equations are so nice, please see the following 3 examples:        It's so beautiful, so I want get the same effect inside my paper. Here is my code:   \usepackage{amsmath} \usepackage{colortbl} \newcommand\y{\cellcolor{clight2}} \definecolor{clight2}{RGB}{212, 237, 244}%  %%% \[A=\left[ \begin{array}{ccccc} \y 0 &amp; -3 &amp; -6 &amp; 4 &amp; 9 \\    -1 &amp; \y -2 &amp; -1 &amp; 3 &amp; 1 \\ -2 &amp; -3 &amp; 0 &amp; \y 3 &amp; -1 \\ 1 &amp; 4 &amp; 5 &amp; -9 &amp; -7      \end{array} \right]\]  \[A=\left[\begin{array}{cccccc} \rowcolor{clight2} 3 &amp; -9 &amp; 12 &amp; -9 &amp; 6 &amp; 15\\ 0 &amp; 2 &amp; -4 &amp; 4 &amp; 2 &amp; -6 \\ 0 &amp; 3 &amp; -6 &amp; 6 &amp; 4 &amp; -5 \end{array} \right]\]   And the result:     But how to add these arrows?? I understand test -n &lt;expression&gt; to return false if the expression evaluates to a string length of greater than 0.  Why then does the following happen?  Macbook:~ echo ${#undeclared_variable} 0 Macbook:~ test -n $undeclared_variable &amp;&amp; echo Foo Foo   Bash 4.x  My expectation is that since test -n $undeclared_variable should evaluate false, that Foo should not be echoed.  If I use [[  ]] instead of test, it works as expected. After I deleted my Ubuntu partition, I rebooted my computer and I only get a prompt:   grub rescue &gt;   The command ls lists   (hd0) (hd0,msdos5) (hd0,msdos3) (hd0,msdos2) (hd0,msdos1) (hd1) (hd1,msdos1)   I check them one by one:  ls (hd0,msdos5)/ ls (hd0,msdos1)/   But I cannot find the right partition. Highlight text in code listing while also keeping syntax highlighting I’m using the listings package for code listings. Now I try to highlight some part of the code using \hl from the soul package.  Here’s an example of a resulting query where the injected part of a SQL injection should be highlighted:  \begin{lstlisting}[escapechar=@,language=SQL] SELECT name, password FROM users WHERE name='@\hl{' UNION SELECT "10", 1 \#}@'; \end{lstlisting}   But inside the highlighted part the SQL syntax highlighting is not applied.  So I tried to use \lstlinline for the code part inside \hl as well but it didn’t work:  \begin{lstlisting}[escapechar=@,language=SQL] SELECT name, password FROM users WHERE name='@\hl{\lstinline[language=SQL]$' UNION SELECT "10", 1 #$}@'; \end{lstlisting}   Although this \lstinline part works outside the lstlisting block, it doesn’t work inside it. The error I get for that particular line is:     Extra }, or forgotten \endgroup.   Maybe I’m just missing just some special syntax to get this working. Or is it not possible at all to get proper syntax highlighting for the \hl-highlighted part as well? Javascript close alert box I want to be able to close an alert box automatically using Javascript after a certain amount of time or on a specific event (i.e. onkeypress).  From my research, it doesn't look like that's possible with the built-in alert() function.  Is there a way to override it and have control over the dialog box that it opens?  Also, I don't want an override that shows a hidden div as the alert.  I need an actual dialog box. BibTeX bibliography not printing I was unable to find a previous post about this - perhaps too simple? I just came across the BibTeX and am trying to use it with an EndNote library. I have exported to the .bib file (which looks good as far as I can tell), but no bibliography is printed and the references aren't being cited. Obviously there is something major missing.  My document looks as follows.  \documentclass[11pt, fceqn]{article} \usepackage{epsfig} \usepackage{setspace, titlesec, caption, floatrow}    \usepackage{amsmath, amssymb, amsfonts, amsthm, cite, mathtools, lineno, subfig, natbib}  \begin{document}   Some text \cite{Alo_1}.  \bibliography{bib} \bibliographystyle{plain}  \end{document}   Any thoughts would be greatly appreciated. Which spells or abilities are affected by things that care about targeting? Note: this is intended to be a canonical question about whether or not a spell or ability targets so there are multiple sub-questions.   Can Hexproof or Shroud save my creature from ? What about a  that was cast for it's Overload cost? Does shroud prevent me from using the Monstrosity ability of a creature, or from giving it more counters with Proliferate? Can I cast an Aura Enchantment on one of my creatures with Shroud, or an opponent's creature with Hexproof? Or can I use the Equip ability to attach an equipment to one of my creatures with Shroud? Will 's ability trigger when my opponent plays ? And will I have to sacrifice my  if my opponent casts ? Will Shroud or Hexproof prevent an opponent from choosing me with 's ability? Will Hexproof keep one of my creatures from being affected by ? If an Aura or Equipment is attached to a creature with Hexproof, does the Hexproof protect the attached permanent? I'm entering the world of Linux and at work I'm using grep more and more.  By doing that I'm figuring out that sometimes it's not adequate for what I want.  I was struggling with grep a few days ago and a colleague of mine who is a senior Linux admin, told me to use awk. I was stunned by how fast I got a result.  So my question is when do you choose to use one over the other? What questions can I ask myself before going to work with grep and spending a lot of time, when I could have done it with awk and saved time? How to clear the BIOS security password on this notebook? I recently got an Acer Aspire E11 (E3-112m) and in order to install another OS I had to set a Supervisor password, so I used a well known password to me, the problem is that such password contains a special character ! which the password prompt won't let me input, though it let me when I had to set the password (buggy prompt I believe). Now everytime I need to change something in the BIOS I have to fail 3 times and go to  to generate a master key.  I have already tried several different methods to clear it:   Removing the CMOS battery Looking for the reset jumper (which doesn't even exist).   I also noticed there were 2 weird buttons on the front and back sides of the motherboard, I don't know what they are for but I also pressed them (while both the CMOS and the regular battery were disconnected). All of this without luck, the password just won't reset (though the RTC did).  Are there other ways to reset the Supervisor/Admin password on this model? How to fight off Google Analytics referrer spammers? Last months I have lots of referrer spammers in my GA statistics. Their count is ~10x higher than count of legit visitors (my site is not very popular yet). I've turned on an option to hide known spammers in GA settings, but it didn't help at all. It seems these spammers are using scripts to spam directly to GA (i.e. they are not logged in my IIS).  Is there anything I can do to stop these spammers?    UPD 10 months later, and they started spamming using fake target page names... and Google is still doing nothing about it. How can I solve this quantum mechanical "paradox"? Option clash when using graphicx and tikz packages The following code fails Option clash for package graphicx, it seems to be an incompatibility between the package graphicx (when the option pdftex is used) and the package tikz.  \documentclass[a4paper,10pt]{book} \usepackage[T1]{fontenc} \usepackage[utf8x]{inputenc} \usepackage{tikz} \usepackage[pdftex]{graphicx}  \begin{document}      The lazy dog...  \end{document}   I am currently working with Debian wheezy (updated as of 10th November 2012), and the latest TeXLive LaTeX distribution included.  Any ideas? Why does Lang describe a field as a union and compositum of its subfields in this manner? I am reading Serge Lang's Algebra, revised 3rd edition, and on page 226, the author makes the following definitions and observations:   If $E,F \subset L$, the compositum of $E$ and $F$ in $L$ is defined to be the smallest subfield of $L$ containing both $E$ and $F$. It is denoted $EF$. If $k \subset E$ and $\alpha_1,\dots,\alpha_n \in E$, then $k(\alpha_1,\dots,\alpha_n)$ is defined to be the smallest subfield of $E$ containing $k$ and $\alpha_1,\dots,\alpha_n$. Observe that $$ E = \bigcup k(\alpha_1,\dots,\alpha_n), $$ where the union is taken over all finite families $\{ \alpha_1,\dots,\alpha_n \}$ of elements of $E$. The compositum of an arbitrary family of subfields of a field $L$ is defined as the smallest subfield of $L$ containing all fields in the family. $E$ is finitely generated over $k$ if there is a finite family $\{ \alpha_1,\dots,\alpha_n \}$ of elements of $E$ such that $E = k(\alpha_1,\dots,\alpha_n)$. Observe that $E$ is the compositum of all its finitely generated subfields over $k$.   My question is regarding the two observations (point nos. 3 and 6). It appears to me that it is enough to take union (and compositum) over all subfields generated by a single element. For example for point no. 3, I can write $$ E = \bigcup_{\alpha \in E} k(\alpha) $$ because $E$ is clearly contained in the RHS, and each $k(\alpha)$ is contained in $E$ and hence so is the union, implying that $E$ contains the RHS. Similarly for point no. 6.  So, why does Lang emphasise to take the union and compositum over all finitely generated subfields? Is there some perspective that he wishes to emphasise that I am missing? Any help in understanding this will be appreciated. Gluing Lemma for Closed Sets: Infinite Cover Counter-Example Does the logistic map have an attractor for a particular value of the parameter? Background:  Currently I am studying a course on non-linear dynamics. We have been studying about attractors only intuitively, so I do not have a definition for an attractor. Let me give you a couple of examples.  Consider a problem where a ball is slipping in a parabolic valley. It is clear intuitively and quantitatively that the lowermost point of the parabola is the attractor for it.   Say we are talking about a . We may not guess intuitively that there is an attractor, a priori, but using simulations for different values of initial conditions, we may qualitatively (and maybe quantitatively too) compare the trajectories for different initial conditions and convince ourselves that we have an attractor.  Problem:  Consider the  given as   $$x_n = ax_{n-1}{(1-x_{n-1})}.$$  Let us fix a value of the parameter where we "know" that the logistic map exhibits chaos. Say $a=3.9$.  Let us take the definition for the term attractor from :  An attractor is a subset $A$ of the phase space characterized by the following three conditions:   $A$ is forward invariant under $f$: if $a$ is an element of $A$ then so is $f(t,a)$, for all $t &gt; 0$. There exists a neighborhood of $A$, called the basin of attraction for $A$ and denoted $B(A)$, which consists of all points $b$ that "enter $A$ in the limit $t → ∞$". More formally, $B(A)$ is the set of all points $b$ in the phase space with the following property: For any open neighborhood $N$ of $A$, there is a positive constant $T$ such that $f(t,b) ∈ N$ for all real $t &gt; T$. There is no proper subset of $A$ having the first two properties.   How might we demonstrate/convince ourselves of/disprove the statement that the logistic map does have an attractor for a particular choice of the parameter at which the map exhibits chaos? Let $a_1=1$ and $a_n=n(a_{n-1}+1)$ for $n=2,3,\dots$. Define $$P_n=\left(1+\frac{1}{a_1}\right)\left(1+\frac{1}{a_2}\right)\dots\left(1+\frac{1}{a_n}\right)$$Find $$\lim_{n \to \infty}P_n$$   Trial: $$1+\frac{1}{a_n}=1+\frac{1}{n(a_{n-1}+1)}\;.$$ But I can't simplyfy.Please help.