HDTenEightyP/NetNews huggingface dataset:
From: mclemens@silver.ucs.indiana.edu (Mike Clemens)
Subject: Re: Demo of Finale ?
Organization: Indiana University
Date: Mon, 7 Sep 1992 03:00:10 GMT

I'm not sure about local companies for you, but Coda software's fax# is
612-854-4631

Their flyer says "demo disks available."  They give a (US) 800 number to get
the nearest dealer: 1-800-843-2066

Other info:

Coda Music Software
1401 E. 79th St.
Minneapolis, MN  55425
USA

(612) 854-1288  (standard voice)

Good luck!
- Mike
From: mgd@world.std.com (Matthew G Davidson)
Newsgroups: comp.music
Subject: Re: Aural-to-notation processing?
Date: 14 Sep 92 23:01:55 GMT
Organization: The World Public Access UNIX, Brookline, MA

music-research-request@cattell.psych.upenn.edu writes:

>Does anyone know of a program that processes sounds and converts them
>to notation?  

Sure.

It's easy and inexpensive: your brain.


Matthew Davidson
Berklee College of Music
Newsgroups: comp.music
From: rtaylor@hns.com (Randy Taylor)
Subject: Re: sequencers for e-drums
Originator: rtaylor@rtaylor
Organization: Hughes Network Systems Inc.
Date: Tue, 8 Sep 1992 15:26:28 GMT


In article <BtzI91.Mqz@hatch.socal.com>, jps@hatch.socal.com (J. P. Scott) writes:
|> greetings,
|> 
|> among the collective net wisdom, is there a sequencing program
|> that is atop the "short list" for programming drum computers?
|> 
|> thanks,
|> 
|> james

Try "Drummer" from Cool Shoes Software.  It's reasonably priced (< $150)
and the new version (shipping on or about 9/20) has a lot of great new
features.  THE*DRUMS is a shareware program available on Compu$erve
and America On-Line, and probably a lot of other MIDI BBS's as well.
"Drummer" is DOS based, and THE*DRUMS is Windows based.

Randy Taylor
rtaylor@hns.com
73750.3557@compuserve.com
jrtaylor@pan.com
 
-- 
A host is a host from coast to coast..............     _ _ /|  
& no one will talk to a host that's close.........     \'o.O'  
Unless the host (that isn't close)................     =(___)= 
is busy, hung or dead.............................        U    
Newsgroups: comp.music
From: stefan@sinus.stgt.sub.org (Stefan Bechtold)
Subject: Re: low-cost MIDI for IBM PC / Finale
Organization: Sinus Stuttgart, Germany
Date: Fri, 4 Sep 1992 13:15:55 GMT

burnstc@ucunix.san.uc.edu (Thomas C Burns) writes:

>I am using Finale 2.0.1 on an IBM PC with no MIDI anything.  I'd like info on
>the lowest-cost way of being able to :
>	1) Hear what I've written (up to 12 voices)
>	2) Be able to enter music from a MIDI keyboard (I don't play piano, so 
>		a big fancy-schmancy keyboard is pointless)
>Short of buying a freight-car-load of equipment that the local "trust me man,
>I'm not on commission" music store salesman is trying to hustle, what can 
>I do?  The music I'm writing is for classical chamber ensembles, so I'll never
>use the rig for performance.  Thanks in advance for any advice.

>P.S.  I'm posting this for a friend (he dictated the message.), but any e-mail
>	to me will get to him.
Please post your replies as I'm interested in that, too...

Thank you,
Stefan


-- 
+ Stefan Bechtold # stefanb@delos.stgt.sub.org # Voice +49 711 813240 +
++++++++sed nemo potuit tangere: merda fuit ! (Martial III 17)+++++++++
From: chardin@cbnewsk.cb.att.com (christopher.hardin)
Subject: WANTED: Band in a Box User Styles
Organization: AT&T
Distribution: na
Date: Mon, 14 Sep 1992 18:21:27 GMT

Greetings,

	I have Band in a Box version 5.0 and it's loads of fun.  I was
