HDTenEightyP/NetNews huggingface dataset:
From: pedersen@seas.smu.edu (Ted Pedersen)
Newsgroups: comp.ai
Subject: Knight's Tour
Date: 12 Aug 92 17:29:54 GMT
Organization: SMU School Of Engineering and Applied Science



I realize this might be just a little off the topic (but hopefully not too
much). I would very much like to find some source code for the Knight's Tour
problem. This is the problem where you have a lone knight on a chess board and 
the goal is to have your knight visit all of the squares on the board and 
return to his starting place without visiting any square twice. 

I would especially be interested in C source code that solves our knight's
dilema, either from an ftp site, book, etc.        

If anyone knows of any repositories of source code to solve these sorts of
problems (Knights Tour, N-Queens problem, etc.) I would appreciate any tips. 
I generally enjoy these sorts of computing problems so anyone who knows of 
any interesting variations on the Knight's Tour or N-Queens problem etc. 
I would sure like to hear about them. 

Ted Pedersen
Xref: sparky comp.ai:3105 comp.lang.lisp:2234
From: vdasigi@silver.cs.wright.edu (Venu Dasigi)
Newsgroups: comp.ai,comp.lang.lisp
Subject: Collins English Dictionary on CD-ROM - question
Keywords: ACL CED format Lloyd Nakatani
Date: 14 Aug 92 14:44:11 GMT
Organization: Wright State University


We recently acquired the DCI (Data Collection Initiative) CD-ROM distributed
by ACL (Association for Computational Linguistics), containing, among other
goodies, the Collins English Dictionary. I cannot make sense out of
the dictionary entries since there is no documaentation on their
format anywhere, and after some efforts to get more information, got
little help so far.

I did come to know that Prof. (?) Lloyd Nakatani and a student worked
to produce a parsed version of the entries, which was also included on
the CD-ROM. So I have also been trying to get in touch with Prof.
Lloyd Nakatani to see if he could help me.

I would appreciate any information in this regard, e.g., any
documentation on the format, the address (preferably e-mail or even US
mail) of Prof. Nakatani or the student who worked on it (his name was
not in the README file), etc.

Thanks.

--- Venu Dasigi (vdasigi@cs.wright.edu)
Dr. Venu Dasigi      vdasigi@cs.wright.edu    vdasigi@valhalla.wright.edu
Dept. of CS&Eng, Wright State U, 3640 Col. Glenn Highway, Dayton, OH 45435
From: ray@atc.boeing.com (Ray Allis)
Newsgroups: comp.ai
Subject: Re: planning/scheduling
Date: 18 Aug 92 19:17:33 GMT
Reply-To: ray@espresso.eca
Organization: Boeing Computer Services

In article 4626@eplrx7.es.duPont.com, pensak@eplrx7.es.duPont.com (Dave Pensak) writes:
>I hope that this is not a totally ludicrous question.....

[ I know ludicrous, and believe me, your question is not ludicrous. ]
>
>We have been approached by a local psychiatric hospital to see if
>any of our scheduling folks can help them with the following problem:
>
>There are N patients
>
>There are M staff members  (N >> M)
>
>There are I activities in J locations throughout the day
>
>Is there any machine assisted way to make sure that the best possible
>staff combinations are associated with the right group of patients
>throughout the day (the groupings can, and do, change during the day).

Your problem sounds very similar to the classical :-) student
scheduling problem, except you need much faster response because
conditions may change often.  Students = patients, faculty = staff,
activities = classes, locations = classrooms.  If this isn't too
simplistic an analogy, you might look for an existing school scheduler
you can modify for your situation.

Ray Allis - Boeing Computer Services - ray@atc.boeing.com
Newsgroups: comp.ai
From: tw@aifh.ed.ac.uk
Newsgroups: comp.ai,ai.seminars,ai.msgs,scot.announce
Subject: Seminar on model-based reasoning/simulation. Edinburgh, 25 Aug
Date: 19 Aug 92 16:19:35 GMT
Reply-To: tw@aifh.ed.ac.uk ()
Organization: Dept AI, Edinburgh University, Scotland


