Jim Kring

QUOTE (jzoller @ May 9 2008, 11:09 AM) Joe, If you're looking for a LabVIEW native XML parser that is easy to use and is well within your budget constraints, check out http://jkisoft.com/easyxml/' rel='nofollow' target="_blank">EasyXML. (Nobody saw that one coming, did they? ) Cheers, -Jim

QUOTE (jpdrolet @ May 8 2008, 09:58 PM) No, everyone at JKI has Dell 24" flat panels

QUOTE (crelf @ May 8 2008, 08:16 PM) I really want http://en.wikipedia.org/wiki/Friend_class' rel='nofollow' target="_blank">friend classes, but now that I think about it, I guess I would settle for "drinking buddy classes".

QUOTE (Daklu @ May 8 2008, 03:39 PM) The installer version is what's shown in the Add/Remove Programs list under the details dialog for an installed program. It's basically your installed program's version, as far as windows is concerned.

QUOTE (neB @ May 8 2008, 01:56 PM) Have I mentioned that JKI's WiFi reaches the beach in front of http://jameskring.com/index.php?page=contact&subpage=corporate' rel='nofollow' target="_blank">our office?

QUOTE (crelf @ May 8 2008, 01:08 PM) Do you really want AQ drinking while he's working on the next version of LabVIEW?

LabVIEW for Everyone is available as a PDF.

This is what Michael's talking about: Notes: You can't just build a 2D array and reshape it to 1D (outside the loop), since each 1D array might be a different length. This should also work for strings :thumbup:

QUOTE (MartinGreil @ May 2 2008, 08:30 AM) That's a great idea. In fact, OpenG already has such a function called Conditional Auto-Indexing Tunnel. This function started as an item on my LabVIEW wish-list, many years ago -Jim PS -- Come on crelf and rolfk! Don't tell me that you guys don't know about this OpenG function

My friend made this video for her class project. She gets graded on how many people view the video. Take a look at it. It's funny and it's got a good message, too

Hi All, The Arithmetic Mean Candidate Functional Spec is now complete, and it has entered its Final Review Period. Comments on the Functional Spec are still welcome, but any issues should be brought up sooner rather than later. The Initial Review Period for the Arithmetic Mean Candidate Technical Spec has now begun. Anyone who's interested is invited to look at the Technical Spec page and offer comments here. This is the time to bring up any issues or concerns you have with the actual implementation of the function. There is currently one major Open Issue with the technical spec that needs to be settled: The current implementation uses the top option in the figure. How important is it to avoid this copy? Note that one of the Key Technical Requirements is high performance. Please join in on the discussion, here: http://forums.openg.org/index.php?showtopic=820&st=60

QUOTE (Aristos Queue @ Apr 25 2008, 06:37 AM) You're the man, AQ! Thanks for getting these into the system. -Jim PS - I guess I might have to start being less cynical

I'm sure that someone will tell me that this is a feature and not a bug. Nonetheless, it's annoying and not what I would expect -- especially, since lvlib and lvclass types have a "Locked" property.

QUOTE (Justin Goeres @ Apr 23 2008, 07:45 PM) I get it... It's like how entering the 5th dimension requires evolving beyond 4-d space-time and creating god.

QUOTE (Justin Goeres @ Apr 23 2008, 12:05 PM) Well, it's your club, so you can define it however you wish. I just figured that 12-bit club meant you needed to have 2^12 posts to be a member -- just as a million post club would probably mean you'd need a million points to be a member.

QUOTE (Justin Goeres @ Apr 23 2008, 09:28 AM) Since you can't have negative posts, I would assume that you have to have 4096 posts to be in that club

I've tried SCPlugin, but it was not very stable, IMO, when I tried it -- maybe it's gotten better. I use SmartSVN on Mac. It's nothing like TortoiseSVN, but I don't really need tight integration with the Finder, as I mostly use the Mac for testing and some occasional development and fixing of cross/multi-platform code. I also use it on Linux (since SmartSVN is cross-platform).

It's worth mentioning, here, that if you want an even distribution of integers, then the formula looks like this: INT( RAND * ( ( MAX + 0.5 ) - ( MIN - 0.5 ) ) + ( MIN - 0.5 ) ) Otherwise, your MIN and MAX values will have half the rate of occurence (probability) of the values between them. FYI, we're planning on adding support for integers in a future release of the OpenG VI.

QUOTE (orko @ Apr 21 2008, 11:01 AM) And, here's what that picture looks like You can download this VI as part of the OpenG Numeric Tools library.

QUOTE (orko @ Apr 18 2008, 01:18 PM) Hi Joe, I see what you're saying. I should have read the various postings more carefully :headbang: I'm happy that you all were able to solve the problem -Jim

QUOTE (rkanders @ Apr 18 2008, 07:51 PM) Hi Reinis, Thanks for the feedback. Regarding the issue you mentioned, I cannot reproduce it. As crelf mentioned, it would be very helpful to include an example that demonstrates the bug and tests the actual results against your expected results. This will help us determine whether we can reproduce what you are seeing and whether what you are seeing is actually a bug. Also, for future reference, the best place to report OpenG bugs is on the OpenG forums, here: http://www.openg.org >> Report a Bug Thanks, -Jim

QUOTE (orko @ Apr 18 2008, 10:50 AM) Real funny, Joe. Is that some kind of bald joke? hehe :laugh:

QUOTE (jpdrolet @ Apr 18 2008, 10:20 AM) I tried this and it doesn't seem to keep the variant attributes. Attributes don't survive the flatten-unflatten process: Download File:post-17-1208546218.vi

QUOTE (Bonagel @ Apr 18 2008, 02:15 AM) Unfortunately, I don't know of any way to do it without flattening to string.

Dan, Glad that works for you. Thanks for spreading the OpenG love Cheers :beer: -Jim