HDTenEightyP/NetNews huggingface dataset:
From: wcn@cs.brown.edu (Wen-Chun Ni)
Subject: Re: Are Knuth's "Art of Computer Programming" books still worth reading?
Keywords: Knuth books
Organization: Brown University Department of Computer Science
Date: Thu, 17 Dec 1992 08:26:46 GMT

In article <1992Dec16.231320.12021@tellab5.tellabs.com> jab@tellabs.com (Jeff Brooks) writes:
>
>I've recently completed my first couple of classed towards a Masters in CS
>and was told by one of my professors that Knuth's multi-volume set of books
>"The Art of Computer Programming" are THE classic computer science books.
>
>My questions are, are these books still worth reading or are they outdated?
>The copy of volume 1 I found has a copyright date of 1973, so, should I
>just read them as a historical reference or is most of the technical content
>still applicable to today's programming methods?

Knuth's books always remind me of the great MacMahon volumes in 
combinatorial analysis.

Knuth's vol 1 and 3 are probably the most frequently referenced books in
CS. The contents of vol 1 (math and data structures) are relatively
old if you have the Cormen-Leiserson-Rivest book. After the '80,
the development of dynamic data structures has been beyond the covered
materials of Knuth's chapter 2. The math materials in chapter one are
further elaborated in more recent book "Concrete Math" by Graham, Knuth,
and  Patashnik. I myself like the style of Art'chapter-1 better since
there is no bell and whistles in the book.

I only read a couple of sections in Volume 2, which deals with random
number generation, sampling, computer arithmetics. You may need a better
understanding of number theory to grasp the materials there. This is 
the least referenced volume in the series, I think. But its contents
appear to be the most updated.

Volume 3 concerns about fundamental computing problems in "ordering."
It's relatively hard and deep, but I still love this volume most.
It more or less affects the research directions after 1973, when the
book was published. This volume is probably the most referenced 
book in computer science up to now. The reason? two folds:
    1. If you want to do theoretical research, you can't completely
       avoid dealing with sorting and searching.
    2. If you are publishing papers, you'd better "decorate" yourself
       by citing the book ;-).

If you are serious about computer science, you should read the books
to see the *hard* part of computer science. Ever since I first
read the 'Art series, I find myself learn more every time I read 
it. 

If you are not so serious in getting theoretical stuffs and the
"spirits", get Cormen-Leiserson-Rivest, which is the best *textbook* in
algorithms in my humble opinion.
From: lambert@spectrum.cs.unsw.oz.au (Tim Lambert)
Subject: Re: comp geometry
Organization: CS&E, Uni of NSW, Australia
Date: Tue, 15 Dec 1992 10:24:35 GMT

>>>>> On Mon, 7 Dec 92 21:51:44 GMT, bross@splatter.nas.nasa.gov (Bill Ross) said:

> Does anyone have a formula or algorithm for calculating the biggest
> sphere that can fit in an irregular hexahedron? 

If the hexahedron is convex, then the sphere will touch four faces, so
you could test all 6_choose_4 subsets of the faces to see if the
sphere touching the four support planes is inside the hexahedron and
take the largest such sphere.

If it is not convex then you have to worry about spheres tangent to
concave vertices and edges.

> How about an n-sided  figure?

If it is convex, you could take the dual, and find the smallest
enclosing sphere by the obvious generalization of of the smalles
enclosing circle algorithm.

If not convex, then the centre of the sphere lies on Voronoi diagram
of the polyhedron, so searching that should do it, but I don't know of
a published algorithm for this...

Tim

Newsgroups: comp.theory
From: ramali@baraka.cs.wisc.edu (G Ramalingam)
Subject: looking for CFP: Graph-Theoretic Concepts in CS
Organization: University of Wisconsin, Madison -- Computer Sciences Dept.
Date: Thu, 17 Dec 1992 23:36:42 GMT