AI Department Seminar at 3pm, Tu 25th August in F10, 80 South Bridge, Edinburgh
                  [please note the unusual time and day]

   Model-based Mechanism Analysis and Simulation for Intelligent CAD

		         Leo Joskowicz	    	
	         IBM T.J. Watson Research Center
       		        P.O. Box 704			
	          Yorktown Heights, NY 10598
         (joint work with Elisha Sacks, Princeton U.)

We present research in automating reasoning about mechanical devices, such
as feeders, door locks, and brakes.  Over the past five years, we have
developed a framework that integrates geometrical and spatial reasoning
with model-based techniques.  We use configuration spaces as the
first-principles paradigm to relate explicitly the structure and the
behavior of a mechanism.  We have shown the utility of this framework by
automating aspects of common engineering tasks, such as analysis,
simulation, mechanism comparison and classification, and design.

This talk will focus on the analysis and simulation program.  The program
performs a kinematic simulation of driving motions and part contacts along
with a limited dynamical simulation of gravity, springs, and friction.  It
produces a realistic, three-dimensional animation and a concise, symbolic
interpretation of the simulation.  It derives the kinematic motion
equations for a large class of mechanisms, including ones with complex part
shapes, varying part contacts, and multiple driving motions.  It avoids
collision detection during simulation by precomputing pairwise part
interactions.  It uses a simple model of dynamics that captures the
steady-state effect of forces without the conceptual and computational cost
of full dynamical simulation.  We demonstrate that the simulation algorithm
captures the workings of most mechanisms by surveying 2500 mechanisms from
an engineering encyclopedia.
Newsgroups: comp.ai
From: volker@ecrc.de (Volker Kuechenhoff)
Subject: Re: Looking for information source about GENET
Reply-To: volker@ecrc.de
Organization: European Computer industry Research Centre GmbH.
Date: Fri, 21 Aug 1992 08:54:31 GMT

In article 26657@galileo.cc.rochester.edu, cwng@troi.cc.rochester.edu (Chuan Wang) writes:
>Hi, can anyone tell me if there is some newsgroup or e-mail information source
>about GENETIC ALGORITHMS and its applications ? I think that there is going to 
>be an international conference of GA some time in 1993, can anyone give me
>some information about that ?
>
>Many thanks in advance,
>
>C.W.


Yes there is the Genetic Algorithms Digest  - distributed via e-mail:
>>
Subject: GA-List v6n28
Genetic Algorithms Digest   Friday, July 31 1992   Volume 6 : Issue 28

 - Send submissions to GA-List@AIC.NRL.NAVY.MIL
 - Send administrative requests to GA-List-Request@AIC.NRL.NAVY.MIL
 - anonymous ftp archive: FTP.AIC.NRL.NAVY.MIL (see v6n5 for details)

Today's Topics:
	- Re: The Evolution Machine; authors' addresses
	- Need info on fitting parameters to set of data
	- GA testing tool request
	- TCGA and ICGA publicity chair change of address
	- AISB'93: Revised Submission Date
<<
It also contains information about conferences:
>>
****************************************************************************

CALENDAR OF GA-RELATED ACTIVITIES: (with GA-List issue reference)

 ECAI 92, 10th European Conference on AI (v5n13)                Aug  3-7,  92
 Parallel Problem Solving from Nature, Brussels, (v5n29)        Sep 28-30, 92
 SAB92, From Animals to Animats, Honolulu (v6n6)                Dec  7-11, 92
 ICNN93, IEEE Intl. Conf. on Neural Networks, Calif (v6n24)     Mar 28-1,  93
 ECML-93, European Conf. on Machine Learning, Vienna (v6n26)	Apr  5-7,  93
 Intl. Conf. on Neural Networks and GAs, Innsbruck (v6n22)      Apr 13-16, 93
 ICGA-93, Fifth Intl. Conf. on GAs, Urbana-Champaign (v6n26)    Jul 17-22, 93

