HDTenEightyP/NetNews huggingface dataset:
From: mdb1@cam.eng.ac.uk
Subject: Great to see a fuzzy newsgroup, finally.
Keywords: hello
Organization: Cambridge University Engineering Department.
Date: Tue, 12 Jan 1993 18:31:47 GMT


It's great to see a fuzzy newsgroup.

I'm working on trying to connect neural network learning
algorithms with fuzzy control applications. Also looking
at amorphous silicon implementation of a neural network
(which has nothing to do with fuzzy stuff!)

Good luck to all you researchers out there.

Malcolm Binns.
Department of Engineering,
Cambridge University,
Trumpington Street,
Cambridge,
CB2 1PZ,
From: barash@umbc3.umbc.edu (Mr. Steven Barash)
Newsgroups: comp.ai.fuzzy
Subject: Re: Somehow, it Seems Appropiate...
Date: 12 Jan 1993 23:34:24 -0500
Organization: University of Maryland, Baltimore County Campus
NNTP-Posting-Host: umbc4.umbc.edu

In article <1ivnn0INNe91@zaphod.mps.ohio-state.edu> dicks@math.ohio-state.edu (Ethan Dicks) writes:
>In article <80-3cgm@rpi.edu> petitc@nuge115.its.rpi.edu (Christopher Jon Petit) writes:
>>For some reason, I'm NOT encouraged to hear that 'Fuzzy' logic is being
>>used to focus pictures in cameras.  :&)
>
>This attitude is why, although the Japanese are snapping up anything with
>fuzzy anything, the term and the products incorporating the concept are
>not doing too well in the U.S.
>
>-ethan

Consumer Reports did an article on camcorders a year or so ago (March 92?)
and they reported that the ones using fuzzy logic (e.g. Fisher) consistently 
had the most difficulty focusing correctly.


+--------------------------------------------------------------------------+
|	Steve Barash		  	    |	barash@umbc4.umbc.edu	   |
+--------------------------------------------------------------------------+

Newsgroups: comp.ai,comp.compilers
From: purtilo@cs.umd.edu (Jim Purtilo)
Subject: Re: Different Strokes for Different Folks (Was: Assessing a language)
Reply-To: purtilo@cs.umd.edu (Jim Purtilo)
Organization: U of Maryland, Dept. of Computer Science, Coll. Pk., MD 20742
Date: Thu, 7 Jan 1993 15:52:28 GMT
Followup-To: comp.ai
Keywords: design

eifrig@beanworld.cs.jhu.edu (Jonathan Eifrig) writes:
>         Surprisingly, there hasn't been much work in developing
> heterogenous programming environments, to support a sort of "mix and
> match" approach to programming.  Such tools would go a long way to
> alleviating the language holy wars, I think.