I'd appreciate it if anybody who has the call for papers for the
'93 Workshop on Graph-Theoretic Concepts in Computer Science
could mail it to me. I'm looking for the submission deadline
in particular. Thanks.

Ramalingam. (ramali@cs.wisc.edu)
From: johnsson@sara.cc.utu.fi (MIKA JOHNSSON)
Newsgroups: comp.theory
Subject: N-MATCHING INFO WANTED !
Date: 18 Dec 92 16:12:51 GMT
Organization: University of Turku, Finland

HI EVERYONE !

I'm interested in 3-matching or n-Matching with n > 2

If anyone knows any articles, books, etc. that deals with n-Matching algorithms
(heuristical or optimal) and their complexity, could you please inform me,

Thanks in advance

Mika Johnsson
e-mail johnsson@sara.cc.utu.fi
Univerity of Turku, Finland
From: diderich@di.epfl.ch (Claude Diderich)
Newsgroups: comp.theory
Subject: Re: Real Numbers vs. Rational Numbers?
Date: 17 Dec 92 10:45:02 GMT
Organization: Ecole Polytechnique Federale de Lausanne

I asked myself some time ago the same question (e.g. are Turing machines
computing on real numbers equvalent on ones computing only on rationals), but I
was unable to find any answer. I was especially intersted in complexity
theoretical results. Any pointers in the literature about real vs. rational vouls
be highly appreciated.


Keywords: 


-- 
---------------------------------------------------------------------------
Claude G. Diderich                            Internet: diderich@di.epfl.ch
30, Avenue S.Reymondin  --  CH-1009 Pully (VD)  --  Switzerland  --  Europe

``Imagination is more important than knowledge''            Albert Einstein
---------------------------------------------------------------------------
From: torbenm@diku.dk (Torben AEgidius Mogensen)
Newsgroups: comp.theory
Subject: Re: 2 stack PDA and other questions
Date: 14 Dec 92 11:38:27 GMT
Organization: Department of Computer Science, U of Copenhagen

khmak@miavx1.acs.muohio.edu writes:

>A few days ago someone posted a few questions that I was also curious about
>knowing the answer to.  Here they are:


>Why is a 2 stack PDA equivalent to a turing machine?

Because one stack can hold the contents of the tape to the left of the
pointer, and the other stack can hold the portion of the tape to the
right of the pointer. Thus, a TM is easy to simulate.

>Why is it important to know if there is at least one decision problem that is
>undecidable?

Importance depends on who you are. Many programmers life happily
without knowing about the unsolvability of the halting problem, but if
you have one specific problem that you know is undecidable, you can
often use this to prove the undecibability of other problems.

>Who cares if P=NP?  Or what is the significance of the question "Is P=NP"?

If P=NP then there exist efficient algorithms to solve problems, where
the best known current algorithms are so inefficient that it is
unrealistic to solve certain problems. There was/is a discussion (in
comp.theory or sci.math) about the consequence for "unbreakable"
codes. In essence, the point is that if P=NP it is impossible to make
a code that it takes exponential time to break.

	Torben Mogensen (torbenm@diku.dk)
Newsgroups: comp.theory
From: burns@bellcore.com (James E. Burns)
Subject: New Address: James E. Burns
Organization: Bellcore
Distribution: usa
Date: 18 Dec 92 11:46:31


Permanent address change:

  James E. Burns, MTS                    
  Bellcore, NVC 3X-114                   
  331 Newman Springs Road
  PO Box 7040, Red Bank, NJ 07701-7040, USA

  email: burns@nova.bellcore.com
  phone: (908) 758-2819 

jim burns

--
James E. Burns, MTS                    burns@nova.bellcore.com
Bellcore, NVC 3X-114                   (908) 758-2819
331 Newman Springs Road
PO Box 7040, Red Bank, NJ 07701-7040, USA
Newsgroups: comp.theory
From: boerncke@kirk.fmi.uni-passau.de (Frank-Roland Boernke)
Subject: Re: Real Numbers vs. Rational Numbers?
Organization: University of Passau, Germany
Date: Thu, 17 Dec 1992 14:21:50 GMT


