Open Source Linux Algorithms - Page 29

This package implements a variety of interpolation schemes for the Julia language. It has the goals of ease of use, broad algorithmic support, and exceptional performance. Currently, this package supports B-splines and irregular grids. The API has been designed with the intent to support more options. Initial support for Lanczos interpolation was recently added. Pull requests are more than welcome! It should be noted that the API may continue to evolve over time.

Interval Container Library (ICL): An STL based generic library for computations on intervals, interval containers and cubes

Most comprehensive list of tech interview questions of companies scraped from Geeksforgeeks, CareerCup and Glassdoor.

Isometric engine for 2D rendering. Supported frameworks: * SDL * XNA * easily extendable to other frameworks Features: * diamond maps of different width and height * user defined tile size (via rendering metrics) * supports 1 static tile + and any amount of movable elements per cell * z-order display * supports animated tiles * supports zooming (ability to define tilesets for different rendering metrics and switch between them) * supports multi-cell elements

Contains various algorithms that maps short reads produced from Illumina (Solexa) Genome Analyzer, or Applied Biosystems' SOLiD System, to a reference sequence or a set of reference sequences.

Discontinued.

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, the tool enables to check all examples in the PVS Bernstein testsuite within a second, which can be an order of magnitude faster than some other tools such as QEPCAD or REDLOG. Although JBernstein uses double, it offers automatic error-estimation capabilities (experimental) so that the generated result is correct (the solver may return unknown when the error-estimate is too large)

JBooleanExpression is a simple Java API to evaluate a Boolean String Expression like "!true&&false||true" (parse a Boolean String Expression to a boolean primitive type)

The K.U.Leuven JCHR System is an integration of Constraint Handling Rules (CHR) and Java designed with three aims in mind: user-friendliness, flexibility and efficiency. http://www.cs.kuleuven.be/~petervw/JCHR/

JCLEC is a general purpose evolutionary computation framework developed in Java. Some of its mains features are: multilevel architecture, highly reusable and integrable with other systems, easy to use and a lot of implemented algorithms and operation

JClassCollections is a library of Java collections whose contents can be filtered by class. When a filtered view is requested, all objects that are instances of the specified class (either directly or via inheritance) are included.

[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 (< Integer.MAX_VALUE vertices). Requires Java 5 or later.

A Graph support extension to the java.util collections framework.

A java framework for developing meta-heuristics that supports the use of grids environments. The meta-heuristics planned to be realeased are GAs, VNS and NNs. The grid middleware that will be firstly explored is the OurGrid solution.

JKalman is an Open Source Java implementation of Kalman filter. Kalman filter is an efficient computational (recursive) tool to estimate the dynamic state of a process in a way that minimizes the mean of error.

JMill is the java-based game of "Nine Men's Morris". This project is son of the greater parent SourceForge project "JGames", that realizes the real game environment...

JNSGA2 is a Java library with an implementation of the multi-objective genetic algorithm NSGA-II published by Deb et al.

Common classes for the Ballistic software

Common classes to perform mathematical operations

JOthi is the java-based game of "Othello". This project is son of the greater parent SourceForge project "JGames", that realizes the real game environment: JOthi only defines the "Othello" game rules and its specific AI players.

JPortForwarder Project JPortForwarder is a multithreaded TCP Port Forwarder application. The following feature have been developed: - Generic TCP Port Forwarging. Listen for a port and forward to an ip:port. - Multihoming TCP Port Forwarding.

JS-Sorting-Algorithm is an educational repository and GitBook-style resource about classic sorting algorithms. It explains sorting as a core topic in data structures and algorithms, with attention to internal sorting, external sorting, time complexity, memory usage, and stability. The guide covers ten major sorting methods, including bubble sort, selection sort, insertion sort, shell sort, merge sort, quicksort, heap sort, counting sort, bucket sort, and radix sort. It compares algorithms by complexity classes such as quadratic time, linearithmic time, and linear time. The repository also includes terminology explanations for concepts like data size, buckets, in-place sorting, out-place sorting, and stability. Overall, it is a compact reference for students and developers who want to review sorting theory and implementation examples.

The class 'JSEvaluator' in this project allows us to interpret expressions in JScript, allowing us to use parameters in the server at runtime. For example: ({@ 1} + {@ 2}) / 100; Parameter {@ 1} : 36 Parameter {@ 2}: 45 Result of the expression: 0.81

Application provide indexing and searching capability using Inverted File & TVSM methods. Also provide native integration with UNIX based indexing service also GoogleBase & YouTube search via Atom feeds.

JSort is a library with some sorting algorithms implementation and related data structure. It has compare-based algorithms, linear sorting, graph sorting, priority based queue, and so on.