Jump to content

Francois Normandin

Members
  • Posts

    1,209
  • Joined

  • Last visited

  • Days Won

    46

Posts posted by Francois Normandin

  1. As far as I'm concerned, I accept your apologies. :beer:

    a) I didn't open your VI because I thought your problem was clearly stated... That being said, I'll have a look at it now to see if I got my answer satisfactorily posted.

    b) A tip for future questions: I don't usually look at posts that contain "Help", "plz" (please), "Quick" or "Urgent". I might not be the only one... It's very often school homework questions and since I am working a full time job, I choose the topics I answer accordingly.

    EDIT:

    post-10515-1216309926.png?width=400

  2. QUOTE (Dirk J. @ Jul 17 2008, 03:03 AM)

    And maybe something like "each class is allowed a constructor and destructor in which getters and setters are allowed".

    Although I tend to agree with the observation, I can see another possible hack with this: What if you create an object and destroy it right away just to get access to the get/set features of that class? Defeats the purpose of the exercise.

  3. Many reasons why it won't work. And also some interogation marks in my head too...

    1- Your example won't work because your data is not linearly independant. Your matrix is singular (determinant = 0) because in your simulation, all your data are integer multiples (only loop number changes). You produce the equivalent of this:

    1 2 3 | 1

    2 4 6 | 2

    3 6 9 | 3

    which is equivalent after reduction to:

    1 2 3 | 1

    0 0 0 | 0

    0 0 0 | 0

    This system cannot be solved because the solving algorithm relies on inverting the matrix. By definition, singular matrices cannot be inverted.

    Try generating your simulated data with some noise, using a random number to throw it out of its perfect line... This way, you'll generate data that doesn't algebraicly cancel each other out. Also, get some code out of the big loop, as it is not necessary to calculate the same thing 1000 times when it can be replaced by a constant value.

    2- However, this thread here talks of the same problem... and no answer could be found other than starting the algorithm close to the expected values of a1, a2, a3... I ran a simple fit and got good results, except that the error message didn't disappear until I started the initial parameters at different values (a1 =! a2 =! a3) ... I don't know why I had the singular matrix error message when a1 = a2 = a3.

    As far as I know,

    1 2 3 | 0.2

    1 3 4 | 0.2

    2 6 7 | 0.2

    is not a singular matrix...

    Anyway, starting with {0.19, 0.20, 0.21} got rid of the error.

    post-10515-1216181318.png?width=400

    3- See also this thread on ni forums.

    So, my simple example worked out but when I ran your code with some modifications (random data), I couldn't get it to fit your data... We'll have to find out the reason, because I'll have a hard time sleeping in the coming days. :( Let us know of your progress. I hope my explanation will help you out. Now is my time to go to sleep... :clock: If I dream of anything useful, I'll let you know!

    PS. Sorry I didn't use the express VI like in your example. I tend to avoid them as I test solutions. They're completely equivalent to the code you had... I don't mean thta as an editorial on Express VI use. ;)

  4. The simplest I see would be to instruct your firewall to block outbound access to LabVIEW.exe. (but that's rather harsh, considering you might need that connection sometime in the future)

    There could be an LabVIEW.ini key or NI registry edit that would do it, but that I am not able to help ;) .

  5. QUOTE (tcplomp @ Jun 13 2008, 01:35 AM)

    I recently opened my LabVIEW.ini file and found these two keys:

    [LabVIEW]

    RecentFiles.projectPathList=

    RecentFiles.pathList=

    Are the private methods just calls of Configuration Files VIs? Or does it take the info from registry or some other place?

  6. QUOTE (TobyD @ Jul 10 2008, 12:02 PM)

    SPOILER ALERT!!!

    Poor little guy never makes it. I generally prefer happy endings, but it did make me laugh. :D

    Well, he does make it to the cabin... maybe he didn't get the food, but he gets a nice place to "hide" with Mrs. Dopey.

  7. QUOTE (JRTritsch @ Jul 7 2008, 10:26 AM)

    Disclaimer - I am new to labview

    I can't seem to speed up the data acquisition and I am not sure where the bottleneck is. It is (what I think) a fairly simple VI created to read two voltages and output another. I am only able to get recordings at maybe 2-3Hz; which is not very good. Previously the same system was operating on Labview 3 on a apple II taking data at something like 40Khz and signal averaging - which is where I would like to eventually get.

    Which hardware are you using?

  8. QUOTE (LV_FPGA_SE @ Jul 4 2008, 02:27 PM)

    (They would receive the pay for the entire previous year on this day and were then free to move.)

    Does that mean these people had some kind of "One-year slavery contracts" with landlords? Work for me the whole year and if you don't leave early, you get paid? That seems real harsh! (even compared with late 1800's where some french workers got a union and gained the right to stop 15 minutes for lunch... and as of this day, they only had to bring one pound of coal a day to heat the factory... But at least they got paid each week!)

  9. QUOTE (LV_FPGA_SE @ Jul 4 2008, 02:27 PM)

    (They would receive the pay for the entire previous year on this day and were then free to move.)

    Does that mean these people had some kind of "One-year slavery contracts" with landlords? Work for me the whole year and if you don't leave early, you get paid? That seems real harsh! (even compared with late 1800's where some french workers got a union and gained the right to stop 15 minutes for lunch... and as of this day, they only had to bring one pound of coal a day to heat the factory... But at least they got paid each week!)

×
×
  • Create New...

Important Information

By using this site, you agree to our Terms of Use.