wondering if anyone had any user defined styles they would like to share
with me.  Thanks for your help.

	As an aside, does any one have any experience with Jammer and how
does it compare to Band in a Box (ease of use, natural sounding sequences,
etc.)?
---
Chris Hardin	chris@green.att.com	...!att!green!chris	404.750.5246
-- 
Chris Hardin	chris@green.att.com	...!att!green!chris	404.750.5246
Xref: sparky comp.music:4379 misc.forsale:25946 misc.wanted:8303 rec.music.synth:14680
From: cfoley@Bonnie.ICS.UCI.EDU (Ciaran Foley)
Subject: Powerbook 100 for SALE!
Newsgroups: comp.music,misc.forsale,misc.wanted,rec.music.synth
Date: 10 Sep 92 18:27:22 GMT

2/20 W/ Superdrive
Brand new in box
Never opened w / Apple's 1 year warranty

Best offer gets it!

reply to Steventr@bonnie.ics.uci.edu


thanks!
Ciaran!
From: scot@asstdc.oz.au (Scot Art)
Sender: fredmail@asstdc.oz.au
Newsgroups: comp.music
Subject: sequencers for e-drums
Date: Wed, 09 Sep 1992 23:37:44 +1000

 JPS> From: jps@hatch.socal.com (J. P. Scott)

 JPS> among the collective net wisdom, is there a sequencing program
 JPS> that is atop the "short list" for programming drum computers?

Sure, I have Cubase (on an ST but also available for Windows and Macs), and I
have never seen another sequencer with as powerful a drum pattern editor as it
has. Beware this is an expensive program, however.

Actually, I wish I had a program which would allow me to program my Roland R-8
via sys-ex. Anyone know of such a beast (Atari ST preferred by DOS or OS/2 is
OK too)?

ciao, Scot.
From: kjohnson@castor.cs.uga.edu (Kristopher Johnson)
Newsgroups: comp.music
Subject: Re: Where can I find MOD songs?
Date: 9 Sep 92 04:42:14 GMT
Organization: University of Georgia, Athens

In article <1992Sep6.151758.24847@newshub.ariel.yorku.ca> cs902125@ariel.yorku.ca (SHUK C YIP) writes:
>
>For Atari mods, they are two tracks or four tracks?

They have up to four tracks.
From: kono@csl.sony.co.jp (Shinji Kono)
Newsgroups: comp.specification
Subject: Re: Looking for linear temporal logic verifiers gnerating counterexamples
Date: 6 Sep 92 14:43:49 GMT
Reply-To: kono@csl.sony.co.jp
Organization: Sony Computer Science Laboratory, Inc.

In article <lma.715653113@dayton.Stanford.EDU> , 
	lma@dayton.Stanford.EDU (Larry Augustin) writes 
>I'm looking for algorithms for producing counterexamples for linear
>propositional temporal logic (LPTL) verification.

This is a rather easy part in temporal logic verification.  In
automaton gerating or tableau method, you have a finite automaton,
which accepts satisfiable state of givien temporal logic formula.  Your
problem is how to find a path from start to end in the automaton.

By tracing from the  terminal state, the shortest example can be found
easily. But if you try to find interesting example or meaningfull
example, it will be difficult.

I have such a verifier written in Prolog for Interval temporal logic (
a variant of LPTL). 
---
Shinji Kono @           kono@csl.sony.co.jp
Sony Computer Science Laboratory, Inc,Japan
Newsgroups: comp.specification
From: grow@mindvox.phantom.com (George Row)
Subject: z
Keywords: z
Organization: [Phantom Access] / the MindVox system
Distribution: ?
Date: Thu, 10 Sep 1992 08:54:39 GMT



George Row                  grow@mindvox.phantom.com  on internet
                            cfyx33@mgvax.ulster.ac.uk on Janet
University of Ulster at Magee College
From: alan@cs.napier.ac.uk (Alan Richardson)
Newsgroups: comp.specification.z
Subject: (none)
Date: 15 Sep 92 09:06:16 GMT
X-Mailer: mail-news 2.0.3