**************************************************************************
<<


---
Volker Kuechenhoff,
European Computer Industry Research Centre      Tel. + (49) 89-92699-155
Arabellastr 17, 8000 Muenchen 81. Germany.	FAX. + (49) 89-92699-170

e-mail   volker@ecrc.de
From: choy@skorpio.usask.ca (I am a terminator.)
Newsgroups: comp.ai
Subject: Re: Eenie meenie
Date: 19 Aug 92 19:54:38 GMT
Article-I.D.: access.1992Aug19.195438.18764
Organization: University of Saskatchewan, Saskatoon, Canada

In article <24804@castle.ed.ac.uk>, cam@castle.ed.ac.uk (Chris Malcolm) writes:
|> In article <1992Aug10.004119.16687@access.usask.ca> choy@skorpio.usask.ca writes:
|> 
|> >How do we make a decision? Why do we choose as we do? A neural net
|> >will make it's decision based on the laws of physics. I think we
|> >do too. .... We do whatever the universe dictates.
|> 
|> Consider a chess-playing computer. In a trivial sense its next move in
|> the game it is playing could be predicted from the laws of physics and
|> a knowledge of its current state. In practice this would take grossly
|> more computing power than is exercised by the device itself, by very
|> many orders of magnitude. It would be much easier to predict it's next
|> move from a listing of the code. And much easier again from a spec of
|> the system and a knowledge of the laws of chess. But even here the
|> unaided computational powers of a human being would be struggling to
|> accomplish this prediction accurately in less than a few decades,
|> although a good guess might be available in a few days.
|> 
|> In other words, whether or not we do as the universe dictates is a
|> rather airy theoretical distinction, since there is no way we can
|> ever find out what the universe has dictated.
|> -- 
|> Chris Malcolm    cam@uk.ac.ed.aifh          +44 (0)31 650 3085
|> Department of Artificial Intelligence,    Edinburgh University
|> 5 Forrest Hill, Edinburgh, EH1 2QL, UK                DoD #205

Some things we do today could not be done before. Maybe we can see
a pattern that the universe has dictated.

Henry Choy
choy@cs.usask.ca
Newsgroups: comp.ai
From: sivand@eng.auburn.edu (Sivand Lakmazaheri)
Subject: RESEARCH ASSISTANT NEEDED 
Reply-To: sivand@eng.auburn.edu
Organization: Auburn University Engineering
Date: Wed, 19 Aug 1992 18:31:55 GMT



                 Research Assistantship Available



Research assistantship is available in the area of computer-aided engineering.
The research involves automating 2D and 3D detailed drawings of structural
systems via the knowledge-based approach.  Knowledge of databases, knowledge-
based systems, and computer-aided design & drafting is necessary.  Working
knowledge of C programming is a must. Knowledge of structural engineering is
helpful but is not necessary. The student is expected to pursue graduate studies
in the area of computer-aided engineering leading to MS or PhD in civil
engineering or a related engineering discipline. The assistantship is available beginning January 1993. To apply send your resume and a copy of your transcript
to:


sivand@eng.auburn.edu

Or

Professor Sivand Lakmazaheri
Civil Engineering Department
238 Harbert Engineering Center
Auburn University, Alabama 36849

 



Newsgroups: comp.ai
From: jefu@nmt.edu (Jeff Putnam)
Subject: looking for article
Organization: The Museum of Differential Geometry
Distribution: na
Date: Sun, 16 Aug 1992 14:20:30 GMT

Some time recently someone posted an article to comp.ai briefly
mentioning the possibility of understanding various modes of
intelligence other than human and the idea of somehow combining
these.  I'd really like a copy of that article, so if anyone
has it available, could they mail it to me?  

thanks


-- 
jefu@jupiter.nmt.edu  -- Jeff Putnam, New Mexico Tech, Socorro, NM
"The whole problem with the world is that fools and fanatics are always
so sure of themselves but wiser people are full of doubts." B. Russel 

