HDTenEightyP/NetNews huggingface dataset:
From: ophof@SERVER.uwindsor.ca (Scott Ophof)
Newsgroups: comp.mail.elm
Subject: Inconsistency in aliasing
Date: 6 Jan 1993 14:46:45 -0600
Organization: UTexas Mail-to-News Gateway
NNTP-Posting-Host: cs.utexas.edu

There's a bug in the aliasing facility.
When an item contains the following header fields ("From ", From: ",
"Reply-To: ", and "Sender:"), the full-name is taken from the "From: "
field, but the address from one of the other three fields (can't tell
which, since they are all the same addr).
I'm referring to the "a" command in the alias facility, btw.

Regards.
$$/


Newsgroups: comp.mail.elm
From: root@math10.mathematik.uni-bielefeld.de (System PRIVILEGED Account)
Subject: Elm 2.4 appends domain to local mail --- SOLVED!
Date: Thu, 7 Jan 1993 12:45:12 GMT
Organization: Math MadHouse Bielefeld, Germany


Hi netters,

the problem I mentioned in an earlier post is fixed. I installed 
version 2.4PL20 and now everything works fine. 

Cheers again for your help!

hoover
-- 
"What would they do if we just sailed away?"
root@math10.mathematik.uni-bielefeld.de           ---The crew that never rests.
Newsgroups: comp.mail.elm
From: dean@coplex.com (Dean Brooks)
Subject: Problems in elm2.4 PL20
Organization: Copper Electronics, Inc.
Date: Wed, 6 Jan 1993 16:28:03 GMT

Couple of problems in elm2.4.20:

1.  Using the new (C)hange Alias in the alias screen, the first
    name and the last name are displayed as the same thing (the entire
    string).  

2.  Do the following commands exactly as they are shown:

	a.  Enter elm by typing "elm" at the UNIX prompt.
	b.  Hit 'a' to enter the alias screen.
	c.  Hit 'x' to immediately leave the alias screen.
	d.  Press 'RETURN' to read the highlighted message.
	e.  Press 'i' to return to the main index screen.
	f.  Press 'x' to exit elm.

	When I do these exact commands in this order, I get:

		Bus Error signal!

		Emergency exit taken! All temp files intact!
--
<><> Dean Brooks                             Internet:   dean@coplex.com
<><> System Administrator / Postmaster       CompuServe: 70672,2405
<><> Copper Electronics, Inc.
From: ophof@SERVER.uwindsor.ca (Scott Ophof)
Newsgroups: comp.mail.elm
Subject: Re: List of enhancements
Date: 7 Jan 1993 05:55:48 -0600
Organization: UTexas Mail-to-News Gateway
NNTP-Posting-Host: cs.utexas.edu


On Wed, 30 Dec 92 08:52:28 EST tom@crc.doc.ca (Thomas Erskine) said:
>In article <9212290918.AA12334@SERVER.uwindsor.ca> you write:
>>On 28 Dec 1992 17:39:25 GMT bvaughan@sheps.Princeton.EDU (Barbara Vaughan) said:
>>>In article <9212280932.AA14332@SERVER.uwindsor.ca> ophof@SERVER.uwindsor.ca (Scott Ophof) writes:
>>>>  [ much deleted]
>>*INCLUDING* not "running off the end of the file"???
>Including two or three kinds of "not running off the end".

Would you please expand on those kinds?


>>If so, then please tell me where to get a copy; it isn't available
>>...
>see the end for archie's answer

Um..  "archie" didn't reply at all"?  Kinda empty at the end...  :-)


