HDTenEightyP/NetNews huggingface dataset:
From: jakobs@utrurt.uni-trier.de (Oliver Jakobs)
Subject: Re: Computer writes a book?
Organization: University of Trier
Date: Tue, 26 Jan 1993 10:22:59 GMT

In <74AXBPTT@cc.swarthmore.edu> behrens@cc.swarthmore.edu (Eric Behrens) writes:

>But music has only a dozen words in its vocabulary (notes of the scale) and
>the English language has tens of thousands.  I cannot believe that computer
>science is capable of replicating the intricate constructions of language.

I'd say the analogy is not of the right order. I've heard that scales are
more like phonemes or letters, and that there are groups or patterns of
scales which could be regarded as ``words of music''. There has been done
some work trying to apply linguistic knowledge to musical ``texts''. I don't
remember the scientist's name, but I could look up some references if someone
was interested.

Oliver


-- 
Oliver Jakobs, Dept. of Computational Linguistics, Trier University, Germany
|                Internet: jakobs@ldv01@Uni-Trier.de                       |
+--------------------------------------------------------------------------+
Newsgroups: comp.ai
From: naylor@research.canon.oz.au (William Naylor)
Subject: simulated annealing question
Organization: Canon Information Systems Research Australia
Date: Wed, 27 Jan 1993 00:52:25 GMT

I am trying to minimize a real-valued function of about 50-500 real-valued
variables.  My function seems to have an exponential number of local minima,
so I have been trying to adapt SIMULATED ANNEALING to work on functions of
continuous variables.  Classically, simulated annealing [1] is designed to
work on discrete functions, with discrete domains.

Has anybody out there successfully used simulated annealing 
on continuous functions with continuous domains?  I would appreciate 
any advice, especially with references.  

Please respond by e-mail, I'll post a summary.


REFERENCES

[1]  Kirkpatrick S., Gelatt C. D., and Vecchi M. P.: "Optimization by
     Simulated Annealing", Science 1983, #220, pages 671-680.



-- 
Will Naylor               net:  naylor@research.canon.oz.au
                          mail: Canon Information Systems Research Australia  
phone: (61-2) 805-2921          P.O. Box 313 North Ryde, NSW 2113 
fax:   (61-2) 805-2929          Australia
Newsgroups: comp.ai
From: yang@milton.cs.uiuc.edu (Der-Shung Yang)
Subject: English vs contents (was Re: New Problems in IJCAI Reviewing) 
Organization: University of Illinois, Dept. of Comp. Sci., Urbana, IL
Date: Fri, 22 Jan 1993 18:36:45 GMT

gh@cs.toronto.edu (Graeme Hirst) writes:

>  (2)  Not always the author.  Trying to be helpful, in one review in
>which I rejected a paper, I pointed out a number of consistent errors of
>English made by the author, a non-native speaker.  A year later, a
>revised version of the paper was sent for review by a different journal;
>it contained the exact same errors.

Just curious, did you reject that paper mainly becuase of some consistent
English errors or because of some other reasons?  Also, what will you do
if you review a paper that is excellent in contents but has some English
errors here and there (assuming that those English errors do not cause
any misunderstanding or unclearness)?

--
DerShung Yang    
yang@cs.uiuc.edu 
Beckman Institute
Univ. of Illinois at Urbana-Champaign
From: news@eu.net (news)
Newsgroups: comp.ai
Subject: TEST
Keywords: TEST
Date: 26 Jan 93 12:27:35 GMT
Organization: European Unix systems User Group


afsvkjdf
From: yip-ken@cs.yale.edu (ken yip)
Newsgroups: comp.ai
Subject: Re: New Problems in IJCAI Reviewing (long)
Date: 21 Jan 1993 17:10:29 -0500
Organization: Yale University Computer Science Dept., New Haven, CT 06520-2158
Distribution: na
NNTP-Posting-Host: australia.ai.cs.yale.edu


