Sophie

Sophie

distrib > Mandriva > 2010.1 > x86_64 > by-pkgid > 965e33040dd61030a94f0eb89877aee8 > files > 160

howto-html-en-20080722-2mdv2010.1.noarch.rpm

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
<HTML>
<HEAD>
 <META NAME="GENERATOR" CONTENT="LinuxDoc-Tools 0.9.21">
 <TITLE>GNU/Linux AI &amp; Alife HOWTO: Missing &amp; Dead</TITLE>
 <LINK HREF="AI-Alife-HOWTO-7.html" REL=previous>
 <LINK HREF="AI-Alife-HOWTO.html#toc8" REL=contents>
</HEAD>
<BODY>
Next
<A HREF="AI-Alife-HOWTO-7.html">Previous</A>
<A HREF="AI-Alife-HOWTO.html#toc8">Contents</A>
<HR>
<H2><A NAME="Missing &amp; Dead"></A> <A NAME="s8">8.</A> <A HREF="AI-Alife-HOWTO.html#toc8">Missing &amp; Dead</A>    </H2>


<P>This is my area for old or bad entries. The MIA section is for entires for
which I no longer have a valid home page. If you have any information
regarding where I can find these now please let me know. The Dead section
is for projects that seem dead. Moving them here allows me to keep my 
the main sections clean while allowing for interested parties to 
correct me in which case I can just move it back.</P>

<H2><A NAME="ss8.1">8.1</A> <A HREF="AI-Alife-HOWTO.html#toc8.1">MIA - Projects missing linkage.</A>
    </H2>

<P>
<DL>
<P>
<A NAME="CASE"></A> </P>
<DT><B>CASE</B><DD><P>
<UL>
<LI>Web site: 
<A HREF="http://www.iu.hio.no/~cell/">www.iu.hio.no/~cell/</A></LI>
<LI>FTP site: 
<A HREF="ftp://ftp.iu.hio.no/pub/">ftp.iu.hio.no/pub/</A></LI>
</UL>
</P>
<P>CASE (Cellular Automaton Simulation Environment) is a C++
toolkit for visualizing discrete models in two dimensions:
so-called cellular automata. The aim of this project is to
create an integrated framework for creating generalized cellular
automata using the best, standardized technology of the day.</P>

<P>
<A NAME="CLIG"></A> </P>
<DT><B>CLIG</B><DD><P>
<UL>
<LI>Web site: 
<A HREF="http://www.ags.uni-sb.de/~konrad/clig.html">www.ags.uni-sb.de/~konrad/clig.html</A></LI>
</UL>
</P>
<P>CLIG is an interactive, extendible grapher for visualizing linguistic
data structures like trees, feature structures, Discourse
Representation Structures (DRS), logical formulas etc. All of these can
be freely mixed and embedded into each other. The grapher has been
designed both to be stand-alone and to be used as an add-on for
linguistic applications which display their output in a graphical
manner.</P>

<P>
<A NAME="Corewar VM"></A> </P>
<DT><B>Corewar VM</B><DD><P>
<UL>
<LI>Web site: 
<A HREF="http://www.jedi.claranet.fr/">www.jedi.claranet.fr/</A></LI>
</UL>
</P>
<P>This is a virtual machine written in Java (so it is a virtual machine
for another virtual machine !) for a Corewar game.</P>

<P>
<A NAME="DAI"></A> </P>
<DT><B>DAI</B><DD><P>
<UL>
<LI>Web site: 
<A HREF="http://starship.python.net/crew/gandalf/DNET/AI/">starship.python.net/crew/gandalf/DNET/AI/</A></LI>
</UL>
</P>
<P>A library for the Python programming language that provides an
object oriented interface to the CLIPS expert system tool. It 
includes an interface to COOL (CLIPS Object Oriented Language)
that allows:
<UL>
<LI>Investigate COOL classes</LI>
<LI>Create and manipulate with COOL instances</LI>
<LI>Manipulate with COOL message-handler's</LI>
<LI>Manipulate with Modules</LI>
</UL>
</P>

<P>
<A NAME="Dunce"></A> </P>
<DT><B>Dunce</B><DD><P>
<UL>
<LI>Web site: 
<A HREF="http://www.boswa.com/boswabits/">www.boswa.com/boswabits/</A> </LI>
</UL>
</P>
<P>Dunce is a simple chatterbot (conversational AI) and a language for
programming such chatterbots. It uses a basic regex pattern matching
and a semi-neural rule/response firing mechanism (with excitement/decay
cycles).</P>
<P>Dunce is listed about halfway down the page.</P>