Newsgroups: comp.ai,comp.theory.self-org-sys
From: mcdermott-drew@CS.YALE.EDU (Drew McDermott)
Subject: Re: Demon
Keywords: demon
Organization: Yale University, Department of Computer Science
Date: Mon, 17 Aug 1992 14:56:21 GMT


In article <92Aug14.120610edt.300@smoke.cs.toronto.edu>, gh@cs.toronto.edu (Graeme Hirst) writes:
|> In article <1992Aug14.055751.29529@unixg.ubc.ca> xie@unixg.ubc.ca (Linchi Xie) writes:
|> >Can somebody tell me why an attached procedure in AI is called 'demon'?
|> >Who coined the word?
|> 
|> So in AI, an attached procedure is like a little demon that pops up at
|> the right time to look after something; rather a nice metaphor.  I
|> believe Eugene Charniak was the first to use it, in his dissertation,
|> 1972.
|> 
|> -- 
|> \\\\   Graeme Hirst    University of Toronto	Computer Science Department
|> ////   gh@cs.utoronto.ca  /  gh@cs.toronto.edu  /  416-978-8747

I would give credit to Oliver Selfridge, in his "pandemonium" perception
model from about 1959.  See the paper by Selfridge and Neisser in Computers 
and Thought.

						-- Drew McDermott
From: ski@kayak.tc-suns (Chris Kacoroski,none)
Newsgroups: comp.ai
Subject: Info needed on validation of truth maintenance systems
Keywords: verification & validation, truth maintenance
Date: 12 Aug 92 17:52:08 GMT
Reply-To: ski@kayak.tc-suns
Organization: Sun Microsystems

Hi,

I need information (papers, experience, etc.) on methods to 
validate truth maintenance systems.  Thanks for your time.


Cheers,

Chris "ski" Kacoroski	"When we try to pick out anything by itself
ski@atc.boeing.com	 we find it connected to the entire universe"
							John Muir
Newsgroups: comp.ai
From: pedersen@seas.smu.edu (Ted Pedersen)
Subject: Knight's Tour
Organization: SMU School Of Engineering and Applied Science
Distribution: comp.ai,comp.theory
Date: Wed, 12 Aug 1992 19:51:40 GMT



I realize this might be just a little off the topic (but hopefully not too
much). I would very much like to find some source code for the Knight's Tour
problem. This is the problem where you have a lone knight on a chess board and 
the goal is to have your knight visit all of the squares on the board and 
return to his starting place without visiting any square twice. 

I would especially be interested in C source code that solves our knight's
dilema, either from an ftp site, book, etc.        

If anyone knows of any repositories of source code to solve these sorts of
problems (Knights Tour, N-Queens problem, etc.) I would appreciate any tips. 
I generally enjoy these sorts of computing problems so anyone who knows of 
any interesting variations on the Knight's Tour or N-Queens problem etc. 
I would sure like to hear about them. 

Ted Pedersen
From: arao@sdcc13.ucsd.edu (Andy Rao    )
Newsgroups: comp.ai
Subject: genetic algorithims
Keywords: genetic algorithims
Date: 15 Aug 92 16:06:43 GMT

Can anybody shed some light on genetic algorithims?  These are
algorithims that alters themselves to suit a particular problem,
much like how an organism evolves to adapt to a particular
environment.  the subject fascinates me but i am starting at the
bottom......(also, know of any good books on the subject?)
From: arao@sdcc13.ucsd.edu (Andy Rao    )
Newsgroups: comp.ai
Subject: request
Date: 23 Aug 92 06:06:51 GMT

Some time ago, there was some discussion about a AI competition in
which a program would be written that could carry on a conversation
on a certain topic.  judges would have to determine whether they
were talking to the program or a real person.  is the executable
code/source code available for any of these programs? if it is,
please let me know how to go about getting it. thanks.
From: demers@cs.ucsd.edu (David DeMers)
Newsgroups: comp.ai
Subject: Re: boolean satisfiability problem
Date: 18 Aug 92 17:51:29 GMT
Organization: =CSE Dept., U.C. San Diego