I am not for or against the present IJCAI reviewing process. 
But I am curious to know if anyone knows of a paper (by insiders or outsiders)  
rejected by IJCAI or AAAI that turns out to be highly significant.
With the general perception that the quality of papers is declining,
would it be the case that changes in the review process like the one
being discussed add only small perturbation to the pool of contributions with
marginal values?
Xref: sparky comp.ai:5047 rec.arts.books:26428 misc.writing:4296 rec.arts.int-fiction:1293
From: gbutulis@desire.wright.edu
Newsgroups: comp.ai,rec.arts.books,misc.writing,rec.arts.int-fiction
Subject: The language of music
Date: 26 Jan 93 16:34:27 GMT
Organization: Wright State University

In article <jakobs.728043779@utrurt>, jakobs@utrurt.uni-trier.de (Oliver Jakobs) writes:
> In <74AXBPTT@cc.swarthmore.edu> behrens@cc.swarthmore.edu (Eric Behrens) writes:
> 
>>But music has only a dozen words in its vocabulary (notes of the scale) and
>>the English language has tens of thousands.  I cannot believe that computer
>>science is capable of replicating the intricate constructions of language.
> 
> I'd say the analogy is not of the right order. I've heard that scales are
> more like phonemes or letters, and that there are groups or patterns of
> scales which could be regarded as ``words of music''. There has been done
> some work trying to apply linguistic knowledge to musical ``texts''. I don't
> remember the scientist's name, but I could look up some references if someone
> was interested.
> 
> Oliver
> 
> 
> -- 
> Oliver Jakobs, Dept. of Computational Linguistics, Trier University, Germany
> |                Internet: jakobs@ldv01@Uni-Trier.de                       |
> +--------------------------------------------------------------------------+

	Indeed, I would consider notes to be much more synonymous to the
letters of the musical vocabulary.  Patterns of such notes, then, could be
the words of the musical language.  Finally, phrases (groups of music, usually
in 4 or 8 bars) are the musical sentances.
	Although modern music has very few rules for composition, music has in
the past (especially in the Baroque era) had much definition for what was
'acceptable' and what was not (I am pulling this and my musical analogies from
my memory of a course I took in my freshman year specifically on how Mozart 
influenced the development of western music).
	Regarding Mozart's style, the rules could fill many pages (about 300,
if I remember).  Example: A nota cambiata, a 'word' which consists of going
up one step, down one, down another, up one, and back up to the original tone.
However, the rules govern which beat this may begin on (only the first or 
third), how the counterpoint must be written, and that the nc must end in 
consonance (major 3rd or major 5th) from the lowest note of the bass voice
(I'm not sure if these rules are exactly correct, as that course is long in
the past; I am using this as an exanmple).  This is simply one word out of
several hundred, with rules governing how they may be strung together, too.
	Although I think the definition for Mozart's style may be a bit more
straightforward than those for the English language (I believe it would be
slightly easier to know what 'makes sense' in the musical vocabulary), it is
no small feat to copy the style of a composer.  Inductively, I don't know how
hard it would be to copy the style of an author (not beyond the realm of
possibility, though).

-Garrett Butulis
 Undergraduate EE/music
 Wright State University, Dayton, OH.
Xref: sparky comp.ai:5028 rec.arts.books:26367 misc.writing:4279 rec.arts.int-fiction:1284
From: js@montaigne.lif.icnet.uk (Jack Shirazi <js@biu.icnet.uk>)
Newsgroups: comp.ai,rec.arts.books,misc.writing,rec.arts.int-fiction
Subject: Re: Computer writes a book?
Date: 26 Jan 1993 17:28:51 -0000
Organization: Imperial Cancer Research Fund
NNTP-Posting-Host: montaigne.lif.icnet.uk

In article <1993Jan25.163029.1901@seas.smu.edu> pedersen@seas.smu.edu (Ted Pedersen) writes:
>>I saw the following in the Books column (by Olin Chism) of the Dallas
>Morning News Sunday January 24, 1993. Copied without permission. It
>concerns a computer program that allegedly wrote a book in the style
>of Jacqueline Susann. 
>
>I think this is a stunt. I don't really believe a computer program
>wrote this book. However, if anyone has any information about this
>book or the author that would give this some credibility I would like
>to hear about it. Comment on the general idea would be interesting as
>well. I don't think the idea itself is impossible, it just seems like
>this case is a little far fetched. 