>>Of course, using a pager not default with "elm" creates a problem;
>>one cannot issue "elm"-related commands from within non-default
>>pagers.  So one needs to quit the pager to even issue a "reply"
>>command...  :-(
>>Same kind of problem when using an other editor than which comes with
>>"elm".   :-(
>I like pico (the small editor which comes with (but doesn't require) the
>pine mailer.  It can even be made to work on SysV type unixes if you're
>willing to modify the code a bit.

If "pico" is the editor used by the "pine" demo running on a machine
in Washington, then I'd like to refer you to a comment I posted to
the BITnet discussion list CW-EMAIL.  My general feeling was quite
negative.  Sorry, but I've been severely spoiled by a most wonderful
editor which has also been ported to Unix.  And I see no sense or
reason to learn umpteen editors which are minimalistic subsets of
that one editor, and which all do their thing just differently
enough to make typoes (USA-politician spelling ;-) ) every 10 to 20
keystrokes.
That's why I'm asking for any decent method to be able to issue
MUA-related commands from WITHIN the editor of ones choice.
For "elm" (and other Unix MUAs I've come across) it might mean a
totally different way of viewing how a MUA works.  Ie. not to see
reading/writing an item as a level deeper than the index (which
makes inter-communication between levels more difficult if not
impossible in Unix), but all modes at the SAME level.


Regards.
$$/    (F. Scott Ophof  <ophof@server.uwindsor.ca>)


Newsgroups: comp.doc.techreports,news.answers
From: wais@daneel.rdt.monash.edu.au (WAIS Information Services (Rik Harris maintainer))
Subject: Computer Science Tech Report Archive Sites [changes from last month]
Followup-To: comp.doc.techreports
Supersedes: <techrep-sites-diff_723219318@daneel.rdt.monash.edu.au>
Reply-To: rik.harris@fcit.monash.edu.au
Organization: Monash University, Melb., Australia.
Date: Wed, 6 Jan 1993 04:33:47 GMT
Expires: Wed, 17 Feb 1993 04:33:09 GMT

Archive-name: techreport-sites/diff
Last-modified: 1992-12-05

Here is a list of differences between last month's list of Technical
Report Archive Sites, and this months.  Entries with a '>' at the start of
them have been added since last month, and entries with a '<' at the start
have been removed.  In many situations, a site will have been both removed
and added.  In this case, a change has been made.

> name: Indiana University, Computer Science Department
ftp: cs.indiana.edu:pub/techreports
email: mailserv@cs.indiana.edu, "help" in body
contact: techreports@cs.indiana.edu
description: Computer Science technical reports

> name: Univerity of Copenhagen, Department of Computer Science
ftp: ftp.diku.dk:/pub/diku/semantics/papers
email:
contact: wiese@diku.dk
description:

> name: University of Missouri-Rolla, Department of Computer Science
ftp: cs.umr.edu:/tech-reports
email:
contact: csdept@cs.umr.edu
description: General Computer Science Technical Reports

> name: University of Toronto, Computer Engineering
ftp: ftp.eecg.toronto.edu
email:
contact: ftp-admin@eecg.toronto.edu
description: Technical reports

> name: University of Toronto, Computer Systems Research Institute
ftp: ftp.csri.toronto.edu
email: tr-mailserver@csri.toronto.edu
contact: archivist@csri.toronto.edu or reports@csri.toronto.edu
description: CSRI technical reports from 1985 to present

< name: University of Toronto, Computer Systems Research Institute
ftp: ftp.csri.toronto.edu
email: tr-mailserver@csri.toronto.edu
contact: reports@csri.toronto.edu
description: CSRI technical reports


rik.
-- 

For changes or suggestions, please send mail to rik.harris@fcit.monash.edu.au
or wais@rdt.monash.edu.au
From: jean@cse.ucsc.edu (Jean McKnight)
Newsgroups: comp.doc.techreports
Subject: UCSC TR: A Comparison of Two Implementations of the Token Ring Priority Function
Date: 5 Jan 1993 14:14:35 GMT
Organization: University of California, Santa Cruz (CE/CIS Boards)
NNTP-Posting-Host: oak.ucsc.edu
Originator: golding@oak

          University of California at Santa Cruz
Baskin Center for Computer Engineering and Information Sciences 

The following technical report is available electronically or as
a paper copy.  Instructions for getting either follow the abstract.


UCSC-CRL-92-55  (available electronically as ucsc-crl-92-55.ps.Z)
A COMPARISON OF TWO IMPLEMENTATIONS OF THE TOKEN RING PRIORITY FUNCTION
Ivan Fellner, Ivan Racko, Milos Racek, Karol Fabian, and Darrell Long
December 1992, 12 pages ($5.00)

Abstract:  System performance is strongly influenced by the quality
of its implementations.  We describe four ways of evaluating the
performance of two implementations of the priority mechanism used in
the Token Ring local area network.  We use various methods for
comparing the small priority machine's differences and show how a
simplified comparison can lead to bad results.  With connection to
the evaluation complexity, we also consider the simulation cost of
the implementation process.


This technical report is available electronically through either 
of the following methods:
1.  through anonymous ftp from ftp.cse.ucsc.edu, in /pub/tr. Log in 
    as "anonymous", use your email address as your password, specify 
    "binary" before getting the file.  Uncompress before printing.
2.  by mail to automatic mail server rnalib@ftp.cse.ucsc.edu.
    Put this command on the subject line or in the body of the message:
	@@ send ucsc-crl-92-55.ps.Z from tr
    To get the index or abstract list:
	@@ send INDEX from tr
	@@ send ABSTRACTS.1992 from tr
    To get the list of the tr directory:
	@@ list tr
    To get the list of commands and their syntax:
	@@ help commands

Order paper copies from:  Technical Library, Baskin Center for Computer 
Engineering & Information Sciences, UCSC, Santa Cruz  CA  95064.
Purchase orders are not accepted.  Checks or money orders must be
for U.S. dollars, payable through a U.S. bank, and made out to 
"UC Regents".

Questions:  jean@cse.ucsc.edu

===========================================================================
Co-moderator:  Richard Golding, Computer & Information Sciences, UC Santa Cruz
	    compdoc-techreports-request@ftp.cse.ucsc.edu
From: jean@cse.ucsc.edu (Jean McKnight)
Newsgroups: comp.doc.techreports
Subject: UCSC TR: Bounds on Approximate Steepest Descent for Likelihood Maximization in Exponential Families
Date: 6 Jan 1993 12:53:36 GMT
Organization: University of California, Santa Cruz (CE/CIS Boards)
NNTP-Posting-Host: oak.ucsc.edu
Keywords: exponential families, minimum relative entropy estimation,
Originator: golding@oak

          University of California at Santa Cruz
Baskin Center for Computer Engineering and Information Sciences 

The following technical report is available electronically or as
a paper copy.  Instructions for getting either follow the abstract.


UCSC-CRL-92-38   (available electronically as ucsc-crl-92-38.ps.Z)
BOUNDS ON APPROXIMATE STEEPEST DESCENT FOR LIKELIHOOD MAXIMIZATION
IN EXPONENTIAL FAMILIES
Nicolo` Cesa-Bianchi, Anders Krogh, and Manfred K. Warmuth
October 1992, 7 pages (paper copy $5.00)

Abstract:  An approximate steepest descent strategy converging, in
families of regular exponential densities, to maximum likelihood
estimates of density functions is described.  These density estimates
are also obtained by an application of the principle of minimum
relative entropy subject to empirical constraints.  We prove tight
bounds on the increase of the log-likelihood at each iteration of our
strategy for families of exponential densities whose log-densities
are spanned by a set of bounded basis functions.
Keywords:  exponential families, minimum relative entropy estimation,
steepest descent.


This technical report is available electronically through either 
of the following methods:
1.  through anonymous ftp from ftp.cse.ucsc.edu, in /pub/tr. Log in 
    as "anonymous", use your email address as your password, specify 
    "binary" before getting the file.  Uncompress before printing.
2.  by mail to automatic mail server rnalib@ftp.cse.ucsc.edu.
    Put this command on the subject line or in the body of the message:
	@@ send ucsc-crl-92-38.ps.Z from tr
    To get the index or abstract list:
	@@ send INDEX from tr
	@@ send ABSTRACTS.1992 from tr
    To get the list of the tr directory:
	@@ list tr
    To get the list of commands and their syntax:
	@@ help commands

Order paper copies from:  Technical Library, Baskin Center for Computer 
Engineering & Information Sciences, UCSC, Santa Cruz  CA  95064.
Purchase orders are not accepted.  Checks or money orders must be
for U.S. dollars, payable through a U.S. bank, and made out to 
"UC Regents".

Questions:  jean@cse.ucsc.edu

===========================================================================
Co-moderator:  Richard Golding, Computer & Information Sciences, UC Santa Cruz
	    compdoc-techreports-request@ftp.cse.ucsc.edu
From: jean@cse.ucsc.edu (Jean McKnight)
Newsgroups: comp.doc.techreports
Subject: UCSC TR: Dyamic Constrained Delauney Triangulation and Application to Multichip Module Layout
Keywords: Voronoi diagram, Delaunay triangulation, constrained Delauney
Date: 5 Jan 93 14:23:57 GMT
Organization: University of California, Santa Cruz (CE/CIS Boards)
NNTP-Posting-Host: oak.ucsc.edu
Originator: golding@oak


          University of California at Santa Cruz
Baskin Center for Computer Engineering and Information Sciences 

The following technical report is available electronically or as
a paper copy.  Instructions for getting either follow the abstract.


UCSC-CRL-92-35   (available electronically as ucsc-crl-92-35.ps.Z)
DYNAMIC CONSTRAINED DELAUNEY TRIANGULATION AND APPLICATION TO MULTICHIP 
MODULE LAYOUT
Yizhi Lu  (M.S. Thesis)
December 1991, 46 pages (paper copy $8.00)

Abstract:  The *Voronoi diagram* is a partition of a set S of N points
in a plane, such that each region is the locus of the points (x, y)
closer to a point of S than to any other point of S.  If no four points
are co-circular, the *Delaunay triangulation* is the straight-line dual
of the Voronoi diagram.  The triangulation may be *constrained*, that
is, a set of straight-line segments may be prespecified.
     This thesis presents some characteristics of constrained Delaunay
triangulation and introduces a set of numerically stable algorithms for
incremently constructing and updating constrained Delaunay triangulation.
     The dynamic constrained Delaunay triangulation algorithms have been
implemented in a layout system for multichip modules.  It has been used
as the underlying data representation for rubber-band sketch, a
topological routing for one layer.
     We have proved the O(n log n) expected running time for the Delauney
triangulation algorithm.
Keywords:  Voronoi diagram, Delaunay triangulation, constrained Delauney
triangulation, layout, multichip module, topological routing.

This technical report is available electronically through either 
of the following methods:
1.  through anonymous ftp from ftp.cse.ucsc.edu, in /pub/tr. Log in 
    as "anonymous", use your email address as your password, specify 
    "binary" before getting the file.  Uncompress before printing.
2.  by mail to automatic mail server rnalib@ftp.cse.ucsc.edu.
    Put this command on the subject line or in the body of the message:
	@@ send ucsc-crl-92-35.ps.Z from tr
    To get the index or abstract list:
	@@ send INDEX from tr
	@@ send ABSTRACTS.1992 from tr
    To get the list of the tr directory:
	@@ list tr
    To get the list of commands and their syntax:
	@@ help commands

Order paper copies from:  Technical Library, Baskin Center for Computer 
Engineering & Information Sciences, UCSC, Santa Cruz  CA  95064.
Purchase orders are not accepted.  Checks or money orders must be
for U.S. dollars, payable through a U.S. bank, and made out to 
"UC Regents".

Questions:  jean@cse.ucsc.edu

===========================================================================
Co-moderator:  Richard Golding, Computer & Information Sciences, UC Santa Cruz
	    compdoc-techreports-request@ftp.cse.ucsc.edu
From: jean@cse.ucsc.edu (Jean McKnight)
Newsgroups: comp.doc.techreports
Subject: UCSC TR: Geometric Tansformations for a Rubber-band Sketch
Date: 6 Jan 1993 12:54:02 GMT
Organization: University of California, Santa Cruz (CE/CIS Boards)
NNTP-Posting-Host: oak.ucsc.edu
Originator: golding@oak

          University of California at Santa Cruz
Baskin Center for Computer Engineering and Information Sciences 

The following technical report is available electronically or as
a paper copy.  Instructions for getting either follow the abstract.


UCSC-CRL-92-39   (available electronically as ucsc-crl-92-39.ps.Z)
GEOMETRIC TRANSFORMATIONS FOR A RUBBER-BAND SKETCH
David Joseph Staepelaere  (M.S. Thesis)
September 1992, 63 pages (paper copy $10.00)

Abstract:  The flexible rubber-band sketch is a useful representation
for routing interconnect.  In addition to supporting an incremental
design style, rubber-bands provide a flexible framework for generating
layout under performance constraints.  However, due to reasons of
compatibility between CAD tools, it may be necessary at times to
convert a rubber-band sketch to a more restricted geometry such as
rectilinear or octilinear wiring.  This paper presents an efficient
method, based on the enhanced plane sweep, for converting a rubber-
band sketch to a topologically equivalent rectilinear or octilinear
wiring with minimum wire length.  A sketch with  n  rubber-band segments
can be converted to a restricted geometry with  m  segments in
O(n \log n + m)  time.  In addition to guaranteeing minimum wire length,
the technique uses heuristic methods to reduce the total number of jogs.


This technical report is available electronically through either 
of the following methods:
1.  through anonymous ftp from ftp.cse.ucsc.edu, in /pub/tr. Log in 
    as "anonymous", use your email address as your password, specify 
    "binary" before getting the file.  Uncompress before printing.
2.  by mail to automatic mail server rnalib@ftp.cse.ucsc.edu.
    Put this command on the subject line or in the body of the message:
	@@ send ucsc-crl-92-39.ps.Z from tr
    To get the index or abstract list:
	@@ send INDEX from tr
	@@ send ABSTRACTS.1992 from tr
    To get the list of the tr directory:
	@@ list tr
    To get the list of commands and their syntax:
	@@ help commands

Order paper copies from:  Technical Library, Baskin Center for Computer 
Engineering & Information Sciences, UCSC, Santa Cruz  CA  95064.
Purchase orders are not accepted.  Checks or money orders must be
for U.S. dollars, payable through a U.S. bank, and made out to 
"UC Regents".

Questions:  jean@cse.ucsc.edu

===========================================================================
Co-moderator:  Richard Golding, Computer & Information Sciences, UC Santa Cruz
	    compdoc-techreports-request@ftp.cse.ucsc.edu


Newsgroups: comp.doc.techreports,news.answers
From: jean@cse.ucsc.edu (Jean McKnight)
Newsgroups: comp.doc.techreports
Subject: UCSC TR:  On Weak Learning
Date: 5 Jan 93 14:18:05 GMT
Organization: University of California, Santa Cruz (CE/CIS Boards)
NNTP-Posting-Host: oak.ucsc.edu
Originator: golding@oak


          University of California at Santa Cruz
Baskin Center for Computer Engineering and Information Sciences 

The following technical report is available electronically or as
a paper copy.  Instructions for getting either follow the abstract.


UCSC-CRL-92-54  (available electronically as ucsc-crl-92-54.ps.Z)
ON WEAK LEARNING
David P. Helmbold and Manfred K. Warmuth
December 1992, 37 pages ($7.00)

Abstract:  An algorithm is a weak learning algorithm if with some
small probability it outputs a hypothesis with error slightly below
50%.  This paper presents relationships between weak learning, weak
prediction (where the probability of being correct is slightly larger 
than 50%), and consistency oracles (which decide whether or not a given 
set of examples is consistent with a concept in the class).  Our main 
result is a simple polynomial prediction algorithm which makes only a 
single query to a consistency oracle and whose predictions have a 
polynomial edge over random guessing.  We compare this prediction
algorithm with several of the standard prediction techniques, deriving
an improved worst case bound on Gibbs Algorithm in the process.  We use 
our algorithm to show that a concept class is polynomially learnable if 
and only if there is a polynomial probabilistic consistency oracle for 
the class.  Since strong learning algorithms can be built from weak 
learning algorithms, our results also characterizes strong learnability.


This technical report is available electronically through either 
of the following methods:
1.  through anonymous ftp from ftp.cse.ucsc.edu, in /pub/tr. Log in 
    as "anonymous", use your email address as your password, specify 
    "binary" before getting the file.  Uncompress before printing.
2.  by mail to automatic mail server rnalib@ftp.cse.ucsc.edu.
    Put this command on the subject line or in the body of the message:
	@@ send ucsc-crl-92-54.ps.Z from tr
    To get the index or abstract list:
	@@ send INDEX from tr
	@@ send ABSTRACTS.1992 from tr
    To get the list of the tr directory:
	@@ list tr
    To get the list of commands and their syntax:
	@@ help commands

Order paper copies from:  Technical Library, Baskin Center for Computer 
Engineering & Information Sciences, UCSC, Santa Cruz  CA  95064.
Purchase orders are not accepted.  Checks or money orders must be
for U.S. dollars, payable through a U.S. bank, and made out to 
"UC Regents".

Questions:  jean@cse.ucsc.edu

===========================================================================
Co-moderator:  Richard Golding, Computer & Information Sciences, UC Santa Cruz
	    compdoc-techreports-request@ftp.cse.ucsc.edu
Newsgroups: comp.doc.techreports
From: src-report@src.dec.com (James Mason)
Newsgroups: comp.doc.techreports
Subject: SRC Research Report #91
Date: 5 Jan 93 14:21:42 GMT
Organization: DEC Systems Research Center
NNTP-Posting-Host: oak.ucsc.edu
Originator: golding@oak

The following SRC Research Report is now available:


Authors: Martin Abadi and Leslie Lamport 
Title: An Old-Fashioned Recipe for Real Time
Date: October 12, 1992
Report #91, October 12, 1992
Length: 67 pages
Availability: anonymous FTP from gatekeeeper.pa.dec.com
Directory: /pub/DEC/SRC/research-reports/




Authors' abstract:

Traditional methods for specifying and reasoning about concurrent
systems work for real-time systems. Using TLA (the temporal logic of
actions), we illustrate how they work with the examples of a queue and
of a mutual-exclusion protocol. In general, two problems must be
addressed: avoiding the real-time programming version of Zeno's
paradox, and coping with circularities when composing real-time
assumption/guarantee specifications. Their solutions rest on properties
of machine closure and realizability.


===========================================================================
Co-moderator:  Richard Golding, Computer & Information Sciences, UC Santa Cruz
	    compdoc-techreports-request@ftp.cse.ucsc.edu
Newsgroups: comp.doc.techreports