Whenever I use sudo apt-get install packagename, it will start installing. I will type "Y" when prompted then this will pop up:    TrueType core fonts for the Web EULA  END-USER LICENSE AGREEMENT FOR MICROSOFT SOFTWARE  …                            &lt;Ok&gt;   Why does this happen?
After a recent update, ttf-mscorefonts-installer prompted me to accept its license agreement.     ┌─────────────────┤ Configuring ttf-mscorefonts-installer ├─────────────────┐  │                                                                           │   │ TrueType core fonts for the Web EULA                                          │                                                                               │ END-USER LICENSE AGREEMENT FOR MICROSOFT SOFTWARE                             │                                                                               │ IMPORTANT-READ CAREFULLY: This Microsoft End-User License Agreement           │ ("EULA") is a legal agreement between you (either an individual or a          │ single entity) and Microsoft Corporation for the Microsoft software           │ accompanying this EULA, which includes computer software and may include      │ associated media, printed materials, and "on-line" or electronic              │ documentation ("SOFTWARE PRODUCT" or "SOFTWARE"). By exercising your          │ rights to make and use copies of the SOFTWARE PRODUCT, you agree to be        │ bound by the terms of this EULA. If you do not agree to the terms of          │ this EULA, you may not use the SOFTWARE PRODUCT.                              │                                                                               │                                  &lt;Ok&gt;                                         │                                                                           │   └───────────────────────────────────────────────────────────────────────────┘    Screenshot:   For some reason my terminal will not allow me to accept, or for some reason I am pressing the wrong hotkey...  I've tried every letter on the keyboard and Enter among others...  I'm sure there is a very simple and obvious solution to this.  I've also just tried to remove the package completely however the terminal states that due to the package not being correctly installed, I should reinstall the package before removing it.  Very frustrating!  Essentially, because I cannot successfully install this package, I can't really ever upgrade my system because I always have to end up terminating the terminal with the license agreement (thus the upgrade fails).
I've taken some stock photography of lots of clear bottles, and now want to remove the background (which is white-ish, because at a pinch I could leave it...) so that the bottle becomes transparent with highlighting.  My bottles are clear with different colored liquids with multiple refraction and reflection surfaces.  I am looking for a background color subtraction effect that will allow me to get to transparent (hopefully with some sort of effect/opacity slider).  Ideas that I can't pull off yet:   Combine layer with a color fill layer (keyed off the "transparent color") in some manner to produce some output that could be used as the starting point of a layer mask Same layer combination as above, but somehow translating "pure white" to transparency.   Notes for what doesn't work (Photoshop terminology):   "Color Range" and delete (fuzzy select, but not graded/alpha) - results in harsh lines and only leaves the pure white and dark highlights and shadow refractions/reflections Magic wand selections for the same reason "Background Eraser" because although it is able to only subtract a certain color and leave "the rest", it (like all tolerance based tools) eventually hits a colour slightly outside of the range that it just won't touch.   I'll add more if I can remember what I've found I need a little hint in a proof on convergence of a sequence. The problem I have is: Suppose $(x_n)$ is a monotone decreasing sequence of real numbers such that $\sum x_n$ converges, prove that:  $$\lim_{n \to \infty} nx_n=0$$  My idea is: proving this fact aims to prove that given $\epsilon &gt;0$ there's some natural $n_0 \in \mathbb{N}$ such that if $n &gt;n_0$ we have $|nx_n|&lt;\epsilon$.  Now, I know that $\sum x_n$ converges, so that given $\epsilon'&gt;0$ there's some $k_0 \in \mathbb{N}$ such that if $k &gt; k_0$ we have:  $$\left|\sum_{i=1}^{k}x_i - S\right|&lt;\epsilon'$$  Where $S = \sum x_n$. Now, since $(x_n)$ is monotone decreasing we know that we must have $x_1 &gt; \cdots &gt; x_k$ so that the sum of all $x_i$ should be less or equal to $k x_k$. So I know that I have:  $$\left|\sum_{i=1}^{k}x_i - S\right|\leq\left|\sum_{i=1}^{k}x_i\right|+|S|\leq|kx_k|+|S|$$  I feel that the proof will come from this, however I'm stuck at this point. Can someone give just a little hint on how to proceed from here?  Thanks very much in advance for your help. How do I remove newline character from lines preceding a particular pattern? I have a file like this: 1 22 1 4 $3 3 5556 $33 $233 $1 5  I want to move all the lines starting with $ to the previous line by replacing the newline characters with a space. My result should look something like: 1 22 1 4 $3 3 5556 $33 $233 $1 5  How can I do it using sed or grep or awk? Determinant of block matrix with commuting blocks I know that given a $2N \times 2N$ block matrix with $N \times N$ blocks like   $$\mathbf{S} = \begin{pmatrix} A &amp; B\\  C &amp; D \end{pmatrix}$$  we can calculate $$\det(\mathbf{S})=\det(AD-BD^{-1}CD)$$ and so clearly if $D$ and $C$ commute this reduces to $\det(AD-BC)$, which is a very nice property.   My question is, for a general $nN\times nN$ matrix with $N\times N$ blocks where all of the blocks commute with each other, can we find the determinant in a similar way? That is, by first finding the determinant treating the blocks like scalars and then taking the determinant of the resulting $N\times N$ matrix.  Thanks in advance! I want to install selenium webdriver in my Ubuntu 16.04 system for python Is it possible to search for down voted questions? I want to search for new downvoted questions to improve or flag them.   I tried in the searchbar: votes:-1 is:question   but votes:XX only works with positive numbers. I can't query for downvoted questions. Is there a work-around to this? If there's not, should this feature be added? Good refactoring support for C++ The Visual Studio refactoring support  for C# is quite good nowadays (though not half as good as some Java IDE's I've seen already) but I'm really missing C++ support.  I have seen  and am currently trying it out, but maybe one of you guys know a better tool or plugin?  I've been working with  now for a week or two and got totally addicted. Thanks for the tip, I'll try to convince my boss to get me a license at work too.  I've been bughunting for a few days since Visual Assist X kept messing up my Visual Studio after a few specific refactorings, It took me (and customer support) a week to hunt down but let's say for now that Visual Assist X is not a good combination with . I have a bunch of Spring beans which are picked up from the classpath via annotations, e.g.  @Repository("personDao") public class PersonDaoImpl extends AbstractDaoImpl implements PersonDao {     // Implementation omitted }   In the Spring XML file, there's a  defined:  &lt;bean id="propertyConfigurer"    class="org.springframework.beans.factory.config.PropertyPlaceholderConfigurer"&gt;     &lt;property name="location" value="/WEB-INF/app.properties" /&gt; &lt;/bean&gt;    I want to inject one of the properties from app.properites into the bean shown above. I can't simply do something like   &lt;bean class="com.example.PersonDaoImpl"&gt;     &lt;property name="maxResults" value="${results.max}"/&gt; &lt;/bean&gt;   Because PersonDaoImpl does not feature in the Spring XML file (it is picked up from the classpath via annotations). I've got as far as the following:  @Repository("personDao") public class PersonDaoImpl extends AbstractDaoImpl implements PersonDao {      @Resource(name = "propertyConfigurer")     protected void setProperties(PropertyPlaceholderConfigurer ppc) {     // Now how do I access results.max?      } }   But it's not clear to me how I access the property I'm interested in from ppc? How to convert Bedrock texture pack to Java Edition Minecraft Pages: How to put a word between horizontal rules How can I make something that looks like this?  --------   Text   ---------  where the horizontal rules extend to the margin on either side? biblatex and new line for DOI, URL and Eprint What is the difference between an Intel i7 and a Xeon quad core processor? I know the  processors have been around for a long time and are mostly used in servers, but I am curious, why do people not use the Xeons in a high performance desktop?    As far as I know about the best desktop processor out there now is the  line. The i7's and Xeons are both quad-core processors, what is the main difference in these? I just saw that the MacBook Pro's are using the quad core Xeons instead of the i7's. I just bought a  game (Forza 4) for my Xbox 360 (bought in the US). When I tried to play the game, it wouldn't load because of region issue. Is there a legal way to solve this (no crack)? What are all of the connected subsets of $\mathbb{Q}$? The answer are the singletons of $\mathbb{Q}$. I can show that the open intervals of $\mathbb{Q}$ are disconnected by choosing some irrational in the open set and using it to form a separation. But strangely enough, I am having a hard time seeing why the subset $\{p,q \}$ of $\mathbb{Q}$ is disconnected. If say $p &lt; q$ and we choose some irrational $p &lt; x &lt;q$, the separation of $\{p,q \}$ would, I think, be given by $ \{p\}$ and $\{q\}$. But these aren't open in $\mathbb{Q}$ ...? How to get my actual data from ContentNote API in Salesforce using SOQL? Product Notation for Multiplication in Reverse Order Is there a standard notation for multiplication in reverse order? For example consider the problem  $$x_{k+1} = A_k x_k$$  where $x_i \in \mathbb{R}^n$ and $A_i \in M_n(\mathbb{R})$, ($i=0,1,2,\dots$) without any further assumptions on $A_i$. The solution to this problem is  $$x_k = A_{k-1} \dots A_1 A_0 x_0$$  Obviously, writing  $$x_k = \prod_{i=0}^{k-1} A_i x_0$$  is wrong because of the multiplication order. But I'm also unconfortable to use  $$x_k = \prod_{i=k-1}^{0} A_i x_0$$  as the notation suggests that we need to increment $i$, not decrement it. Also, one may need to write $\prod_{i=k}^{m} A_i$. Then, we need to explicitly state $m &lt; k$ to imply ordering.  I can always write the open form but as similar products frequently occur in calculations in my work I want to express them in a more compact way. The question is, is there a standard and nice notation to do so? There are some suggestions in , but I think none of them are "nice enough" to work with.  I came up with the notation  $$x_k = \coprod_{i=k-1}^{0} A_i x_0$$  to imply decrementing $i$ rather than increment it, but I don't know if it is used in somewhere else or there is a standard notation. I am trying to make a snowball that triggers a command when it hits a player in 1.15, but I don't know how to do that. When I do execute at @e[type=snowball] run gamemode spectator @a[distance=..2] it only runs the command if it goes right next to them. Can I load a .NET assembly at runtime and instantiate a type knowing only the name? Is it possible to instantiate an object at runtime if I only have the DLL name and the class name, without adding a reference to the assembly in the project? The class implements a interface, so once I instantiate the class, I will then cast it to the interface.  Assembly name:     library.dll    Type name:      Company.Project.Classname     EDIT: I dont have the absolute path of the DLL, so Assembly.LoadFile won't work. The DLL might be in the application root, system32, or even loaded in the GAC. I'm new to QGIS and have no programming skills.  Is there an easy/uncomplicated way to create multiple buffers around a line feature? Let's say it again, we all make mistakes, and I have just made one.  A brief history: I was doing some stuff on a VPS (Debian) I'm renting, when I noticed some strange behaviour. Using the netstat command I saw an non-authorized connection through SSH. I didn't know what to do, so I decided to close his connection using iptables:  iptables -A INPUT -p tcp --dport ssh -s IP -j DROP   But I am tired, and I wrote  iptables -A INPUT -p tcp --dport ssh -j DROP   and I kicked myself (and everyone else) out...  How do I fix this?