Markov chaining using a mixture of sentences and words, or possibly 
just with words, using a parser to get rid of any unlikely combinations.
Probably added in the use of a style checker.
-- 
       Jack               js@biu.icnet.uk
                         
If you only have a hammer, you tend to see every problem as a nail.
                -- Maslow
Newsgroups: comp.ai,comp.lang.scheme.c
From: kjain@lotus.com (Kamal Jain)
Subject: Looking for a lexicon
Keywords: lexicon dictionary spelling grammar
Organization: Lotus Development Corp.
Date: Sun, 24 Jan 93 22:37:05 GMT

Hello,

I'm looking for an electronic compilation of English language words,
similar to a dictionary or thesaurus, but containing only word part of
speech instead of definitions.  This is to be used in an English-
language parsing program (written in Scheme).

Any pointers to ftp sites or distribution via floppy would be greatly
appreciated.  This is for a friend who has discovered that manually
keying-in the English language was a tad time consuming.

A simple ASCII file is preferrable, but any source can be accomodated,
provided it is not copyrighted.  E-mail replies are preferred, but I
will check these groups.

Thanks in advance,

- kamal
-- 
Kamal Jain, Information Systems & Support - Production Control Coordinator
Lotus Development Corporation, 55 Cambridge Parkway, Cambridge, MA 02142
uucp: kjain@lotus.com  voice: +617 693 8581  fax: +617 693 1185
From: heller@rosie.uh.edu (And thanks for all the fish)
Newsgroups: comp.ai
Subject: Re: CFP - KB planning, scheduling and control
Date: 21 Jan 1993 14:18 CST
Organization: University of Houston
Distribution: world
NNTP-Posting-Host: rosie.uh.edu
News-Software: VAX/VMS VNEWS 1.41    

> For sure, it is a silly question, but what is Tabu search ?
> Can anyone give me a (some) basic reference on this technique...

Here's more than a start:

U. Faigle and W. Kern, Some Convergence Results for Probabilistic Tabu Search,
ORSA Journal on Computing, 4, 32-37, (1992).

A.F. Glover , Tabu Search - Part I, ORSA Journal on Computing, 1, (1989)

F. Glover and M. Laguna, Tabu Search, A Chapter in Modern Heuristic Techniques
for Combinatorial Problems, (1992)

F. Glover and H.J. Greenberg, New Approaches for Heuristic Search: A Bilateral
Linkage With Artificial Intelligence, European Journal of Operations Research,
39, 119-130, (1989)

J. Skorin-Kapov, Tabu Search Applied to the Quadratic Assignment Problem", ORSA
Journal on Computing, 2, 33-45, (1990)

D. de Werra and A. Hertz, Tabu Search Techniques: A Tutorial and an Application
to Neural Networks, OR Spektrum, 11,131-141, (1989)
Xref: sparky comp.ai:5027 rec.arts.books:26366 misc.writing:4278 rec.arts.int-fiction:1283
From: echristo@magnus.acs.ohio-state.edu (Elena A Christofides)
Newsgroups: comp.ai,rec.arts.books,misc.writing,rec.arts.int-fiction
Subject: Re: Computer writes a book?
Date: 26 Jan 93 14:59:00 GMT
Article-I.D.: magnus.1993Jan26.145900.1536
Organization: The Ohio State University

Well, it hasn't actually written a book, but....

My husband wrote a program that writes poetry. This program is actually in 
basic.

In my modern poetry class a while ago, we had to submit up to three poems that 
were our own original work. Both my poems got A-/B+, whereas the computers poem
got an A+!

My instructor was none the wiser at the time - it was a little joke to show 
that the computer could write a L=A=N=G=U=A=G=E poem as good if not better than
the language poets themselves!

