HDTenEightyP/NetNews huggingface dataset:
From: orourke@sophia.smith.edu (Joseph O'Rourke)
Subject: Silence on P=NP
Organization: Smith College, Northampton, MA, US
Date: Sat, 21 Nov 1992 22:27:55 GMT

The silence on the Swart & Gismondi proof of P=NP is deafening.
Will no one venture an opinion?  My knowledge of linear programming
is insufficient to the task.
From: hermann@holmium.informatik.uni-bonn.de (Hermann Stamm-Wilbrandt)
Newsgroups: comp.theory
Subject: Re: "idiot"
Date: 21 Nov 1992 12:16:42 +0100
Organization: Institut fuer Informatik III, Universitaet Bonn
Distribution: world
NNTP-Posting-Host: convex.rz.uni-duesseldorf.de

Hello!
 
| >> This proves that P=NP and all NP-complete and all other NP problems thus
| >> have polynomial time algorithms.
| 
| Anyone who believes P=NP is an idiot.
| 
| Case closed.
| -- 
| Chris Long, 265 Old York Rd., Bridgewater, NJ  08807-2618

In my opinion it is ok to think as Chris, but if one posts such comments
here in comp.theory, one should be forced to tell what is the flaw
in the papers of E.R. Swart also (they are available via anonymous
ftp from snowhite.cis.uoguelph.ca in directory pub/comptheory and are
only 14/8/5 pages long); otherwise I think such comments aren't ok!

Bye,

   Hermann.

hermann@holmium.informatik.uni-bonn.de


Newsgroups: comp.theory
From: nrswart@phonon.uwaterloo.ca (Nicholas R. Swart)
Subject: Re: E-mail of E.R. Swart's research reports
Organization: University of Waterloo
Date: Mon, 23 Nov 1992 16:46:00 GMT

In article <By12tw.Jzr@watserv1.uwaterloo.ca> nrswart@phonon.uwaterloo.ca (Nicholas R. Swart) writes:
>To all those who requested e-mail copies of Swart's reports because you could

I've sent out copies to those who requested. We had some problems with our
mailer so some of you might get duplicate copies. If there are still those
who cannot get copies from the site please let me know.

>
>Thanks for waiting.
>
>Nicholas Swart
>Dept. of Elec. and Comp. Engineering
>University of Waterloo
>Waterloo, Ontario
>CANADA
>N2L 3G1


Newsgroups: comp.theory.dynamic-sys
From: scavo@cie.uoregon.edu (Tom Scavo)
Subject: Re: references
Organization: University of Oregon Campus Information Exchange
Distribution: inet
Date: Fri, 20 Nov 92 20:56:36 GMT

In article <9211190856.AA24359@nettlesome.berkeley.edu> Frederic Geurts <gf@INFO.UCL.AC.BE> writes:
>Does anybody have good references about the theory of symbolic dynamics when
> used as a topological tool to study dynamical systems ?

It wouldn't hurt to go back and read some of the original papers
in this area:

  Metropolis, N., M.L. Stein, and P.R. Stein.  On the finite
  limit sets for transformations on the unit interval.
  _J. of Comb. Theory_ 15(1), 25--44 (July 1973).

  Derrida, B., A. Gervois, and Y. Pomeau.  Iteration of
  endomorphisms on the real axis and representation of
  numbers.  _Annales de l' Institut Henri Poincare_
  (Section A) 29(3), 305--356 (1978).

I believe both of these (and more) are reprinted in Bai-Lin Hao's
_Chaos_ (World Scientific, Singapore, 1984, Q295.C44).  There's
also a book by Hao entitled _Elementary Symbolic Dynamics and
Chaos in Dissipative Systems_ (World Scientific, Singapore, 1989,
Q172.5.C45 H36) which you might find interesting.  His biblio-
graphy, by the way, is incredibly exhaustive.

>I am looking for different definitions of Chaos (apart from : sensitive
> dependance on initial conditions + topological transitivity + density of
> periodic points (R.L. Devaney)). Could anybody show me references about it ?

Recently, it's been shown that transitivity and dense periodic
points imply sensitive dependence.  See

  J. Banks, J. Brooks, G. Cairns, G. Davis and P. Stacey.
  On Devaney's definition of chaos.  _Amer. Math. Monthly_
  99(4), 332--334, 1992.

and the letter on p.865 of November's _Monthly_ (Vol.99,
No.9) by Assaf and Gadbois.

