Search Results

Search found 44965 results on 1799 pages for 'presenter first'.

facebook twitter digg google delicious technorati stumbleupon myspace wordpress linkedin gmail igoogle windows live tumblr viadeo yahoo buzz yahoo mail yahoo bookmarks favorites email print

Page 691/1799 | < Previous Page | 687 688 689 690 691 692 693 694 695 696 697 698  | Next Page >

  • How to use a varying database?

    - by nimo
    I want to use a database which name is stored in a variable. How do I do this? I first thought this would work but it doesn't: exec('use '+@db) That will not change database context Suggestions anyone?

    Read the article

  • Filtering constant noise out of a sound stream

    - by tur1ng
    After watching the first game of the FIFA worldcup I was very annoyed by the sound of the Vuvuzelas. A theoretical question came up about filtering that noise out of the sound stream. What algorithms are needed to remove such a "constant" noise and is it possible to keep the quality of other background sounds?

    Read the article

  • trouble in using flalign (LaTeX)

    - by Jorge
    I am trying to put 3 equations with "=" signs aligned but also left aligned. I tried the following: \documentclass{article} \usepackage{amsmath} \begin{document} \begin{flalign*} RPC &= A+B\tilde{f} +C x &\ A &= a+\eta &\ E &= cte & \end{flalign*} \end{document} With this I get the stuff in the left and the "=" signs aligned. However, I also need A (in the second equation) and E (in the third equation) to be aligned to the R (in the first one) Does anyone know how to get it? thanks

    Read the article

  • faster strlen ?

    - by Jack
    Typical strlen() traverse from first character till it finds \0. This requires you to traverse each and every character. In algorithm sense, its O(N). Is there any faster way to do this where input is vaguely defined. Like: length would be less than 50, or length would be around 200 characters. I thought of lookup blocks and all but didn't get any optimization.

    Read the article

  • ActiveSync File Explorer alternative

    - by Andy White
    Is there an alternative to the ActiveSync "Explore" for looking at the file system of a Windows Mobile device? (This same thing can also be accessed from My Computer - Mobile Device). It would be nice if you could just navigate into the device and view or edit files without having to copy them back and forth from the PC. Why does it work this way in the first place? Is the Explore view sort of a "virtual" version of your phone's file system that cannot be edited directly?

    Read the article

  • Easyslider not cooperating

    - by SiD
    First time I've used it. had it working but suddenly it's gone. It seems temperamental, sometimes works grand, a refresh then breaks it. It doesn't expand to the full height and screws up the positioning of the image and the corresponding copy. Any help much appreciated. See code here: http://www.bigfootwalk.com/route.html

    Read the article

  • How do I use JDK 7 on Mac OSX?

    - by Yko
    OK. This is a newbie question but I can't figure it out... I would like to use the WatchService API as mentioned in this link: http://download.oracle.com/javase/tutorial/essential/io/notification.html After reading around, I found out that WatchService is part of the NIO class which is scheduled for JDK 7. So, it is in beta form. It's fine. http://jdk7.java.net/download.html has the JDK which I downloaded and extracted. I got a bunch of folders. I don't know what to do with them. Then, I read around some more and found that some nice group of people created JDK 7 as a binary so someone like me can install it easily. It is called Open JDK: http://code.google.com/p/openjdk-osx-build/ So, I downloaded the .dmg file and instal it. Then I open "Java Preference" and see that OpenJDK7 is available. So, now I feel that I can start trying out WatchService API. From the tutorial in the first link, the author gave a .java file to test it out first and make sure that it is running. Here is the link to the file: http://download.oracle.com/javase/tutorial/essential/io/examples/WatchDir.java So, I boot up Eclipse (actually I use STS) and create a new Java project and choose JaveSE-1.7 in the "use an execution environment JRE:". Under the src folder, I copy pasted the WatchDir.java file. And I still see tons of squiggly red lines. All the "import.java.nio.*" are all red and I cannot run it as a Java app. If you read this far, thanks a lot. So, now... What do I need to do? Thanks. EDIT: I actually did not pursue using Java 7 but there are a lot of interest in it and it seems like people keep answering this question. What should I do to make it more relevant to people who search for it? Let me know by PMing me. Thanks.

    Read the article

  • If innerHTML is evil, then what's a better way change the text of a link?

    - by sanj
    I know innerHTML is supposedly evil, but I think it's the simplest way to change link text. For example: <a id="mylink" href="">click me</a> In JS you can change the text with: document.getElementById("mylink").innerHTML = new_text; And in Prototype/jQuery: $("mylink").innerHTML = new_text; works fine. Otherwise you have to replace all of the child nodes first and then add a text node. Why bother?

    Read the article

  • How do I avoid multiple key up/down/press events when holding a key?

    - by Rammay
    I'm creating a web front end to control a small robot. Ajax calls will be made on a keydown, to start the robot, and keyup to stop it. My problem is that when a key is held down the keyup, keydown, and keypress events seem to cycle continually. Does anybody know of a way to only have keydown fire when the key is first pressed and keyup to fire when it has been released?

    Read the article

  • Jquery and Fancybox repeat Gallery

    - by ron
    HI everyone I hope you can help me, I have a problem with a requirement, I need to make a list of images that go to cycle. I have this website, here I have some business cards and I need the images to be repeated after the end of the first cycle and continue like a loop. here I leave the website, look that the list has a final. http://tradelinks.com.au/index.php?service=painters Thanks in Advance

    Read the article

  • Looking for a filtered dropdown list for ASP.NET.

    - by ProfK
    I have some DropDownList controls where the list is very large, so I would like to have a means for the user to filter the list, either based on other fields, e.g. region, or on the first letters typed in a textbox. How can I achieve this in ASP.NET? Is the an open source control out there that will help me?

    Read the article

  • Tree Menu? In JS?

    - by acidzombie24
    I need a tree menu. But instead of a listview where you expand/collapse i need a dropdown box with the list and when you click on a element i need the box to update (with the first entry being 'Back') so the menu stays in a neat little dialog. Does this menu have a name? Does anyone know where i can get code to do this?

    Read the article

  • Lightweight Java reporting engine

    - by tuler
    I'm looking for a lightweight java reporting engine to be embedded in an applet application. My first option was Jasper Reports, but the jar is over 2Mb, a little too heavy (and too bloated) for my needs. I don't know if there is modular jasper distribution, with funcionalities split in several jars (like html rendering, pdf, excel, compilation, runtime, etc). I need to preview the report using Swing and print it. PDF export is a plus.

    Read the article

  • Is a clear and replace more efficient than a loop checking all records?

    - by Matt
    I have a C# List, that is filled from a database.. So far its only 1400 records, but I expect it to grow a LOT.. Routinely I do a check for new data on the entire list.. What I'm trying to figure out is this, is it faster to simply clear the List and reload all the data from the table, or would checking each record be faster.. Intuition tells me that the dump and load method would be faster, but I thought I should check first...

    Read the article

  • Why do custom styled Google Maps (v3) not support marker animation (pin drop)?

    - by Plum Pie
    For example, I cannot combine the concepts of this simple example: link text with the concepts of this example: link text, which uses the styled V3 api. In Chrome I get an error saying that: Uncaught TypeError: Cannot read property 'DROP' of undefined And it refers to this line of code: animation: google.maps.Animation.DROP, When I replace the javascript link reference to use the version of the API from the first example, the error goes away, but I lose the custom styling. I have not tried this in Firefox or IE. EDIT: Link to example: link text

    Read the article

  • Add months to a date using jQuery

    - by hminaya
    I have a simple MVC form with the following elements: <%= Html.TextBox("FechaInicio") %> Which has the start date. <%= Html.TextBox("Meses") %> Which has the amount of months I want to add. I'd like to take the date that has been entered on the first textbox, add the amount of months that have been entered on the second textbox and get that value.

    Read the article

  • Intializing dictionary in c# 3.0

    - by Casey
    I'm having trouble with the following collections initalization: private Dictionary<string, string> mydictionary = new Dictionary<string, string>() { {"key", "value"} , {"key2", "value2"} , {"key3", "value3"} }; I keep getting various compiler errors about the syntax. From what I have googled this should be perfectly valid C# 3.0 code. The first error that pops up is: Error 102 ; expecte What am I doing wrong?

    Read the article

  • Linq grouping question

    - by Mike C.
    I have the following objects in a collection: Transaction: Type = "Widget" Date = "3/1/2011" Name = "Foo" Transaction: Type = "Widget" Date = "3/4/2011" Name = "Bar" Transaction: Type = "Gadget" Date = "3/2/2011" Name = "Baz" Transaction: Type = "Gizmo" Date = "3/1/2011" Name = "Who" Transaction: Type = "Gizmo" Date = "3/2/2011" Name = "What" Transaction: Type = "Gizmo" Date = "3/6/2011" Name = "When" I want to end up with the following, grouped by Type. If there are multiple, return only the first one chronologically by date. Transaction: Type = "Widget" Date = "3/1/2011" Name = "Foo" Transaction: Type = "Gadget" Date = "3/2/2011" Name = "Baz" Transaction: Type = "Gizmo" Date = "3/1/2011" Name = "Who"

    Read the article

  • Rails error_messages helper

    - by Bob
    This is a very common piece of code <% form_for :blah... do |f| %> <%= f.error_messages %> First name: <%= f.text_field :first_name %><br /> .... <% end %> error_messages is a helper method but I am having a hard time finding the documentation for it, why is that?

    Read the article

  • best practice when referring to a program's name in C

    - by guest
    what is considered best practice when referring to a program's name? i've seen #define PROGRAM_NAME "myprog" printf("this is %s\n", PROGRAM_NAME); as well as printf("this is %s\n", argv[0]); i know, that the second approach will give me ./myprog rather than myprog when the program is not called from $PATH and that the first approach will guarantee consistence regarding the program's name. but is there anything else, that makes one approach superior to the other?

    Read the article

  • Haskell Add Function Return to List Until Certain Length

    - by kienjakenobi
    I want to write a function which takes a list and constructs a subset of that list of a certain length based on the output of a function. If I were simply interested in the first 50 elements of the sorted list xs, then I would use fst (splitAt 50 (sort xs)). However, the problem is that elements in my list rely on other elements in the same list. If I choose element p, then I MUST also choose elements q and r, even if they are not in the first 50 elements of my list. I am using a function finderFunc which takes an element a from the list xs and returns a list with the element a and all of its required elements. finderFunc works fine. Now, the challenge is to write a function which builds a list whose total length is 50 based on multiple outputs of finderFunc. Here is my attempt at this: finish :: [a] -> [a] -> [a] --This is the base case, which adds nothing to the final list finish [] fs = [] --The function is recursive, so the fs variable is necessary so that finish -- can forward the incomplete list to itself. finish ps fs -- If the final list fs is too small, add elements to it | length fs < 50 && length (fs ++ newrs) <= 50 = fs ++ finish newps newrs -- If the length is met, then add nothing to the list and quit | length fs >= 50 = finish [] fs -- These guard statements are currently lacking, not the main problem | otherwise = finish [] fs where --Sort the candidate list sortedps = sort ps --(finderFunc a) returns a list of type [a] containing a and all the -- elements which are required to go with it. This is the interesting -- bit. rs is also a subset of the candidate list ps. rs = finderFunc (head sortedps) --Remove those elements which are already in the final list, because -- there can be overlap newrs = filter (`notElem` fs) rs --Remove the elements we will add to the list from the new list -- of candidates newps = filter (`notElem` rs) ps I realize that the above if statements will, in some cases, not give me a list of exactly 50 elements. This is not the main problem, right now. The problem is that my function finish does not work at all as I would expect it to. Not only does it produce duplicate elements in the output list, but it sometimes goes far above the total number of elements I want to have in the list. The way this is written, I usually call it with an empty list, such as: finish xs [], so that the list it builds on starts as an empty list.

    Read the article

facebook twitter digg google delicious technorati stumbleupon myspace wordpress linkedin gmail igoogle windows live tumblr viadeo yahoo buzz yahoo mail yahoo bookmarks favorites email print

< Previous Page | 687 688 689 690 691 692 693 694 695 696 697 698  | Next Page >