Jump to content

Oakromulo

Members
  • Content Count

    28
  • Joined

  • Last visited

Community Reputation

2

About Oakromulo

  • Rank
    More Active
  • Birthday 09/17/1990

Profile Information

  • Gender
    Male
  • Location
    Brazil

LabVIEW Information

  • Version
    LabVIEW 2011
  • Since
    2009

Contact Methods

  • Twitter Name
    carvalhoromulo

Recent Profile Visitors

591 profile views
  1. Nice question... I'll call NI Support team to check that. The ability to know programatically if the VI is compatible with VxWorks or Pharlap would be really useful for some generic LV classes/libraries.
  2. Rule of thumb for both LV and MS Windows: never install before SP1 unless you really need it.
  3. Fixed! Now with smaller datatypes as well... zeller2.vi
  4. +1 -1 that's so funny... after I read your reply, I still needed some seconds to find this lame operation! +1 Kudo for the Coerce to Type operator. This situation seems to appear almost every state-machine-like VI! A little bit afraid to say... but... the c code looks so much more readable in your example! I mean it makes me afraid because this kind of comment lends itself very easily into love-hate posts...
  5. I know the LV timestamp engine could easily be used to determine the day of the weak for a specific date. However, for those interested in a "behind the scenes" solution... the Zeller algorithm is really nice and possibly more optimized for certain applications. zeller.vi
  6. Thanks again Darin! I really wish my boss could hear it.
  7. Once LV lacks a primitive for this operation, I've written a quick & dirty VI to do random line permutations. I've tried to generate a random 1D array of I32 indexes, copy the 2D array and then do the line permutations one by one. Unfortunately, my code to generate the random I32 Array inside the VI seems to have an average O(n²) complexity. Do you know if there is a simple way to do O(n) or maybe O(n log(n) ) line permutations instead? Just out of curiosity, the randperm function from MATLAB has recently shifted from polynomial complexity to O(n log(n)), probably they've implemented some variation of the Fisher-Yates shuffle algorithm. randPerm1D.vi randPerm2D.vi evalRandPerm1D.vi
  8. LabVIEW for Everyone was an amazing tool for my first two months in my new job. Definitely worth the read, though a little bit boring after some time if you have a intermediate programming experience in textual languages. Don't forget to take a very comprehensive look at the NI CLAD material. Highlight every question you commit a mistake at the sample exams. This NI "Webcast" below is also very recommended. http://zone.ni.com/w...oc/p/id/wv-1950 It's a very straightforward exam. Hard to pass without commiting any single mistake but easy to reach the 70% mark. My manager, with very little LV experience besides demoing stuff, was able to pass in his first try. Please come back later to tell us how was your experience! P.S. It's not going to help with your exams, but if you want to know a little bit more about the RIO platform, you should spend some time with the NI CompactRIO Developers Guide: http://www.ni.com/pd...riodevguide.pdf
  9. No free meal after all! At least there's Darin's Math Node to save development time... I've been through a simpler, yet very annoying bug at LV 2010 when NI released that feature that enabled us to directly wire error clusters to a boolean operator. In the first release, it would always return false at every FPGA VI, no matter the cluster value. At the same time, I had a C Series module with a clock problem and I couldn't track the underflow error. A very skilled NI Support guy found the bug after almost a week full of compiles and equivalent code replacements. After that, no more "new" LV before SP1, just like Windows releases...
  10. Oh no... same thing with the next critical part of the neurofuzzy controller algorithm! The machine learning algorithm (performance bottleneck) with primitive array operators is again 4x faster (and uglier) than the formula node version. Formula Node Primitives
  11. That's the main reason why most LV developers need an external monitor with a much lower pixel density when working with a laptop...
  12. It makes total sense. RT FIFOs are probably implemented as standard fixed-size arrays.
  13. That's very interesting. I've always tought the flush operation would reduce the queue size to zero. By the way, do you know if LV Queues are implemented internally as something like a C++ STL Queue or a Forward List? http://www.cplusplus.com/reference/queue/queue/ http://www.cplusplus.com/reference/forward_list/forward_list/
  14. Ok... I'll categorize and put them there for evaluation.
  15. I've forgotten that only RT FIFOs are pre-allocated and so enable constant-time writes. This time I replaced the queue with a DBL functional global variable.
×
×
  • Create New...

Important Information

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