<P>
<A NAME="EcoSim"></A> </P>
<DT><B>EcoSim</B><DD><P>
<UL>
<LI>Web site: 
<A HREF="http://www.offis.de/projekte/projekt.php?id=140">www.offis.de/projekte/projekt.php?id=140</A></LI>
</UL>
</P>
<P>NOTE: the above web site has info on EcoSim but no code to download. </P>

<P>In EcoSim an ecosystem is described by all static and dynamic
properties of the individuals involved in the system as well as time
varying properties of the environment. Individuals change their state
over time or due to internal and external events. The environment is
also defined via dynamic objects which can change. Supports on the fly
analysis and animation of generated data. It is a C++ class library
designed to support individual-oriented modelling and simulation
of ecological systems.</P>

<P>
<A NAME="Evo"></A> </P>
<DT><B>Evo</B><DD><P>
<UL>
<LI>Web site: 
<A HREF="http://omicrongroup.org/evo/">omicrongroup.org/evo/</A></LI>
</UL>
</P>
<P>Evo is a software development framework that allows developers to build
complex alife simulations. Using Evo, researchers can easily build
systems of independent agents interacting with one another and with
their environment. Evo implements biological operators such as genetic
recombination and mutation to evolve the behavior of agents so that
they are more adapted to their environment.</P>

<P>
<A NAME="IDEAL"></A> </P>
<DT><B>IDEAL</B><DD><P>
<UL>
<LI>Web site: 
<A HREF="http://yoda.cis.temple.edu:8080/ideal/">yoda.cis.temple.edu:8080/ideal/</A></LI>
</UL>
</P>
<P>IDEAL is a test bed for work in influence diagrams and
Bayesian networks. It contains various inference algorithms
for belief networks and evaluation algorithms for influence
diagrams. It contains facilities for creating and editing
influence diagrams and belief networks.</P>
<P>IDEAL is written in pure Common Lisp and so it will run in
Common Lisp on any platform. The emphasis in writing IDEAL has
been on code clarity and providing high level programming
abstractions. It thus is very suitable for experimental
implementations which need or extend belief network
technology.</P>
<P>At the highest level, IDEAL can be used as a subroutine
library which provides belief network inference and influence
diagram evaluation as a package. The code is documented in a
detailed manual and so it is also possible to work at a lower
level on extensions of belief network methods.</P>
<P>IDEAL comes with an optional graphic interface written in
CLIM. If your Common Lisp also has CLIM, you can run the
graphic interface.</P>

<P>
<A NAME="Illuminator"></A> </P>
<DT><B>Illuminator</B><DD><P>
<UL>
<LI>Web site: 
<A HREF="http://documents.cfar.umd.edu/resources/source/illuminator.html">documents.cfar.umd.edu/resources/source/illuminator.html</A></LI>
</UL>
</P>
<P>Illuminator is a toolset for developing OCR and Image
Understanding applications.  Illuminator has two major parts: a
library for representing, storing and retrieving OCR
information, heretofore called dafslib, and an X-Windows "DAFS"
file viewer, called illum. Illuminator and DAFS lib were
designed to supplant existing OCR formats and become a standard
in the industry. They particularly are extensible to handle more
than just English.</P>
<P>The features of this release: 
<UL>
<LI>5 magnification levels for images</LI>
<LI>flagged characters and words</LI>
<LI>unicode support -- American, British, French, German, 
Greek, Italian, MICR, Norwegian, Russian, Spanish, Swedish, 
keyboards </LI>
<LI>reads DAFS, TIFF's, PDA's (image only)</LI>
<LI>save to DAFS, ASCII/UTF or Unicode</LI>
<LI>Entity Viewer - shows properties, character choices, 
bounding boxes image fragment for a selected entity, change 
type, change content, hierarchy mode</LI>
</UL>
</P>

<P>
<A NAME="PAI"></A> </P>
<DT><B>PAI</B><DD><P>
<UL>
<LI>Web site: 
<A HREF="http://utenti.quipo.it/claudioscordino/pai.html">utenti.quipo.it/claudioscordino/pai.html</A></LI>
</UL>
</P>
<P>AI (Programmable Artificial Intelligence) is a program capable of
having a conversation in its mother tongue, English. Written in 
C++.</P>

<P>
<A NAME="Python ANN"></A> </P>
<DT><B>Simple Neural Net (in Python)</B><DD><P>
<UL>
<LI>Web site: 
<A HREF="http://www.amk.ca/python/unmaintained/">http://www.amk.ca/python/unmaintained/</A></LI>
</UL>
</P>
<P>Simple neural network code, which implements a class for 3-level
networks (input, hidden, and output layers). The only learning
rule implemented is simple backpropagation. No documentation (or
even comments) at all, because this is simply code that I use to
experiment with. Includes modules containing sample datasets
from Carl G. Looney's NN book. Requires the Numeric
extensions. </P>