|> How about this: 
|> Maybe the model could conceivably represent the reals, but how would any
|> irrational number get into the machine in the first place?  There are 
|> uncountably many irrationals, so a table look-up won't do.  You could
|> try to calculate them, but how do you calculate, say, pi, with only 
|> Turing-machine-like operations?
|> 
|> So, at first glance, it looks like this machine is equivalent to the RAM
|> model with rationals plus a finite number of irrationals you could have in
|> a table.  This is equivalent to a Turing machine.
|> 
|> Anybody buy that?
How is it possible to work with irrationals in a table? Of course you cannot store
them digit by digit as there is an infinite number. But if you choose a finite 
representation e.g. two letters P and I for the sequence 3.141592654... how can 
you calculate say PI * PI? 
 
-------------------------------------------------------------------------
Frank Boerncke                       ,,,   University of Passau - Germany
boerncke@kirk.fmi.uni-passau.de     (.~.)            phone: +49 0851 2267
--------------------------------oOO--(_)--OOo---------------------------

Newsgroups: comp.theory,cs.bboard,cs.research
From: duanyang@cs.columbia.edu (Duanyang Guo)
Subject: a problem
Organization: Columbia University Department of Computer Science
Date: Fri, 18 Dec 1992 04:15:38 GMT

I met a problem recently. 

given an integer vector (x1, x2, ..., xn), could you find 
an efficient ALGORITHM to get minimum M and  an integer vector
(y1, y2, ..., yn) so that the following holds: 
(1). (y1, ..., yn) is a PERMUTATION VECTOR from [0, M-1]: 
     yi does not equal to yj, if i does not equal to j; 
     all yi belongs to [0,M-1];
(2)  ((x1+y1) mod M, (x2+y2) mod M, ..., (xn+yn) mod M) is also a 
     PERMUTATION VECTOR from [0, M-1] as defined above. 

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

because (x1, x2, ..., xn) is equivalent to (x1+1, x2+2, ..., xn+n) 
in term of finding M and solution, we can assume xi>=0 for 1<=i<=n.

I can get some kind of upper-bound about M, such as 
n+max{xi}-min{xi}. 

A follow-up question is, for multiple integer vectors, find out
common M and vector Y which has the same property. This question 
is most interesting to me. 

could anyone point some references about it? it looks like so 
plain! any results in PERMUTATION GROUP can help? 

I guess it is NP-complete. Any NP-complete problem in the similiar
manner? 




-- 
Duanyang Guo	Computer Science Department, Columbia University

Newsgroups: comp.theory.dynamic-sys
From: sparapan@flash.ra.anl.gov (RA Sparapani RA/208/xxx gwing)
Subject: Re: Jobs in Complex Systems
Organization: Argonne National Laboratory, Argonne IL
Distribution: na
Date: Fri, 11 Dec 1992 19:54:08 GMT

In article <gilligan.724056183@cs1.bradley.edu> gilligan@cs1.bradley.edu (Edward Henigin) writes:
>In <erwin.723997724@trwacs> erwin@trwacs.fp.trw.com (Harry Erwin) writes:
>
>>Talk to XEROX or IBM. Avoid government-related businesses.
>
>>Cheers,
>>-- 
>>Harry Erwin
>>Internet: erwin@trwacs.fp.trw.com
>
>When you say 'Avoid government-related businesses,' are you including
>jobs at government research places like Los Alamos, Argonne, etc?
>
>--
>|ed -- gilligan@camelot.bradley.edu                                          |
>|   -- gilligan@cs1.bradley.edu     | If you want a friend, feed any animal. |
>|    Are you deviant?  Probably.    |           -Jane's Addiction            |

If you want to work at Argonne or Los Alamos, and you don't
want to be a grunt for the rest of your life, you will have
a doctorate degree or similar distinction in the field.

