Search Results for "boolean" - Page 4
Sort By:
Showing 191 open source projects for "boolean"
View related business solutions-
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
1
Javascript Clipper
Boolean operations and offsetting library in Javascript
The Javascript Clipper library performs clipping and offsetting for both lines and polygons. All four boolean clipping operations are supported - intersection, union, difference and exclusive-or. Polygons can be of any shape including self-intersecting polygons. Javascript Clipper is a port of Angus Johnson's Clipper library: https://sourceforge.net/projects/polyclipping LIVE DEMO: http://jsclipper.sourceforge.net/6.4.2.2/main_demo.html LIVE DEMO (FPoint): http://jsclipper.sourceforge.net/6.4.2.2_fpoint/main_demo.html Information and examples: http://jsclipper.sourceforge.net/6.4.2.2 Information and examples (FPoint): http://jsclipper.sourceforge.net/6.4.2.2_fpoint Donate Javascript Clipper Project: https://sourceforge.net/p/jsclipper/wiki/Donations/ Use cases: * Over 1500 schools in the UK uses Javascript Clipper in Digimap for Schools service. ... -
2
51Degrees-Java
Mobile Device Detection for Java - 4 Step Setup - 3 minutes
...Also available on Maven. 1) Download the zip and extract. 2) Add the core JAR located in the "dist" directory to your java project. 3) Import the following packages: import fiftyone.mobile.detection.Match; import fiftyone.mobile.detection.Provider; import fiftyone.mobile.detection.factories.StreamFactory; 4) Use the following code to start detecting devices: //The Lite data file is provided with every archive. Provider p = new Provider(StreamFactory.create("path/to/data/file")); Match match = p.match("USERAGENT_STRING"); boolean isMobile = match.getValues("IsMobile").toBool(); if(isMobile) System.out.println("Mobile"); else System.out.println("Not mobile"); -
3
E2F1Map
Logic based simulations of E2F1 regulatory core for disease signatures
We provide comprehensive molecular interaction map of E2F1 transcription factor in tumor progression and metastasis. We provide various scripts, boolean based models to identify molecular signatures for predicting EMT phenotype in bladder and breast cancer model. -
4
jClap
Java Command Line Argument Parser
This is a library for parsing command line arguments passed into the java code. -
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
5
PortaBase
A Portable Database
A personal database application for Maemo devices as well as PCs running Linux/UNIX, Mac OS X, and Windows. It can be used as a shopping list, password manager, media inventory, financial tracker, TODO list, address book, photo album, and more. -
6
JavaMutex
Provides 100% pure Java mutual exclusion.
Freely redistributable open source 100% pure Java for mutual exclusion. Read-write and read-only reentrant lock, condition variable, atomic wraps for Boolean, Integer, Long, and Reference. Cell pool with optional locking, object exchanger, Intersect. -
7
Colloquium QDA
A free and open source qualitative ethnographic interview coding tool.
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. -
8
CQU
Decision solver for Counting Quantifiers over Unary Predicates
---------------- cqusat 1.0 ---------------- cqusat is a conbstraint solver decides the satisfiability of a set of sentences containing Counting Quantifiers over Unary predicates. It also accepts Universally quantifies sentences over unary predicates, which are presented in the form of propositional clauses (classical Boolean logic clauses). This implementation employs minisat as the SAT solver. It also emplouys COIN-OR Clp linear programming solver, and inherit from it. Given a CQUSAT instance in normal form as input, the program returns a solution, if there is one. The implemented method employs dual Simplex Algorithm with Column Generation. ... -
9
tiny-json
JSON library for Delphi
This is a small and clean library for associative arrays with Boolean / Integer / Float / WideString values. Allows import (export) from (to) JSON text. Extensive error-checking. Uses FunHash (by Sokolov Yura), HatTrie (by Daniel C. Jones), FastInt64 and FastMove (by FastCode project). -
Veeam Data Platform v13.1 - Get Your Free TrialTry Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.
-
10
Interactive graphics software for Cellular Automata, Random Boolean Networks, and multi-value Discrete Dynamical Networks -- space-time patterns and basins of attraction -- to study emergence, complexity, neural and genetic networks. www.ddlab.org
-
11
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).
-
12
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.
-
13
MORO can conveniently analyze the relationship between network modularity and robustness. We employed an existing algorithm to analyze the modularity of directed graphs and a Boolean network model for robustness calculation. In particular, to ensure the robustness algorithm’s applicability to large-scale networks, we implemented it as a parallel algorithm by using the OpenCL library. A batch-mode simulation function was also developed to verify whether an observed relationship between modularity and robustness is conserved in a large set of randomly structured networks. ...
-
14
PyBoolNet is a Python package for the generation, modification and analysis of Boolean networks. Homepage has migrated to https://github.com/hklarner/PyBoolNet This page is only maintained to keep links alive.
-
15
jQuery Knob
Nice, downward compatible, touchable, jQuery dial
...It is downward compatible, and overloads an input element. Display mode "cursor", cursor size could be changed passing a numeric value to the option, default width is used when passing boolean value "true" | default=gauge. The scope of each hook function is the current Knob instance (refer to the demo code). -
16
Mock.js
A simulation data generator
...Without modifying the existing code, you can intercept Ajax requests and return simulated response data. An intuitive interface. Support the generation of random text, numbers, Boolean values, dates, emails, links, pictures, colors, etc. Support to expand more data types, support custom functions and regulars. -
17
optPBN
An optimization toolbox for probabilistic Boolean networks
...Thereby optPBN allows for the identification of Boolean functions in the model from a given set of candidate Boolean rules which can be applied for network inference study. In addition, it also permits the determination of selection probabilities of Boolean rules in PBNs which can be further used to determine the influence of parent nodes in biochemical interactions. -
18
Qt Micro Properties Editor
Minimalistic properties editor for Qt applications
A minimalistic properties editor for Qt applications based on QTreeWidget. -
19
Michel Max - Coalesce for .NET
Coalesce for .NET
Have you ever wonder “why doesn’t I have a Coalesce on .NET?”, well now you have, with this library you can use the Coalesce for Boolean “bool?”, “byte?”, “char?”, “DateTime?”, “decimal?”, “double?”, “short?”, “int?”, “long?”, “object”, “sbyte?”, “float?”, “string”, “ushort?”, “uint?” and “ulong?”. Note: Objects like a Custom Control need to have their own Equals implementation. Documentation in English and Brazilian Portuguese. -
20
Logic Calculator
A Calculator to perform logical operations
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... -
21
fuzzysearch
Tiny and blazing-fast fuzzy search in JavaScript
fuzzysearch is a tiny, blazing-fast fuzzy search library for JavaScript that checks whether a “needle” string can be found inside a “haystack” string in order, but not necessarily contiguously. It implements a simplified fuzzy searching algorithm that does not use Levenshtein distance; instead it returns a boolean indicating whether all characters of the needle appear in sequence within the haystack. This makes it ideal for filtering lists or autocomplete suggestions quickly based on incomplete user input. Because it operates with a very small algorithmic footprint, it is both lightweight in size and extremely fast in practice. The library exposes a single, minimal API (fuzzysearch(needle, haystack)), making it easy to drop into any project without configuration. ... -
22
JCLILIB
A Java 7 library for parsing command lines.
...Features include recognizing arguments either by key ("-h"), by key and value ("-f some_file" or "-f=some_file"), or by position (e.g., second argument not attached to a key). Keys may optionally be repeated with multiple arguments. Values may be specified as String, Boolean, Integer, Long or Double. Unused arguments are returned in an array of strings. A static method is provided to parse arguments with glob-style wildcards (such as "*.bak") and return all matching files. -
23
Math Processor
Math Processor is a general purpose programable math engine.
The design and code of Math Processor have been explained at: http://www.codeproject.com/Articles/500327/Building-a-General-Purpose-Interpreter-Math-Engine Math Processor solves problems relating to algebra, calculus, Boolean logic, statistics, number theory, geometry, trigonometry and other allied disciplines. It supports a simple interpreted language. It also has some plotting capabilities. You can use MP as a standalone calculating engine or you can use it as a C# .dll library in your own programs. The design of MP makes it very easy to embed it in any .Net project. -
24
Search-Spider
A controllable search engine written in Perl
...This code is best described as experimental (ver .00). It is also inefficient, clumsy, and slow. You will need at least a working knowledge of Perl, postgresql and sql, and of boolean algebra, just to get it to run in its present form, and it runs only on Linux. So why bother? Perhaps you want to find out how a search engine works; You may be curious and want to estimate the efficiency of your searches; Maybe you have a particular kind of research you want to complete; You might need a particular boolean query for an efficient search; You may want complete control of where your spider searches; You may want to avoid, as far as possible, searches routed through proprietary sites. ... -
25
Eye candy showing parallel Conway's Life games in the bit planes of the screen, using boolean BitBlt operations. (Independently rediscovered algorithm given already in Smalltalk-80 Blue Book, by the inventors of BitBlt.)