Just a point of information, Jack -- there has been quite a lot of work
done on mixed language programming, also support for heterogenous
platforms.  (Or perhaps we have different thresholds for achieving "lots",
so please don't take this as a flame.)  Some folks down at U Arizona
produced a system for mixed language programming (called it MLP), written
up in TSE and saw some distribution; U Washington folks have a long
history of producing good work in the area, written up in several places
(though I don't know how wide is the availability of that work); and over
the years we have produced our own demonstration systems of how folks can
easily do mixed language programming on diverse platforms (based on the
"software bus" organization I cooked up back in the early 80's in a long
forgotten PhD thesis), also the subject of several journal papers.  There
are others in the field too.

Now, it could be pointed out that some of the results have not had much
impact in state of the practice, and to a great extent that is true.  When
I tell new users that they can write programs in multiple languages, and
hence feel free to "use the right tool for the job", then truly the most
common reaction I get is "but what do I want to say?"  It takes some
education about the context of use for people to really get used to taking
advantage of these capabilities.  But such systems are out there, freely
available, and with real users.

This is also the subject of much current funding/research, for example, we
have support from DARPA to continue our work on software bus formalisms
(in particular, showing how to interconnect truly funky languages, for
purposes of rapid prototyping) --- moreover, support for interconnection
technology is supposedly a key component in [ugh, forgive me for saying
such a terrible buzz word here] "megaprogramming".

Cheers,
Jim
-- 
Send compilers articles to compilers@iecc.cambridge.ma.us or
{ima | spdcc | world}!iecc!compilers.  Meta-mail to compilers-request.
From: christen@astro.ocis.temple.edu (Carl Christensen)
Newsgroups: comp.ai
Subject: Re: FESA, Fully Employed Students Association
Date: 6 Jan 93 19:04:02 GMT
Organization: Temple University
X-Newsreader: TIN [version 1.1 PL8]

mcclanah@dlgeo.cr.usgs.gov wrote:
:  (stuff deleted) ...some university for 4 or 5 years and work on a degree
: (and before I get flamed - I raealize that a lot of people have
: done exactly that and they have sacrificed a great deal in order
: to get their degree.  Why can't we have both???).

Well, as one who quit his job in order to go after a Ph.D. full-time, you're
not going to like my response!  ;)

I think that the reason the Ph.D. is traditionally a full-time pursuit is that
the level of intensity involved in research and in working with faculty is
such that you cannot do it in the evenings a few times a week.
Especially in AI, where things are changing and being discovered constantly.
You really need to be able to work with profs, other students, read journals,
and attend seminars on different topics of interest.

Also, and maybe even more important to schools, a part-time Ph.D. would
take a long time.  Even full-time, some people take over 5 years to complete
their Ph.D.  So part-time could be on the order of 10+ years on the average!
Most schools have a 10 year maximum for Ph.D. work 'built-in' to the
rules of the college (not just the Comp Sci department).
And the nature of the work is so different than taking a night
class, it may be hard to define what part-time work would be at the doctoral
level.  Plus, who wants to punish themselves for that long! :)

One question I would like to ask comp.ai readers is does anyone work for
a company that would allow a 'Ph.D. Sabbatical'?  Or a company that lets
the employee put in two or three days of work a week, and then work on
the Ph.D. program the other days.  Of course, it would be nice if they 
paid for school, also.  Since I think the most important thing in a Ph.D.
program is to have access to an active campus/faculty and facilities, I'm
wondering if anyone has done this.  Since my T/A duties require 20 hours
of week anyway, I would think someone could work two or three days a week
at their company, and be on campus the other days.

Well, good luck on your search!  I don't know if you have an M.S. yet,
but that may be a good place to start, and most schools have a night-time
M.S.C.S. program.  Depending on the school, you can usually take some
AI and/or AI-related electives as well.

----
Carl Christensen
Newsgroups: comp.ai
From: acgoldis@athena.mit.edu (Andrew C Goldish)
Subject: List of AI graduate schools
Organization: Massachusetts Institute of Technology
Date: Mon, 4 Jan 1993 20:16:33 GMT

  Thanks for all the suggestions as to where one can find lists of good AI
graduate schools.  To sum it all up, most of the good AI schools can be found in
the FAQ list, section 1-10 (or thereabouts).  It includes most of the schools
suggested by the other newsgroup subscribers, but primarily discusses those in
the United States and Canada.  If one wants to go outside this region, there are
several recommended schools in Europe (Leuven, Cambridge, etc.).  

						A. Goldish
 
Newsgroups: comp.ai
From: guyyalif@phoenix.Princeton.EDU (Guy Udassin Yalif)
Subject: Object Pattern Matching in CLIPS
Originator: news@nimaster
Organization: Princeton University
Distribution: comp.ai,comp.ai.edu,comp.ai.shells
Date: Tue, 5 Jan 1993 02:40:29 GMT

Newsgroups: comp.ai
From: derder@imag.imag.fr (Adel Derder)
Subject: AI Tools
Followup-To: comp.ai
Organization: Lab. TIM3 - Inst. IMAG,  Grenoble
Date: Wed, 6 Jan 1993 08:50:03 GMT

Hi,

I'm looking for some AI Tools, including inference engines, written in C or
C++.
I'm actually working on a project whose aim is to build a software
including
a rule based expert system. This software must be written in C or C++, and
AI tools (public software) in C or C++ will be of interest.

Thanks in advance,

Adel
Newsgroups: comp.ai
From: hall@aplcenmp.apl.jhu.edu (Marty Hall)
Subject: Re: Admissible Heuristic help
Organization: AAI Corp AI Lab, JHU P/T CS Faculty
Distribution: na
Date: Mon, 4 Jan 1993 17:11:53 GMT

dcohen@paul.rutgers.edu (Dawn Myfanwy Cohen) writes:
>(Jason Leigh) writes:
>
>> If any one can give me a definition, I'd really appreciate it, i.e. what
>> does and does not make a heuristic admissible.  And if you know of a book
>> where I can find this in, I'd like to know too.
>
>see Nilsson, Principles of Artificial Intelligence, 1980, p.76.
>
>"Let us say  that a search algorithm is  admissible if [first solution
found is an optimal one]