Rodney
Grunt, Argonne
From: kruel@wpcst1.phys-chemie.uni-wuerzburg.dbp.de (Thomas-Martin Kruel)
Newsgroups: comp.theory.dynamic-sys
Organization: Institut f. Physikalische Chemie
Subject: Refs on chaos in neural activity ?
Keywords: chaos, brain activity, Freeman,Holden,Babloyantz
X-Software: HERMES GUS 1.10 Rev. Dec  7 1992
Date: Sun, 20 Dec 1992 16:11:18 MET
MIME-Version: 1.0
Content-Type: text/plain; charset=US-ASCII
Content-Transfer-Encoding: 7bit

Hi,

   I just came across some recent work on chaotic attractors in models 
of neuron populations, by Walter Freeman in Berkeley. I'm also aware 
of the work by Holden et al. in that field.

   Since I'd like to compile a short list of ref's what has been done 
in that field, I'd appreciate if somebody could point me to some 
references and/or recent review/feature articles in that topic.

   I didn't follow the work done by Babloyantz in Brussels for 4 years now.
Is there anyone out there who has newer references to chaos in human 
EEG activity ?

   Which are the other authors/groups I should take a look on ?

We have neither Current Contents: Life Sciences, nor access to the 
appropriate online datebases, so that's why I ask you.

Thanks in advance,

Thomas Kruel.
-- 
Thomas-Martin Kruel  Institut f. Physikalische Chemie / Universitaet Wuerzburg
                     Marcusstr. 9-11, D-8700 Wuerzburg, Tel. +49 931 31579
From: backon@vms.huji.ac.il
Newsgroups: comp.theory.dynamic-sys
Subject: Approximate entropy program ?
Date: 15 Dec 92 18:41:23 GMT
Distribution: world
Organization: The Hebrew University of Jerusalem

Our cardiology group urgently needs to obtain a ready-to-run computer program
(preferably for a PC but, if necessary for a VAX) on approximate entropy
(Pincus SM. Approximate entropy as a measure of system complexity. Proc Natl
Acad Sci 1991l;88:2297-2301).


Thanks in advance,

Josh
backon@VMS.HUJI.AC.IL






Newsgroups: comp.theory.dynamic-sys,sci.fractals,sci.math.num-analysis,sci.research.careers
From: jdebruyn@newton.physics.mun.ca (J. deBruyn)
Subject: Re: Jobs in Complex Systems
Organization: Memorial University of Newfoundland
Date: Fri, 11 Dec 1992 22:53:22 GMT

In article <1992Dec10.082708.8548@physics.ucla.edu> lee@physics.ucla.edu writes:
>Hello,
>
>Just two questions for you:
>
>  1) How is the job market in Complex Systems (computer modeling and quantification of   non-linear systems)?
>  2) What is your view of the field?
>
>I am trying to make a little life decision.


I am an experimentalist in the same field. I would say that it is
definately a growing field. At least in experimental physics, the
first people to work in the field as grad students and then as post
docs are just beginning to hit the job market. Many universities who
are looking for people explicitly mention nonlinear dynamics as a
field of interest.  Of course, the overall job market in academe is
not great just now, but that's another story. I have no idea what the
job market in this field is like outside of universities.

I should also say that it seems to me to be a field that has a rather
high proportion of theorist/computationalist types, and rather few
experimentalists. If you are an experimentalist, this means your job
prospects are really pretty good. If you are a theorist, the
competition might be fairly stiff. Of course it is the nature of the
field that theory, computation and experiment are all tightly
intertwined. That is one of the things I like about it.

Nonlinear dynamics and complex systems will become more and more
an important area of research over the next ten years. Beyond that,
it is really impossible to predict.

Hope this helps!

John

Newsgroups: comp.theory
From: lewis@vanilla.research.att.com (David Lewis)
Subject: Call For Papers: Special Issue on Text (or Speech!) Categorization
Date: Mon, 21 Dec 1992 04:04:45 GMT
Distribution: comp
Organization: /home/lewis/.organization


