Search Results for "which" - Page 2
Sort By:
Showing 146 open source projects for "which"
View related business solutions-
$300 in Free Credit Across 150+ Cloud ServicesStart your project in minutes. After credits run out, 20+ products include free monthly usage. Only pay when you're ready to scale with Google Cloud.
-
Catch Bugs Before Your Customers DoMove from alert to fix before users notice. AppSignal monitors errors, performance bottlenecks, host health, and uptime—all from one dashboard. Instant notifications on deployments, anomaly triggers for memory spikes or error surges, and seamless log management. Works out of the box with Rails, Django, Express, Phoenix, Next.js, and dozens more. Starts at $23/month with no hidden fees.
-
1
JCLAL
A Java Class Library for Active Learning
...JCLAL framework is open source software and it is distributed under the GNU general public license. It is constructed with a high-level software environment, with a strong object oriented design and use of design patterns, which allow to the developers reuse, modify and extend the framework. If you want to refer to JCLAL in a publication, please cite the following JMLR paper. The full citation is: Oscar Reyes, Eduardo Pérez, María del Carmen Rodríguez-Hernández, Habib M. Fardoun, Sebastián Ventura. JCLAL: A Java Framework for Active Learning. Journal of Machine Learning Research, 17(95):1-5, 2016. -
2
Belief Reviser
Belief Revision via PS-Merge under constraints belief merging operator
...It consists in incorporating a new belief, changing as few as possible of the original beliefs while preserving consistency. Revision always considers new evidence as a better belief. Such new evidence is usually represented in the form of a propositional formula which must be preserved after the revision. Here, the Δps (PS-Merge) belief merging operator is extended in order to consider constraints, and this extension is used as a strategy for belief revision. The new evidence is treated as a constraint so the extended merging operator can obtain the revised belief base. -
3
VnDP
A Vietnamese dependency parsing toolkit
VnDP is a Vietnamese dependency parsing toolkit which integrates a pre-trained parsing model and a pre-trained POS tagging model. The parsing model was trained on our VnDT Vietnamese dependency Treebank which was automatically converted from the Vietnamese constituent Treebank. See more details in VnDP's website at http://vndp.sourceforge.net/ -
4
physicsmata
API for all possible cellular automata that work same at all angles
...Its parameters are sums of screen brightness (n color dimensions are optional) at concentric circles around each point, efficiently costing only the perimeter of those circles (instead of the area) because of the tree of squares. You can create any function, or to get started try the visual function editor where each click changes if a column is sine/sigmoid/half/double/exp/etc or which of the 0, 1, or 2 columns to the left are its params. Every click changes the patterns of waves seen on the left, which run that function you visually built at each point. -
Go From Idea to Deployed AI App FastAccess Gemini 3 and 200+ models. Build chatbots, agents, or custom models with built-in monitoring and scaling.
-
5
Human AI Net
a Human and Artificial Intelligence Network
...Version 0.8.0 has some advanced components that will be working soon. The plan is a massively multiplayer space where we design, evolve, and play with game objects and do AI research together which controls those game objects along with directly playing the games. The main data format is, from xorlisp which is also in progress, immutable binary forest nodes, so if millions of people build that together nobody can damage or change anyone else's data since its all constant. You dont change variables. You create new data that points at existing constant data, as deep as you need it. ... -
6
Cpt Kirk
Obtain why and why-not justifications for answer set programs.
Since the method proposed in https://www.researchgate.net/publication/262599199_Unifying_Provenance_and_Debugging_for_Answer-Set_Programs?ev=prf_pub is based on meta-programming, it is possible to use existing state-of-the-art software systems that support well-founded and answer-set semantics, which allowed us to start developing this new tool by extending the one that exists related to a debugging approach: Spock, hence the name Cpt. Kirk. Furthermore and more importantly, one direction to explore is to use the technique of reification as described in "metaASP" to obtain the implicants via a saturation technique, and obtaining the prime implicants of provenance formulae by optimization and thus proper minimal justifications. -
7
SuRankCo
Supervised Ranking of Contigs in de novo Assemblies
SuRankCo is a machine learning based software to score and rank contigs from de novo assemblies of next generation sequencing data. It trains with alignments of contigs with known reference genomes and predicts scores and ranking for contigs which have no related reference genome yet. For more details about SuRankCo and its functioning, please see "SuRankCo: Supervised Ranking of Contigs in de novo Assemblies" Mathias Kuhring, Piotr Wojtek Dabrowski, Andreas Nitsche and Bernhard Y. Renard (http://www.biomedcentral.com/1471-2105/16/240/abstract) PLEASE NOTE, it is recommended to read the paper and the readme.txt file before using SuRankCo. ... -
8
Immutable Sparse Wave Trees (WaveTree)
Realtime bigdata tool for bit strings up to 2^63 based on AVL forest
Realtime bigdata tool at the bit level based on immutable AVL forest which can be run in memory or, in future versions, as a merkle forest like a blockchain. Main object is a sparse bit string (Bits) that efficiently scales up to 2^63 bits normally compressed as forest has duplicated substrings. Bits objects support reading bit, byte, short, int, or long (Java primitives) at any bit index in 64 bit range. -
9
MODLEM
rule-based, WEKA compatible, Machine Learning algorithm
This project is a WEKA (Waikato Environment for Knowledge Analysis) compatible implementation of MODLEM - a Machine Learning algorithm which induces minimum set of rules. These rules can be adopted as a classifier (in terms of ML). It is a sequential covering algorithm, which was invented to cope with numeric data without discretization. Actually the nominal and numeric attributes are treated in the same way: attribute's space is being searched to find the best rule condition during rule induction. ... -
Cut Cloud Costs with Google Compute EngineSave on compute costs with Compute Engine. Reduce your batch jobs and workload bill 60-91% with Spot VMs. Compute Engine's committed use offers customers up to 70% savings through sustained use discounts. Plus, you get one free e2-micro VM monthly and $300 credit to start.
-
10
S-Match
S-Match is a semantic matching framework.
...S-Match takes any two tree like structures (such as database schemas, classifications, lightweight ontologies) and returns a set of correspondences between those tree nodes which semantically correspond to one another. S-Match contains implementations of the semantic matching, minimal semantic matching and structure preserving semantic matching algorithms. S-Match applies as a solution in many fields, including: information integration, ontology evolution and alignment, peer-to-peer information sharing, digital libraries integration, web service composition, agent communication, and query answering on the web. ... -
11
RuleRule
A puzzle game of rules acting upon rules. Create the desired pattern.
RuleRule is a game which might be of interest to students and researchers of AI, machine learning and related areas. In this game, rules act and modify other rules (including themselves). The goal is to reach a desired condition (e.g. a checkerboard of red and yellow). Versions For a first test of the game mechanics in your browser, download the Javascript version, coded by Jan-Hendrik Vienup (December 2014, GPL) tested with Firefox, MSIE, Chrome, and Safari : RuleRule3.zip First created with NeXT Interface Builder and Objective-C files (1995, Mach OS): rulerule.gz (Creative Commons Attribution License). ... -
12
libVMR
VMR - machine learning library
libVMR is a class library written in Java which implements code generator for group method of data handling - GMDH. The library is intended for users, with machine learning skills. libVMR provides an effective framework for the research and development of data mining and predictive analytics. libVMR is based on the most popular neural network model with a higher generalization ability from kernel tricks - vector machine by Reshetov (VMR). -
13
OpenNLP provides the organizational structure for coordinating several different projects which approach some aspect of Natural Language Processing. OpenNLP also defines a set of Java interfaces and implements some basic infrastructure for NLP compon
-
14
LillyTab
Another free OWL/DL Reasoner
LillyTab is a modular description logic consistency checker (reasoner) with support for a subset of OWL/DL. -
15
Agent.GUI
The Project moved to github https://github.com/EnFlexIT/AgentWorkbench
The project has moved to github https://github.com/EnFlexIT/AgentWorkbench Agent.GUI is a simulation framework and toolkit based on the JADE framework. It provides functionalities for time aspects, agent-environment interaction, visualization and load balancing, Furthermore, the included application focuses the usability for end users. -
16
DeCoAgent Library
Deliberative Coherence Driven Agent
This project is an extension to Jadex Framework and aims to develop an autonomous agent which is using adaptive decision making architecture based on Thagard’s deliberative coherence. -
17
Graphical Grammar Studio
An user friendly grammar tool for natural language processing tasks
Full documentation with tutorials is included in the download package. Graphical Grammar Studio is a tool for applying grammars which behave as words acceptors/consumers and annotators. GGS grammars can be used to find and annotate sequences of words which respect certain conditions, in a given input. Its purpose is for creating NLP tools like phrase chunkers, named entity finders, pronoun co-reference solvers etc. A grammar is represented by a state machine which can be visualized, edited and applied. ... -
18
Bermuda Text-to-Speech
This project includes basic NLP and DSP techniques for Text-to-Speech
See TTS demo at: http://rslp.racai.ro/index.php?page=tts This is an entirely written in JAVA project which includes a set of tools and methods designed to enable Multilingual Text-to-Speech (TTS) synthesis. We currently support English and Romanian but we will soon train more models and make them available for download. If you want to read more about our other NLP and TTS tools check out http://nlptools.racai.ro. -
19
IWOR is a programming game which simulates a world in which robots controlled by programs can live, work, defend their tribe, and even produce clones of themselves!
-
20
Consilium Sentence Suggestions Tools
Consilium – User Defined sentence Suggestion Tool.
There are many tools available in market which will provide spell correction or grammer correction while making documents, but very few tools are available which are providing sentence completion according to previously entered text. But this all are providing sentence complition suggestion for sentences which are oftenly or regularly used by all people in same manner. But in reality style of writing changes person to person. -
21
EBEs+jMetal
Software tool for designing spatial bar structures
EBEs+jMetal is a software tool that allows to design bar structures which can further be optimized with multi-objective metaheuristics according to different goals, such as minimizing the structure weight and minimizing the deformation. -
22
Unsupervised TXT classifier
Classify any two TXT documents, no training required - JAVA
...Then, the summarizer gets trained with A to summarize a document B, and vice versa. This extracts a relevant structure for both documents (and thus avoids the over-training) which are then compared using the Vector-Space analysis to give a range of belonging of one document to another (and thus avoids the shortage of information). This method can be used to create the user-defined classes by merging texts of certain categories and then to calculate the relevant distances between the documents, but this is not necessary. -
23
A Data Generator
A tool to generate synthetic test data useful to Record matchers
With growing amount of information from multiple sources it has become very hard to relate information to the correct real life entities. Record matching software try to solve this by machine learning techniques. To do this effectively, its necessary to train the record matcher with proper test data which is identical to real life data. Hence, there is a need for a data generator to create the synthetic data to be used for evaluating the quality and capability of record matching software. A data generator creates qualitative test data considering various the real life data glitches entered through various means like human data entry, voice dictation and data scanning. ... -
24
INGENIAS Development Kit (IDK) is a framework for analysis, design and implementation of multi-agent systems (MAS). It is based on the specification of MAS meta-models, from which tools such as the model editor and code generation are generated.
-
25
TextProcessor
A Java package to preprocess text datasets for posterior text analysis
The TextProcessor Java package is a text processing toolkit, which provides some frequently used text processing functions such as stemming, removing stop-words, generating a term vocabulary, and calculating the term-doc frequency matrix. Basic topic mining models such as LDA and sparse NMF are also supported. The package can also generate feature files from a given text dataset with LDA and LIBSVM format for posterior procedures such as classification or clustering.