Hi,
    Could you please add me to the Zforum mailing list.
From: moreaux@litsun22.epfl.ch (Michel Moreaux)
Newsgroups: comp.specification.z
Subject: oz.sty incompatible with NFSS
Date: 7 Sep 92 14:46:37 GMT
Reply-To: moreaux@litsun.epfl.ch
Distribution: comp
Organization: Laboratoire d'informatique technique


Recently, we have installed ML-TeX on our system. We though it would be also
smart to install simultaneously NFSS. But, we had to postpone this very latest
improvement since oz.sty does NOT compile with a version of LaTeX that includes
NFSS (more precisely, statements like e.g. \@halfmag produce an error). It is
mandatory to fix that problem since I have heard that NFSS will be part of the
new release of LaTeX (I mean that the new release of TeX will include NFSS).

-Michel.
--
------------------------------------------------------------------------------
Michel Moreaux,                           | "Ceux qui ne savent rien en savent
Ecole Polytechnique Federale de Lausanne  |  toujours tout autant que ceux qui
Departement d'Informatique                |  n'en savent pas plus qu'eux"
Laboratoire d'Informatique Technique      |                  P. Dac.
EL-Ecublens                               |___________________________________
CH-1015 Lausanne                           
Phone # : (21) 693-46-72,   e-mail : moreaux@litsun.epfl.ch
------------------------------------------------------------------------------
Newsgroups: comp.specification.z
From: stanton@marsh.cs.curtin.edu.au (Wayne Stanton)
Subject: Free Types and Parse Trees
Summary: Problems working out free types, in Z.
Keywords: Free Type
Organization: Curtin University of Technology
Date: Mon, 7 Sep 1992 06:41:02 GMT

I am trying to workout how to apply free types to a parse tree
structure.
That is, how can I use the mechanism described by Spivey
	Paragraph ::=  Ident ::= Branch | ... | Branch
	Brach     ::=  Ident [ <<Expression>> ]
to define a syntax specification, such as 
	Expression ::= Expression "+" Expression
		   |   Expression "*" Expression
		   ...
		   |   Number

If anyone knows of any papers or other sources of information
describing how to do this, I would greatly appreciate the 
assistance.

Wayne Stanton
email: stanton@marsh.cs.curtin.edu.au
	Curtin University
	Computer Science Department
	Western Australia
From: schin@acs.bu.edu (neil schier)
Newsgroups: comp.specification
Subject: Needed a 3A 9.5V laptop adapter
Keywords: PCMCIA
Date: 12 Sep 92 20:18:21 GMT
Organization: Boston University, Boston, MA, USA


Hello

The fuse on mine is shot. But this thing has been a pain does anyone know
where I can get a new one. Radio Shack near me did not have one.

Regards
Newsgroups: comp.specification
From: lma@dayton.Stanford.EDU (Larry Augustin)
Subject: Looking for linear temporal logic verifiers gnerating counterexamples
Organization: DSO, Stanford University
Date:  5 Sep 92 00:31:53 GMT

I'm looking for algorithms for producing counterexamples for linear
propositional temporal logic (LPTL) verification.

That is, given two LPTL formulae p and q, check if (p implies q) is
valid (check if the complement is satisfiable), and, if it's not,
produce an example of a sequence that satisfies p but not q.  It's the
counterexample part that I'm interested in.

Thanks,

Larry

---

Larry M. Augustin			ERL 414, M/C 4055
lma@dayton.stanford.edu			Computer Systems Lab
+1 415.723.9285 (voice)			Stanford University
+1 415.725.7398 (fax)			Stanford, CA 94305
Newsgroups: comp.specification,sci.logic
From: Oliver Schoett <schoett@informatik.tu-muenchen.de>
Subject: Re: Looking for paper about quantification
Organization: Inst. fuer Informatik, Technische Univ. Muenchen, Germany
Date: Fri, 11 Sep 1992 18:41:30 GMT

In article <BtyBLw.42q@dcs.glasgow.ac.uk> areid@dcs.glasgow.ac.uk
(Alastair Reid) writes:

   [Problem: with the usual definition of valuation, there are no
   valuations if a carrier of a many-sorted algebra is empty]

