How to install apps by Terminal? I'm new to Ubuntu and I want to know how to install a program which is compressed in the format tar.bz2 or tar.gz.I downloaded an app called Prozilla and it was compressed.I extracted it and it exists on my desktop with the name prozilla-1.21.1.My Username is Bolt (For e.g.). Please give me the necessary commands to be typed in Terminal to install it .
How do I install a .tar.gz (or .tar.bz2) file? I have downloaded tar.gz files. But I don't know how to install it. How do I install this kind of file?
Surface tension: the paper clip experiment In the paper clip experiment, the surface tension of water prevents the clip from falling, thus we can assume it exerts a force of $mg$ (weight of clip) upwards.   However, if you try to pull the clip out of water, surface tension opposes this motion also. If for simplicity we assume that the clip is a rectangle of length $l$ and breadth $b$, and the surface tension is $T$, then the liquid exerts a downward force of: $$T×2(l+b)$$  What is going on here? Why is there an inconsistency in the direction along which the force acts? I got two mails from the UK embassy in Abu, saying your visa application has been concluded. I'm really confused, did I get the visa or not? What could the possible results be? Nesting HTML- anchor tags 3 Statements of axiom of choice are equivalent This winter I started to study much harder the set theory and especially the axiom of choice. Unfortunately, I have problems with solving the next exercise:  Prove that the 3 statements of the axiom of choice are equivalent :  1) For any non-empty collection $X$ of pairwise disjoint non-empty sets, there exists a choice set.  2) For any non-empty collection $X$ there is a choice function.  3) For any non-empty set $X$, there exists a function $f:P(X)\setminus\{\varnothing\}\to X$ so that for any non-empty set $A\subseteq X$, $f(A) \in A$. Let $R$ be a commutative ring with identity, and $S$ a multiplicative subset of $R$ not containing $0$. Which step in my reasoning is wrong?   Every element of $S$ is a unit in $S^{-1}R$. Every element of $S$ that's a zero divisor in $R$ is a zero divisor in $S^{-1}R$. But zero divisors can't be units. Therefore it's not possible to localize $R$ at $S$. Number of $(0,1)$ $m\times n$ matrices with no empty rows or columns I am struggling to create the matrix in the picture attached using Latex. I have tried using commands like \hline but the matrix ends up looking messy as the line goes all the way across.    Edit: To clarify, I am looking for each block to have a square outline. What is this Windows 8 icon for as rectangle icon in the title bar? Every Window in Windows 8 got this icon if it gots the focus. When clicking on it, nothing seems to happen.   How does this icon work? How to use testfor with a mob with a two-word name? How can I test for mob who has a name with two words? For example villager named Grumpy Bill. For example I want to kill this villager.  This command   /kill @e[name=Bill]   would work just fine but when I try  /kill @e[name=Grumpy Bill]   it says "The entity UUID provided is in an invalid format"  What is the proper command for this action? EM with Binomial In the comedic music video  there are many clips of vintage scifi films, some of which I recognize.  This one however, of a large blue floating holographic head talking to some kind of military installation does not look at all familiar.  Does anyone recognize this film? I wanted to apply texture on some house following an tutorial, I'm sure I did all what was needed but still don't see the texture.  Here's a screenshot: Is there a way to reach a `protected` member of another object from a derived type? class MyBase {     protected object PropertyOfBase { get; set; } }  class MyType : MyBase {     void MyMethod(MyBase parameter)     {         // I am looking for:         object p = parameter.PropertyOfBase;  // error CS1540: Cannot access protected member 'MyBase.PropertyOfBase' via a qualifier of type 'MyBase'; the qualifier must be of type 'MyType' (or derived from it)     } }   Is there a way to get a protected property of a parameter of a type from an extending type without reflection? Since the extending class knows of the property through its base type, it would make sense if possible. How can I save the command and its execution output to file at the same time Suppose I have a command java -cp src/ nlp.lm.BigramModel wsj/ 0.1, I want to save the command itself and the command execution output to the file at the same time.  One way to do this is to   echo "$ java -cp src/ nlp.lm.BigramModel atis/ 0.1" &gt; trace/bigram-trace.txt     java -cp src/ nlp.lm.BigramModel atis/ 0.1 &gt;&gt; trace/bigram-trace.txt   Is there a better way to do this? Good keyboard layouts for typing (La)TeX When typing (La)TeX some keys are used a lot more often then in plain text, especially \, {, }, [, ], $, ^ and _. On most keyboard layouts these keys are rather cumbersome to type. The English QWERTY keyboard is a lot better than the German QWERTZ, but is still far from optimal.  Given that I mostly type mathematical texts in English, what keyboard layout would you recommend?  Bonus points for the following:   Ability to type non-English Latin characters, especially German umlauts. Some similarity to QWERTZ or QWERTY as I'm most used to these layouts (I currently use the US-International layout from Linux) Ability to type math symbols directly (Greek letters, \times, etc.) What are the best textbooks to read for the mathematical background you need for modern physics, such as, string theory?  Some subjects off the top of my head that probably need covering:   Differential geometry, Manifolds, etc. Lie groups, Lie algebras and their representation theory. Algebraic topology. Question  Let $X_n\geq 0$ be independent for $n\geq 1$. The following are equivalent.  $\sum_{n=1}^\infty X_n&lt;\infty$ a.s. $\sum_{n=1}^\infty[P(X_n&gt;1)+E(X_nI(X_n\leq 1)]&lt;\infty$ $\sum_{n=1}^\infty E(X_n/(1+X_n))&lt;\infty$   My attempt I was able to prove $(1)$ implies $(2)$ and $(2)$ implies $(3)$ but not $(3)$ implies $(1)$. For $(1)$ implies $(2)$, observe that by Borel-Cantelli $\sum_{n=1}^\infty P(X_n&gt;1)&lt;\infty$, else $X_n&gt;1$ infinitely often w.p.1 so that $(1)$ is violated. To see that $\sum_{n=1}^\infty E(X_nI(X_n\leq 1)]&lt;\infty$, apply Kolmogorov three-series theorem (I think). For $(2)$ implies $(3)$ we can write that $$ \begin{align} \frac{X_n}{1+X_n}&amp; =\frac{X_n}{1+X_n}I(X_n\leq 1)+\frac{X_n}{1+X_n}I(X_n&gt;1)\\ &amp;\leq X_nI(X_n\leq 1)+ I(X_n&gt;1). \end{align} $$ Now take the expectation of both sides and sum on $n$ using $(2)$ to conclude $(3)$. For the last implication $(3)$ implies $(1)$, I tried to use Kolmogorov three series theorem. To this end put $Y_n=X_nI(X_n\leq 1)$. First note that $\sum_{n=1}^\infty P(X_n&gt;1)&lt;\infty$ since $$ P(X_n&gt;1)\leq P\left(\frac{X_n}{1+X_n}&gt;\frac{1}{2}\right)\leq 2E\frac{X_n}{1+X_n} $$ by Markov's inequality. But I am unable to show that $\sum EY_n&lt;\infty$ and $\sum\text{Var}(Y_n)&lt;\infty$. Any help is appreciated. It's not clear to me how to choose Spells Known when creating a new character at a higher level.  Let's take the Bard as a working example first:  Bard level 2:   Spells Known: 5 Slots per Spell level: 1st &times; 3   Bard level 3:   Spells Known: 6 Slots per Spell level: 1st &times; 4, 2nd &times; 2   I'm interpreting this to mean that, if an existing 2nd-level Bard gains a new level (level 3), he's gaining 1 (one) new spell known. He can then choose the new spell known to be either 1st or 2nd, correct?  What I don't understand then, is the case of creating a new character starting at a higher level; say, creating a new Bard at level 3.  In that case you're forced to choose 6 spells, which must be from the list of 1st- and 2nd-level spells, correct?  When making this 3rd-level Bard from scratch, though, can I select 2nd level spells for all 6 spells known?  As another example, say you're creating a very high level Bard from scratch, starting at level 15. The book says your Spells Known is 19, and your spell slots are 1st × 4, 2nd × 3, 3rd × 3, 4th × 3, 5th × 2, 6th × 1, 7th × 1, and 8th × 1.  So, for those 19 Spells Known, you can choose any spells from 1st through 8th spell level. Am I free then to select as many spells as I can at 8th spell level (5 in number), working backwards, and in the end ignoring the 1st, 2nd, 3rd level spells entirely?  As another example, the Ranger doesn't know any spells at 1st level, nor have any spell slots, but the book says “You know two 1st-level spells of your choice from the ranger spell list.” Does it mean at 2nd level and above?  Long story short: When choosing Spells Known for a spellcasting character created above 1st level, am I allowed to choose my Spells Known at whatever spell level I like, just so long as I have at least one spell slot of that level?  I'm working on a D&amp;D 5e character generator and need to clarify this. Notation: What does the tilde below of the expectation mean? Calculate total miles traveled from vectors of lat / lon