Search Results for "gnu science" - Page 10
Sort By:
Showing 1070 open source projects for "gnu science"
View related business solutions-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
1
SHOP2 is a domain-independent automated-planning system based on ordered task decomposition, a type of Hierarchical Task Network (HTN) planning. Development is no longer done on sf; only file hosting now. WARNING: Java code here is not maintained....
-
2
Urban is a software capable of procedurally creating 3d urban environments. It's based on a multi-agent system where each agent is responsible for one type of urban object. This means the system is highly modular and can easily be extended.
-
3
ontocomp
OntoComP is a Protégé 4 plug-in for completing OWL ontologies
OntoComP is a Protégé 4 plug-in for completing OWL ontologies. It enables the user to check whether an OWL ontology contains "all relevant information" about the application domain, and extends the ontology appropriately if this is not the case. It achieves this by asking the user questions of the form "are instances of classes C1 and C2 also instances of class C3?". If the user confirms such a question, then a new axiom of the application domain that does not follow from the ontology has... -
4
bnns
Research tool for interactive training of artificial neural networks.
BNNS is a research tool for interactive training of artificial neural networks based on the Response Function Plots visualization method. It enables users to simulate, visualize and interact in the learning process of a Multi-Layer Perceptron on tasks which have a 2D character. Tasks like the famous two-spirals task or classification of satellite image data. -
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
5
A python module that provides algorithms for advanced search - basically all you need to build a search engine.
-
6
TuCSoN
TuCSoN tuple-based coordination middleware
TuCSoN (Tuple Centres Spread over the Network) is a tuple-based middleware for the coordination of distributed systems – including multi-agent systems, mobile agents and pervasive systems. -
7
StabLe
An algorithm for learning stable graphical models from data
Stable Graphical Model Learning (StabLe) is an algorithm for learning the structure and parameters of stable graphical (SG) models from data. Stable random variables are motivated by the central limit theorem for densities with (potentially) unbounded variance and can be thought of as natural generalizations of the Gaussian distribution to skewed and heavy-tailed phenomenon. SG models are multi-variate stable distributions that represent Bayesian networks whose edges encode linear... -
8
-
9
JinnIde is a plugin that allows using Jinni Prolog, now also hosted here on this site (with open source license!), within the confines of an IDE integrated in JEdit.
-
Train ML Models With SQL You Already KnowBuild and deploy ML models using familiar SQL. Automate data prep with built-in Gemini. Query 1 TB and store 10 GB free monthly.
-
10
ProximityForest
Efficient Approximate Nearest Neighbors for General Metric Spaces
A proximity forest is a data structure that allows for efficient computation of approximate nearest neighbors of arbitrary data elements in a metric space. See: O'Hara and Draper, "Are You Using the Right Approximate Nearest Neighbor Algorithm?", WACV 2013 (best student paper award). One application of a ProximityForest is given in the following CVPR publication: Stephen O'Hara and Bruce A. Draper, "Scalable Action Recognition with a Subspace Forest," IEEE Conference on Computer... -
11
The objective of this project is to make available an open-source version of our Multifactor Dimensionality Reduction (MDR) software. MDR is a nonparametric alternative to logistic regression for detecting and characterizing nonlinear interactions.
-
12
LPCforSOS is a machine learning framework with a special focus on structured output spaces and pairwise learning. It supports currently multiclass, ordinal, hierarchical, multi-label and label ranking classification settings.
-
13
JPIE is an implementation of an Open Source Java to Prolog/Prolog to Java interoperability mecanism based on the Java VM.
-
14
Weka4OC GUI for Overlapping clustering
Weka4OC: Weka for Overlapping Clustering is a GUI extending WEKA
This is a GUI application for learning non disjoint groups based on Weka machine learning framework. It offers a variety of learning methods, based on k-means, able to produce overlapping clusters. The application also contains an evaluation framework that calculates several external validation measures. The application offers a visualization tool to discover overlapping groups. -
15
Botnet Detectors Comparer
Compares botnet detection methods
Compares botnet detection methods by computing the error metrics by reading the labels on a NetFlow file. The original NetFlow should have a new column for the ground-truth label, and a new column with the prediction label for each botnet detection method. This program computes all the error metrics (TPR, TNR, FPR, FNR, Precision, Accuracy, ErrorRate, FMeasure1, FMeasure2, FMeasure0.5) and output the comparison results. It also ouputs a png plot. The program can compare in a... -
16
pedsim
A microscopic pedestrian crowd simulation system and library
PEDSIM is a microscopic pedestrian crowd simulation system. The PEDSIM library allows you to use pedestrian dynamics in your own software. Based on pure C++ without additional packages, it runs virtually on every operating system. The PEDSIM Demo Application gives you a quick overview of the capabilities, and is a starting point for your own experiments. PEDSIM is suitable for use in crowd simulations (e.g. indoor evacuation simulation, large scale outdoor simulations), where one is... -
17
ktree
clustering, machine learning, algorithms
This project has moved to github at http://lmwtree.devries.ninja. -
18
Highly modularized Reinforcement Learning library for real/simulation robots to learn behaviors. Our ultimate goal is to develop an artificial intelligence (AI) program with which the robots can learn to behave as their users wish.
-
19
HAWK - PDF Text Search Java Project
No more support for this project - TAKE A LOOK AT FALCONSEARCH
No more support for this project - TAKE A LOOK AT FALCONSEARCH "https://sourceforge.net/projects/falcontextsearch/" -
20
ViNet
fast intelligent neuronet and tools
The challenge to build near-biological, weakly layered neuron network with all time learning/growing abilities. -
21
Perico is a dialogue management library. It allows you to specify a dialogue agent: a computer program that can interact with a user (or other agents) using (natural language) messages.
-
22
The IJBlob library indentifying connected components in binary images. The algorithm used for connected component labeling is: Chang, F. (2004). A linear-time component-labeling algorithm using contour tracing technique. Computer Vision and Image Understanding, 93(2), 206–220. doi:10.1016/j.cviu.2003.09.002 The ImageJ *Shape Filter Plugin* (see downloads) uses this library for flitering the blobs by its shape. If you are using IJBlob in a scientific publication, please...
-
23
Service oriented framework for Evolutionary Algorithms and other meta-heuristics using OSGi.
-
24
TF-IDF.jar is a Java Archive file to measure TF-IDF of each document in a document collection (corpus). The jar can be used to (a) get all the terms in the corpus (b) get the document frequency (DF) and inverse document frequency (IDF) of all the terms in the corpus (c) get the TF-IDF of each document in the corpus (d) get each term with their frequency (no. of presence), term frequency (TF) and TF-IDF in every document
-
25
Featurama is a library that implements various sequence-labeling algorithms. Currently Michael Collins' averaged perceptron algorithm is fully implemented.
