home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.ai,news.answers,comp.answers
- Path: senator-bedfellow.mit.edu!bloom-beacon.mit.edu!news.kei.com!eff!news.umbc.edu!europa.eng.gtefsd.com!fs7.ece.cmu.edu!honeydew.srv.cs.cmu.edu!crabapple.srv.cs.cmu.edu!mkant
- From: mkant+@cs.cmu.edu (Mark Kantrowitz)
- Subject: FAQ: Artificial Intelligence FTP Resources 5/6 [Monthly posting]
- Message-ID: <ai_5.faq_755770465@cs.cmu.edu>
- Followup-To: poster
- Summary: FTP Resources for AI
- Sender: news@cs.cmu.edu (Usenet News System)
- Supersedes: <ai_5.faq_753178097@cs.cmu.edu>
- Nntp-Posting-Host: a.gp.cs.cmu.edu
- Reply-To: mkant+ai-faq@cs.cmu.edu
- Organization: School of Computer Science, Carnegie Mellon University
- Date: Mon, 13 Dec 1993 08:14:51 GMT
- Approved: news-answers-request@MIT.Edu
- Expires: Mon, 24 Jan 1994 08:14:25 GMT
- Lines: 928
- Xref: senator-bedfellow.mit.edu comp.ai:19792 news.answers:15730 comp.answers:2982
-
- Archive-name: ai-faq/part5
- Last-Modified: Mon Nov 15 15:57:16 1993 by Mark Kantrowitz
- Version: 1.14
-
- ;;; ****************************************************************
- ;;; Answers to Questions about Artificial Intelligence *************
- ;;; ****************************************************************
- ;;; Written by Mark Kantrowitz
- ;;; ai_5.faq -- 43995 bytes
-
- If you think of questions that are appropriate for this FAQ, or would
- like to improve an answer, please send email to mkant+ai-faq@cs.cmu.edu.
-
- Please note that the FTP Resources are now split across parts 4 and 5
- of the AI FAQ.
-
- Note: Question [4-2] is split across parts 4 and 5.
-
- Part 5 (FTP Resources):
- [4-2b] FTP and Other Resources: Qualitative Reasoning -- Theorem Proving
- [5-1] AI Bibliographies available by FTP
- [5-2] AI Technical Reports available by FTP
- [5-3] Where can I get a machine readable dictionary, thesaurus, and
- other text corpora?
- [5-4] List of Smalltalk implementations.
- [5-5] AI-related CD-ROMs
-
- Search for [#] to get to question number # quickly.
-
- ----------------------------------------------------------------
- Subject: [4-2b] FTP and Other Resources: Qualitative Reasoning --
- Theorem Proving
-
- Qualitative Reasoning/Qualitative Physics:
-
- QSIM -- cs.utexas.edu:/pub/qsim
- Contact: Ben Kuipers <kuipers@cs.utexas.edu>
-
- QPE -- multivac.ils.nwu.edu:pub/QPE
- contact: Prof. Kenneth D. Forbus <forbus@ils.nwu.edu>
- Qualitative Process Engine (an implementation of QP theory)
-
- Robotics (Planning Testbeds and Simulators):
-
- TILEWORLD -- cs.washington.edu:new-tileworld.tar.Z
- Planning testbed
-
- The ARS MAGNA abstract robot simular provides an abstract world in
- which a planner controls a mobile robot. This abstract world is more
- realistic than typical blocks worlds, in which micro-world simplifying
- assumptions do not hold. Experiments may be controlled by varying
- global world parameters, such as perceptual noise, as well as building
- specific environments in order to exercise particular planner
- features. The world is also extensible to allow new experimental
- designs that were not thought of originally. The simulator also
- includes a simple graphical user-interface which uses the CLX
- interface to the X window system. ARS MAGNA can be obtained by
- anonymous ftp from ftp.cs.yale.edu, as ars-magna.tar.Z in the pub/nisp
- directory. Installation instructions are in the file
- Installation.readme. The simulator is written in Nisp, a macro-package
- for Common Lisp. Nisp can be retrieved in the same way as the
- simulator. Version 1.0 of the ARS MAGNA simulator is documented in
- Yale Technical Report YALEU/DCS/RR #928, "ARS MAGNA: The Abstract
- Robot Simulator". This report is available in the distribution as a
- PostScript file. Comments should be directed to Sean Philip
- Engelson <engelson@cs.yale.edu>.
-
- Simderella is a robot simulator consisting of three programs: CONNEL
- (the controller), SIMMEL (the robot simulator), and BEMMEL (the
- X-windows oriented graphics back-end). SIMMEL performs a few matrix
- multiplications, based on the Denavit Hartenberg method, calculates
- velocities with the Newton-Euler scheme, and communicates with the
- other two programs. BEMMEL only displays the robot. CONNEL is the
- controller, which must be designed by the user (in the distributed
- version, CONNEL is a simple inverse kinematics routine.) The programs
- use Unix sockets for communication, so you must have sockets, but you
- can run the programs on different machines. The software is available
- by anonymous ftp from
- galba.mbfys.kun.nl:pub/neuro-software/pd/ [131.174.82.73]
- as the file simderella.1.0.2.tar.Z The software has been compiled using
- gcc on SunOS running under X11R4/5 on Sun3, Sun4, Sun Sparc 1, 2, and
- 10, and Silicon Graphics architectures. For more information,
- send email to Patrick van der Smagt, <smagt@fwi.uva.nl>.
-
- The Michigan Intelligent Coordination Experiment (MICE) testbed is a
- tool for experimenting with coordination between intelligent systems
- under a variety of conditions. MICE simulates a two-dimensional
- grid-world in which agents may move, communicate, and affect their
- environment. MICE is essentially a discrete-event simulator that
- helps control the domain and a graphical representation, but provides
- relatively few constraints on the form of the domain and the agents'
- abilities. Users may specify the time required by various activities,
- the constraints on an agents' sensors, the configuration of the domain
- and its properties, etc. MICE runs under XWindows on Un*x boxes, on
- Macs, and on TI Explorers, with relatively consistent graphical
- displays. Source code, documentation, and examples are available via
- anonymous ftp to ftp.eecs.umich.edu:software/Mice/Mice.tar.Z. MICE was
- produced by the University of Michigan's Distributed Intelligent Agent
- Group (UM DIAG). For further information, write to
- umdiagmice@caen.engin.umich.edu.
-
- Simulated Annealing:
-
- ASA (Adaptive Simulated Annealing) is a powerful global optimization
- C-code algorithm especially useful for nonlinear and/or stochastic
- systems. Most current copies can be obtained by anonymous ftp from
- ftp.caltech.edu:pub/ingber/asa.Z [131.215.48.151]; an uncompressed
- version, asa, also is in that archive. There are several related
- (p)reprints in the Caltech archive, including sa_pvt93.ps.Z, "Simulated
- annealing: Practice versus theory." The first VFSR code was developed
- by Lester Ingber in 1987, and the reprint of that paper is vfsr89.ps.Z,
- "Very fast simulated re-annealing". If you cannot use ftp or ftpmail,
- then copies of the code are also available by email from the author
- at ingber@alumni.caltech.edu. To be added to the mailing list, send
- mail to asa-request@alumni.caltech.edu.
-
- The VFSR code was made publicly available in 1992 under the GNU GPL, by
- Lester Ingber and Bruce Rosen. The last version of that code before
- the introduction of ASA is available via anonymous ftp from
- ringer.cs.utsa.edu:pub/rosen/vfsr.tar.Z. Bruce Rosen has a comparison
- study, "Function Optimization based on Advanced Simulated Annealing,"
- which is available via anonymous ftp from
- archive.cis.ohio-state.edu:pub/neuroprose/rosen.advsim.ps.Z.
- [VFSR is no longer supported, but ASA is. --mk]
-
- Speech:
-
- RECNET is a complete speech recognition system for the DARPA TIMIT and
- Resource Management tasks. It uses recurrent networks to estimate phone
- probabilities and Markov models to find the most probable sequence of
- phones or words. The system is a snapshot of evolving research code.
- There is no documentation other than published research papers. It is
- configured for the two specific databases and is unlikely to be of use as
- a complete system for other tasks. It is available by anonymous ftp from
- svr-ftp.eng.cam.ac.uk:misc/recnet-1.3.tar.Z. Related publications can be
- found in svr-ftp.eng.cam.ac.uk:reports/ (see the ABSTRACT file first).
- You will need the relevant CDROMs, 150MByte of free space for TIMIT and
- 300MByte for RM. If you use the code, the author would appreciate an
- email message so that he can keep you informed of new releases. Write to
- Tony Robinson, <ajr@eng.cam.ac.uk>, for more information.
-
- CELP 3.2a is available from super.org:/pub/celp_3.2a.tar.Z
- [192.31.192.1] with copies available on
- svr-ftp.eng.cam.ac.uk:comp.speech/sources/ The code (C, FORTRAN,
- diskio) all has been built and tested on a Sun4 under SunOS4.1.3. If
- you want to run it somewhere else, then you may have to do a bit of
- work. (A Solaris 2.x-compatible release is planned soon.) Written by
- Joe Campbell <jpcampb@afterlife.ncsc.mil> of the Department of
- Defense. Distribution facilitated by Craig F. Reese
- <cfreese@super.org>, IDA/Supercomputing Research Center.
-
- Temporal Reasoning:
-
- See also KNOWBEL above.
-
- MATS -- Metric/Allen Time System
- Contact: Henry Kautz <kautz@research.att.com>
- MATS is a Common Lisp program which solves temporal
- constraint problems. Input constraints are either
- difference inequalities or Allen-style qualitative constraints.
-
- TMM -- New implementation of Dean & McDermott's Temporal Map
- Manager system written in Common Lisp.
- See SIGART Bulletin 4(3), July 1993.
- Contact: carciofi@src.honeywell.com
-
- MTMM -- Modified version of Dean & McDermott's TMM written in
- MCL. Available on diskette.
- Contact: Eckehard Gross (gross@gmd.de)
-
- TimeGraph-- Metric and Qualitative temporal reasoning system which
- handles (<, =, >) point relations, bounds on absolute
- calendar/clock times, and bounds on durations. Data entry
- and retrieval is through interval or point relations.
- The system is scalable in the sense that storage
- remains linear in the number of relations added.
- Efficient retrieval is achieved through a simple
- timepoint numbering scheme and metagraph structure.
- See SIGART Bulletin 4 (3), pp. 21-25, July 1993.
- Contact: Lenhart Schubert (schubert@cs.rochester.edu)
-
- TimeGraph-II (TG-II) Successor of TimeGraph, but does not handle metric
- constraints. It handles the full set of point relations
- and automatically structures the timegraph for efficiency.
- The system is scalable in the sense that storage tends to
- remain linear in the number of relations asserted. As in TG-I,
- efficient query handling is achieved through a time
- point numbering scheme (with some improvements) and
- metagraph structure.
- See SIGART Bulletin 4(3), July 1993 and
- Proceedings of IJCAI 1993.
- Contact: Alfonso Gerevini (gerevini@irst.it) or
- Lenhart Schubert (schubert@cs.rochester.edu)
-
-
-
- Tachyon -- Performs constraint satisfaction for point-based metric
- reasoning. Qualitative constraints are also handled by
- translation into quantitative ones. Written in C++.
- See SIGART Bulletin 4(3), July 1993.
- Contact: Richard Arthur (arthurr@crd.ge.com)
-
- TimeLogic-- The TimeLogic system is an interval-based forward
- chaining inference engine and database manager of
- temporal constraints. Relational constraints,
- indicating relative order between intervals, are based
- on Allen's interval logic. The TimeLogic system also
- supports durational constraints, indicating relative
- magnitude between intervals, and reference links, used
- for the explicit or automatic construction of interval
- hierarchies. Constraints are posed and propagated in
- user-defined contexts with inheritance. Supports relative
- metric constraints but no absolute dates or times.
- Written in Common Lisp.
- Contact: Peggy Meeker (timelogic-request@cs.rochester.edu)
-
- TemPro -- A temporal constraint system that uses both interval
- algebra and point-based algebra. Written in Common Lisp.
- Contact: J-P Haton <jph@loria.fr> or
- F. Charpillet <charp@loria.fr>
-
- TCNM -- Temporal Constraint Network Manager. Handles both
- qualitative and quantitative constraints between
- time-points and durations. Written in Common Lisp.
- Contact: Federico A. Barber <fbarber@csic.upv.es>.
- [email bounces]
-
- TIE -- Temporal Inference Engine. Written in Common Lisp.
- Contact: E. Tsang (Essex University, UK)
-
- Theorem Proving/Automated Reasoning:
-
- Otter -- info.mcs.anl.gov:pub/Otter/Otter-2.2/otter22.tar.Z
- anagram.mcs.anl.gov:pub/Otter/
- Contact: otter@mcs.anl.gov
- Resolution-based theorem prover.
-
- ATP Problems -- anagram.mcs.anl.gov:pub/ATP_Problems/*
- Collection of ATP problems from Otter, CADE, and JAR.
- The problems include algebra, analysis, circuits,
- geometry, logic problems, Pelletier's problem set,
- program verification, puzzles, set theory, and topology.
-
- SETHEO -- flop.informatik.tu-muenchen.de:pub/fki/ [131.159.8.35]
- Get the files setheo.info and setheo.tar.Z.
- SETHEO (SEquential THEOrem prover) is an automated
- theorem prover for formulae of predicate logic.
- SETHEO is based on the calculus of ``connection
- tableaux''. SETHEO runs on Sun SPARCs only.
- Contact: setheo@informatik.tu-muenchen.de
-
- Isabelle -- ftp.cl.cam.ac.uk:ml/ [128.232.0.56]
- ftp.informatik.tu-muenchen.de:lehrstuhl/nipkow/
- [131.159.0.110]
- Relevant files include:
- intro.dvi.Z "Introduction to Isabelle"
- ref.dvi.Z "The Isabelle Reference Manual"
- logics.dvi.Z "Isabelle's Object-Logics"
- 92.tar.Z Isabelle-92 distribution directory
- Written in Standard ML, and comes with 8 different
- logics, including LCF, some modal logics, first-order
- logic, Zermelo-Fraenkel set theory, and higher-order logic.
- Contact: Larry.Paulson@cl.cam.ac.uk
- Tobias.Nipkow@informatik.tu-muenchen.de
-
- MVL -- t.stanford.edu:/mvl/mvl.tar.Z
- Contact: ginsberg@t.stanford.edu
- Multi-valued logics
-
- Boyer-Moore -- ftp.cli.com:pub/nqthm/nqthm.tar.Z
- rascal.ics.utexas.edu:/pub/nqthm 128.83.138.20
- Contact: kaufmann@cli.com
-
- DTP is a general theorem prover incorporating domain-independent control
- of inference. Implemented in CLtL2 Common Lisp, it runs in Franz
- Allegro, Lucid, and Macintosh (MCL) Common Lisp. It is available by
- anonymous ftp from meta.stanford.edu:pub/dtp/ [36.8.0.54]. Contact
- Don Geddis <Geddis@CS.Stanford.EDU> for more information.
-
- RRL -- herky.cs.uiowa.edu:public/rrl [128.255.28.100]
- Rewrite Rule Laboratory
-
- FRAPPS (Framework for Resolution-based Automated Proof Procedures) is
- a portable resolution theorem-prover written in Common Lisp. It is
- available via anonymous ftp from a.cs.uiuc.edu:/pub/frapps [128.174.252.1].
- If you take a copy of FRAPPS, please send a short note to Prof.
- Alan M. Frisch <frisch@cs.uiuc.edu>.
-
- XPNet (X Proof Net) is a graphical interface to proof nets with an
- efficient proof checker. It is available by anonymous ftp to
- ftp.cis.upenn.edu:/pub/xpnet.tar.Z [130.91.6.8]. For further
- information, write to Jawahar Chirimar <chirimar@saul.cis.upenn.edu>,
- Carl A. Gunter <gunter@saul.cis.upenn.edu>, or Myra VanInwegen
- <myra@saul.cis.upenn.edu>.
-
- Gazer is a sequent calculus based system for first order logic with a
- novel inference rule, gazing, that enables the system to determine
- which of a possibly large number of definitions and lemmas should be
- used at any point in a proof. Available from the authors, Dave
- Barker-Plummer <plummer@cs.swarthmore.edu> and Alex Rothenberg
- <alex@cs.swarthmore.edu>.
-
- KEIM is a collection of software modules, written in Common Lisp with
- CLOS, designed to be used in the production of theorem proving
- systems. KEIM is intended to be used by those who want to build or
- use deduction systems (such as resolution theorem provers) without
- having to write the entire framework. KEIM is also suitable for
- embedding a reasoning component into another Common Lisp program.
- KEIM offers a range of datatypes implementing a logical language of
- type theory (higher order logic), in which first order logic can be
- embedded. KEIM's datatypes and algorithms include: types; terms
- (symbols, applications, abstractions), environments (e.g., associating
- symbols with types); unification and substitutions; proofs, including
- resolution and natural deduction style. KEIM also provides
- functionality for the pretty-printing, error handling, formula parsing
- and user interface facilities which form a large part of any theorem
- prover. Implementing with KEIM thus allows the programmer to avoid a
- great deal of drudgery. KEIM has been tested in Allegro CL 4.1 and
- Lucid CL 4.0 on Sun 4 workstations. KEIM is available for
- noncommercial use via anonymous FTP from
- js-sfbsun.cs.uni-sb.de:pub/keim/keim*
- For more information contact Dan Nesmith, Fachbereich Informatik/AG
- Siekmann, Universitaet des Saarlandes, Postfach 1150, D-66041
- Saarbruecken, Germany, or send email to keim@cs.uni-sb.de. A mailing
- list for KEIM users is also being set up. Send mail to
- keim-users-request@cs.uni-sb.de to be put on the list.
-
- Truth Maintenance:
-
- The truth maintenance system and problem solver implementations
- described in the book "Building Problem Solvers" by Ken Forbus and
- Johan de Kleer are available by anonymous ftp from
- multivac.ils.nwu.edu:pub/BPS/
- parcftp.xerox.com:/pub/bps/
- For more information send mail to Johan de Kleer <deKleer@parc.xerox.com>.
- Send bug reports to bug-bps@ils.nwu.edu.
-
- Miscellaneous:
-
- University of Toronto:
- ftp -- ftp.cs.toronto.edu:/pub/ailist
-
- Archives of ailist mailing list, defunct as of January 19, 1990
-
- PAIL (Portable AI Lab)
- ftp -- pobox.cscs.ch:/pub/ai/pail-2.2/ [148.187.10.13]
- contact: pail-info@idsia.ch
- authors: Mike Rosner <mike@idsia.ch>
- Dean Allemang <allemang@lia.di.epfl.ch>
-
- ----------------------------------------------------------------
- Subject: [5-1] AI Bibliographies available by FTP
-
- The Computer Science Department at the University of Saarbruecken, Germany,
- maintains a large bibliographic database of articles pertaining to the
- field of Artificial Intelligence. Currently the database contains more
- than 25,000 references, which can be retrieved by electronic mail from
- the LIDO mailserver at lido@cs.uni-sb.de. Send a mail message with
- subject line "lidosearch help info" to get instructions on using the
- mail server. A variety of queries based on author names, title and
- year of publication are possible. The references can be provided in
- BibTeX or Refer formats. The entire bibliographic database can be
- obtained for a fee by ftp or on tape. Questions may be directed to
- bib-1@cs.uni-sb.de.
-
- A variety of AI-related bibliographies are located on nexus.yorku.ca
- in the directory /pub/bibliographies.
-
- For information on a fairly complete bibliography of computational
- linguistics and natural language processing work from the 1980s, send
- mail to clbib@csli.stanford.edu with the subject HELP.
-
- Stanford University (SUMEX-AIM) has a large BibTeX bibliography of
- Artificial Intelligence papers and technical reports. Available by
- anonymous ftp from aim.stanford.edu:/pub/ai{1,2,3}.bib
-
- A BibTeX database of references addressing neuro-fuzzy issues can be
- obtained by anonymous ftp from ftp.tu-bs.de (134.169.34.15) in the
- directory local/papers as the (ascii) file fuzzy-nn.bib.
-
- Robert Dale's Natural Language Generation (NLG) bibliography is
- available by anonymous ftp from scott.cogsci.ed.ac.uk [129.215.144.3] in
- the directory pub/nlg. Note that it is formatted for A4 paper. For
- further information, write to Robert Dale, University of Edinburgh,
- Centre for Cognitive Science, 2 Buccleuch Place, Edinburgh EH8 9LW
- Scotland, or <R.Dale@edinburgh.ac.uk>.
-
- Mark Kantrowitz's Natural Language Generation (NLG) bibliography is
- available by anonymous ftp from ftp.cs.cmu.edu [128.2.206.173] in the
- directory user/ai/software/nlp/nlg/bibs/mk/. In addition to the tech
- report, the BibTeX file containing the bibliography is also available.
- The bibliography contains more than 1,200 entries. Additions and
- corrections should be sent to mkant@cs.cmu.edu.
-
- A bibliography of over 400 Evolutionary Computation references (GA,
- ES, EP, GP) is available by anonymous ftp from
- magenta.me.fau.edu:/pub/ep-list/bib/
- The file EC-ref.bib.Z is in BibTeX format; EC-ref.ps.Z is a postscript
- version of the bibliography. Please send additions and corrections to
- saravan@amber.me.fau.edu or EP-List@amber.me.fau.edu.
-
- A bibliography of over 1000 entries about Self-Organizing Map
- (SOM) and Learning vector Quantization (LVQ) studies is
- available by anonymous ftp from
- cochlea.hut.fi:/pub/ref/
- as the files references.bib.Z (BibTeX file) and references.ps.Z
- (PostScript file). Please send additions and corrections to
- biblio@cochlea.hut.fi.
-
- ----------------------------------------------------------------
- Subject: [5-2] Technical Reports available by FTP
-
- This section lists the anonymous ftp sites for technical reports from
- several universities and other organizations. Some of the sites
- provide only an online catalog of technical reports, while the rest
- make the actual reports available online. The email address listed is
- that of the appropriate person to contact with questions about
- ordering technical reports.
-
- When ftping compressed .Z files, remember to set the transfer type to
- binary first, using the command
- ftp> binary
-
- Other general locations for technical reports from several
- universities include:
- wuarchive.wustl.edu:/doc/techreports/ [128.252.135.4]
- cs-archive.uwaterloo.edu:cs-archive (see Index for an index)
- AKA watdragon.uwaterloo.ca [129.97.140.24]
- The uwaterloo archive includes tech reports from the Logic Programming
- and Artificial Intelligence Group (LPAIG) of the University of Waterloo.
-
- There is also a WAIS server containing tech report abstracts that can be
- searched. To use, create the file ~/wais-sources/cs-techreport-abstracts.src
- containing
- (:source
- :version 3
- :ip-address "130.194.74.201"
- :ip-name "daneel.rdt.monash.edu.au"
- :tcp-port 210
- :database-name "cs-techreport-abstracts"
- :cost 0.00
- :cost-unit :free
- :maintainer "wais@daneel.rdt.monash.edu.au")
- and invoke your local wais client. To add to it, email abstracts of
- your papers to wais@rdt.monash.edu.au in the following format:
- %TI Title
- %AU Author (use multiple %AU lines for multiple authors)
- %PU Published In (citation information)
- %AV Availability (e.g., ftp reports.adm.cs.cmu.edu:1992/CMU-CS-92-101.ps)
- %OR Organization (see cs-techreport-archives.src for institution codes)
- %LT Local title (e.g., tech report number)
- %DA Date (and, if you want, %MN Month, %YR Year)
- %AB Abstract
- If your papers are not available by FTP, you can use a %AV line such as:
- %AV mail harry.bovik@cs.cmu.edu
- Further instructions are available from
- daneel.rdt.monash.edu.au:/pub/techreports/reports/README
- [Based on a post by Ashwin Ram.]
-
- An archive of linguistics papers and preprints is available from
- linguistics.archive.umich.edu:linguistics/papers/. Contact John Lawler
- (jlawler@umich.edu) or linguistics-archivist@umich.edu for more
- information.
-
- The Concurrent Engineering Research Center (CERC) at West Virginia
- University has placed ASCII versions of the concurrent
- engineering-related abstracts (over 500) that were on CERCnet, ASCII
- back issues of the Concurrent Engineering Research in Review journal
- (now discontinued), and Postscript copies of CERC technical reports in
- the gopher server gopher.cerc.wvu.edu. In addition, many of the CERC
- technical reports, including journal articles, symposium papers,
- theses, dissertations, and issues of the Concurrent Engineering
- Research in Review journal, are available as Postscript versions via
- anonymous ftp from babcock.cerc.wvu.edu:pub/techReports/
- (157.182.44.36). An index to all the reports, including some that are
- available only in hardcopy, is contained in the file "CERC-TR-INDEX".
- If you need additional information, contact Mary Carriger, CERC Office
- of Information Services, at carriger@cerc.wvu.edu.
-
- The newsgroup comp.doc.techreports is devoted to distributing lists of
- tech reports and their abstracts.
-
- MIT Artificial Intelligence Laboratory:
- ftp -- publications.ai.mit.edu:ai-publications/
- email -- publications@ai.mit.edu
- browse -- telnet reading-room.lcs.mit.edu
-
- A full catalog of MIT AI Lab technical reports (and a listing of recent
- updates) may be obtained from the above location, by writing to
- Publications, Room NE43-818, M.I.T. Artificial Intelligence Laboratory,
- 545 Technology Square, Cambridge, MA 02139, USA, or by calling
- 1-617-253-6773. The catalog lists the technical reports ("AI Memos")
- with a short abstract and their current prices. There is also a charge
- for shipping. Some recent tech reports (since 1991) are available in the
- ai-publications/ subdirectory; older technical reports are NOT
- available by ftp. A bibliography is in the bibliography/ directory.
-
- Sandiway Fong's 1991 PhD thesis, ``The Computational Properties of
- Principle-Based Grammatical Theories,'' may be found in the
- directory pub/sandiway/.
-
- CMU School of Computer Science:
- ftp -- reports.adm.cs.cmu.edu
- email -- Technical.Reports@cs.cmu.edu
-
- CMU Software Engineering Institute:
- ftp -- ftp.sei.cmu.edu:/pub/documents
- email -- bjz@sei.cmu.edu
-
- Yale:
- ftp -- dept.cs.yale.edu:/pub/TR/
-
- University of Washington CSE Tech Reports:
- ftp -- june.cs.washington.edu:/tr
- email -- tr-request@cs.washington.edu
-
- ================
-
- AT&T Bell Laboratories:
- ftp -- research.att.com:/netlib/research/cstr
-
- bib.Z contains short bibliography, including all the technical
- reports contained in this directory.
-
- ftp -- research.att.com:/dist/ai
-
- Argonne National Laboratory:
- ftp -- anagram.mcs.anl.gov:pub/tech_reports
- email -- wright@mcs.anl.gov
-
- Contains MCS Division preprints and technical memoranda,
- available as either .dvi or .ps files. For descriptions of the
- contents, see the subdirectory pub/tech_reports/abstracts; for
- the files themselves see the subdirectory pub/tech_reports/reports.
-
- Boston University:
- ftp -- cs.bu.edu:techreports/
- email -- techreports@cs.bu.edu
-
- Brown University:
- ftp -- wilma.cs.brown.edu:techreports/
- email -- techreports@cs.brown.edu
-
- Cambridge University: Speech, Vision & Robotics Group
- ftp -- svr-ftp.eng.cam.ac.uk:reports/
-
- Columbia University:
- ftp -- cs.columbia.edu:/pub/reports
- email -- tech-reports@cs.columbia.edu
-
- DEC Cambridge Research Lab:
- ftp -- crl.dec.com:/pub/DEC/CRL/{abstracts,tech-reports}
-
- DEC Paris Research Lab:
- email -- doc-server@prl.dec.com
- Put commands in Subject: line of the message.
- To get a list of articles, use
- send index articles
- To get a list of tech reports, use
- send index reports
-
- DEC WRL:
- email -- wrl-techreports@decwrl.dec.com
- To get a helpfile, send a message with
- help
- in the subject line.
-
- DFKI:
- ftp -- duck.dfki.uni-sb.de:/pub/papers
- email -- Martin Henz (henz@dfki.uni-sb.de)
-
- Duke University:
- ftp -- cs.duke.edu:/dist/{papers,theses}
- email -- techreport@cs.duke.edu [unknown user, 7/7/93]
-
- Edinburgh:
- A list of available reports can be sent via email. Send requests
- for information about reports from the Center for Cognitive Science
- to cogsci%ed.ac.uk@nsfnet-relay.ac.uk, and from the Human Communication
- Research Center to HCRC%ed.ac.uk@nsfnet-relay.ac.uk.
-
- Electrotechnical Laboratory, Japan:
- Reports from the Cooperative Architecture project (half AI, half
- software engineering).
- ftp -- etlport.etl.go.jp:pub/kyocho/Papers [192.31.197.99]
- See file Index.English.
- email -- Hideyuki Nakashima <nakashim@etl.go.jp>.
-
- Georgia Tech College of Computing, AI Group:
- ftp -- ftp.cc.gatech.edu:pub/ai (130.207.3.245)
- email -- Professor Ashwin Ram <ashwin@cc.gatech.edu>
-
- Illinois:
- email -- Erna Amerman <erna@uiuc.edu>
-
- Illinois Genetic Algorithms Laboratory (IlliGAL):
- email -- Eric Thompson <library@gal1.ge.uiuc.edu>
- phone -- 217-333-2346 (9AM to 5PM CT, M-F)
- mail -- Illinois Genetic Algorithms Laboratory
- Department of General Engineering
- 117 Transportation Building
- 104 South Mathews Avenue
- Urbana, IL 61801-2996
- ftp -- coming soon.
-
- Indiana:
- ftp -- cogsci.indiana.edu:pub [129.79.238.12]
- ftp -- cs.indiana.edu:pub/techreports [129.79.254.191]
-
- INRIA, France:
- ftp -- ftp.inria.fr:INRIA/publication/
-
- Institute for Learning Sciences at Northwestern University:
- ftp -- aristotle.ils.nwu.edu:/pub/papers/
-
- New York University (NYU):
- ftp -- cs.nyu.edu:/pub/tech-reports
-
- OGI:
- ftp -- cse.ogi.edu:/pub/tech-reports
- email -- csedept@cse.ogi.edu
-
- Ohio State University, Laboratory for AI Research
- ftp -- nervous.cis.ohio-state.edu:/pub/papers
- email -- lair-librarian@cis.ohio-state.edu
-
- OSU Neuroprose:
- ftp -- archive.cis.ohio-state.edu:/pub/neuroprose (128.146.8.52)
-
- This directory contains technical reports as a public service to the
- connectionist and neural network scientific community which has an
- organized mailing list (for info: connectionists-request@cs.cmu.edu)
- Includes several bibliographies.
-
- Stanford:
- ftp -- elib.stanford.edu:/cs
-
- Very spotty collection.
-
- SRI:
- email -- Donna O'Neal, donna@ai.sri.com
-
- SUNY Buffalo:
- ftp -- ftp.cs.buffalo.edu:/pub/tech-reports/
-
- SUNY at Stony Brook:
- ftp -- sbcs.sunysb.edu:/pub/TechReports
- email -- rick@cs.sunysb.edu or stark@cs.sunysb.edu
-
- The /pub/sunysb directory contains the SB-Prolog implementation
- of the Prolog language. Contact warren@sbcs.sunysb.edu for more
- information.
-
- TCGA (The Clearinghouse for Genetic Algorithms):
- email -- Robert Elliott Smith <rob@comec4.mh.ua.edu>
- Department of Engineering of Mechanics
- Room 210 Hardaway Hall
- The University of Alabama
- PO Box 870278
- Tuscaloosa, AL 35487
- 205-348-1618, fax 205-348-6419
-
- Thinking Machines:
- ftp -- ftp.think.com:think/techreport.list
-
- This file contains a list of Thinking Machines technical reports.
- Orders may be placed by email (limit 5) to t-rex@think.com, or by US
- Mail to Thinking Machines Corporation, Attn: Technical reports, 245
- First Street, Cambridge, MA 01241. In addition, the directories
- cm/starlisp and cm/starlogo contain code for the *Lisp and *Logo
- simulators.
-
- Tulane University:
- ftp -- rex.cs.tulane.edu:pub/tech/ [129.81.132.1]
-
- University of Arizona:
- ftp -- cs.arizona.edu:reports/
- email -- tr_libr@cs.arizona.edu
-
- The directory /japan/kahaner.reports contains reports on AI in
- Japan, among other things, written by Dr. David Kahaner, a
- numerical analyst on sabbatical to the Office of Naval
- Research-Asia (ONR Asia) in Tokyo from NIST. The reports are not
- written in any sort of official capacity, but are quite interesting.
-
- University of California/Santa Cruz:
- ftp -- ftp.cse.ucsc.edu:/pub/{bib,tr}
- email -- jean@cs.ucsc.edu
-
- University of Colorado:
- ftp -- ftp.cs.colorado.edu:/pub/cs/techreports
-
- University of Florida:
- ftp -- bikini.cis.ufl.edu:/cis/tech-reports
-
- University of Illinois at Urbana:
- ftp -- a.cs.uiuc.edu:/pub/dcs
- email -- e-amerman@a.cs.uiuc.edu
-
- University of Indiana, Center for Research on Concepts and Cognition:
- ftp -- cogsci.indiana.edu:pub/
- email -- helga@cogsci.indiana.edu
-
- University of Kaiserslautern, Germany:
- ftp -- ftp.uni-kl.de:reports_uni-kl/computer_science/
-
- University of Kentucky:
- ftp -- ftp.ms.uky.edu:ftp/pub/tech-reports/UK/cs/
-
- University of Massachusetts at Amherst:
- email -- techrept@cs.umass.edu
-
- University of Michigan:
- ftp -- ftp.eecs.umich.edu:/techreports
-
- University of North Carolina:
- ftp -- ftp.cs.unc.edu:/pub/technical-reports/
-
- University of Pennsylvania:
- ftp -- ftp.cis.upenn.edu:/pub/papers/
- email -- publications@upenn.edu [email bounced 7/7/93]
-
- USC/Information Sciences Institute:
- email -- Sheila Coyazo <scoyazo@isi.edu> is the contact. [email
- bounced 7/7/93]
-
- University of Toronto:
- ftp -- ftp.cs.toronto.edu:/pub/reports
- email -- tech-reports@cs.toronto.edu
-
- University of Virginia:
- ftp -- uvacs.cs.virginia.edu:/pub/techreports/cs
-
- University of Wisconsin:
- ftp -- ftp.cs.wisc.edu:/tech-reports
- email -- tech-reports-archive@cs.wisc.edu
-
-
- Some AI authors have set up repositories of their own papers:
-
- Matthew Ginsberg: t.stanford.edu:/u/ftp/papers
-
- ----------------------------------------------------------------
- Subject: [5-3] Where can I get a machine readable dictionary, thesaurus, and
- other text corpora?
-
- Free:
-
- Roget's 1911 Thesaurus is available by anonymous FTP from the
- Consortium for Lexical Research (clr.nmsu.edu, [128.123.1.12]).
- The pathname is /pub/lexica/thesauri/roget-1911.
- It is also available from
- src.doc.ic.ac.uk:/literary/collections/project_gutenberg/roget11.txt.Z
- An old Webster's dictionary is in /text/dict/{DICT.Z,DICT.INDEX.Z}.
- Project Gutenberg also has Roget's 1911 Thesaurus. The Project
- Gutenberg archive is at mrcnext.cso.uiuc.edu:/pub/etext/. The
- Project Gutenberg archive collects public domain electronic books. For more
- information, write to Michael S. Hart, Professor of Electronic Text,
- Executive Director of Project Gutenberg Etext, Illinois Benedictine
- College, Lisle, IL 60532 or send email to hart@vmd.cso.uiuc.edu.
-
- For people without FTP, Austin Code Works sells floppy disks
- containing Roget's 1911 Thesaurus for $40.00. This money helps support
- the production of other useful texts, such as the 1913 Webster's dictionary.
-
- The Online Book Initiative maintains a text repository on
- world.std.com (a public access UNIX system, 617-739-WRLD). See the
- README file on obi.std.com:/obi/. For more information, send email to
- obi@world.std.com, write to Software Tool & Die, 1330 Beacon Street,
- Brookline, MA 02146, or call 617-739-0202.
-
- The CHILDES project at Carnegie Mellon University has a lot of data of
- children speaking to adults, as well as the adult written and adult
- spoken corpora from the CORNELL project. Contact Brian MacWhinney
- <brian@andrew.cmu.edu> for more information.
-
- The Association for Computational Linguistics (ACL) has a Data
- Collection Initiative. For more information, contact Donald Walker at
- Bellcore, walker@flash.bellcore.com.
-
- Two lists of common female first names (4967 names) and male first
- names (2924 names) are available for anonymous ftp from ftp.cs.cmu.edu
- in the directory user/ai/software/nlp/corpora/names/. Read
- the file README first. [Note that you must cd to this directory in one
- atomic operation, as superior directories are protected during an
- anonymous ftp.] Send mail to mkant@cs.cmu.edu for more information.
-
- A list of 110,000 English words (one per line, in ASCII) is
- available in the PD1:<MSDOS.LINGUISTICS> directory on SIMTEL20 as the
- files WORDS1.ZIP, WORDS2.ZIP, WORDS3.ZIP, and WORDS4.ZIP. Although the
- list is in MS-DOS files, it can easily be used on other machines (but
- first you'll have to unzip the files on a DOS machine). The list
- includes inflected forms of the words, such as plural nouns and the
- -s, -ed, and -ing forms of verbs; thus the number of lexical stems in
- the list is considerably smaller than the total number of word forms.
- These files are available via FTP from WSMR-SIMTEL20.ARMY.MIL
- [192.88.110.20]. SIMTEL20 files are mirrored on wuarchive.wustl.edu.
-
- The Collins English Dictionary encoded as a Prolog fact base is
- available from the Oxford Text Archive by anonymous ftp from
- black.ox.ac.uk:ota/dicts/1192/ [129.67.1.165]
- The Oxford Text Archive includes many other texts, dictionaries,
- thesauri, word lists, and so on, most of which are available for
- scholarly use and research only. See the files
- black.ox.ac.uk:ota/textarchive.{form,info,list,sgml}
- for more information, or write to archive@ox.ac.uk, Oxford Text Archive,
- Oxford University Computing Services, 13 Banbury Road, Oxford OX2
- 6NN, UK, call 44-865-273238 or fax 44-865-273275.
-
- Chuck Wooters <wooters@icsi.berkeley.edu> has extracted the most
- likely pronunciation for each of about 6100 words in the hand-labeled
- TIMIT database, and made them available by anonymous ftp from
- ftp.icsi.berkeley.edu:pub/speech/TIMIT.mostlikely.Z.
-
- A list of homophones from general American English is available by
- anonymous ftp from svr-ftp.eng.cam.ac.uk:comp.speech/data/ as the file
- homophones-1.01.txt. To receive the list by email, send mail to
- Evan.Antworth@sil.org. The list was compiled by Tony Robinson.
-
- Commercial:
-
- Illumind publishes the Moby Thesaurus (25,000 roots/1.2 million
- synonyms), Moby Words (560,000 entries), Moby Hyphenator (155,000
- entries), and the Moby Part-of-Speech (214,000 entries), Moby
- Pronunciator (167,000 entries with IPA encoding, syllabification, and
- primary, secondary, and tertiary stress marks) and Moby Language
- (100,000 word word lists in five major world languages) lexical
- databases. All databases are supplied in pure ASCII, royalty-free, in
- both Macintosh and MS-DOS disk formats (also in .Z file formats). Both
- commercial (to resell derived structures as part of commercial
- applications) and educational/research licenses are available. Samples
- of each of the lexical databases are available by anonymous ftp from
- netcom.com:/pub/grady/Moby_Sampler.tar.Z [192.100.81.100]. For more
- information, write to Illumind, Attn: Grady Ward, 3449 Martha Court,
- Arcata, CA 95521, call/fax 707-826-7715, or send email to
- grady@netcom.com.
-
- The Oxford Text Archive has hundreds of online texts in a wide variety
- of languages, including a few dictionaries (the OED, Collins, etc.).
- The Lancaster-Oslo-Bergen (LOB), Brown, and London-Lund corpii are also
- available from them. For more information, write to Oxford Electronic
- Publishing, Oxford University Press, 200 Madison Avenue, New York, NY
- 10016, call 212-889-0206, or send mail to archive@vax.oxford.ac.uk.
- (Their contact information in England is Oxford Text Archive, Oxford
- University Computing Service, 13 Banbury Road, Oxford OX2 6NN, UK, +44
- (865) 273238.)
-
- Mailing Lists:
-
- CORPORA is a mailing list for Text Corpora. It welcomes information
- and questions about text corpora such as availability, aspects of
- compiling and using corpora, software, tagging, parsing, and
- bibliography. To be added to the list, send a message to
- corpora-request@x400.hd.uib.no. Contributions should be sent to
- corpora@x400.hd.uib.no.
-
- Linguistic Data Consortium:
-
- The Linguistic Data Consortium was established to broaden the collection
- and distribution of speech and natural language data bases for the
- purposes of research and technology development in automatic speech
- recognition, natural language processing, and other areas where large
- amounts of linguistic data are needed. Information about the LDC is
- available by anonymous ftp from ftp.cis.upenn.edu:/pub/ldc [130.91.6.8].
- Documents available in this directory include a paper on the background,
- rationale and goals of the LDC, a brief list of available data bases,
- and some tables summarizing these corpora. For further information,
- contact Elizabeth Hodas, <ehodas@walnut.ling.upenn.edu>, Mark Liberman
- <myl@unagi.cis.upenn.edu>, or Jack Godfrey <jgodfrey@unagi.cis.upenn.edu>.
-
- ----------------------------------------------------------------
- Subject: [5-4] List of Smalltalk implementations.
-
- Little Smalltalk -- Tim Budd's version of Smalltalk
- cs.orst.edu: /pub/budd/small.v3.tar
-
- GNU Smalltalk
- prep.ai.mit.edu:/pub/gnu/smalltalk-1.1.1.tar.Z
-
- ----------------------------------------------------------------
- Subject: [5-5] AI-related CD-ROMs
-
- The Artificial Intelligence CD-ROM (Revision 2, 1993) is available
- from Network Cybernetics Corporation for $129.00 per copy (plus $5
- shipping domestic, $10 shipping international). If you currently own
- the first edition of the AI CD-ROM, you can "upgrade" to the Rev.2 CD
- for $79 + shipping. The AI CD-ROM is an ISO-9660 format disk usable
- on any computer system, and contain a variety of public domain,
- shareware, and other software of special interest to the AI community.
- The disk contains source code, executable programs, demonstration
- versions of commercial programs, tutorials and other files for a
- variety of operating systems. Among the supported operating systems
- are MS-DOS, OS/2, Mac, Amiga, and Unix. Among the items included are
- CLIPS v6.0 and NETS, courtesy of COSMIC, the collected source code
- from AIExpert magazine from the premier issue in June of 1986 to the
- present, and complete transcriptions of the first annual Loebner Prize
- competition, which took place at the Boston Computer Museum. It also
- includes examples many different kinds of neural networks, genetic
- algorithms, artificial life simulators, natural language software,
- public domain and shareware compilers for a wide range of languages
- such as Lisp, Xlisp, Scheme, XScheme, Smalltalk, Prolog, ICON, SNOBOL,
- and many others. Complete collections of the Neural Digest, Genetic
- Algorithms Digest, and Vision List Digest are included. All files on
- the disk are compressed in ZIP format. Network Cybernetics Corporation
- intends to release annual revisions to the AI CD-ROM to keep it up to
- date with current developments in the field. For more information,
- write to Network Cybernetics Corporation, 4201 Wingren Road, Suite
- 202, Irving, Texas 75062-2763, call 214-650-2002, fax 214-650-1929, or
- send email to ai-cdrom@ncc.com or steve.rainwater@ncc.com (Steve
- Rainwater).
-
- PTF is a semi-annual CD-ROM collection of UNIX-related freeware source
- code and documentation. PTF in no way modifies the legal restrictions
- on any package it includes. Each issue consists of two ISO-9660
- CD-ROMs, bound into a 50+ page booklet. PTF is particularly useful for
- programmers who do not have FTP access, but may also be useful as a
- way of saving disk space and avoiding annoying FTP searches and
- retrievals. The current issue (2-1; January, 1993) includes, among
- other things, ICOT collection and several varieties of Lisp and other
- AI languages. It sells (list) for $60 US plus applicable sales tax and
- shipping and handling charges. SUG and USENIX members may purchase the
- issue for $50. Payable through Visa, Mastercard, postal money orders
- in US funds, and checks in US funds drawn on a US bank. For more
- information write to Prime Time Freeware, 370 Altair Way, Suite 150,
- Sunnyvale, CA 94086 call 408-433-9662, fax 408-432-6149, or send email
- to ptf@cfcl.com.
- ----------------------------------------------------------------
- ;;; *EOF*
-