Elena
Xref: sparky comp.ai:5012 rec.arts.books:26342 misc.writing:4269 rec.arts.int-fiction:1275
From: max@west.darkside.com (Erik Max Francis)
Newsgroups: comp.ai,rec.arts.books,misc.writing,rec.arts.int-fiction
Subject: Re: Computer writes a book?
Date: 26 Jan 93 06:46:21 GMT
Organization: The Dark Side of the Moon +1 408 245 SPAM

pedersen@seas.smu.edu (Ted Pedersen) writes:

> I think this is a stunt. I don't really believe a computer program
> wrote this book. However, if anyone has any information about this
> book or the author that would give this some credibility I would like
> to hear about it. Comment on the general idea would be interesting as
> well. I don't think the idea itself is impossible, it just seems like
> this case is a little far fetched. 

I don't know about this particular case, but it could in all probability 
be real.  There are at least two obvious ways to get a computer to 
"write" prose; both involve the scanning or analysis of another text.  
One involves Markov chains, and the other involves a phonetic dictionary. 
Markov chain generators and traverses tend to ramble, but phonetic 
dictionaries can make a strange amount of sense at times.  In both cases, 
it generally requires a human operator to organize the output into 
something that makes any sense whatsoever.

I have written a Markov chain generator and traverser, and can run it on 
any text that you choose (as long as I have it handy).  Email me for more 
information.


Erik Max Francis  -)(-  ..!apple!uuwest!max  -)(-  max@west.darkside.com   __
USMail: 1070 Oakmont Dr. #1; San Jose, CA  95117  ICBM: 37 20 N 121 53 W  /  \
Like strategic games of interstellar conquest? . . . Ask about UNIVERSE!  \__/
-)(- Omnia quia sunt, lumina sunt; all things that are, are lights. -)(-
Newsgroups: comp.ai
From: ginsberg@t.Stanford.EDU (Matthew L. Ginsberg)
Subject: Re: Non monotonic reasoning
Organization: Computer Science Department, Stanford University.
Date: Wed, 27 Jan 1993 21:09:27 GMT

In article <1993Jan27.175706.21301@cronkite.ocis.temple.edu> renoir@picasso.ocis.temple.edu (Khemdut Purang) writes:

>	also, i would like to know if anyone has had any experience
>	with ginsberg's mvl system, and if it can easily do
>	circumscription and other forms of non monotonic logic as
>	claimed.

I've had a good deal of experience with this system.  Best thing
since sliced bread.

					: )

Newsgroups: comp.ai
From: orpheus@reed.edu (P. Hawthorne)
Subject: Re: Natural Language newsgroup charter
Organization: Reed College, Portland, OR
Date: Thu, 28 Jan 1993 14:58:17 GMT

(Supposedly exhaustive list of "the" worthwhile topics in NLP deleted.)

  TERRY@CS.UMD.EDU (Terry Gaasterland) jeers:
: I think that the clarifications above, or some instantiation of them,
: should be made part of the charter so that unfocused, unprofessional,
: and/or rampantly unscientific discussion can be moderated through peer
: pressure with references to the charter.

  Sez you, pal. Can you say that you are always focused, professional and
scientific? If so, go some place relaxing, and try to loosen up.

  One of the things I am looking forward to about this group would be an
atmosphere of expressive freedom. I would like to be able to ask about
things that have me confused and at a crossroads as to what to do.
  I would like to have elaborate tangents about personal projects, with all
due regard to NLP, without some retentive projecting their nervous tensions
and neurotic stresses into the thread as you propose above.
  And I would especially like to have mightily unscientific discussions
about wacky experimental projects that did something once and never, ever,
ever did that again.
  Deal with it.

  If you want stoic, uptight and academic, stick with the moderated
comp.ai.nlang-know-rep. On the other hand, if I have misinterpreted your
posting as dogmatic academic cliquery, let me apologize and assure you that
no flames were intended.


  Prometheus Hawthorne - Jones (orpheus@reed.edu)