Well, I have always maintained a distinction between an admissible algorithm
and an admissible heuristic, although I'm not sure if this is normal usage.
I've always used "Admissible Heuristic" to mean a heuristic for which A* is 
admissible, ie one that is always non-overestimating and yields 0 for 
solution nodes.

Search references that I like that probably discuss this are Pearl's 
_Heuristics_, and Kanal and Kumar's  _Search in Artificial Intelligence_, 
esp Chapter 8, "Optimal Path Finding Algorithms" by Rich Korf.

						- Marty
------------------------------------------------------
hall@aplcen.apl.jhu.edu, hall%aplcen@jhunix.bitnet, ..uunet!aplcen!hall
Artificial Intelligence Lab, AAI Corp, PO Box 126, Hunt Valley, MD 21030

(proclaim '(inline skates))
---
From: dhj@adl.dmt.csiro.au (Dennis Jarvis)
Newsgroups: comp.ai
Subject: truth maintenance
Keywords: truth maintenance, scheduling
Date: 6 Jan 93 23:25:31 GMT
Organization: CSIRO Division of Manufacturing Technology, Adelaide, Australia

I am looking for references to work which has used truth maintenance systems
in the solution of scheduling problems. Applications in manufacturing would be
a bonus ... I am interested in using a TMS to provide explanations / detect
constraint violations for an interactive scheduling environment.
If there is sufficient interest, I will post a summary.
-----------------------------------------------------------------------------
Dennis Jarvis,		CSIRO Division of Manufacturing Technology,
			PO Box 4, Woodville, South Australia 5011, Australia.
PHONE: +61 8 268 0156
FAX  : +61 8 268 6757   Internet  : dhj@adl.dmt.csiro.au
From: Benedict.M.Wightman@cm.cf.ac.uk (B M Wightman)
Newsgroups: comp.ai
Subject: Re: Lewis Carroll
Date: 5 Jan 93 10:47:15 GMT
Organization: University of Wales College of Cardiff

In article <16B4C9EBF.KGODDEN@cmsa.gmr.com> KGODDEN@cmsa.gmr.com writes:
>I just found the following reference in a library search, anyone know what it
>is the LC did for AI? (!)
>
>TI:  CARROLL,LEWIS CONTRIBUTIONS TO ARTIFICIAL INTELLIGENCE
>AU:  OKASHAH, L. A.
>OS:  UNIV CENT FLORIDA,DEPT IND ENGN/ORLANDO//FL/3281
>JL:  COMPUTERS & INDUSTRIAL ENGINEERING
>IS:  VOL. 23, NO. 1-4, PP. 377-380         NOV 1992

Provided a lot of populist authors writing cunningly disguised Boring Academic
Books with quotes for chapter headings. They (Hofstatder (sp?) et al) seem to
think this makes them instantly a)witty and b)right.
--
+----------------------------------------------------------------------+
| Benedict.M.Wightman@cm.cf.ac.uk / COMMA,Senghenydd Rd.,Cardiff,Wales |
|        PhD Student in Meddling In Things I Do Not Understand         |
|                 "I'm not aware of too many things,                   |
|           But I know what I know if you know what I mean"            |
+----------------------------------------------------------------------+
| Disclaimer: Everything you have ever been told is wrong. So is this. |
+----------------------------------------------------------------------+
From: christen@astro.ocis.temple.edu (Carl Christensen)
Newsgroups: comp.ai
Subject: Re: FESA, Fully Employed Students Association
Date: 5 Jan 93 22:00:51 GMT
Distribution: na
Organization: Temple University
X-Newsreader: TIN [version 1.1 PL8]

