Search Results for "ns2 code with algorithm"

* Fast GPU linear algebra library (matrix maths) for the C++ language, aiming towards a good balance between speed and ease of use * Provides high-level syntax and functionality deliberately similar to Matlab * Provides an API that is aiming to be compatible with Armadillo for easy transition between CPU and GPU linear algebra code * Useful for algorithm development directly in C++, or quick conversion of research code into production environments * Distributed under the permissive Apache 2.0 license, useful for both open-source and proprietary (closed-source) software * Can be used for machine learning, pattern recognition, computer vision, signal processing, bioinformatics, statistics, finance, etc * Downloads: http://coot.sourceforge.io/download.html * Documentation: http://coot.sourceforge.io/docs.html * Bug reports: http://coot.sourceforge.io/faq.html * Git repo: https://gitlab.com/conradsnicta/bandicoot-code...

Model-based Analysis of Genome-wide CRISPR-Cas9 Knockout (MAGeCK) is a computational tool to identify important genes from the recent genome-scale CRISPR-Cas9 knockout screens technology. For instructions and documentations, please refer to the wiki page. MAGeCK is developed by Wei Li and Han Xu from Dr. Xiaole Shirley Liu's lab at Dana-Farber Cancer Institute/Harvard School of Public Health, and is maintained by Wei Li lab at Children's National Medical Center. We thank the support...

NOMAD is a C++ code that implements the MADS algorithm (Mesh Adaptive Direct Search) for difficult blackbox optimization problems. Such problems occur when the functions to optimize are costly computer simulations with no derivatives.

...MSFFT, implemented by David Lawlor and Bosu Choi. This code is fast, but is not terribly easy to use. The algorithm is robust to some noise, but requires a lot of parameter tuning. Enjoy at your own risk :), Mark Iwen

PortOpt [Portfolio Optimizer] is a C++ program (with Python binding) implementing the Markowitz(1952) mean-variance model with agent's linear indifference curves toward risk in order to find the optimal assets portfolio under risk. You have to provide PortOpt (in text files or - if you use the api - using your own code) the variance/covariance matrix of the assets, their average returns and the agent risk preference. It returns the vector of assets' shares that composes the optimal portfolio. In order to minimise the variance it internally uses QuadProg++, a library that implement the algorithm of Goldfarb and Idnani for the solution of a (convex) Quadratic Programming problem by means of an active-set dual method. ...

Research on automatic face recognition in images has rapidly developed into several inter-related lines, and this research has both lead to and been driven by a disparate and expanding set of commercial applications. The large number of research activities is evident in the growing number of scientific communications published on subjects related to face processing and recognition. Index Terms: face, recognition, eigenfaces, eigenvalues, eigenvectors, Karhunen-Loeve algorithm.

The proposed filter-based algorithm uses a bank of Gabor filters to capture both local and global details in a fingerprint as a compact fixed length FingerCode. The fingerprint matching is based on the Euclidean distance between the two corresponding FingerCodes and hence is extremely fast. We are able to achieve a verification accuracy which is only marginally inferior to the best results of minutiae-based algorithms published in the open literature. Our system performs better than a...

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....

[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 (<...

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> <artifactId>mathparser-java</artifactId> <version>1.0.0</version> </dependency> Expressions supported (Mar/09/2013) - Arithmetic operations. ...

LSGTL means LLX’s Static Graph Template Library which is a light-weighted header-only template library developed mainly for static graph analysis. LSGTL is expected to be used in laboratories for research purposes mostly.

Fast-Fourier-Transform-based number theory code to test Mersenne numbers for primality using the Lucas-Lehmer test and the Crandall-Fagin irrational-base discrete weighted transform (IBDWT) algorithm (Math. Computation 62 (205), pp.305-324, January 1994)