Search Results

Search found 69096 results on 2764 pages for 'theoretical problem'.

Page 353/2764 | < Previous Page | 349 350 351 352 353 354 355 356 357 358 359 360  | Next Page >

  • Ubuntu 11.10 cannot boot. It stucks at BusyBox

    - by Ivan Dokov
    I am using Ubuntu 11.10. An hour ago I had my laptop Sony Vaio VPCEB1S1E running. I saw there are updates to install and I installed them. Turned off the laptop and now when I want to turn it on. It loads until BusyBox v1.18.4 appear. I've saw what the people suggest in other askubuntu topics. I've booted Puppy Linux from USB, repaired the partition where the Ubuntu is installed. Rebooted and nothing changed. I saw other suggestions like writing "exit" in the command line when the BusyBox comes. This didn't help neither. I love the Ubuntu OS, but these days I get similar problem with not able to boot OS. The last times I could repair it with Gparted, but then it wasn't problem with the BusyBox, it was something missing in the OS, like "cannot boot /". The same problem occurred on an older version of Ubuntu 10.10 and there I've repaired it again with Gparted.

    Read the article

  • Error 255 samba share simple file share Ubuntu 14.04

    - by Rose Offthorns
    I have been using simple file share on Ubuntu 12.04 for several years not a problem now I have up graded to 14.04 all the problems error 255, tried all sights to fix the problem nothing works even went back to 12.04 still the same problem error 255 'net usershare' returned error 255: net usershare add: cannot convert name "Everyone" to a SID. The connection was refused. Maybe smbd is not running. There appears to be a bug with the new upgrade or has there been a new upgrade. Thanks for any help would be appreciated.

    Read the article

  • Can't Log in to Lubuntu 12.04 X Server

    - by isomorphismes
    As of rebooting yesterday I can't login as myself to the X server part of 64-bit Lubuntu 12.04. Same problem as Can not get passed the login screen but that solution didn't work for me. Troubleshooting steps I already took: I can log in as guest (with whatever window manager) to the graphic (X) view of Lubuntu. log in as myself into a virtual terminal. (In fact I'm writing this from w3m for that reason.) So I know my password is correct and that most aspects of the system are working. One of the top google results for "can't log into lubuntu" mentioned a disk-full problem on netbooks; I don't have that problem. Let me know if I need to paste any messages or config files to make this question clearer and I'll do so. $ ls -l /home total 12 drwxr-xr-x 99 me me 12288 May 26 14:16 me $ ls -ld /tmp drwxrwxrwt 16 root root 4096 May 26 15:46 /tmp

    Read the article

  • How to program for constraints/rules

    - by Gaurav
    First the background, during interviews in the past, many times I have been asked to design some or other variation of card game as programming puzzle, and I have tried to design it in OO way, but I have never been satisfied with my solutions. However it was not until recently that I realized that I had been approaching the problem from the wrong direction. Specifically I was trying to solve the problem by modeling individual card as an object. Problem with this is individual cards don't have any non-trivial intrinsic behavior and therefore are not suitable (or primary) candidate as objects. What is interesting and important about cards are rules and constraints, such as there could be only four suits, or only thirteen cards in each suit. Of course, then there are any number of rules for games. So my questions are Are there any idioms/constructs/patterns to program for rules & constraints. How many in 1 can be applied in conjunction with OO paradigm.

    Read the article

  • There is other ways to install Ubuntu? (not wubi, not live CD)

    - by Mauricio Andrés
    I had problems while installing ubuntu 12.04 on a samsung laptop, the problem is the AHCI sysmtem, after a lot of searching, I found that this is almost impossible to "fix" and the only way i found is too much work. I want to install Ubuntu in the 110GB free partition of my hard drive, along with windows. I have a 150GB Windows partition, a 200GB documents partition, and I want to use 110 GB for Ubuntu. The problem is that with the liveCD the installer and gparted shows that my entire hard drive is unallocated (the problem of AHCI). The only way to fix this is to do a lot of work, with a lot of risk, so the question is whether I can install Ubuntu without using either the LiveCD or Wubi.

    Read the article

  • What Counts For a DBA: Simplicity

    - by Louis Davidson
    Too many computer processes do an apparently simple task in a bizarrely complex way. They remind me of this strip by one of my favorite artists: Rube Goldberg. In order to keep the boss from knowing one was late, a process is devised whereby the cuckoo clock kisses a live cuckoo bird, who then pulls a string, which triggers a hat flinging, which in turn lands on a rod that removes a typewriter cover…and so on. We rely on creating automated processes to keep on top of tasks. DBAs have a lot of tasks to perform: backups, performance tuning, data movement, system monitoring, and of course, avoiding being noticed.  Every day, there are many steps to perform to maintain the database infrastructure, including: checking physical structures, re-indexing tables where needed, backing up the databases, checking those backups, running the ETL, and preparing the daily reports and yes, all of these processes have to complete before you can call it a day, and probably before many others have started that same day. Some of these tasks are just naturally complicated on their own. Other tasks become complicated because the database architecture is excessively rigid, and we often discover during “production testing” that certain processes need to be changed because the written requirements barely resembled the actual customer requirements.   Then, with no time to change that rigid structure, we are forced to heap layer upon layer of code onto the problematic processes. Instead of a slight table change and a new index, we end up with 4 new ETL processes, 20 temp tables, 30 extra queries, and 1000 lines of SQL code.  Report writers then need to build reports and make magical numbers appear from those toxic data structures that are overly complex and probably filled with inconsistent data. What starts out as a collection of fairly simple tasks turns into a Goldbergian nightmare of daily processes that are likely to cause your dinner to be interrupted by the smartphone doing the vibration dance that signifies trouble at the mill. So what to do? Well, if it is at all possible, simplify the problem by either going into the code and refactoring the complex code to simple, or taking all of the processes and simplifying them into small, independent, easily-tested steps.  The former approach usually requires an agreement on changing underlying structures that requires countless mind-numbing meetings; while the latter can generally be done to any complex process without the same frustration or anger, though it will still leave you with lots of steps to complete, the ability to test each step independently will definitely increase the quality of the overall process (and with each step reporting status back, finding an actual problem within the process will be definitely less unpleasant.) We all know the principle behind simplifying a sequence of processes because we learned it in math classes in our early years of attending school, starting with elementary school. In my 4 years (ok, 9 years) of undergraduate work, I remember pretty much one thing from my many math classes that I apply daily to my career as a data architect, data programmer, and as an occasional indentured DBA: “show your work”. This process of showing your work was my first lesson in simplification. Each step in the process was in fact, far simpler than the entire process.  When you were working an equation that took both sides of 4 sheets of paper, showing your work was important because the teacher could see every step, judge it, and mark it accordingly.  So often I would make an error in the first few lines of a problem which meant that the rest of the work was actually moving me closer to a very wrong answer, no matter how correct the math was in the subsequent steps. Yet, when I got my grade back, I would sometimes be pleasantly surprised. I passed, yet missed every problem on the test. But why? While I got the fact that 1+1=2 wrong in every problem, the teacher could see that I was using the right process. In a computer process, the process is very similar. We take complex processes, show our work by storing intermediate values, and test each step independently. When a process has 100 steps, each step becomes a simple step that is tested and verified, such that there will be 100 places where data is stored, validated, and can be checked off as complete. If you get step 1 of 100 wrong, you can fix it and be confident (that if you did your job of testing the other steps better than the one you had to repair,) that the rest of the process works. If you have 100 steps, and store the state of the process exactly once, the resulting testable chunk of code will be far more complex and finding the error will require checking all 100 steps as one, and usually it would be easier to find a specific needle in a stack of similarly shaped needles.  The goal is to strive for simplicity either in the solution, or at least by simplifying every process down to as many, independent, testable, simple tasks as possible.  For the tasks that really can’t be done completely independently, minimally take those tasks and break them down into simpler steps that can be tested independently.  Like working out division problems longhand, have each step of the larger problem verified and tested.

    Read the article

  • Inspiron N7110 Ubuntu 12.04 Poor WiFi Signal

    - by Joseph Risley
    Sorry if this is a repeat, I have been Googling possible answers and have not found one yet. I find my wireless signal is never 100%. Speed is fine, it's the actual signal strength that is the issue. I thought my router was the issue, but the problem was also present at the public library today. I asked the Windows and Mac users around me about their signal strength and they had full signal while mine was medium to low according to WiFiRadar. Is this a Dell problem (Realtek), or an Ubuntu problem I can fix in the terminal?

    Read the article

  • Android Cocos2DX using C++ in Eclipse Helios Windows XP

    - by 25061987
    I have used Eclipse Helios 3.6.1 for Java development. I wanted to start C++ development in the same IDE so I installed Autotools Support For CDT, C/C++ Development Tools, C/C++ Library API Documentation Hover Help plugins.I have included #include "cocos2d.h" in my HelloWorldScene.h file now when writing the below statement cocos2d::CCSprite * ccSprite; I am not getting auto completion bar(template proposals) on writing like coco and pressing Ctrl + Space from my keyboard. What can be the problem?This might help you solve my problem. Please check here. This is what I got after clicking Right Click Project - Index - Search for Unresolved Index. But I have added all includes check here. I think this is causing problem in Content Assist. What should I do in this case? Inclusion seems proper.

    Read the article

  • T-SQL Jokes

    - by Tomaz.tsql
    SQL Table walks to a psychiatrist dr. Index Table: "Doctor, I have a problem" Dr: "what kind a problem?" Table: "I'm a mess. I have things all over the place, i always look for my stuff" Dr. "No problem. I will get you in order". Index and table are reading a book "index-sutra" Table: Oh, baby tonight we can try a clustered position" Index: "yeah baby, we can also try covered position" Table: "or maybe multiple clustered position"...(read more)

    Read the article

  • How does a website like Mathway work?

    - by Bob
    I recently found a website called Mathway Basically, it works by allowing you to choose your "level of math" (which it uses to determine what tools it should provide to you) and then allows you to input a math problem which it then solves for you, and gives you detailed solutions (you have to try it, it's really cool). I was wondering how it worked on two levels. First off, how would they parse the math problem (and all the sometimes foreign mathematical operators)? How do they get from text to numbers, variables, and operators? Second, how do they generate the explanations? While you have to pay for the detailed solutions (which are explanations of how they solved the problem), I've seen their preview screenshots, and it looks very detailed. The explanations are given in full, accurate sentences. How would they generate something like that?

    Read the article

  • Project Euler 52: Ruby

    - by Ben Griswold
    In my attempt to learn Ruby out in the open, here’s my solution for Project Euler Problem 52.  Compared to Problem 51, this problem was a snap. Brute force and pretty quick… As always, any feedback is welcome. # Euler 52 # http://projecteuler.net/index.php?section=problems&id=52 # It can be seen that the number, 125874, and its double, # 251748, contain exactly the same digits, but in a # different order. # # Find the smallest positive integer, x, such that 2x, 3x, # 4x, 5x, and 6x, contain the same digits. timer_start = Time.now def contains_same_digits?(n) value = (n*2).to_s.split(//).uniq.sort.join 3.upto(6) do |i| return false if (n*i).to_s.split(//).uniq.sort.join != value end true end i = 100_000 answer = 0 while answer == 0 answer = i if contains_same_digits?(i) i+=1 end puts answer puts "Elapsed Time: #{(Time.now - timer_start)*1000} milliseconds"

    Read the article

  • Bug unsubscribing from Ubuntu One Mobile

    - by rhino
    Hi guys, I have an Ubuntu One Mobile subscription, which I can see in my subscriptions page: one.ubuntu.com/account/subscription/756082 I no longer need my Ubuntu One Mobile subscription, so click the link to cancel the Mobile service subscription: one.ubuntu.com/account/cancel/756082/ Then confirm that request to cancel: one.ubuntu.com/account/cancel/756082/confirm/ But the process ends there showing a "Something has gone wrong page", and my subscription remains active :( The same problem occurred when I attempted the same a few weeks back, so not a temporary problem I'm thinking. Any input gratefully received. I would like to report this problem directly to the maintainer of this part of the Ubuntu site but cannot see how to do that.

    Read the article

  • Theoretically bug-free programs

    - by user2443423
    I have read lot of articles which state that code can't be bug-free, and they are talking about these theorems: Halting problem Gödel's incompleteness theorem Rice's theorem Actually Rice's theorem looks like an implication of the halting problem and the halting problem is in close relationship with Gödel's incompleteness theorem. Does this imply that every program will have at least one unintended behavior? Or does it mean that it's not possible to write code to verify it? What about recursive checking? Let's assume that I have two programs. Both of them have bugs, but they don't share the same bug. What will happen if I run them concurrently? And of course most of discussions talked about Turing machines. What about linear-bounded automation (real computers)?

    Read the article

  • DDD: Service or Repository

    - by tikhop
    I am developing an app in DDD manner. And I have a little problem with it. I have a Fare (airline fare) and FareRepository objects. And at some point I should load additional fare information and set this information to existing Fare. I guess that I need to create an Application Service (FareAdditionalInformationService) that will deal with obtaining data from the server and than update existing Fare. However, some people said me that it is necessary to use FareRepository for this problem. I don't know wich place is better for my problem Service or Repository.

    Read the article

  • Why does my Ubuntu freeze in the middle of something with a blank screen?

    - by mohamed
    I am facing a serious problem as my Dell Optiplex 745 loaded with Ubuntu 12.04 32bit freezes with a blank screen no mouse cursor no keyboard activity in many occasions. Sometimes when I open firefox, or software center, I really can't tell what the main problem is, but what i am certain about is it i have to do a hard reset to reboot. I tried to use a live-cd to boot but it did the same, tried the recovery console but couldn't find a way to fix from there (I am a new user) suspected a hardware problem but windows runs flawlessly so I believe its something related to ubuntu. Specs: Intel Celeron D 3.06 GHZ 3.0 GB ram Intel built in graphics Q965 1 TB HDD Bios Phoenex 2.6.4 Please help I really love ubuntu and I don't want to go back to windows!

    Read the article

  • fat32 partition lock

    - by gsedej
    Hi! A am asking about problem with USB data stick (that uses fat32 file system). If you unplug USB stick without unmounting (safly remove) data may become locked when you mount USB stick another time (you can't make changes to files). If you unmount and mount partition few times, data becomes normally accessable. Problem is that I can not repeat (force) this problem now. But it has happend many times even recently. Has this been happening to somoeone else?

    Read the article

  • Mouse and Keyboard Freeze

    - by kev
    I installed Ubuntu 10.10 today and have had mouse problem since. Symptoms: At some arbitrary point in time (frequency: 2-3 times per hour), the mouse and keyboard stops working for ever(may be). I start System monitor, I found out network was shutdown just before mouse freeze. Some time my keyboard keep typing one key. For example:77777777777777777777777777777777777777777777777777777.....(it keep typing for 20 sec) I found out a script just solve the freeze problem:(I hit Powerbutton) -----------------/etc/acpi/powerbtn.sh------------------------ event=button[ /]power action=/usr/sbin/fix_mouse.sh -----------------/usr/sbin/fix_mouse.sh------------------------ rmmod psmouse modprobe psmouse Yesterday I install Ubuntu 10.04 FAILED also have mouse problem. When I switch back to Windows XP. The network card is down. It kept connecting and disconnecting 1 time per sec. CPU: i5 Motherboard: ASUS P7P55D OS: Windows XP + Ubuntu 10.10 Video Card: ATI 5770 Mouse,Keyboard: PS/2

    Read the article

  • Pressing p in dash results in weird B

    - by ayckoster
    Today I tried to open Skype in my dash and discovered that my "p" key does not work properly. Instead of p I get B. In every other application the key works properly. When I copy the text "skyBe" from dash into another application it sais "skype". I tried every other character and they seem fine, it's only the "p" key. I think that the problem is dash. Anyone else has the same problem? Here is an image. I enter "skype" and get this: What causes this problem and how can I fix it? Environment: Lenovo W500 with German keyboard Ubuntu 12.10 Language settings: English Keyboard layout: German

    Read the article

  • PASS Summit 2011 &ndash; Part III

    - by Tara Kizer
    Well we’re about a month past PASS Summit 2011, and yet I haven’t finished blogging my notes! Between work and home life, I haven’t been able to come up for air in a bit.  Now on to my notes… On Thursday of the PASS Summit 2011, I attended Klaus Aschenbrenner’s (blog|twitter) “Advanced SQL Server 2008 Troubleshooting”, Joe Webb’s (blog|twitter) “SQL Server Locking & Blocking Made Simple”, Kalen Delaney’s (blog|twitter) “What Happened? Exploring the Plan Cache”, and Paul Randal’s (blog|twitter) “More DBA Mythbusters”.  I think my head grew two times in size from the Thursday sessions.  Just WOW! I took a ton of notes in Klaus' session.  He took a deep dive into how to troubleshoot performance problems.  Here is how he goes about solving a performance problem: Start by checking the wait stats DMV System health Memory issues I/O issues I normally start with blocking and then hit the wait stats.  Here’s the wait stat query (Paul Randal’s) that I use when working on a performance problem.  He highlighted a few waits to be aware of such as WRITELOG (indicates IO subsystem problem), SOS_SCHEDULER_YIELD (indicates CPU problem), and PAGEIOLATCH_XX (indicates an IO subsystem problem or a buffer pool problem).  Regarding memory issues, Klaus recommended that as a bare minimum, one should set the “max server memory (MB)” in sp_configure to 2GB or 10% reserved for the OS (whichever comes first).  This is just a starting point though! Regarding I/O issues, Klaus talked about disk partition alignment, which can improve SQL I/O performance by up to 100%.  You should use 64kb for NTFS cluster, and it’s automatic in Windows 2008 R2. Joe’s locking and blocking presentation was a good session to really clear up the fog in my mind about locking.  One takeaway that I had no idea could be done was that you can set a timeout in T-SQL code view LOCK_TIMEOUT.  If you do this via the application, you should trap error 1222. Kalen’s session went into execution plans.  The minimum size of a plan is 24k.  This adds up fast especially if you have a lot of plans that don’t get reused much.  You can use sys.dm_exec_cached_plans to check how often a plan is being reused by checking the usecounts column.  She said that we can use DBCC FLUSHPROCINDB to clear out the stored procedure cache for a specific database.  I didn’t know we had this available, so this was great to hear.  This will be less intrusive when an emergency comes up where I’ve needed to run DBCC FREEPROCCACHE. Kalen said one should enable “optimize for ad hoc workloads” if you have an adhoc loc.  This stores only a 300-byte stub of the first plan, and if it gets run again, it’ll store the whole thing.  This helps with plan cache bloat.  I have a lot of systems that use prepared statements, and Kalen says we simulate those calls by using sp_executesql.  Cool! Paul did a series of posts last year to debunk various myths and misconceptions around SQL Server.  He continues to debunk things via “DBA Mythbusters”.  You can get a PDF of a bunch of these here.  One of the myths he went over is the number of tempdb data files that you should have.  Back in 2000, the recommendation was to have as many tempdb data files as there are CPU cores on your server.  This no longer holds true due to the numerous cores we have on our servers.  Paul says you should start out with 1/4 to 1/2 the number of cores and work your way up from there.  BUT!  Paul likes what Bob Ward (twitter) says on this topic: 8 or less cores –> set number of files equal to the number of cores Greater than 8 cores –> start with 8 files and increase in blocks of 4 One common myth out there is to set your MAXDOP to 1 for an OLTP workload with high CXPACKET waits.  Instead of that, dig deeper first.  Look for missing indexes, out-of-date statistics, increase the “cost threshold for parallelism” setting, and perhaps set MAXDOP at the query level.  Paul stressed that you should not plan a backup strategy but instead plan a restore strategy.  What are your recoverability requirements?  Once you know that, now plan out your backups. As Paul always does, he talked about DBCC CHECKDB.  He said how fabulous it is.  I didn’t want to interrupt the presentation, so after his session had ended, I asked Paul about the need to run DBCC CHECKDB on your mirror systems.  You could have data corruption occur at the mirror and not at the principal server.  If you aren’t checking for data corruption on your mirror systems, you could be failing over to a corrupt database in the case of a disaster or even a planned failover.  You can’t run DBCC CHECKDB against the mirrored database, but you can run it against a snapshot off the mirrored database.

    Read the article

  • Designing Algorithm Flowchart Application

    - by l46kok
    I need to develop an GUI application in C# where users can freely add conditional/statement blocks on the algorithm flowchart like the one shown below. By freely, I mean users can add a block on wherever the arrows are. I'm having some problems brainstorming how to approach this problem, especially what to choose for my datastructure to store the blocks. I was thinking LinkedList since everything follows a linear fashion and every node always has a head and tail, but the If/Else block (ba) has two branches (heads) to store, so this complicates things a little bit. How would a smart one approach problems like this? My apologies if this question isn't suited for Programmers stackexchange, but this is more of a conceptual problem rather than implementation problem so I figured this place was appropriate for the question.

    Read the article

  • embedding LEFT OUTER JOIN within INNER JOIN

    - by user3424954
    I am having some problems with one of the question's answered in the book "SQL FOR MERE MORTALS". Here is the problem statement Here is the Database Structure Here is the answer which I am unable to comprehend Here is an answer which looks perfect to me Now the problem with the first answer I am having is: We first use LEFT OUTER JOIN for recipe class and recipes. So it selects all recipe class rows but only matching recipes. Perfecty fine as the question is demanding. Lets call this result set R. Now in the next step when we use INNER JOIN to join RecipieIngridients, it should filter out the rows from R in which Recipie ID doesn't match with the Recipe Id in Recipie Ingredients and hence filtering out the related Recipe class and recipe description also(Since it filters out the entire row of R). So this contradicts with the problem which demands all recipieID and RecipieDescription to be displayed from Recipe_Classes Table in this very step only. How can it be correct. Or Am i Missing some concept.

    Read the article

  • "/usr/bin/ld: cannot find -lboost_python-mt" error when installing pycuda 2011.2.2

    - by maxrider11
    I am installing pycuda2011.2.2 on ubuntu 11.10, but can't complete it. When i do pycuda-2011.2.2 $ make -j 4 I get this error: /usr/bin/ld: cannot find -lboost_python-mt , /usr/bin/ld: cannot find -lcuda I got 1 exact problem match in google search and solution as well : $ sudo ln -s /usr/lib/libboost_python-mt-py26 /usr/lib/libboost_python-mt But booooom, My problem doesn't vanish. It makes me wonder that why there are no relavant results in google search, as if only I have this problem. What is wrong ? Any help is appreciated. Thanks,

    Read the article

  • Why can't I refresh the list of packages?

    - by Elysium
    This might be a duplicate, but I can't find a solution in other posts. Whenever I try to update I get this message: ERROR###ERROR###ERROR###ERROR###ERROR###ERROR###ERROR E:Encountered a section with no Package: header, E:Problem with MergeList /var/lib/apt/listspackages.medibuntu.org_dists_quantal_free_i18n_Translation-en, E:The package lists or status file could not be parsed or opened. I have tried runnig this in the terminal: sudo rm /var/lib/apt/lists/* -vf sudo apt-get update It doesn't work at all. I cant even open the software sources and "sudo apt-get check" gives me this message: Reading package lists... Error! E: Encountered a section with no Package: header E: Problem with MergeList /var/lib/apt/lists/packages.medibuntu.org_dists_quantal_free_i18n_Translation-en E: The package lists or status file could not be parsed or opened. UPDATE: solution for me was to remove the medibuntu-keyring through synaptic manager and removed mediubuntu from the software sources too manually. This seems to have solved the problem. The update manager doesnt give me any error messages anymore.

    Read the article

  • Internal Mic Ubuntu 12.04 on Compaq Presario CQ50

    - by Genius FDE
    I have problem with the internal microphone not working on Ubuntu 12.04. It looks like a common problem on most of the laptops running ubuntu 12.04. I tried a lot of possible solutions available online but nothing seems to work! sudo aplay -l gives: **** List of PLAYBACK Hardware Devices **** card 0: NVidia [HDA NVidia], device 0: CONEXANT Analog [CONEXANT Analog] Subdevices: 1/1 Subdevice #0: subdevice #0 card 0: NVidia [HDA NVidia], device 3: HDMI 0 [HDMI 0] Subdevices: 1/1 Subdevice #0: subdevice #0 By the way, the Laptop has no HDMI port! I've seen the same problem with Sony laptop but the mic was working with too much static noise. Thank you.

    Read the article

  • Multiple problems while installing Ubuntu 13.04 on LENOVO G500 laptop

    - by Balazs Kiss
    Dear Community, I encountered several problems when installing Ubuntu on my new Lenovo G500 laptop. First I bumped in the problem (also reported by many other) of the black screen after booting Ubuntu. This problem I recould solve by changing the "quiet splash" record of GRUB to "nomodeset". Ubuntu install was successful then. After the installation, I had a black screen again when booting up for the first time. I booted up again with "nomodeset", and enabled the external AMD driver at Hardware Drivers. Booting still do not worked (only with nomodeset), and when I log in, the system gives me a "System program problem detected" message, and the system (desktop) does not load in. Please, can you advise me what to do? Shall I re-install Ubuntu? What are the steps to make my ubuntu work with this harver? Hardware: LENOVO G500 with IntelCore i5-3230M 3,2Ghz processor and AMD Radeon HD8570 integrated chip Thank you for your help in advance!

    Read the article

< Previous Page | 349 350 351 352 353 354 355 356 357 358 359 360  | Next Page >