Automated Ethanol Reflux Distillation Project - University of Cincinnati Senior Project, 2009
AERST is a C++ tool to simulate AER (Address-Event-Representation)-based systems
A simulation framework for production process modeling in Python
ACP is a simulation framework aimed to production processes modeling. Compared to its ancestor - jES - it is lightweight, more general and written in Python. The basic goal of the simulator is to find bottlenecks in production process which could be hard to detect with traditional approaches (e.g., top-down). In addition, it can be used to speculate about “what-if” scenarios in order to suggest solution strategies.
AFAR (AgentFactory Augmented Reality) is a NetBeans module for developing intentional agent based Augmented Reality (AR) applications. AFAR deploys AgentFactory agents.
An R package to normalise, classify and analyses raw AFLP data.
AFNER is a C++ named entity recognition system that uses machine learning techniques. It is customisable to various domains. It also allows for multiple and overlapping named entity labels.
AGAI is a Skirmish AI for the spring game engine http://springrts.com/.
AGBStarViewer is a best fit and plotting SW for AGB-star spectra.
AGBStarViewer is an astronomical SW which was developed as a part of my Master Thesis at the University of Vienna. It is designed to compare star spectra and obtain best fits of many hundreds spectra. Licence: GPLv2
Read EDF File / view mapping
The proper way to quote AGLAEMap is: Programs for visualization, handling and quantification of PIXE maps at the AGLAE facility L. Pichon, T. Calligaro, Q. Lemasson, B. Moignard, C. Pacheco Nuclear Instruments and Methods in Physics Research Section B, Volume 363, 15 November 2015, Pages 48-54 doi:10.1016/j.nimb.2015.08.086 Due to the copyright transfer to the publisher, the online availability of the article will depend on your subscription to ScienceDirect. The abstract should be available in any case. This software read Esrf Data Format (EDF) files It has been developed to handle on a large number of detectors and series of maps. Its interface allows to easily pass from a detector to another and from an analysis to another. Elemental mapping is achieved by selecting a region of interest in the spectra and the corresponding picture can be saved.
R script to run several clustering algorithms using morphometric data
The R script was written to perform and compare several versions of cluster algorithms as described in: Seifert, Ritz & Csősz (2013) published in Myrmecological News. The aim is to identify (cryptic) taxa based on numeric data on morphology. The first step is a Linear Discriminant Analysis (LDA) based on subunits (ant nests) independent of any taxon information. Following analysis are Non-Metric Multidimensional Scaling (NMDS) and k-Means clustering. The NMDS scores are also summarized using K-Means. For comparison, k-Means is also run on the nest means (without preceeding LDA). Cluster assignment is summarized in an output file for all three methods.
This project about providing run-time support for developing Decentralized Autonomic Computing systems (Eclipse Innovation Grand). Currently the project contains a automatic guided vehicle (AGV) simulator and an editor and visualisation as eclipse plugin
AHANNS - Amateur Homemade Artificial Neural Network Simulator
AHANNS enables the user to create and train artificial neural networks. Training is carried out by an implementation of back propagation learning algorithm. See the documentation for details. This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
AHITK deigns to be a toolkit for building human-computer interfaces for use by blind and sighted users, alike.
AI Bots is a programmer's game in which players write programs to control virtual bots which fight each other in an arena. This involves going after various objects in the arena as well as shooting down other bots.
Ai ant sim is a simulator of ants and colonies interacting.
An ai DJ will create your favorite music playlists, containing the music you like. Store information concerning any mp3 file in a Database in XML. Automatically copy mp3 on playlist onto harddisk. Now you can enjoy your full mp3 collection.
This project's goal is to "package" AI features altogether. These features can embrace pathfinding, behaviour, fuzzy logic, state machines, and the like.
A programming game in Beta. Binaries are available for Windows. Versions for POSIX/C++ compatible platforms are planned.
Distributed AI game server. This software let the user run a server that monitor and control games between AI. The AI and referee can be run by clients on other computers. A web interface will be included for game monitoring.
The goal of the AI Interface Standards Committee is to develop interface standards for game AI techniques and to promote their implementation.
This project focuses on experiments of AI using JAVA, but with just that bit of extra effort that might make those experiments become of use for others as well.
Do you want a neural network OO class? With documentation? Do not go further... You found it! you have here a complete library of different neural network in an OO encapsulation. Starting from adaline, back propagation, Kohonen
AI Now is an open source endeavour to create a general purpose Artificial Intelligence. The plan is to implement a modular architecture to incorporate AI theories as they are developed. This will provide a growing platform to test new AI theories.
AI Pathfinding Presentation
Presentation of pathfinding algorithms Howto: 1. Create Map (manual or use Map -> Rapid Deployment) 2. Select start point 3. Select end point 4. Choose alg 5. Click Path -> Find