Search Results for "using" - Page 4
Sort By:
Showing 171 open source projects for "using"
View related business solutions-
AI-generated apps that pass security reviewRetool lets you generate dashboards, admin panels, and workflows directly on your data. Type something like “Build me a revenue dashboard on my Stripe data” and get a working app with security, permissions, and compliance built in from day one. Whether on our cloud or self-hosted, create the internal software your team needs without compromising enterprise standards or control.
-
Outgrown Windows Task Scheduler?Windows Task Scheduler wasn't built for complex, cross-platform automation. Get a free diagnostic that shows exactly where things are failing and provides remediation recommendations. Interactive HTML report delivered in minutes.
-
1
msp
mathSuite Speed & Matrix Stream Processor
This program is fundamentally a short-sized version of my mathSuite program: https://sourceforge.net/projects/mathsuite/ It includes all the functionalities of MSCenv (mathSuite Calculus Environment), such as inline variables and functions (mainly thanks to ExprEval), which you can use to perform expensive complex computations and store their results into runtime variables. You can perform also every Linear Algebra Operations included in mathSuite with new optimizations. -
2
Online Signature Verification
Real time signature verification using MATLAB and C#
Online Signature Verification technology requires primarily a digitizing tablet and a special pen connected to the USB port of a computer. An individual can sign on the digitizing tablet using the special pen regardless of his signature size and position. The signature is characterized as pen-strokes consisting x-y coordinates and pressure with the data being stored in a signature database. Dynamic time warping (DTW) and quadratic discriminant analysis (QDA) is used to get results where the system accepts 2% of forged signatures and rejects 5% of true signatures -
3
A light-weight Regular Expression (regex) C library, using double-recursion. (command prompt tester included)
-
4
BudgetedSVM
BudgetedSVM: A C++ Toolbox for Large-scale, Non-linear Classification
We present BudgetedSVM, a C++ toolbox containing highly optimized implementations of three recently proposed algorithms for scalable training of Support Vector Machine (SVM) approximators: Adaptive Multi-hyperplane Machines (AMM), Budgeted Stochastic Gradient Descent (BSGD), and Low-rank Linearization SVM (LLSVM). BudgetedSVM trains models with accuracy comparable to LibSVM in time comparable to LibLinear, as it allows solving highly non-linear classi fication problems with millions of... -
Atera all-in-one platform IT management software with AI agentsAtera’s AI agents don’t just assist, they act. From detection to resolution, they handle incidents and requests instantly, taking your IT management from automated to autonomous.
-
5
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, in Department of Computer Science at Federal University of Lavras. The results of this project were published in the Revista de Sistemas de Informação da FSMA and is available in http://www.fsma.edu.br/si/edicao11/FSMA_SI_2013_1_Principal_1.html -
6
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 Vision and Pattern Recognition, 2012. ... -
7
-
8
Daniel Mirrai Framework for Delphi
Framework for developer Delphi
danielmirrai@gmail.com Framework complete for developer quick and easy using the programming model by layers Model view presenter (MVP) having superclasses already being ready all actions database, persistence, validations, instance classes and layouts. -
9
Bin Packing with Genectic Algorithm
Bin Packing problem solved using Genectic Algorithm
This project contains a solution for a Bin Packing problem solved using Genectic Algorithms. The code in the project was created as a solution for a problem in a combinatorial optimization class at the Univeridade Federal do Rio Grande do Sul (UFRGS - Brasil) in 2007. -
Total Network Visibility for Network Engineers and IT ManagersThis means every device on your network, and every interface on every device is automatically analyzed for performance, errors, QoS, and configuration.
-
10
ivl
A C++ template library extending syntax towards mathematical notation
...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 objects with left-right overloading, function pipelining and function vectorization, automatic lazy evaluation, sub-arrays and other views of a single or multidimensional arrays, stl-compatible iterators, multidimensional iterators and multithreading. ... -
11
Java generic Iterator implementation to generate permutations and combinations. Uses the algorithm described here http://en.wikipedia.org/wiki/Steinhaus%E2%80%93Johnson%E2%80%93Trotter_algorithm#Even.27s_speedup and the clear description of that algorithm here: http://www.cut-the-knot.org/Curriculum/Combinatorics/JohnsonTrotter.shtml
-
12
Vigenere Dictionary Attack
Vigenere brute force / dictionary cracking tool
This is a tool that uses a combination between a brute force and dictionary attack on a Vigenere cipher. At present, keys are generated using brute force (will soon try passwords generated from a dictionary first). Each key is then used to decode the encoded message input. The output is analysed and then put into a ranking table. Outputs will be ranked on a variety of factors (at present, only number of dictionary words in output are counted). For the future: Better key generation, trying combinations of dictionary words with numbers. ... -
13
Sharp Statistics
A simple program for comparing data sets with simple algorithms.
Replace the data in the data.db file with your own data using an sqlite3 manager. Tables are read as data set names, and the values are read as the data points of the data sets. Load the application, choose an algorithm, and the program will find the pairs that best match each other. -
14
Technical analysis library with indicators like ADX, MACD, RSI, Stochastic, TRIX... includes also candlestick pattern recognition. Useful for trading application developpers using either Excel, .NET, Mono, Java, Perl or C/C++.
-
15
libfgen
Library for optimization using a genetic algorithm or particle swarms
libfgen is a library that implements an efficient and customizable genetic algorithm (GA). It also provides particle swarm optimization (PSO) functionality and an interface for real-valued function minimization or model fitting. It is written in C, but can also be compiled with a C++ compiler. Both Linux and Windows are supported. -
16
Java Combinatorial Optimization Platform is used to solve combinatorial problems using common interface, providing means to easily add new algorithms and problems and to benchmark them.
-
17
Approximate Subgraph Matching Algorithm
Approximate Subgraph Matching Algorithm for Dependency Graphs
The subgraph matching problem (subgraph isomorphism) is NP-complete. Previously, we designed an exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach (http://esmalgorithm.sourceforge.net). We further designed an approximate subgraph matching (ASM) algorithm that is capable of detecting approximate subgraph matching based on a subgraph distance. Assume that the graph G and the subgraph Gs have m and n vertices, and km and kn edges respectively, the total worst-case algorithm complexity is O(m^n * n(n-1)/2 * km * log m). ... -
18
HL7 to XML Transformation toolkit. Using HL7 v2 XML
-
19
Matlab test to .NET C#
Open Source Code Simple Test of Microsoft .NET C# using NE Builder
FREE Download Open Source Code Simple Test of Microsoft .NET C# using MATLAB NE Builder Toolbox This is a simple demo of this powerful Matlab toolbox with some M script algo examples Download the ZIP package from http://quantlabs.net/blog/2012/11/free-download-open-source-code-simple-test-of-microsoft-net-c-using-matlab-ne-builder-toolbox-matlab-csharp/ -
20
Numerical Systems Calculator
An arithmetic calculator for the most popular numerical systems.
Have you ever imagined not having to do math to convert the various number systems and still make arithmetic calculations with different numerical systems in the same expression? That's what makes this application. You can mix decimal, binary, octal and hexadecimal arithmetic operations using the symbols "+, -, *, /,^,". You can put "e" to use Napier's constant, put "pi" to use pi constant and put a "!" in the of numerical system form to factorization. So let's start doing the math in an instant with this application and save the rest of the time for more useful things of interest. -
21
ACADO Toolkit
Toolkit for Automatic Control and Dynamic Optimization
ACADO Toolkit is a software environment and algorithm collection for automatic control and dynamic optimization. It provides a general framework for using a great variety of algorithms for direct optimal control, including model predictive control, state and parameter estimation and robust optimization. ACADO Toolkit is implemented as self-contained C++ code and comes along with user-friendly MATLAB interface. The object-oriented design allows for convenient coupling of existing optimization packages and for extending it with user-written optimization routines. -
22
textcrypter
textcrypter is an encryption tool using vigenere cipher algorithm
Textcrypter is an encryption tool using vigenere cipher algorithm. Vigenere use the same key/password to encrypt and decrypt a file (symmetric key cryptosystem). Result of the encryption process is a ciphertext in hexa number. -
23
Exact Subgraph Matching Algorithm
Exact Subgraph Matching Algorithm for Dependency Graphs
The subgraph matching problem (subgraph isomorphism) is NP-complete. We designed a simple exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach. The total worst-case algorithm complexity is O(n^2 * k^n) where n is the number of vertices and k is the vertex degree. We have demonstrated the successful usage of our algorithm in three biomedical relation and event extraction applications: BioNLP 2011 shared tasks on event extraction, Protein-Residue association detection and Protein-Protein interaction identification. ... -
24
Wittgen
WIttgen is a two-instruction programming language modeled on the mind.
...The driving motivation for this design is that as far as we know, the human mind supports these two instructions.It may have additional mechanisms that create new assigns, but using the results of these mechanisms requires a system built from these instructions. -
25
db4o-sp
Spatial extension for db4o.
Master's Project: Object Database Spatial Extension. API based on SQL/MM Spatial. Full technical report is available in download section.
