Netbook display corrupted I use xubuntu 16.04,  After starting the os the display is 75% corrupted:    After that, if I suspend (sleep) the Netbook and then awake it, it shows everything correctly. It happened only on    xubuntu 17.10 xubuntu 16.04 (only if I do an upgrade, in original version it doesn't happen) xubuntu 14.10 (I think same like 16, without upgrade it works normally)   My netbook is .
My computer boots to a black screen, what options do I have to fix it? I am trying to boot Ubuntu on my computer.  When I boot Ubuntu, it boots to a black screen.  How can I fix this? Table of Contents:
Discouraged by simple Bayesian Question My university is testing an intro Machine Learning (ML) course for us undergrads, and having been interested in ML since the beginning to understand what it was, I jumped at the chance to take it. But being someone who has not been back in school for a long time and much busier than I was in my first years long ago, I am finding that I need more info and examples than the class in its current form has.  I am struggling to figure out what the attached question is asking. I am searching online for help with this particular topic, but I am also finding that everyone seems to have their own way of phrasing similar questions in such a way that I am finding it hard to link the info.   My understanding from stats way back when is that $p(x|\omega_1)$ is stating the probability of $x$ given $\omega_1$ for $0\le x \le 2$ and zero other wise. Same obviously if given $\omega_2$. If I understand, the priors are the probability of $\omega_1$ and $\omega_2$ which are somehow obtained. And honestly that is as far as I am really comprehending. I am not sure what (a) and (b) are truly asking for or how to get them. If anyone is able to help me with some pointed info on the topic it would be greatly appreciated. Evaluating $\lim\limits_{n\to\infty} e^{-n} \sum\limits_{k=0}^{n} \frac{n^k}{k!}$ I'm supposed to calculate: $$\lim_{n\to\infty} e^{-n} \sum_{k=0}^{n} \frac{n^k}{k!}$$ By using WolframAlpha, I might guess that the limit is $\frac{1}{2}$, which is a pretty interesting and nice result. I wonder in which ways we may approach it. Accidentally hit "toggle full screen", How do I exit? I'm stuck in full screen in the node editor. Escape isn't working, and I have no menus and no idea how to leave except to quit Blender and reopen the program. Raise bounty on question The scroll bar is hidden on MacBook if the user doesn't move the mouse for some time.  This pattern is also used in other devices too, for example Android devices.  The scroll bar does not take much place but it informs a user of where on page he is.  Is it a good approach hiding the scroll bar when the user is presumed viewing the content? I recently upgraded my CPU from an Athlon II X2 250 to the Athlon II X4 610E(45W 4 cores -- can't beat the efficiency).  Is an ubuntu reinstall required? Different Google Searches return different titles for the same page Galactic Rotation Speeds - Ehrenfest Paradox, Gravitational time dilation, Dark Matter - all of the above? Adding Facebook Online Account - "application you are trying to use doesn't exist or has been disabled" If you draw two cards, what is the probability that the second card is a queen? I have a media server (Windows 8) located in a very inconvenient part of my house. Occasionally I will have to reset my router or it will reset itself. The issue is the PC loses connectivity for some reason, and I am forced to walk outside, around the house, into the basement, over a bunch of toys and weights and boxes, to push a button to reboot it.  I would love to have it check itself every 5-10 minutes and auto reboot if it is unable to ping a given address/IP.  Any ideas how to accomplish this? With Glade Designer that lets you set up Gtk-Ui's you can check the option that windows are not shown in the launcher. If I take a look at the ui-file generated by Glade, it says &lt;property name="skip_taskbar_hint"&gt;True&lt;/property&gt;. In gtk code this hint is  window.set_property('skip-taskbar-hint', True). However I believe that this option is not exclusively Gtk-specific, and want to apply this one on my PyQt4-app. The Ubuntu window manager must be able to receive that hint, otherwise I would see the window of a gtk-application i use (stickynotes-indicator). So there MUST be a way of doing this in Qt or any other language, right?  Does anybody know such an option? Python or Qt syntax, doesn't matter! Migrate to *any* site? Wouldn't it be a good idea to be able to vote for questions to be moved to any Stack Exchange site? For example, I just voted  as off topic, but that was all I could do. I wish I could've voted it be moved to .  It's OK to have the predefined list of sites that is now when voting to move, but it would be nice to have a more link, where we could pick any Stack Exchange site.  Here's a quick mockup of how I see this implemented:    When the more link is clicked, a list of all the Stack Exchange sites should appear. In MTG, what happens when a player loses in multiplayer? In Magic: The Gathering, the rules for a player losing in a multiplayer game are quite complex, so I'd like to try to understand them by example. I would be happy to ask each of these situations as a separate question if that is preferred, but they all seem related, and I would love to have one place to look up all of these answers.  Let's say I'm playing with two friends, Bob and Chloe, in a simple free for all. Unfortunately, I lose. When I lose, suppose the following:   I controlled an  which has exiled Bob's , does he get his bear back? I have a  on the stack targeting Chloe, does Chloe take the 2 damage still? Earlier in the turn I cast  to prevent damage to one of Bob's . If it later takes 3 damage, will that damage be prevented? Something I controlled gave Bob a 1/1 soldier token. What happens to the token? Something Chloe controlled gave me a 1/1 soldier token. What happens to the token? I had a  enchanting one of Bob's army of . What happens to the bear? I had also played  on Bob's final . What happens to the last bear? Chloe had  my . What happens to the Clone? Are there any other situations specifically addressed by the rules? I have an iPhone with 100+ notes that I've collected over the last ten years (thanks to migrating from my PalmPilot). I realize that I can now synchronise these with Gmail, but that doesn't allow me to edit them from my computer. I'd rather switch to use a new app/website combo which allows for online editing of notes, automatic OTA syncing, etc.  It seems like Simplenote and Evernote are two of the better app/sites, as mentioned at  and from this , I think Simplenote is exactly what I'm looking for. The problem is, I can't figure out how to migrate all of my existing notes into whatever new notes app I choose.  How do I migrate my existing Apple iOS Notes into Simplenote or Evernote?  The best workaround I've found so far is to open each note, select all, copy, and create a new note in the iOS app but I'd rather not spend the time and hassle doing this for ~100 notes. Let $A\in M_{n\times n}(\Bbb R)$ so that $I\notin span(A,A^2,...,A^n)$. Prove that $\det(A)=0$.   I was thinking of showing $A$ is not invertible, meaning it has an eigenvalue of $0$. Since no matter the power you give to $A$, it is still not the identity, you can deduce that at least one eigenvalue is indeed $0$. However this doesn't work if you have different eigenvalues in the Matrix, so I got stuck.  Help will be most appreciated. What is the most popular open source password manager which I can use on a Ubuntu machine or preferably across Ubuntu/Windows machines with some form of data compatibility. If there is a free web based version, that would be even more preferable. I stumbled across this paragraph in a paper:     Hence, user b cannot decrypt C   directly. But using e and d , user b   can quickly factor N.   How is  it possible to speedup the prime factorization when knowing e (public key) and d (private key)?  For clarification:  RSA provides us with these equations:  $n = pq$   $\phi = (p-1)(q-1)$   $gcd(e, \phi) = 1$   $de = 1\pmod{\phi}$   In order to determine $p$ and $q$ an attacker has to factor n which is not feasible. However the paper stated that it is easy to reconstruct $p$ and $q$ when a person knows both (his) private and public keys. Passing custom string into a Salesforce email template. Few application icons not appearing in Ubuntu Dock after upgrading to Ubuntu 17.10