In article <Bt5o1q.478@research.canon.oz.au> naylor@research.canon.oz.au (William Naylor) writes:
>I am looking for information on algorithms to solve the
>"boolean satisfiability problem".  What is the largest problem that
>can be solved routinely?  What is the best known algorithm?  
>Any good references?

Cormen, Leiserson & Rivest have a chapter on approximation
algorithms, but don't cover 3-CNF SAT.  You should get
that book anyway though...
Papadimitriou & Steiglitz is another reference.

Hope this is a start; somebody probably will give you
exactly the right answer...


-- 
Dave DeMers			 ddemers@UCSD   demers@cs.ucsd.edu
Computer Science & Engineering	C-014		demers%cs@ucsd.bitnet
UC San Diego					...!ucsd!cs!demers
La Jolla, CA 92093-0114	(619) 534-0688, or -8187, FAX: (619) 534-7029
From: N.Ahmad@cs.ucl.ac.uk (Nesar)
Newsgroups: comp.ai
Subject: Fault Tolerant Software
Date: 18 Aug 92 09:54:20 GMT

Can anyone throw some light on Fault Tolerant Software?
Does it mean tolerance even in case of hardware failure? 
Please elaborate with reference if possible.

Nesar Ahmad,
University College London
From: N.R.Ellis@newcastle.ac.uk (Nigel R Ellis)
Newsgroups: comp.ai
Subject: The Brown NLP Test Corpus
Date: 12 Aug 92 11:30:00 GMT
Organization: AI Systems Group, Durham University, England.

I'm trying to locate the source of the 'Brown Sentence Corpus' which contains 
about 50 English sentences used for testing natural language parsers.  Does
anyone have a copy of the corpus which they could send to me? or the name
of the ftp site from which I can retrieve it.

Thanks,

Nigel R. Ellis.


=============================================================================
| Nigel R Ellis, Artificial Intelligence Group,  | N.R.Ellis@durham.ac.uk   |
| Department of Computer Science, University of  | Phne: +44.91.374.2549    |
| Durham, Durham. England DH1 3LE                | Fax : +44.91.374.3741    |
=============================================================================
Newsgroups: comp.ai
From: shafto@aristotle.ils.nwu.edu (Eric Shafto)
Subject: Re: Cyc
Organization: The Institute for the Learning Sciences
X-Newsreader: Tin 1.1 PL4
Date: Thu, 13 Aug 1992 16:18:45 GMT

mcdermott-drew@CS.YALE.EDU (Drew McDermott) writes:
: 
: 
: I have heard of AI's reputation for hype so often that I am finally moved to 
: ask, just where does this reputation come from?  There are a few famous quotes
: from Herb Simon thirty years ago, and some unfortunate books by Ed Feigenbaum,
: but my impression is that the the bulk of the hype comes from popularizers
: and funding agencies.  I don't see how the field can be blamed for this 
: phenomenon, unless the mere willingness to work on such a flakey area
: is an endorsement of every crazy speculation that anyone has ever indulged in.
: 
: 						-- Drew McDermott

I have an excellent paper by one Drew McDermott of Yale University,
entitled "Artificial intelligence meets natural stupidity."  The
author ascribes this reputation for hype to three tendencies among AI
researchers, namely:  Wishful mnemonics, reliance on natural language
for internal communication and  representation, and the failure to
implement real programs that truly embody the theory (or at least, the
failure to be straightforward about it).

Do you find that the reputation for hype is much larger than can be
explained by these failings among researchers in the field?


--
*Eric Shafto             * The excursion is the same when you go looking  *
*Institute for the       * for your sorrow as when you go looking for     *
*    Learning Sciences   * your joy.                                      *
*Northwestern University *                Eudora Welty, The Wide Net      *
From: luis@cogsci.ed.ac.uk (Luis Pineda)
Newsgroups: comp.ai
Subject: Re: Adriaan de Groot -- recent work?
Date: 21 Aug 92 20:38:12 GMT
Organization: Centre for Cognitive Science, Edinburgh, UK