At Temple University in Philadelphia there are two evening class times:
one at 4:40 and one at 7:25 PM.  Classes last 2 1/2 hours and each
class meets once per week.  

From students I have talked with who work full-time their employers
don't seem to mind letting them leave early once a week for class.  I
suppose they make up the time in other ways.  

I guess this isn't much help, but good luck in straightening this out.

----
Carl Christensen
Newsgroups: comp.ai
From: clin@eng.umd.edu (Charles Lin)
Subject: Natural language newsgroup
Date: Wed, 06 Jan 93 20:54:01 GMT
Organization: College of Engineering, Maryversity von Uniland, College Park
Originator: clin@feedback.eng.umd.edu


    I have recently returned from the holidays.   As I mentioned a month ago,
I was interested in helping to set up an unmoderated group related to
natural language.   Right now, I am waiting for a reply from someone else
who wanted to set up a newsgroup that dealt with natural languages and neural
networks.   Because there was a person who wanted some systematic way
of naming these two groups, the name for the natural language group
is still uncertain.  I think it will be comp.ai.nat-language.   The idea
will be discuss any topics relating to natural languages as an AI discipline.

    This would involve natural language understanding and translation, and
possibly extend to speech recognition.   If someone would send me the procedure
for forming a newsgroup, I would appreciate it.   I know that it involves
two steps.  The first is a request for discussion (RFD) which is supposed
to last a month, followed by a call for votes (CFV), which also lasts
about a month.   The request would be sent to all relevant newsgroups, and
so I would also need suggestions as to which newsgroups should receive
this information.   In addition, I suppose I need to contact the person
"in charge" of newsgroups.

--
Charles Lin
clin@eng.umd.edu
Newsgroups: comp.ai,comp.ai.philosophy
From: mgmam@uxa.ecn.bgu.edu (Mark A. Morrell)
Subject: Re: discussion with Penrose
Organization: Educational Computing Network
Date: Thu, 7 Jan 1993 01:18:25 GMT


If what you are trying to do with your lookup table is make it smaller,
try this on for size:

The lookup table has access to past, present, and future, so it can be
limited only to the questions which will be asked it.  If you argue that
you may change your questions, thus moving from the sphere of the tables
knowledge, then you are invalidating the whole past, present, future
thing any way.
-- 
--------------------------------------------------------------------
Mark A. Morrell     Disclaimer:  _I_ probably don't even believe it.
Literary Reference:  The introduction to Cervantes' Don Quixote.
From: KGODDEN@cmsa.gmr.com
Newsgroups: comp.ai
Subject: Lewis Carroll
Date: 4 Jan 93 16:17:19 GMT
Organization: GM Research Labs

I just found the following reference in a library search, anyone know what it
is the LC did for AI? (!)

TI:  CARROLL,LEWIS CONTRIBUTIONS TO ARTIFICIAL INTELLIGENCE
AU:  OKASHAH, L. A.
OS:  UNIV CENT FLORIDA,DEPT IND ENGN/ORLANDO//FL/3281
JL:  COMPUTERS & INDUSTRIAL ENGINEERING
IS:  VOL. 23, NO. 1-4, PP. 377-380         NOV 1992

