Every time I try to upgrade ubuntu, it gives me forbidden access. Every time that happens, Ubuntu crashes.  log file :   Do you want to continue [Y/n]? y Get:1 http://archive.canonical.com/ubuntu/ saucy/partner adobe-flash-properties-gtk i386 11.2.202.346-0saucy1 [131 kB] Get:2 http://us.archive.ubuntu.com/ubuntu/ saucy-updates/main libfontembed1 i386 1.0.40-0ubuntu1.1 [47.8 kB] Get:3 http://archive.canonical.com/ubuntu/ saucy/partner adobe-flashplugin i386 11.2.202.346-0saucy1 [6,600 kB] Get:4 http://us.archive.ubuntu.com/ubuntu/ saucy-updates/main lightdm i386 1.8.5-0ubuntu1 [107 kB] Err http://us.archive.ubuntu.com/ubuntu/ saucy/main apturl-common i386 0.5.2ubuntu2   403  Forbidden [IP: 91.189.91.13 80] Get:5 http://us.archive.ubuntu.com/ubuntu/ saucy-updates/main cups-browsed i386 1.0.40-0ubuntu1.1 [44.7 kB] Get:6 http://us.archive.ubuntu.com/ubuntu/ saucy-updates/main liblightdm-gobject-1-0 i386 1.8.5-0ubuntu1 [33.4 kB] Fetched 6,963 kB in 19s (359 kB/s)                                              Failed to fetch http://us.archive.ubuntu.com/ubuntu/pool/main/a/apturl/apturl-common_0.5.2ubuntu2_i386.deb  403  Forbidden [IP: 91.189.91.13 80] E: Unable to fetch some archives, maybe run apt-get update or try with --fix-missing?   I tried to contact the internet provider but there is no support from their side. I don't have a vpn account.  Is there another solution?
I live in Ethiopia and the government blocks all urls with the word "proxy" in them. I couldn't use that word in the title above because that would make the url contain the word proxy.   When I apt-get upgrade I get errors because some packages like libproxy1, libproxy1-plugin-gsettings, libproxy1-plugin-networkmanager, python-libproxy all contain the p word.  Therefore, it is all blocked. I tried putting the urls into proxy sites, but they all just returned to their home page.   Are there any other solutions?
Scoping in assigning a derivative Why is a linear transformation called linear? What is the sum of $$\sum_{n=0}^{\infty}\frac{1}{2^n(n+1)}$$    I've spent an insane amount of time on this problem. I checked on Wolfram and it gives $ln(4)$, which I assume you get from $2\ln(2)$.   I know that the integral of $\frac{1}{n+1}$ is $\ln(n+1)$. What am I missing?  Thank you! How do I make the method return type generic? Consider this example (typical in OOP books):    I have an Animal class, where each Animal can have many friends. And subclasses like Dog, Duck, Mouse etc which add specific behavior like bark(), quack() etc.  Here's the Animal class:  public class Animal {     private Map&lt;String,Animal&gt; friends = new HashMap&lt;&gt;();      public void addFriend(String name, Animal animal){         friends.put(name,animal);     }      public Animal callFriend(String name){         return friends.get(name);     } }   And here's some code snippet with lots of typecasting:  Mouse jerry = new Mouse(); jerry.addFriend("spike", new Dog()); jerry.addFriend("quacker", new Duck());  ((Dog) jerry.callFriend("spike")).bark(); ((Duck) jerry.callFriend("quacker")).quack();   Is there any way I can use generics for the return type to get rid of the typecasting, so that I can say      jerry.callFriend("spike").bark(); jerry.callFriend("quacker").quack();   Here's some initial code with return type conveyed to the method as a parameter that's never used.   public&lt;T extends Animal&gt; T callFriend(String name, T unusedTypeObj){     return (T)friends.get(name);         }   Is there a way to figure out the return type at runtime without the extra parameter using instanceof? Or at least by passing a class of the type instead of a dummy instance. I understand generics are for compile time type-checking, but is there a workaround for this? Why are properties lost in the Cayley–Dickson construction? Motivating question:    I'm aware that one can construct a hierarchy of number systems via the Cayley–Dickson process:  $$\mathbb{R} \subset \mathbb{C} \subset \mathbb{H} \subset \mathbb{O} \subset \mathbb{S} \subset \ldots $$  "Reals" $\subset$ "Complex" $\subset$ "Quaternions" $\subset$ "Octonions" $\subset$ "Sedenions" $\subset$ $\ldots$  and that at each step you're given a multiplication table that tell how the elements interact. As you move up the ladder, certain "nice" properties are lost: ordering,  commutativity, associativity, multiplicative normedness, etc... Given the multiplication table, you can show that these properties don't hold.   Eric Naslund noted that "the first 4 are very special as they are the unique 4 normed division algebras over ℝ", no surprise then that these $2^n$-ions have found quite a bit of use. I'm interested in the sequence itself however, irrespective of how useful a $2^{256}$-ion might be (ducenti-quinquaginta-sex-ion?).   I feel like something deeper is going on here though that I don't understand. Why are these particular properties lost at each step? Is it possible to quantify the process such that, at the $2^n$-ion you can say something about the symmetry of the multiplication table*?  * I'm making an ansatz that there is a connection between the symmetry of the multiplication table and these "nice" properties. I have a Microsoft XBOX 360 gamepad with the wireless adapter and I was wondering what I would have to install to use them with Ubuntu I do know that when using this on Windows I have to manually install the drivers for the wireless receiver (if that is relevant.) We all know how important proper attribution of ideas is. At the same time, certain things have become basic enough that citing the paper where they were first discussed is overkill: to give an extreme example, if you need to do some differentiation in your math/physics paper, you don't need to go and cite Newton and Leibniz. Now, on occasion students ask me how one can determine if a piece of knowledge is common enough that they can forgo a citation. The rule of thumb I give them is:     If it is something that is explained in a standard first-year undergrad textbook, then anybody who is going to read your papers knows about it and you don't need to provide a citation.   [Here I want to emphasize that I give this to them as a rule of thumb, and I always tell them to ignore it and provide the relevant citation if they think it is necessary to do so in a specific case]  Are there better or alternative ways of drawing the line? Google isn't surfacing Events rich snippets in SERP when JSON-LD Structured Data is valid Google confirms our site has thousands of valid MusicEvent structured data objects presented using JSON-LD, as indicated in the Structured Data section of Webmaster Tools. However, rich snippets for the events do not show up in any search result pages. The Rich Cards tab in Webmaster Tools says:     We did not find any structured data for rich cards on your website.   The structured data is valid with no errors in the Structured Data Testing Tool. We do generate some warnings occasionally for missing endDate and price fields. Comparing our code to a survey of other sites whose rich snippets do appear, we are not doing anything unique in terms of our markup.  The data has been there for months, in fact over the months we've tried also using Microdata format. The Structured Data section indicates that many pages were crawled this week.  Besides SDTT validation, what else can I check to troubleshoot this issue? How do I restrict my kids' computing time? Access to our computer (not only to the internet) needs to be restricted for the accounts of my kids (7, 8) until they are old enough to manage this by themselves. Until then we need to be able to define the following:   the hours of the day when computing is o.k. (e.g. 5 - 9 pm) the days of the week when computing is not o.k. (e.g. mondays to fridays) the amount of time allowed per day (e.g. 2 hours)   In 11.10 all of the following that used to do the job don't work any more:   : for > 11.10 no more available through the ppa. : command line alternative, but from 11.10 removed from the repositories. : Looks great but repeatedly crashes to force restarting X-server. So we can't use or recommed this program at the moment.   Are there any other alternatives? If a quadrilateral has a pair of equal opposite sides, and a pair of equal opposite angles, then is it necessarily a parallelogram? I’m sorry I couldn’t upload a photo, so I’ll try to explain it as best as I can.     The quadrilateral has a pair of opposite and equal sides, and has a pair of opposite equal angles (85 degrees in the question).   Can I say this is a parallelogram or not?    I tried drawing a shape with those conditions that is not a parallelogram and I failed. Thanks in advance, and again sorry for not having a photo and I hope I explained it well enough. I have a 2x2 experimental design. In the experiment, I also collected the participants' professional qualifications (categorical variable- yes /no). I would like to test the effect of controlling this variable on the MSE. I understand that in ANCOVA, the covariate is either an interval or ordinal variable. So should I refer to the test as an ANCOVA if I include professional qualification as an additional variable? Or should it be a blocking variable since &quot;prof. qualification&quot; is categorical. Find all integer solutions to Diophantine equation $x^3+y^3+z^3=w^3$ Compute all integer solutions to the equation  $$x^3+y^3+z^3=w^3$$ How do you override page.tpl.php in Omega 4? I am using the  base theme, and am trying to override page.tpl.php.    This file is in the base theme in sites/all/themes/omega/templates/system.  When I copy it into my theme, edit it, clear caches, I don't see my changes?  Why can't I override this template? If $X^n$ is a diagonal matrix with distinct eigenvalues, then is $X$ also a diagonal matrix with distinct eigenvalues? What is the rule for adjective order? how to turbo boost my cpu on Ubuntu? My PC has one Intel Haswell i5 4690, which is supposed to be boosted up to 3.9GHz from the regular frequency 3.5GHz. I do not know if it is possible to use some softwares to turbo boost this cpu on Ubuntu 14.04LTS. THX! Prove that the range of the entire function $z^2+\cos(z)$ is all of $\mathbb{C}$. Prove that the range of the entire function $z^2+\cos(z)$ is all of $\mathbb{C}$.   I'm aware this question has been  already, but the explanations were a little shakey and referenced a google sample preview of a text of whose terminology I wasn't very familiar with, so I would like some more input if possible.  Here's my attempt:  Let $f(z)=z^2+\cos(z)$. Through the power series of the cosine function $$ f(z)=z^2+1-\frac{z^2}{2!}+\frac{z^4}{4!}-\cdots=1+\frac{z^2}{2!}+\frac{z^4}{4!}-\cdots, $$ so $$ g(z):=\frac{f(z)-1}{z} $$ has a removable singularity at $z=0$ and is effectively an entire odd function. Picard's little theorem asserts that the range of $g$ is all of $\mathbb{C} $: if there exists some $z_0$ such that $g(z)\neq z_0$ for all $z\in\mathbb{C}$, then $-z_0$ is also missed by oddness of $g$, which is a contradiction (since $g(0)=0$ we rule the possibility that $z_0=0$). (I'm not sure about the following step) It follows that $zg(z)$ and so $zg(z)+1=f(z)$ is surjective.  Is this method valid? Would I need further justification to show that $z\mapsto z$ and $z\mapsto g(z)$ surjective imply its product -- $z\mapsto zg(z)$ -- is also surjective (if this is even true). Any input is greatly appreciated.  Edit: After thinking about this for a moment longer, I realize this logic would also show that the range of any entire even function is all of $\mathbb{C}$, which seems like quite a strong conclusion. This makes feel like there are holes in my logic. I want to calculate the posterior distribution given a gamma-prior and a poisson likelihood. The task is from a textbook and I just have the solutions (without a walkthrough). Please find all given information in the following:  Given information:  $m$ countries each with a population of $n_i$; $y_i$ is the number of people having a disease; $y_i$ is a poisson random variable with mean $\frac{n_i*\lambda}{100}$  The prior distribution for $\lambda$: $\lambda \sim Gamma(a_0,b_0)$  Task:  Show that the posterior distribution is also a gamma distribution with $a_m = a_0 + \sum_{i = 1}^{m}y_i$ and $b_m = b_0 + \sum_{i = 1}^{m} \frac{n_i}{100}$  My solution:  $Posterior \propto Likelihood \times Prior$  $p(\theta|y) \propto \prod_{i=1}^{m}(\theta^{y_i}e^{-\theta})\times \theta^{a_0-1}e^{-b_0\theta}$  $p(\theta|y) \propto \theta^{\sum_{i = 1}^{m}y_i}e^{-m\theta}\times \theta^{a_0-1}e^{-b_0\theta}$  $p(\theta|y) \propto \theta^{\sum_{i = 1}^{m}y_i+a_0-1}e^{-\theta(m+b_0)}$  $a_m = a_0 + \sum_{i = 1}^{m}y_i$  $b_m = b_0 + m \neq b_0 + \sum_{i = 1}^{m} \frac{n_i}{100}$  I think I am doing a mistake, because I don't know how to incorporate the information that the mean of $y_i$ is given as $\frac{n_i*\lambda}{100}$. Or do I just have to transform $b_m$ somehow? Can someone may give me a hint?   Thank you already in advance!  Edit 1: Considering first advices  $Likelihood: p(y | \theta) \propto \prod_{i=1}^{m}(\frac{n_i\lambda}{100})^{y_i}e^{-\frac{n_i\lambda}{100}}$  $\propto \prod_{i = 1}^{m} ((\frac{n_i}{100})^{y_i})\lambda^{\sum_{i=1}^{m}y_i}e^{-\lambda\sum_{i=1}^{m}\frac{n_i}{100}}$  $\propto \lambda^{\sum_{i=1}^{m}y_i}e^{-\lambda\sum_{i=1}^{m}\frac{n_i}{100}}$  Is the transformation of $\prod_{i=1}^{m}$ I did from the first to the second step correct? How to compute $\int_0^{\pi/2}\frac{\sin^3 t}{\sin^3 t+\cos^3 t}dt$? A function $f: \mathbb R \to \mathbb R$ satisfies equation $f(x+y)=f(x)f(y)$ for all $x,y\in \mathbb R $