Search Results for "gridlab-d"

Tests on "neutrality" are designed to detect systematic deviations from chance patterns in genetic data. This tool computes for a given SNP site frequency spectrum some standard test statistics like Tajima's D, Fay & Wu's H, etc. Additionally, the user may adapt the tests to specific demographies by specifying non-standard first and secondary moments. These can be obtained e.g. from simulations.

BioFVM is an open source diffusive transport solver for biological problems. It can solve for the diffusion of tens or hundreds of substrates on large 3-D domains. For simplicity, the code has minimal external dependencies. BioFVM was first published in: A. Ghaffarizadeh, S.H. Friedman, and P. Macklin. BioFVM: an efficient, parallelized diffusive transport solver for 3-D biological simulations. Bioinformatics 32(8): 1156-8, 2016. DOI: 10.1093/bioinformatics/btv730 method paper: http://dx.doi.org/10.1093/bioinformatics/btv730

...The MOEA Framework supports genetic algorithms, differential evolution, particle swarm optimization, genetic programming, grammatical evolution, and more. A number of algorithms are provided out-of-the-box, including NSGA-II, NSGA-III, ε-MOEA, GDE3 and MOEA/D. In addition, the MOEA Framework provides the tools necessary to rapidly design, develop, execute and statistically test optimization algorithms.

python2/3: compute polyfit (1D, 2D, N-D) without any thirdparty library like numpy, scipy etc. also can be used for least squares solution computation and for A=QR matrix decomposition. Tested with python 2.7 and 3.4 Consider donating to this project: https://sourceforge.net/p/purepythonpolyfit/donation For a Sample use, refer to the WIKI

This project provides a Fortran90 library and a python module for singular spectrum analyses such as PCA/EOF or MSSA. It is intended for people interested, for example, in analysing climate or financial variability.

...Another approach would be to pick any number for c, then express d in terms of that number. For example, if the student arbitrarily chose c=13 then: 18-64-c*d=4 18-64-13*d=4 d=(4-18+64)/(-13)

A 2-D inviscid flow and adjoint solver on unstructured triangular grids. It makes use of a vertex-centroid finite volume scheme which is second order accurate. The adjoint solver is developed using the automatic differentiation tool called TAPENADE. Code has been moved to https://github.com/cpraveen/euler2d

This is a simple program that will factor a quadratic trinomial using both "guess-and-check" and the quadratic formula. You input a, b, and c, where ax^2+bx+c=0; you will get a result in the form of (ax+b)(cx+d)=0 and x=a or x=b.

The project aims to provide the basic functions and algorithms needed for computations in polynomial rings over the ring of integers, including polynomial arithmetic and D-Groebner Bases. It might evolve in some kind of computer algebra system

D-Cog (Declarative-Cognition) is a Java based framework for training software components (reusable, object-oriented, interface-driven components). Instead of programmed, software components are trained by example to get the expected results.

D. R. Kaprekar found an interesting behaviour of four-digit number (say, 6349). Take any number; sort its digits in ascending (3469) and descinding (9643) order; subtract these (9643 - 3469 = 6174). Repeat these steps a couple of times. Surprisingly, you'

Numerically estimate an efficiency of code construction algorithms. Randomly generate n binary words of length m with minimum Hamming distance d and create a prefix code (= retrieval tree) from them. Based on PhD work.

QPlot - an Advanced Mathematical Calculator Includes: natural-style input, 2-D and 3-D graphing, differentiating, integrating, equation solving, C-like PROGRAMMING, and a lot more! What's most exciting, it is EXTENSIBLE!

GPLconx is an educational visualization tool that allows exploration of lines and conic sections in three models of 2-D hyperbolic geometry.

This is an ocaml binding for LevMar Minimization library. The library offers minimization from IR^n to IR^d finding the point which minimizes the distance ||f(p)-x0|| where x0 is the solution in the image space. The binding enables to use ocaml functions