This problem can be solved quite elegantly by requiring a valuation to
be defined on the free variables of a term or formula, rather than on
all variables.

In a recent paper (available by FTP, see below), I used the following
definitions:

   (The notation ``\dom f'' denotes the domain, ``\ran f'' the range
   of a function, ``FV(t)'' the set of freee variables of a term or
   formula.  By convention, S is the set of sorts of a signature
   \Sigma)

   Definition (assignment)

   Let a signature \Sigma and a \Sigma-algebra A be given.  An
   \em{assignment} into A is an S-sorted mapping a that satisfies 
   \ran a_s \subset A_s for all s \in S.  If X is an S-sorted set such
   that X_s \subset \dom a_s for all s \in S, we write ``a: X ~~> A''.
 
   Definition (evaluation of terms)

   Let \Sigma be a signature and let A be a \Sigma-algebra.  By
   induction on \Sigma-terms, we define for each term t an
   \df{evaluation function}

      t_A: { a: FV(t) ~~> A } --> A_s,   where s is the sort of t:

   (follows the usual definition)

   Definition (satisfaction of formulas)

   Let \Sigma be a signature and let M be a \Sigma-algebra.  The
   notation ``M \sat \phi[a]'' will mean that M \em{satisfies} the
   formula \phi under the assignment a: FV(\phi) ~~> M.  The
   satisfaction relation is defined inductively:

   (follows the usual definition)

This way, closed formulas get the right semantics, even if they
involve quantification over empty carriers.  I have not thought about
proof systems.  My feeling is that empty carriers should be accepted
as natural and not be shied away from.

The paper from which this is taken does not deal specifically with
empty carriers, but shows that first-order logic cannot specify
behavioural equivalence classes of algebras:

  ``Two Impossibility Theorems on Behaviour Specification of Abstract
  Data Types''

  (to appear in Acta Informatica)

  available by anonymous FTP from 
  flop.informatik.tu-muenchen.de (131.159.8.35)

        798  Aug 28 15:01  /pub/theory/schoett/README
      67393  Aug 21 11:35  /pub/theory/schoett/imposs.dvi.Z
     120179  Aug 21 11:39  /pub/theory/schoett/imposs.ps.Z


Oliver Schoett     Inst. f. Informatik (H2), Technische Univ. M"unchen
                   Postfach 20 24 20,     8000 M"unchen 2,     Germany
schoett@informatik.tu-muenchen.de    phone +49 89 2105-2399  fax -8207
From: charlot@sun3.lri.fr (Francois Charlot)
Newsgroups: comp.specification
Subject: Specification and Abstraction in concrete life !
Keywords: Specification, abstraction, small examples
Date: 15 Sep 92 09:05:21 GMT
Reply-To: charlot@lri.lri.fr (Francois Charlot)
Followup-To: comp.specification.Z
Organization: Laboratoire de Recherche en Informatique - Universite Paris-Sud Orsay

Hello netters.

I'm posting this article for the second time and I'm sorry for
those who have already answered me (thanks very much for helping
me). I've posted this message in July, and I did receive some
answers about a part of it ; there is still an important point
I would like to solve, and that's the reason why I post this
message again :

I've just started a PhD Thesis in Computer Science, in cooperation
with a French company. The subject of the Thesis is dealing with
specification and I have to use abstraction techniques to specify
a huge software. The fact is that, today, the company didn't write
informal specifications, but they intend to do it (together with me).
The first task I would like to realize is to explain to some folks
of the company what are the interests of abstraction and specification.

Does anybody there know if I could find some documents describing :

          - Informal specification of a "school-problem" (lifts, coffee-
            machine, ...)

          - Abstract formal specification derived from the previous one
            (with informal comments to explain how the derivation is made)

          - Refinement of the previous specification (pascal-like for instance)


Please, e-mail me ALL the (even small) informations you know about this
kind of work.


			Thanks in advance.

N.B. :

