Daily Archives

Articles indexed Thursday April 1 2010

Page 72/126 | < Previous Page | 68 69 70 71 72 73 74 75 76 77 78 79  | Next Page >

  • Getting around the lack of GPT support with CentOS 5.4

    - by sxanness
    Here is my issue and I hoping that there is someone out there that has an answer so I don't end up stuck here at my co-location all day. Last night I came here and upgraded a server (Dell 2970) to have four 1TB Hard Drives in RAID 5 which leaves a 3TB block. I tried to partition this but keep getting an error that GPT is not supported so I found a site online telling me I need to run the dd command and right random data to /dev/sda. This is great (if it works) but taking forever. I have two more machines to upgrade today and not a chair in site. Does anyone have advice on how I can avoid this issue beforehand? Thank You for your advice and support.

    Read the article

  • How do I "link narrations" in PowerPoint 2010 Beta?

    - by Zack Peterson
    I can record narration with PowerPoint 2010, but it seems that it will only embed it into the presentation file. Older versions of PowerPoint allowed the audio to be saved as external sound files. I'd like to perform noise-reduction and minor editing outside of PowerPoint. Has Microsoft removed the "link narrations" option from PowerPoint 2010?

    Read the article

  • samba shares dissapear everynight

    - by Crash893
    I have ubuntu 8.04lts and recently a weird problem has been cropping up. every night something happens and in the morning my coworkers cant see the shares. If i try to remote into the machine via ssh i don't get a prompt . when i rebooted the machine i would get a "video cannot be displayed in this mode" screen and no other activity on the box. I booted from grub into recovery and tried doing a package repair (keeping my smb.conf) and that didn't seem to do anything after a few other reboots I was able to get it to come up (im not sure what i did) yesterday it did teh same thing i booted to recovery then did a repair xserver and it came right up so i thought that resovled the issue but then today same thing anyone have any idea on what i can look for (im very new to linux in general) worst case sennerio can i just reinstall ubuntu over again with out blowing out the data?

    Read the article

  • SEO - Your Ideal Search Options

    As a regular researcher, you will see that you tend to click on the first result that your search engine offers. If you own a website, you know how frustrating all this can get if your name fails to make even the first ten pages.

    Read the article

  • Tips for Generating Leads from Your Website

    The article 'Tips for Generating Leads' is helpful to all those website owners who are continuously striving to fulfill the customers' needs. After reading this article you will be able to treat your customer as a king through WebPages. The article will help in generating leads, which is the primary target of any website.

    Read the article

  • Best way to code a webservice in weblogic?

    - by John
    I am new to Weblogic and J2ee. I need to build a webservice that simply runs a query on the backend database (DB2 zOS) and returns the results. Being new to this I have a few questions. 1) What is the best way to build the webservice? 2) How do I connect to the database with weblogic. 3) Is there a way to cache the data returned so that the next request for the same data is pulled from cache? If googled for this but there seems to be many way to handle this. I am looking for the best way that can handle a high volume of requests. Any links to sample code would be helpful. - Thanks

    Read the article

  • SQL Query to delete oldest rows over a certain row count?

    - by Casey
    I have a table that contains log entries for a program I'm writing. I'm looking for ideas on an SQL query (I'm using SQL Server Express 2005) that will keep the newest X number of records, and delete the rest. I have a datetime column that is a timestamp for the log entry. I figure something like the following would work, but I'm not sure of the performance with the IN clause for larger numbers of records. Performance isn't critical, but I might as well do the best I can the first time. DELETE FROM MyTable WHERE PrimaryKey NOT IN (SELECT TOP 10,000 PrimaryKey FROM MyTable ORDER BY TimeStamp DESC)

    Read the article

  • Python equivalent of mysql_real_escape_string, for getting strings safely into MySQL?

    - by AP257
    Hi all Is there a Python equivalent of PHP's mysql_real_escape_string? I'm trying to insert some strings into a MySQL db direct from Python, and keep getting tripped up by quotes in the strings. mysql_string = "INSERT INTO candidate (name, address) VALUES " for k, v in v_dict.iteritems(): mysql_string += " ('" + v_dict['name'] + "', '" + v_dict['address'] + "'), " mysql_string += ";" cursor.execute(mysql_string) I've tried re.escape() but that escapes every non-alphanumeric character in the strings, which isn't what I need - I just need to escape single quotes in this instance (plus more generally anything else that might trip up MySQL). Could do this manually I guess, but is there a smarter way to do it in Python?

    Read the article

  • Xrandr errors. BadName (named color or font does not exist)

    - by Jlbelmonte
    Hi, I've been looking and googling a lot, but I didn't find a solution to this problem. I was successfully using xrandr to extend my desktop in my work place with this little "script". #!/bin/sh xrandr --newmode 1920x1080 220.64 1920 2056 2264 2608 1080 1081 1084 1128 -HSync +Vsync xrandr --addmode VGA 1920x1080 xrandr --output VGA --mode 1920x1080 Everything was going well till one day that magically stop working. When I try to use it. I just get this message. X Error of failed request: BadName (named color or font does not exist) The laptop display resizes in a strange way, but nothing happens with the extended monitor. I've restored gnome desktop default config. I changed the font config, I tried with other layouts and monitors, but always occur the same. So any Idea will be welcomed. My best regards.

    Read the article

  • DataTable display problem in jsf1.1

    - by johnbritto
    I have two datatables. One is to display names. Another contains three <h:selectOneMenu>. I want combine those two datatables. I don't know how to do it? Expected result: ----------------------------------------------- Datatable1 Datatable2 ----------------------------------------------- Lic Date month year Premium Date month year Test Date month year

    Read the article

  • Am I abusing Policies?

    - by pmr
    I find myself using policies a lot in my code and usually I'm very happy with that. But from time to time I find myself confronted with using that pattern in situations where the Policies are selected and runtime and I have developed habbits to work around such situations. Usually I start with something like that: class DrawArrays { protected: void sendDraw() const; }; class DrawElements { protected: void sendDraw() const; }; template<class Policy> class Vertices : public Policy { using Policy::sendDraw(); public: void render() const; }; When the policy is picked at runtime I have different choices of working around the situation. Different code paths: if(drawElements) { Vertices<DrawElements> vertices; } else { Vertices<DrawArrays> vertices; } Inheritance and virtual calls: class PureVertices { public: void render()=0; }; template<class Policy> class Vertices : public PureVertices, public Policy { //.. }; Both solutions feel wrong to me. The first creates an umaintainable mess and the second introduces the overhead of virtual calls that I tried to avoid by using policies in the first place. Am I missing the proper solutions or do I use the wrong pattern to solve the problem?

    Read the article

  • C++: A variation of priority queue

    - by Helltone
    I need some kind of priority queue to store pairs <key, value>. Values are unique, but keys aren't. I will be performing the following operations (most common first): random insertion; retrieving (and removing) all elements with the least key. random removal (by value); I can't use std::priority_queue because it only supports removing the head. For now, I'm using an unsorted std::list. Insertion is performed by just pushing new elements to the back (O(1)). Operation 2 sorts the list with std::sort (O(N*logN)), before performing the actual retrieval. Removal, however, is O(n), which is a bit expensive. Any idea of a better data structure?

    Read the article

< Previous Page | 68 69 70 71 72 73 74 75 76 77 78 79  | Next Page >