Search Results for "scada open source" - Page 12
Sort By:
Showing 1127 open source projects for "scada open source"
View related business solutions-
$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.
-
Veeam Data Platform v13.1 - Get Your Free TrialTry Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.
-
1
JGAP is a Genetic Algorithms and Genetic Programming package written in Java. It is designed to require minimum effort to use, but is also designed to be highly modular. JGAP features grid functionality and a lot of examples. Many unit tests included. Legal notice/Impressum: Klaus Meffert An der Struth 25 D-65510 Idstein sourceforge <at> klausmeffert.de
-
2
HeaDDaCHe
Hashed dynamic determinants for convex hulls
Description: We propose and implement in C++ the hashed dynamic determinants scheme. This consists of efficient implementations of dynamic determinant algorithms and a hash table that stores intermediate results (matrices and determinants) in order to be used in subsequent steps of the algorithm. Related papers: V.Fisikopoulos, L.Peñaranda. Faster Geometric Algorithms via Dynamic Determinant Computation. In Algorithms – ESA 2012, Lecture Notes in Computer Science Volume 7501,... -
3
Java CoreWars Evolver
A Java based, pMars compatible, CoreWars simulator with GA
A Java based, pMars compatible, CoreWars simulator with Genetic Algorithm warrior evolver functionality. Java 8 is needed. See [Wiki:Tutorial] -
4
libmng -THE reference library for reading, displaying, writing and examining Multiple-Image Network Graphics. MNG is the animation extension to the popular PNG image-format.
-
Go from Code to Production URL in SecondsSkip the Kubernetes configs. Cloud Run handles HTTPS, scaling, and infrastructure automatically. Two million requests free per month.
-
5
Diagonal
A command line toolki to solve a problem your favorite program defines
Diagonal can be used for: - getting descriptive statistics such as mean/median/mode with your program producing a sample - finding a root of an equation your program defines - calculating a fixed point of a function your program defines - detecting a cycle of a fuction your program defines as well as - decoding a VCDIFF file -
6
E-w0rm : is a powerfull shell with handy features like : file manager , password change , database manager , bind shell , remote shell , remote upload , edit , chmod , delete , make , autoroot , php code execution , server command execution , process manager ... You can also change theme ! And " E-w0rm " brought to you by : Epic Hackers S.C Scan : https://goo.gl/718BkD
-
7
The C Algorithms library has moved to GitHub. Please go to the new project page: https://github.com/fragglet/c-algorithms
-
8
jFuzzyLogic is a java implementation of a Fuzzy Logic software package. It implements a complete Fuzzy inference system (FIS) as well as Fuzzy Control Logic compliance (FCL) according to IEC 61131-7 (formerly 1131-7).
-
9
ctsa
A Univariate Time Series Analysis package in ANSI C
CTSA is a C software package for univariate time series analysis. This is a work in progress. ARIMA and Seasonal ARIMA models have been added so far. Other functionality will be added soon . Documentation - https://github.com/rafat/ctsa/wiki -
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
10
-
11
PartWriter
A project designed to write sheet music.
The project is composed of two layers. The first layer is an artificial intelligence engine, partwriter, that writes music based on some heuristic. The second layer is the layer that defines the heuristic. The definition of this heuristic defines the type of music that partwriter will create. Currently (December 2012), the deepest layer is more or less complete. The author is now writing second layers of interest, namely species counterpoint heuristics according to Fux's Gradus Ad Parnassum. -
12
The library for utilization of Minimal Quadtree format for storing very large sparse matrices. Please see the paper referenced below for the description of a problem. Corresponding papers: Tree-based Space Efficient Formats for Storing the Structure of Sparse Matrices (I. Šimeček, D. Langr, P. Tvrdík), In Scalable Computing: Practice and Experience, volume 15, 2014. Space Efficient Formats for Structure of Sparse Matrices Based on Tree Structures (I. Šimeček, Daniel Langr, Pavel...
-
13
Ginors Sort
sorting algorithm for binary keys
in-place sorting algorithm with O(n*log(k)) time komplexity. The data have to be the structure: struct { unsigned (char/short/int/long); [...] } -
14
A set of software tools useful for building, testing, and exercising web services (and other interfaces) for the travel industry which comply with the specifications of the Open Travel Alliance (OTA). This project is initiated by members of the OTA.
-
15
deapheap
Deap is a doubly heap for both min and max number access.
A deap is a doubly priority queue for efficient data operations. Both insertion and deletion operations take O(log(N)) time. Access of min or max takes constant time. It can be useful when both min and max are needed in the queue. It can also be used in situations where the number of items is too large and items with low priorities can be dropped with keep memory footprint small. -
16
High-order HMM in Matlab
Implementation of duration high-order hidden Markov model in Matlab.
Implementation of duration high-order hidden Markov model (DHO-HMM) in Matlab with application in speech recognition. -
17
S-Match
S-Match is a semantic matching framework.
S-Match is a semantic matching framework. S-Match takes any two tree like structures (such as database schemas, classifications, lightweight ontologies) and returns a set of correspondences between those tree nodes which semantically correspond to one another. S-Match contains implementations of the semantic matching, minimal semantic matching and structure preserving semantic matching algorithms. S-Match applies as a solution in many fields, including: information integration,... -
18
This is a general open source Quantum Mechanics/Molecular Mechanics project with academic origin. Its intention is to produce free software tools to study molecular systems through QM/MM, in open collaboration.
-
19
JaQLib is a compact Java library that supports programmers in querying all sorts of collections, DBs and XML files in a compact and intuitive manner. Example: List<MyItem> result = Jaqlib.List.selectFrom(myCollection) .where(myCondition).asList()
-
20
-
21
C++, Matlab and Python library for Hidden-state Conditional Random Fields. Implements 3 algorithms: LDCRF, HCRF and CRF. For Windows and Linux, 32- and 64-bits. Optimized for multi-threading. Works with sparse or dense input features.
-
22
-
23
OptimC
OptimC - Optimization / Unconstrained Minimization Library in ANSI C
OptimC is a C software package to minimize any unconstrained multivariable function. The algorithms implemented are Nelder-Mead,Newton Methods (Line Search and Trust Region methods), Conjugate Gradient and BFGS (regular and Limited Memory). Brent method is also available for single variable functions if the bounds are known. Update 06/09/2014 - Nonlinear Squares Implementation [Levenberg-Marquardt Method] Added. Documentation - http://code.google.com/p/optimc/ -
24
Mr.FSM
Large-Scale Frequent Subgraph Mining in MapReduce
This is the program used in the following paper: Wenqing Lin, Xiaokui Xiao, and Gabriel Ghinita. Large-Scale Frequent Subgraph Mining in MapReduce. In Proceedings of the 30th IEEE International Conference on Data Engineering (ICDE), pages 844-855, 2014. Please cite the paper if you choose to use the program. If having any problems, please report to {wlin1 at ntu dot edu dot sg}. -
25
Structorizer is a little tool which you can use to create Nassi-Schneiderman Diagrams (NSD). Stuctorizer is written in Java and free for any use. The code has been moved to Github: https://github.com/fesch/Structorizer.Desktop