<P>
<A NAME="QUANT1"></A> </P>
<DT><B>QUANT1</B><DD><P>
<UL>
<LI>Web site: 
<A HREF="http://linux.irk.ru/projects/QUANT/">linux.irk.ru/projects/QUANT/</A></LI>
</UL>
</P>
<P>This project seems to have gone proprietary. The only trace I can find
via google is at 
<A HREF="http://www.zurich.co.uk/strategicrisk/softwaresupport/Quant1.htm">http://www.zurich.co.uk/strategicrisk/softwaresupport/Quant1.htm</A>.</P>
<P>QUANT/1 stands for type QUANTifier. It aims to be an alternative to
Prolog-like (Resulutional-like) systems. Main features include a lack
of necessity for eliminating Quantifiers, scolemisation, ease of
comprehension, large scale formulae operation, acceptance of nonHorn
formulaes, and Iterative deeping. The actual library implemented in
this project is called ATPPCF (Automatic Theorem Prover in calculus of
Positively Constructed Formulae).</P>
<P>ATPPCF will be a library (inference engine) and an extension of the
Predicate Calculus Language as a new logical language. The library will
be incorporable in another software such as TCL, Python, Perl. The
engine's primary inference method will be the "search of inference in
language of Positively Constructed Formulas (PCFs)" (a subset of
Predicate Calculus well translated in both directions). The language
will be used as scripting language to the engine. But there will be
possibility to replace it with extensions languages of main software.</P>

<P>
<A NAME="SCNN"></A> </P>
<DT><B>SCNN</B><DD><P>
<UL>
<LI>Web site: 
<A HREF="http://www.uni-frankfurt.de/fb13/iap/e_ag_rt/SCNN/">www.uni-frankfurt.de/fb13/iap/e_ag_rt/SCNN/</A></LI>
</UL>
</P>
<P>SCNN is an universal simulating system for Cellular Neural
Networks (CNN).  CNN are analog processing neural networks
with regular and local interconnections, governed by a set of
nonlinear ordinary differential equations. Due to their local
connectivity, CNN are realized as VLSI chips, which operates
at very high speed.</P>

<P>
<A NAME="SPI"></A> </P>
<DT><B>Symbolic Probabilistic Inference (SPI)</B><DD><P>
<UL>
<LI>FTP site: 
<A HREF="ftp://ftp.engr.orst.edu/pub/dambrosi/spi/">ftp.engr.orst.edu/pub/dambrosi/spi/</A></LI>
<LI>Paper (ijar-94.ps): 
<A HREF="ftp://ftp.engr.orst.edu/pub/dambrosi/">ftp.engr.orst.edu/pub/dambrosi/</A></LI>
</UL>
</P>

<P>Contains Common Lisp function libraries to implement SPI type baysean 
nets. Documentation is very limited.
Features: 
<UL>
<LI>Probabilities, Local Expression Language Utilities, Explanation, 
Dynamic Models, and a TCL/TK based GUI.</LI>
</UL>
</P>

<P>
<A NAME="Sugal"></A> </P>
<DT><B>Sugal</B><DD><P>
<UL>
<LI>Web site: 
<A HREF="http://www.trajan-software.demon.co.uk/sugal.htm">www.trajan-software.demon.co.uk/sugal.htm</A></LI>
</UL>
</P>
<P>Sugal [soo-gall] is the SUnderland Genetic ALgorithm system.
The aim of Sugal is to support research and implementation in Genetic
Algorithms on a common software platform. As such, Sugal supports a
large number of variants of Genetic Algorithms, and has extensive
features to support customization and extension.</P>

<P>
<A NAME="TIN"></A> </P>
<DT><B>TIN</B><DD><P>
<UL>
<LI>Web site: 
<A HREF="http://www.jetlag.demon.nl/">www.jetlag.demon.nl</A></LI>
</UL>
</P>
<P>This program simulates primitive life-forms, equipped with some
basic instincts and abilities, in a 2D environment consisting of
cells.  By mutation new generations can prove their success, and thus
passing on "good family values".</P>
<P>The brain of a TIN can be seen as a collection of processes, each
representing drives or impulses to behave a certain way, depending on the
state/perception of the environment ( e.g. presence of food, walls,
neighbors, scent traces) These behavior process currently are : eating,
moving, mating, relaxing, tracing others, gathering food and killing. The
process with the highest impulse value takes control, or in other words:
the tin will act according to its most urgent need.</P>

<P>
<A NAME="Ummon"></A> </P>
<DT><B>Ummon</B><DD><P>
<UL>
<LI>Web site: 
<A HREF="http://www.spacetide.com/projects/ummon/">www.spacetide.com/projects/ummon/</A></LI>
</UL>
</P>
<P>Ummon is an advanced Open Source chatterbot. The main principle of the
bot is that it has no initial knowledge of either words or grammar; it
learns everything "on the fly." Numerous AI techniques will be explored
in the development of Ummon to achieve realistic "human" communication
with support for different, customizable personalities.</P>



