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

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

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

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

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

KeplerDB is a temporal database to store time/value entries where the type of value could be integer, float/double, boolean and string. KeplerDB is dedicated to be scalable and to create clusters of server allowing the user to analyse and store massing amount of data to monitor systems like computers, clusters, building and captors or financial systems like markets and accounts. The user can use KeplerDB to make data analysis on enormous amount of data (statistics and modelling).

...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 HP41CV simulator for the Android platform. This version is the second beta release and includes nearly all functionality of the HP41CV including running programmes. Programmes can be imported / exported on csv format. A simple programme editor incl

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.

Visually build boolean logic circuits and then simulate their operation. Create custom components from user-designed circuits. Written in Java for cross-platform functionality. NOTE: This project has moved to Bitbucket at http://bitbucket.org/kwellwood/circuitsandbox

QMCMinimizer is a java-swing based aplication. It's designed with the purpose to be used as a tool on university degrees such as computer science, for teaching the process of boolean function simplification, through the Quine-McCluskey algorithm.

The Boolean Expression Reducer provides the user with various tools to visualize and analyze boolean expressions. Given an expression, it also reduces it to its Sum of Products and Product of Sums form.