Is there a simple and easy app on Ubuntu to do some quick and dirty blocking of say... a license plate in a picture?    I'm hoping that I don't have to install anything, because it's going to long and painful if I do.
I want something similar to "preview" in macs.  For example: I want an image editor that ONLY does simple adjustments like increase/decrease contrast, saturation, exposure, color tinting.... rotate, flip vertically, flip horizontally, make black and white, change size or format, crop.  THATS IT.  I know gimp can do all those things but its a bit overkill.  I just want to right click an image, open it with this magical program i just described, do a few quick adjustments, and then save and exit.  Nothing really fancy.  Anyone know of anything like this?  Btw I am using ubuntu 12.04 :) It rocks and I am glad I switched from mac, i just need to replace this one piece of software.
My QGIS project has two layers, one layer is retrieved by Google layer plugin which fetches the static Google map image whose CRS is +proj=merc +lon_0=0 +lat_ts=0 +x_0=0 +y_0=0 +a=6378137 +b=6378137 +units=m +no_defs and another vector layer is a postgis layer whose CRS is +proj=longlat +ellps=WGS84 +datum=WGS84 +no_defs.  I digitalized some polygon features from Google Layers and added it to the vector layer. However, QGIS seems do not make the automatic CRS transformation. How can I change its projection?   Thanks about Linux's zip utility says this about the -u flag:     Replace (update) an existing entry in the zip archive only if it has been modified more recently than the version already in the zip archive. For example:          zip -u stuff *   will add any new files in the current directory, and update any files which        have been modified since the zip archive stuff.zip was last created/modified.   My question is, if a particular file has been removed since the last time it was zipped, whether -u will recognize that the file has been removed and thus remove it from the *.zip file?  Or, lacking timestamp information (since the file is now removed), it will leave the backed up file in *.zip, since there is no "newer" file? Installation of Miktex Math book: Exercise - Solution environment If I use this code provided by a question formulate of Sebastian .  \documentclass{article} \usepackage[most]{tcolorbox} \usepackage{lipsum}  \newtcolorbox[auto counter]{problem}[2][]{% breakable, blankest, enhanced, attach boxed title to top left={yshift=-\tcboxedtitleheight}, left=\tcboxedtitlewidth+1mm, top=0pt, colback=white, fonttitle=\bfseries\sffamily, coltitle={cyan!60!black}, colbacktitle=white, colframe=white, title=\thetcbcounter,  overlay unbroken and first={% \node[fill=gray!30, inner sep=1pt, minimum width=\tcboxedtitlewidth,  outer sep=0pt, text=cyan!60!black, anchor=north] at(title.south)  {\foreach \i in {1,...,#2}{\if#2gt1{\,}\fi$\bullet$}};},#1}  \begin{document}  \lipsum[1]  \begin{problem}{1} \lipsum[2] \end{problem}  \begin{problem}{4} \lipsum[3] \end{problem}  \begin{problem}{2} \lipsum[4] \end{problem}  \end{document}   How could we create solutions environment, so we have at the end of the book solution of the exercises where each one have reference to chapter, page, number of exercise with the corresponding level of difficulty? Suppose I have two tables that don't have many columns (3, for example). How can I position them side by side? Baire: Show that $f\colon \mathbb{R}\to\mathbb{R}$ is a polynomial in an open bounded set Let $f\colon\mathbb{R}\to\mathbb{R}$ be an infinitely differentiable function, and suppose that for each $x\in\mathbb{R},$ $\exists\  n=n(x)\in\mathbb{N}$ such that $f^{(n)}(x)=0$. For each fixed $n\in\mathbb{N}$, consider the sets $F_n=\{x\in\mathbb{R} : f^{(n)}(x)=0\}$ and let $I=[a,b]$ a finite closed interval.  Show that $$I=\bigcup_{n=0}^\infty(I\cap F_n).$$ Show that there is a non empty open set $A\subset I$ where $f$ is a polynomial.   My attempt:  If $x\in I$ then by hypotesis there is $n$ such that $f^{(n)}(x)=0$ then $x\in F_n$ so then $\bigcup F_n\supset I$ then $$I=I\cap\bigcup_{n=0}^\infty F_n=\bigcup_{n=0}^\infty(I\cap F_n).$$  Let $$B_k=\bigcap_{n=k}^\infty F_n.$$ I want to show that $I\cap B_k$ has non-empty interior for some $k\in\mathbb{N}$. Then there is $A\subset B_k$ and by Taylor's Theorem $f$ will be a polynomial. But I didn't know how to prove this. I tried using the following bigger set: $$B=I\cap\bigcup_{k=0}^\infty B_k=I\cap\bigcup_{k=0}^\infty \bigcap_{n=k}^\infty F_n.$$ I think that it suffices to show that $B^o\neq\emptyset$ maybe using the Baire's Theorem proving that $B$ is a not meagre set.   More general Problem  Let $f$ be an infinitely differentiable function on $[0,1]$ and suppose that for each $x \in [0,1]$ there is an integer $n \in \mathbb{N}$ such that $f^{(n)}(x)=0$. Then does $f$ coincide on $[0,1]$ with some polynomial? If yes then how. I thought of using Weierstrass approximation theorem, but couldn't succeed. Answer: The proof is by contradiction. Assume $f$ is not a polynomial. Consider the following closed sets: $$ S_n = \{x: f^{(n)}(x) = 0\} $$ and $$ X = \{x: \forall (a,b)\ni x: f\restriction_{(a,b)}\text{ is not a polynomial} \}. $$ It is clear that $X$ is a non-empty closed set without isolated points. Applying Baire category theorem to the covering $\{X\cap S_n\}$ of $X$ we get that there exists an interval $(a,b)$ such that $(a,b)\cap X$ is non-empty and $$ (a,b)\cap X\subset S_n $$ for some $n$. Since every $x\in (a,b)\cap X$ is an accumulation point we also have that $x\in S_m$ for all $m\ge n$ and $x\in (a,b)\cap X$. Now consider any maximal interval $(c,e)\subset ((a,b)-X)$. Recall that $f$ is a polynomial of some degree $d$ on $(c,e)$. Therefore $f^{(d)}=\mathrm{const}\neq 0$ on $[c,e]$. Hence $d&lt; n$. (Since either $c$ or $e$ is in $X$.) So we get that $f^{(n)}=0$ on $(a,b)$ which is in contradiction with $(a,b)\cap X$ being non-empty. I found it in an old dictionary and I'm not sure what it means. It looks like the number &quot;3&quot;, but the top of the three has been flattened(and slightly curved). I've only seen this in three or four words. [] Does upvoting a duplicate comment do anything? When a question is initially flagged as a duplicate, there is a comment. If the duplicate flag gets enough votes, the question is closed as a duplicate, and the comment is deleted.  Does upvoting the duplicate comment count as a close vote? Does it do anything at all? I thought it was The Tommyknockers by Stephen King, but after a check with Wikipedia, it appears that's not the case.  What I remember about the story (a TV movie I think, but definitely based on a book) was that the world is created anew every night, and that the old, used up, Earth was eaten nightly by some scary creatures.  The major plot point involved some protagonists not getting onto the new world at midnight, and having to escape from the monsters that were eating up yesterday's planet.  Does this ring a bell for anyone? I'm finding it very hard to Google for. How to determine an object's class? Comparing integers: arithmetic expression or conditional expression In Bash, two integers can be compared using conditional expression     arg1 OP arg2      OP is one of -eq, -ne, -lt, -le, -gt, or -ge. These   arithmetic binary operators return true if arg1 is equal to, not equal   to, less than, less than or equal to, greater than, or greater than or   equal to arg2, respectively. Arg1 and arg2 may be positive or negative   integers.   or arithmetic expression:     &lt;= &gt;= &lt; &gt; comparison      == != equality and inequality   Why do we have two different ways for comparing two integers? When to use which?  For example, [[ 3 -lt 2 ]] uses conditional expression, and (( 3 &lt; 2 )) uses arithmetic expression. Both returns 0 when the comparison is true  When comparing two integers, can these two methods always be used interchangeably? If yes, why does Bash have two methods rather than one? Show that $\frac{X-\mu}{\sigma}\sim N(0,1)$ using moment functions Let $X\sim N(\mu,\sigma^2)$. Show that $Z=\frac{X-\mu}{\sigma}\sim N(0,1)$ using moment generating functions. \begin{align*} M_Z(t)&amp;=M_{\frac{X-\mu}{\sigma}}(t)\\ &amp;=M_{X-\mu}\left(\frac t\sigma\right)\\ &amp;=e^{-\mu t}M_X\left(\frac t\sigma\right)\\ &amp;=e^{-\mu t}\cdot e^{\frac{t\mu}{\sigma}+\frac{t^2}{2}}\\ &amp;=e^{-\mu t+\frac{t\mu}{\sigma}+\frac{t^2}{2}} \end{align*} I'm not sure how to conclude that $Z\sim N(0,1)$. I have an array of integers, how do I use each one in a mysql query (in php)? No indent in the first paragraph in a section? Rename ToC, List of Figures, References I would like to know how to rename the standard list of figures, table of contents, and references. What I saw so far relying on \renewcommand{\contentsname}{name} did not work so far.  Here's the list of preambles I use:  \documentclass[12pt]{report} \usepackage[utf8]{inputenc}  \usepackage{fourier} \pagestyle{headings} \usepackage{marvosym} \usepackage[pdftex]{graphicx} \usepackage[margin=2.5cm]{geometry} \usepackage{rotating} \usepackage{amsmath} \usepackage{booktabs} \usepackage{url} \usepackage{natbib} \usepackage{setspace} \linespread{1.5} \newenvironment{remark}{\par\mbox{}\par\noindent{\bfseries             \emph{Remark}\/}:\normalfont}{\par} \newenvironment{defin}{\par\mbox{}\par\noindent\bfseries \emph{\Pointinghand\     }\normalfont}{\par} \setcounter{toc**strong text**depth}{2}  \usepackage[colorlinks=true, a4paper=true, pdfstartview=FitV, linkcolor=blue, citecolor=blue, urlcolor=blue]{hyperref} \pdfcompresslevel=9 \setstretch{1.0} %vertical stretch \usepackage{fontspec} \setmainfont[BoldFont       = AvenirNextRoundedPro-Bold.otf , ItalicFont     =AvenirNextRoundedPro-Italic.otf]{AvenirNextRoundedPro-Reg.otf} \defaultfontfeatures{Mapping=tex-text} \usepackage{multirow} \usepackage{array} \usepackage{booktabs} \usepackage{hyperref} \hypersetup{ hidelinks, } \usepackage{ragged2e} \usepackage{euler} \usepackage[euler-digits,euler-hat-accent]{eulervm} \usepackage[labelfont=bf]{caption} \usepackage{wrapfig} \usepackage{amsmath} \usepackage{amssymb}  \usepackage[english]{babel} \usepackage[nottoc]{tocbibind} %Adds "References" to toc \usepackage{titlesec} \titleformat{\chapter}[display]{\bfseries\huge}{\filleft\Large\chaptertitlename~\thechapter}{1ex}{\vspace{1ex}\filright}[\vspace{0.5ex}\titlerule] \usepackage{float} \usepackage{etoolbox} \makeatletter \patchcmd{\@caption}{\csname the#1\endcsname}{\csname fnum@#1\endcsname:}{}{} \renewcommand*\l@figure{\@dottedtocline{1}{2em}{6em}} \let\l@table\l@figure  \makeatother % default for 3rd arg: 2.3em - for list of figures and tables \usepackage{background} \definecolor{textcolor}{HTML}{000000}             \newcommand\Text{c\quad o\quad n\quad f\quad i\quad d\quad e\quad n\quad t\quad i\quad a\quad l} \SetBgColor{textcolor}\SetBgOpacity{0.3}\SetBgAngle{90}         \SetBgPosition{current page.center} \SetBgVshift{-0.33\textwidth} \SetBgScale{1.8}         \SetBgContents{\sffamily\Text} %for confidential   I also use TexMaker. I do not know how relevant it is, but here my document language is set to English (even if it's not the language I write in, in that document, but it isn't a problem seemingly). What I also saw is that, if I remove babel and the references, I can rename my ToC and LoF, LoT. But I need the references though. Any tip would be very welcome!  Edit: I cannot provide text data from my project, because it is confidential. Here's what I can provide from the main document. Here is what I can include more.  \begin{document} \include{02_front}  \setcounter{page}{0} \pagenumbering{roman} \tableofcontents \listoffigures \listoftables \newpage \setcounter{page}{0} \pagenumbering{arabic} \chapter{blabla} \section{test é è åøæ î} \appendix \bibliographystyle{plain}  \bibliography{80_refs}   \end{document}   Also, I actually finished writing my thesis but I need to summarize it briefly in another language, am would be extremely unwilling to test and remove packages that "might be" not very useful. I literally only have to change these names of ToC, LoF, ToF and references. Why is there such variation in PhD length internationally? I'm an undergrad in Australia, and at this stage I want to go on to do further study in maths (or maybe physics/CS, still have a few years till then).  Should I do so, I imagine that I will want to complete a PhD overseas. Possibly at a university in the US or maybe Oxbridge in the UK.  In Australia, PhDs typically take 3 or 4 years, and I would be eligible to go straight into a PhD upon completion of my undergraduate degree (it is research focused and includes an honours year, see ).  But, much of what I have found for overseas institutions has been in the range of 5-7 years, or maybe a 3-4 year PhD with a few years doing a master's degree beforehand.  Does this indicate that the level of rigour and amount of work produced is significantly different for various PhD programs, or is it the case that some programs are more relaxed and simply spread the same amount of work over a longer period of time? Proof or disproof that every integer can be written as the sum of a prime and a square. I'm refreshing some algebra and in the beginning chapters of my book I'm presented with the following simple looking problem that I got stuck on:      Prove or disprove: If $n$ is a positive integer, then $n=p+a^2$, where $a$ is an integer and $p$ is prime or $p=1$.   At first I thought $n=13$ would give a nice counterexample, but then I noticed my book defines primes to include the negative primes. Now $13=-3+4^2$ is a solution.   I am allowed to use the fundamental theorem of arithmetic and the division and euclidean algorithms. I tried to express $n$ and $a$ by their prime factorizations, but I didn't get anywhere from there. I would like a hint which direction to take. Am I just missing something silly? Negative probabilities are naturally found in the Wigner function (both the original and its discrete variants), the Klein paradox (where it is an artifact of using a one-particle theory) and the Klein-Gordon equation.  Is a general treatment of such quasi-probability distributions, besides naively using 'legit' probabilistic formulas? For example, is there a theory saying which measurements are allowed, so to screen negative probabilities? Additionally, is there an intuition behind negative probabilities? Facebook changed how their API serves profile pictures that are requested with a non-application scope UID. Now because before Graph API 2 all applications shared the original UID, if users like me has joined Stack Exchange websites before  2, rolling out their profile pictures are not shown properly. Facebook suggests to use an access token to query those profile pictures, either an application access token or a user access token. A user access token is not a reliable option at all, because it would only work for users who joined website with Facebook and are currently logged in. Application access tokens, by the way, can be used by creating sort of a proxy that would retrieve a profile picture from Facebook and display it. Yet still it's not perfect. I think the best solution is to communicate with Facebook and ask them to offer an opportunity to convert old Graph API 1 UID's to application scope user IDs. Launch apps full screen