</DL>
</P>


<H2><A NAME="ss8.2">8.2</A> <A HREF="AI-Alife-HOWTO.html#toc8.2">Dead projects.</A>
    </H2>

<P>
<DL>
<P>
<A NAME="EMA-XPS"></A> </P>
<DT><B>EMA-XPS - A Hybrid Graphic Expert System Shell</B><DD><P>
<UL>
<LI>Web site: 
<A HREF="http://www.iai.uni-wuppertal.de/EMA-XPS/">www.iai.uni-wuppertal.de/EMA-XPS/</A></LI>
</UL>
</P>

<P>EMA-XPS is a hybrid graphic expert system shell based on the
ASCII-oriented shell Babylon 2.3 of the German National Research
Center for Computer Sciences (GMD). In addition to Babylon's AI-power
(object oriented data representation, forward and backward chained
rules - collectible into sets, horn clauses, and constraint networks)
a graphic interface based on the X11 Window System and the OSF/Motif
Widget Library has been provided.</P>

<P>
<A NAME="FIPA-OS"></A> </P>
<DT><B>FIPA-OS</B><DD><P>
<UL>
<LI>Web site: 
<A HREF="http://fipa-os.sourceforge.net/index.htm">http://fipa-os.sourceforge.net/index.htm</A></LI>
</UL>
</P>
<P>FIPA-OS is an open source implementation of the mandatory elements
contained within the FIPA specification for agent interoperability. In
addition to supporting the FIPA interoperability concepts, FIPA-OS also
provides a component based architecture to enable the development of
domain specific agents which can utilise the services of the FIPA
Platform agents. It is implemented in Java.</P>

<P>
<A NAME="PDKB"></A> </P>
<DT><B>PDKB</B><DD><P>
<UL>
<LI>Web site: 
<A HREF="http://lynx.eaze.net/~pdkb/web/">lynx.eaze.net/~pdkb/web/</A></LI>
<LI>SourceForge site: 
<A HREF="http://sourceforge.net/projects/pdkb/">sourceforge.net/projects/pdkb</A></LI>
</UL>
</P>
<P>Public Domain Knowledge Bank (PDKB) is an Artificial Intelligence
Knowledge Bank of common sense rules and facts. It is based on the Cyc
Upper Ontology and the MELD language.</P>

<P>
<A NAME="RobocodeNG"></A> </P>
<DT><B>RobocodeNG</B><DD><P>
<UL>
<LI>Web site: 
<A HREF="http://robocodeng.sourceforge.net/">robocodeng.sourceforge.net</A></LI>
</UL>
</P>
<P>Merged together with original 
<A HREF="AI-Alife-HOWTO-6.html#Robocode">Robocode</A>
 as of version 1.1.</P>
<P>Extension of Robocode, the battling bot AI programming game. Like its
parent, it is written in Java and meant as a learning environment.</P>

<P>
<A NAME="Sulawesi"></A> </P>
<DT><B>Sulawesi</B><DD><P>
<UL>
<LI>Web site: 
<A HREF="http://wearables.essex.ac.uk/sulawesi/">wearables.essex.ac.uk/sulawesi/</A></LI>
</UL>
</P>
<P>A framework called Sulawesi has been designed and implemented to
tackle what has been considered to be important challenges in a
wearable user interface. The ability to accept input from any 
number of modalities, and perform if necessary a translation to any
number of modal outputs. It does this primarily through a set
of proactive agents to act on the input.</P>

<P>
<A NAME="TresBel"></A> </P>
<DT><B>TresBel</B><DD><P>
<UL>
<LI>Abstract: 
<A HREF="http://iridia.ulb.ac.be/Projects/imple.html">iridia.ulb.ac.be/Projects/imple.html</A></LI>
<LI>Direct Download: 
<A HREF="ftp://iridia.ulb.ac.be/pub/hongxu/software/TresBel.tar.Z">ftp://iridia.ulb.ac.be/pub/hongxu/software/TresBel.tar.Z</A></LI>
</UL>
</P>
<P>This project seems to have been superseded by 
<A HREF="AI-Alife-HOWTO-3.html#Pulcinella">Pulcinella</A>
.</P>
<P>Libraries containing (Allegro) Common Lisp code for Belief Functions 
(aka. Dempster-Shafer evidential reasoning) as a representation 
of uncertainty. Very little documentation. Has a limited GUI.</P>



</DL>
</P>

<HR>
Next
<A HREF="AI-Alife-HOWTO-7.html">Previous</A>
<A HREF="AI-Alife-HOWTO.html#toc8">Contents</A>
</BODY>
</HTML>