-- 
Tom Scavo
scavo@cie.uoregon.edu
Xref: sparky comp.theory.dynamic-sys:354 sci.systems:146
From: mlevin@husc8.harvard.edu (Michael Levin)
Newsgroups: comp.theory.dynamic-sys,sci.systems
Subject: Do scientists or engineers need a program like this?
Date: 19 Nov 92 16:31:41 GMT
Article-I.D.: husc3.1992Nov19.113143.17605
Distribution: usa
Organization: Harvard University Science Center


    I may have a computer program that does something, and I am
wondering if any scientists or engineers want one. Here's what it
does: Suppose you had a number of point-sources of some force, and you
wanted to know for a particular distribution of those sources, where
each source had some specified strength, and the force it "emmitted"
could have any character (i.e., it's decay with distance didn't have
to be a square law, but instead could be any arbitrary expression
involving distance). The number, positions, strengths, and force types
of each of the sources would be enterred at run-time. The program
would then produce a plot of the whole plane, where each point was
colored in such a way that the color expressed what the total (sum,
due to all the sources) force on a particle at that point was. This
would allow you to set up an arbitrary distribution of sources, and
see what the force-field looked like.
     Additionally, the program would work in reverse. You could enter 
the force-field shape that you wanted, and the program would find a
distribution of point sources that produced that specified field. So,
is anyone interested? If you have any ideas, comments, or potential
applications (ones I've thought of include gravitational,
electromagnetic, and acoustical models), please email to
mlevin@husc8.harvard.edu.
P.S. sorry if this is inappropriate for some of the groups, but I
didn't know who may be interested.

Mike Levin
From: gf@INFO.UCL.AC.BE (Frederic Geurts)
Newsgroups: comp.theory.dynamic-sys
Subject: references
Date: 19 Nov 92 08:58:19 GMT
Reply-To: Frederic Geurts <gf@INFO.UCL.AC.BE>
Distribution: inet
Organization: The Internet

Does anybody have good references about the theory of symbolic dynamics when
 used as a topological tool to study dynamical systems ?

I am looking for different definitions of Chaos (apart from : sensitive
 dependance on initial conditions + topological transitivity + density of
 periodic points (R.L. Devaney)). Could anybody show me references about it ?

Thank you beforhand.

Frederic Geurts.
gf @ info . ucl . ac . be
Xref: sparky comp.theory.dynamic-sys:357 sci.fractals:367
From: fisher@inls1.ucsd.edu (Yuval Fisher)
Newsgroups: comp.theory.dynamic-sys,sci.fractals
Subject: Spiders, Julia Sets and Mandelbrot Sets
Date: 20 Nov 1992 22:20:28 GMT
Organization: Institute for Nonlinear Science
Distribution: inet
NNTP-Posting-Host: inls1.ucsd.edu
Summary: Some new programs


