Search Results for "boolean"

Metadata/data identification Java library. Identifies Base Type (e.g. Boolean, Double, Long, String, LocalDate, LocalTime, ...) and Semantic Type information (e.g. Gender, Age, Color, Country, ...). Extensive country/language support. Extensible via user-defined plugins. Comprehensive Profiling support. Large set of built-in Semantic Types (extensible via JSON defined plugins). Extensive Profiling metrics (e.g.

...Using the web user interface, the crawlers (web, file, database, etc.) and the client libraries (REST/API , Ruby, Rails, Node.js, PHP, Perl) you will be able to integrate quickly and easily advanced full-text search capabilities in your application: Full-text with basic semantic, join queries, boolean queries, facet and filter, document (PDF, Office, etc.) indexation, web scrapping,etc. OpenSearchServer runs on Windows and Linux/Unix/BSD.

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.

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