For those who would like a summary of the answers I (hope I)
will receive, just send me an e-mail : I will answer as soon as
I'll have ``enough'' answers.


+--------------------------+------------------------------------+
|                          |    E-mail : charlot@lri.lri.fr     |
|     Francois CHARLOT     |             charlot@FRLRI61.BITNET |
|                          |                                    |
|        +-=-+-=-+         |    Tel    : 33 - 1 - 69 41 70 82   |
|                          |    Fax    : 33 - 1 - 69 41 65 86   |
+--------------------------+------------------------------------+
|      ######      **                                           |
|     ##     #         Laboratoire de Recherche en Informatique |
|    ##       #   ##   Batiment 490                             |
|   ##       #   ##    Universite de Paris-Sud                  |
|  ##    ####   ##     91405 ORSAY CEDEX                        |
| ######    ## ##      FRANCE                                   |
|######      ###                                                |
+---------------------------------------------------------------+
From: tony@iti.org (Anthony Skjellum)
Subject: new paper on Zipcode
Summary: A new paper available on Zipcode via e-mail or postal mail
Keywords: message-passing, Zipcode, portability
Reply-To: tony@helios.llnl.gov
Organization: Clemson University
Date: 6 Sep 92 22:34:51 GMT


Our latest paper on Zipcode, "The Zipcode Message-Passing System" by
Skjellum Smith, Still, Leung and Morari, is available as uuencoded,
compressed postscript.  Zipcode is an advanced message passing system
that supports multiple classes of messages, and multiple, independent
context of message passing.  It is very helpful to anyone who contemplates
building libraries for multicomputers or distributed computing.  It is
also helpful for those who want to mix "legacy" message passing codes
that use several different vendor notations.

The report will be of interest to those who are interested in both
multicomputers and distributed computing (including heterogeneity).
The latest version of the Zipcode software, as described in this
report, will be available approximately October 1 (hopefully by
netlib).  Additional documents including a user manual, to be
included.  

If you prefer hardcopy, please send your full postal address.
- Tony Skjellum


--
 	.	.	.	.	.	.	.	.	.      .
"They also serve who only stand and wait." - J. Milton

Anthony Skjellum, LLNL, (510)422-1161; FAX: (510)423-2993; tony@helios.llnl.gov

Newsgroups: comp.parallel
From: ghosh@CS.YALE.EDU (Bhaskar Ghosh)
Subject: load balancing references and Agarwal
Organization: Yale University, Department of Computer Science, New Haven, CT
Date: 9 Sep 1992 13:50:51 -0400


I have received 36 messages with load balancing references and 10 with
Dharma Agarwal's email address. Thanks for all the responses. In a
week or so, i will post a more compact list of references we find
interesting.

- bhaskar.


-- 
===============================================================================
Bhaskar Ghosh   	    		"Tomar pujar chholey, 
ghosh@cs.yale.edu  @yalecs.bitnet        Tomay bhulei thaki"- Robithakur
===============================================================================

Newsgroups: comp.parallel
From: keivan@wuphys.wustl.edu (Keivan Esfarjani)
Subject: Biblio. on supercomputing & parallel processing
Apparently-To: comp-parallel@uunet
Reply-To: keivan@wuphys.wustl.edu (Keivan Esfarjani)
Organization: Physics Dept, Washington U. in St Louis
Date: Tue, 8 Sep 1992 17:44:05 GMT

Thanx everybody for your replies concerning a bibliography
of supercomputers and parallel processing.
So this is the list of the books and journals that I got
from some of you.

* Review articles:

	- the August 1992 edition of Communications of ACM.
	- the August 1992 edition of Byte (I do not recommend!)

* Books:

	- George Almasi and Allan Gottlieb's "Highly Parallel Computing"
	  Benjamin/ Cummings Pub.
	- K. Hwang, F. A. Briggs' "Computer Architecture & Parallel
	  processing" . Mc Graw Hill Pub.
	-  F.T. Leighton's "Introduction To Parallel Algorithms &
	  Architectures" . Morgan Kaufmann Pub.
	- Greg Wilson's "Past, Present, Parallel: A Survey Of Parallel
	  Computing". Springer Pub.
        - Dongarra, J., Duff, I., Gaffney, P., McKee, S.'s "Vector 
	  and Parallel Computing : issues in applied research and 
	  development", Ellis Horwood Series in Computers and their 
	  Applications, John Wiley & Sons, England, 1989.
	 