> I just read an early (1966) article by Adriaan D. de Groot,
> "Perception and memory versus thought: some old ideas and
> recent findings."  Does anyone know of later work by
> him?  Pointers to articles?  An email address?
>
> Thanks in advance.
>
> --------------------------
> -Tom McDougal          mcdougal@cs.uchicago.edu


In Human-Problem Solving (1972), Newell and Simon discuss de Groot's 
findings, as well as their own version of similar experiments. 
See, in particular, the section on the perceptual aspects of chess 
analysis at the end of chapter 13. I don't know of any further
research and I would be very interested in more information too.

Thanks in advance

-Luis Pineda
luis@cogsci.ed.ac.uk
Newsgroups: comp.ai.shells
From: robert@ctpm.uq.oz.au (Robert Merlicek)
Subject: email address of Neuron Data?
Organization: Centre for Language Teaching and Research, Uni of Queensland, AUSTRALIA.
Date: Wed, 19 Aug 1992 22:48:37 GMT

I would like to  get in contact with people using the Expert system 
Nexpert Object or someone from Neuron Data who could help me with 
a expert system shell decision.
Can anyone help?

Thanks in advance
Robert


--
*******************************************************************************
*  Robert Merlicek            * "Mans mind once streched by a new idea        *
*  robert@pest.ctpm.uq.oz.au  *  never reagins it's original dimensions" -OWH *
*******************************************************************************
Newsgroups: comp.ai.shells
From: yil@engr.ucf.edu (Yilmaz Cengeloglu)
Subject: HELP: Automated Air Traffic Controlling and Blackboard System
Organization: engineering, University of Central Florida, Orlando
Date: Fri, 14 Aug 1992 18:25:13 GMT



Hi :

I have asked help about Blackboard Architecture couple of months ago.
I have received some responses. Thanks to everyone who helped me. I have
the list of several references related with BBA. If any anyone needs please 
let me know. 

Currently I am still working on my project for my thesis and I neen some more
help. I am explaining what I need first. If you are interested what I am doing
you can continue to read after line. 

I will write simple knowledge bases to solve the conflict and other problems that
occurs at airspace. I do need some help to complete this project and graduate.

	If you know any publication related with
			- Automated Air Traffic Controlling,
			- books that I can get expertise to write knowledge bases       
			  to solve the problems at airspace.
			- Blackbard Systems AND Air Traffic Controlling. 

 	 please let me know. I will keep all information that I will receive
         and I will send anyone request later. 
											  

	  If you know any existing system, project, company related with
	  Automated Air traffic controlling, please let me know. It will
	  be very helpful for my project.

				                           Yilmaz Cengeloglu
				                           Univ. of Central Florida
							   Dept. of Computer Eng. 
							   Orlando, FL    

				                           yilmaz@ists.engr.ucf.edu
							          or
							   yil@engr.ucf.edu


---------------------------------------------------------------------------------

I am preparing prototype Automated Air Traffic Controlling (A-ATC) system to 
prepare and test knowledge bases for each plane in the airspace. I did need a Blackboard
shell for my project. Only commercial system that I found was GBB that marketed by 

Blackboard Technology Group, Inc.;
401 Main St., Amherst, MA  01002, 413/256-8990,
fax: 413/256-3179.

Their price was too high for me to buy as a graduate Student. I have implemented my 
own Blackboard System on SunOS operating system. ( I am not really sure if I should
call Blackboard System.) Different knowledge bases in CLIPS working as a different 
process on the background and uses Blackboard when it is necessary to share fact with 
other knowledge sources. Of course, any other process in C, C++, etc can access the
Blackboard. The type of architecture is easy to distribute more than one computer
using computers networks. If I would continue the project after I got my M.S.
I am still testing it.  

Also, I did implemented a Radar Simulator Using C/C++, X-Windows and IPC facilities
on the SunOS operating system.  Radar simulator is being used by Intelligent Simulation
and Training systems Project at UCF.

A-ATC project is integration of Radar Simulator and Blackboard System.