Search Results for "algorithm" - Page 3
Sort By:
Showing 170 open source projects for "algorithm"
View related business solutions-
Powering the best of the internet | FastlyEnsure your websites, applications and services can effortlessly handle the demands of your users with Fastly. Fastly’s portfolio is designed to be highly performant, personalized and secure while seamlessly scaling to support your growth.
-
No-Nonsense Code-to-Cloud Security for Devs | AikidoAikido provides a unified security platform for developers, combining 12 powerful scans like SAST, DAST, and CSPM. AI-driven AutoFix and AutoTriage streamline vulnerability management, while runtime protection blocks attacks.
-
1
MandALot
A powerful Mandelbrot generator
MandALot is a powerful software. It allows you to explore the Mandelbrot set, and overall to create pictures from the set. The interface is fully customizable and is divided into several parts: you can manage separately how the algorithm works, and how the colors of the interior and exterior of the set are generated. It also features multi-layer gestion. MandALot is optimized for both large and small screens. -
2
mathSuite
Powerful Calculus Environment and Matrices Handling Engine
mathSuite is a very powerful Mathematical Suite which deals principally with complex algebric and geometric operations. It is powered by the fabulous ExprEval C Parser. The main purpose of this project is fast math-oriented algorithm virtualization, with an optimized direct text interface. Also it gives you a very powerful and fast Calculus Environment which let you handle easily interchangeable variable lists, matrices, LOGS and Settings Layouts with optimized Items Lists Managing Engine... -
3
TIDES
Taylor series Integrator for Differential Equations
Taylor series Integrator for Differential EquationS. This software is developed by Profs. A. Abad, R. Barrio, F. Blesa and M. Rodriguez, (GME, University of Zaragoza, Spain). It consists on a C (Fortran) library, libTIDES, and a Mathematica package, MathTIDES. (MathTIDES requires Mathematica version >= 7.0) . Basic references: * A. Abad, R. Barrio, F. Blesa, M. Rodriguez, 2012. Algorithm 924: TIDES, a Taylor series Integrator for Differential EquationS, ACM TOMS. 39, no. 1, art. 5. (Main... -
4
PhEq_bootstrap
FDA's f2 computation with bootstrap technique
This program was developed as a help in establishing pharmaceutical equivalence by use of FDA f2 coefficient. It was designed to help with f2 computation in cases when intra- and inter-batch variability is large, namely RSD>10%. The use of statistical bootstrap technique allows to implement confidence interval (CI) into the f2 coefficients resulting in overcoming of their major drawback in the original metrics. The algorithm provides possible “worst case scenario” of f2 values, thus supporting... -
Test your software product anywhere in the worldGlobal App Testing is a managed pool of freelancers used by Google, Meta, Microsoft, and other world-beating software companies.
-
5
MRA
A general recommender system with basic models and MRA
Multi-categorization Recommendation Adjusting (MRA) is to optimize the results of recommendation based on traditional(basic) recommendation models, through introducing objective category information and taking use of the feature that users always get the habits of preferring certain categories. Besides this, there are two advantages of this improved model: 1) it can be easily applied to any kind of existing recommendation models. And 2) a controller is set in this improved model to provide... -
6
PyVision Computer Vision Toolkit
A Python computer vision library
PyVision is a object-oriented Computer Vision Toolkit for researchers that contains vision and machine learning algorithms and algorithm analysis and easily interfaces with scipy/numpy, PIL, opencv and other computer and machine learning libraries. -
7
ExactCalc
Software for exact computing based on interval arithmetic.
... interval that contains exact result of computation. Sometimes is more easy to use numerical unstable algorithm to solve problem. Instability is actually speed of accumulating the truncation error, but it can be decreased arbitrary by using more precise computation. Interval arithmetic provides us control of accumulating truncating error. To save Your time using CPU time this program provides interpreter of simple programming language based on interval algebra with arbitrary precision arithmetic. -
8
libdwt
a cross-platform discrete wavelet transform library implemented in C
libdwt is a cross-platform discrete wavelet transform library implemented in C language. The library implements fast wavelet transform algorithm using lifting scheme. Cohen-Daubechies-Feauveau wavelets with 4 vanishing moments were used. -
9
JBernstein
JBernstein: Exploration techniques for non-linear constraint checking
JBernstein is a tool implemented in Java that enables to check whether a polynomial constraint holds for all variables within their domain. It is mainly used in the verification or synthesis of cyber-physical systems where the system model is nonlinear. The tool also supports specifications in assume-guarantee style. The underlying algorithm is based on a translation to Bernstein polynomials, and several optimization techniques are implemented to ensure efficiency. Concerning performance... -
Build Securely on AWS with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
10
KL1p
A portable C++ library for Compressed Sensing
KL1p is a portable C++ framework for handling sparse recovery of inverse problems of underdetermined linear systems, like in compressed sensing technique. -
11
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 -
12
algo_AHRS_dll
S.O.H. Madgwick's AHRS algorithm encapsulated in a .dll file
This is a windows DLL of S.O.H. Madgwick's AHRS algorithm. Original code can be found at: http://www.x-io.co.uk/open-source-imu-and-ahrs-algorithms/ -
13
PyGAO
Genetic Algorithm Optimization for Python
A simple interface for performing genetic algorithm optimization for numerical problems. I am starting with a stripped-down version, where a solution can be described using a single vector of float numbers. Eventually, I will expand to more generic data structures and add multiple-species search options. For the time being, I have no plans of developing a GUI. For now, this is strictly a computational module. In addition to the standard Python libraries, PyGAO uses numpy. -
14
CUDAPm1
CUDA implementation of P-1 factoring for Mersenne numbers
CUDAPm1 is a modification of CUDALucas that implements the P-1 factoring algorithm for Mersenne numbers using the Fast Fourier Transform implemented by nVidia's cuFFT library. You need a CUDA-capable nVidia card with compute compatibility >= 1.3. -
15
FreDec
Parallelized FREquency DEComposer algorithm
This is a parallelized algorithm performing a decomposition of the time-series data into a number of sinusoidal components, disentangling them from the white Gaussian noise. The algorithm analyses all suspicious frequencies, including the ones that look like an alias at a glance, but may become preferable later. After selection of the initial frequency candidates, the algorithm passes through all their possible combinations and estimates their multi-frequency statistical significance... -
16
This is the former home of pyecm, which has now been moved to github: https://github.com/martingkelly/pyecm Pyecm factors large integers (up to 50 digits) using the Elliptic Curve Method (ECM), a fast factoring algorithm.
-
17
Fylogenetica
Constructing level-1-networks consistent with a set of quartets
This project is an implementation of an algorithm by J. Keijsper and R. Pendavingh. The goal of the algorithm is to construct a phylogenetic level-1-network that is consistent with a given set of quartets. -
18
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. -
19
Semantic query optimization (SQO) is the process of finding equivalent rewritings of an input query given constraints that hold in a database instance. We present a Chase & Backchase (C&B) algorithm strategy that generalizes and improves on well-known methods in the field. The implementation of our approach, the pegasus system, outperforms existing C&B systems an average by two orders of magnitude. This gain in performance is due to a combination of novel methods that lower the complexity...
-
20
MathParser Java - Math Parser library
Mathematical Parser for Java
This project gives a mathematical parser for converting a simple string expression into a result which can be managed for using in other calculations, all in Java. Using a couple lines of code, you'll be able to parse complex arithmetic expressions efficiently. This library is powered by Dijkstra's Shuting-yard algorithm. The library has no dependencies with other external libraries. Dependency <dependency> <groupId>com.google.code.mathparser-java</groupId... -
21
Respol: A software package for computing projections of resultant polytopes Description: Respol is C++ software to compute a projection of the Newton polytope of the resultant of a given polynomial system. These are indirectly defined high-dimensional polytopes. Related Papers: [1] I.Z.Emiris, V.Fisikopoulos, C.Konaxis, L.Peñaranda. An oracle-based, output sensitive algorithm for projections of resultant polytopes. International J. Computational Geometry & Applications (Special...
-
22
segment
Solve the Viterbi algorithm in a data stream
It is often necessary to assign a series of discrete values to continuosly variable data sequenced by time, position, etc., thereby parsing the data into fewer and larger segments of variable width. The 'segment' utility takes an input data stream as a Hidden Markov Model and applies the Viterbi algorithm to find the most likely segmentation path through the data. -
23
smooth
Wavelet smoothing in a data stream
It is often necessary to smooth high frequency fluctuations out of data streams sequenced by time, position, etc. The 'smooth' utility applies such smoothing using the wavelet algorithm. This implementation of wavelet smoothing was optimized for use in a data stream. It was adapted from HMMSeg Wavelet.Java by Thomas E. Wilson, University of Michigan. HMMSeg Wavelet.Java was written by Andrew Hemmaplardh, University of Washington. http://noble.gs.washington.edu/proj/hmmseg... -
24
Tcl binding to levmar library implementing Levenberg-Marquardt optimization algorithm often used in data fitting. Levmartcl is a standard Tcl extension providing command interface to levmar functionality. This library is only a wrapper of <levmar> which actually performs the work. See the <levmar> home site for details: http://www.ics.forth.gr/~lourakis/levmar/
-
25
Bouc-Wen-Baber-Noori model of hysteresis
Compute parameters of the Bouc-Wen-Baber-Noori model of hysteresis
This toolbox computes the parameters of the Bouc–Wen–Baber–Noori hysteresis model using Multiobjective optimization evolutionary algorithms (MOBEAs). The toolbox uses the NSGA − II algorithm, which is an elitist non–dominated sorting EA. The toolbox uses the original NSGA-II algorithm developed by Prof. Kalyanmoy Deb, which can be download from: http://www.iitk.ac.in/kangal/codes.shtml Prof. Deb allowed me to use and post this toolbox. For further information about the toolbox read...