* Technical Journals:

	- SIAM (but these are technical and very specific papers,
	  I did not find any review article on para. processing)
	- Parallelogram Magazine (btw, I didn't get the sample copy 
	  you promised Damon!)

* From the net:

	- Some pepole at siam.com
	- SuperNet:
	    SuperNet International is an internet service which provides 
	    on-line information about supercomputers.  

	    To access SUPERNET INT'L:
	    telnet or rlogin: supernet.ans.net or 147.225.1.51
	    (Remember! At the initial <login:> prompt, always enter as supernet, 
	    your <user name> will be prompted for later.)

	    Modem Dial-Up:    (408) 428-2565 vt100 N81
	    Support:          (800) 234-7977

Newsgroups: comp.parallel
From: sim@ecst.csuchico.edu (Seung Bae Im)
Subject: Access to Parallel computers?
Apparently-To: comp-parallel@uunet.uu.net
Organization: California State University, Chico
Date: Thu, 10 Sep 1992 23:45:52 GMT

Hello
I am a professor teaching parallel processing in an introductory
course. Once I read a message in this group which offered an access
to a parallel processor through the Internet.
I'd like my students have some experience in parallel programming.
I need netters' HELP here!!
Thank you in advance

Seung Bae Im
California State University
Chico, CA



Newsgroups: comp.parallel
From: saroff@msc.edu (Stephen Saroff MSCI/AHPCRC)
Subject: Terra Computers
Organization: Clemson University
Date: Tue, 8 Sep 92 17:04:07 CDT

I am interested in getting information about Terra computers and their
philosophy and architecture.


 ----                                                                     ----
 --                    saroff@msc.edu       Minn Supercomputer Center,Inc   --
 -  Stephen Saroff      612/626 1854          1200 Washington Ave S          - 
 --                     Fax:624 6550          Minneapolis, MN 55415         --
 ----                                                                     ----
From: zielke@fozzie.nrl.navy.mil (David Zielke)
Newsgroups: comp.parallel
Subject: Needed Parallel SOR for IPSC/860 Hypercube
Date: 11 Sep 92 20:50:47 GMT
Organization: Clemson University

I am looking for a parallel solver for a Two-dimensional Poisson
Equation.  For my sequential application I am currently using an
SOR method.  I can fit the other parts of the algorithm to the
data structures required to do this well.  Any suggestions or
pointers would be greatly appreciated.  

David Zielke
Naval Research Laboratory
zielke@fozzie.nrl.navy.mil
Newsgroups: comp.parallel
From: mailrus!samsung!ulowell!cs.ulowell.edu!wex@uunet.UU.NET (Paul M. Wexelblat)
Subject: Re: Synchonizing watches
Apparently-To: ulowell!uunet!comp-parallel
Originator: wex@bigmax.ulowell.edu
Reply-To: mailrus!samsung!ulowell!cs.ulowell.edu!wex@uunet.UU.NET
Organization: Univ. of Lowell CS Dept.
Date: Fri, 4 Sep 1992 19:19:06 GMT


In article <1992Sep4.140840.25529@hubcap.clemson.edu>, pds@epcc.edinburgh.ac.uk (Patrick Surry) writes:
|> [...]

|> I don't think so.  A says "BONG" at t=0.  At t=AB, B hears "BONG" and
|> starts counting, saying "zero" at t=AB, "one" at t=AB+1, ...
|> A will hear "zero" at time AB+BA  - there is no way for A to know
|> what number B has reached because A won't hear it for another BA seconds.
|> 
|> I think the earlier proof that no solution exists looked right.

AARGH, Never Mind

You are perfectly right

-- 
You are in a maze of twisty little passages, all alike.

	...Wex

Newsgroups: comp.parallel