Search Results for "min"

The minfx project is a Python package for numerical optimisation, being a large collection of standard minimisation algorithms. The name minfx is simply a shortening of the mathematical expression min f(x).

...Calis-p 2.0 handles both natural isotope abundances and data from labelling experiments such as stable isotope probing (SIP). It requires a mzIdent (or target spectrum match) and mzML files as the input and requires about 1 min per mzML file with 10 threads and needs <10 Gb of RAM. It has been tested with data from various nano liquid chromatography/Orbitrap platforms. For successful SIP, it is extremely sensitive, but requires the 13C fraction to remain below 10%. A newer version is available at github and we strongly recommend to try it out: https://github.com/kinestetika/Calisp.

Satsuma is a graph library for .NET, written in C#. Satsuma is an easy-to-use and flexible library, which implements all the necessary graph structures, and the fastest possible graph algorithms. DOCUMENTATION: http://satsumagraph.sourceforge.net/ Satsuma is not a charting library. 'Graph' is used in the mathematical sense here (e.g. nodes connected with arcs). Satsuma is released under the zlib license. This license is very permissive and allows you to use Satsuma for both personal...

jAgg is a Java 5.0 API that supports “group by” operations on Lists of Java objects: aggregate operations such as count, sum, max, min, avg, and many more. It supports Super Aggregation: Rollups, Cube, and Grouping Sets. It supports analytic operations such as lag/lead and row number and more. It also allows custom aggregate and analytic operations.

...We demonstrate its (1) generality, by reconstructing cell lineages in four-dimensional, terabyte-sized image data of fruit-fly, zebrafish and mouse embryos, acquired with three different types of fluorescence microscopes, (2) scalability, by analyzing advanced stages of development with up to 20,000 cells per time point, at 26,000 cells min-1 on a single computer workstation, and (3) ease of use, by adjusting only two parameters across all data sets and providing visualization and editing tools for efficient data curation. Our approach achieves on average 97.0% linkage accuracy across all species and imaging modalities." *Please cite this paper if you use this code for your research

...Possible breaks in longterm mean can be detected with a change-point analysis using CuSum algorithms. Phenological events such as start-of-season, day-of-max/day-of-min, end-of-season can be determined via threshold-based algorithms or via analysis of max. increase of NDVI during green-up. These analyses work also for multimodal phenologies where individual seasons (partly) interfere each other. User can navigate through all steps of analysis via GUI or can define complex workflows that will be processed in batch-mode.

QPNet (Quick Petri Net) is a fast Petri Nets' emulator, created by students of Moscow State Technical University of Radio Engineering, Electronics and Automation. It brings benefits for the educational process, while being under further development and extension. QPNet это быстрый эмулятор сетей Петри, созданный студентами МИРЭА. Он применяется в учебном процессе, а так же продолжает разрабатываться и эволюционировать.

In 2015, we converted MiDataSets and cDataSets to open Collective Knowledge Format (CK) and moved them here: http://github.com/ctuning/ctuning-datasets-min CK allows you to simplify compilation and execution of these benchmarks across multiple platforms (Windows, Linux, MacOS, Android ...). In this project, we collect multiple datasets for a MiBench benchmark (free, commercially representative embedded benchmark suite) to create the conditions for a more realistic benchmarking of different computing systems.

Set of Ant filters that can be used to gather statistics from files or resources. It is mainly used for log files analysis. It allows to: - count inputs - count occurrences of each input - calculate average, max and min values of floats in input