-Kurt
---------------
"I distrust a research person who is always obviously busy on a task."
-Robert A. Frosch, VP, GM Research


Newsgroups: comp.ai
From: dalk@login.dkuug.dk (Lars Kalsen)
Subject: Expert system for credit Verifications
Organization: DKnet
Date: Tue, 12 Jan 1993 20:25:08 GMT

Hi,

Does anyone have information about an expert system that can be used
for credit verification of customers ?. If you have either seen or
heard about one or have seen descriptions in articles then please
E-mail me with references - or eventually fax me the article.


Greeting from Denmark

Lars Kalsen


-------------------------------------------------------------------------------
Lars Kalsen, MIS-Manager
SONOFON, Skelagervej 1, 9000 Aalborg, Denmark
+45-99-367000 (tel), +45-99-367070 (fax), E-Mail : dalk@login.dkuug.dk
-------------------------------------------------------------------------------
SONOFON is the private operator in Denmark on     =============================
the new European digital cellular GSM-Network     =============================
===============================================================================
Newsgroups: comp.ai.philosophy
From: pindor@gpu.utcs.utoronto.ca (Andrzej Pindor)
Subject: Re: grounding and the entity/environment boundary
Organization: UTCS Public Access
Date: Tue, 5 Jan 1993 18:26:42 GMT

In article <C0CHsG.557@spss.com> markrose@spss.com (Mark Rosenfelder) writes:
...
>
>I don't agree.  All of your mature thinking depends heavily on the huge mass
>of information about the world acquired during those first few years.
>
Right, but it also depends on the way this huge mass of information is
conceptualized. One person growing up in poverty may turn out Democrat and
another - a Republican.

>But go ahead, explain color to a blind man, or sex to a virgin, or poverty
>to a Republican, so that they know what you're talking about as well as you
>do, using language alone.  Good luck...
>
But using language one can influence a conceptualization of the existing
information (Idealized Cognitive Model, in the language of Lakoff, applied to
make sense of the information). After all it does happen (admittedly very
rarely) that people change their views as a result of a discussion.
...
>Nonsense.  The job of the top chess programs is to play chess, and they do
>it very well; are they grounded?  Obviously the job has to have something to 

Are you saying that these programs (or rather processe present when the
programs are running) are less grounded w.r.t. chess than human players?
Why so?

>do with tasks for which humans need to be grounded-- and even there effective
>performance is no proof; a computer might be able to execute those tasks
>in a different way, without needing to be grounded at all.
>
How would one define grounding to make the above statement true?

....
>An AI that could do well in a debate would be quite interesting; but debating
>is a small subset of human experience, and one which panders to the skills
>computers can be most easily given, such as memory and logic.  As for whether
>debating tests grounding, I would think that a few months' experience with
>Usenet would suffice to demonstrate that the ability to dominate a debate
>has little to do with knowing what one is talking about.

