Search Results for "linux-gpib" - Page 17
Sort By:
Showing 1291 open source projects for "linux-gpib"
View related business solutions-
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
1
ontocomp
OntoComP is a Protégé 4 plug-in for completing OWL ontologies
OntoComP is a Protégé 4 plug-in for completing OWL ontologies. It enables the user to check whether an OWL ontology contains "all relevant information" about the application domain, and extends the ontology appropriately if this is not the case. It achieves this by asking the user questions of the form "are instances of classes C1 and C2 also instances of class C3?". If the user confirms such a question, then a new axiom of the application domain that does not follow from the ontology has... -
2
CLAW is a C++ Library providing various tools in different domains, like a Tweener framework, Bézier curves manipulation, a map with multiple value types, a binary search tree container implemented as an AVL and an implementation of the sockets as std::stream. The library also includes a set of classes to easily load and write png, jpeg, gif files and other image formats. Finally, a part of the library is devoted to artificial intelligence in games and includes a generic alpha-beta...
-
3
Graphal
Graph algorithms interpreter, IDE, debugger, 3D visualizations.
Graphal is an interpreter of a programming language that is mainly oriented to graph algorithms. There is a command line interpreter and a graphical integrated development environment. The IDE contains text editor for programmers, compilation and script output, advanced debugger and visualization window. The progress of the interpreted and debugged graph algorithm can be displayed in 3D scene. -
4
Distributed Multithread Apriori (DMTA)
A parallel implementation using MPI and OpenMP to Apriori algorithm
DMTA (Distributed Multithreaded Apriori) is a parallel implementation of Apriori algorithm, which exploits the parallelism at the level of threads and processes, seeking to perform load balancing among the cores. Was implemented in C++ language, using the parallelization libraries OpenMP and MPI. The algorithm was generated as a result of a project developed by André Camilo Bolina, under the guidance of teachers Marluce Rodrigues Pereira, Ahmed Ali Abdalla Esmin and Denilson Alves Pereira,... -
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
5
JCycles
[frozen] A library for computing cycles in graphs or in Java code.
[This project is frozen, but has an offspring with more features: https://github.com/jeffhain/jadecy ] JCycles provides treatments to compute cycles, or just strongly connected components, in directed graphs in general, or in classes or packages dependencies graphs parsed from class files (major version <= 51, else does best effort). It uses Tarjan's algorithm for SCCs, and Johnson's for cycles, with continuations instead of recursion, which allows to handle large graphs (<... -
6
-
7
ffdefluc
a defluctuator for avisynth
-
8
ProximityForest
Efficient Approximate Nearest Neighbors for General Metric Spaces
A proximity forest is a data structure that allows for efficient computation of approximate nearest neighbors of arbitrary data elements in a metric space. See: O'Hara and Draper, "Are You Using the Right Approximate Nearest Neighbor Algorithm?", WACV 2013 (best student paper award). One application of a ProximityForest is given in the following CVPR publication: Stephen O'Hara and Bruce A. Draper, "Scalable Action Recognition with a Subspace Forest," IEEE Conference on Computer... -
9
The fstrcmp project provides a shared library for making fuzzy string comparisons, and also provides an fstrcmp command for use in shell scripts.
-
Host LLMs in Production With On-Demand GPUsDeploy your model, get an endpoint, pay only for compute time. No GPU provisioning or infrastructure management required.
-
10
Concurrency Freaks
A library with Scalable (and fast) Read-Write locks
This library contains Java code for several Read-Write Locks: - ScalableRWLock: A rw-lock that scales with the number of threads doing read-lock. - ScalableRWLockS: Similar to above but different implementation. - ScalableStampedRWLock: An hybrid of the ScalableRWLock and the StampedLock provided in JDK 8, which provides good overall performance. - FAARWLock: Uses a Fetch-And-Add operation for the read-lock which means it is not so scalable as ScalableRWLock but it is still faster than... -
11
FFT for ARMv6
Fixed point 16/32 integer FFT library for the Raspberry Pi and Android
This library is being created as I have a need to do very fast FFTs on low end devices not supporting the NEON instruction set. The Raspberry Pi is an ideal candidate for developing in gcc before porting to JNI for low spec Android devices, hence it's inclusion. Fixed point 16/32 integer FFT library suitable for the Raspberry Pi and Android devices. Includes test stubs for gcc on the Raspberry Pi and a Basic4Android wrapper from JNI. It includes hand optimised ARMv6 assembler,... -
12
thecodemonkey's JBase64
free and fast implementation of a Base64 coder for Java
This is a completely free (as defined by the Free Software Foundation), fast implementation of a Base64 coder for Java developers as replacement for the SUN proprietary library -
13
-
14
Comparador de Algoritmos de Ordenação
Comparador de Algoritmos de Ordenação
Comparador de Algoritmos de Ordenação -
15
Weka4OC GUI for Overlapping clustering
Weka4OC: Weka for Overlapping Clustering is a GUI extending WEKA
This is a GUI application for learning non disjoint groups based on Weka machine learning framework. It offers a variety of learning methods, based on k-means, able to produce overlapping clusters. The application also contains an evaluation framework that calculates several external validation measures. The application offers a visualization tool to discover overlapping groups. -
16
ktree
clustering, machine learning, algorithms
This project has moved to github at http://lmwtree.devries.ninja. -
17
Pre-projetos_MLCM - É um conjunto de Programas e códigos fonte dos mesmos, com finalidade educacionais para a área de TI. Sendo eles programas simples que foram desenvolvidos para a aquisição de nota no curso de BCC. Os programas em si, estão ainda em desenvolvimento sendo disponibilizado uma prévia dos progressivos resultados, não se tendo uma data de finalização do projeto definida. Fica a disposição os códigos deles sobre a licença GPL para que estudantes e interessados possam fazer uso e...
-
18
Linking AnalyzerTask for iQser GIN
niPRO AnalyzerTask to calculate link popularity
AnalyzerTask to calculate the link popularity (SIN LP) for ContentObjects integrated into the iQser GinServer. Developed by niPRO-Project. -
19
drvq
dimensionality-recursive vector quantization
drvq is a C++ library implementation of dimensionality-recursive vector quantization, a fast vector quantization method in high-dimensional Euclidean spaces under arbitrary data distributions. It is an approximation of k-means that is practically constant in data size and applies to arbitrarily high dimensions but can only scale to a few thousands of centroids. As a by-product of training, a tree structure performs either exact or approximate quantization on trained centroids, the latter... -
20
IterInt is a numerical integration package that implements iterated numerical integration methods. Iterated methods can be used to compute low dimensional (less than ten, for example) integration problems to get very accurate results.
-
21
This library implements a thread-safe skip list data structure - a kind of list with good insertion, deletion and searching performances. It uses Fred Fish's dbug library as internal tracing/debugging system. See the web site for more details.
-
22
ivl
A C++ template library extending syntax towards mathematical notation
ivl is a full-header template C++98 math library with convenient yet powerful syntax. It extends classic C++ syntax towards mathematical notation while making use of the language's elements like classes, structs, operators and functions. Expression written using ivl are excessively optimized. In other words, ivl allows writing simpler and more expressive statements using math-like formulas while taking care of optimizing them. ivl features arrays, tuples and custom function-like... -
23
2D-Physics-Engine
2D physics engine and simulation
Simulate 2D physics with my engine entirely made in JavaScript. Modify live existing scenarii or create your own from scratch with the live editor. Try it on the demo web site! :) Note : If you intend to download and use the sources as it is, you need to host it as scenario resquests are made in AJAX. -
24
Image Sorter
A visual animated demonstration of two sorting algorithms
An applet designed to demonstrate visually the steps taken by two sorting algorithms -- Insertion sort and Selection sort. -
25
Funnel Sort
command line sort utility
Moved to GitHub https://github.com/fedups A command-line utility to sort files. Funnel is a sort utility to sort files, large and small. It efficiently handles fixed length records and variable length records. Funnel easily handles ascii (readable) data and binary data. There are many more features in Funnel. It is easy to use and very fast. All documentation is on the Wiki.