There is some new and (I'd like to think) interesting code available
by anonymous ftp on lyapunov.ucsd.edu, in the directory pub/inls-ucsd/spider.

Spider is an XView program which does various things: 
	
    * A variant of Thurston's algorithm for computing a postcritically
      finite polynomials from the angles of the external rays landing 
      at the critical point.  For example, enter 1/6 and get out c = i, 
      for the quadratic case (If this makes no sense, nevermind, but 
      notice that the dynamics of 1/6 under multiplication by 2 modulo 1
      has some relationship with the orbit of i under z^2+i). 

    * It draws parameter (Mandelbrot set) and dynamical space (Julia sets)
      pictures using the Koebe 1/4 theorem as in The Science of 
      Fractal Images. This part of the code was largely written by Marc Parmet, 
      but it hasn't really seen the light of day much. This is pretty 
      fast, but I don't really know how fast people draw things these
      days. 

    * It draws external angles on Julia sets. 


If you want to understand the relationship between the Mandelbrot set
and the dynamics of Julia sets, this program is for you. 

---------------------------------------------------------------------
Yuval Fisher                                 e-mail: yfisher@ucsd.edu
Institute for Non-Linear Science 0402                               
University of California, San Diego                                  
La Jolla, CA 92093                                                  
---------------------------------------------------------------------
Xref: sparky comp.theory:2446 sci.math:15105 sci.crypt:4913
From: orwant@media.mit.edu (Jon Orwant)
Newsgroups: comp.theory,sci.math,sci.crypt
Subject: Re: Research Reports by Prof. E.R. Swart - slight delay
Date: 17 Nov 92 07:41:35 GMT
Organization: M.I.T. Media Laboratory


>> Nicholas R. Swart:
>>
>> There has been a slight delay in converting the research reports to postscript.
>> Also, it turns out that one of the files is too large to be posted here,
>> even in compressed format. 

Fermat, anyone?

"I have discovered a truly marvelous proof of this statement, which,
unfortunately, this USENET site is too small to contain."

Jon Orwant
MIT Media Lab
Newsgroups: comp.theory
From: rreiner@nexus.yorku.ca (Richard Reiner)
Subject: Reassembling a checkerboard jigsaw
Organization: York University
Date: Sat, 21 Nov 1992 15:44:06 GMT

This isn't my field, so please forgive me if the following question is
so stupid as barely to deserve an answer.  (And no, I'm not an
undergraduate trying to get the net to do my homework for me.)

I have a problem to solve (arising from an architectural application for
which an old client wants a utility written) which can abstractly be
represented as follows:

    - Given an n x n checkerboard which has been cut into pieces of
      varing size along the edges of its squares (i.e. no diagonal
      cuts),

      Efficiently reassemble the pieces into an n x n board (the rebuilt
      board need not deploy the pieces exactly as the original did,
      although this would be preferable; ideally, I would like to be
      able to enumerate *all* the ways of rearranging the pieces into an
      n x n board).

If anyone can point me in the right direction here, or even supply code
that solves a similar problem, I'll be very grateful.

Thanks,

Richard
-- 
Richard Reiner..............rreiner@nexus.yorku.ca..............416-538-3947

Newsgroups: comp.theory
From: bucknerb@bnr.ca (Brent Buckner)
Subject: Re: Cryptography and P=NP
Organization: Bell-Northern Research, Ontario, Canada
Date: Tue, 17 Nov 1992 15:53:08 GMT

In article <Nov.16.16.59.47.1992.6436@remus.rutgers.edu> clong@remus.rutgers.edu (Chris Long) writes:
>In article <15115@ember.UUCP>, Paul Colley writes:
>
>> If he means that anyone who believes P MIGHT be equal to NP is "an
>> idiot", then I think Chris should retract his statement.
>
>Nope.
>
>> The problem is open.
>
>Sure, but P=NP and P<>NP are certainly not equally likely.  

Of course; one is true (probability = 1) and the other false
(probability = 0).

>The a priori
>evidence that P<>NP is *overwhelming*; to claim that P=NP has a chance
>of being true is worse than claiming that there is a chance of only a
>finite number of twin primes existing.  Both are unproven, but there are
>*very* strong reasons for believing them to be true.  So strong that
>anyone who believes otherwise must be either ignorant or a crackpot.

All of those "very strong reasons" boil down to 'It sure seems
that way, doesn't it?'
I'd be willing to make a significant bet against
large odds that P<>NP, but I wouldn't bet my life.  So that puts
me in the "P MIGHT be equal to NP" camp.  I regard
this as due caution.

-- 
at Bell-Northern Research
voice:        (613) 765-2739
Canada Post:  P.O. Box 3511, Station C, Ottawa, Canada, K1Y 4H7
I do not claim that BNR holds these views.
From: as14@doc.ic.ac.uk (Athanasios Statharakos)
Newsgroups: comp.speech
Subject: TIMIT database
Date: 20 Nov 92 22:34:33 GMT
Organization: Dept. of Computing, Imperial College, London
NNTP-Posting-Host: dolphin.doc.ic.ac.uk
Keywords: help, TIMIT


Does anyone know how can I get a hold of the TIMIT database and how much will
it cost? I'm currently base in London so if anyone knows of a source here, it
would be a great help (info about other sources for the database could also 
prove valuable).

I urgently need the TIMIT database to continue my PhD work, so prompt response
will be greatly appreciated.

Thanks in advance

A. Statharakos
-- 
Athanasios Statharakos, Applied Systems Section
s-mail: Applied Systems,Dept. of Computing,Imperial College,London SW7 2BZ,UK
e-mail: as14@doc.ic.ac.uk - tel:+44 71 589 5111 (x7522) - office: WPL,room 208 
Newsgroups: comp.speech
From: cholette@IRO.UMontreal.CA (Martin Cholette)
Subject: Re: Could S.Blaster recognize sounds??HELP
Reply-To: cholette@IRO.UMontreal.CA (Martin Cholette)
Organization: Universite de Montreal
Date: Sun, 15 Nov 1992 20:37:18 GMT


 The answer to your question is !!!! NO !!!! . What you are asking
 for is extremely complicated, the problem is with the word recognition
 part, it is not a simple lookup in a table to see if a word matches.
 The theory involved is incredibly complicated and boring, Fast Fourrier
 Transforms are involved, heuristic time warp technology may also be used...
 If you plan on doing this, you must be prepared to work on this FULL TIME
 for at least a year! Many PhD's work on this for years and still get nowhere!

 Martin Cholette.

Newsgroups: comp.speech
From: ajr@eng.cam.ac.uk (Tony Robinson)
Newsgroups: comp.speech
Subject: Re: Help!! Looking for the most recent published books or papers
Date: 19 Nov 92 11:52:19 GMT
Organization: Cambridge University Engineering Department, UK

In comp.speech Marilyn Hu <slgwk@cc.usu.edu> writes:
>I am a graduate student working my master thesis, Speech Recognition for
>persons with disabilities.  I am looking for the most recent published speech
>recognition books or anything information about this topic.  If you have any
>information which may help me, please let me know.

I'm posting this reply as I think it is of general interest and I'd
appreciate feedback for generating a FAQ answer.

Tony [Robinson]

*******************************************************************************

Good background to speech analysis with some speech recognition:

 Digital processing of speech signals; Lawrence R. Rabiner, Ronald W. Schafer.
 Englewood Cliffs; London: Prentice-Hall, 1978

 Voice and Speech Processing; T. W. Parsons.
 New York; McGraw Hill

General introduction books on speech recognition:

 Speech recognition by machine; W.A. Ainsworth
 London: Peregrinus on behalf of the Institution of Electrical Engineers, c1988

 Speech synthesis and recognition; J.N. Holmes
 Wokingham: Van Nostrand Reinhold, c1988

 Electronic speech recognition: techniques, technology and applications
 edited by Geoff Bristow,  London: Collins, 1986

A collection of papers I like which I think is both a good introduction and
a fair statement of stare-of-the-art is:

 Readings in speech recognition; edited by Alex Waibel & Kai-Fu Lee.
 San Mateo: Morgan Kaufmann, c1990

More specific books:

 Hidden Markov models for speech recognition; X.D. Huang, Y. Ariki, M.A. Jack.
 Edinburgh: Edinburgh University Press, c1990

 Automatic speech recognition: the development of the SPHINX system;
 by Kai-Fu Lee; Boston; London: Kluwer Academic, c1989

Major speech journals are:

 IEEE Speech Processing (from Jan 93)
 Computer Speech and Language, Academic Press

Major speech conferences are:

 ICASSP	    International Conference on Acoustics Speech and Signal Processing
 ICSLP	    International Conference on Spoken Language Processing
 EUROSPEECH European Conference on Speech Communication and Technology
Newsgroups: comp.speech,comp.dsp,sci.lang
From: urbacht@liberty.uc.wlu.edu (Tom Urbach)
Subject: Speech lab questions
Date: Thu, 19 Nov 1992 20:42:29 GMT
Organization: Washington & Lee University
X-Newsreader: Tin 1.1 PL5

I'm looking into setting up a microcomputer or workstation based
speech lab here at my uni and would like to get suggestions and
recommendations. References to relevant FAQ archives would also be a
help.

The primary use for the lab would be instruction and psych research in
human speech production/perception. In addition to analysing and
visualizing speech sounds in the usual ways, e.g., spectrograms, I'd
like to be able to prepare speech sounds as stimuli for psych
experiments--categorical perception, phoneme restoration, cross-modal
priming, etc. This means being able to mix two signals w/ millisecond
accuracy, e.g., superimposing a timing signal on a voice track or
replacing a phoneme w/ a click. It would also be nice to be able to
transform the signal in various ways, e.g., to devoice a phoneme here,
to pull out F3 there, to vary pitch while keeping speech rate
constant, and to vary speech rate while keeping pitch constant.

Any tips on hardware and software combinations would be greatly
appreciated, particularly from the voice of happy experience. Digital?
Analog?  Combination? Mac, PC, NeXT, UNIX platforms all OK. Turn key
systems would be great but we can code.  I already have info on
MacSpeechLab/SoundScope from GW and MacRecorder from
Macromind/Paracomp but am not committed to Macs. I'll post a summary
of email responses. Thanks,

- Tom

Newsgroups: comp.speech
From: lundstrj@CS.ColoState.EDU (jeffery lundstrom)
Subject: Voice Recognition Help Needed!
Date: Thu, 19 Nov 1992 02:40:25 GMT
Distribution: usa
Organization: Colorado State University, Computer Science Department

	Does anyone out there have any information on Computer Voice
  recognition Theory?  I have a friend that is writing a paper on it and she
  needs some info!  Please let me know if you can help!!!

  Thanks in advance!!!
  Jeff Lundstrom

............................................................................
:::::::    Jeff Lundstrom - lundstrj@mozart.cs.colostate.edu     :::::::::::
::::::: =======================================================  :::::::::::
............................................................................
Newsgroups: comp.speech
From: eeltw@marlin.jcu.edu.au (Lloyd Walker)
Subject: Looking for speech synthesis chips
Keywords: speech, synthesis
Organization: James Cook University
Date: Tue, 17 Nov 92 02:32:39 GMT

Dear Netland,
	I've got a final year project in to me to make an environmental
control and simple speech unit for a disabled youngster.  The student
has done a good job with the report and the env control but for the last
six months there has been no success obtaining simply programmed speech
synthesis chips.  There was a plan to use Votrax SC-01 & SC-02 chips but
they're now unavailable here.  Plans to try the Texas Instruments
TSP50C4X family foundered on the agents requirements that 100 units were
minimum order.  I have little info on Microchip SP0264 & Sp0256A;
National MM54104 & Signetics MEA8000 other than that the student was
told none of these was now being manufactured.  
	All I want to do is to store up to 8 messages that can be
replayed at the press of a button from the portable unit.  I'm very open
to suggestions as it is a major detraction from the final product for
the client.
	God Bless,  Lloyd.

/-----------------------------------------------------------------------\
( Lloyd Walker,  PhD	       : Internet: L_Walker@trout.jcu.edu.au	)
( Faculty of Engineering         :   or      eeltw@marlin.jcu.edu.au    )
( James Cook University of North Qld: 				      	)
( Douglas		         :			._   /\		)
( Queensland                   :  		       /  \_/ *\	)	
( AUSTRALIA     4811          :                       (         )     	)
(  Ph  (077) 81 5410       : Fax +61 77	251 348        \_.--.__/        )
(---------------------------------------------------          V         )
(	      AUSTRALIA - Has to be seen to be believed!                )
\-----------------------------------------------------------------------/
Newsgroups: comp.speech
From: andrewh@ee.su.OZ.AU (Andrew Hunt)
Subject: Re: Speech synthesis on a SPARC?
Reply-To: andrewh@ee.su.OZ.AU (Andrew Hunt)
Organization: University of Sydney, Australia
Date: Thu, 19 Nov 1992 23:21:56 GMT

In article <62025@mimsy.umd.edu>, furuta@cs.umd.edu (Richard Furuta) writes:
|> I would appreciate pointers to programs that produce synthesized speech on
|> Sun Sparcstations.  I'm sorry for the FAQ-like nature of this question (I
|> tried scanning back in this group as far as I could on two different systems
|> without finding any leads).  Thanks in advance.


