When I click on the reference of the figure on the article its caption appears directly instead of all the figure then I have to go up to see the figure. I used it:  \documentclass[twocolumn,amsmath,showkeys,prb]{revtex4-1} \usepackage{graphicx} and  \begin{figure} \centering \includegraphics[width=8.5cm,keepaspectration=true]{./image} \caption{image.png} \label{fig:exp_diag} \end{figure}   Thank you for the help.
I'm using the following command to embed images in my LaTeX document (which is then rendered as PDF)  \newcommand{\img}[4]{   \begin{figure}[!hbt]     \centering       \vspace{1ex}       \includegraphics[width=#2]{images/#1}       \caption[#4]{\label{img.#1} #3}     \vspace{1ex}   \end{figure} }   When creating a href to an image, the viewer jumps to the image caption instead of the top of the image. How do I change my \img command so it still puts the caption below the image but links to it jump to the image itself?
What should I look for when buying a used bicycle? I'm moving to a city where I can ride a bicycle to the grocery store, coffee shop etc. I want to purchase a decent used bicycle. I'm leaning towards a bike that's in between a "10-speed" or road-bike and a mountain bike. What should I look for when choosing a particular bike?  I've never purchased a used bicycle. Other than classifieds (e.g., Craigslist), what types of places can I look? What other issues should I consider, such as size, visual appearance, leaking tires, etc.? How can I make sure it's not stolen? "Repository doesn't support architecture" when trying to update on Landscape client 2D random walk within a bounded area Community isn't on ~15 sites! I was looking at the Community user's profile, and I noticed that there was about 15 sites missing in the "accounts" tab. There's a little over 120 sites on SE, and, there's about 15 sites missing from this count. Why is this happening?    Additionally, clicking on view more just shows one account, on Area51: Assume the continuum hypothesis is false, and add that as an axiom to ZF set theory. How many cardinalities are between the rationals and the reals in this case? Only one? Infinitely many? Countably many? Uncountably many? What are the possibilities to the quantity of counterexamples? I am building a blog type page, and I want to load items into the page as the user scrolls down, much like Google Reader, or Soup.io. How would you go about achieving this effect? I've seen some examples which read the height of the page, and have an onScroll even attached to the window so that as the user scrolls down we can test to see if they've scrolled down far enough to warrant loading more items. Soup.io's implementation seems to remove the old items as you scroll down so that the browser isn't dealing with an ever-increasingly large DOM tree. Which javascript libraries would be best suited to this task? Just read this which basically says you can freeze and thaw food in the fridge any number of times.    I'm still unclear on one point. If I had food which would be good in the fridge for 4 days and i put it in the freezer after 3 days, when I put it back in the fridge is my food good after its thawed for another 4 days or 1 more day? Finding the Public IP address in a shell script I can find my IP address using ifconfig or hostname -i command.  But how do I find my Public IP?  (I have a static public IP but I want to find it out using unix command) understanding Debian dpkg package version numbers A net $\varphi : [0, \omega_1) \to M$ on a metric space $M$ converges $\iff \varphi$ is eventually constant I want to prove that      If $M$ is a metric space, then a net $\varphi : [0, \omega_1) \to M$ converges if and only if $\varphi$ is eventually constant. ($[0, \omega_1)$ is the set of ordinals less than $\omega_1$, where $\omega_1$ is the first uncountable ordinal, with the order topology).   $(\Leftarrow)$ is clear.  My trouble is with $(\Rightarrow)$. Suppose that $\varphi \rightarrow x$.  Let $U = \{ \alpha \in [0, \omega_1) \, \mid \varphi(\alpha) \neq x \}.$  If $U = \emptyset $ we are done, so assume $U \neq \emptyset$. Since $[0, \omega_1)$ is well ordered, there is a $\alpha_1 \in U$ such that $ \alpha_1 \leq \alpha \, \, \forall \alpha \in U.$  If $ U \setminus \alpha_1 = \emptyset$ we are done. If not, we repeat the procedure.  It is clear that if $card(U) = n$ for some $n \in \omega$ then we only have a finite set of ordinals $\{\alpha_1, \ldots, \alpha_n\}=U$ so $\varphi$ is constant for $\alpha &gt; \alpha_n.$  If $U$ is countably infinite, then $U = \{\alpha_n\}_{n \in \omega}$ and since $[0, \omega_1)$ is sequentially compact and the $\alpha_n$'s are countable ordinals  we obtain a convergent subsequence $\{\alpha_{n_k}\}$ of $U$ to some countable ordinal $\beta \in [0, \omega_1)$ $[\beta = \cup_{n_k \in \omega}\alpha_{n_k}???],$ hence $\varphi$ is constant for all $ \alpha &gt; \beta.$     But what if $U$ is uncountable?    Idea: If $U = [0, \omega_1),$ then since $\varphi \rightarrow x$, for every $n \in \omega$ there is $\alpha_n \in U$ such that $\alpha \geq \alpha_n \implies \varphi(\alpha) \in B_{\frac{1}{n}}(x).$ This is a countable sequence, so since $[0, \omega_1)$ is sequentially compact, there is a subsequence converging to a countable ordinal $\beta \in [0, \omega_1)$. Clearly, $\beta$ satisfies that $\phi(\beta) \in B_{\frac{1}{n}}$(x) for every $n \in \omega.$     We can conclude that $\varphi(\beta)= x$ right?   For if $\varphi(\beta) \neq x$, then taking $n$ such that $0 &lt; \frac{1}{n} &lt; d(x, \varphi(\beta)),$ we would have that $\varphi(\beta) \not \in B_{\frac{1}{n}}(x),$ contradicting the hypothesis.  I feel pretty confident about this, but If someone sees an error in the argument, please comment. Thanks. VBA array sort function? I'm looking for a decent sort implementation for arrays in VBA. A Quicksort would be preferred. Or any other  other than bubble or merge would suffice.  Please note that this is to work with MS Project 2003, so should avoid any of the Excel native functions and anything .net related. How to show full date and time in Nautilus/Files 3.6+ list view? Number of automorphisms of a direct product of two cyclic $p$-groups Let $d=GCD(n^2+5,n^3-5n^2+6n)$ show that $d|630$ If $a,b$ are positive integers such that $\gcd(a,b)=1$, then show that $\gcd(a+b, a-b)=1$ or $2$. and $\gcd(a^2+b^2, a^2-b^2)=1$ or $2 $ If  $a,b$ are positive integers such that $\gcd(a,b)=1$, then show that $\gcd(a+b, a-b)=1$ or $2$ and $\gcd(a^2+b^2, a^2-b^2)=1$ or $2 $. Progress We have   $\gcd(a,b)=1\implies \exists u,v\in \mathbb Z$ such that $au+bv=1\implies a^2u'+bv'=1, u',v'\in \mathbb Z$. Let $\gcd(a+b, a-b)=d$. Then $\mid (a+b)x+(a-b)y, \forall x,y\in \mathbb Z$. How to show $\gcd(a+b, a-b)=1$ or $2$ and $\gcd(a^2+b^2, a^2-b^2)=1$ or $2 $. Lost my Downloads folder both from Dock and Finder I did something stupid apparently and lost my Downloads folder both from Dock and then when I opened Finder to drag it down to the Dock it somehow got deleted in the desktop.  Now although I can see the folder exists (e.g. by searching in Spotlight) I do not know how to restore it in the Dock and in Finder as well. Any help please? Assume $\bar A\cap\bar B=\emptyset$. Is $\partial (A \cup B)=\partial A\cup\partial B$, where $\partial A$ and $\bar A$ mean the boundary set and closure of set $A$?   I can prove that $\partial (A \cup B)\subset \partial A\cup\partial B$ but for proving $\partial A\cup\partial B\subset \partial (A \cup B)$ it seems not trivial. I tried to show that for $x\in \partial A\cup\partial B$ WLOG, $x\in \partial A$ so $B(x)\cap A$ and $B(x)\cap A^c$ not equal to $\emptyset$ but it seems not enough to show the result. Really stuck with this, \begin{cases}  2tx'(t)-1=x^2t \\  x(t=1)=1 \\  \end{cases} I don't understand the variables. What does it mean that $x$ differentiated have $t$ as a function value, like this: $x'(t)$? Don't get it :( Generator of group $D_n$ using gedit through ssh connection - should I have gedit installed on the server? I wanted to try out using graphical tools over ssh. Just to learn a new thing :)  so my understanding is this, I connect like this: ssh -port -x user@server  But I'm running ubuntu server so it has no gui and thus no gui tools. My understanding is I've to install gedit on server. But also xserver?  Can someone clear up this concepts to me?