AMD Ati Radeon HD 4870 Drivers on Ubuntu 14.04 I have a computer with Ubuntu 14.04 installed and I have a Radeon HD 4870 (RV770) video card and I want to install Ati drivers but when I download it says this:  Distro Version entered incorrectly or not supported, use --listpkg to identify valid distro versions   The latest drivers in AMD web doesn't mention my graphic card so I don't know if it works...
Radeon HD 2000, 3000, 4000 on Ubuntu 12.04.2 and higher: fglrx (legacy) unsupported, what to do? After upgrading to 12.10 quantal, the packaged version of fglrx no longer works. I discovered that this is because there is a separate 'legacy' fglrx driver for the HD 2k-4k series cards, but it is incompatible with the xorg server on 12.10.  This is the most current version of the driver for HD 2000 through HD 4000 series cards. You can't use the non-legacy fglrx driver, but you can use the open-source radeon driver if you prefer your WM compositing to be laggy and your YouTube videos to play like they would on a Pentium MMX series:    Usually this driver can be installed in the following way, necessary because apt-get install fglrx would pull in the non-legacy driver:  wget http://www2.ati.com/drivers/legacy/amd-driver-installer-12.6-legacy-x86.x86_64.zip unzip amd-driver-installer-* sudo sh ./amd-driver-installer-*.run --buildpkg Ubuntu/quantal sudo dpkg -i fglrx*.deb sudo aticonfig --initial -f   If you use a different version of fglrx (for example, a newer 12.9 that doesn't support those cards) then the final command will give you an error no supported hardware detected or something similar. However, everything works at this point and you will get a reasonable xorg.conf:  ... other stuff  Section "Device"         Identifier  "aticonfig-Device[0]-0"         Driver      "fglrx"         BusID       "PCI:1:5:0" EndSection  ... other stuff   At this point you're supposed to reboot and everything will be working with the fglrx driver. However, upon rebooting, you'll be treated to the following errors in Xorg.0.log when fglrx attempts to load:  (EE) Failed to load /usr/lib/xorg/modules/drivers/fglrx_drv.so: /usr/lib/xorg/modules/drivers/fglrx_drv.so: undefined symbol: noXFree86DRIExtension   Some searching around will show that this is a problem with the legacy ATI drivers not supporting xserver 1.13 or newer. () ATI has released a fixed driver for its most recent (HD 5000 series or later) cards, but not for the 'legacy' cards yet. The non-legacy ATI drivers can't be used with the old cards.  What should an Ubuntu user, using one of these HD 2000-4000 series cards, do?    Wait for an updated 'legacy' ATI driver that properly works with xserver 1.13?   Downgrade back to 12.04 Precise, which uses xserver 1.11? Try to downgrade xserver on 12.10 Quantal to 1.12, which could possibly break Unity and GNOME? Forced upgrade to HD 5000 series or later card? (Not possible with integrated graphics...) Some other 1337 action that fixes this problem painlessly?
how do i change the color of typeface on photoshop? In which ways did scanning Nero's ship enhance/change Starfleet technology? I've heard the explanation that the Enterprise from 2009's Star Trek looked so much more advanced was because data gathered from the Kelvin initially scanning Nero's ship when it first appeared enabled them to upgrade their tech. I'm wondering if they've ever detailed exactly what technologies were advanced or enhanced or discovered. Group of even order contains an element of order 2 Where, in the Windows 7 file system, are the taskbar shortcuts stored (per user)? Dual Canadian and British citizen - healthcare coverage in the UK? I want to know if I am entitled to medical assistance in the UK while visiting for 3 weeks in June. I am travelling on my Canadian passport since my UK one is outdated. How should self-deletes be evaluated in the question ban algorithm? A self-deleted post is often not a low-quality post and may simply be a mistake noticed by the user, unlike moderator- or community-deleted posts which may indicate serious problems that the user may not recognize or may have intentionally posted.  Should they carry less weight in the question ban algorithm? How to justify $\phi(n) \ge \sqrt{n}$ If $\phi(n)$ is the Euler-totient function, how can I show that $\phi(n) \ge \sqrt{n}$? The  is essentially that the nucleus is a ball and the electrons are balls orbiting the nucleus in a rigid orbit.    This  chemists to find a model of chemical bonding where the electrons in the outer orbits could be exchanged. And it works pretty well as seen in the Lewis structures:    However,  were found to be less rigid and instead be fuzzy fields which, instead of being discrete/rigid orbits, look more like:     However, in chemistry education like organic chemistry you still learn about chemical reactions using essentially diagrams that are modified lewis structures that take into account information about electron orbitals:    What I'm wondering is, if the Bohr model is used essentially throughout college education in the form of these diagrams, it seems like it must be a pretty accurate model, even though it turns out atoms are more fuzzy structures than discrete billiard balls. So I'm wondering what the inaccuracies are, and if there is a better way to understand them than the Bohr model. If you build a computer simulation of atoms with the Bohr model, I'm wondering if it would be "accurate" in the sense of modeling atomic phenomena, or is it not a good model to perform simulations on. If not, I'm wondering what an alternative model is that is better for simulation. Essentially, how good the Bohr model is as a diagram, as a tool for learning, and as a tool for simulation. Why does tmux set TERM variable to screen? Citing tmux man page:  The TERM environment variable must be set to “screen” for all programs running inside tmux.  New windows will automatically have “TERM=screen” added to their environment, but care must be taken not to reset this in shell start-up files.  Is this this because tmux session can be attached to any terminal (e.g. remote), screen being lowest common denominator? If I know my terminal, can I force it without unexpected results, or would some unsupported capabilities break (like scrolling)? How to enable the Edit button in Shutter? I am trying to enable the Edit button in Shutter. I installed the application from Ubuntu Software and are using Ubuntu 18.04.  After taking a screenshot the Edit button is disabled. And when hovering the mouse pointer over the button the text "Goo::Canvas/libgoo-canvas-perl needs to be installed for this feature" is shown.    I have tried to install the package libgoocanvas2-perl and restarted the computer, but the edit button is still not enabled:  sudo apt install libgoocanvas2-perl   That is the only package I can find.  Anyone that knows how to fix this? I have an ArrayList&lt;String&gt;, and I want to remove repeated strings from it. How can I do this? Why doesn't this C++0x code call the move constructor? How can I install software or packages without Internet (offline)? How can I install Sun/Oracle's proprietary Java JDK 6/7/8 or JRE? I would like to remove selected commit log entries from a linear commit tree, so that the entries do not show in the commit log.  My commit tree looks something like:  R--A--B--C--D--E--HEAD   I would like to remove the B and C entries so that they do not show in the commit log, but changes from A to D should be preserved. Maybe by introducing a single commit, so that B and C become BC and the tree looks like.  R--A--BC--D--E--HEAD   Or, ideally, after A comes D directly. D' representing changes from A to B, B to C and C to D.  R--A--D'--E--HEAD   Is this possible? if yes, how?  This is a fairly new project so has no branches as of now, hence no merges as well. Analogue of closed graph theorem This is the analogue of closed graph theorem for compact space          Suppose that $X$ and $K$ are metric spaces, that $K$ is compact, and that the graph of $f: X \rightarrow K$ is a closed subset of $X \times K$. Prove that $f$ is continuous.      Because metric space is first countable, all we need is to prove that if $x = \lim_{n \rightarrow \infty} x_{n}$, then $f(x) = \lim_{n \rightarrow \infty} f(x_{n})$. Suppose $x = \lim_{n \rightarrow \infty} x_{n}$, then because $K$ is compact, sequence $\{f(x_{n})\}$ has a subsequence $\{f(x_{n_{i}})\}$ converge. Because the graph of $f$ is closed, we must have $\lim_{n \rightarrow \infty}\{f(x_{n_{i}})\} = f(x)$. All we need to prove now is $\{f(x_{n})\}$ converge to $f(x)$, but I can't prove that. Can any one help me. I really appreciate. Thanks How to modify the system default background image I am about to ship a new 10.04 installed system to a customer. This is the 1st system that we are shipping with our preinstalled software and an additional hardware test platform, so I thought it would be a nice idea to have the desktop wallpaper include our company's logo.  What I want to do is just to add the logo to the default background image. the questions are:   Where are the set of backgrounds stored? What are the rules for creating a custom background from scratch? If I create a background from scratch, how do I add it to the system's background set (i.e., not just save it in the user's Pictures directory - I want it to be available to all future users of the machine)? Can you get a Windows (AD) username in PHP? I have a PHP web application on an intranet that can extract the IP and host name of the current user on that page, but I was wondering if there is a way to get/extract their Active Directory/Windows username as well. Is this possible? Probability Problem with $n$ keys A woman has $n$ keys, one of which will open a door. a)If she tries the keys at random, discarding those that do not work, what is the probability that she will open the door on her $k^{\mathrm{th}}$ try?  Attempt: On her first try, she will have the correct key with probability $\frac1n$. If this does not work, she will throw it away and on her second attempt, she will have the correct key with probability $\frac1{(n-1)}$. So on her $k^{\mathrm{th}}$ try, the probability is $\frac1{(n-(k-1))}$ This does not agree with my solutions.   b)The same as above but this time she does not discard the keys if they do not work.  Attempt: We want the probability on her $k^{\mathrm{th}}$ try. So we want to consider the probability that she must fail on her $k-1$ attempts. Since she keeps all her keys, the correct one is chosen with probability $\frac1n$ for each trial. So the desired probability is $(1-\frac{1}{n})^{k-1} (\frac1n)^k$. Again, does not agree with solutions.  I can't really see any mistake in my logic. Can anyone offer any advice? Many thanks How can I clone an ArrayList and also clone its items in Java?  For example I have:  ArrayList&lt;Dog&gt; dogs = getDogs(); ArrayList&lt;Dog&gt; clonedList = ....something to do with dogs....   And I would expect that objects in clonedList are not the same as in dogs list.