There has been some interesting work recently on categorization of
speech messages (sometimes called "topic spotting").  Topic-specific
language models are also a possibility, though I don't know if
anyone's done that yet.

--Dave

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

                         Call For Papers
              Special Issue on Text Categorization 
             ACM Transactions on Information Systems

                  Submissions due: June 1, 1993

   Text categorization is the classification of units of natural
language text with respect to a set of pre-existing categories.
Reducing an infinite set of possible natural language inputs to a
small set of categories is a central strategy in computational systems
that process natural language.  Some uses of text categorization have
been:

       --To assign subject categories to documents in support of text
retrieval and library organization, or to aid the human assignment of
such categories.
       --To route messages, news stories, or other continuous streams
of texts to interested recipients.
       --As a component in natural language processing systems, to
filter out nonrelevant texts and parts of texts, to route texts to
category-specific processing mechanisms, or to extract limited forms
of information.
       --As an aid in lexical analysis tasks, such as word sense
disambiguation.
       --To categorize nontextual entities by textual annotations, for
instance to assign people to occupational categories based on free
text responses to survey questions.

   ACM Transactions on Information Systems is the leading forum for
presenting research on text processing systems.  For this special
issue we encourage the submission of high quality technical
descriptions of algorithms and methods for text categorization.
Experiments comparing alternative methods are especially welcome, as
are results on deploying systems into regular use.

   Five copies of each manuscript should be submitted to either of the
special issue editors at the addresses below:

David D. Lewis                             Philip J. Hayes
AT&T Bell Laboratories                     Carnegie Group, Inc.
600 Mountain Ave.                          Five PPG Place
Room 2C409                                 Pittsburgh, PA 15222
Murray Hill, NJ 07974                      USA
USA                                        hayes@cgi.com   
lewis@research.att.com

Submission	June 1, 1993
Notification 	October 1, 1993
Revision	February 1, 1994
Publication	mid-1994

The July 1990 issue of TIS contains a description of the style requirements. 

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



--
David D. Lewis                    
AT&T Bell Laboratories            email: lewis@research.att.com
600 Mountain Ave.; Room 2C409     ph. 908-582-3976
Murray Hill, NJ  07974; USA       dept. fax. 908-582-7550
Newsgroups: comp.speech
From: isc30158@nusunix1.nus.sg (WEE LEE SENG)
Subject: Text to speech
Organization: National University of Singapore
X-Newsreader: TIN [version 1.1 PL6]
Date: Thu, 17 Dec 1992 16:27:47 GMT


Hi,


I like to find out the following things:
 
	1. What is the name of the company that produces Monologue
   	   (That piece of software that comes with Sound Blaster)?
 
	2. Is there any distributor of Monologue in Singapore?
	   If so, can you supply me with the address and contact number?
 
	3. Is there any other commercial/public domain software that
 	   does the same thing (convert text to speech)? What is the
	   hardware requirement? 
	
Thank you!

============================================================================
Wee Lee Seng              |________|________|________|________|________|____
weeleese@nusdiscs.bitnet  ____|________|________|________|________|________|
isc30158@nusunix2.nus.sg  |________|________|________|________|________|____
___|________|________|________|________|________|________|________|________|
|_______|________|________|________|________|________|________|________|____
   |        |        |        |        |        |        |        |        |
============================================================================
From: ubacr45@ucl.ac.uk (Mr G Toal)
Newsgroups: comp.speech
Subject: Re: better phoneme directory for scat on SPARC
Keywords: scat phoneme speech
Date: 13 Dec 92 04:45:03 GMT
Organization: Bloomsbury Computing Consortium, London

