I want to install latest version of chromium in my Ubuntu desktop 12.04. Please guide me How to install latest version of chromium via ppa repository.
Is there an easier way to install Chromium than what is described ?  Furthermore, is there an easier way to stay up to date with current Chromium releases rather than having to re-build Chromium each release? (a script which automatically grabs and installs the latest build possibly?).  Related:
No "Login using Google" option in Android app I registered this ID with my Gmail account, and logged in successfully via web browser. However, while I was trying to log in on the Stack Exchange app in my Android Phone, I don't see any option to log in with Google:    I was told that no user was found with my Gmail account. It is amazing that I can log in via web browser, but cannot do so with the same Gmail account via app. How can I do that?  Just to compare, here is a "normal" login screen of another user:    Where did the Google login go and how can I bring it back?  My app version is 1.0.73, phone is Coolpad 8150D with Android version 4.0.3, kernel 3.0.8. I want to make a plane for my supply on my PCB and a plane for my MCU to isolate the MCU from the power supply noise.  I found this article in Altium designer :  But it isn't clear how the split plane tool work. Can someone explain it in a different manner?  [EDIT]  This is a picture how I see the planes: biblatex: \parencite in note field prints spurious ; with authoryear-icomp style The documentation for the  function states that you pass it a number, and the positions past the decimal to round. Thus it should do this:  n = 5.59 round(n, 1) # 5.6   But, in actuality, good old floating point weirdness creeps in and you get:  5.5999999999999996   For the purposes of UI, I need to display 5.6. I poked around the Internet and found some  that this is dependent on my implementation of Python. Unfortunately, this occurs on both my Windows dev machine and each Linux server I've tried. .  Short of creating my own round library, is there any way around this? One of the most commonly asked questions of beginners. How do ranks work in Go for amateurs?  Why do we start backwards? And why do we suddenly count upwards again? What is the difference between 9d and 9p? How is this related to rating? What are the basic differences between ranks used in different countries and different servers? Functional Analysis. Continuous extensions of linear functionals. I would like to show that a continuous functional on a subspace $W$ of a normed space $(V,\|\cdot \|)$ has a unique continuous extension to $V$ iff $W$ is dense in $V$.  I have proved $(\Leftarrow$). But the converse is currently eluding me! Help would be much appreciated! [i] Susan married Ed. (RHD)   [ii] My sister got married last fall. (COCA)   Is there a passive implication in [ii]? That is, the families and so on arrange and perform the marriage ceremonies for two people, and through all this the two get married. Is this implied in the expression [ii], and not in [i]? Flow chart using Tikz- spanning multiple pages I am trying to create a flowchart with Tikz. Since it is a long one, it spans three pages. So after creating a node to stop, I am continuing to the next page using \newpage command. Unfortunately some elements in page 1 are connected to page 2, 3 and vice versa. So when I try to create the arrow connection, it is not possible since the \newpage command comes in between. I am sharing the code with you for info. Could  anyone help me to improve the flowchart so that I could direct the arrows among multiple pages. My sample code is below:  \begin{tikzpicture} \node 1 \node 2 ........ \draw[arrow] (node1)--(node2) \draw[arrow] (node2)--(node3) ---- \end tikzpicture} \newpage \begin{tikzpicture} \node 1 \node 2 ........ \draw[arrow] (node1)--(node2) \draw[arrow] (node2)--(node3) ---- \end tikzpicture} \newpage  \begin{tikzpicture} \node 1 \node 2 ........ \draw[arrow] (node1)--(node2) \draw[arrow] (node2)--(node3) ---- \end tikzpicture} Variable declaration placement in C I long thought that in C, all variables had to be declared at the beginning of the function. I know that in C99, the rules are the same as in C++, but what are the variable declaration placement rules for C89/ANSI C?  The following code compiles successfully with gcc -std=c89 and gcc -ansi:  #include &lt;stdio.h&gt; int main() {     int i;     for (i = 0; i &lt; 10; i++) {         char c = (i % 95) + 32;         printf("%i: %c\n", i, c);         char *s;         s = "some string";         puts(s);     }     return 0; }   Shouldn't the declarations of c and s cause an error in C89/ANSI mode? Triple Boot Lion+Win7+Linux Include ALL pdf graphics in document I have several plots saved as .pdf in a folder and I would like to know if there is a way of adding all of them in a document at once, without typing the path to each file. How can I type a Unicode character (for example, em-dash —?) The title pretty much says it all: how can I type Unicode characters - specifically the em-dash —? Why does an environment's label have to appear after the caption? \documentclass{article} \usepackage{algorithm}  \begin{document} \setcounter{section}{54} \section{A section with no label} \begin{algorithm} \label{myalg} \caption{An algorithm with the label `myalg'.} \end{algorithm} Reference to myalg: \ref{myalg}. \end{document}   With this code, the reference givens 55 (the section number); if I move the label after the caption command, I get the correct reference (1).  Why should this be the case? I find it confusing: when thinking about an algorithm as an environment, you expect to be able to label it right after you began it. At the very least I would expect some kind of error or "??" to appear, rather than the previous environment or reference-able entity being used. Windows shortcut (.lnk) parser in Java? I'm currently using Win32ShellFolderManager2 and ShellFolder.getLinkLocation to resolve windows shortcuts in Java. Unfortunately, if the Java program is running as a service under Vista, getLinkLocation, this does not work. Specifically, I get an exception stating "Could not get shell folder ID list".  Searching the web does turn up mentions of this error message, but always in connection with JFileChooser. I'm not using JFileChooser, I just need to resolve a .lnk file to its destination.  Does anyone know of a 3rd-party parser for .lnk files written in Java I could use?  I've since found unofficial documentation for the .lnk format , but I'd rather not have to do the work if anyone has done it before, since the format is rather scary. Rigor in quantum field theory Does there exist a surjective homomorphism from $(\mathbb R,+)$ to $(\mathbb Q,+)$ ? Does there exist a surjective homomorphism from $(\mathbb R,+)$ to $(\mathbb Q,+)$ ?  ( I know that there 'is' a   'surjection' , but I don't know whether any surjective homomrophism from $\mathbb R$ to $\mathbb Q$ exist or not . Please help . Thanks in advance ) If $T^n$ is $q$-contractive, $T$ exactly has one fixed point Consider a complete metric space $(X,d)$ and $T\colon X\to X$. Suppose there exists $n\in\mathbb{N}$ such that the n-th power of $T$ is $q$-contractive. Show that then $T$ has exactly one fixed point $\overline{x}\in X$.      The n-th power is defined inductively: $$ T^{n+1}(x):=T(T^{n}(x)), n\in\mathbb{N}. $$ And for a function $T\colon X\to X$, $q$-contractive means  $$ \exists 0\leq q&lt;1~\forall~x,y\in X: d(T(x),T(y))\leq q d(x,y). $$    Now to the proof.  I think I have to show, that $T$ is q-contractive, because then it follows with Banach, that $T$ does have exactly one fixed point. So I have to show, that there exists a $0\leq q&lt;1$ so that for all $x,y\in X$ it is $$ d(T(x),T(y))\leq q\cdot d(x,y). $$ And most likely I have to use the q-contractivity of $T^n$, i.e. that there exists a $0\leq q &lt;1$ so that for all $x,y\in X$ it is $$ d(T^n(x),T^n(y))\leq q\cdot d(x,y). $$  Can you help me? The no. of all possible matrices of order $3\times 3$ with each entry $0$ and $1$ and $ -1$. I've read the , and I don't get it. I am really interested, but I've read the explanation there a couple of times and I still don't get it how the Duff's device works.  What would a more detailed explanation be? When applying to a PhD program in the US, how does the admissions process work? If an applicant is weak in a particular area, is it possible to offset that by being strong in a different area?  Note that this question originated from this . Please feel free to edit the question to improve it.