Search Results for "boolean"

...Then we have to build our trading strategy. It is made of two trading rules, one for entry, the other for exit. Ta4j comes with a set of basic trading rules/strategies which can be combined using boolean operators. Trading strategies can be easily compared according to a set of analysis criteria. Ta4j can also be used for live trading with more complicated strategies.

Java Quine McCluskey (JQM) implements the Quine-McCluskey algorithm with Petrick’s Method for minimizing Boolean functions. Designed for both education and industrial application, it handles up to 16 variables and functions. Uniquely, JQM bridges the gap between theory and practice: it visualizes the solution process with generated Karnaugh Maps for students, while supporting PLC engineers by exporting results to Structured Text (ST) and Ladder Diagram (LD).

A simple yet powerful mesh generator based on MATLAB/GNU Octave language, creating finite-element mesh from surfaces or arbitrary 3D volumetric images (such as MRI/CT scans) with fully automatic workflows.

java symbolic computing library and math editor, with : polynomial system solving, vectors & matrices, factorization, derivatives, integrals (rational functions), boolean algebra, simplification, MathML output, java code generation, geometric algebra

mXparser is highly flexible parser of math expressions. Software provides easy to use API for JAVA, Android, C# .NET/MONO (CLS). Main functionalities: - basic operators, i.e.: +, -, *, ^, ! - Boolean logic operators i.e.: or, and, xor - binary relations i.e.: =, <, > - math functions (large library of 1-arg, 2-arg, 3-arg - - functions) i.e.: sin, cos, Stirling numbers, log, inverse functions - constants (large library), i.e.: pi, e, golden ratio - n-args functions i.e.: greatest common divisor - iterated summation and product operators - differentiation and integration High flexibility: - user defined constants and arguments, both free - and dependent on other arguments + possibility of use in functions - user defined functions (both free and depended) - user defined recursive arguments + simple (controlled) recursion (1 recursive argument) - user defined recursive functions / expressions (any) - complex, many arguments, no limitation - internal syntax checkin

opbdp is an implementation in C++ of an implicit enumeration algorithm for solving (non)linear 0-1 (or pseudo-Boolean) optimization problems with integer coefficients. A research report describing the techniques used in opbdp is included.

...Primitive Solid creation tools: Box, Cone, Truncated Cone, Cylinder, Sphere, Torus, Wedge, Truncated Wedge, Pyramid, Truncated Pyramid. 3. Sweep modeling tools: Extrude, Revolve, Loft, Pipe, Path 4. Boolean operation tools: Intersect, Subtract, Union, Xor, Fuse 5. Transform tools: Move, Rotate, Mirror, Scale

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.

Colloquium QDA is a tool for custom coding and analyzing qualitative ethnographic interviews. To run, make sure you first have JRE 8 or later installed (http://www.oracle.com/technetwork/java/javase/downloads/). Colloquium QDA is an open source cross-platform Java Swing app utilizing an embedded Java DB with Lucene integrated search.

JReliability allows to derive several reliability-related measures like Mean-Time-To-Failure (MTTF) or Mission-Time (MT) of complex systems that are modeled using Boolean functions, efficiently encoded in Binary Decision Diagrams (BDDs).

An implementation of the Joint Generation Algorithm of Fredman and Khachiyan for the computation of a dual pair of monotone boolean formulas in DNF (hypergraph transversals, extreme rays of polyhedral cones...). User-replaceable oracle.

The Logic Calculator is an application useful to perform logical operations. It has three modes: (1) Evaluation of logic formulae: In this mode we have the basic boolean operations (negation, conjunction, disjunction, conditional and biconditional) so the user can insert the logic formula and the Logic Calculator displays the truth table along with the models of the formula. (2) Logical entailment: In this mode the user can insert a number of premises followed by a number of conclusions, so the Logic Calculator displays the truth table of each premise / conclusion and the result of whether or not these premises logically entail the given conclusions...

This project provides a set of solid modeling tools which aims to help processing 3D objects with complex topology and geometry that are widely used in many industrial applications (e.g., microstructure design and manufacturing, biomedical products and applications, jewelry products, reverse engineering). The system is completely GPU-based and heavily based on an implicit representation named LDNI.

...GGS has a unique feature: It allows the user to write JavaScript code to be executed for nodes of the grammar. This is useful for checking grammatical agreements but not only. The user can: declare variables (including complex js structures), check for boolean conditions, use variables in annotations etc.

ExpressionOasis is a java based framework for evaluating the various type of expressions like arithmatic, logic expression etc. The framework is flexible enough to define any new grammer rules or operators.

A IC/MEMS layout editor. Features: all angle, font generator, macros, boolean operations, design rule checker, supported formats:Calma GDSII, OASIS (Open Artwork System Interchange Standard), OpenAccess, DXF, CIF (Caltech Intermediate Form), ...

PolyBoRi is implemented as a C++ library for Polynomials over Boolean Rings, which provides high-level data types for Boolean polynomials. A python-interface yields extensible algorithms for computing Groebner bases over Boolean Rings.

this project uses Quine–McCluskey algorithm to optimize boolean functions, the input function should be given in terms of minterm numbers and the output is optimized and in form of sum of products(SOP) there is also a Cost calculation and comparison between different optimizations.

This program minimizes boolean expressions. After combining minterms as far as possible, the program draws a chart of prime implicants which the user can easily read and manipulate to remove any remaining superfluous implicants.

This project is a collection of tools that are useful for someone working in the computer engineering field. So far this program is able to do logic minimization using the Quine-McClusky Method, numeric base conversion, and some bit manipulations.

bonesim is a collection of PHP scripts for creating boolean networks. bonesim has educational character.

Quinessence is conceived as a package to perform optimal two-level realization of a boolean function using the classical Quine-McCluskey algorithm.

Processes boolean functions which can be provided either as a list of 0s and 1s or which can be provided as a formula in first-order logic (using disjunctive or conjunctive normal forms). Internally the Quine McCluskey algorithm is used.

Boolean Expression Solver is a command-line utility that generates a truth table for a given Boolean expression.

This is a small and fast library and command-line tool for manipulation of logic/boolean-algebra expressions, including proofing and simplification. A front-end using tigcc for Texas Instruments calculators is planned, too.