Of course there are people who are good at 'mouthing' and nothing else, but
if you are talking about abstract concepts a Turing type test is an only way
of testing grounding (may be you know another one, I'll be very glad to learn).
In case of practical concepts you might want to resort to a practical test:
You claim that you know so much about cars and how they work, fix my car!
However, just as one can sometimes solve a math problem without quite
understanding concepts involved, one can sometimes fix a car without 
understanding how it really works. There is no fool-proof test of grounding 
(or anything else, by that matter).

Andrzej Pindor
-- 
Andrzej Pindor
University of Toronto
Computing Services
pindor@gpu.utcs.utoronto.ca
From: forbis@stein.u.washington.edu (Gary Forbis)
Newsgroups: comp.ai.philosophy
Subject: Re: The Humongous Look-up Table revisited.
Date: 6 Jan 93 02:56:14 GMT
Article-I.D.: shelley.1idhoeINNg97
Organization: University of Washington, Seattle
NNTP-Posting-Host: stein.u.washington.edu

In article <1993Jan5.125834.18984@oracorp.com> daryl@oracorp.com (Daryl McCullough) writes:
>forbis@stein.u.washington.edu (Gary Forbis) writes:
>
>>Today (not yesterday and maybe not tomorrow), I believe behavior isn't 
>>sufficient to determine intelligence. I base this believe on my image of 
>>an HLT which serendipitouslly passes the Turing Test even though its output 
>>is not causally connected to the input.
>
>I'm not sure what you mean by "serendipitouslly". Do you mean that a
>HLT can pass the Turing Test by chance?  That is certainly a
>possibility, but as the length of the test (and its complexity) grows,
>the chances of such accidental passing should go to zero.

I think the possibility approaches zero but remains non-zero. 

By "serendipitiously" I mean the HLT is not created but exists, and it passes
the test by chance alone.

The normal HLT looks like:

       s(t)     := state at time t
       i(t)     := input at time t
       o(t)     := output at time t
       S(s1,i1) := state function for state s1, input i1
       O(s1,i1) := output function for state s1, input i1
       o(t)   = O(s(t),i(t))
       s(t+1) = S(s(t),i(t))

There is another table O'(t) that produces the same output.  There is no
behavioral way to tell O and O' appart and O' does not depend upon the input.
How does one go about assigning a probability for tested tables to be of 
type O or type O'?  Unless one assumes a causal link one is at a loss and
yet isn't that what the TT is supposed to be testing?  I suppose one could
assume that given any particular table the probability that it will produce
output o at time t is related to the number of possible outputs at time t, but
in reality the probability is related to the specific table chosen.  Once 
tested i(t) is fixed, it cannot be changed by any further testing in as much as
that would involve changing history (if one allows i(t) to change one presumes
one is testing a table rather than a human and this violates the spirit of the
test.)  Until i(t) is produced o(t) cannot be determined.

Still, I'm happier believing any entity passing the TT is equivalent to an
HLT of type O and I suspect any one attempting to create TT passing entity
will attempt to create one equivalent to an HLT of type O.

>Daryl McCullough
>ORA Corp.
>Ithaca, NY

--gary forbis@u.washington.edu
Newsgroups: comp.ai.philosophy
From: amdavi@cs.wm.edu (Alexander M. Davis)
Subject: Re: Colbys-Weizenbaum and Overcoming Depression 2.0
Organization: The College of William and Mary
Date: Mon, 11 Jan 1993 00:24:07 GMT

Disclaimer: I haven't got a clue what I'm talking about. I haven't
read the criticism in question, only the post to this newsgroup.

While there may be some dispute over the morality of a psychoanalytic
system lacking the human "I," it seems to be largely irrelevant. Much
of psychoanalysis falls under rule-based systems, mirroring the
education on which this analysis is founded: study of case histories,
patterns of behavior, and systematic methods of treatment found to
have been effective in the past. This may be a simplistic nutshell,
but it highlights the misguidedness of targeting the "I." An analyst
could very well treat a patient, completely successfully, by applying
a set of symptom conditions to identify abnormalities (etc.) and then
a treatment shown statistically to be effective. The analyst's modes
of recall of these rules may differ from a computer's, but the two
systems can both be based on an identical canon.

So what makes the computer and human different, in terms of the "I?"
Unless one is a proponent of a human being's innate and nonacademic
knowledge of psychoanalysis, this course of criticism is an attack on
both. 


- from the unattended terminal of
Alex Davis
amdavi@cs.wm.edu
From: ucacgcj@ucl.ac.uk (Gordon C Joly)
Newsgroups: comp.ai.philosophy
Subject: Re: Colbys-Weizenbaum and Overcoming Depression 2.0
Date: 11 Jan 93 15:43:34 GMT
Organization: Bloomsbury Computing Consortium


I would mention R. D. Laing, but I won't since this
is comp.ai.philosophy :-)

El Gordo.
Newsgroups: comp.ai.philosophy