In article <7619@stan.xx.swin.oz.au> quentin@swin.oz.au writes:
>I am running scat on my SUN SPARC. Scat will speak stdin for you.
>It uses a directory of phonemes, which are short (.1 to .3 s) .au files.
>The trouble is that the speech sounds garbled. I believe that the problem
>lies in the recording of the .au files for each phoneme. I tried to record
>my own with some success but I was wondering if anyone has a directory
>of phonemes for scat which makes the speech understandable.

I don't think you'll ever get anything very impressive: it's a general
limitation of the simple sampled-phoneme algorithm: phonemes simply
don't join up.  A marginally cleverer idea is to sample pairs of
phonemes, and provide samples that run from the middle of one
segment to the middle of the next.  This means of course that you
need N^2 samples instead of N (slightly less if you skip ones that
don't happen in your language)  This gives better speech because
most of the rising or lowering inflexions are at the start and end
of phonemes, and the middles are relatively stable and can be abutted
with less noticable discontinuity.

G
Lines: 13
Date: Sat, 19 Dec 92 19:03:57 MST
From: metin@gecko.ee.byu.edu (Metin Gunsay)
Newsgroups: comp.speech
Distribution: world
Organization: Brigham Young University, Provo UT USA
Subject:  Speech Compression: state of the art?Hello,


What technique is the current state of the art for compression of speech:
LPC, VQ?

Any references and coments would greatly be appreciated.

Thanx,

Metin


-- 
Thanx,    metin@gecko.ee.byu.edu
Xref: sparky comp.speech:363 comp.ai.neural-nets:4584
From: schiff@ira.uka.de (Georg Schifferdecker)
Newsgroups: comp.speech,comp.ai.neural-nets
Subject: who's offering interesting work ?
Date: 15 Dec 1992 14:34:07 GMT
Organization: University of Karlsruhe, FRG
Distribution: world
NNTP-Posting-Host: i43s6.ira.uka.de


Hello,

I am a German student at Karlsruhe University attending courses in
speech recognition and neural networks from Alex Waibel. In April I 
want to start my "Diplomarbeit", which is roughly comparable to a
master's thesis.

The "Dipomarbeit" is supposed to last about 6 to 9 months and
should include theoretical and practical aspects on the field of
speech recognition and/or neural networks. The Diplomarbeit is NOT
supposed to be part of a Masters course, but is a standalone
research work, where I could have the status of a visiting student,
as I get credit for this work here at Karlsruhe University.
There should be local guidance available, e.g. somebody who is
working on a familiar field.

My special interests are:

	- continous speech recognition
	- word spotting with NN
	- incorporating symbolic knowledge into NN
	- speaker dependence/independence

If you have some interesting work to offer, which is suitable
for a thesis as described above, please email to

	schiff@ira.uka.de

Thank you very much !

Georg Schifferdecker
From: @FtCollins.NCR.COM
Newsgroups: comp.speech
Subject: text-to-speech
Date: 18 Dec 92 22:39:32 GMT
Reply-To: @FtCollins.NCR.COM
Distribution: usa
Organization: NCR MED, FT. Collins, CO. 80525  (303) 223-5100



I just started reading comp.speech, so my apologies
if this is a FAQ. Is there any "good" text-to-speech
software available in the public domain?
What is it and where is it?

Jim Prater
NCR Microelectronics
jim.prater@FtCollins.ncr.com
From: npopp@ural.next.com (Nicholas Popp)
Newsgroups: comp.speech
Subject: Mel based coefficients - what are their true meaning?
Date: 14 Dec 92 22:30:08 GMT

Does anybody know the physical significance of Mel Based coefficients?
Here is what I understand and what I don't.

1) We start computing the energy in bands. Under 1KHz the bands are  
linearly spaced and beyond 1KHZ they are logarithmically spaced (because  
there is less energy in the higher frequency bands and the human hear  
frequency resolution is as such...)
2) We use triangle filters (probably for smoothing reasons...)
3) Then there is a cosine/linear combination type of transform. I do not  
understand the physical significance of it but I observed that my  
recognizer works better! What does it mean?

Thanks in advance for your explanations...

-Nicolas