Newsgroups: comp.ai,can.ai,can.general,ieee.general,rec.models.rc,ont.events,tor.general,ont.sf-lovers
From: sef@sef-pmax.slisp.cs.cmu.edu
Subject: Re: IJCAI reviewing
Organization: School of Computer Science, Carnegie Mellon
Date: Thu, 21 Jan 1993 06:58:50 GMT


    From: hulthage@morue.usc.edu (Ingemar Hulthage)
    
    I have to strongly disagree with Brian Gaines on this issue.  None of
    his arguments are even close to convincing me.  I find the statement
    that "The refereeing system should never be changed for the sake of
    'fairness' at the expense of its proper function of quality control"
    outrageous.  Fairness versus quality control is a false choice.  What
    better guarantee of quality is there than fairness !
    
Fairness is no guarantee at all.  Refereeing would be totally fair if the
referees were denied access to the paper itself, as well as the author's
identity and the abstract.  But quality control would suffer.

In my opinion, Brian Gaines is right.  There probably is some personal bias
in refereeing, but we can't effectively hide the identities of authors.
Even if we could, it would be foolish to deny referees some of the
information they need in order to assess the value and reliability of the
paper, just to eliminate some *possible* bias.  Pseudo-blind refereeing
does far more harm than good.

-- Scott

===========================================================================
Scott E. Fahlman			Internet:  sef+@cs.cmu.edu
Senior Research Scientist		Phone:     412 268-2575
School of Computer Science              Fax:       412 681-5739
Carnegie Mellon University		Latitude:  40:26:33 N
5000 Forbes Avenue			Longitude: 79:56:48 W
Pittsburgh, PA 15213
===========================================================================

Newsgroups: comp.ai,rec.arts.books,misc.writing,rec.arts.int-fiction
From: pedersen@seas.smu.edu (Ted Pedersen)
Subject: Computer writes a book?
Organization: SMU - School of Engineering & Applied Science - Dallas
Date: Mon, 25 Jan 1993 16:30:29 GMT


I saw the following in the Books column (by Olin Chism) of the Dallas
Morning News Sunday January 24, 1993. Copied without permission. It
concerns a computer program that allegedly wrote a book in the style
of Jacqueline Susann. 

I think this is a stunt. I don't really believe a computer program
wrote this book. However, if anyone has any information about this
book or the author that would give this some credibility I would like
to hear about it. Comment on the general idea would be interesting as
well. I don't think the idea itself is impossible, it just seems like
this case is a little far fetched. 

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

     "Birch Lane Press of New York says that Scott French, a
free-lance writer and computer consultant from California, invested
eight years and $50,000 to develop a computer program that writes like
Jaqueline Susann. Mr. French's electronic novelist has output Just
This Once, a 256 page sizzler that Birch Lane will publish next
summer."

      "The first thought of any good skeptic is that Birch Lane is
pulling a fast one. Remember "Naked Came the Stranger", the potboiler
that Lyle Stuart published back in the 60's? And how Penelope Ashe,
its author, turned out to be a whole committe of jokesters? Well, Lyle
Stuart is a subsidiary of Carol Publishing Group, which also owns
Birch Lane."

      "Suspicians are not allayed by the tone of the commentary in
Birch Lane's catalog: "Scott French, a self-professed fan of
mega-selling author Jacqueline Susann, imagined what it would be like
if she were still alive. Secretly he hoped that, following her
premature death, Susann had be frozen, a la Walt Disney. The doctors
could thaw her out by setting a giant microwave to the Low/Defrost
setting, then cure her cancer and put her back in front of the
typewriter where she belonged...""

---       
* Ted Pedersen                                  pedersen@seas.smu.edu * 
* Department of Computer Science and Engineering,                     *
* Southern Methodist University, Dallas, TX 75275      (214) 768-2126 *

Newsgroups: comp.ai
From: voit@wi-inf.uni-essen.de (Stephan Voit)
Subject: Looking for XPS shells
Date: Wed, 27 Jan 1993 15:39:09 GMT
Reply-To: voit@wi-inf.uni-essen.de
Organization: Wirtschaftsinformatik Universitaet Essen


