Projects tagged ‘ai’

a high-performance, free Common Lisp implementation which runs on most major Unix platforms. It mainly conforms to the ANSI Common Lisp standard.

The idea of the MoPa framework is to provide a suitable C++ scenario and bindings for motion and path planning algorithms over static and dynamic environments. In simpler words, the MoPa framework is ... [More] a 2D world with several objects that moves. Then, an intelligent agent can be added towards finding a way to move from an initial point to a predefined goal, trying not to cruash, touch or being hit by an object. The framework also tries to define all the architectural interfaces to be able to interchange any module (for instance the graphic engine, or the world's physics) for new implementations. [Less]

Project OverviewThe S-Space Package is a collection of algorithms for building Semantic Spaces. These algorithms process text corpora and map semantic representations for words onto high dimensional ... [More] vectors. These approaches are known by many names, such as word spaces, semantic spaces, or distributed semantics. The research and development is being done by the Natural Language Processing group at UCLA led by David Jurgens and Keith Stevens, under the advisory of Dr. Michael Dyer. See the Getting Started page for a quick introduction on how to use the S-Space package, or see the Package Overview for information on the code and available features. GoalOur initial goal is to provide a uniform implementation for many common semantic space algorithms in order to facilitate research in semantic spaces and provide an accurate, reproducible way to compare different algorithms. Second, we aim to provide a comprehensive framework for researchers to easily develop new algorithms without having to replicate much of the shared software. For those looking to implement their own Semantic Space algorithm within the S-Space package, we recommend looking at the Introduction page. ContactQuestions and Comments can be sent to s-space-research-dev@googlegroups.com AlgorithmsWe are actively working on supporting the following algorithms. As additional time and resources allow, we will add further algorithms. See the downloads page for the current list of algorithms available in command-line executable form. Latent Semantic Analysis (LSA)T. K. Landauer and S. T. Dumais, "A solution to Plato’s problem: The Latent Semantic Analysis theory of the acquisition, induction, and representation of knowledge," Psychological Review, vol. 104, pp. 211–240, 1997. T. K. Landauer, P. W. Foltz, and D. Laham, "Introduction to Latent Semantic Analysis," Discourse Processes, no. 25, pp. 259–284, 1998. Random Indexing (also, with permutations)P. Kanerva, J. Kristoferson, and A. Holst, “Random indexing of text samples for latent semantic analysis,” in Proceedings of the 22nd Annual Conference of the Cognitive Science Society, L. R. Gleitman and A. K. Josh, Eds., 2000, p. 1036. M. Sahlgren, “Vector-based semantic analysis: Representing word meanings based on random labels,” in Proceedings of the ESSLLI 2001 Workshop on Semantic Knowledge Acquisition and Categorisation, Helsinki, Finland, 2001. M. Sahlgren, A. Holst, and P. Kanerva, “Permutations as a means to encode order in word space,” in Proceedings of the 30th Annual Meeting of the Cognitive Science Society (CogSci’08), 2008. Correlated Occurrence Analogue to Lexical Semantic (COALS)D. L. T. Rohde, L. M. Gonnerman, and D. C. Plaut, “An improved model of semantic similarity based on lexical co-occurrence,” Cognitive Science, 2009, submitted. Online. Available: http://www.cnbc.cmu.edu/plaut/papers/abstracts/RohdeGonnermanPlautSUB-CogSci.COALS.html Hyperspace Analogue to Language (HAL)C. Burgess and P. Conley, “Developing semantic representations for proper names,” in Cognitive Science Proceedings, LEA, 1998, pp. 185–190. C. Burgess and K. Lund, “Modelling parsing constraints with high- dimensional context space,” Language and Cognitive Processes, vol. 12, pp. 177–210, 1997. Latent Relational Analysis (LRA)P. D. Turney, “Similarity of semantic relations,” Computational Linguistics, vol. 32, no. 3, pp. 379–416, 2006. Bound Encoding of the Aggregate Language Environment (BEAGLE)M. N. Jones, W. Kintsch, and D. J. K. Mewhort, “High-dimensional semantic space accounts of priming,” Journal of Memory and Language, vol. 55, pp. 534–552, 2006. M. N. Jones and D. J. K. Mewhort, “Representing word meaning and order information in a composite holographic lexicon,” Psychology Review, vol. 114, pp. 1–37, 2007. Syntactic Co-occurrence (by Greffenstette)G. Grefenstette, Explorations in Automatic Thesaurus Discovery. Indiana University Press, 1994. License and RestrictionsThe S-Space software package is free software released under the GPL v. 2 license. See our license and restrictions page for full details. [Less]

Encog is an advanced neural network and bot programming library. Encog can be used independently either to create neural networks or HTTP bot programs. Encog also includes classes that combine these ... [More] two advanced features. Encog contains classes for Feedforward Neural Networks, Hopfield Neural Networks, and self organizing maps. Training can be accomplished using backpropagation, simulated annealing, and genetic optimization. Additional classes are provided for pruning neural networks. Encog also includes advanced HTTP bot programming features. A multithreaded spider that can store its workload either in memory on a database is provided. HTML parsing is provided, as well as advanced form and cookie handling. [Less]

Player provides a language-independent networked interface to robots and their sensors. Supported devices include Pioneer 2DX robots with sonar, odometry & compass, SICK laser rangefinder, ACTS color ... [More] vision system, GPS, gripper and wireless communications. Stage provides a population of simulated Player devices. Controllers designed using Stage have been shown to work unchanged on real robots and vice versa. Stage aims for low-fidelity simulation of many devices, rather than perfect models. [Less]

MARF is an open-source research platform and a collection of voice/sound/speech/text and natural language processing (NLP) algorithms written in Java and arranged into a modular and extensible ... [More] framework facilitating addition of new algorithms. MARF can run distributedly over the network and may act as a library in applications or be used as a source for learning and extension. [Less]

This is a program for playing the game of go. No go program to date has achieved a level of mastery comparable to chess programs. The design goal is to develop as strong of an AI as possible using D ... [More] , agile development, an object oriented design, and generic programming. [Less]

Encog is an advanced neural network and bot programming library. Encog can be used independently either to create neural networks or HTTP bot programs. Encog also includes classes that combine these ... [More] two advanced features. Encog contains classes for Feedforward Neural Networks, Hopfield Neural Networks, and self organizing maps. Training can be accomplished using backpropagation, simulated annealing, and genetic optimization. Additional classes are provided for pruning neural networks. Encog also includes advanced HTTP bot programming features. A multithreaded spider that can store its workload either in memory on a database is provided. HTML parsing is provided, as well as advanced form and cookie handling. [Less]

UniConvertor is an universal vector graphics translator. The project uses sK1 engine to convert one format to another. Project has following import filters: CDR, CMX, CDT, CCX, CDRX, AI, CGM, WMF ... [More] , XFIG, SVG, SK, SK1, AFF and export filters: AI, SVG, SK, SK1, CGM, WMF. [Less]

C++ Kohonen Neural Network Library (Self-Organizing Map) Kohonen neural network library is a set of classes and functions for design, train and use Kohonen network (self organizing map) which is ... [More] one of AI algorithms and useful tool for data mining and discovery knowledge in data (http://knnl.sf.net). [Less]