The Draft FAQ includes the following entry.

Package:     Text to Speech program
Platform:    Sun SPARC
Description: Text to speech program based on concatenation of pre-recorded
             speech segments.  A function library can be used to integrate
             speech output into other code.
Hardware:    SPARC audio I/O
Availablity: by FTP from "wilma.cs.brown.edu" as /pub/speak.tar.Z


The output is pretty rough but useful for many applications.

There is a very good synthesis system for SPARCs (and some other UNIX platforms)
called "Orator".  I am trying to get details for the FAQ at the moment.

Andrew Hunt
andrewh@ee.su.oz.au
Newsgroups: comp.speech
From: khawar@spectrum.cs.unsw.oz.au (mohammad khawar islam)
Subject: Re: Help!! Looking for the most recent published books or papers
Reply-To: khawar@spectrum.cs.unsw.oz.au (mohammad khawar islam)
Organization: none
Date: Sun, 22 Nov 1992 06:54:13 GMT

In article <1992Nov13.100200.60805@cc.usu.edu> slgwk@cc.usu.edu writes:
>I am a graduate student working my master thesis, Speech Recognition for
>persons with disabilities.  I am looking for the most recent published speech
>recognition books or anything information about this topic.  If you have any
>information which may help me, please let me know.  I appreciate for your help.
>
>Marilyn Hu
>
>My e-mail is : slgwk@cc.usu.edu
>  or         : marilyn@slow.cs.usu.edu
>
>

Newsgroups: comp.speech