For a tutorial I am looking for some small PD expert system shells. 
Some students (economics) should implement small problems in with 
an expert system shells. 

Our hardware: SPARC (SunOs 4.1.2) 
              PC (DOS 5, Windows 3.1)
              Mac (System 7)


Any hints are welcome ...
_____________________________________________________________________________
                             ___
Stephan Voit                /    /        /
University Essen (Germany) /__ _/_ __ __ /_ __    ___________________________
FB 5/Wirtschaftsinformatik   / /  /_// // /__//| /   Tel (+49) 201-810 03-32
____________________________/ /_ /_ /_// //_// |/   FAX (+49) 201-810 03-48
Altendorfer Str. 97-101            /               e-mail:
D-4300 Essen 1                    /               voit@wi-inf.uni-essen.de
_____________________________________________________________________________

Newsgroups: comp.ai
From: kessel@eos.arc.nasa.gov (Karen Kessel)
Subject: book on AI with C++
Summary: there is no C++ book for AI
Keywords: book ai c++
Organization: NASA Ames Research Center
Distribution: usa
Date: Wed, 27 Jan 1993 22:01:06 GMT

This note is for those of you who wrote me asking about
a book on AI for C++.  Well, since no one could recommend
one, there apparently is none.  ONly one person recommended
a book, David Wu, c/c++ for Expert Systems, MIS press, 1989.
However, this book is old C++, and a colleague of mine told
me that it is not very good anyway.  

Oh well, maybe we should write one ourselves?

Newsgroups: comp.ai
From: afzal@divsun.unige.ch (Afzal Ballim)
Subject: Re: Anonymous Schmemonymous (Was IJCAI Reviewing)
Reply-To: afzal@divsun.unige.ch
Organization: University of Geneva, Switzerland
Date: Fri, 22 Jan 1993 09:01:23 GMT

In article <POLLACK.93Jan21181428@dendrite.cis.ohio-state.edu>, pollack@dendrite.cis.ohio-state.edu (Jordan B Pollack) writes:
|> 
|> This discussion over the syntax of reviewing ignores the real problem
|> for IJCAI and AAAI, which is that their "significance" is quite at
|> odds with short and shallow reviewing cycles.
|> .
|>  .
|> I move that starting, say, in 1995 we communally agree that the AI
|> conferences won't count as major publications anymore, and in order to
|> make it happen we drastically INCREASE their rate of acceptance to
|> 50%, perhaps by getting rid of double reviews and resolution
|> committees, thus lowering the perceived quality and importance of a
|> citation there by the year 2000.
|> 
|> Jordan Pollack                            Assistant Professor

Now there's a good idea. As a community we are still acting like we are
working in a fledgling subject, placing far too much emphasis on conferences 
and not enough on journals. As Jordan points out, there are now many AI
related journals, some of whom are struggling to get good publications. 

If we look at more mature disciplines, there conferences have little or
no peer-review before-hand. It is from the reaction to the presentation
that the author's judge there good papers from the bad, and know which 
to pursue. 

If you consider the time necessary to prepare a paper for AAAI/IJCAI
if you want a good chance of acceptance, that is equivalent in many cases
to the time spent in preparing a short journal article (i.e., not much
more time and you have the journal article). 

The only problem with placing emphasis on journals, of course, is the slow
turnaround time. However, with electronic communication, etc., some of
the bottle-necks there can be reduced (in effect, reviewing + proof-reading
end up being the final bottlenecks).

So are we ready to treat conferences as proving-grounds rather than
proved-ground?

-- 
Afzal Ballim	             |BITNET,EARN,MHS,X.400: afzal@divsun.unige.ch
 ISSCO, University of Geneva |UUCP: mcsun!divsun.unige.ch!afzal
 54 route des Acacias	     |JANET: afzal%divsun.unige.ch@uk.ac.ean-relay
 CH-1227 GENEVA,Switzerland  |CSNET,ARPA: afzal%divsun.unige.ch@relay.cs.net
Newsgroups: comp.ai,rec.arts.books,misc.writing,rec.arts.int-fiction