HDTenEightyP/NetNews huggingface dataset:
From: cliff@cs.man.ac.uk (Cliff B Jones)
Newsgroups: comp.theory
Subject: History
Date: 22 Jan 93 17:23:29 GMT
Organization: Dept Computer Science, University of Manchester, U.K.

A Technical Report (details below) containing references to papers of
historical interest in the area of `formal methods' is available
either by FTP from

            m1.cs.man.ac.uk (130.88.13.4)

	    pub/TR/umcs-92-12-2.ps.Z

or in hard copy by e-mailing

            jenny@cs.man.ac.uk

+++++++++++++++++++++++++++++++++++++++++++++++++++++++

Formal Methods -- Selected Historical References

C. B. Jones and A. M. McCauley
	Department of Computer Science
	University of Manchester
	Oxford Rd., Manchester, U.K.

\date{1992-12-09}

Abstract

This report contains citations to papers which are of
historical interest in the area of formal approaches
to software development. 

+++++++++++++++++++++++++++++++++++++++++++++++++++++++
+++++++++++++++++++++++++++++++++++++++++++++++++++++++

Also available in hard copy (no ftp for copyright reasons) is

+++++++++++++++++++++++++++++++++++++++++++++++++++++++
The Search for Tractable Ways of Reasoning about Programs

C.\ B.\ Jones

\date{1992-03-31 (minor typographical errors corrected: 1992-06-23)}

Abstract

This paper traces the most important steps in the history of research
on reasoning about programs.
The main focus is on ways of verifying that sequential imperative
programs satisfy their specifications.
Over time it has become clear that {\em post facto} verification is
only practical for small programs;
verification methods which support the development of larger programs
exploit a notation of compositionality.
Coping with concurrent algorithms is much more challenging --
this and other extensions are considered briefly.
The main thesis is that the idea of reasoning about programs has been
around for a long time;
the search has been to find tractable methods.

+++++++++++++++++++++++++++++++++++++++++++++++++++++++
Newsgroups: comp.theory
From: aps@sonia.math.ucla.edu (Alexei Stolboushkin)
Subject: Re: solution or information needed
Organization: UCLA Mathematics Department
Distribution: usa
Date: Fri, 22 Jan 93 21:48:30 GMT

In article <1993Jan21.153028.7679@cs.yale.edu> fischer-michael@cs.yale.edu (Michael Fischer) writes:

...

>You need understanding, not answers.  One of the main themes of
>classical language and automata theory is to classify the power of
>various grammar and machine models.  A beautiful theory has developed
>that gives elegant characterizations of the capabilities and
>limitations of these devices.  To see why {ww | w E {0,1}*} is not
>regular, for example, you need to know about the pumping lemma for
>regular sets and other techniques for proving non-regularity.  To see
>why it is not accepted by a pushdown store machine, it is useful to
     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
certainly it IS context-free, and therefore accepted by a PDA.

>know about the connections between pushdown store machines and
>context-free languages and to know about the pumping lemma for
>context-free languages.  To see why it can be accepted by a Turing
>machine, you need an understanding of the kinds of things Turing
>machines can do and how they can do them.  If you read and understand
>the Hopcroft and Ullman book, you won't need somebody else to furnish
>solutions to the exercises for you.
Newsgroups: comp.theory
From: aps@sonia.math.ucla.edu (Alexei Stolboushkin)
Subject: Re: solution or information needed
Organization: UCLA Mathematics Department
Distribution: usa
Date: Sun, 24 Jan 93 04:29:45 GMT

In article <1993Jan22.214830.26496@math.ucla.edu> aps@sonia.math.ucla.edu (Alexei Stolboushkin) writes:
>In article <1993Jan21.153028.7679@cs.yale.edu> fischer-michael@cs.yale.edu (Michael Fischer) writes:
>
>...
>
>>limitations of these devices.  To see why {ww | w E {0,1}*} is not
>>regular, for example, you need to know about the pumping lemma for
>>regular sets and other techniques for proving non-regularity.  To see
>>why it is not accepted by a pushdown store machine, it is useful to
>     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
>certainly it IS context-free, and therefore accepted by a PDA.

ooops, I thought it is ww' (' for reversion), sorry. Yes, you're right,
for any CF language there is n such that every word in the language
of length >n can be represented as xyzuv, with |yzu|<n, |yu|>0,
and all words xy^k zu^k v are also in the language. So it seems
enough to consider one word of the form:
	0^m 1^m 0^m 1^m, for some m>n,
and all four situations, when yzu consists of 1's only, of 0's only,
of 1's, and 0's, and of 0's and 1's.

A much more interesting exercise (and an instructive one), is to
give an example of a non-CF language satisfying the above pumping
lemma.
From: schweika@unipas.fmi.uni-passau.de (Andreas Schweikardt)
Newsgroups: comp.theory
Subject: address of Th. Lengauer ?
Date: 25 Jan 1993 11:11:47 GMT
Organization: University of Passau, Germany
Distribution: world
NNTP-Posting-Host: marvin.fmi.uni-passau.de

Hi,

does anyone the current (email-)address of Thomas Lengauer ?

Please send email to schweika@trillian.fmi.uni-passau.de

Thanks
                Andreas Schweikardt
-- 
Andreas Schweikardt * Ingling 17 * 4784 Schardenberg * Austria
                    schweika@trillian.fmi.uni-passau.de    
Newsgroups: comp.theory
From: foster@jed.cs.uidaho.edu ()
Subject: Re: solution or information needed
Organization: University of Idaho CS Dept.
Date: Fri, 22 Jan 1993 16:25:43 GMT
Distribution: usa

To see why "copy languages" are non-regular, learn a pumping lemma for CFLs, 
as was just suggested.

I recently read an interesting explanation of why copy languages are non regular.
Think about "dependencies" in a string, which are produced by the process of 
derivation.  Rather than be formal, I'll give an example.  For palendromes, the
dependencies are nested.  For example:

            a  b   b  a   a   a   b   b   a
            |  |   |  |       |   |   |   |
            |  |   |  +-------+   |   |   |
            |  |   +--------------+   |   |
            |  +----------------------+   |
            +-----------------------------+
                      
This property holds for all context free languages.  However, consider the 
dependencies for non CF languages.  For example, one from a copy language:

            a   b   b   a   a   b   b   a
            |   |   |   |   |   |   |   |
            |   |   |   +-------^---^---+
            |   |   +-----------^---+    
            |   +---------------+  
            +---------------+
The dependencies cross.  This is evidence that a more complicated process
took place when they were generated, one where the productions had to "be aware"
of other productions "in context".

I thought this was cute.  Incidentally, I read about it in "The Linguistics of DNA",
Davide B. Searls, American Scientist, Vol 80, Nov-Dec 1992, pp 579--591.
-- 
James A. Foster                           foster@cs.uidaho.edu
Universty of Idaho                        Dept. of Computer Science
From: dd@doc.ic.ac.uk (Demetrius Dracopoulos)
Newsgroups: comp.theory.dynamic-sys
Subject: Chaotic analyzers wanted
Date: 28 Jan 1993 19:22:45 -0000
Organization: Department of Computing, Imperial College, University of London, UK.
Distribution: world
NNTP-Posting-Host: swan.doc.ic.ac.uk


I would like to make a list with programs (preferably public domain) under X11
that analyze data from chaotic systems. 

I'll summarize any responses I'll get. Please reply by email.

Thanks in advance

Dimitri C. Dracopoulos
Dept. of Computing
Imperial College
London
From: awl1@quads.uchicago.edu (alpha wei-min lo)
Newsgroups: comp.theory.dynamic-sys
Subject: psychology
Date: 25 Jan 93 18:40:10 GMT
Reply-To: awl1@midway.uchicago.edu
Organization: University of Chicago


  I seem to remember reading somewhere that pyschologists are now 
using the paradigm of systems theory to gain insights into relationships
and to suggest new ways of changing problematic behaviour in relationships.

 I was wondering if anyone know of similar work/info on, or has ideas on how 
 to apply systems theory to changing ones own behaviour/habits.

thanks.
From: dduke@ibm1.scri.fsu.edu (Dennis Duke)
Newsgroups: comp.theory.dynamic-sys
Subject: Postdoctoral postion available
Date: 25 Jan 93 13:14:04 GMT
Organization: SCRI, Florida State University


                   POSTDOCTORAL POSITION

Applications are invited for a postdoctoral postition with a group involved
in using numerical methods of nonlinear dynamics and deterministic chaos
to analyze human EEG data. Candidates should have a PhD degree in some
appropriate field, such as physics or applied mathematics, and experience
in computational science. Some background in EEG psychophysiology 
would be useful, but is not essential.

The Supercomputer Computations Research Institute offers an excellent research
environment, including a large number of computational scientists working in
a broad range of disciplines, and substantial computational resources,
including a Cray Y-MP supercomputer, a massively parallel CM-2, and a large
cluster of high performance workstations.

Applications should include a current resume and three letters of 
reference. Applications should be sent to:

Professor Dennis W. Duke
Supercomputer Computations Research Institute
Florida State University
Tallahassee, FL 32306

email: dduke@scri.fsu.edu

Florida State University is an equal opportunity/affirmative action
employer.
From: UNCKEP@UNC.BITNET
Newsgroups: comp.theory.dynamic-sys
Subject: Meeting
Date: 22 Jan 93 20:25:00 GMT
Reply-To: UNCKEP%UNC.BITNET@cmsa.Berkeley.EDU
Distribution: inet
Organization: The Internet


   CONFERENCE on Ergodic Theory and its Connections with Harmonic Analysis
                           May 24-28, 1993
                          Alexandria, Egypt

PROGRAM:  There will be survey talks on

      Singular measures on the circle and spectral theory, J.F. Mela
      Non-commutative harmonic analysis and rigidity phenomena in
   dynamics, R. Spatzier
      Fourier methods and almost everywhere convergence, M. Wierdl and J.
   Rosenblatt
      Relations among spectral properties and dynamic structure, J.P.
   Thouvenot
      Relations with number theory and combinatorics, V. Bergelson.

      There will be invited addresses as well as sessions for contributed
   papers



SHORT COURSES

      To provide the necessary background for people new to this research
area, the week before the meeting the conference will offer short courses
on ergodic theory, harmonic analysis, and number theory.


ORGANIZERS

        Karl Petersen                                            Ibrahim Salama
        Dept. of Mathematics                               School of Business
        CB 3250, Phillips Hall                           N. Carolina Central Uni
v.
        Univ. of N. Carolina                               Durham, NC 27707  USA
        Chapel Hill, NC 27599  USA                    e-mail: salama@cs.unc.edu
        e-mail: unckep@unc.bitnet


CALL FOR PAPERS

        To give a short talk, send an abstract to Karl Petersen at the
address above.


INFORMATION AND CORRESPONDENCE

        Contact Ibrahim Salama at the address above.
From: lemenec@lynus.inria.fr (Ste'phane Le Me'nec)
Newsgroups: comp.theory.dynamic-sys
Subject: Re: Postdoctoral postion available
Date: 26 Jan 93 13:01:55 GMT
Reply-To: lemenec@sophia.inria.fr
Followup-To: sophia.emplois
Organization: INRIA Sophia-Antipolis

In article <11813@sun13.scri.fsu.edu>, dduke@ibm1.scri.fsu.edu (Dennis Duke) writes:
|> 
|>                    POSTDOCTORAL POSITION
|> 
|> Applications are invited for a postdoctoral postition with a group involved
|> in using numerical methods of nonlinear dynamics and deterministic chaos
|> to analyze human EEG data. Candidates should have a PhD degree in some
|> appropriate field, such as physics or applied mathematics, and experience
|> in computational science. Some background in EEG psychophysiology 
|> would be useful, but is not essential.
|> 
|> The Supercomputer Computations Research Institute offers an excellent research
|> environment, including a large number of computational scientists working in
|> a broad range of disciplines, and substantial computational resources,
|> including a Cray Y-MP supercomputer, a massively parallel CM-2, and a large
|> cluster of high performance workstations.
|> 
|> Applications should include a current resume and three letters of 
|> reference. Applications should be sent to:
|> 
|> Professor Dennis W. Duke
|> Supercomputer Computations Research Institute
|> Florida State University
|> Tallahassee, FL 32306
|> 
|> email: dduke@scri.fsu.edu
|> 
|> Florida State University is an equal opportunity/affirmative action
|> employer.

-- 

Stephane.

*************************************
Ste'phane Le Me'nec   
e-mail : lemenec@sophia.inria.fr
Te'l   : 93 65 77 46
Inria-Cermics - projet Secoia
*************************************
From: tridge@andosl.anu.edu.au (Andrew Tridgell)
Newsgroups: comp.speech
Subject: Re: Non-realtime speech transcription?
Date: 26 Jan 1993 23:08:40 GMT
Organization: CSLab, Autralian National Uni.
Distribution: world
NNTP-Posting-Host: 150.203.15.21

In article <TOM.93Jan25090338@amber.ssd.csd.harris.com>, tom@ssd.csd.harris.com (Tom Horsley) writes:

> An awful lot of the stuff in this group seems to be concerned with realtime
> speech recognition (which is understandable, since it would be so useful),
> but I am curious to know if there has been any research or actual
> development of systems which can do a *really* good job of generating
> transcripts of multi-speaker conversations, even if it can't be done in real
> time (for instance, taking overnight to transcribe a 1/2 hour recording
> would not be too unreasonable).

I think most research systems are NOT real-time. I know mine is far
from it at the moment. The difference between a real-time and off-line
recogniser is basically the grunt of the computer it runs on.

I think its mostly the commercial systems that try for real-time
performance. These start as non-real-time systems and then they put
them on fancy hardware.

Andrew


-- 
=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
Andrew Tridgell                 CSLab, Research School of Physical Sciences
Andrew.Tridgell@anu.edu.au      Australian National University (x3064)
=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
Newsgroups: comp.speech
From: dan@ennex1.eng.utsa.edu (Daniel Shelton)
Subject: standard data for speech recognition
Reply-To: dan@ennex1.eng.utsa.edu (Daniel Shelton)
Organization: Univ of Texas at San Antonio
Date: Thu, 21 Jan 1993 22:49:49 GMT

Hello All and Everyone,

	I plan on doing my thesis on speech recognition and am interested
in obtaining standarized data.  Does DARPA or any other organization have
an ftp site with this type of data?

Thanks for any info,

Dan (dan@ennex1.eng.utsa.edu)hesis on speech recognition and am interested
in obtaining standarized data.  Does DARPA or any other organization have
an ftp site with this type of data?

Thanks for any info,

Dan (da
From: lee@turbo4.rsg.hac.com (C. Lee)
Newsgroups: comp.speech
Subject: Re: foNETiks
Date: 22 Jan 93 20:45:02 GMT
Organization: Hughes Transportation Simulation Center, HAC; Culver City, CA

In article <C13z0E.6xF@news.udel.edu> 18669@brahms.udel.edu (Steven R Hoskins) writes:
>There is an interest group, called "foNETiks", that I would like to subscribe
>to ....  my information says the moderator is at r34334@UQAM.BITNET but
>the network claims there is no such user there ....

I've also heard of this group and have tried to subscribe, with the same
results.  If anyone knows how to subscribe, place post here or email to me
also.

Thanks.
Newsgroups: comp.speech
From: Gerry.Mulvenna@launchpad.unc.edu (Gerry Mulvenna)
Subject: Apollo Dolphin Speech synthesizer
Organization: University of North Carolina Extended Bulletin Board Service
Date: Thu, 28 Jan 1993 10:09:36 GMT

I have got a lend of a small speech synthesizer which plugs into
any RS232 port, processing any text it receives at 9600 baud.  It
appears to be called an Apollo by Dolphin systems.  I have no access
to a manual so I was wondering if anyone out there had come across this
type of system.  If so, are there any special characters one can type 
to represent phonemes etc.  At present we have merely been able to figure
out that a "." represents a pause.  Thanks for any help.

Gerry Mulvenna (osg1688@v2.qub.ac.uk)
Research Associate
The Queen's University of Belfast
Ireland 

--
   The opinions expressed are not necessarily those of the University of
     North Carolina at Chapel Hill, the Campus Office for Information
        Technology, or the Experimental Bulletin Board Service.
           internet:  laUNChpad.unc.edu or 152.2.22.80
From: tridge@andosl.anu.edu.au (Andrew Tridgell)
Newsgroups: comp.speech
Subject: Re: Null Transitions in HMMs
Date: 21 Jan 1993 22:14:45 GMT
Organization: CSLab, Autralian National Uni.
Distribution: world
NNTP-Posting-Host: 150.203.15.21

In article <1993Jan20.031204.1652@seas.gwu.edu>, marshall@seas.gwu.edu (Christopher Marshall) writes:
> Back in October I posted a plea for help in understanding null transitions in
> HMMs. My thanks to Imoto Takashi, Les Niles, and Wieland Eckert who spent a
> lot of time corresponding with me through email to try to explain them to me.
> 
> Unfortunately, although I learned some things, I never learned how
> to implement null transitions in the evaluation problem of HMMs. I have
> since left and come back to the problem.
> etc....


> Now, I can not for the life of me figure out how to modify this procedure
> to incorporate null transitions.
> 
> Does anyone know how to do this?

The solution to this is to NOT change the equations at all - but to
change A(i,j) and B(i,j,k). 

A(i,j) is defined by you as the probability of moving from state i to
state j in 1 time step. If we instead define it as the probability of
moving from state i to state j while producing exactly one output then
the problem is solved. If there are no null transitions then these
definitions are equivalent.

B(i,j,k) is similarly defined normally as the probability of producing
symbol k given that a transition is made in one time step from state i
to state j. The new definition will be the probability of producing
symbol k given that exactly one output is produced in a move from
state i to state j.

An example will make this clearer (I hope). Say you already have the
A(i,j) and B(i,j,k) for no null transitions. Then say we add a null
transition from state s1 to state s2 and wish to find A'(i,j) and
B'(i,j,k) including this transition. We can write:

	A'(i,s2) = A(i,s2) + A(i,s1)
	B'(i,s2,k) = B(i,s2,k) + B(i,s1,k)


I will be interested to hear of any other suggestions you may receive.


Andrew	


-- 
=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
Andrew Tridgell                 CSLab, Research School of Physical Sciences
Andrew.Tridgell@anu.edu.au      Australian National University (x3064)
=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
From: ccwang@edison.seas.ucla.edu (Charles C. Wang)
Newsgroups: comp.speech
Subject: CELP codes  needed
Date: 28 Jan 93 04:30:25 GMT
Organization: SEASnet, University of California, Los Angeles

Hello,

I am new to this group so I am not sure if this has been done before.  I'd like
to have a code-excited linear prediction program, perferably in C or Fortran.
If anyone has a copy or knows where I get get one through ftp, please post or
email me at ccwang@seas.ucla.edu.

Thanx in advance,

Charles W.
 
Newsgroups: comp.speech
From: bieler@eeh.ee.ethz.ch (Kaspar Bieler)
Subject: HMM applications
Keywords: 
 
Organization: ETH Zurich, Switzerland
Date: Wed, 27 Jan 1993 08:25:24 GMT

Hello world,

I'm looking for papers, books, reports ... about the application of
HMM in all areas (especially pattern recognition).

Every hints are welcomed.

Thanks in advance


e-mail: bieler@eeh.ee.ethz.ch
From: mmcohen@cats.ucsc.edu (Michael M Cohen)
Newsgroups: comp.speech
Subject: Re: not phonemes, but.. _______?
Date: 29 Jan 1993 01:07:44 GMT
Organization: University of California; Santa Cruz
NNTP-Posting-Host: si.ucsc.edu


In <RG.93Jan26210205@nymph.msel.unh.edu> rg@msel.unh.edu writes:

> 
> What is the term for the unit of speech that takes into account the preceeding
> and trailing sounds?  I seem to recall reading something about that using this
> method instead of phonemes produced much more normal sounding speech, and that
> there were still a reasonable (300-400?) number of these units in the english
> language.

Probably "diphones" which take into account 2 phonemes at a time.
Peterson, Wang& Silverstein (1958) (jasa v30 739-742) proposed
using "dyads" - "containing parts of 2 phones with theis mutual
influence in the middle of the segment" - about 8000 used in
dictionary. Also Wayne Wickelgren proposed 3 part thingies
xYz which are called "wickelphones"...


-- 

======================================================================
=   Dr. Michael M. Cohen                   mmcohen@dewi.ucsc.edu     = 
=   Program in Experimental Psychology     mmcohen@fuzzy.ucsc.edu    =
=   433 Clark Kerr Hall                    408-459-2655 LAB          = 
=   University of California - Santa Cruz  408-459-2700 MSGS         = 
=   Santa Cruz, CA 95064                   408-459-3519 FAX          = 
======================================================================
Newsgroups: comp.speech
From: tom@ssd.csd.harris.com (Tom Horsley)
Subject: Non-realtime speech transcription?
Organization: Harris Computer Systems Division
Date: Mon, 25 Jan 1993 14:03:38 GMT

An awful lot of the stuff in this group seems to be concerned with realtime
speech recognition (which is understandable, since it would be so useful),
but I am curious to know if there has been any research or actual
development of systems which can do a *really* good job of generating
transcripts of multi-speaker conversations, even if it can't be done in real
time (for instance, taking overnight to transcribe a 1/2 hour recording
would not be too unreasonable).

With all the organizations selling transcripts of news programs and all the
government spooks doing covert recordings, you would think that this
"transcript generation" problem would be one undergoing active research.

If anyone can point me at papers or products concerned with this area of
speech recognition, I would appreciate the information.
--
======================================================================
domain: tahorsley@csd.harris.com       USMail: Tom Horsley
  uucp: ...!uunet!hcx1!tahorsley               511 Kingbird Circle
                                               Delray Beach, FL  33444
+==== Censorship is the only form of Obscenity ======================+
|     (Wait, I forgot government tobacco subsidies...)               |
+====================================================================+
From: BPHEINTZ@UCSVAX.UCS.UMASS.EDU (BRADLEY P HEINTZ)
Newsgroups: comp.speech
Subject: Progs and libs
Date: 26 Jan 93 23:59:40 GMT
Organization: B. P. Heintz & Associates
NNTP-Posting-Host: phobos.ucs.umass.edu
X-News-Reader: VMS NEWS 1.24

I'm looking for people, ftp sites, etc., etc., with speech recognition
programs or libraries in C/C++.  Anyone have any bright ideas?

Thanks ahead of time, 



*=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=*
I'm not into money.  I'm into freedom.

(413)546-5152
bpheintz@phobos.ucs.umass.edu