I upgraded Ubuntu 16.04 to Ubuntu 17.04. Now I installed VirtualBox and am trying to make a Kali Linux virtual machine, but it is showing me this message:     This kernel requires an x86-64 CPU, but only detected an i686 CPU.   Unable to boot - Please use a kernel appropriate for your CPU.   I am running Dell Optiplex 745 with 3GB Ram.
I'm trying to install Lubuntu on my laptop (sorta old 2005). [Laptop stats: Intel® Celeron® CPU 410 @ 1.46 GHz 1.47GHz, 448 MB of RAM]  I press Install and this message appears:   This kernel requires an x86-64 CPU, but only detected an i686 CPU.  Unable to boot - please use a kernel appropriate for your CPU.   What can I do to install Lubuntu on my computer?
Should one downvote answers to off-topic questions? It annoys me when people post answers to obviously off-topic questions like , especially after those questions have already received several close votes. Migrations seem to happen rather infrequently these days, so there's probably no reputation to gain for questions that are likely to be closed. And although sure, the answer may help the OP, it also encourages bad behavior (posting off-topic questions.)  Is it appropriate to downvote these answers?   Personally, I think I could make a case for both sides. Accessing the web page's HTTP Headers in JavaScript Is there any way to tell Google to display the updated title instead of displaying the old blog title in search results? As a matter of optimization, a few weeks ago I modified the way the titles of my blog posts are displayed (I made a change also in the title of the blog). Then I used the Google Webmaster Tools to re-index the old pages and update titles. Immediately I could update the titles and posts appear correctly on Google.  The problem is that now the titles of posts began to appear incorrectly in the search, using the old blog title. Some posts continue to display the updated title, but many recent posts show the old title.  I've tried re-index the pages with Google Webmaster Tools, but the titles remain unchanged in the search results.  Is there any way to "force" Google to display the correct titles? Android finding missing numbers are used by the Empire in a manner that is tactically identical to how a modern day army would use a tank, in that they are used as shock armour with powerful main guns which will punch through entrenched positions. (No combined arms tactics were used in the Battle of Hoth, but that's a different question altogether)  However, AT-AT walkers have a number of (rather lethal) drawbacks and no advantages that I can see compared to tanks.    They have footpads in place of treads, which greatly increase their ground pressure, and which will cause them to easily sink as compared to treads They have a high center of gravity and can be easily tripped, which was exploited in the Battle of Hoth. (granted that this was canonically presented as an oversight, albeit a rather stupid one, since most martial arts strongly emphasise lowering your CG.) They are slower than a modern main battle tank despite their long legs, which one would normally expect to grant additional mobility (max speed 60km/h on flat terrain, compared to 72km/h on flat terrain for the ). This is exacerbated by the fact that AT-AT walkers are using fusion power cells as compared to diesel engines.   It would seem that it would make far more sense for the Empire to remove the legs and mount the main chassis on treads, which would make the vehicle far more effective. Why then, did they not do this? It clearly was not the case that imperial Engineers lacked imagination, as they did produce .   Possible answers which I find implausible as advantages:  1: AT-AT walkers are tall, and therefore have a surveying advantage over the battlefield / have a better vantage point to fire from  Orbital satellites can provide the observation, and in any case air/orbital support should always be called in, especially if fire support from above is required. How many irreducible monic quadratic polynomials are there in $\mathbb{F}_p[X]$? Can some of you help me with my homework?     I had to count the irreducible, quadratic, monic polynomials in $\mathbb{F}_p[X]$ for arbitrary $p$.    I will show you what I tried myself.  Research effort  First of all the set $\{X^ 2 + bX +c : b, c \in \mathbb{F}_p \}$ contains $p^2$ elemenst. We need to substract the amount of elements that is reducible. These elements are exactly the set $A = \{(X+c)(X+d) : c, d \in \mathbb{F}_p \}$. There are $p(p-1)$ pairs of $(a,b) \in \mathbb{F}_p \times \mathbb{F}_p$ such that $a \neq b$, and there are $p$ pairs such that $a=b$.     When $a$ and $b$ are unequal, whe know that $a$ and $b$ can be swapped without changing anything to the polynomial $(X+a)(X+b)$, so I obtained that $|A| \leq p +(p-1)- \frac{1}{2}(p-1)=p-\frac{1}{2}(p-1)$.  In other to find out these are the elements, or that there are still less, I thought I had to assume that $(X+c)(X+d) = (X+\gamma)(X+\delta)$, to deduce some information about the realation between $(c,d)$ and $(\gamma, \delta)$, but this led to taking square roots in $\mathbb{F}_p$, and I am not familiar with that.  Could you please provide me some more information? Expected number of hamiltonian paths in a tournament The following theorem is from Alon&amp;Spencer's The probabilistic method, in the beginning of chapter 2:  Theorem 2.1.1: There is a tournament $T$ with $n$ vertices and at least $\frac{n!}{2^{n-1}}$ Hamiltonian paths.  Briefly the theorem is proved by looking at $X_\sigma$ the indicator random variable for a permutation $\sigma$ giving a Hamiltonian path, that is, satisfying $(\sigma(i),\sigma(i+1))\in T$ for $1\leq i \lt n$. Then   $\sum \mathbb{E}\left[X_\sigma\right] = \frac{n!}{2^{n-1}}$.  I don't understand where did this value ($\frac{n!}{2^{n-1}}$) came from! could someone explain it please? The number of different ways to choose $k$ out of $n$ unique items The number of different ways to choose $k$ out of $n$ unique items:   Without repetition and without order-significance: $\binom{n}{k}=\frac{n!}{k!(n-k)!}$ Without repetition and with order-significance: $\binom{n}{k}\times k!=\frac{n!}{(n-k)!}$ With repetition and with order-significance: $n^k$ With repetition and without order-significance: $?$   Thank you! E: Unable to correct problems, you have held broken packages Using lasso for feature selection, followed by a non-regularized regression I use Lasso logistic regression in order to identify a smaller subset of important variables. I start with N=51 (28/23) and 32 predictors.   So far it looks pretty promising, because I can identify four important predictors in my optimal model.   Now I would like to take those four predictors and examine them along with some control variables in a standard logistic regression.   My question is, does that analysis strategy make sense? Is there a better way to include controls or other variables that might be interesting?  For a better understanding:   Identify important variables via Lasso logistic regression Do further analysis including identified predictors and other control variables using standard logistic regression (using AIC to check model fit) Use a partitioned live usb I have a USB device and i'm trying to create it in a way that it has 2 partitions: one for a live linux disc and the other for document storage.  I created the partitions using gparted and and set a boot flag to the one I want to use as the live disc. Now, I have a usb like this:  Disk /dev/sdc: 14.6 GiB, 15623782400 bytes, 30515200 sectors Units: sectors of 1 * 512 = 512 bytes Sector size (logical/physical): 512 bytes / 512 bytes I/O size (minimum/optimal): 512 bytes / 512 bytes Disklabel type: dos Disk identifier: 0xc3072e18  Device     Boot   Start      End  Sectors  Size Id Type /dev/sdc1       8439808 30515199 22075392 10.5G 83 Linux /dev/sdc2  *      51200  8439807  8388608    4G  b W95 FAT32   I then used dd to flash an Ubuntu iso to /dev/sdc2  sudo dd if=/dev/shm/ubuntu-17.04-desktop-amd64.iso of=/dev/sdc2 bs=4M   When the disc is flashed onto the usb drive, I try to boot from my laptop and it shows "Operating system not found". When i try to use qemu/kvm, it shows a kernel panic like this:    How would I be able to do this properly? Possible to have the default landing page of my Sharepoint Site be an applicaiton page? So basically when someone goes to:   http://mysite.com   I would like to show an Application Page that I have created, without the giant URL.  Example of the giant URL :  http://mysite.com/_layouts/ap/myAppPage.aspx   Is there any way for me to do this? Yes, I know the topic has been discussed before. I know that Meta already has threads that complain about how flagging doesn't work. I wanted to give a practical example.  Today, a  came in to the  chat and asked the :  Hey guys, as soon as I embed javascript, all my html elements are gone. Even if the script is empty!? ...Can anyone help out? The example is really minimalistic &lt;script type='text/javascript' src=&quot;http://ajax.googleapis.com/ajax/libs/jquery/2.0.3/jquery.min.js&quot;/&gt; &lt;script type='text/javascript' src=&quot;script.js&quot;/&gt; These lines make everything vanish. script.js is empty! I use google chrome and the file is on localhost  Some context:  The JS room encourages people to come and ask questions that are too small/badly put for main. The room encourages people to just ask questions rather than ask to ask. In fact we even have a bot that prompts users to just ask if they have a question whenever they join. The above user has a good Q to A ratio having 1K rep in the main site and over 80 answers. The user has no negative context in the chat. No previous offenses or anything like that.  That message got 7 flags  Had a mod (ThiefMaster) not been present and invalidated those flags in time that user would have probably been suspended from the chat. This is bad, it sends the wrong message and it is very rude. Now, some other rooms don't allow people to just come and ask questions right away so maybe users from other rooms validated the flag. Maybe users thought he was being rude? I don't know. I do know that we don't want this sort of negative atmosphere in the JS room (and I'm sure other useful rooms such as PHP don't want it either), we have enough on our hands trying to maintain a community while helping people joining and handing with vamps/trolls. Possible solutions:  Drop spam/offensive flags altogether. Make spam/offensive flags room specific for big enough (tm) rooms. Give room owners just the ability to invalidate spam/offensive flags. I've been reading through a lot of the rookie Java questions on finalize() and find it kind of bewildering that no one has really made it plain that finalize() is an unreliable way to clean up resources.  I saw someone comment that they use it to clean up Connections, which is really scary since the only way to come as close to a guarantee that a Connection is closed is to implement try (catch) finally.    I was not schooled in CS, but I have been programming in Java professionally for close to a decade now and I have never seen anyone implement finalize() in a production system ever.  This still doesn't mean that it doesn't have its uses, or that people I've worked with have been doing it right.  So my question is, what use cases are there for implementing finalize() that cannot be handled more reliably via another process or syntax within the language?    Please provide specific scenarios or your experience, simply repeating a Java text book, or finalize's intended use is not enough, as is not the intent of this question. How to change the background color only for the current page? Sometimes when attempting to capture a Pokémon, the mon will be wiggling in the ball and the app will disconnect from servers (for mobile connection reasons or whatever), and I'll be left staring at a ball containing Schrodinger's Pokémon. I'll sigh at the loss (or in the case of a 500CP Pinsir, scream in agony), and reload the game.  I thought maybe encounters in general couldn't handle disconnecting well, but sometimes immediately after a Pokémon broke free of a ball, the little icon in the upper left would appear, the game would stall for a bit, but it would recover.   Is there anything I can do to avoid this? Should I be waiting it out, instead of reloading?  (and before anyone says it, yes I have filed a bug report) Suppose that $f:\mathbb{C}\rightarrow\mathbb{C}$ is analytic on the open unit disc and continuous on the closed unit disc. Assume that $f(z)=0$ on an arc of the circle $\{z\in\mathbb{C}:|z|=1\}$. Show that $f(z)=0$. Re-Structuring a JSON Are global variables bad? In C/C++, are global variables as bad as my professor thinks they are? Is "connected, simply connected" Redundant? Here are my definitions of &quot;connected&quot; and &quot;simply connected.&quot;  A topological space $X$ is connected if and only if it is not the union of two nonempty disjoint open sets. A topological space $X$ is simply connected if and only if it is path-connected and has trivial fundamental group (i.e. $\pi_1(X)\simeq\{\mathrm{e}\}$ and $|\pi_0(X)|=1$).  It is a classic and elementary exercise in topology to show that, if a space is path-connected, then it is connected. Thus, if a space is simply connected, then it is connected. Yet, despite this implication, I've read several cases where the words &quot;connected, simply connected&quot; appear together. For example, in Kobayashi and Nomizu's Foundations of Differential Geometry, Volume 1, page 252, the following is written: &quot;Let $M$ be a connected, simply connected analytic manifold with an analytic linear connection.&quot; In  and  (Links to Journal Storage, also known as JSTOR), they use &quot;connected, simply connected&quot; on their first page. The first of these takes it a step further, referring to &quot;closed, compact, connected, simply connected $4$-manifolds,&quot; where a closed manifold (unfortunate terminology) is defined as a compact manifold without boundary. My question is simple: Why use the words &quot;connected, simply connected&quot; when being simply connected implies connectedness? Thank you.