All Activity

Hi All, I am a Physical Chemist and am just starting Labview (a long way to go, as you may suspect). I would need to do many Daq and DPS but with a low budget (probably would have to you Arduino and NI-Dev boards for my projects. I would like to have the option of going hybrid (text-G) programming and since I have not much programming experience wanted to know which one would suit my purpose better, C/C++ or python. I have worked with formula nodes, and it is easy for making base computations and I was sad by the fact that you either have to use C/C++ syntax or Mathscript as in Math nodes; meaning MatLab. I am fully willing to put work if C/C++ is the answer, but I wanted to know which should I pick? I really appreciate any help you can provide. Cheers, Mahbod

TDF team is proud to propose for free download the scikit-learn library adapted for LabVIEW in open source. LabVIEW developer can now use our library for free as simple and efficient tools for predictive data analysis, accessible to everybody, and reusable in various contexts. It features various classification, regression and clustering algorithms including support vector machines, random forests, gradient boosting, k-means and DBSCAN, and is designed to interoperate with the Python numerical and scientific libraries NumPy and SciPy from the famous scikit-learn Python library. Coming soon, our team is working on the « HAIBAL Project », deep learning library written in native LabVIEW, full compatible CUDA and NI FPGA. But why deprive ourselves of the power of ALL the FPGA boards ? No reason, that's why we are working on our own compilator to make HAIBAL full compatible with all Xilinx and Intel Altera FPGA boards. HAIBAL will propose more than 100 different layers, 22 initialisators, 15 activation type, 7 optimizors, 17 looses. As we like AI Facebook and Google products, we will of course make HAIBAL natively full compatible with PyTorch and Keras. Sources are available now on our GitHub for free : https://www.technologies-france.com/?page_id=487

here tested with LabVIEW 18.0.1f4 on windows 10 - no hang or crash and on LabVIEW 20.0.1 the same - no hang and LabVIEW 17.0.1f3 - no hang

could you please provide a sample code, which i cam use as a example/sample.

Another idea is to combine regular graphs with pictures via the plotimages property of the graph. So the lines are graps and the dots are pictures.

Tried it on LV2021, resulted in a hang.

My first idea would be to use the 2D picture control for this. Go to "Help > Find example..." this will launch rhe example finder, then browse to "Build User Interfaces >> Generating 2D Pictures" and take a look at the examples I think this one is cool

I am trying to implement a python based source code into the LabVIEW, where I need to produce an output graph/chart where each network point is connected with other network points. The condition for the first graph/chart is i = j, and in the other condition of the graph/chart is i != j, Thanks for your time and looking forward to hearing from you soon,

This website is old, but has some information. https://www.labviewmakerhub.com/doku.php?id=libraries:linx:start You might also find some useful things here: https://forums.ni.com/t5/Hobbyist-Toolkit/bd-p/linx-toolkit?profile.language=en

It's still the same. You can not have multiple tasks accessing the same DAQ card for Analog input. You need to combine the channels into one task and one scan rate and then pick out the data as needed and distribute it to the different subsystems as needed.

Hello! I getting this error, when I try to read values from PXIe-4300, using 2 different tasks of DAQmx. The first task is using channels 0 and 1 are configured as AI Voltage, and try to read "Analog 2D DBL NChan NSamp" method. The second task is using the rest channels of the same module are configured as AI Voltage and try to read "Analog 1D DBL NCan 1Samp" method. Maybe error is there?

I've never done somethig like this. I used the LevenshteinDistance to compare a lot of smaller strings (between 8 and 12 characters long). Because each of the strings was more or less significant, I used an additional factor for each of the strings and finally generated some king of an overall coefficient.

Hi, Jordan. Do you (or anyone else) know of any additional LabVIEW LINX libraries for Raspberry Pi? I'm looking for as many different hardware drivers that I can find.

well, they are different, they measure different things. The question would be what is more meaningful in one or another use case. When I started thinking at it I had in mind an input corrector (which I'm not sure I'll really pursue) which warned the user about possible misspellings and likely corrections, but then one might consider that compared to "Digital input D1", "digital input D2" may be more right than "diggital input D1". Heuristics.

Thanks for the 2019 VIs. I compared the three algorithms. Levenshtein works different. For better comparison, I normalized the value with: 1 - LevenshteinDistance / (Length(a)+Length(b) Dice: Sørensen–Dice coefficient CSC: Compare String Confidence.vi Lev.: Levenshtein

The download page says that the package is for 32bit, but all the rpms provided in it are x86_64, and so assumes the INSTALL file at quick skimming through it; OTOH $ file /usr/local/natinst/nifpgacompileworker/CompileWorker.exe /usr/local/natinst/nifpgacompileworker/CompileWorker.exe: PE32 executable (GUI) Intel 80386 Mono/.Net assembly, for MS Windows I added /usr/local/natinst/mono/lib64 to /etc/ld.so.conf and sudoed ldconfig, but I remained at the same point. I think I'll leave it as "whatever", for now, I see that for the project in question I have other compilation options, so I can live without. But thanks anyway for the feedback, Rolf!

Here they come for 2019. For the little these require sets, i.e. only to find the common elements among two character arrays, I think that it would be pretty easy to reimplement them without, for earlier versions. StrikeAMatch.vi StringDigrams.vi

Regarding Levenshtein: Wladimir Levenshtein developed 1995 an algorithm for this. It is called the Levenshtein Distance. Some years ago I developed a VI to calculate the Levenshtein Distance. Here it is (LabVIEW 2016). Can you post your VIs in LV2020 or 2019, please. Levenshtein Distance.vi

Most likely that compile worker is a 32-bit application and you only have 64-bit libgdiplus installed? Or another possibility, the /usr/local/natinst/mono/lib64 directory was not properly added to the /etc/ld.so.conf file and/or ldconfig was not executed afterwards

Couldn't view your VI as I don't have LabVIEW 2020 installed on this machine but you want to basically detect that the boolean you use to find out if you want to write to the file has switched from false to true. An edge detector is very simple to do with a feedback register like this. Change the boolean inputs inversion to detect the falling edge. When the rising edge boolean is true, write your header and then the data, otherwise only write the data.

Thanks, I'll check your one too. I've seen out on the internet that the most popular method suggested is the Dice (strike a match) metric, followed by the Levenshtein, beyond that it looks as it is mostly for theoreticians. Since the metrics have different merits, I have yet to figure out which may be better for what I have in mind. In the meantime, however, here is my quick implementation of Dice. LV2021, based on sets, hence not so backportable (down to 2019, perhaps). StringDigrams.vi StrikeAMatch.vi

You can check out my code I used for a run time spell checker. It is used in a Spell Check QControl I wrote but I always meant to publish the engine standalone. It is useable standalone. It can be found here: https://gitlab.com/QSI_Shared_Code/SharedQControls/SpellcheckString. It uses the Damerau–Levenshtein distance to calculate the "distance" between two words by number of operations to transform one word into the other word. It counts operations as insertions, deletions or substitutions of a single character, or transposition of two adjacent characters.

Yeah a lot of the decisions made there seem pretty dumb looking at it now. But it was a personal project and really just needed something that could tell me if a string pulled from a webpage, had a similar enough string to a file name on disk. Good luck.

I see. So your one seems pretty similar to the Strike a Match, IIUC, with the differences that 1) it strips away from the strings all chars not in [0-9,a-z] (what, no uppercase?) (good for literal strings, but otherwise not always) (could be probably done more synthetically with a regexp), and that it uses the arithmetic sum of two ascii codes instead of a true digram, which can create more false matches. A starting point anyway, thanks.

I do have a very quick and dirty solution that I wrote many years ago without consulting the internet or what would be the right way to do this. That being said I just ran it on the Stack Overflow test and for: Robert, and Amy Robertson my code had a 44% match, and for Robert and Richard it had a 0% match. That being said if you can come up with anything better or more standard that would probably be better than this. Compare String Confidence.vi