Is there a possibility to upgrade from 12.10 to 13.04 ? I booted from the 13.04 installation CD but I couldn't do the upgrade (no upgrade option was displayed).  I have a laptop with a Windows 7 dual-boot.  Thanks ...
I am using Ubuntu 12.10.  Please outline the different ways I can upgrade to 13.04.
Change bounding box of math glyphs in LuaTeX I'm trying to use the Garamond-Math font in LuaTeX (despite the documentation saying I should use it with XeTeX only :-). It's working more or less OK with LuaTeX, except for some unfortunate glyph combinations, mostly at the end of inline math, such as “where $T$ is the period”.  I used \fbox to draw the bounding box of the glyph and noticed that the bounding boxes are different in LuaTeX:        and in XeTeX:        In XeTeX the glyph fits almost entirely in the bounding box, but in LuaTeX it overshoots far too much.  I'm not a font guy, so I have no idea why this happens. I thought the bounding box was a property of the font, so in my imagination the result should be the same. Thus the first question is: what actually happens that the bounding boxes are different?  The second question, in the title, is: can I change the bounding box of specific glyphs (using LuaTeX) so that the output looks more like XeTeX's?  I tried manually adding some spacing after the glyphs, but this looks hideous and will go down the drain if I happen to change the font or engine, so I'd really like not to do that. I also tried using the italic correction \/ but it seems to have no effect in math.  Here's the code to produce the pictures above:  \documentclass{standalone} \usepackage{unicode-math} \setmathfont{Garamond-Math.otf} \begin{document} \fboxrule=1sp \fboxsep=0pt In Lua\TeX{} this \fbox{$T$} looks horrible, but the \fbox{$X$} looks OK. \Huge\fbox{$T$}\quad. \end{document}   I'm using TL 2018:  This is LuaTeX, Version 1.07.0 (TeX Live 2018)  (format=lualatex 2019.3.29)  13 APR 2019 12:43  restricted system commands enabled. **test.tex (./test.tex LaTeX2e &lt;2018-12-01&gt; Lua module: luaotfload-main 2019-02-14 2.96 luaotfload entry point Using a java library from python I have a python app and java app. The python app generates input for the java app and invokes it on the command line.  I'm sure there must be a more elegant solution to this; just like using JNI to invoke C code from Java.  Any pointers? (FYI I'm v. new to Python)    Clarification (at the cost of a long question: apologies) The py app (which I don't own) takes user input in the form of a number of configuration files. It then interprits these and farms work off to a number of (hidden) tools via a plugin mechanism. I'm looking to add support for the functionality provided by the legacy Java app.  So it doesn't make sense to call the python app from the java app and I can't run the py app in a jython environment (on the JVM).  Since there is no obvious mechanism for this I think the simple CL invocation is the best solution. Generic htaccess redirect www to non-www I would like to redirect www.example.com to example.com. The following htaccess code makes this happen:  RewriteCond %{HTTP_HOST} ^www\.example\.com [NC] RewriteRule ^(.*)$ http://example.com/$1 [L,R=301]   But, is there a way to do this in a generic fashion without hardcoding the domain name? I've rooted my phone.  Now what?  What do I gain from rooting? This is a common question by those who have just rooted their phones.  What apps, ROMs, benefits, etc. do I get from rooting?  What should I be doing now? Possessive of a word that is already possessive Prove that $\lim_{n\to\infty}a_n\le \lim_{n\to\infty}b_n$ Theorem  Let $\{a_n\}$ and $\{b_n\}$ be convergent real sequences. Assume that there exists a $N\in\mathbb{N}$ so  $a_n\le b_n$ (eq. 1)  for all $n\ge N$. Then  $\lim_{n\to\infty}a_n\le \lim_{n\to\infty}b_n$.  My attempt at proving  Let $a=\lim_{n\to\infty}a_n$ and $b=\lim_{n\to\infty}b_n$. $a$ and $b$ are real numbers because the limit of a sequence of real numbers is a real number (which is a corollary in my textbook). For proof by contradiction, assume  $b&lt;a$.  Let $\epsilon=\frac{a-b}{2}$. Then we can find $N_a,N_b\in\mathbb{N}$ so  $|a-a_n|\le\frac{\epsilon}{2}$ when $n\ge N_a$, (eq. 2)  $|b-b_n|\le\frac{\epsilon}{2}$ when $n\ge N_b$. (eq. 3)  In a textbook I found that I should do the following:  Choose a $n$ so $n\ge\max(N,N_a,N_b$), then eqs. (1-3) are satisfied. Then  $a-\epsilon\le a_n+\frac{\epsilon}{2}-\epsilon$  How do I get that last thing? Is it necessary to do a proof by contradiction or can one do a direct proof? How can an object's instantaneous speed be zero and it's instantaneous acceleration be nonzero? I'm studying for my upcoming physics course and ran across this concept - I'd love an explanation. Generating random numbers in C Prove $(1+a+b)(1+b+c)(1+c+a)\ge 9(ab+bc+ca)$ How one can prove the following.  Let $a$, $b$ and $c$ be non-negative real numbers. Then the inequality holds:  $(1+a+b)(1+b+c)(1+c+a)\ge9(ab+bc+ca).$  WLOG one can assume that $0\le a\le b\le c$.  It is not difficult to prove the statement when $0\le a\le b\le c\le 1$ or $1\le a\le b\le c$. Which are the spec bits in this cache? How do I count the number of occurrences of a char in a String? I have the string   a.b.c.d   I want to count the occurrences of '.' in an idiomatic way, preferably a one-liner.  (Previously I had expressed this constraint as "without a loop", in case you're wondering why everyone's trying to answer without using a loop). Difference between static class and singleton pattern? What real (i.e. practical) difference exists between a static class and a singleton pattern?  Both can be invoked without instantiation, both provide only one "Instance" and neither of them is thread-safe. Is there any other difference? Every finite commutative ring with no zero divisors contains a multiplicative identity? Is there a rule of thumb for objective questions asked out of curiosity? Why I cannot unpin some directories from file explorer in windows 10 Why queuable apex accepts sobjects where as future methods doesn't? I was going through asynchronous apex and reading it made me confused at one point. In future methods, we cannot pass sojects for reasons future methods being executed at a later point of time, by the time it is executed the sboject data could be stale. But, at the same time, the more advanced queuable apex accepts sobjects. Why is it so? The same reason is applicable for queuable apex also right? kindly clarify. I'd never heard of anycast until a few seconds ago when I read "".  The wikipedia "" article on it is quite formal and doesn't really evoke a mental picture of how it would be used.  Can someone explain in a few informal sentences what "anycast" is, how you configure it (just in a general sense), and what its benefits are (what does it make easier)? Determine if Type is a pointer in a template function In the Android App, if a question is closed, I won't be able to leave comments on either the question or any of its answers. There are simply no "Add Comment" buttons available anywhere if the question is closed.  See the screenshot below. The comment adding interface is simply removed on closed questions and their answers &mdash; no Reply button in the toolbar, and no Add Comment button under the question.        Occurs on Android app v1.0.50 and v1.0.51, on a HTC One running Android 4.4.3. Are there any rules for adjudicating a ranged attack fired at a target engaged in melee combat with an ally? While running a session recently, one of the players chose to "assist" his companion who was in melee with a goblin, by firing an arrow at the pair of them. I couldn't find any particular rules for this scenario so just had him roll at a disadvantage, counting a miss as a hit on his companion (damage to be ascertained by a second roll).   This seemed to work okay, and became a running joke for the night as the arrow bounced off the companions back, but are there specific rules for this scenario?