LAVA 1.0 Content

QUOTE(crelf @ Mar 10 2008, 06:53 AM) So they are finally working on the "orgasmatron"? How long until the world is ruled by someone's nose? Ben

QUOTE(crelf @ Mar 7 2008, 02:30 PM) ... and on page 25 there is a nice mention of the LabVIEW Champions :thumbup: Ben

QUOTE(crelf @ Mar 7 2008, 02:08 PM) I was wondering how long it would take. What I really like about being a Premium Member of LAVA is I can delete posting. Ben

QUOTE(Val Brown @ Mar 7 2008, 11:47 AM) Exactly! Like my DB's I prefer my associates to be slightly de-normalized. :beer: It makes for more lively discussions. Ben PS My better half threw in the towel saying something about it being to early.

QUOTE(rpscott02 @ Mar 7 2008, 10:25 AM) Yes, TCP protocol functions is enough to communicate with your device. But you will have to implement their protocol describe in their User manual. Or you can use DLL available on their Website, using Call Library Function Node under Connectivity section of your function palette. Good luck :thumbup:

QUOTE(Val Brown @ Mar 7 2008, 11:00 AM) Close enough. And the "Groaner Award" goes to Val! Complete answer is "Only one, but it takes a long time and it has to want to be normal." Ben

While I am waiting for my better half to advise on CRELF's punch line I'll post a real "groaner" adapter for his "green cardigan clad shoosh-monster". Q: How many psychiatric trained information scientist does it take to normalize a database? A: ? Ben

QUOTE(Yen @ Mar 7 2008, 05:30 AM) :laugh: Yep, thats's D&D* ! CRELF Let me consult with my better half before you reveal the final (us Philip already nailed it). Ben * posted using my +2 ergonomic keyborad and +3 Trackball.

QUOTE(Justin Goeres @ Mar 6 2008, 03:40 PM) Seeing that we have drifted to mention of our better halfs.... I scored big with my wife when she found I had my own copy of the "Dungeon & Dragons, Dungeon Masters Guide". BTW: I think I heard NPR report this AM that Gary Gygax (sp? inventor of D&D) was "promoted to to a higher level adventure"* yesterday. He certainly left his mark on my family. Ben * passed away

QUOTE(TobyD @ Mar 6 2008, 12:42 PM) Thanks Toby! Well at least I got the the "half dozen niad pulse converters and an anza brush" part right. Now if I my memory would work as well when trying to solve the Schroedeger wave equation... I should have listened to my mother when she said "Benny, don't ever get old!" Ben

Try that for more than two rows. Eric

QUOTE(Zalon @ Mar 6 2008, 12:25 PM) Wire the first to an idex array and index out row 0 and 1. This will give you 2 1-d arrays. Wire them into a "or" and the output should give you the desired results. Ben

QUOTE(Gary Rubin @ Mar 6 2008, 12:12 PM) I have to confess that I have to fight the temptation to "tease the slaes people" or for that matter yell at the TV when I see an add saying that "I need a lot of memory if I want to save a bunch of of files." The last time I had the Geek-Sqaud fix my laptop, I interupted them and said "I have been doing computers for 32 years. I am only paying you because I am lazy." Re: the original strip posted by Michael. My wife (former Senior Software Architect) loved it! Thanks, Ben

I don't have the strip but my favorite Dilbert is still... Frame 1 Dilbert walks into Radio Hut and is greated by a sales person who says "Hi, welcome to Radio Hut. I am half your age and know more about computers than you ever will, can I help you?" Frame 2 Dilbert replies saying "Yes, I need a half dozen Niad pulse converters and an Anza-brush...." Frame 3 Dilbert continues ".... or am I bluffing?" Has any tried to buy a photo-diode or an SCR at Radio Shack lately? Ben

In the same way of thinking... More Dilbert.

QUOTE(shoneill @ Mar 6 2008, 07:30 AM) I'd go with Shane recomendation shown above IF you be sure that "LF" never appears in your data stream. If LF is a valid character (aprt from the termination sequence) then I have cracked that nut by reading all bytes at port and buffering them in a SR. Afeter each read from the port, parse the buffered data for a frame that starts with CR/LF and ends with CR/LF. Toss anything that comes before the first cr/LF and decode what in-between for your data. Ben

QUOTE(rpursley @ Mar 5 2008, 01:14 PM) I just manually executed those steps and it lloks like that will work. :thumbup: Ben

QUOTE(jlokanis @ Mar 5 2008, 12:01 PM) It took us years to get a difinative answer to that question! The answer is NO, the UI thread is not required to read or write Globals. You can see this in http://forums.ni.com/ni/board/message?board.id=170&view=by_date_ascending&message.id=176661#M176661' target="_blank">reply #29 of this thread on the Dark-side. I think that whole thread is worth reading if you have not done so previously. Ben

QUOTE(Justin Goeres @ Mar 5 2008, 10:11 AM) Thanks. I can relate to the selection gymnastics issue. Two technical complications come to mind. 1) If you open a diagram on a mahcine that is using a larger font that what you used at development time, the grouping would add extra work to clean-up since ... 2) Ctrl-shift-drag when performed inside a set of grouped objects would... A) deal with the group as a single object, or B) just blow-up the group? Ben

QUOTE(crelf @ Mar 5 2008, 09:49 AM) Concidering the fact that I am often introduced as "the mad scientist in the back corner" I do see the humor. I love Dilbert. Ben Measurement & Automation Architect Data Science Automation Inc

QUOTE(crelf @ Mar 5 2008, 09:50 AM) Shane and Chris, My first response is "I don't like ideas that can encourage bad coding style." So I have to ask, "What value do you see in this idea and how would you envision using it?" Curious, Ben

RE: my previous outline... You will need two nested For loops to get the distance between every possible set of points. Ben

My idea fleshd-out a bit.Put all XY pairs describing all points in an array.Delete the first and in a for loop get the distance to the next point. save that distance and taht pair in SR'sCheck distance from first point to the next , compare with previous distance and save set if larger.Continue processing as above until you have found the two point farthest from each other.Use the two extreme points to define a line that they both lie on.Find the point that is half the max distance (found earlier) that lies on the connecting line. That is your center point.I think all of the above is just pethagoreum (sp?) theory and algebra.BenQUOTE(neB @ Mar 5 2008, 06:52 AM) QUOTE(neB @ Mar 5 2008, 06:57 AM) My idea fleshd-out a bit.Put all XY pairs describing all points in an array.Delete the first and in a for loop get the distance to the next point. save that distance and taht pair in SR'sCheck distance from first point to the next , compare with previous distance and save set if larger.Continue processing as above until you have found the two point farthest from each other.Use the two extreme points to define a line that they both lie on.Find the point that is half the max distance (found earlier) that lies on the connecting line. That is your center point.I think all of the above is just pethagoreum (sp?) theory and algebra.Ben

QUOTE(george seifert @ Mar 4 2008, 12:23 PM) Hi George, I am not that good with Vison and math is not my strong point. AS usual that will not stop me from thinking out loud. It seems that the smallest circle would have to enclose the the two points which are farthest from each other. So if you calculat the distance between every pair of points an then locate the largest displacement, then a circle who diameter is equal to the max displacement and centered at the point that mid way between the two extemes. That's just my non-math 2 cents, Ben

QUOTE(torekp @ Mar 4 2008, 11:39 AM) I use the approach outlined by Pual as well. This lets me illustrate when changes to the limits occur and allows zooming etc without having to account for scale and range changes. Ben