From owner-reliable_computing [at] interval [dot] usl.edu  Tue Jan  4 11:40:16 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id LAA13431
	for reliable_computing-outgoing; Tue, 4 Jan 2000 11:40:16 -0600 (CST)
Received: from zmit1.ippt.gov.pl (zmit1.ippt.gov.pl [148.81.53.8])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id LAA13426
	for <reliable_computing [at] interval [dot] usl.edu>; Tue, 4 Jan 2000 11:40:00 -0600 (CST)
Received: (from zkulpa@localhost) by zmit1.ippt.gov.pl (8.8.5/8.7.3-zmit) id SAA05967; Tue, 4 Jan 2000 18:39:55 +0100 (MET)
Date: Tue, 4 Jan 2000 18:39:55 +0100 (MET)
From: Zenon Kulpa <zkulpa [at] zmit1 [dot] ippt.gov.pl>
Message-Id: <200001041739.SAA05967 [at] zmit1 [dot] ippt.gov.pl>
To: reliable_computing [at] interval [dot] usl.edu
Subject: Re: INTERVAL'2000
Cc: zkulpa [at] zmit1 [dot] ippt.gov.pl, axel.facius [at] math [dot] uni-karlsruhe.de
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

> From owner-reliable_computing [at] interval [dot] usl.edu Tue Dec 14 18:08:34 1999
> From: Axel Facius <axel.facius [at] math [dot] uni-karlsruhe.de>
> 
> Unfortunately, we forgot to mention, that Interval 2000 will jointly
> be held in Karlsruhe next year. Last month I fixed this failing in
> our scan2000 homepage http://www.scan2000.de and of course, the second
> announcement (to be sent out in February 2000) will contain this
> information too.
> 
I have just had a look at the site,
but besides the single sentence stating
"Held jointly with the Interval 2000 conference"
there is no further information about the Interval 
conference, nor any link to pages containing, possibly,
that information.

So, where I can find a place to see that information
and possibly register my intent to take part in it?

-- Zenon Kulpa

From owner-reliable_computing [at] interval [dot] usl.edu  Tue Jan  4 12:45:27 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id MAA13788
	for reliable_computing-outgoing; Tue, 4 Jan 2000 12:45:27 -0600 (CST)
Received: from interval.usl.edu (rbk5287@interval [130.70.43.77])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with SMTP id MAA13783
	for <reliable_computing>; Tue, 4 Jan 2000 12:45:24 -0600 (CST)
Message-Id: <200001041845.MAA13783 [at] interval [dot] usl.edu>
Date: Tue, 4 Jan 2000 12:45:24 -0600 (CST)
From: "Kearfott R. Baker" <rbk5287 [at] interval [dot] usl.edu>
Reply-To: "Kearfott R. Baker" <rbk5287 [at] interval [dot] usl.edu>
Subject: CADE-17 submission deadline is January 15
To: reliable_computing [at] interval [dot] usl.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: q7IeINc/hI/L+LmQho2F+w==
X-Mailer: dtmail 1.2.1 CDE Version 1.2.1 SunOS 5.6 sun4m sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


------------- Begin Forwarded Message -------------

From: David McAllester <dmac [at] research [dot] att.com>
Subject: CADE-17 submission deadline is January 15


For the last 25 years CADE has been the major forum for the presentation of 
papers
in automated deduction.

                             CADE-17

 The  17th  International  Conference  on  Automated  Deduction

 		      Final Call for Papers

	       http://www.research.att.com/conf/cade/

                         June 17-20, 2000
                   Pittsburgh, Pennsylvania, USA

		   Submission Deadline January 15

------------- End Forwarded Message -------------




From owner-reliable_computing [at] interval [dot] usl.edu  Tue Jan  4 13:19:58 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id NAA14167
	for reliable_computing-outgoing; Tue, 4 Jan 2000 13:19:58 -0600 (CST)
Received: from mx.eng.iastate.edu (mx.eng.iastate.edu [129.186.23.116])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id NAA14160;
	Tue, 4 Jan 2000 13:19:54 -0600 (CST)
Received: by mx.eng.iastate.edu with Internet Mail Service (5.5.2650.21)
	id <CHGH22RH>; Tue, 4 Jan 2000 12:59:26 -0600
Message-ID: <873F9637C545D311A5C500902771C8593215B6 [at] mx [dot] eng.iastate.edu>
From: "Berleant, D." <berleant [at] iastate [dot] edu>
To: "'Kearfott R. Baker'" <rbk5287 [at] interval [dot] usl.edu>,
        reliable_computing [at] interval [dot] usl.edu
Subject: Endowed Chair position
Date: Tue, 4 Jan 2000 12:59:25 -0600 
MIME-Version: 1.0
X-Mailer: Internet Mail Service (5.5.2650.21)
Content-Type: text/plain;
	charset="iso-8859-1"
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Colleagues,
    Here is an opportunity to build a major research program in
the interval computations field. Please consider it. 
DB

---
An endowed chair position at the full professor rank is available
in the ECE department at Iowa State University. Please consider 
the potential of this position for yourself, or nominate a qualified 
individual. Area of interest is flexible.
  Ames, IA is one of the most livable communities in the US with a public
school system ranked among the best nationwide. ISU is the birthplace
of the Atanasoff-Berry computer, often considered the first electronic 
digital computer (http://www.scl.ameslab.gov/ABC/).

The official announcement is appended. Please feel free to email me 
informally if you have any questions.

Best Regards,
Dan

POSITION ANNOUNCEMENT
Department of Electrical and Computer Engineering 
Iowa State University of Science and Technology 
invites applications  for The Jerry R. Junkins Chair, 
Information Systems.  The areas of interest include 
software engineering, hardware/software codesign, 
human-computer interaction, information technology, 
internet technology, multimedia/hypermedia, software 
architectures, wireless/cellular communications, 
telecommunications, and VLSI systems/CAD for VLSI. 
Applicants should have a) an earned doctorate in 
electrical engineering or a related discipline, b) 
exceptional leadership capabilities in their technical 
area of expertise, c) demonstrated ability to interact 
productively with the industrial community and/or 
governmental agencies, d) outstanding record of scholarly 
activity, and e) national and international recognition.  
The responsibilities include 1) teaching at the 
undergraduate and graduate levels, 2) pursuing leading 
edge research and publishing research results in leading 
journals and conferences, 3) guiding graduate students, 
4) seeking, establishing, and maintaining external 
research funding, 5) providing leadership in faculty and 
program development, and 6) participating in outreach 
activities.  Full information can be found at 
http://www.ee.iastate.edu. Applicants should send a letter 
of application and a resume including names and addresses 
of at least 3 references to, Chair, Electrical and Computer 
Engineering, 2215 Coover Hall, Iowa State University, Ames, 
IA 50011.  ISU is an EO/AA employer.


From owner-reliable_computing [at] interval [dot] usl.edu  Wed Jan  5 07:12:02 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id HAA16727
	for reliable_computing-outgoing; Wed, 5 Jan 2000 07:12:02 -0600 (CST)
Received: from skiff.cs.vu.nl (root [at] skiff [dot] cs.vu.nl [192.31.231.56])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id HAA16722
	for <reliable_computing [at] interval [dot] usl.edu>; Wed, 5 Jan 2000 07:11:59 -0600 (CST)
Received: by skiff.cs.vu.nl (Smail #64)
	id m125qEE-000TggC; Wed, 5 Jan 2000 14:11 +0100
Message-Id: <m125qEE-000TggC [at] skiff [dot] cs.vu.nl>
Subject: CL2000: 3rd call for papers
To: reliable_computing [at] interval [dot] usl.edu
Date: Wed, 5 Jan 2000 14:11:54 +0100 (MET)
From: "Raamsdonk van F" <femke [at] skiff [dot] cs.vu.nl>
X-Mailer: ELM [version 2.5 PL2]
MIME-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

           *** apologies for multiple copies ***
           
  First International Conference on Computational Logic, CL2000
               Imperial College, London, UK 
                  24th to 28th July, 2000 

              http://www.doc.ic.ac.uk/cl2000  
                                      
                    3rd call for papers

The deadline for submission of papers to CL2000 is FEBRUARY 1, 2000.

Papers on all aspects of the theory, implementation, and application 
of Computational Logic are invited, where Computational Logic is to 
be understood broadly as the use of logic in Computer Science. 

Papers can be submitted to one the following seven streams of CL2000
(each stream has its own separate program committee):

   - Database Systems (DOOD2000)      
   - Program Development (LOPSTR2000)            
   - Knowledge Representation and Non-monotonic Reasoning       
   - Automated Deduction: Putting Theory into Practice   
   - Constraints        
   - Logic Programming: Theory and Extensions       
   - Logic Programming: Implementations and Applications 

The last three streams effectively constitute the former ICLP
conference series that will be now integrated into CL2000. 

Please note the following:

   - Further details on formatting of the papers, publisher, 
     etcetera are available via the webpage of the conference.
   - Authors will be notified of acceptance/rejection by 
     15th April, 2000.
   - Camera-ready versions must be received by 15th May, 2000.

CL2000 is co-locating with ILP2000, the 10th International 
Conference on Inductive Logic Programming. The call for papers 
of ILP2000 (deadline for submission of papers: 29 March 2000)
and further information is available via

   http://www.cs.york.ac.uk/ILP-events/ILP-2000



From owner-reliable_computing [at] interval [dot] usl.edu  Fri Jan  7 08:38:15 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id IAA22335
	for reliable_computing-outgoing; Fri, 7 Jan 2000 08:38:15 -0600 (CST)
Received: from automatix.informatik.uni-wuerzburg.de (root [at] wi2x40 [dot] informatik.uni-wuerzburg.de [132.187.10.40])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id IAA22330
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 7 Jan 2000 08:38:11 -0600 (CST)
Received: from informatik.uni-wuerzburg.de (i2-dhcp-0 [132.187.10.130])
	by automatix.informatik.uni-wuerzburg.de (8.8.8/8.8.8) with ESMTP id PAA28876;
	Fri, 7 Jan 2000 15:37:58 +0100
Message-ID: <38760856.2982A695 [at] informatik [dot] uni-wuerzburg.de>
Date: Fri, 07 Jan 2000 16:37:58 +0100
From: "=?iso-8859-1?Q?J=FCrgen?= Wolff v. Gudenberg" 
	<wolff [at] informatik [dot] uni-wuerzburg.de>
X-Mailer: Mozilla 4.7 [de] (WinNT; I)
X-Accept-Language: de
MIME-Version: 1.0
To: Zenon Kulpa <zkulpa [at] zmit1 [dot] ippt.gov.pl>
CC: reliable_computing [at] interval [dot] usl.edu, axel.facius [at] math [dot] uni-karlsruhe.de
Subject: Re: INTERVAL'2000
References: <200001041739.SAA05967 [at] zmit1 [dot] ippt.gov.pl>
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

I interpret the term 'held jointly with Interval 2000' in the way that
everything is
cupled tightly, so there is only one conference
with 2 titles,but
1 call for paper,
1 scientific committee,
1 program ,
joint publication possibility.

and I think that is a reasonable way to run the conference.

Juergen WvG

Zenon Kulpa schrieb:

> > From owner-reliable_computing [at] interval [dot] usl.edu Tue Dec 14 18:08:34 1999
> > From: Axel Facius <axel.facius [at] math [dot] uni-karlsruhe.de>
> >
> > Unfortunately, we forgot to mention, that Interval 2000 will jointly
> > be held in Karlsruhe next year. Last month I fixed this failing in
> > our scan2000 homepage http://www.scan2000.de and of course, the second
> > announcement (to be sent out in February 2000) will contain this
> > information too.
> >
> I have just had a look at the site,
> but besides the single sentence stating
> "Held jointly with the Interval 2000 conference"
> there is no further information about the Interval
> conference, nor any link to pages containing, possibly,
> that information.
>
> So, where I can find a place to see that information
> and possibly register my intent to take part in it?
>
> -- Zenon Kulpa


From owner-reliable_computing [at] interval [dot] usl.edu  Fri Jan  7 08:58:02 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id IAA22622
	for reliable_computing-outgoing; Fri, 7 Jan 2000 08:58:02 -0600 (CST)
Received: from zmit1.ippt.gov.pl (zmit1.ippt.gov.pl [148.81.53.8])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id IAA22617
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 7 Jan 2000 08:57:53 -0600 (CST)
Received: (from zkulpa@localhost) by zmit1.ippt.gov.pl (8.8.5/8.7.3-zmit) id PAA08485; Fri, 7 Jan 2000 15:57:56 +0100 (MET)
Date: Fri, 7 Jan 2000 15:57:56 +0100 (MET)
From: Zenon Kulpa <zkulpa [at] zmit1 [dot] ippt.gov.pl>
Message-Id: <200001071457.PAA08485 [at] zmit1 [dot] ippt.gov.pl>
To: wolff [at] informatik [dot] uni-wuerzburg.de
Subject: Re: INTERVAL'2000
Cc: reliable_computing [at] interval [dot] usl.edu, axel.facius [at] math [dot] uni-karlsruhe.de
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

> From wolff [at] informatik [dot] uni-wuerzburg.de Fri Jan  7 15:38:25 2000
> Date: Fri, 07 Jan 2000 16:37:58 +0100
> From: "=?iso-8859-1?Q?J=FCrgen?= Wolff v. Gudenberg" 
> 
> I interpret the term 'held jointly with Interval 2000' in the way that
> everything is cupled tightly, so there is only one conference
> with 2 titles, but
> 1 call for paper,
> 1 scientific committee,
> 1 program ,
> joint publication possibility.
> 
> and I think that is a reasonable way to run the conference.
> 
> Juergen WvG
> 
Very good, I have no basic objections against such an arrangement,
but then it should be explicitly stated at the website -
that it is SCAN/IINTERVAL2000 Conference (or something like that),
and the call for papers, conference topics, etc.
should contain terminology & subject areas of both
fields represented. Currently it is not so -
the site specifically says only about SCAN, 
and the almost only mention of intervals is in this sentence:
"Held jointly with the Interval 2000 conference"
(the second one is in the laudable quote from Prof. Gustafson).

And that somehow does not satisfy me.

-- Zenon Kulpa

> Zenon Kulpa schrieb:
> 
[...]
> > I have just had a look at the site,
> > but besides the single sentence stating
> > "Held jointly with the Interval 2000 conference"
> > there is no further information about the Interval
> > conference, nor any link to pages containing, possibly,
> > that information.
> >
> > So, where I can find a place to see that information
> > and possibly register my intent to take part in it?
> >

From owner-reliable_computing [at] interval [dot] usl.edu  Fri Jan  7 09:53:07 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id JAA23045
	for reliable_computing-outgoing; Fri, 7 Jan 2000 09:53:07 -0600 (CST)
Received: (from rbk5287@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id JAA23039
	for reliable_computing; Fri, 7 Jan 2000 09:53:05 -0600 (CST)
Date: Fri, 7 Jan 2000 09:53:05 -0600 (CST)
From: "Kearfott R. Baker" <rbk5287 [at] interval [dot] usl.edu>
Message-Id: <200001071553.JAA23039 [at] interval [dot] usl.edu>
To: reliable_computing [at] interval [dot] usl.edu
Subject: LAA vol 304
X-Sun-Charset: US-ASCII
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


----- Begin Included Message -----

Dear Net Organizer:

Please circulate the attached LAA contents over your net.

Thanks

hans

------------------------------------------------------------------------------
Hans Schneider                                 hans [at] math [dot] wisc.edu.
Department of Mathematics                      608-262-1402 (Work)
Van Vleck Hall                                 608-271-7252 (Home)
480 Lincoln Drive                              608-263-8891 (Work FAX)
University of Wisconsin-Madison                608-271-8477 (Home FAX)
Madison WI 53706 USA             http://www.math.wisc.edu/~hans (URL)
------------------------------------------------------------------------------



             ContentsDirect from Elsevier Science
            =====================================

URL: http://www.elsevier.nl/locate/jnlnr/07738

Journal: Linear Algebra and Its Applications
ISSN   : 0024-3795
Volume : 304
Issue  : 1-3
Date   : 06-Jan-2000


pp 1-31
The correlations with identity companion automorphism, of finite
desarguesian planes
BC Kestenband

pp 33-43
On pseudomatroid property of matrices
R Sridhar, SN Kabadi

pp 45-68
A quantitative version of the observation that the Hadamard product
is a principal submatrix of the Kronecker product
G Visick

pp 69-101
The Picard group of a structural matrix algebra
J  Haefner

pp 103-108
Range kernel orthogonality of derivations
BP Duggal

pp 109-118
Semigroups of EP linear transformations
G Lesnjak

pp 119-129
On the cone of completely positive linear transformations
DA Yopp

pp 131-139
On factorization of matrix polynomials
J Maroulas

pp 141-159
Linear operators preserving multivariate majorization
LB Beasley

pp 161-171
A factorization of totally nonsingular matrices over a ring with
identity
M Fiedler

pp 173-177
Gersgorin variations I: On a theme of Pupkov and Solov'ev
AJ Hoffman

pp 179-179
Challenges in Matrix Theory 2000

pp 181-192
Matrix rigidity
B Codenotti

pp 193-200
Matrix rank and communication complexity
B Codenotti

pp 201-201
Author index


NOTE:  ContentsDirect, which is automatically generated by Elsevier, lists
the first author of each paper and the corresponding author (if
different).




----- End Included Message -----


From owner-reliable_computing [at] interval [dot] usl.edu  Sat Jan  8 16:20:06 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id QAA26451
	for reliable_computing-outgoing; Sat, 8 Jan 2000 16:20:06 -0600 (CST)
Received: from marnier.ucs.usl.edu (root@ucs-gw.usl.edu [130.70.40.2])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id QAA26446
	for <reliable_computing [at] interval [dot] usl.edu>; Sat, 8 Jan 2000 16:20:03 -0600 (CST)
Received: from u8174 (rbk5287 [at] goedel [dot] usl.edu [130.70.49.203])
	by marnier.ucs.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.3) with SMTP id QAA16725
	for <reliable_computing [at] interval [dot] usl.edu>; Sat, 8 Jan 2000 16:20:00 -0600 (CST)
Message-Id: <2.2.32.20000108222223.00687c80 [at] pop [dot] usl.edu>
X-Sender: rbk5287 [at] pop [dot] usl.edu
X-Mailer: Windows Eudora Pro Version 2.2 (32)
Mime-Version: 1.0
Content-Type: text/plain; charset="iso-8859-1"
Date: Sat, 08 Jan 2000 16:22:23 -0600
To: reliable_computing [at] interval [dot] usl.edu
From: "R. Baker Kearfott" <rbk [at] louisiana [dot] edu>
Subject: Re: INTERVAL'2000
Content-Transfer-Encoding: 8bit
X-MIME-Autoconverted: from quoted-printable to 8bit by interval.usl.edu id QAA26447
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Yes, that seems reasonable.  In particular some years back we discussed
biennial versus annual conferences, with a view towards the rate
of progress in the field, size of the community, etc.  We did not 
want to dilute a conference or pose undue burdens by holding conferences
too frequently.  If I recall correctly, we recommended holding
INTERVAL* and SCAN* meetings in alternate years.

The same people appear to attend the INTERVAL* 
and SCAN* meetings.  Finally, the number of experts in the field
appears to be stable over the last decade (although there appears
to be an increase in the number of people who are peripherally
interested, and there have been some very interesting and important
developments in recent years).

Best regards,

Baker

At 04:37 PM 1/7/00 +0100, Jürgen Wolff v. Gudenberg wrote:
>I interpret the term 'held jointly with Interval 2000' in the way that
>everything is
>cupled tightly, so there is only one conference
>with 2 titles,but
>1 call for paper,
>1 scientific committee,
>1 program ,
>joint publication possibility.
>
>and I think that is a reasonable way to run the conference.
>
>Juergen WvG
>
>Zenon Kulpa schrieb:
>
>> > From owner-reliable_computing [at] interval [dot] usl.edu Tue Dec 14 18:08:34 1999
>> > From: Axel Facius <axel.facius [at] math [dot] uni-karlsruhe.de>
>> >
>> > Unfortunately, we forgot to mention, that Interval 2000 will jointly
>> > be held in Karlsruhe next year. Last month I fixed this failing in
>> > our scan2000 homepage http://www.scan2000.de and of course, the second
>> > announcement (to be sent out in February 2000) will contain this
>> > information too.
>> >
>> I have just had a look at the site,
>> but besides the single sentence stating
>> "Held jointly with the Interval 2000 conference"
>> there is no further information about the Interval
>> conference, nor any link to pages containing, possibly,
>> that information.
>>
>> So, where I can find a place to see that information
>> and possibly register my intent to take part in it?
>>
>> -- Zenon Kulpa
>
>
---------------------------------------------------------------
R. Baker Kearfott,    rbk [at] louisiana [dot] edu   (337) 482-5346 (fax)
(337) 482-5270 (work)                     (337) 981-9744 (home)
URL: http://interval.louisiana.edu/kearfott.html
Department of Mathematics, University of Louisiana at Lafayette
Box 4-1010, Lafayette, LA 70504-1010, USA
---------------------------------------------------------------


From owner-reliable_computing [at] interval [dot] usl.edu  Tue Jan 11 02:03:48 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id CAA00873
	for reliable_computing-outgoing; Tue, 11 Jan 2000 02:03:48 -0600 (CST)
Received: from ostrich.prod.itd.earthlink.net (ostrich.prod.itd.earthlink.net [207.217.120.14])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id CAA00867
	for <reliable_computing [at] interval [dot] usl.edu>; Tue, 11 Jan 2000 02:03:40 -0600 (CST)
Received: from thrush.prod.itd.earthlink.net (thrush.prod.itd.earthlink.net [207.217.121.96])
	by ostrich.prod.itd.earthlink.net (8.8.7/8.8.5) with ESMTP id QAA20734
	for <reliable_computing [at] interval [dot] usl.edu>; Mon, 10 Jan 2000 16:37:08 -0800 (PST)
Received: from company.mail (ip135.garden-city2.ny.pub-ip.psi.net [38.26.50.135])
	by thrush.prod.itd.earthlink.net (8.9.3/8.9.3) with SMTP id QAA12364
	for <reliable_computing [at] interval [dot] usl.edu>; Mon, 10 Jan 2000 16:36:44 -0800 (PST)
Received: from ramas.com [192.0.0.5] by company.mail [127.0.0.1] with SMTP (MDaemon.v2.7.SP5.R) for <reliable_computing [at] interval [dot] usl.edu>; Mon, 10 Jan 2000 19:10:57 -0500
Message-ID: <387A73CD.B565C799 [at] ramas [dot] com>
Date: Mon, 10 Jan 2000 19:05:33 -0500
From: Scott Ferson <scott [at] ramas [dot] com>
Organization: Applied Biomathematics
X-Mailer: Mozilla 4.7 [en] (Win98; U)
X-Accept-Language: en
MIME-Version: 1.0
To: "reliable_computing [at] interval [dot] usl.edu" 
 <reliable_computing [at] interval [dot] usl.edu>
Subject: uncertainty workshop
Content-Type: text/plain; charset=iso-8859-1
Content-Transfer-Encoding: 8bit
X-MDaemon-Deliver-To: reliable_computing [at] interval [dot] usl.edu
X-Return-Path: scott [at] ramas [dot] com
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


UNCERTAINTY
Its Nature, Analytical Treatment and Interpretation

10-11 February 2000
Key Bridge Marriott
Arlington, Virginia

This two-day forum on uncertainty will bring together theorists
and practitioners in risk analysis, policy making, philosophy
and computer science to address the emerging issues about what
it means to admit we're unsure.  The questions to be addressed
include

      What’s the real difference between wishful
      thinking and a prudent assumption?

      Is it essential to distinguish uncertainty
      from variability and ambiguity?

      Can Bayesian rationality be consistent with
      open and democratic decision making?

      Is probability theory the only consistent
      approach for handling uncertainty?

      What are the practical implications of
      epistemological constraints?

      When is a decision defensible even if the
      data it’s based on are incomplete?

      Do bright-line definitions of ‘adverse
      effects’ thwart optimal decision making?

The conference is intended as a forum for discussion and
debate, rather than merely a teaching workshop. The forum
will be focused by short presentations by invited speakers
and will allow ample time for open-format discussion and
debate among all participants. Speakers include

  Timothy Barry, U.S. Environmental Protection Agency
  Vicki Bier, University of Wisconsin at Madison
  Rosina Bierbaum, Environment Director, White House OSTP
  Todd Bridges, U.S. Army Corps of Engineers
  Mark Colyvan, University of Tasmania
  Douglas Dixon, Electric Power Research Institute
  Scott Ferson, Applied Biomathematics, (organizer)
  Adam Finkel, Director of Health Standards, OSHA
  Kathryn Blackmond Laskey, George Mason University
  Deborah Mayo, Virginia Polytechnic Institute
  Richard Neapolitan, Northeastern Illinois University
  Teddy Seidenfeld, Carnegie Mellon University
  Ronald Yager, Iona College

The forum is sponsored by the Society for Risk Analysis,
with co-sponsorship by the U.S. Army Engineer Research
and Development Center and the Electric Power Research
Insitute.

The deadline for early registration is 26 January 2000.
Consult the webpage http://www.ramas.com/feb1011.htm for
more information and registration details.







From owner-reliable_computing [at] interval [dot] usl.edu  Tue Jan 11 12:05:16 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id MAA00757
	for reliable_computing-outgoing; Tue, 11 Jan 2000 12:05:16 -0600 (CST)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id MAA00752
	for <reliable_computing [at] interval [dot] usl.edu>; Tue, 11 Jan 2000 12:05:08 -0600 (CST)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.9.3+Sun/8.9.1) with SMTP id LAA05165
	for <reliable_computing [at] interval [dot] usl.edu>; Tue, 11 Jan 2000 11:04:53 -0700 (MST)
Message-Id: <200001111804.LAA05165 [at] cs [dot] utep.edu>
Date: Tue, 11 Jan 2000 11:04:53 -0700 (MST)
From: vladik <vladik [at] cs [dot] utep.edu>
Reply-To: vladik <vladik [at] cs [dot] utep.edu>
Subject: TCS special issue on CCA
To: reliable_computing [at] interval [dot] usl.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: fvMcsXLX6mYTWB7TpvPdqg==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


------------- Begin Forwarded Message -------------

Date: Tue, 11 Jan 2000 17:32:26 +0100
From: Vasco Brattka <Vasco.Brattka@FernUni-Hagen.de>
X-Accept-Language: en
MIME-Version: 1.0
Subject: TCS special issue on CCA
Content-Transfer-Encoding: 7bit


     ---------- C A L L   F O R   P A P E R S ----------




                THEORETICAL COMPUTER SCIENCE

   Special issue : Computability and Complexity in Analysis


This is a call for papers for a special issue of the Journal
"Theoretical Computer Science".


Guest Editors: Ker-I Ko, Anil Nerode, Klaus Weihrauch.


Important Dates:


  - Deadline for submissions:               March 15, 2000

  - Notification of acceptance/rejection:   May 15,   2000

  - Deadline for final version:             July 15,  2000



Computability and Complexity in Analysis is a field of
increasing importance in theoretical computer science.
On the one hand, it provides a theoretical background for
numerical analysis and for the numerous numerical computations
performed by digital computers. On the other hand, it is an
important and very promising field of research. Computability
and Complexity in Analysis combines discrete computability and
complexity essentially based on the Turing machine model with
concepts for approximation well known from Analysis, Functional
Analysis, Measure Theory, Domain Theory etc.
This special issue will contain papers presented on the seminar
"CCA'99" which took place at Dagstuhl in November 1999
(http://www.informatik.fernuni-hagen.de/cca/). Also authors who
have not participated are encouraged to submit.


Language of presentation: English

Please send 4 copies of a full paper to:

       Klaus Weihrauch
       Theoretische Informatik I
       FernUniversitaet
       D-58084 HAGEN
       GERMANY


As an alternative, you are encouraged to send a PostScript version
of your full paper to:

        klaus.weihrauch@fernuni-hagen.de
        (subject: TCS)


If you prepare your paper in LaTeX, you should use Elsevier-LaTeX
(see ``Guide for authors'' in http://www.elsevier.nl), standard LaTeX
or AMS-LaTeX (in document style  'article').





------------- End Forwarded Message -------------



From owner-reliable_computing [at] interval [dot] usl.edu  Sun Jan 16 12:07:08 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id MAA14289
	for reliable_computing-outgoing; Sun, 16 Jan 2000 12:07:08 -0600 (CST)
Received: from kleene.math.wisc.edu (kleene.math.wisc.edu [144.92.166.90])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id MAA14284
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 16 Jan 2000 12:07:04 -0600 (CST)
Received: from forelli.math.wisc.edu (forelli.math.wisc.edu [144.92.166.70])
	by kleene.math.wisc.edu (8.9.3/8.9.3) with SMTP id LAA18735;
	Sun, 16 Jan 2000 11:59:05 -0600 (CST)
Date: Sun, 16 Jan 2000 12:18:04 -0600 (CST)
From: Hans Schneider <hans [at] math [dot] wisc.edu>
To: NETS -- at-net <at-net [at] mi [dot] uni-erlangen.de>,
        "Hershkowitz, Danny -- Hershkowitz Daniel" <hershkow [at] aluf [dot] technion.ac.il>,
        Danny Hershkowitz <hershkow [at] techunix [dot] technion.ac.il>,
        E-LETTER <eletter-request [at] win [dot] tue.nl>,
        "na.digest" <na.digest@na-net.ornl.gov>, ipnet-digest [at] math [dot] msu.edu,
        wim@bell-labs.com, hjt [at] eos [dot] ncsu.edu, vkm [at] eedsp [dot] gatech.edu,
        reliable_computing [at] interval [dot] louisiana.edu
Subject: LAA vol 305 contents
Message-ID: <Pine.GSO.3.96.1000116121635.28674A-100000 [at] forelli [dot] math.wisc.edu>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk



------------------------------------------------------------------------------
Hans Schneider                                 hans [at] math [dot] wisc.edu.
Department of Mathematics                      608-262-1402 (Work)
Van Vleck Hall                                 608-271-7252 (Home)
480 Lincoln Drive                              608-263-8891 (Work FAX)
University of Wisconsin-Madison                608-271-8477 (Home FAX)
Madison WI 53706 USA             http://www.math.wisc.edu/~hans (URL)
------------------------------------------------------------------------------



Dear Net Organizer:

Please circulate the attached LAA contents over your net.

Thanks

hans
---



             ContentsDirect from Elsevier Science
            =====================================

URL: http://www.elsevier.nl/locate/jnlnr/07738

Journal: Linear Algebra and Its Applications
ISSN   : 0024-3795
Volume : 305
Issue  : 1-3
Date   : 21-Jan-2000


pp 1-14
Ranks of submatrices and the off-diagonal indices of a square matrix
E Marques De Sa

pp 15-21
The number of Kronecker indices of square pencils of a special kind
E Marques De Sa

pp 23-31
On the Hadamard product of inverse M-matrices
B Wang, F Zhang

pp 33-46
Order intervals of matrices
ML Thornburg, RD Hill

pp 47-65
Creation and annihilation in matrix theory
R Hartwig

pp 67-86
On transitive linear semigroups
R Drnovsek, L Livshits

pp 87-97
On the Hu-Hurley-Tam conjecture concerning the generalized numerical
range
CHEMAN Cheng, CHIKWONG Li

pp 99-105
On an inequality for the Hadamard product of an M-matrix and its
inverse
Y Song

pp 107-129
An integer programming problem and rank decomposition of block upper
triangular matrices
H Bart

pp 131-149
Families of vectors with prescribed rank partition and a prescribed
subfamily
A Fonseca

pp 151-159
Singular values, diagonal elements, and extreme matrices
HF Miranda

pp 161-171
The conjugacy classes of fixed point free elements in Gl_n(F) and
SL_n(F)
JIZHU Nan

pp 173-185
Difference equations in a general setting
DJ Hartfiel

pp 187-190
Rank factorization and bordering of regular matrices over commutative
rings
E Ballico

pp 191-201
A dimension formula for the nucleus of a Veronese variety
J Gmainer, H Havlicek

pp 203-203
Author index


-------



NOTE:
ContentsDirect, which is automatically generated, lists the first author
of each paper and the corresponding author (if different). 





From owner-reliable_computing [at] interval [dot] usl.edu  Sun Jan 16 12:21:43 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id MAA14600
	for reliable_computing-outgoing; Sun, 16 Jan 2000 12:21:43 -0600 (CST)
Received: from marnier.ucs.usl.edu (root@ucs-gw.usl.edu [130.70.40.2])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id MAA14595
	for <reliable_computing [at] interval [dot] usl.edu>; Sun, 16 Jan 2000 12:21:40 -0600 (CST)
Received: from u8174 (rbk5287 [at] goedel [dot] usl.edu [130.70.49.203])
	by marnier.ucs.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.3) with SMTP id MAA25085
	for <reliable_computing [at] interval [dot] usl.edu>; Sun, 16 Jan 2000 12:21:34 -0600 (CST)
Message-Id: <2.2.32.20000116182405.00766bf0 [at] pop [dot] usl.edu>
X-Sender: rbk5287 [at] pop [dot] usl.edu
X-Mailer: Windows Eudora Pro Version 2.2 (32)
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Date: Sun, 16 Jan 2000 12:24:05 -0600
To: reliable_computing [at] interval [dot] usl.edu
From: "R. Baker Kearfott" <rbk [at] louisiana [dot] edu>
Subject: temporary service disruption on interval.louisiana.edu
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Colleagues,

The power will be out on campus between 13:00 GMT and approximately 
21:00 GMT on Monday, January 17, 2000.  Postings to this mailing list
will be delayed, and ftp services and web services on interval.louisiana.edu
(alias interval.usl.edu) will be unavailable at that time.  Rest assured
that things are properly backed up, etc.

Best regards,

Baker

---------------------------------------------------------------
R. Baker Kearfott,    rbk [at] louisiana [dot] edu   (337) 482-5346 (fax)
(337) 482-5270 (work)                     (337) 981-9744 (home)
URL: http://interval.louisiana.edu/kearfott.html
Department of Mathematics, University of Louisiana at Lafayette
Box 4-1010, Lafayette, LA 70504-1010, USA
---------------------------------------------------------------


From owner-reliable_computing [at] interval [dot] usl.edu  Wed Jan 19 15:07:53 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id PAA04058
	for reliable_computing-outgoing; Wed, 19 Jan 2000 15:07:53 -0600 (CST)
Received: from into.nit.spb.ru (into.nit.spb.ru [212.193.6.225])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id PAA04053
	for <reliable_computing [at] interval [dot] usl.edu>; Wed, 19 Jan 2000 15:07:30 -0600 (CST)
Received: from slava.UUCP (uucp@localhost)
	by into.nit.spb.ru (8.8.7/8.8.7) with UUCP id AAA19443
	for reliable_computing [at] interval [dot] usl.edu; Thu, 20 Jan 2000 00:11:19 +0300 (MSK)
	(envelope-from slava.nit.spb.su!nest [at] slava [dot] nit.spb.su)
Received: by slava.nit.spb.su (dMail for DOS v1.23, 15Jun94);
          Thu, 20 Jan 2000 00:03:33 +0300
To: reliable_computing [at] interval [dot] usl.edu
Message-Id: <AAbQYXuac0 [at] slava [dot] nit.spb.su>
Organization: Slava Nesterov
Date: Thu, 20 Jan 2000 00:03:33 +0300 (MSK)
Reply-To: nest [at] into [dot] nit.spb.su
From: "Slava Nesterov" <nest [at] slava [dot] nit.spb.su>
X-Mailer: dMail [Demos Mail for DOS v1.23]
Subject: Reliable Computing, issue 2, 2000
Lines: 60
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

            Reliable Computing
            Volume 6, Issue 2, 2000

The Hull of Preconditioned Interval Linear Equations
Eldon R. Hansen
95-103

Finding All Solutions of Nonlinear Equations
Using Linear Combinations of Functions
Kiyotaka Yamamura
105-113


Computation of the Bernstein Coefficients on Subdivided Triangles
Ralf Hungerbuehler, Juergen Garloff
115-121


Jacobi and Gauss-Seidel Iterations for Polytopic Systems:
Convergence via Convex M-Matrices
Dusan M. Stipanovic, Dragoslav D. Siljak
123-137

A Coherence Space of Rational Intervals for a Construction of \IRhead
Gracaliz P. Dimuro, Antonio Carlos da R. Costa, Dalcidio M. Claudio
139-178

Interval Branch and Bound Algorithm for Finding
the First-Zero-Crossing-Point in One-Dimensional Functions
Leocadio G. Casado, Inmaculada F. Garcia, Yaroslav D. Sergeyev
179-191

Accelerated Shift-and-Add Algorithms
Nathalie Revol, Jean-Claude Yakoubsohn
193-205


Mathematical Function Software on
the Web - Are Such Codes Useful for Verification Algorithms?
Werner Hofschuster, Walter Kraemer
207-218

Every Superinterval of the Function Range
Can Be an Interval-Computations Enclosure
Misha Koshelev
219-223

Reminiscences
Eldon R. Hansen
225

Erratum to:
A Simple Derivation of the Hansen-Bliek-Rohn-Ning-Kearfott
Enclosure for Linear Interval Equations
(Reliable Computing {\bf 5 (2) (1999))
Arnold Neumaier
227





From owner-reliable_computing [at] interval [dot] usl.edu  Wed Jan 19 16:35:51 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id QAA04497
	for reliable_computing-outgoing; Wed, 19 Jan 2000 16:35:51 -0600 (CST)
Received: from marnier.ucs.usl.edu (root@ucs-gw.usl.edu [130.70.40.2])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id QAA04492
	for <reliable_computing [at] interval [dot] usl.edu>; Wed, 19 Jan 2000 16:35:43 -0600 (CST)
Received: from u8174 (rbk5287 [at] goedel [dot] usl.edu [130.70.49.203])
	by marnier.ucs.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.3) with SMTP id QAA26403
	for <reliable_computing [at] interval [dot] usl.edu>; Wed, 19 Jan 2000 16:35:25 -0600 (CST)
Message-Id: <2.2.32.20000119223529.00709a24 [at] pop [dot] usl.edu>
X-Sender: rbk5287 [at] pop [dot] usl.edu
X-Mailer: Windows Eudora Pro Version 2.2 (32)
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Date: Wed, 19 Jan 2000 16:35:29 -0600
To: reliable_computing [at] interval [dot] usl.edu
From: "R. Baker Kearfott" <rbk [at] louisiana [dot] edu>
Subject: Solution of systems with complex variables
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Colleagues,

I am collecting references on specialized numerical methods (both 
verified methods and approximate methods) for solving systems of $n$ 
nonlinear equations in $n$ complex variables.  I would be very appreciative
if you could send me your work, work of others, or standard references,
preferably (but not necessarily) in BibTeX format.  Also, if I have
overlooked a previous bibliography on the subject, please tell me.

I can post the collection I get, as people wish.

Best regards,

Baker

---------------------------------------------------------------
R. Baker Kearfott,    rbk [at] louisiana [dot] edu   (337) 482-5346 (fax)
(337) 482-5270 (work)                     (337) 981-9744 (home)
URL: http://interval.louisiana.edu/kearfott.html
Department of Mathematics, University of Louisiana at Lafayette
Box 4-1010, Lafayette, LA 70504-1010, USA
---------------------------------------------------------------


From owner-reliable_computing [at] interval [dot] usl.edu  Thu Jan 20 02:31:26 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id CAA05433
	for reliable_computing-outgoing; Thu, 20 Jan 2000 02:31:26 -0600 (CST)
Received: from mbox.diima.unisa.it (cesare.diiie.unisa.it [193.205.164.10])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with SMTP id CAA05428
	for <reliable_computing [at] interval [dot] usl.edu>; Thu, 20 Jan 2000 02:31:03 -0600 (CST)
Received: from pc2.diiie.unisa.it [193.205.164.124]
	(HELO pc1)
	by mbox.diima.unisa.it (AltaVista Mail V2.0/2.0 BL23 listener)
	id 0000_0074_3886_c6b6_4441;
	Thu, 20 Jan 2000 09:26:30 +0100
Message-Id: <4.1.20000120091959.0091b8a0 [at] cesare [dot] diiie.unisa.it>
X-Sender: spanish [at] cesare [dot] diiie.unisa.it
X-Mailer: QUALCOMM Windows Eudora Pro Version 4.1
Date: Thu, 20 Jan 2000 09:30:06 +0100
To: reliable_computing [at] interval [dot] usl.edu
From: "G.Spagnuolo" <spanish [at] ieee [dot] org>
Subject: Systems of non linear equations
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear researchers,
I am searching for papers/software for solving systems of non linear
equations characterized by a very sparse jacobian matrix of great
dimensions (the order is 100-200, with less than 10 non-zero elements for
each row).
I think INTLAB could be a good environment to develop an algorithm that
involves sparse matrices.
Do you have any useful suggestion about some interval based approach
oriented to this particular kind of non linear systems?
Thanks in advance.
Regards.
  Giovanni


--
Dr. Giovanni Spagnuolo, Ph.D.
Assistant Professor
Dipartimento di Ingegneria dell'Informazione ed Ingegneria Elettrica
D.I.I.I.E.
University of Salerno
Via Ponte Don Melillo
I-84084 Fisciano (SA) - ITALY
Phone +39 089 964258
Fax +39 089 964218

NOTE: NEW E-MAIL ADDRESS
-->  e-mail spanish [at] ieee [dot] org   <---

From owner-reliable_computing [at] interval [dot] usl.edu  Fri Jan 21 09:52:19 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id JAA09184
	for reliable_computing-outgoing; Fri, 21 Jan 2000 09:52:19 -0600 (CST)
Received: from happy.dt.uh.edu (happy.dt.uh.edu [129.7.174.25])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with SMTP id JAA09179
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 21 Jan 2000 09:52:04 -0600 (CST)
Received: by happy.dt.uh.edu (950413.SGI.8.6.12/940406.SGI.AUTO)
	for reliable_computing [at] interval [dot] usl.edu id JAA00731; Fri, 21 Jan 2000 09:28:33 -0800
From: "Chenyi Hu" <hu [at] happy [dot] dt.uh.edu>
Message-Id: <10001210928.ZM729 [at] happy [dot] dt.uh.edu>
Date: Fri, 21 Jan 2000 09:28:33 -0800
In-Reply-To: "G.Spagnuolo" <spanish [at] ieee [dot] org>
        "Systems of non linear equations" (Jan 20,  9:30am)
References: <4.1.20000120091959.0091b8a0 [at] cesare [dot] diiie.unisa.it>
X-Mailer: Z-Mail (3.2.3 08feb96 MediaMail)
To: reliable_computing [at] interval [dot] usl.edu
Subject: Re: Systems of non linear equations
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

On Jan 20,  9:30am, G.Spagnuolo wrote:
> Subject: Systems of non linear equations
> Dear researchers,
> I am searching for papers/software for solving systems of non linear
> equations characterized by a very sparse jacobian matrix of great
> dimensions (the order is 100-200, with less than 10 non-zero elements for
> each row).

Yes, we have a paper published.

Reliable Computing 1(3), 1995, pp. 251-263.

A General Iterative Sparse Linear Solver and Its
Parallelization for Interval Newton Methods.

Chenyi Hu
--
Ph.D.,  Associate Professor, Computer and Mathematical Sciences

Center for Computational Science and Advanced Distributed Simulation
University of Houston-Downtown		        Phone:  713 221-8414
One Main Street		 		        Fax:    713 221-8086
Houston, Texas 77002			        E-mail: CHu [at] uh [dot] edu

http://happy.dt.uh.edu/~hu/Hu.html

On Jan 20,  9:30am, G.Spagnuolo wrote:
> Subject: Systems of non linear equations
> Dear researchers,
> I am searching for papers/software for solving systems of non linear
> equations characterized by a very sparse jacobian matrix of great
> dimensions (the order is 100-200, with less than 10 non-zero elements for
> each row).
> I think INTLAB could be a good environment to develop an algorithm that
> involves sparse matrices.
> Do you have any useful suggestion about some interval based approach
> oriented to this particular kind of non linear systems?
> Thanks in advance.
> Regards.
>   Giovanni
>
>
> --
> Dr. Giovanni Spagnuolo, Ph.D.
> Assistant Professor
> Dipartimento di Ingegneria dell'Informazione ed Ingegneria Elettrica
> D.I.I.I.E.
> University of Salerno
> Via Ponte Don Melillo
> I-84084 Fisciano (SA) - ITALY
> Phone +39 089 964258
> Fax +39 089 964218
>
> NOTE: NEW E-MAIL ADDRESS
> -->  e-mail spanish [at] ieee [dot] org   <---
>-- End of excerpt from G.Spagnuolo



From owner-reliable_computing [at] interval [dot] usl.edu  Mon Jan 24 09:20:21 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id JAA23068
	for reliable_computing-outgoing; Mon, 24 Jan 2000 09:20:21 -0600 (CST)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id JAA23063
	for <reliable_computing [at] interval [dot] usl.edu>; Mon, 24 Jan 2000 09:20:17 -0600 (CST)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.9.3+Sun/8.9.1) with SMTP id IAA11854
	for <reliable_computing [at] interval [dot] usl.edu>; Mon, 24 Jan 2000 08:20:12 -0700 (MST)
Message-Id: <200001241520.IAA11854 [at] cs [dot] utep.edu>
Date: Mon, 24 Jan 2000 08:20:12 -0700 (MST)
From: vladik <vladik [at] cs [dot] utep.edu>
Reply-To: vladik <vladik [at] cs [dot] utep.edu>
Subject: FYI: from NA Digest
To: reliable_computing [at] interval [dot] usl.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: Qn8J/t+Ph5yvF28UBCWZyw==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

From: U. Naumann <U.Naumann [at] herts [dot] ac.uk>
Date: Wed, 19 Jan 2000 14:42:51 GMT
Subject: Workshop on Automatic Differentiation

    Extension of Deadline for Abstract Submission to February  11. 
    Refereed Proceedings to be published by Springer in LNCS Series.

The third international workshop on Automatic Differentiation (AD)
            AD 2000 - FROM SIMULATION TO OPTIMIZATION
will take place
     June 19th to June 23rd at Nice (Cote d'Azur, France)
 
AD 2000 will be organized locally by INRIA Sophia-Antipolis under
the direction of an international program committee. It
represents a follow up on the two previous workshops held in
Breckenridge (USA) in 1991 and in Santa Fe (USA) in 1996. Special
emphasis will be placed on relationships and synergies between
AD techniques and other software tools such as compilers and
parallelizers.  Apart from recent advances in research and software
development  conference topics include applications of AD to
optimization, ODEs/DAEs, inverse problems, biomedical research,
and mathematics of finance.
 
Invited presentations have been confirmed by
 
W. Klein, Siemens, Munich           V. Selmin, Alenia, Turin
D. Fylstra, Frontline Syst. Nev     J.-D. Beley, CADOE, Lyon
 
J. More, Argonne, Ill.              F. Bodin, IRISA, Rennes
S. Watt, Univ. of Western Ontario   S. Hague, NAG, Oxford
D. Keyes, NASA, Langley             O. Pironneau, Univ Paris
B. Walster, Sun Micro Systems       F-X. LeDimet, Univ. Grenoble
 
Abstracts for contributed talks and their publication in the   
proceedings must be submitted before February 11th. Specifics on 
the location, procedures for registration and submission (abstracts, 
posters, special interest groups), and the preliminary program can be 
found at
 
           http://www-sop.inria.fr/tropics/ad2000/


From owner-reliable_computing [at] interval [dot] usl.edu  Wed Jan 26 22:07:10 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id WAA28905
	for reliable_computing-outgoing; Wed, 26 Jan 2000 22:07:10 -0600 (CST)
Received: from tik2.ethz.ch (kom-tik2.ethz.ch [129.132.66.10])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id WAA28900
	for <reliable_computing [at] interval [dot] usl.edu>; Wed, 26 Jan 2000 22:07:06 -0600 (CST)
Received: from tec34.ethz.ch (tec34 [129.132.119.34])
	by tik2.ethz.ch (8.8.8/8.8.8) with ESMTP id FAA22375
	for <reliable_computing [at] interval [dot] usl.edu>; Thu, 27 Jan 2000 05:07:04 +0100 (MET)
From: Application Asm <asm [at] tik [dot] ee.ethz.ch>
Received: (from asm@localhost)
	by tec34.ethz.ch (8.8.8/8.8.8) id FAA27444
	for reliable_computing [at] interval [dot] usl.edu; Thu, 27 Jan 2000 05:07:03 +0100 (MET)
Date: Thu, 27 Jan 2000 05:07:03 +0100 (MET)
Message-Id: <200001270407.FAA27444 [at] tec34 [dot] ethz.ch>
To: reliable_computing [at] interval [dot] usl.edu
Subject: call for participation: ASM2000, March 19th - March 24th
X-Sun-Charset: ISO-8859-1
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

       -> We apologize if you received multiple copies  <-

______________________________________________________________
_______                                                _______
_______  Call for Participation, Preliminary Program   _______
_______                                                _______
_______                     ASM2000                    _______
_______                                                _______
_______       http://www.tik.ee.ethz.ch/~asm/2000      _______
_______            Monte Verita, Switzerland           _______   
_______              March 19th - 24th 2000            _______
______________________________________________________________

In March 2000, an Abstract State Machine (ASM) Workshop will 
be held at Monte Verita, Switzerland.

The aim of the workshop is to bring together domain-experts 
using ASMs as practical specification formalisms and theore-
ticians using ASMs as formal starting point for their investi-
gations, as well as people generally interested in ASMs.
See http://www.eecs.umich.edu/gasm for more info on ASMs.

The technical program consists of invited lectures, tutorials,
presentations of refereed papers, and software demonstrations. 
A significant part of the time will be devoted to discussions.

Arrival is on Sunday afternoon, June 19th, and the workshop 
program will end on Friday noon, June 24th. A limited number 
of grants covering registration and part of travel costs are 
available for undergraduate students. Applications shall 
include a short CV and resumee of scientific interests. 

______________________________________________________________
_______                                                _______
_______                 Important Dates                _______
______________________________________________________________

  Grant applications deadline   : February 15th         
  Registration deadline         : March  1st      

Earlier registrants get nicer rooms with view over 
lake and mountains!

ASM2000 is just before ETAPS'2000 (Berlin, March 25-April 
2,2000) so that attendance to both events can be suitably 
combined.

______________________________________________________________
_______                                                _______ 
_______                   Location                     _______
______________________________________________________________

Monte Verita served for over hundred year as a boiling meeting 
place for a variety of movements, ranging from naturalism, 
over anarchism, to various artistic tendencies. (see 
http://http://www.csf-mv.ethz.ch/Official/MonteVerita/History.html)

The workshop takes place in the newly restored historic 
Bauhaus buildings, situated in a scenic park with a marvelous 
view onto the lake Lago Maggiore and the mountains. A 10 
minutes walk away the participants can take advantage of 
Ascona, a picturesque medieval village on the shore of a 
splendid and sunny bay. (see http://www.ascona.ch/etale.htm)

Ascona and the Monte Verita are situated in the heart of
Europe, easily accessible from Milano, Italy and Zurich, 
Switzerland. For travel instructions see 
http://www.csf-mv.ethz.ch/Official/Additional/Additional.html

_______________________________________________________________
_______                                                 _______
_______               Registration Form                 _______
_______________________________________________________________

Please fill out the registration form below and send it until 
March 1st to Monica Fricker at the address on the form (regular 
mail only, no e-mail or fax) to register for the workshop.
===============================================================
Send to:                          Monica Fricker
(e-mail/fax not acceptable)       Institut TIK 
                                  ETH Zentrum     
                                  Gloriastrasse 35 
                                  CH-8092 Zurich  
                                  Switzerland
                                  ph:  +41-1-632-7035
                                  fax: +41-1-632-1035
                                  EMail: fricker [at] tik [dot] ee.ethz.ch
Please Print or Type:

Name:__________________________________________________________
		Last/Family              First              MI

Affiliation:___________________________________________________

Address:_______________________________________________________

        _______________________________________________________

City:_________________________ State or Region:________________

Zip/Postal code:___________________ Country:___________________

Daytime Phone:_____________________ Fax Number:________________

Email:_________________________________________________________

Do you have any special needs?_________________________________
(special meals, access, etc.)

Please circle appropriate  fee
*        Workshop  Registration,
         Accommodation, and Full Board:
   
                                  Student     Regular   

         Dollar                   $   310     $   510 
         Swiss Francs             CHF 465     CHF 765 


Charges: (please fill out)

           Total Enclosed:        ________ (Swiss Francs (CHF))

PAYMENT MUST BE ENCLOSED: BANK-TO-BANK-TRANSFER (INTERNATIONAL
MONEY ORDER) MUST BE DRAWN ON THE FOLLOWING BANK ACCOUNT: 
             SCHWEIZERISCHE NATIONALBANK, BERN
             BC: 110
             Acc.#: 1530-5-30-ETHZ
             Credit: ASM97 1-67-234-97 
E_MAIL REGISTRATIONS CANNOT BE ACCEPTED BECAUSE WE NEED TO HAVE 
SIGNATURES ON FILE. CHECKS NOT ACCEPTED.

Method of Payment
______ BANK-TO-BANK-TRANSFER    ______ VISA
______ MASTERCARD               ______ AMERICAN EXPRESS
______ DINERS CLUB            


Credit Card Number:____________________________________________

Exp. Date:____________________

Cardholder Name: ______________________________________________
                   Exactly as it is printed on the card

Date:___________Signature:_____________________________________

We will have to bill no-show registered persons in full. 
Sorry, we cannot accept cancellations after March 1st, and 
refunds for cancellations before March 1st may take several 
months to process.


_______________________________________________________________
_______                                                 _______
_______                    Program                      _______
_______________________________________________________________

Discussion sessions, ad hoc meetings, ....

Invited Talks:  
--------------
  Andreas Blass,     Univ. of Michigan
      "Pure Mathematics and ASM's."
  Egon Börger,       Univ. of Pisa
      "Composition and Structuring Principles for ASMs" 
  Gerhard Goos,      Univ. of Karlsruhe
      title to be anounced
  Martin Odersky,    EPFL Lausanne
      "Functional Nets as a Composition Method for ASM's"
  Wolfgang Reisig,   Humbold Univ. Berlin
      "Towards a Distributed ASM Thesis"
  Natarajan Shankar, SRI International
      "Symbolic Analysis of Transition Systems"


Tutorials:
----------
  Tutorials include tool-demonstrations and hands-on 
  experience with the used tools. Infrastructure includes 
  12 SUN-workstations.

  Uwe Glaesser, Giuseppe del Castillo
     "Specifying Concurrent Systems with ASMs"
  The ASM-workbench is introduced and used for experiments 
  with concurrent systems.

  Harald Ruess, ... , Natarajan Shankar
     "Verifying ASMs with PVS"
  The basic features of the PVS proof development system 
  are introduced and demonstrated.

  Matthias Anlauff, Philipp Kutter, Alfonso Pierantonio
     "Developing Domain Specific Languages"
  The Gem-Mex system is used to prototype and visualize 
  small domain specific languages with ASM semantics.

Industrial Applications:
------------------------
  Peter Paeppinghaus and Joachim Schmid, Siemens AG
     "Report about a practical application of ASMs in 
      Software Design" 

  Wolfram Schulte, Microsoft Research
     "ASM applications in industrial research and development"

Presentations:
--------------
  M. Anlauff
    "Xasm - An Extensible, Component-Based Abstract State 
     Machines Language"

  D. Beauquier and A. Slissenko
    "Verification of Timed Algorithms: Gurevich Abstract State 
     Machines versus First Order Timed Logic"

  A. Blass, Y. Gurevich and J. Van den Bussche
    "Abstract state machines and computionally complete query 
     languages"

  E. Boerger, A. Cavarra, and E. Riccobene
    "An ASM semantics for UML Activity Diagrams and UML 
     State Machines"

  S.C. Cater and J.K. Huggins
    "An ASM Dynamic Semantics for Standard ML"

  J. Cohen and A. Slissenko
    "On Verification of Refinements of Timed Distributed 
     Algorithms"

  R. Eschbach, U. Glaesser, R. Gotzhein, A. Prinz
    "The Semantics of Programming Languages: A transformational
     operational approach using Abstract State Machines"

   V.O. Di Iorio, R. da Silva Bigonha, and M. Maia
    "A Self-Applicable Partial Evaluator for ASM"

  A. Gargantini and E. Riccobene
    "Encoding Abstract State Machines in PVS"

  Y. Gurevich and D. Rosenzweig
    "Partially Ordered Runs: a Case Study"

  Y. Gurevich, W. Schulte, and C. Wallace
    "Investigating Java concurrency using Abstract State 
     Machines"

  A. Heberle, W. Loewe, and W. Zimmermann
    "On Modular Definitions and Implementations of 
     Programming Languages using Order-Sorted Partial 
     Abstract State Machines"

  J.K. Huggins and W. Shen
    "The Static and Dynamic Semantics of C"

  B. Intrigila, G.D. Penna, and D. Ciccomartino
    "Extending Boerger's JVM Model to Compile Safe C++ Code: 
       1. The Pointers' Problem"

  J.W. Janneck and P.W. Kutter
    "Mapping Automaton - Simple Abstract State Machines"

  C. Pahl
    "Towards an Action Refinement Calculus for Abstract State 
     Machines"

  H. Rust
    "Hybrid Abstract State Machines: Using the Hyperreals 
     for Describing Continuous Changes in a Discrete Notation"

  J. Teich, P.W. Kutter, and R. Weper
    "Description and Simulation of Microprocessor Instruction 
     Sets Using ASMs"

  K. Winter
    "Methodology for Model Checking ASM: Lessons learned from 
     the FLASH Case Study"

 M. Spielmann
    "Model Checking Abstract State Machines and Beyond"

  A.V. Zamulin
    "Specifications In-the-large by Typed ASMs"

  A.V. Zamulin
    "Generic Facilities in Object-Oriented ASMs"

_______________________________________________________________
_______                                                 _______
_______                     Organization                _______
_______________________________________________________________

The workshop is sponsored by the Swiss Federal Institute of 
Technology, Microsoft Research, and BlueCapital.
 
Organizers:

  Yuri Gurevich, Microsoft Research, Redmond, Washington
  Philipp W. Kutter, Federal Institute of Technology, Zürich
  Martin Odersky, Federal Institute of Technology, Lausanne
  Lothar Thiele, Federal Institute of Technology, Zürich

From owner-reliable_computing [at] interval [dot] usl.edu  Fri Jan 28 12:04:24 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id MAA03462
	for reliable_computing-outgoing; Fri, 28 Jan 2000 12:04:24 -0600 (CST)
Received: from trueno.cs.tu-berlin.de (root [at] trueno [dot] cs.tu-berlin.de [130.149.17.160])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id MAA03457
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 28 Jan 2000 12:04:20 -0600 (CST)
Received: from iks.cs.tu-berlin.de (iks [at] freno [dot] cs.tu-berlin.de [130.149.17.167])
	by trueno.cs.tu-berlin.de (8.9.3/8.9.1) with ESMTP id SAA23561;
	Fri, 28 Jan 2000 18:52:32 +0100 (MET)
Received: from mail.cs.tu-berlin.de (root [at] mail [dot] cs.tu-berlin.de [130.149.17.13])
	by iks.cs.tu-berlin.de (8.9.3/8.8.8) with ESMTP id SAA05750
	for <cfpart-l [at] iks [dot] cs.tu-berlin.de>; Fri, 28 Jan 2000 18:49:28 +0100 (MET)
Received: from keiner.cs.tu-berlin.de (doris [at] keiner [dot] cs.tu-berlin.de [130.149.19.36])
	by mail.cs.tu-berlin.de (8.9.3/8.9.1) with ESMTP id SAA20492;
	Fri, 28 Jan 2000 18:44:46 +0100 (MET)
Received: (from doris@localhost)
	by keiner.cs.tu-berlin.de (8.9.3/8.9.3) id SAA10666;
	Fri, 28 Jan 2000 18:44:45 +0100 (MET)
Date: Fri, 28 Jan 2000 18:44:45 +0100
From: Doris Faehndrich <doris [at] cs [dot] tu-berlin.de>
To: cfpart-l [at] iks [dot] cs.tu-berlin.de, etaps-news [at] cs [dot] tu-berlin.de
Subject: ETAPS 2000 - Call for Participation
Message-ID: <20000128184444.G20372 [at] keiner [dot] cs.tu-berlin.de>
Mime-Version: 1.0
Content-Type: text/plain; charset=iso-8859-1
Content-Transfer-Encoding: 8bit
X-Mailer: Mutt 1.0i
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

(Sorry, if you receive multiple copies of this Call.
                                       Doris Faehndrich) 
-----------------------------------------------------------------

ETAPS 2000 - EUROPEAN JOINT CONFERENCES ON
                       THEORY AND PRACTICE OF SOFTWARE

      Technical University of Berlin, March 25 - April 2, 2000

-------------------- CALL FOR PARTICIPATION -------------------------

Welcome to Berlin, welcome to ETAPS, the European Joint Conferences on 
Theory and Practice of Software, the european forum for academic and 
industrial researchers working on these topics!  
For 9 days you will be able to choose between 5 conferences with more 
than 120 regular papers and tool demonstrations covering a wide range 
of topics from theory and practice, 7 invited lectures, 10 tutorials, 
and 5 satellite events.

--------------------------------------------------------------------
Please, check  for details
      http://iks.cs.tu-berlin.de/etaps2000/

Use the option of online registration or one of the downloadable
                 registration forms!
--------------------------------------------------------------------
             EARLY REGISTRATION UNTIL FEBRUARY 29, 2000
--------------------------------------------------------------------

Main Conferences, March 27 - March 31
-------------------------------------
CC 2000 International Conference on Compiler Construction
Chair: David Watt (University of Glasgow, UK)

ESOP 2000 European Symposium on Programming 
Chair: Gert Smolka (Saarland University, D)

FASE 2000 Fundamental Approaches to Software Engineering
Chair: Tom Maibaum (King's College London, UK)

FOSSACS 2000 Foundations of Software Science and Computation 
Structures, Chair: Jerzy Tiuryn (University of Warsaw, PL)

TACAS 2000 Tools and Algorithms for the Construction and Analysis 
of Systems,  Chair: Susanne Graf (VERIMAG, Grenoble, F)

Invited Speakers 
----------------

Abbas Edalat (Imperial College, London, UK)
``A Data Type for Computational Geometry and Solid Modelling''

David Harel (The Weizmann Institute of Science, Rehovot, IL)
``From play-in scenarios to code: an achievable dream''

Martin Odersky (EPF Lausanne, CH)
``Functional nets''

Richard Mark Soley (OMG Object Management Group, USA)
``Memex isn't Enough''

Wladyslaw M. Turski (University of Warsaw, PL)
``An essay on software engineering at the turn of century''

Reinhard Wilhelm (Saarland University, D) 
``Shape analysis''

Pierre Wolper (University of Liege, B)
``On the representation of constraints by automata in the 
  verification of infinite systems''

Panel: ``Standard Components of the Shelf -
  Do they carry and need a (Formal) Standard Semantics?''
Chair: Herbert Weber (TU Berlin, D) 

Satellite Events
----------------

GRATRA - Joint APPLIGRAPH/GETGRATS Workshop on Graph Transformation 
         Systems, Contact: Hartmut Ehrig (TU Berlin, D)
         March 25 - March 27

  Invited Lecture by Grzegorz Rozenberg (University of Leiden, NL)
   ``DNA Computing in vivo and graph transformation''
   (open for all ETAPS participants)

CMCS - Workshop on Coalgebraic Methods in Computer Science
       Contact: Horst Reichel (TU Dresden, D)
       March 25 - March 26
       
CBS - International Workshop on Communication-Based Systems
      Contact: Guenter Hommel(TU Berlin, D)
      March 31 - April 1

INT - Integration of Specification Techniques with Applications in 
      Engineering, Contact: Martin Grosse-Rhode(TU Berlin, D)
      March 31 - April 1

CoFI - Common Framework Initiative for Algebraic Specification and 
       Development of Software
       Contact: Don Sannella (University of Edinburgh, UK)
       April 1 - April 2

Tutorials 
---------

XML for Software Engineers
Andrea Zisman, Anthony Finkelstein (University College London, UK) 
March 25, p.m., half-day

A tutorial on Maude
Narciso Marti Oliet (Universidad Complutense, Madrid, E), 
Jose Meseguer (SRI International, USA) 
March 25, p.m., half-day

Rigorous Requirements for Safety-Critical Systems:
Fundamentals and Applications of the SCR Method
Constance L. Heitmeyer (Naval Research Laboratory, USA) 
March 26, full-day

Multi-Paradigm Programming
Michael Hanus (RWTH Aachen, D) 
March 26, a.m., half-day

Query-based Automated Debugging
Mireille Ducasse (IRISA/INSA, F) 
March 26, p.m., half-day

The Unified Modelling Language
Perdita Stevens (University of Edinburgh, UK) 
April 1, full-day

Swinging Types
Peter Padawitz (University of Dortmund, D) 
April 1, a.m., half-day

Tables and computation
A.J.Wilder (University of Wales, UK) 
April 1, p.m., half-day

SDL 2000
Joachim Fischer (HU Berlin, D), Andreas Prinz (Research Digital
Media Systems GmbH, D), Eckhardt Holz (HU Berlin, D) 
April 2, full-day

Software Metrology Basis
Hans-Ludwig Hausen (GMD Bonn, D)
April 2, a.m., half-day

------------------------------------------------------------------
ETAPS Steering Committee
Don Sannella (Chairman, UK), Egidio Astesiano (I), Jan Bergstra (NL),
Pierpaolo Degano (I), Hartmut Ehrig (D), Jose Luiz Fiadeiro (P), 
Marie-Claude Gaudel (F), Susanne Graf (F), Furio Honsell (I), 
Heinrich Hussmann (D), Stefan Jaehnichen (D), Paul Klint (NL), 
Tom Maibaum (UK), Tiziana Margaria (D), Ugo Montanari (I), 
Hanne Riis Nielson (DK), Fernando Orejas (E), Andreas Podelski (D), 
David Sands (S), Gert Smolka (D), Bernhard Steffen (D),
Wolfgang Thomas (D), Jerzy Tiuryn (PL), David Watt (UK),
Reinhard Wilhelm (D)

Organizing Chairs: Bernd Mahr, Hartmut Ehrig, Peter Pepper, 
                   Stefan Jaehnichen, Radu Popescu-Zeletin

Conference Address: ETAPS 2000, TU Berlin, 
                    Sekr. FR 6-10, 
                    Franklinstr. 28/29, D-10587 Berlin
                    Germany
                    Tel: ++49 30 314 -73540, Fax: -73622
                    Email: etaps2000 [at] iks [dot] cs.tu-berlin.de
                    http://iks.cs.tu-berlin.de/etaps2000/

Registration Address: BWO Marketing Service GmbH
                      Mohrenstr. 63-64
                      D-10117 Berlin-Mitte
                      Germany
                      Fax: ++49 30 22 66 84-64
                      Email: Etaps2000@BWO-Berlin.de



-=-=-=-==-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
Doris Fähndrich: TU Berlin FB-13 Sekr. FR 5-6, Franklinstr. 28/29, 
		10587 Berlin, Tel: 030/31473436	
-=-=-=-==-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=

From owner-reliable_computing [at] interval [dot] usl.edu  Fri Jan 28 20:32:37 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id UAA04428
	for reliable_computing-outgoing; Fri, 28 Jan 2000 20:32:37 -0600 (CST)
Received: from genie.eecs.lehigh.edu (genie.eecs.lehigh.edu [128.180.98.9])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id UAA04423
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 28 Jan 2000 20:32:33 -0600 (CST)
Received: from pamir.eecs.lehigh.edu (pamir [128.180.98.184])
	by genie.eecs.lehigh.edu (8.8.5/8.8.5) with ESMTP id OAA12601;
	Fri, 28 Jan 2000 14:32:17 -0500 (EST)
From: ASAP User <asap [at] EECS [dot] Lehigh.EDU>
Received: (from asap@localhost)
	by pamir.eecs.lehigh.edu (8.8.5/8.8.5) id OAA08303;
	Fri, 28 Jan 2000 14:32:16 -0500 (EST)
Date: Fri, 28 Jan 2000 14:32:16 -0500 (EST)
Message-Id: <200001281932.OAA08303 [at] pamir [dot] eecs.lehigh.edu>
To: asap-announce [at] EECS [dot] Lehigh.EDU
Subject: ASAP'2000 Call for Papers
Cc: mschulte [at] EECS [dot] Lehigh.EDU
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
                          ASAP 2000 CALL FOR PAPERS
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
            12th International Conference on Application-specific
                     Systems, Architectures and Processors
    			   Boston, Massachusetts

Dates and Deadlines
  Submission:                 February 28, 2000
  Acceptance notification:    March 30,  2000
  Conference:                 July 10-12, 2000

Topics:
  The conference will cover the theory and practice of application- 
  specific computing systems. Of particular interest are contributions
  that either achieve large performance gains, present formal methods for 
  the specification, design and evaluation, analyze technology dependencies 
  and the integration of hardware and software components, or describe and 
  evaluate fabricated systems.

  Areas for application-specific computing systems are many and varied. 
  Some sample areas include information systems, signal and image processing, 
  multimedia systems, high-speed networks, compression, cryptography. 

  Aspects of application-specific computing systems that are of interest 
  include, but are not limited to:
  * Application-specific architectures:
    special purpose designs, design methodology, CAD tools, fault 
    tolerance strategies, specification and interfaces, hardware/software
    codesign
  * Application-specific processors:
    digital signal processing, computer arithmetic, configurable/custom 
    computing, implementation methodology & rapid prototyping, new 
    technologies, fine-grain parallelism
  * Application-specific systems:
    network computing, special-purpose systems for exotic applications, 
    performance evaluation, standard software objects, languages, 
    compilers, operating systems, hardware/software integration

  The conference will feature a keynote speech, paper presentations, and
  a poster session. The proceedings will be published by IEEE Computer 
  Society Press.

Information for authors:

  Your paper should be maximum of 5000 words.

  A cover page should contain: 
  * paper title; complete name, address, telephone, fax and email of each   
    author; 
  * author which is responsible for correspondence; 
  * which of the conference areas is most relevant to your paper. 

  A PDF version of the complete paper, and a separate cover page text file
  with the above information, should be submitted via the conference
  web page at 
     http://www.eecs.lehigh.edu/ASAP. 
  For further information about the conference, please see the conference 
  web page. 

General Chair:  	Earl Swartzlander e.swartzlander [at] compmail [dot] com
Program Chairs: 	Graham Jullien    jullien [at] engn [dot] uwindsor.ca
			Michael Schulte   mschulte [at] eecs [dot] lehigh.edu

Program committee:

  Magdy Bayoumi, Wayne Burleson, Peter Capello, Liang-Gee Chen, Ed Deprettere,
  Milos Ercegovac, Gerhard Fettweis, Jose Fortes, Sayfe Kiaei, Israel Koren, 
  S. Y. Kung, Tomas Lang, Wayne Luk, John McCanny, Jean-Michel Muller, 
  Takao Nishitani, Tobias Noll, Peter Pirsch, Patrice Quinton, Sanjay 
  Rajopadhye, Vwani Roychowdhury, Valerie Taylor, Juergen Teich, Lothar Thiele,
  Mateo Valero, Benjamin Wah, Doran Wilde, Roger Woods, Kung Yao, Pen Yew.

From owner-reliable_computing [at] interval [dot] usl.edu  Tue Feb  1 03:57:18 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id DAA01434
	for reliable_computing-outgoing; Tue, 1 Feb 2000 03:57:18 -0600 (CST)
Received: from trueno.cs.tu-berlin.de (root [at] trueno [dot] cs.tu-berlin.de [130.149.17.160])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id DAA01429
	for <reliable_computing [at] interval [dot] usl.edu>; Tue, 1 Feb 2000 03:57:15 -0600 (CST)
Received: from iks.cs.tu-berlin.de (iks [at] freno [dot] cs.tu-berlin.de [130.149.17.167])
	by trueno.cs.tu-berlin.de (8.9.3/8.9.1) with ESMTP id KAA04740;
	Tue, 1 Feb 2000 10:51:50 +0100 (MET)
Received: from mail.cs.tu-berlin.de (root [at] mail [dot] cs.tu-berlin.de [130.149.17.13])
	by iks.cs.tu-berlin.de (8.9.3/8.8.8) with ESMTP id KAA07577
	for <cfpart-l [at] iks [dot] cs.tu-berlin.de>; Tue, 1 Feb 2000 10:50:58 +0100 (MET)
Received: from hydrus.cc.uniud.it (hydrus.cc.uniud.it [158.110.1.2])
	by mail.cs.tu-berlin.de (8.9.3/8.9.1) with ESMTP id KAA00786
	for <cfpart-l [at] iks [dot] cs.tu-berlin.de>; Tue, 1 Feb 2000 10:49:11 +0100 (MET)
Received: from [158.110.144.38] by HYDRUS.CC.UNIUD.IT (PMDF V5.2-32 #41629)
 with SMTP id <01JLE2LJ5WZC0019K0 [at] HYDRUS [dot] CC.UNIUD.IT> for
 cfpart-l [at] iks [dot] cs.tu-berlin.de; Tue, 1 Feb 2000 10:49:09 MET-DST
Date: Tue, 01 Feb 2000 10:49:09 +0200 (MET-DST)
Date-warning: Date header was inserted by HYDRUS.CC.UNIUD.IT
From: dlrca [at] HYDRUS [dot] CC.UNIUD.IT (Della Riccia Giacomo)
Subject: Re:  categories: ETAPS 2000 - Call for Participation
X-Sender: dlrca [at] 158 [dot] 110.1.2
To: cfpart-l [at] iks [dot] cs.tu-berlin.de, doris [at] cs [dot] tu-berlin.de
Message-id: <v01510101b4bc6e4ef8dd@[158.110.144.38]>
MIME-version: 1.0
Content-type: text/plain; charset=iso-8859-1
Content-transfer-encoding: 8BIT
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

>
>To:maxk [at] maths [dot] usyd.edu.au (Max Kelly)
>From:dlrca [at] hydrus [dot] cc.uniud.it (Della Riccia Giacomo)
>Subject:Re:  categories: ETAPS 2000 - Call for Participation
>
>>Would you please remove me from your mailing lists? Thanks - Max Kelly.
>
>Would you please remove me from your mailing lists? Thanks
>G. Della Riccia
>
>

Prof. Giacomo DELLA RICCIA
Dipartimento di Matematica e Informatica
Università di Udine
Via delle Scienze, 206
33100-Udine (Italy)

---> Tel. (Direct Line): (+39) (0432) 55 8419
---> Fax: (+39) (0432) 55 8499
e-mail:    dlrca [at] uniud [dot] it

(Please be aware that as of June 19, 1998 domestic and international
dialing should include full area code (0432 in my case) 



From owner-reliable_computing [at] interval [dot] usl.edu  Tue Feb  1 09:42:56 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id JAA02846
	for reliable_computing-outgoing; Tue, 1 Feb 2000 09:42:56 -0600 (CST)
Received: from sol.cc.u-szeged.hu (csendes@[160.114.8.24])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id JAA02841
	for <reliable_computing [at] interval [dot] usl.edu>; Tue, 1 Feb 2000 09:42:52 -0600 (CST)
Received: by sol.cc.u-szeged.hu (8.9.3+Sun/SMI-SVR4)
	id QAA16119; Tue, 1 Feb 2000 16:41:47 +0100 (MET)
From: csendes [at] sol [dot] cc.u-szeged.hu (Csendes Tibor)
Message-Id: <200002011541.QAA16119 [at] sol [dot] cc.u-szeged.hu>
Subject: SCAN98 proceedings
To: reliable_computing [at] interval [dot] usl.edu
Date: Tue, 1 Feb 2000 16:41:45 +0100 (MET)
X-Mailer: ELM [version 2.5 PL2]
MIME-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear Colleagues,

it is my pleasure to announce that the proceedings volume of SCAN98 is out
of print (less than one and a half years later than the meeting). Enclosed
please find some information about the book.

Yours,

Tibor Csendes

--

Dr. Tibor Csendes, associate professor                   Tel.: +36 62 544 305 
Jozsef Attila University, Dept. of Applied Informatics   Fax:  +36 62 420 292
H-6701 Szeged, P.O. Box 652, Hungary          E-mail: csendes [at] inf [dot] u-szeged.hu
WWW: http://www.inf.u-szeged.hu/~csendes/             "Sic Itur ad ACTA"  ;-) 


 Developments in Reliable Computing

 edited by
 Tibor Csendes
 Jozsef Attila University, Szeged, Hungary


 The volume contains 30 articles presented at SCAN-98, Budapest, Hungary.
 These papers cover all aspects of validation techniques in scientific 
 computing, ranging from hardware requirements, elementary operations, 
 high accuracy function evaluations and interval arithmetic to advanced 
 validating techniques and applications in various fields of practical 
 interest. 

 Audience: This book is of interest to researchers and graduate students 
 whose work involves validation techniques in scientific computing.


 Kluwer Academic Publishers, Dordrecht 

 Hardbound, ISBN 0-7923-6057-5
 November 1999, 400+XII pp.
 NLG 290.00 / USD 154.00 / GBP 96.00

 Contents and Contributors

 Preface. 

 G.F. Corliss, R.B. Kearfott: Rigorous Global Search: Industrial 
  Applications.

 A. Facius: Influences of Rounding Errors in Solving Large Sparse Linear 
  Systems. 

 J. Hormigo, J. Villalba, E.L. Zapata: A Hardware Approach to Interval 
  Arithmetic for Sine and Cosine Functions.

 W. Kuehn: Towards an Optimal Control of the Wrapping Effect. 

 A.V. Lakeyev: On Existence and Uniqueness of Solutions of Linear 
  Algebraic Equations in Kaucher's Interval Arithmetic. 

 B. Lang: A Comparison of Subdivision Strategies for Verified Multi-
  Dimensional Gaussian Quadrature. 

 S.M. Rump: INTLAB - INTerval LABoratory. 

 W. Luther, W. Otten: Verified Calculation of the Solution of Algebraic 
  Riccati Equation. 

 M. Lerch: Expression Concepts in Scientific Computing. 

 R. Sagula, T. Diverio, J. Netto: Performance Evaluation Technique STU 
  and libavi Library.

 M. Schulte, V. Zelov, G.W. Walster, D. Chiriaev: Single-Number Interval 
  I/O.

 K. Musch, G. Schumacher: Interval Analysis for Embedded Systems. 

 Y. Lebbah, O. Lhomme: Prediction by Extrapolation for Interval 
  Tightening Methods.

 S. Markov, K. Okumura: The Contribution of T. Sunaga to Interval 
  Analysis and Reliable Computing.

 E. Hubert, W. Barth: Surface-to-Surface Intersection with Complete and 
  Guaranteed Results. 

 V. Lefevre: An Algorithm that Computes a Lower Bound on the Distance 
  Between a Segment and Z^2.

 H. Collavizza, F. Delobel, M. Rueher: Comparing Partial Consistencies.

 N.S. Dimitrova, S.M. Markov: Verified Computation of Fast Decreasing 
  Polynomials.

 E. Dyllong, W. Luther, W. Otten: An Accurate Distance-Calculation 
  Algorithm for Convex Polyhedra.

 A. Frommer, A. Weinberg: Verified Error Bounds for Linear Systems 
  through the Lanczos Process.

 G. Heindl: A Representation of the Interval Hull of a Tolerance 
  Polyhedron Describing Inclusions of Function Values and Slopes.

 J.-M. Muller: A Few Results on Table-Based Methods.

 N.S. Nedialkov, K.R. Jackson: An Interval Hermite-Obreschkoff Method 
  for Computing Rigorous Bounds on the Solution of an Initial Value 
  Problem for an Ordinary Differential Equation.

 M.J. Schulte, V. Zelov, A. Akkas, J.C. Burley: The Interval-Enhanced 
  GNU Fortran Compiler.

 S.P. Shary: Outer Estimation of Generalized Solution Sets to Interval 
  Linear Systems.

 A. Strzebonski: A Real Polynomial Decision Algorithm Using Arbitrary-
  Precision Floating Point Arithmetic.

 A Numerical Verification Method of Solutions for the Navier-Stokes 
  Equations; Y. Watanabe, N. Yamamoto, M.T. Nakao. 

 B. Kolodziejczak, T. Szulc: Convex Sets of Full Rank Matrices.

 M. Lerch, J.W. von Gudenberg: Multiaspect Interval Types.

 R. Dunay, I. Kollar: MATLAB-Based Analysis of Roundoff Noise.

 G.F. Corliss: SCAN-98 Collected Bibliography.



From owner-reliable_computing [at] interval [dot] usl.edu  Tue Feb  1 13:55:09 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id NAA03549
	for reliable_computing-outgoing; Tue, 1 Feb 2000 13:55:09 -0600 (CST)
Received: from e3.ny.us.ibm.com (e3.ny.us.ibm.com [32.97.182.103])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id NAA03542
	for <reliable_computing [at] interval [dot] usl.edu>; Tue, 1 Feb 2000 13:54:49 -0600 (CST)
From: banavar [at] us [dot] ibm.com
Received: from northrelay02.pok.ibm.com (northrelay02.pok.ibm.com [9.117.200.22])
	by e3.ny.us.ibm.com (8.9.3/8.9.3) with ESMTP id OAA191694;
	Tue, 1 Feb 2000 14:52:58 -0500
Received: from D51MTA03.pok.ibm.com (d51mta03.pok.ibm.com [9.117.200.31])
	by northrelay02.pok.ibm.com (8.8.8m2/NCO v2.06) with SMTP id OAA96120;
	Tue, 1 Feb 2000 14:52:13 -0500
Received: by D51MTA03.pok.ibm.com(Lotus SMTP MTA v4.6.5  (863.2 5-20-1999))  id 85256878.006D0E0F ; Tue, 1 Feb 2000 14:51:10 -0500
X-Lotus-FromDomain: IBMUS
To: MW2K_Publicity [at] us [dot] ibm.com
Message-ID: <85256878.006D0D96.00 [at] D51MTA03 [dot] pok.ibm.com>
Date: Tue, 1 Feb 2000 14:51:12 -0500
Subject: It's time to register for Middleware 2000
Mime-Version: 1.0
Content-type: text/plain; charset=us-ascii
Content-Disposition: inline
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Please forward this call to your community.
Sorry if you received multiple copies.

===============================================================

                 CALL FOR PARTICIPATION
                    Middleware 2000
        The International Conference on Distributed Systems
              Platforms and Open Distributed Processing
                     April 4 - 8, 2000
          Hudson Valley (near New York City) USA
         http://www.research.ibm.com/Middleware2000

The advance program is available on our web site. We invite you
to register now to join us for this premier conference in April.

               Sponsored by IFIP TC6 WG6.1 and ACM
           Supported by Agilent Technologies and IBM


CONFERENCE BACKGROUND
---------------------
Middleware 2000 will be the premier conference on
distributed systems platforms and open distributed processing
in the opening year of the new millenium. The conference is
a synthesis of the major conferences and workshops in this
area into a single international event.  Middleware 2000
follows in the footsteps of the extremely successful,
inaugural Middleware '98 Conference held in the Lake District
of the UK in September, 1998.

The focus of Middleware 2000 is on the design, implementation,
deployment and evaluation of distributed systems platforms
and architectures for future networked environments. Of
particular interest is the application of both new and
existing architectures and platforms (such as RM-ODP, CORBA,
RMI and DCOM) in environments which may include public and
private networks, overlayed wired and wireless technologies,
IPv6 and IP multicast, multimedia and real-time information
and an increasing volume of WWW and Java traffic.


SOME CONFERENCE HIGHLIGHTS
--------------------------
Middleware 2000 is a single-track conference consisting
of seven paper sessions, two keynote addresses, and a
work-in-progress session.  There will also be posters
presented during breaks.

1) The seven paper sessions are on Messaging, Caching,
   Reflection, Indirection, Quality of Service, Transactions
   and Workflow, and Composition.

   The details of the paper program is at:
   http://www.research.ibm.com/Middleware2000/Program/program.html

2) We are offering four tutorials by leading practitioners:

   April 4 AM Tutorials:

   T1. "Scalability Issues in CORBA-based Systems"
       Steve Vinoski, IONA Technologies

   T2. "Designing with Patterns"
       John Vlissides, IBM TJ Watson Research Center

   April 4 PM Tutorials:

   T3. "Middleware for Programmable Networks"
       Andrew Campbell, Columbia University

   T4. "Applying Patterns for Concurrent and Distributed Components"
       Frank Buschman, Siemens ZT

   More information on the tutorials is at:
   http://www.research.ibm.com/Middleware2000/Tutorials/tutorials.html

3. We are organizing a workshop on Reflective Middleware (RM2000)
   that will be co-located with Middleware 2000.

   Information on the RM2000 workshop can be found at:
   http://www.comp.lancs.ac.uk/computing/RM2000/

4. We will have two keynote addresses by visionaries in the
   field of middleware: Ken Birman, Professor at Cornell University,
   and Jim Waldo of Sun Microsystems.

5. We will have a work-in-progress paper session and multiple
   poster sessions.

   Information on the WiP papers and posters will be available at:
   http://www.research.ibm.com/Middleware2000


LOCATION AND ACTIVITIES
-----------------------
The conference will be held at the beautiful Hudson River Valley.
The IBM Palisades Conference Center is a state-of-the-art
meeting center on 106 acres of land, just north of New York City.
Check out the URL.
    http://www.research.ibm.com/Middleware2000/Location/location.html

There will be social events as part of this year's conference,
including a Welcome Reception where participants can meet
the organizing team and other participants in an informal setting,
as well as other socials.  We will also be providing conference
luncheons to all attendees on all three days of the conference.
Lunch will also be provided to people attending the workshop on
Fri/Sat and to those attending the tutorials on Tuesday.  Information
on these activities will be available on the conference web page.


REGISTRATION
------------
Don't delay and register today for Middleware 2000.  It is THE
conference to attend.  With a great location, on a naturally
rich Hudson Valley near culturally rich Manhattan, you can't
ask for anything more. We look forward to seeing you there.

--------------------------------------------------------------------
Important URL for registration:
   http://www.regmaster.com/midd2000.html

Important Dates for registration:
   On or before March 2, 2000 : Discount on registration fees
   After March 2, 2000 or onsite : Regular registration fees
----------------------------------------------------------------------

--------
Guruduth Banavar
Publicity Chair, Middleware 2000 Conference






From owner-reliable_computing [at] interval [dot] usl.edu  Thu Feb  3 10:22:43 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA00398
	for reliable_computing-outgoing; Thu, 3 Feb 2000 10:22:43 -0600 (CST)
Received: from skiff.cs.vu.nl (skiff.cs.vu.nl [192.31.231.56])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id IAA02612
	for <reliable_computing [at] interval [dot] usl.edu>; Thu, 3 Feb 2000 08:13:57 -0600 (CST)
Received: by skiff.cs.vu.nl (Smail #64)
	id m12GMzd-000TgaC; Thu, 3 Feb 2000 15:12 +0100
Message-Id: <m12GMzd-000TgaC [at] skiff [dot] cs.vu.nl>
Subject: CL2000: deadline postponed to February 21st
To: reliable_computing [at] interval [dot] usl.edu
Date: Thu, 3 Feb 2000 15:12:20 +0100 (MET)
From: "Raamsdonk van F" <femke [at] skiff [dot] cs.vu.nl>
X-Mailer: ELM [version 2.5 PL2]
MIME-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

              *** apologies for multiple copies ***

     First International Conference on Computational Logic, CL2000
                    Imperial College, London, UK
                       24th to 28th July, 2000
                       
                   http://www.doc.ic.ac.uk/cl2000/
                       
     
Due largely to the difficulties caused by related conferences having 
submission dates at about the same time, the submission deadline for 
CL2000 is postponed to
 
                   Monday 21st February, 2000.
                   
 
If you wish to take advantage of this extension, you are asked to email 
the Chair of the Stream to which you intend to submit the title, author(s),
abstract, and keywords for your paper *as soon as possible*. 
 
Highlights of the conference include 8 invited speakers, 12 tutorials, and 
a strong workshop programme held in-line with the conference. Collocating
with CL2000 are DOOD2000, LOPSTR2000, and ILP2000. Full details about the 
conference, including the email addresses of the Stream Chairs, are given 
at the above URL. 

From owner-reliable_computing [at] interval [dot] usl.edu  Sat Feb  5 10:20:19 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA04353
	for reliable_computing-outgoing; Sat, 5 Feb 2000 10:20:19 -0600 (CST)
Received: from kleene.math.wisc.edu (kleene.math.wisc.edu [144.92.166.90])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA04348
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sat, 5 Feb 2000 10:20:11 -0600 (CST)
Received: from forelli.math.wisc.edu (forelli.math.wisc.edu [144.92.166.70])
	by kleene.math.wisc.edu (8.9.3/8.9.3) with SMTP id KAA19230;
	Sat, 5 Feb 2000 10:13:45 -0600 (CST)
Date: Sat, 5 Feb 2000 10:34:06 -0600 (CST)
From: Hans Schneider <hans [at] math [dot] wisc.edu>
To: NETS -- at-net <at-net [at] mi [dot] uni-erlangen.de>,
        "Hershkowitz, Danny -- Hershkowitz Daniel" <hershkow [at] aluf [dot] technion.ac.il>,
        Danny Hershkowitz <hershkow [at] techunix [dot] technion.ac.il>,
        E-LETTER <eletter-request [at] win [dot] tue.nl>,
        "na.digest" <na.digest@na-net.ornl.gov>, ipnet-digest [at] math [dot] msu.edu,
        wim@bell-labs.com, hjt [at] eos [dot] ncsu.edu, vkm [at] eedsp [dot] gatech.edu,
        reliable_computing [at] interval [dot] louisiana.edu
Subject: LAA announcement
Message-ID: <Pine.GSO.3.96.1000205103120.9753A-100000 [at] forelli [dot] math.wisc.edu>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk



Dear Net Organizer:

Please circulate the attached LAA announcement over your net.

Thanks

hans

---



 Linear Algebra and its Applications
 
 Special Issue on
 
 INFINITE SYSTEMS OF LINEAR EQUATIONS FINITELY SPECIFIED

 Second Announcement
  
 One of the traditional hunting grounds of linear algebra is
 the area of finite systems of linear equations, as described by a
 matrix equation $Ax = b$. Here $A$ is a known matrix,
 $b$ a known vector of finite dimensions, and $x$ is an unknown
 vector of finite dimensions, which is to be determined such 
 that the equation is either satisfied, or, if that is not possible, 
 approximately satisfied. Many techniques are known for finding solutions 
 or approximate solutions, depending on the properties of the
 given data and the approximation technique choosen.
 
 If the system of equations is not finite, i.e. $A$ is not a matrix
 but an operator, and $b$ and $x$ are of infinite dimension, then
 algebraic and numerical techniques can still be used provided the
 given data are finitely specified. Operators with such a property
 are often called 'structured operators', and it turns out that
 one can solve such infinite equations in an exact or approximate sense using
 finite methods and algorithms.
 
 The conjunction of linear algebra and inversion theory for finitely
 specified infinite operators brings interesting connections to the
 forefront: algebraic equivalents of inner-outer factorizations e.g.,
 or the algebraic significance of Kalman filtering. Structured matrices
 can be of many types, e.g. systems with finite displacement ranks or
 time-varying systems with state spaces of finite dimensions and whose
 limiting behaviour is known, e.g. as a time invariant system.
 
 A non-limiting list of topics of interest in this area is (assuming
 $A$ is an infinite but finitely described operator of some kind):
 - inversion methods
 - decomposition methods for the operator A
 - quadratic approximation methods
 - complexity reduction
 - equivalencies
 - canonical forms
 - transform techniques.
 
 Examples of operator structure:
 - systems with low displacement rank
 - finitely described time-varying systems
 - finitely described almost-periodic systems
 - differentials of non-linear systems.
 
 Interested authors are kindly invited to submit full papers with
 significant contributions to this area to any of the three
 guest editors listed below before June 1st, 2000.
 
 
 Patrick Dewilde
 DIMES, Delft University of Technology
 POB 5031,
 2600GA Delft, the Netherlands.
 Fax:   +31 15 262 3271
 email: dewilde [at] DIMES [dot] tudelft.nl
 
 Vadim Olshevsky
 Department of Mathematics and Computer Science
 Georgia State University
 University Plaza
 Atlanta, GA 30303, USA
 Fax:   +1 404 651 2246
 email: volshevsky [at] cs [dot] gsu.edu
 
 Ali Sayed
 Rm 44-123A Engr. IV Bldg
 Dept. of Electrical Engineering   
 University of California
 Los Angeles, CA 90095-1594, USA
 Fax:    +1 310 206 8495
 email:  sayed [at] biruni [dot] icsl.ucla.edu
 
 








------------------------------------------------------------------------------
Hans Schneider                                 hans [at] math [dot] wisc.edu.
Department of Mathematics                      608-262-1402 (Work)
Van Vleck Hall                                 608-271-7252 (Home)
480 Lincoln Drive                              608-263-8891 (Work FAX)
University of Wisconsin-Madison                608-271-8477 (Home FAX)
Madison WI 53706 USA             http://www.math.wisc.edu/~hans (URL)
------------------------------------------------------------------------------


From owner-reliable_computing [at] interval [dot] usl.edu  Sun Feb  6 11:51:50 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id LAA06451
	for reliable_computing-outgoing; Sun, 6 Feb 2000 11:51:50 -0600 (CST)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id LAA06446
	for <reliable_computing [at] interval [dot] usl.edu>; Sun, 6 Feb 2000 11:51:47 -0600 (CST)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.9.3+Sun/8.9.1) with SMTP id KAA10334
	for <reliable_computing [at] interval [dot] usl.edu>; Sun, 6 Feb 2000 10:51:44 -0700 (MST)
Message-Id: <200002061751.KAA10334 [at] cs [dot] utep.edu>
Date: Sun, 6 Feb 2000 10:51:44 -0700 (MST)
From: vladik <vladik [at] cs [dot] utep.edu>
Reply-To: vladik <vladik [at] cs [dot] utep.edu>
Subject: ECCAD'2000 Call for Participation
To: reliable_computing [at] interval [dot] usl.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: X977x5tc+feA195mdNyZkg==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Apologies for multiple copies

------------- Begin Forwarded Message -------------

From: Mark Giesbrecht <mwg [at] csd [dot] uwo.ca>
MIME-Version: 1.0
Content-Transfer-Encoding: 7bit
Date: Sat,  5 Feb 2000 17:40:44 -0500 (EST)
To: mwg [at] scl [dot] csd.uwo.ca
Subject: ECCAD'2000 Call for Participation


-------------------------------------------------------------------------------
 
               EAST COAST COMPUTER ALGEBRA DAY 2000
  
         Joint meeting with Southern Ontario Numerical Analysis Day 2000 and
     
         the 70th Birthday Celebration for Professor Hans J. Stetter

               ANNOUNCEMENT AND CALL FOR PARTICIPATION

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

The 7th East Coast Computer Algebra Day (ECCAD'2000) will be held on
Saturday, May 13, 2000.  It will be hosted at the

    Ontario Research Centre for Computer Algebra 
    The University of Western Ontario
    London, Ontario, Canada.

This meeting will be immediately preceded by the Southern Ontario
Numerical Analysis Day (SONAD'2000) on May 12, 2000, at the same location.
 
You can register and get more information by looking at our World Wide
Web site at http://orcca.on.ca/events.  Alternatively, send
e-mail to one of the organizers listed below, and registration
information will be sent to you.

There is no registration fee for either conference, and limited travel
support may be available on request.


ORGANIZERS

  * Mark Giesbrecht    http://www.csd.uwo.ca/~mwg (General Chair, ECCAD'2000)
  * George Labahn      http://daisy.uwaterloo.ca/~glabahn (Program Chair, 
ECCAD'2000)
  * Rob Corless        http://www.apmaths.uwo.ca/~rcorless (General Chair, 
SONAD'2000)


TIME AND LOCATION

  Saturday, May 13, 2000, 8:30am
  Middlesex Theatre, Middlesex College
  University of Western Ontario
  London, Ontario, Canada

  Reception in The Grad Club Lounge (Middlesex College) on 
  Friday, May 12, 6:00pm-8:00pm.


THEMES

  * Algebraic Algorithms
  * Hybrid Symbolic-Numeric Computation
  * Computer Algebra Systems and Generic Programming
  * Mathematical Communication
  * Complexity of Algebraic Problems

INVITED PRESENTATIONS

  * Joachim von zur Gathen, University of Paderborn, Germany
  * Michael Monagan, Simon Fraser University, Canada
  * Hans J. Stetter, Technical University of Vienna, Austria


POSTER SESSIONS
 
  In keeping with tradition, there will be two poster sessions
  offering an opportunity to present timely research in an informal
  environment.  If you wish to submit a poster, please send a title
  and abstract to George Labahn at glabahn [at] daisy [dot] uwaterloo.ca by
  April 28, 2000. 

  SONAD has a similar philosophy, except that the format is short
  talks, not posters.  See the SONAD announcement for details of that
  day's speakers.

  Even if you are not planning to give a poster, please mark the dates
  on your calendar as you are encouraged to participate.


CONFERENCE DINNER IN CELEBRATION OF THE 70th BIRTHDAY OF PROFESSOR HANS J. 
STETTER

  Professor Stetter has been a founding contributor to many of the
  themes of these Days; his work on initial-value problems in the 70's,
  on interval methods in the 80's, and current work on hybrid
  symbolic-numeric computation is of lasting value.  In celebration of
  his 70th birthday, we are pleased to ask you to join us for the
  Conference Dinner in Professor Stetter's honour at the Great Hall,
  University of Western Ontario, at 7:00pm on Saturday, May 13.

  Tickets for the dinner are $40CDN ($20CDN for students) and
  registration for the dinner must be made by Friday, May 5.

------------- End Forwarded Message -------------



From owner-reliable_computing [at] interval [dot] usl.edu  Sun Feb  6 14:30:43 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id OAA06873
	for reliable_computing-outgoing; Sun, 6 Feb 2000 14:30:43 -0600 (CST)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id OAA06868
	for <reliable_computing [at] interval [dot] usl.edu>; Sun, 6 Feb 2000 14:30:39 -0600 (CST)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.9.3+Sun/8.9.1) with SMTP id NAA10551
	for <reliable_computing [at] interval [dot] usl.edu>; Sun, 6 Feb 2000 13:30:37 -0700 (MST)
Message-Id: <200002062030.NAA10551 [at] cs [dot] utep.edu>
Date: Sun, 6 Feb 2000 13:30:37 -0700 (MST)
From: vladik <vladik [at] cs [dot] utep.edu>
Reply-To: vladik <vladik [at] cs [dot] utep.edu>
Subject: Re: ECCAD'2000 Call for Participation
To: reliable_computing [at] interval [dot] usl.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: ttgFTGGvlH0IIouVtltvfA==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


------------- Begin Forwarded Message -------------

From: "Rob Corless" <Rob.Corless [at] uwo [dot] ca>
To: "vladik" <vladik [at] cs [dot] utep.edu>
Cc: "Rob Corless" <Rob.Corless [at] uwo [dot] ca>
Subject: Re: ECCAD'2000 Call for Participation
Date: Sun, 6 Feb 2000 15:23:10 -0500
MIME-Version: 1.0
Content-Transfer-Encoding: 7bit
X-Priority: 3
X-MSMail-Priority: Normal
X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2314.1300

Dear Vladik:

Thanks for forwarding the ECCAD announcement on.  You may also wish to
forward the following brief "delta" note about Southern Ontario Numerical
Analysis Day (SONAD), which is to be held the day before ECCAD (at the same
location).

Note also that one of the themes of SONAD is interval computation, and that
interval people may very well be interested in attending the 70th birthday
celebration for Professor Hans Stetter.

Best regards, and I hope you can attend,

Rob Corless

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

               SOUTHERN ONTARIO NUMERICAL ANALYSIS DAY 2000

         joint meeting with East Coast Computer Algebra Day 2000 and

         the 70th Birthday Celebration for Professor Hans J. Stetter

               ANNOUNCEMENT AND CALL FOR PARTICIPATION

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

More information:  www.orcca.on.ca/events


TIME AND LOCATION

  Friday, May 12, 2000, 8:30am
  Middlesex Theatre, Middlesex College
  University of Western Ontario
  London, Ontario, Canada

  Reception in The Grad Club Lounge (Middlesex College) on
  Friday, May 12, 6:00pm-8:00pm.


THEMES

  * Initial-Value Problems for ODE and DAE
  * Interval Mathematics
  * Hybrid Symbolic-Numeric Computation

INVITED PRESENTATIONS

  * Gilles Villard, LMC-IMAG / Equipe Calcul Formel, Grenoble, France.
  * Grant Stephenson, Honeywell Hi-Spec, London, Canada
  * Lawrence F. Shampine, Southern Methodist University, Texas.

CONFERENCE DINNER IN CELEBRATION OF THE 70th BIRTHDAY OF PROFESSOR HANS J.
STETTER

  Professor Stetter has been a founding contributor to many of the
  themes of these Days; his work on initial-value problems in the
  70's, on interval methods in the 80's, and current work on hybrid
  symbolic-numeric computation is of lasting value.  In celebration of
  his 70th birthday, we are pleased to ask you to join us for a dinner
  in Professor Stetter's honour at the Great Hall, University of
  Western Ontario, at 7:00pm on Saturday, May 13 (after ECCAD).

  Tickets for the dinner are $40CDN ($20CDN for students) and
  registration for the dinner must be made by Friday, May 5.




------------- End Forwarded Message -------------



From owner-reliable_computing [at] interval [dot] usl.edu  Sun Feb  6 20:09:39 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id UAA07403
	for reliable_computing-outgoing; Sun, 6 Feb 2000 20:09:38 -0600 (CST)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id UAA07398
	for <reliable_computing [at] interval [dot] usl.edu>; Sun, 6 Feb 2000 20:09:35 -0600 (CST)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.9.3+Sun/8.9.1) with SMTP id TAA11123
	for <reliable_computing [at] interval [dot] usl.edu>; Sun, 6 Feb 2000 19:09:32 -0700 (MST)
Message-Id: <200002070209.TAA11123 [at] cs [dot] utep.edu>
Date: Sun, 6 Feb 2000 19:09:33 -0700 (MST)
From: vladik <vladik [at] cs [dot] utep.edu>
Reply-To: vladik <vladik [at] cs [dot] utep.edu>
Subject: attention US and Canadian researchers: from NA Digest
To: reliable_computing [at] interval [dot] usl.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: h+j2sMAfbM+hQwDahCwLbQ==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

From: Endre Suli <Endre.Suli [at] comlab [dot] ox.ac.uk>
Date: Mon, 31 Jan 2000 22:21:35 +0000 (GMT)
Subject: Search of Venue for the FoCM 2002 Conference

         Search of venue for the FoCM 2002 Conference

Following the very successful second international conference on the
Foundations of Computational Mathematics (FoCM) at Oxford University 
in July 1999 which attracted 320 participants and a high-powered cast 
of foremost world authorities from all branches of mathematics, the
Executive Committee of FoCM is now investigating possible venues and
calling for proposals for the next FoCM conference in Summer 2002.
Although the Committee is open-minded as to the geographic location, 
there is a definite body of opinion to the effect that this is North
America's turn (after Brazil and the UK). 

If you contemplate the idea of organising the next FoCM conference, 
please drop an e-mail to Endre.Suli [at] comlab [dot] ox.ac.uk as soon as possible 
to explore this further. Formal applications (up to 2 pages long) should
be sent to him by 31 March, 2000, including details about lecture room
facilities, quality and cost of local accommodation and subsistence,
convenience of travel to the region, and potential sources of funding. 

The FoCM Executive Committee expects to announce the venue and the 
likely time of the next FoCM conference in April 2000. 

The aim of FoCM as an organisation is to explore and foster the interactions 
and establish a common agenda between computational mathematics, pure
mathematics and computer science through conferences, workshops and series
of publications which include the new Springer-Verlag journal 
``Foundations of Computational Mathematics'', edited by Mike Shub, and the 
new Cambridge University Press monograph series ``Library of Computational 
Mathematics'' published under the FoCM imprint. 

Further details are available from the official FoCM website:

         http://www.focm.net/


From owner-reliable_computing [at] interval [dot] usl.edu  Fri Feb 11 10:39:38 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA19043
	for reliable_computing-outgoing; Fri, 11 Feb 2000 10:39:38 -0600 (CST)
Received: from stuio1.puce.edu.ec ([192.188.55.6])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA19038
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 11 Feb 2000 10:39:19 -0600 (CST)
Received: by STUIO1 with Internet Mail Service (5.5.2448.0)
	id <DZ5C8C5X>; Fri, 11 Feb 2000 11:37:26 -0500
Message-ID: <41264836724AD21199AF0060083CA6AD0F8BBA@PUCEUIO>
From: CASARES MALDONADO ALEJANDRO <ACASARES [at] puceuio [dot] puce.edu.ec>
To: "'reliable_computing [at] interval [dot] usl.edu'"
	 <reliable_computing [at] interval [dot] usl.edu>
Subject: Conform to IEEE 754
Date: Fri, 11 Feb 2000 11:37:30 -0500
MIME-Version: 1.0
X-Mailer: Internet Mail Service (5.5.2448.0)
Content-Type: text/plain;
	charset="iso-8859-1"
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear members:

Could you tell me approximately how many (in percentage) actual computers
conform themselves to the IEEE 754 floating point representation norm?

Is there some known kind of machines - ad es., supercomputers, which do not
adhere to that standard?

Regards,

Alejandro Casares


From owner-reliable_computing [at] interval [dot] usl.edu  Fri Feb 11 13:08:43 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id NAA19591
	for reliable_computing-outgoing; Fri, 11 Feb 2000 13:08:43 -0600 (CST)
Received: from s63.ucs.usl.edu (root [at] s63 [dot] ucs.usl.edu [130.70.118.63])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id NAA19586
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 11 Feb 2000 13:08:40 -0600 (CST)
Received: from s63.ucs.usl.edu (rbk5287 [at] s63 [dot] ucs.usl.edu [130.70.118.63])
	by s63.ucs.usl.edu (8.9.1/8.9.1/ucs-client_1.3) with SMTP id NAA00507;
	Fri, 11 Feb 2000 13:08:32 -0600 (CST)
Message-Id: <200002111908.NAA00507 [at] s63 [dot] ucs.usl.edu>
Date: Fri, 11 Feb 2000 13:08:32 -0600 (CST)
From: Kearfott Ralph B <rbk5287 [at] louisiana [dot] edu>
Reply-To: Kearfott Ralph B <rbk5287 [at] louisiana [dot] edu>
Subject: Re: Conform to IEEE 754
To: reliable_computing [at] interval [dot] usl.edu, ACASARES [at] puceuio [dot] puce.edu.ec
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: 204V3lReP4wNSNq20oNxSA==
X-Mailer: dtmail 1.2.1 CDE Version 1.2.1 SunOS 5.6 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Alejandro,

Intel-based machines except for flawed pentiums :-) have 
circuitry for conforming to the standard.  All Sun machines 
have such circuitry, and, for the most part, Unix-based workstations do.

Some notorious older machines that do not conform are older Cray
mainframes and IBM mainframes.  However, the IBM mainframes, although
having hexadecimal arithmetic, have an arithmetic that in many 
respects satisfies the spirit of IEEE.  The older Cray mainframes
have particularly bad arithmetic in the sense of IEEE.

When you look at every attribute specified in IEEE, it becomes 
somewhat more complicated.  In particular, IEEE specifies the
accuracy of binary-to-decimal and decimal-to-binary conversions.
Such conversions occur, for example, when formatting a floating
point number for printing.  Because of this, conformance to the
standard is tied to the compiler.  A number of compilers do not
have good binary to decimal conversion, in the sense of IEEE.
In other words, on those compilers, "what you get is not what
you see."  (Incidentally, the Fortran 2000 standard will have
a function that queries whether the processor conforms to 
IEEE.  It also will have functions to access IEEE operations,  such
as setting the roundoff mode.)

Best regards,

R. Baker Kearfott

> From: CASARES MALDONADO ALEJANDRO <ACASARES [at] puceuio [dot] puce.edu.ec>
> To: "'reliable_computing [at] interval [dot] usl.edu'" 
<reliable_computing [at] interval [dot] usl.edu>
> Subject: Conform to IEEE 754
> Date: Fri, 11 Feb 2000 11:37:30 -0500
> MIME-Version: 1.0
> 
> Dear members:
> 
> Could you tell me approximately how many (in percentage) actual computers
> conform themselves to the IEEE 754 floating point representation norm?
> 
> Is there some known kind of machines - ad es., supercomputers, which do not
> adhere to that standard?
> 
> Regards,
> 
> Alejandro Casares

---------------------------------------------------------------
R. Baker Kearfott,    rbk [at] louisiana [dot] edu   (337) 482-5346 (fax)
(337) 482-5270 (work)                     (337) 981-9744 (home)
URL: http://interval.louisiana.edu/kearfott.html
Department of Mathematics, University of Louisiana at Lafayette
Box 4-1010, Lafayette, LA 70504-1010, USA
---------------------------------------------------------------


From owner-reliable_computing [at] interval [dot] usl.edu  Fri Feb 11 13:51:20 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id NAA20012
	for reliable_computing-outgoing; Fri, 11 Feb 2000 13:51:20 -0600 (CST)
Received: from csc-sun.math.utah.edu (root@csc-sun.math.utah.edu [128.110.198.2])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id NAA20007
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 11 Feb 2000 13:51:16 -0600 (CST)
Received: from suncore.math.utah.edu (suncore0.math.utah.edu [128.110.198.5])
	by csc-sun.math.utah.edu (8.9.3/8.9.3) with ESMTP id MAA28439;
	Fri, 11 Feb 2000 12:51:08 -0700 (MST)
Received: (from beebe@localhost)
	by suncore.math.utah.edu (8.9.3/8.9.3) id MAA23361;
	Fri, 11 Feb 2000 12:51:06 -0700 (MST)
Date: Fri, 11 Feb 2000 12:51:06 -0700 (MST)
From: "Nelson H. F. Beebe" <beebe [at] math [dot] utah.edu>
To: CASARES MALDONADO ALEJANDRO <ACASARES [at] puceuio [dot] puce.edu.ec>,
        reliable_computing [at] interval [dot] usl.edu
Cc: beebe [at] math [dot] utah.edu
X-US-Mail: "Center for Scientific Computing, Department of Mathematics, 322
        INSCC, University of Utah, 155 S 1400 E RM 233, Salt Lake City, UT
        84112-0090, USA"
X-Telephone: +1 801 581 5254
X-FAX: +1 801 585 1640, +1 801 581 4148
X-URL: http://www.math.utah.edu/~beebe
Subject: Re: Conform to IEEE 754
Message-ID: <CMM.0.91.0.950298666.beebe [at] suncore [dot] math.utah.edu>
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Alejandro Casares asks on Fri, 11 Feb 2000 11:37:30 -0500

>> Could you tell me approximately how many (in percentage) actual computers
>> conform themselves to the IEEE 754 floating point representation norm?
>>
>> Is there some known kind of machines - ad es., supercomputers, which do not
>> adhere to that standard?

Because of the large installed base of Intel x86 processors, the
answer is: almost 100%, if you simply count CPUs with floating-point
hardware.

The major floating-point architectures on today's market are:

	IEEE 754:	Intel x86, and all RISC systems (IBM Power
			and PowerPC, Compaq/DEC Alpha, HP PA-RISC,
			Motorola 68xxx and 88xxx, SGI (MIPS) R-xxxx,
			Sun SPARC, and others);

	VAX:		Compaq/DEC

	IBM S/390:	IBM (however, in 1998, IBM added an IEEE 754
			option to S/390; see below)

	Cray:		X-MP, Y-MP, C-90; other Cray models have been
			based on Alpha and SPARC processors with
			IEEE-754 arithmetic.

However, there are many issues of how strict IEEE 754 compliance is.

Some vendors implement the standard entirely in hardware (IBM and
Intel), others in a combination of hardware and software (all non-IBM
RISC systems), and at least one entirely in software (Apple SANE
(Standard Apple Numeric Environment) on older Macintoshes).

Compaq/DEC Alpha by default does not adhere to IEEE 754 requirements:
overflow and invalid operands (NaNs) terminate the job.  Compiler
options can be given to choose IEEE 754 conformance, but there is then
a significant run-time penalty because of the need to insert trap
barrier instructions that flush the instruction pipeline, so that
trapping instructions can be precisely identified, and the exception
handled in software.  The latest Alpha chip, the 21264, provides full
hardware support for IEEE 754 (see \cite{Kessler:1999:AM} below).

Rounding mode control, which is essential for efficient interval
arithmetic implementation, is absent from some systems (and from the
Java programming language, which otherwise requires IEEE 754
arithmetic).

On all systems with partial software implementations, there can be a
severe performance hit to handle underflows (gradual or
flush-to-zero), overflows, and invalid operands. Benchmarkers must be
aware of these issues.

Several vendors now follow IBM's lead from the 1990 Power architecture
in offering multiply-add instructions that offer higher performance,
and higher accuracy: a*b + c is computed by evaluating a*b exactly
(i.e., to 2N bits), then the addition of c is made, also to 2N bits,
and finally, the result is rounded to N bits.  This has been shown to
be exceedingly useful in careful numerical analysis, and
serendipitously, provides a 2x flops rate improvement.  However, it
means that there will be even larger differences in accuracy between
platforms.  Most compilers on such systems provide a flag to suppress
the use of such instructions.

Intel, alone of all the vendors cited above, does its arithmetic with
the IEEE-recommended 80-bit temporary real format.  Rounding to 64-bit
and 32-bit values happens only in register-to-memory transfers (and
consequently, suffers a severe performance penalty (10x to 100x) for a
round-trip to and from memory if 64-bit rounding is needed).

The AMD K-7 (an Intel x86 compliant system) uses 80-bit temporary real
format, but does much of its internal work with even longer precision
(see \cite{Oberman:1999:FPD} below), in order to produce
correctly-rounded results.

Several RISC architectures do all arithmetic in 64-bit mode,
converting to and from 32-bit values during memory transfers as
needed.  The Java language forbids use of longer intermediate
precision (including multiply-add instructions), a decision that
raised so much debate that the language designers are reexamining
Java's floating-point specification.  These precision differences in
intermediate values contribute further to accuracy differences between
platforms.

The waters are even more muddied by the introduced of `multimedia
instruction sets' from most of the cited vendors in recent processor
offerings.  Some of these have 32-bit floating-point in the IEEE-754
format, but without gradual underflow, NaN, and infinity.  Because
these instructions can do 2 to 8 flops in parallel, compilers will
begin to use them for performance reasons, but then there will be even
more variance from IEEE 754 requirements.

The IEEE 754 standard requires correct rounding, in one of four modes
(to nearest, +infinity, -infinity, and zero), yet not all vendors
strictly conform.  At least one (Compaq/DEC Alpha) normally provides
only a compile-time choice of rounding mode; you have to specify an
additional compiler option to get dynamic rounding (presumably because
there is a performance hit for doing so).

The Intel/HP IA-64 architecture (codenamed Merced) is reported
(\cite{Story:1999:NAI}: see below) to produce results for the
transcendental function primitives (not part of the IEEE 754 standard)
which are accurate to less that 0.6 ulp (compared to Intel Pentium,
which reaches only 1 ulp); the paper goes on to note ``Since these
functions do not always yield a correctly-rounded value, invoking them
twice under two directed rounding modes does not always produce an
interval that includes the true mathematical value.''  That point
should be of considerable importance to readers of this list, since
the evolutionary path for the 250M+ Intel x86-based desktops world
wide is to IA-64, and interval arithmetic deserves to have increasing
importance in scientific computation.

For more information on the current state of floating-point
arithmetic, see papers from the ARITH conference series, many of which
are recorded in

	http://www.math.utah.edu/pub/tex/bib/index-table-f.html#fparith

The two Swartzlander reprint volumes there contain many historically
important papers.

The IBM S/390 paper from the 1999 ARITH-14 meeting is:

@InProceedings{Schwarz:1999:GFP,
  author =       "E. M. Schwarz and R. M. Smith and C. A. Krygowski",
  title =        "The {S/390 G5} Floating Point Unit Supporting Hex and
                 Binary Architectures",
  crossref =     "Koren:1999:ISC",
  pages =        "258--265",
  year =         "1999",
  bibdate =      "Mon Feb 7 07:28:26 MST 2000",
  URL =          "http://euler.ecs.umass.edu/paper/final/paper-112.ps;
                 http://euler.ecs.umass.edu/paper/final/paper-112.pdf",
  acknowledgement = ack-nhfb,
  keywords =     "computer arithmetic; ARITH; IEEE",
}

@InProceedings{Oberman:1999:FPD,
  author =       "S. F. Oberman",
  title =        "Floating Point Division and Square Root Algorithms and
                 Implementation in the {AMD-K7[TM]} Microprocessor",
  crossref =     "Koren:1999:ISC",
  pages =        "106--115",
  year =         "1999",
  bibdate =      "Mon Feb 7 07:28:26 MST 2000",
  URL =          "http://euler.ecs.umass.edu/paper/final/paper-139.ps;
                 http://euler.ecs.umass.edu/paper/final/paper-139.pdf",
  acknowledgement = ack-nhfb,
  keywords =     "computer arithmetic; ARITH; IEEE",
}

@InProceedings{Story:1999:NAI,
  author =       "S. Story and P. T. P. Tang",
  title =        "New Algorithms for Improved Transcendental Functions
                 on {IA-64}",
  crossref =     "Koren:1999:ISC",
  pages =        "4--11",
  year =         "1999",
  bibdate =      "Mon Feb 7 07:28:26 MST 2000",
  URL =          "http://euler.ecs.umass.edu/paper/final/paper-118.ps;
                 http://euler.ecs.umass.edu/paper/final/paper-118.pdf",
  acknowledgement = ack-nhfb,
  keywords =     "computer arithmetic; ARITH; IEEE",
}

@Proceedings{Koren:1999:ISC,
  editor =       "Israel Koren and Peter Kornerup",
  booktitle =    "14th IEEE Symposium on Computer Arithmetic:
                 proceedings: April 14--16, 1999, Adelaide, Australia",
  title =        "14th {IEEE} Symposium on Computer Arithmetic:
                 proceedings: April 14--16, 1999, Adelaide, Australia",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "xi + 274",
  year =         "1999",
  ISBN =         "0-7803-5609-8, 0-7695-0116-8, 0-7695-0118-4",
  ISSN =         "1063-6889",
  LCCN =         "QA76.6 .S887 1999",
  bibdate =      "Mon Feb 7 07:28:26 MST 2000",
  note =         "IEEE Computer Society Order Number PR00116. IEEE Order
                 Plan Catalog Number 99CB36336.",
  URL =          "http://computer.org/conferen/home/arith/;
                 http://www.ecs.umass.edu/ece/arith14/program.html",
  acknowledgement = ack-nhfb,
  annote =       "Also known as ARITH-14.",
  source =       "Computer arithmetic",
  sponsor =      "IEEE.",
}

@Article{Kessler:1999:AM,
  author =       "R. E. Kessler",
  title =        "The {Alpha 21264} Microprocessor",
  journal =      j-IEEE-MICRO,
  volume =       "19",
  number =       "2",
  pages =        "24--36",
  month =        mar # "\slash " # apr,
  year =         "1999",
  CODEN =        "IEMIDZ",
  ISSN =         "0272-1732",
  bibsource =    "http://www.computer.org/micro/mi1999/",
  URL =          "http://www.computer.org/micro/mi1999/m2024abs.htm;
                 http://dlib.computer.org/mi/books/mi1999/pdf/m2024.pdf",
  acknowledgement = ack-nhfb,
  bibdate =      "Fri Apr 2 09:14:32 MST 1999",
}

-------------------------------------------------------------------------------
- Nelson H. F. Beebe                    Tel: +1 801 581 5254                  -
- Center for Scientific Computing       FAX: +1 801 585 1640, +1 801 581 4148 -
- University of Utah                    Internet e-mail: beebe [at] math [dot] utah.edu  -
- Department of Mathematics, 322 INSCC                   beebe [at] acm [dot] org        -
- 155 S 1400 E RM 233                                    beebe [at] ieee [dot] org       -
- Salt Lake City, UT 84112-0090, USA    URL: http://www.math.utah.edu/~beebe  -
-------------------------------------------------------------------------------

From owner-reliable_computing [at] interval [dot] usl.edu  Sun Feb 13 22:04:12 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id WAA02367
	for reliable_computing-outgoing; Sun, 13 Feb 2000 22:04:12 -0600 (CST)
Received: from kleene.math.wisc.edu (kleene.math.wisc.edu [144.92.166.90])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id WAA02362
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 13 Feb 2000 22:03:56 -0600 (CST)
Received: from bing.math.wisc.edu (bing.math.wisc.edu [144.92.166.133])
	by kleene.math.wisc.edu (8.9.3/8.9.3) with SMTP id VAA21004;
	Sun, 13 Feb 2000 21:49:16 -0600 (CST)
Date: Sun, 13 Feb 2000 21:41:09 -0600 (CST)
From: Hans Schneider <hans [at] math [dot] wisc.edu>
To: NETS -- at-net <at-net [at] mi [dot] uni-erlangen.de>,
        "Hershkowitz, Danny -- Hershkowitz Daniel" <hershkow [at] aluf [dot] technion.ac.il>,
        Danny Hershkowitz <hershkow [at] techunix [dot] technion.ac.il>,
        E-LETTER <eletter-request [at] win [dot] tue.nl>,
        "na.digest" <na.digest@na-net.ornl.gov>, ipnet-digest [at] math [dot] msu.edu,
        wim@bell-labs.com, hjt [at] eos [dot] ncsu.edu, vkm [at] eedsp [dot] gatech.edu,
        reliable_computing [at] interval [dot] louisiana.edu
Subject: LAA contents
Message-ID: <Pine.GSO.3.96.1000213214020.23522A-100000 [at] bing [dot] math.wisc.edu>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk



------------------------------------------------------------------------------
Hans Schneider                                 hans [at] math [dot] wisc.edu.
Department of Mathematics                      608-262-1402 (Work)
Van Vleck Hall                                 608-271-7252 (Home)
480 Lincoln Drive                              608-263-8891 (Work FAX)
University of Wisconsin-Madison                608-271-8477 (Home FAX)
Madison WI 53706 USA             http://www.math.wisc.edu/~hans (URL)
------------------------------------------------------------------------------

Dear Net Organizer:

Please circulate the attached LAA contents over your net.

Thanks

hans
---




             ContentsDirect from Elsevier Science
            =====================================

URL: http://www.elsevier.nl/locate/jnlnr/07738

Journal: Linear Algebra and Its Applications
ISSN   : 0024-3795
Volume : 306
Issue  : 1-3
Date   : 22-Feb-2000


pp 1-13
Equivalence constants for matrix norms: a problem of Goldberg
A Tonge

pp 15-24
Classes of Schur D-stable matrices
R Fleming

pp 25-31
A representation theorem for algebras with commuting involutions
M Cabrera

pp 33-44
Sparsity of orthogonal matrices with restrictions
GS Cheon, BL Shader

pp 45-57
On sums of three square-zero matrices
K Takahashi, PEIYUAN Wu

pp 59-86
The Nevanlinna-Pick interpolation problems and power moment problems
for matrix-valued functions III: The infinitely many data case
GONGNING Chen

pp 87-102
Generalized totally positive matrices
M Fiedler

pp 103-121
On almost regular tournament matrices
C Eschenbach, JR Weaver

pp 123-130
Dual graphs and knot invariants
M Lien, W Watkins

pp 131-143
Decomposing a matrix into circulant and diagonal factors
M Schmid, R Steinwandt

pp 145-154
Centrogonal matrices
O Krafft

pp 155-163
Spectral clustering properties of block multilevel Hankel matrices
D Fasino

pp 165-182
On condensed forms for partially commuting matrices
YUA Alpin, L Elsner

pp 183-188
A tree whose complement is not eigensharp
VL Watts

pp 189-202
Growth in Gaussian elimination for weighing matrices, W(n,n-1)
CHRISTOS Koukouvinos

pp 203-209
Semidefiniteness without real symmetry
CR Johnson, RB Reams

pp 211-211
Author index

-------

NOTE:
ContentsDirect, which is automatically generated, lists the first author
of each paper and the corresponding author (if different). 





From owner-reliable_computing [at] interval [dot] usl.edu  Mon Feb 14 00:18:37 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id AAA02793
	for reliable_computing-outgoing; Mon, 14 Feb 2000 00:18:36 -0600 (CST)
Received: from e3.ny.us.ibm.com (e3.ny.us.ibm.com [32.97.182.103])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id AAA02788
	for <reliable_computing [at] interval [dot] usl.edu>; Mon, 14 Feb 2000 00:18:33 -0600 (CST)
From: banavar [at] us [dot] ibm.com
Received: from northrelay02.pok.ibm.com (northrelay02.pok.ibm.com [9.117.200.22])
	by e3.ny.us.ibm.com (8.9.3/8.9.3) with ESMTP id BAA131084;
	Mon, 14 Feb 2000 01:15:45 -0500
Received: from D51MTA03.pok.ibm.com (d51mta03.pok.ibm.com [9.117.200.31])
	by northrelay02.pok.ibm.com (8.8.8m2/NCO v2.06) with SMTP id BAA75378;
	Mon, 14 Feb 2000 01:04:50 -0500
Received: by D51MTA03.pok.ibm.com(Lotus SMTP MTA v4.6.5  (863.2 5-20-1999))  id 85256885.00214FED ; Mon, 14 Feb 2000 01:03:51 -0500
X-Lotus-FromDomain: IBMUS
To: MW2K_Publicity [at] us [dot] ibm.com
Message-ID: <85256885.00214DC7.00 [at] D51MTA03 [dot] pok.ibm.com>
Date: Mon, 14 Feb 2000 00:35:49 -0500
Subject: It's time to register for Middleware 2000!
Mime-Version: 1.0
Content-type: text/plain; charset=us-ascii
Content-Disposition: inline
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear Colleague,
Please note that the deadline for early registration
is March 2, 2000.  I urge you to not delay and register
now for this premier conference. Please also help
circulate this call for participation.
Thanks.
Guruduth Banavar

===============================================================

                 CALL FOR PARTICIPATION
                    Middleware 2000
        The International Conference on Distributed Systems
              Platforms and Open Distributed Processing
                     April 4 - 8, 2000
          Hudson Valley (near New York City) USA
         http://www.research.ibm.com/Middleware2000

The advance program is available on our web site. We invite you
to register now to join us for this premier conference in April.

               Sponsored by IFIP TC6 WG6.1 and ACM
           Supported by Agilent Technologies and IBM


CONFERENCE BACKGROUND
---------------------
Middleware 2000 will be the premier conference on
distributed systems platforms and open distributed processing
in the opening year of the new millenium. The conference is
a synthesis of the major conferences and workshops in this
area into a single international event.  Middleware 2000
follows in the footsteps of the extremely successful,
inaugural Middleware '98 Conference held in the Lake District
of the UK in September, 1998.

The focus of Middleware 2000 is on the design, implementation,
deployment and evaluation of distributed systems platforms
and architectures for future networked environments. Of
particular interest is the application of both new and
existing architectures and platforms (such as RM-ODP, CORBA,
RMI and DCOM) in environments which may include public and
private networks, overlayed wired and wireless technologies,
IPv6 and IP multicast, multimedia and real-time information
and an increasing volume of WWW and Java traffic.


SOME CONFERENCE HIGHLIGHTS
--------------------------
Middleware 2000 is a single-track conference consisting
of seven paper sessions, two keynote addresses, and a
work-in-progress session.  There will also be posters
presented during breaks.

1) The seven paper sessions are on Messaging, Caching,
   Reflection, Indirection, Quality of Service, Transactions
   and Workflow, and Composition.

   The details of the paper program is at:
   http://www.research.ibm.com/Middleware2000/Program/program.html

2) We are offering four tutorials by leading practitioners:

   April 4 AM Tutorials:

   T1. "Scalability Issues in CORBA-based Systems"
       Steve Vinoski, IONA Technologies

   T2. "Designing with Patterns"
       John Vlissides, IBM TJ Watson Research Center

   April 4 PM Tutorials:

   T3. "Middleware for Programmable Networks"
       Andrew Campbell, Columbia University

   T4. "Applying Patterns for Concurrent and Distributed Components"
       Frank Buschman, Siemens ZT

   More information on the tutorials is at:
   http://www.research.ibm.com/Middleware2000/Tutorials/tutorials.html

3. We are organizing a workshop on Reflective Middleware (RM2000)
   that will be co-located with Middleware 2000.

   Information on the RM2000 workshop can be found at:
   http://www.comp.lancs.ac.uk/computing/RM2000/

4. We will have two keynote addresses by visionaries in the
   field of middleware: Ken Birman, Professor at Cornell University,
   and Jim Waldo of Sun Microsystems.

5. We will have a work-in-progress paper session and multiple
   poster sessions.

   Information on the WiP papers and posters will be available at:
   http://www.research.ibm.com/Middleware2000


LOCATION AND ACTIVITIES
-----------------------
The conference will be held at the beautiful Hudson River Valley.
The IBM Palisades Conference Center is a state-of-the-art
meeting center on 106 acres of land, just north of New York City.
Check out the URL.
    http://www.research.ibm.com/Middleware2000/Location/location.html

There will be social events as part of this year's conference,
including a Welcome Reception where participants can meet
the organizing team and other participants in an informal setting.
We will also be providing luncheons and dinner to all attendees
on all three days of the conference.  Lunch will also be provided
to people attending the workshop and to those attending the
tutorials.  Information on these activities will be available
on the conference web page.


REGISTRATION
------------
Don't delay and register today for Middleware 2000.  It is THE
conference to attend.  With a great location, on a naturally
rich Hudson Valley near culturally rich Manhattan, you can't
ask for anything more. We look forward to seeing you there.

--------------------------------------------------------------------
Important URL for registration:
   http://www.regmaster.com/midd2000.html

Important Dates for registration:
   On or before March 2, 2000 : Discount on registration fees
   After March 2, 2000 or onsite : Regular registration fees
----------------------------------------------------------------------

--------
Guruduth Banavar
Publicity Chair, Middleware 2000 Conference






From owner-reliable_computing [at] interval [dot] usl.edu  Mon Feb 14 02:40:17 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id CAA03253
	for reliable_computing-outgoing; Mon, 14 Feb 2000 02:40:17 -0600 (CST)
Received: from buffalo.ens-lyon.fr (buffalo.ens-lyon.fr [140.77.1.8])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id CAA03248
	for <reliable_computing [at] interval [dot] usl.edu>; Mon, 14 Feb 2000 02:40:13 -0600 (CST)
Received: from boukha.ens-lyon.fr (boukha [140.77.11.36])
	by buffalo.ens-lyon.fr (8.9.1a/8.9.1) with ESMTP id JAA04450
	for <reliable_computing [at] interval [dot] usl.edu>; Mon, 14 Feb 2000 09:40:02 +0100 (MET)
Received: (from daumas@localhost)
	by boukha.ens-lyon.fr (8.9.1a/8.9.1) id JAA20595;
	Mon, 14 Feb 2000 09:40:01 +0100 (MET)
To: reliable_computing [at] interval [dot] usl.edu
Subject: Re: Conform to IEEE 754
References: <CMM.0.91.0.950298666.beebe [at] suncore [dot] math.utah.edu>
X-Url: http://www.ens-lyon.fr/~daumas
Reply-to: Marc.Daumas@ens-lyon.fr
From: Marc Daumas <Marc.Daumas@ens-lyon.fr>
Date: 14 Feb 2000 09:40:00 +0100
In-Reply-To: "Nelson H. F. Beebe"'s message of "Fri, 11 Feb 2000 12:51:06 -0700 (MST)"
Message-ID: <v87lg8kwin.fsf@ENS-Lyon.Fr>
Lines: 26
User-Agent: Gnus/5.070097 (Pterodactyl Gnus v0.97) XEmacs/20.4 (Emerald)
MIME-Version: 1.0
Content-Type: text/plain; charset=iso-8859-1
Content-Transfer-Encoding: 8bit
Content-Transfer-Encoding: 8bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


- "Nelson H. F. Beebe" <beebe [at] math [dot] utah.edu> a écrit / wrote:
> On all systems with partial software implementations, there can be a
> severe performance hit to handle underflows (gradual or
> flush-to-zero), overflows, and invalid operands. Benchmarkers must be
> aware of these issues.

It is interesting to know that some systems / applications are shipped
with denorm un-activated as this is the case in a network of DEC Alpha
21164 clusters operating  at the  University of  Lyon,  France.   This
situation  is difficult to understand since  the user assumes that the
machine IS IEEE compliant. You can read the result  of a Paranoia test
on this machine at

http://www.ens-lyon.fr/~daumas/SoftArith/moby

More traces of UCB tests on other  (IEEE compliant) systems / machines
are available at

http://www.ens-lyon.fr/~daumas/SoftArith/index.html.fr

-- 
Marc Daumas - Charge de recherches au CNRS (LIP - ENS de Lyon)
mailto:Marc.Daumas@ENS-Lyon.Fr - http://www.ens-lyon.fr/~daumas
ENS de Lyon - 46, allee d'Italie - 69364 Lyon Cedex 07 - FRANCE
Phone: (+33) 4 72 72 83 52 - Fax: (+33) 4 72 72 80 80

From owner-reliable_computing [at] interval [dot] usl.edu  Tue Feb 15 06:19:41 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id GAA06444
	for reliable_computing-outgoing; Tue, 15 Feb 2000 06:19:40 -0600 (CST)
Received: from mscs.mu.edu (studsys.mscs.mu.edu [134.48.4.15])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with SMTP id GAA06439
	for <reliable_computing [at] interval [dot] usl.edu>; Tue, 15 Feb 2000 06:19:36 -0600 (CST)
Received: (qmail 8583 invoked from network); 15 Feb 2000 12:17:16 -0000
Received: from ppp101.csd.mu.edu (HELO mscs.mu.edu) (134.48.24.1)
  by studsys.mscs.mu.edu with SMTP; 15 Feb 2000 12:17:16 -0000
Message-ID: <38A9441E.2DCEA1B1 [at] mscs [dot] mu.edu>
Date: Tue, 15 Feb 2000 06:18:38 -0600
From: George Corliss <georgec [at] mscs [dot] mu.edu>
Organization: Marquette University
X-Mailer: Mozilla 4.7 [en] (Win98; U)
X-Accept-Language: en
MIME-Version: 1.0
To: reliable_computing [at] interval [dot] usl.edu
Subject: Re: Conform to IEEE 754
References: <CMM.0.91.0.950298666.beebe [at] suncore [dot] math.utah.edu> <v87lg8kwin.fsf@ENS-Lyon.Fr>
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

The query from Alejandro Casares and responses by Baker Kearfott,
Nelson Beebe, and Marc Daumas are archived on an 
Interval FAQ site at

http://studsys.mscs.mu.edu/~georgec/IFAQ/casares1.html


Dr. George F. Corliss
Dept. Math, Stat, Comp Sci
Marquette University
P.O. Box 1881
Milwaukee, WI  53201-1881  USA
georgec [at] mscs [dot] mu.edu; George.Corliss [at] Marquette [dot] edu
http://www.mscs.mu.edu/~georgec/
Office: 414-288-6599;  Dept: 288-7375; Fax: 288-5472

From owner-reliable_computing [at] interval [dot] usl.edu  Thu Feb 17 21:45:43 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id VAA13758
	for reliable_computing-outgoing; Thu, 17 Feb 2000 21:45:43 -0600 (CST)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id VAA13753
	for <reliable_computing [at] interval [dot] usl.edu>; Thu, 17 Feb 2000 21:45:40 -0600 (CST)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.9.3+Sun/8.9.1) with SMTP id UAA04858
	for <reliable_computing [at] interval [dot] usl.edu>; Thu, 17 Feb 2000 20:45:36 -0700 (MST)
Message-Id: <200002180345.UAA04858 [at] cs [dot] utep.edu>
Date: Thu, 17 Feb 2000 20:45:37 -0700 (MST)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: interval comp page
To: reliable_computing [at] interval [dot] usl.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: IL4TzXWgaVC0BtUnZtqGxw==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear Friends, 

Our university is upgrading its server; we had some expected minor problems, 
like email disappering without a trace. Right now, the interval website froze, 
I cannot change anything there. Systems administrators are working on it. 

I apologize for the inconvenience. 

Vladik

P.S. Dima Shiriaev has just informed me that some of the links do not work. 

I tried to find new web addresses of former and current Karlsruhe researchers 
whose old URL's do not work anymore (see mail below) via Alta Vista, but found 
only a few. 

I would appreciate it if all interested members of the mailing list would:
* check their URL's as listed on this page and, 
* if this URL is wrong, send me a correct one 
(or a new one, if there is none on the page) 
so that I will be able to update the Interval Rsearchers page.

If you happen to know the correct new URL's of other researchers please let me 
know these URL's too. 

Thanks. 

Vladik

------------- Begin Forwarded Message -------------

Date: Thu, 17 Feb 2000 17:03:46 -0800 (PST)
From: Dmitri Shiriaev <dmitri.chiriaev [at] eng [dot] sun.com>
Subject: interval comp page
To: vladik [at] cs [dot] utep.edu
MIME-version: 1.0
Content-MD5: enUcpQhZITZZcebO1iIiMA==

Vladik,

On the Interval Researchers page
most links to people who used to work in Karlsruhe are dead ones.


-- Dima --


------------- End Forwarded Message -------------



From owner-reliable_computing [at] interval [dot] usl.edu  Fri Feb 18 13:37:31 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id NAA15655
	for reliable_computing-outgoing; Fri, 18 Feb 2000 13:37:31 -0600 (CST)
Received: from cdam.me.washington.edu (cdam.me.washington.edu [128.95.34.158])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id NAA15650
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 18 Feb 2000 13:37:22 -0600 (CST)
Received: from localhost (chang@localhost)
	by cdam.me.washington.edu (8.8.7/8.8.7) with ESMTP id LAA13688
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 18 Feb 2000 11:34:16 -0800
X-Authentication-Warning: cdam.me.washington.edu: chang owned process doing -bs
Date: Fri, 18 Feb 2000 11:34:16 -0800 (PST)
From: Jack Chang <chang [at] u [dot] washington.edu>
X-Sender: chang [at] cdam [dot] me.washington.edu
To: "'reliable_computing'" <reliable_computing [at] interval [dot] usl.edu>
Subject: compiler optimization mode and rounding
Message-ID: <Pine.LNX.4.04.10002181050520.13680-100000 [at] cdam [dot] me.washington.edu>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Hi,

I am wondering if compiler optimizatiom mode would affect rounding. It
looks like that the egcs(gnu) compiler would overwrites rounding control
if optimization is turn on. However, if I specify that no floating point
variables should store in registers, the rounding control would be working
at least for -O1 and -O2 for the egcs compiler. Nonetheless, the
performace would suffer a great deal. For instance,

if no optimization, (g++ -O0 ...) or with -ffloat-store flag turned on

[RNEAR(3.0/7.0),RNEAR(3.0/7.0)] = 
[0.42857142857142854764, 0.42857142857142854764]

[RDOWN(3.0/7.0),RUP(3.0/7.0)] =
[0.42857142857142854764, 0.42857142857142860315]

with optimization (g++ -O1 or above)

[RNEAR(3.0/7.0),RNEAR(3.0/7.0)] =  
[0.42857142857142854764, 0.42857142857142854764]

[RDOWN(3.0/7.0),RUP(3.0/7.0)] = 
[0.42857142857142854764, 0.42857142857142854764]

Is there any way to fix the problem? Please advise,

Thank you very much,

Jack Chang


From owner-reliable_computing [at] interval [dot] usl.edu  Fri Feb 18 14:20:48 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id OAA16054
	for reliable_computing-outgoing; Fri, 18 Feb 2000 14:20:48 -0600 (CST)
Received: from newman.cs.purdue.edu (0 [at] newman [dot] cs.purdue.edu [128.10.2.6])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id OAA16049
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 18 Feb 2000 14:20:43 -0600 (CST)
Received: from cs.purdue.edu (felix.cs.purdue.edu [128.10.9.119])
	by newman.cs.purdue.edu (8.8.7/8.8.7/PURDUE_CS-2.0) with ESMTP id PAA08002;
	Fri, 18 Feb 2000 15:20:34 -0500 (EST)
Message-ID: <38ADA992.94EE138B [at] cs [dot] purdue.edu>
Date: Fri, 18 Feb 2000 15:20:34 -0500
From: "Christoph M. Hoffmann" <cmh [at] cs [dot] purdue.edu>
X-Mailer: Mozilla 4.7 [en] (WinNT; U)
X-Accept-Language: en
MIME-Version: 1.0
To: Jack Chang <chang [at] u [dot] washington.edu>
CC: "'reliable_computing'" <reliable_computing [at] interval [dot] usl.edu>
Subject: Re: compiler optimization mode and rounding
References: <Pine.LNX.4.04.10002181050520.13680-100000 [at] cdam [dot] me.washington.edu>
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

You need to tell the compiler that certain sections of your code are off
limits for rearranging, so that the setting of control words isn't undone.
Use "volatile"

Jack Chang wrote:

> Hi,
>
> I am wondering if compiler optimizatiom mode would affect rounding. It
> looks like that the egcs(gnu) compiler would overwrites rounding control
> if optimization is turn on. However, if I specify that no floating point
> variables should store in registers, the rounding control would be working
> at least for -O1 and -O2 for the egcs compiler. Nonetheless, the
> performace would suffer a great deal. For instance,
>
> if no optimization, (g++ -O0 ...) or with -ffloat-store flag turned on
>
> [RNEAR(3.0/7.0),RNEAR(3.0/7.0)] =
> [0.42857142857142854764, 0.42857142857142854764]
>
> [RDOWN(3.0/7.0),RUP(3.0/7.0)] =
> [0.42857142857142854764, 0.42857142857142860315]
>
> with optimization (g++ -O1 or above)
>
> [RNEAR(3.0/7.0),RNEAR(3.0/7.0)] =
> [0.42857142857142854764, 0.42857142857142854764]
>
> [RDOWN(3.0/7.0),RUP(3.0/7.0)] =
> [0.42857142857142854764, 0.42857142857142854764]
>
> Is there any way to fix the problem? Please advise,
>
> Thank you very much,
>
> Jack Chang

--
________________________________________________________________
Christoph M. Hoffmann          URL: www.cs.purdue.edu/people/cmh
Computer Science               tel: +1-765-494-6185
Purdue University              fax: +1-765-494-0739
West Lafayette, IN 47907-1398
________________________________________________________________



From owner-reliable_computing [at] interval [dot] usl.edu  Mon Feb 21 03:13:27 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id DAA20695
	for reliable_computing-outgoing; Mon, 21 Feb 2000 03:13:27 -0600 (CST)
Received: from dv.bs.dlr.de (dv.bs.dlr.de [129.247.32.132])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id DAA20690
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 21 Feb 2000 03:13:23 -0600 (CST)
Received: from achat.rz.bs.dlr.de (achat.rz.bs.dlr.de [129.247.40.218])
	by dv.bs.dlr.de (8.9.3/8.9.3) with ESMTP id KAA44984
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 21 Feb 2000 10:13:20 +0100
Received: from dlr.de (bfk143.fm.bs.dlr.de [129.247.39.76])
	by achat.rz.bs.dlr.de (8.9.2/8.9.3) with ESMTP id KAA29106
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 21 Feb 2000 10:13:19 +0100
Message-ID: <38B101AF.5DA483B3 [at] dlr [dot] de>
Date: Mon, 21 Feb 2000 10:13:19 +0100
From: Lars Witte <lars.witte [at] dlr [dot] de>
X-Mailer: Mozilla 4.7 [de] (WinNT; I)
X-Accept-Language: de
MIME-Version: 1.0
To: reliable_computing [at] interval [dot] louisiana.edu
Subject: Simulation of dynamic systems
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear members,
I investigate the effects of parameter uncertainties on flight systems.
This led to differential equations with interval valued right hand side.
My first simulations have shown some behavior like perpetual motion
machines (no wrapping effect).
Are there possibilities to supress such behavior or is IA in this case
generally the wrong way?
Thanks very much in advance. Regards,

Lars Witte
German Aerospace Center - Institute of Flight Research


From owner-reliable_computing [at] interval [dot] usl.edu  Mon Feb 21 06:02:18 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id GAA21971
	for reliable_computing-outgoing; Mon, 21 Feb 2000 06:02:18 -0600 (CST)
Received: from automatix.informatik.uni-wuerzburg.de (root [at] wi2x40 [dot] informatik.uni-wuerzburg.de [132.187.10.40])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id GAA21966
	for <reliable_computing [at] interval [dot] usl.edu>; Mon, 21 Feb 2000 06:02:14 -0600 (CST)
Received: from informatik.uni-wuerzburg.de (Ac2ea.pppool.de [213.6.194.234])
	by automatix.informatik.uni-wuerzburg.de (8.8.8/8.8.8) with ESMTP id NAA05160;
	Mon, 21 Feb 2000 13:02:07 +0100
Message-ID: <38B129E4.E942A0F3 [at] informatik [dot] uni-wuerzburg.de>
Date: Mon, 21 Feb 2000 13:04:52 +0100
From: "=?iso-8859-1?Q?J=FCrgen?= Wolff v. Gudenberg" 
	<wolff [at] informatik [dot] uni-wuerzburg.de>
X-Mailer: Mozilla 4.51 [de] (Win98; I)
X-Accept-Language: de
MIME-Version: 1.0
To: Jack Chang <chang [at] u [dot] washington.edu>
CC: "'reliable_computing'" <reliable_computing [at] interval [dot] usl.edu>
Subject: Re: compiler optimization mode and rounding
References: <Pine.LNX.4.04.10002181050520.13680-100000 [at] cdam [dot] me.washington.edu>
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

The advice to take some regions out of the optimization is ok for the moment,
but I like to stimulate a slightly more general discussion of the topic.

We found similar problems with optimizing compilers and floating-point
arithmetic.
1. Switching of the rounding mode is not considered to have any
influence on arithmetic operations, so it is moved out of loops etc.
possible solution:
==> compiler writers should learn the dependence between rounding and
arithmetic.
even better solution:
==> computer architects should learn that rounding belongs to an
arithmetic operation and provide us with such combined operations
instead of manipulating a control register.

2. Different word-length in register and memory causes problems when
   comparing to numbers.
possible solution
==> I think that compiler writers do their job correctly here, they
   could issue an explicit warning. Computer architects should not be
   blamed for providing more precision. So we have to avoid those
   comparisons or use it consciously.

3. If x == NaN, then x > y and x <= y both deliver false according to
   IEEE 754.
possible solution:
==> compiler writers may not change a floating-point comparison in
   order to save branch instructions.

Juergen WvG

Jack Chang schrieb:

> Hi,
>
> I am wondering if compiler optimizatiom mode would affect rounding. It
> looks like that the egcs(gnu) compiler would overwrites rounding control
> if optimization is turn on. However, if I specify that no floating point
> variables should store in registers, the rounding control would be working
> at least for -O1 and -O2 for the egcs compiler. Nonetheless, the
> performace would suffer a great deal. For instance,
>
> if no optimization, (g++ -O0 ...) or with -ffloat-store flag turned on
>
> [RNEAR(3.0/7.0),RNEAR(3.0/7.0)] =
> [0.42857142857142854764, 0.42857142857142854764]
>
> [RDOWN(3.0/7.0),RUP(3.0/7.0)] =
> [0.42857142857142854764, 0.42857142857142860315]
>
> with optimization (g++ -O1 or above)
>
> [RNEAR(3.0/7.0),RNEAR(3.0/7.0)] =
> [0.42857142857142854764, 0.42857142857142854764]
>
> [RDOWN(3.0/7.0),RUP(3.0/7.0)] =
> [0.42857142857142854764, 0.42857142857142854764]
>
> Is there any way to fix the problem? Please advise,
>
> Thank you very much,
>
> Jack Chang

--

                                         __o
                                         \<,
___________________()/ ()__________________

 Prof. Dr. J. Wolff v. Gudenberg
 wolff [at] informatik [dot] uni-wuerzburg.de
 Tel. 0931 / 888-6602  Fax. 0931 / 888-6603
 URL  http://www-info2.informatik.uni-wuerzburg.de/staff/wvg
Lehrstuhl fuer Informatik II   Universitaet Wuerzburg
Am Hubland D-97074 Wuerzburg
---------------------------------------------



From owner-reliable_computing [at] interval [dot] usl.edu  Mon Feb 21 10:37:04 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA22505
	for reliable_computing-outgoing; Mon, 21 Feb 2000 10:37:04 -0600 (CST)
Received: from csc-sun.math.utah.edu (root@csc-sun.math.utah.edu [128.110.198.2])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA22500
	for <reliable_computing [at] interval [dot] usl.edu>; Mon, 21 Feb 2000 10:37:00 -0600 (CST)
Received: from suncore.math.utah.edu (suncore0.math.utah.edu [128.110.198.5])
	by csc-sun.math.utah.edu (8.9.3/8.9.3) with ESMTP id JAA10589;
	Mon, 21 Feb 2000 09:36:57 -0700 (MST)
Received: (from beebe@localhost)
	by suncore.math.utah.edu (8.9.3/8.9.3) id JAA15876;
	Mon, 21 Feb 2000 09:36:57 -0700 (MST)
Date: Mon, 21 Feb 2000 09:36:57 -0700 (MST)
From: "Nelson H. F. Beebe" <beebe [at] math [dot] utah.edu>
To: Jack Chang <chang [at] u [dot] washington.edu>
Cc: beebe [at] math [dot] utah.edu,
        "'reliable_computing'" <reliable_computing [at] interval [dot] usl.edu>
X-US-Mail: "Center for Scientific Computing, Department of Mathematics, 322
        INSCC, University of Utah, 155 S 1400 E RM 233, Salt Lake City, UT
        84112-0090, USA"
X-Telephone: +1 801 581 5254
X-FAX: +1 801 585 1640, +1 801 581 4148
X-URL: http://www.math.utah.edu/~beebe
Subject: Re: compiler optimization mode and rounding
In-Reply-To: Your message of Fri, 18 Feb 2000 11:34:16 -0800 (PST)
Message-ID: <CMM.0.91.0.951151016.beebe [at] suncore [dot] math.utah.edu>
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Jack Chang <chang [at] u [dot] washington.edu> writes on Fri, 18 Feb 2000 11:34:16 -0800 (PST)
about a problem with rounding control in gcc with the -ffloat-store flag.

This is a bug; I reported it several weeks ago, and received patches for
gcc-2.95.2 that will make it into the next release (date unknown).  

Jack, if you are interested, mail me privately, and I'll dig them out of my
mail archives.  Otherwise, you could revert to the gcc 2.7x releases, were
-ffloat-store works as expected.

-------------------------------------------------------------------------------
- Nelson H. F. Beebe                    Tel: +1 801 581 5254                  -
- Center for Scientific Computing       FAX: +1 801 585 1640, +1 801 581 4148 -
- University of Utah                    Internet e-mail: beebe [at] math [dot] utah.edu  -
- Department of Mathematics, 322 INSCC                   beebe [at] acm [dot] org        -
- 155 S 1400 E RM 233                                    beebe [at] ieee [dot] org       -
- Salt Lake City, UT 84112-0090, USA    URL: http://www.math.utah.edu/~beebe  -
-------------------------------------------------------------------------------

From owner-reliable_computing [at] interval [dot] usl.edu  Mon Feb 21 10:40:12 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA22666
	for reliable_computing-outgoing; Mon, 21 Feb 2000 10:40:12 -0600 (CST)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA22661
	for <reliable_computing [at] interval [dot] usl.edu>; Mon, 21 Feb 2000 10:40:07 -0600 (CST)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.9.3+Sun/8.9.1) with SMTP id JAA08144;
	Mon, 21 Feb 2000 09:40:02 -0700 (MST)
Message-Id: <200002211640.JAA08144 [at] cs [dot] utep.edu>
Date: Mon, 21 Feb 2000 09:40:02 -0700 (MST)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: Re: GCD or LCM for fuzzy numbers
To: zak [at] NOSPAM [dot] majiq.com
Cc: reliable_computing [at] interval [dot] usl.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: Y9XopoiqnT8GEIh4aMIweg==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear Eugene, 

It looks like your question was sent to the wrong list, because it has nothing 
to do with fuzzy and all to do with intervals. I am forwarding it to the 
interval computations mailing list, maybe someone knows a good algorithm for 
that. 

It may not happen, because we are normally dealing with intervals of real 
numbers, and for interval of integers, usually, all the problems become much 
computationally harder. 

In my experience, it may help if you elaborate some on the practical problem 
(if there is any) which you are trying to solve. 

You may also want to try to consult someone working in number theory, maybe 
they have a good algorithm already known (or some negative result, like 
NP-hardness). 

The only close practical problem which I could think of is a problem useful in 
celestial mecahnics where we have, e.g., two interval [p1-,p1+] and [p2-,p2+] 
for periods of two planets, and we are trying to find the ratio p1/p2 where p1 
and p2 are from the corresponding intervals which is rational with, say, the 
smallest possible sum of the absolute values of numerator and denominator (this 
problem is useful for detecting resonances which behave differently in terms of 
stability (we had a small paper on that some time ago). 

Vladik

> Date: Mon, 21 Feb 2000 14:22:51 +0100 (MET)
> Originator: fuzzy-mail [at] dbai [dot] tuwien.ac.at
> From: "Eugene Zak" <zak [at] NOSPAM [dot] majiq.com>
> To: nafips-l [at] sphinx [dot] Gsu.EDU
> Subject: GCD or LCM for fuzzy numbers
> X-Listprocessor-Version: 8.2.07 -- ListProc(tm) by CREN
> X-Comment: Fuzzy Distribution List
> X-Sender: fuzzy-mail [at] dbai [dot] tuwien.ac.at
> 
> I am looking for an efficient algorithm for finding GCD or LCM of fuzzy
> numbers. I define a fuzzy number "a" as a=[a_min, a_max], and
> GCD(a,b) as the greatest among GCD(x,y) where x belongs to [a_min, a_max]
> and y belongs to [b_min, b_max].
> LCM(a,b) is the least among LCM(x,y) accordingly.
> Example:
> a = [9, 11]
> b = [14, 16]
> I would like to have these answers: GCD(a,b) = 5 and LCM( a, b) = 30.
> A trivial enumeration is not acceptable.
> Thanks a lot.
> Eugene
> zak [at] majiq [dot] com


From owner-reliable_computing [at] interval [dot] usl.edu  Mon Feb 21 21:55:55 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id VAA23990
	for reliable_computing-outgoing; Mon, 21 Feb 2000 21:55:55 -0600 (CST)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id VAA23985
	for <reliable_computing [at] interval [dot] usl.edu>; Mon, 21 Feb 2000 21:55:51 -0600 (CST)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.9.3+Sun/8.9.1) with SMTP id UAA11385
	for <reliable_computing [at] interval [dot] usl.edu>; Mon, 21 Feb 2000 20:55:45 -0700 (MST)
Message-Id: <200002220355.UAA11385 [at] cs [dot] utep.edu>
Date: Mon, 21 Feb 2000 20:55:46 -0700 (MST)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: Re: GCD or LCM for fuzzy numbers (clarification)
To: reliable_computing [at] interval [dot] usl.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: rM92Gs430MDrEy91fA3uoQ==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


------------- Begin Forwarded Message -------------

From: Eugene_Zak [at] majiq [dot] com
Subject: Re: GCD or LCM for fuzzy numbers
To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Date: Mon, 21 Feb 2000 09:20:31 -0800
X-MIMETrack: Serialize by Router on Notes2/Majiq(Release 5.0.2b |December 16, 
1999) at 02/21/2000 09:20:31 AM
MIME-Version: 1.0


Hello, Vladik:
Many thanks for you detailed letter. As a matter fact I do not insist on
integrality of the numbers. I used integers
for illustration purpose only.
As for the practical problem you have a good example. Mine is not from the
sky but
from the paper industry. A paper customer may accept a paper roll of a
certain diameter but with some say 4%
tolerance. So the diameter tolerance bring the "fuzziness". That roll is
rewound from a larger roll. It would be nice
to rewind an integer number of finished rolls out of a large parent roll.
Diameter is certainly being translated to linear footage.  The general case
of the problem stems from a special equipment- biwinder where rolls of
several different diameters can be wound from one parent.
I agree that intervals is not a full scale fuzzy number case. I appreciate
forwarding my letter to the appropriate
news group.
Thanks.
Eugene




                                                                                         
                    Vladik                                                               
                    Kreinovich           To:     zak [at] majiq [dot] com                           
                    <vladik [at] cs [dot] ut        cc:                                             
                    ep.edu>              Subject:     Re: GCD or LCM for fuzzy 
numbers   
                                                                                         
                    02/21/00                                                             
                    08:43 AM                                                             
                    Please                                                               
                    respond to                                                           
                    Vladik                                                               
                    Kreinovich                                                           
                                                                                         
                                                                                         





------------- Begin Forwarded Message -------------

Date: Mon, 21 Feb 2000 09:40:02 -0700 (MST)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: Re: GCD or LCM for fuzzy numbers
To: zak [at] NOSPAM [dot] majiq.com
Cc: reliable_computing [at] interval [dot] usl.edu
MIME-Version: 1.0
Content-MD5: Y9XopoiqnT8GEIh4aMIweg==

Dear Eugene,

It looks like your question was sent to the wrong list, because it has
nothing
to do with fuzzy and all to do with intervals. I am forwarding it to the
interval computations mailing list, maybe someone knows a good algorithm
for
that.

It may not happen, because we are normally dealing with intervals of real
numbers, and for interval of integers, usually, all the problems become
much
computationally harder.

In my experience, it may help if you elaborate some on the practical
problem
(if there is any) which you are trying to solve.

You may also want to try to consult someone working in number theory, maybe
they have a good algorithm already known (or some negative result, like
NP-hardness).

The only close practical problem which I could think of is a problem useful
in
celestial mecahnics where we have, e.g., two interval [p1-,p1+] and
[p2-,p2+]
for periods of two planets, and we are trying to find the ratio p1/p2 where
p1
and p2 are from the corresponding intervals which is rational with, say,
the
smallest possible sum of the absolute values of numerator and denominator
(this
problem is useful for detecting resonances which behave differently in
terms of
stability (we had a small paper on that some time ago).

Vladik

> Date: Mon, 21 Feb 2000 14:22:51 +0100 (MET)
> Originator: fuzzy-mail [at] dbai [dot] tuwien.ac.at
> From: "Eugene Zak" <zak [at] NOSPAM [dot] majiq.com>
> To: nafips-l [at] sphinx [dot] Gsu.EDU
> Subject: GCD or LCM for fuzzy numbers
> X-Listprocessor-Version: 8.2.07 -- ListProc(tm) by CREN
> X-Comment: Fuzzy Distribution List
> X-Sender: fuzzy-mail [at] dbai [dot] tuwien.ac.at
>
> I am looking for an efficient algorithm for finding GCD or LCM of fuzzy
> numbers. I define a fuzzy number "a" as a=[a_min, a_max], and
> GCD(a,b) as the greatest among GCD(x,y) where x belongs to [a_min, a_max]
> and y belongs to [b_min, b_max].
> LCM(a,b) is the least among LCM(x,y) accordingly.
> Example:
> a = [9, 11]
> b = [14, 16]
> I would like to have these answers: GCD(a,b) = 5 and LCM( a, b) = 30.
> A trivial enumeration is not acceptable.
> Thanks a lot.
> Eugene
> zak [at] majiq [dot] com

------------- End Forwarded Message -------------






------------- End Forwarded Message -------------



From owner-reliable_computing [at] interval [dot] usl.edu  Tue Feb 22 17:43:14 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id RAA26335
	for reliable_computing-outgoing; Tue, 22 Feb 2000 17:43:14 -0600 (CST)
Received: from pompeii.ise (troy.eiffel.com [198.68.147.5])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id RAA26330
	for <reliable_computing [at] interval [dot] usl.edu>; Tue, 22 Feb 2000 17:43:10 -0600 (CST)
Received: from lannion.ise ([10.0.10.105])
	by pompeii.ise with smtp (Exim 3.02 #2)
	id 12NOwr-0005LB-00
	for reliable_computing [at] interval [dot] usl.edu; Tue, 22 Feb 2000 15:42:33 -0800
Received: by lannion.ise (SMI-8.6/SMI-SVR4)
	id PAA13153; Tue, 22 Feb 2000 15:42:41 -0800
Date: Tue, 22 Feb 2000 15:42:41 -0800
Message-Id: <200002222342.PAA13153 [at] lannion [dot] ise>
From: "TOOLS Conferences" <announce [at] tools [dot] com>
To: reliable_computing [at] interval [dot] usl.edu
Subject: TOOLS USA 2000 Call for contributions
Reply-to: announce [at] tools [dot] com
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear Colleague:

This is the abbreviated call for contributions for TOOLS USA 2000.
The full information is at

		http://www.tools-conferences.com/usa

Please post or forward this information to any other colleague who
think might be interested.

With best regards,

-- TOOLS Conference organization

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

		TOOLS USA 2000
 	  "Software Serving Society"

	Santa Barbara, California
  	  July 30 - August 3, 2000

http://www.toolsconferences.com/usa


CALL FOR CONTRIBUTIONS (deadline 10 March 2000)
 

TOOLS is the major international conference series devoted to
applications object technology, component technology and other
advanced approaches to software development.

TOOLS USA 2000 will be held in Santa Barbara, CA at the Fess Parker
Double Tree Resort, one of the most beautiful resorts on the West Coast
and will continue the commitment to excellence of earlier TOOLS conferences
in Europe, Australia, Asia and the USA since 1989.

The proceedings will be published world-wide by the IEEE Computer
Society.


PAPERS
------

TOOLS USA 2000 is now soliciting papers on all aspects of
object and component technology. All submitted papers will be refereed
and assessed for technical quality and usefulness to practitioners and
applied researchers.

TOOLS USA particularly welcomes papers that present general
findings based upon industrial experience. Such papers will be judged
by the quality of their contribution to industrial best-practice.

TUTORIALS, WORKSHOPS AND PANELS
-------------------------------

Tutorials, workshops, and panels  form an important part of the TOOLS
conferences. TOOLS USA 2000 is welcoming proposals for tutorials,
workshops and panels on topics related to the theme of the conference.


FOR MORE DETAILS AND REGISTRATION INFORMATION PLEASE VISIT THE CONFERENCE
WEBSITE AT http://www.tools-conferences.com/usa


From owner-reliable_computing [at] interval [dot] usl.edu  Wed Feb 23 03:13:06 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id DAA27125
	for reliable_computing-outgoing; Wed, 23 Feb 2000 03:13:06 -0600 (CST)
Received: from feu.irisa.fr (feu.irisa.fr [131.254.60.80])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id DAA27120
	for <reliable_computing [at] interval [dot] usl.edu>; Wed, 23 Feb 2000 03:13:02 -0600 (CST)
Received: from irisa.fr (partance.irisa.fr [131.254.21.57])
	by feu.irisa.fr (8.9.3/8.9.3) with ESMTP id KAA06098
	for <reliable_computing [at] interval [dot] usl.edu>; Wed, 23 Feb 2000 10:12:54 +0100 (MET)
Message-ID: <38B3A492.EE803271 [at] irisa [dot] fr>
Date: Wed, 23 Feb 2000 10:12:50 +0100
From: Bernard Philippe <Bernard.Philippe [at] irisa [dot] fr>
X-Mailer: Mozilla 4.03 [fr] (WinNT; I)
MIME-Version: 1.0
To: "reliable_computing [at] interval [dot] usl.edu" <reliable_computing [at] interval [dot] usl.edu>
Subject: Research position at INRIA/IRISA (France)
Content-Type: multipart/mixed; boundary="------------93EEF3649168F6420E956E55"
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Il s'agit d'un message multivolet au format MIME.
--------------93EEF3649168F6420E956E55
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit

RESEARCH POSITION AT INRIA / IRISA

INRIA is an internationally recognized research institute in Computer
Science
and Automation, funded by the French government.

INRIA seeks outstanding candidates who have completed a Ph.D. (or
equivalent)
in Computer Science, Signal and Image Processing, or Applied
Mathematics. Government positions are open at the level "Charge de
Recherche"
(Research Assistant) to French as well as non-French applicants. See the

announcement : http://www.inria.fr/Trav/Concours2000/conc2000a-eng.html
.

The selection of the candidates is organized in each INRIA center. At
the
INRIA center of Rennes (IRISA), three positions are open. The Aladin
group of
research (see http://www.irisa.fr/aladin ) seeks for a candidate
specialized
in Scientific Computing (solving methods for linear algebra or
differential
equation ; numerical reliability, parallelism)

Interested persons should contact as soon as possible :
Jocelyne Erhel, (email : Jocelyne.Erhel [at] irisa [dot] fr )
and no later than Monday, 6th of March 2000.

For further information :
- on IRISA, see :  http://www.irisa.fr/accueil/index_uk.htm
- on INRIA, see : http://www.inria.fr/welcome-eng.html
- on the city of Rennes, see :
http://www.rennestelecom.com/index_map.htm



--------------93EEF3649168F6420E956E55
Content-Type: text/x-vcard; charset=us-ascii; name="vcard.vcf"
Content-Transfer-Encoding: 7bit
Content-Description: Carte pour Bernard PHILIPPE
Content-Disposition: attachment; filename="vcard.vcf"

begin:          vcard
fn:             Bernard PHILIPPE
n:              PHILIPPE;Bernard
org:            INRIA/IRISA
adr:            IRISA;;Campus de Beaulieu;35042 RENNES Cedex;;;FRANCE
email;internet: Bernard.Philippe [at] irisa [dot] fr
title:          Directeur de recherche
tel;work:       +33 2 99 84 73 38
tel;fax:        +33 2 99 84 25 27
tel;home:       +33 2 99 59 41 91
x-mozilla-cpt:  ;0
x-mozilla-html: FALSE
version:        2.1
end:            vcard


--------------93EEF3649168F6420E956E55--


From owner-reliable_computing [at] interval [dot] usl.edu  Thu Feb 24 13:33:45 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id NAA01174
	for reliable_computing-outgoing; Thu, 24 Feb 2000 13:33:45 -0600 (CST)
Received: from pilot020.cl.msu.edu (pilot020.cl.msu.edu [35.9.5.120])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id NAA01167
	for <reliable_computing [at] interval [dot] louisiana.edu>; Thu, 24 Feb 2000 13:33:27 -0600 (CST)
Received: from berz (berz.user.msu.edu [35.10.52.114])
	by pilot020.cl.msu.edu (8.9.1a/8.9.1) with SMTP id OAA18416;
	Thu, 24 Feb 2000 14:33:01 -0500
From: "Martin Berz" <berz [at] msu [dot] edu>
To: "Lars Witte" <lars.witte [at] dlr [dot] de>,
        <reliable_computing [at] interval [dot] louisiana.edu>
Subject: RE: Simulation of dynamic systems
Date: Thu, 24 Feb 2000 14:31:56 -0500
Message-ID: <LOBBLFLDLCOABDBDAMICMEHECKAA.berz [at] msu [dot] edu>
MIME-Version: 1.0
Content-Type: text/plain;
	charset="iso-8859-1"
Content-Transfer-Encoding: 7bit
X-Priority: 3 (Normal)
X-MSMail-Priority: Normal
X-Mailer: Microsoft Outlook IMO, Build 9.0.2416 (9.0.2910.0)
In-Reply-To: <38B101AF.5DA483B3 [at] dlr [dot] de>
Importance: Normal
X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2314.1300
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear Dr. Witte,

what you are describing sounds very similar to ODEs we are studying, where
we usually carry along between 4 and 10 parameters. The verified ODE
integrators we have developed can carry along the parameter dependence
without inflation of the predicted boxes that you would get with other
approaches as soon as the parameter ranges are significant. It also avoids
the wrapping effect due to other uncertainties and re-packaging of the
boxes. You may want to take a look at the paper

Verified Integration of ODEs and Flows using Differential Algebraic Methods
on High-Order Taylor Models, M. Berz and K. Makino, Reliable Computing, 4,
361-369 (1998),

which is available at
http://bt.nscl.msu.edu/papers-cgi/display.pl?name=rdaint. Feel free to
contact us with any additional questions; perhaps it would also be useful to
have a little more detail about your actual problem under consideration.

Sincerely,

Martin Berz


> -----Original Message-----
> From: owner-reliable_computing [at] interval [dot] usl.edu
> [mailto:owner-reliable_computing [at] interval [dot] usl.edu]On Behalf Of Lars
> Witte
> Sent: Monday, February 21, 2000 4:13 AM
> To: reliable_computing [at] interval [dot] louisiana.edu
> Subject: Simulation of dynamic systems
>
>
> Dear members,
> I investigate the effects of parameter uncertainties on flight systems.
> This led to differential equations with interval valued right hand side.
> My first simulations have shown some behavior like perpetual motion
> machines (no wrapping effect).
> Are there possibilities to supress such behavior or is IA in this case
> generally the wrong way?
> Thanks very much in advance. Regards,
>
> Lars Witte
> German Aerospace Center - Institute of Flight Research
>
>


From owner-reliable_computing [at] interval [dot] usl.edu  Fri Feb 25 03:14:48 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id DAA02352
	for reliable_computing-outgoing; Fri, 25 Feb 2000 03:14:48 -0600 (CST)
Received: from genie.eecs.lehigh.edu (genie.eecs.lehigh.edu [128.180.98.9])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id DAA02347
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 25 Feb 2000 03:14:44 -0600 (CST)
Received: from pamir.eecs.lehigh.edu (pamir [128.180.98.184])
	by genie.eecs.lehigh.edu (8.8.5/8.8.5) with ESMTP id XAA07958
	for <asap-announce [at] mailhost [dot] eecs.lehigh.edu>; Thu, 24 Feb 2000 23:04:03 -0500 (EST)
From: ASAP User <asap [at] EECS [dot] Lehigh.EDU>
Received: (from asap@localhost)
	by pamir.eecs.lehigh.edu (8.8.5/8.8.5) id XAA00402
	for asap-announce; Thu, 24 Feb 2000 23:04:01 -0500 (EST)
Date: Thu, 24 Feb 2000 23:04:01 -0500 (EST)
Message-Id: <200002250404.XAA00402 [at] pamir [dot] eecs.lehigh.edu>
To: asap-announce [at] EECS [dot] Lehigh.EDU
Subject: ASAP 2000 Deadline Extension
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear colleagues, 

The deadline for paper submissions for ASAP 2000 has been extended to
March 13, 2000. You can submit your paper and cover page via email to 
asap [at] eecs [dot] lehigh.edu any time between now and March 13, 2000. The revised 
call for papers is given below. 

If you have any questions about the conference or paper submissions, please 
send email to asap [at] eecs [dot] lehigh.edu or mschulte [at] eecs [dot] lehigh.edu. 

Best regards, 

Mike Schulte

++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
                          ASAP 2000 CALL FOR PAPERS
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
            12th International Conference on Application-specific
                     Systems, Architectures and Processors
    			   Boston, Massachusetts

Revised Dates and Deadlines
  Submission:                 March 13, 2000
  Acceptance notification:    April 13,  2000
  Conference:                 July 10-12, 2000

Topics:
  The conference will cover the theory and practice of application- 
  specific computing systems. Of particular interest are contributions
  that either achieve large performance gains, present formal methods for 
  the specification, design and evaluation, analyze technology dependencies 
  and the integration of hardware and software components, or describe and 
  evaluate fabricated systems.

  Areas for application-specific computing systems are many and varied. 
  Some sample areas include information systems, signal and image processing, 
  multimedia systems, high-speed networks, compression, cryptography. 

  Aspects of application-specific computing systems that are of interest 
  include, but are not limited to:
  * Application-specific architectures:
    special purpose designs, design methodology, CAD tools, fault 
    tolerance strategies, specification and interfaces, hardware/software
    codesign
  * Application-specific processors:
    digital signal processing, computer arithmetic, configurable/custom 
    computing, implementation methodology & rapid prototyping, new 
    technologies, fine-grain parallelism
  * Application-specific systems:
    network computing, special-purpose systems for exotic applications, 
    performance evaluation, standard software objects, languages, 
    compilers, operating systems, hardware/software integration

  The conference will feature a keynote speech, paper presentations, and
  a poster session. The proceedings will be published by IEEE Computer 
  Society Press.

Information for authors:

  Your paper should be a maximum of 5000 words. A PDF version of the
  complete paper and a separate cover page text file, with the following
  information 

  * paper title; 
  * paper abstract; 
  * complete name, address, telephone, fax and email of each author; 
  * author which is responsible for correspondence; 
  * which of the conference areas is most relevant to your paper

  should be submitted via email to asap [at] eecs [dot] lehigh.edu. For further 
  information about the conference, please see the conference 
  web page at http://www.eecs.lehigh.edu/ASAP or send email to
  asap [at] eecs [dot] lehigh.edu.

General Chair:  	Earl Swartzlander e.swartzlander [at] compmail [dot] com
Program Chairs: 	Graham Jullien    jullien [at] uwindsor [dot] ca
			Michael Schulte   mschulte [at] eecs [dot] lehigh.edu

Program committee:

  Magdy Bayoumi, Wayne Burleson, Peter Capello, Liang-Gee Chen, Ed Deprettere,
  Milos Ercegovac, Gerhard Fettweis, Jose Fortes, Sayfe Kiaei, Israel Koren, 
  S. Y. Kung, Tomas Lang, Wayne Luk, John McCanny, Jean-Michel Muller, 
  Takao Nishitani, Tobias Noll, Peter Pirsch, Patrice Quinton, Sanjay 
  Rajopadhye, Vwani Roychowdhury, Valerie Taylor, Juergen Teich, Lothar Thiele,
  Mateo Valero, Benjamin Wah, Doran Wilde, Roger Woods, Kung Yao, Pen Yew.

From owner-reliable_computing [at] interval [dot] usl.edu  Sat Feb 26 11:34:58 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id LAA04570
	for reliable_computing-outgoing; Sat, 26 Feb 2000 11:34:58 -0600 (CST)
Received: from kleene.math.wisc.edu (kleene.math.wisc.edu [144.92.166.90])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id LAA04565
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sat, 26 Feb 2000 11:34:45 -0600 (CST)
Received: from forelli.math.wisc.edu (forelli.math.wisc.edu [144.92.166.70])
	by kleene.math.wisc.edu (8.9.3/8.9.3) with SMTP id LAA06404;
	Sat, 26 Feb 2000 11:30:04 -0600 (CST)
Date: Sat, 26 Feb 2000 11:51:51 -0600 (CST)
From: Hans Schneider <hans [at] math [dot] wisc.edu>
To: NETS -- at-net <at-net [at] mi [dot] uni-erlangen.de>,
        "Hershkowitz, Danny -- Hershkowitz Daniel" <hershkow [at] aluf [dot] technion.ac.il>,
        Danny Hershkowitz <hershkow [at] techunix [dot] technion.ac.il>,
        E-LETTER <eletter-request [at] win [dot] tue.nl>,
        "na.digest" <na.digest@na-net.ornl.gov>, ipnet-digest [at] math [dot] msu.edu,
        wim@bell-labs.com, hjt [at] eos [dot] ncsu.edu, vkm [at] eedsp [dot] gatech.edu,
        reliable_computing [at] interval [dot] louisiana.edu
cc: Arjen Sevenster <a.sevenster [at] elsevier [dot] nl>,
        Claudette Daalen van <c.daalen [at] elsevier [dot] nl>,
        Aad Thoen <a.thoen [at] elsevier [dot] nl>,
        Editors of 4th LSC issue -- Vincent Blondel <blondel [at] inma [dot] ucl.ac.be>,
        Diederich Hinrichsen <dh [at] math [dot] uni-Bremen.de>,
        "Rosenthal, Joachim -- Joachim Rosenthal" <rosen [at] nd [dot] edu>,
        rosen [at] euler [dot] math.nd.edu, Paul Vandooren <vandooren [at] anma [dot] ucl.ac.be>,
        Sally Rear <rear [at] math [dot] wisc.edu>
Subject: LAA announcement of a special issue
Message-ID: <Pine.GSO.3.96.1000226114924.24940D-100000 [at] forelli [dot] math.wisc.edu>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Content-Transfer-Encoding: 8bit
X-MIME-Autoconverted: from QUOTED-PRINTABLE to 8bit by interval.usl.edu id LAA04566
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk



------------------------------------------------------------------------------
Hans Schneider                                 hans [at] math [dot] wisc.edu.
Department of Mathematics                      608-262-1402 (Work)
Van Vleck Hall                                 608-271-7252 (Home)
480 Lincoln Drive                              608-263-8891 (Work FAX)
University of Wisconsin-Madison                608-271-8477 (Home FAX)
Madison WI 53706 USA             http://www.math.wisc.edu/~hans (URL)
------------------------------------------------------------------------------



              LINEAR ALGEBRA AND ITS APPLICATIONS

CALL FOR PAPERS: Fourth Special Issue on Linear Systems and Control.

In the past, LAA has published three special issues devoted to
the field of Linear Systems and Control: 1983 (vol. 50), 1989
(vols.  122-124) and 1994 (vols. 203-204). More than six years
after the publication of the last special issue, it is time to
take stock of recent and current interactions between Linear
Algebra and Systems Theory.

The cross fertilization between these two fields has been very
fruitful in the past. While linear algebraic methods have been
instrumental for much of the development of linear systems
theory, many system theoretic concepts and constructions are now
part of the body of linear algebra.  Today systems theory is a
place where methods from many different parts of mathematics are
combined.  As a result linear systems theory has become a rich
source of linear algebraic problems.  More recently, new
paradigms, new problems and areas of application have appeared
on the scene: the behavioural approach, coding theory, distance
problems and parameter uncertainty, the dynamic systems approach to 
algorithms, computational complexity issues in systems theory and
discrete event  systems.

These important subject areas have enriched linear systems theory
and will influence the future development of linear algebra, too.
We hope that the upcoming issue will further this process and we
encourage all authors working in these areas to submit their
contributions.

As in previous issues, this one will be open for all papers with
significant new results in Systems and Control Theory where
either linear algebraic methods play an important role or new
tools and problems of linear algebraic nature are presented.
Also survey papers are very welcome which illustrate specific
areas where the interaction of Systems Theory and Linear Algebra
has been particularly successful.  Papers must meet the
publication standards of Linear Algebra and Its Applications and
will be refereed in the usual way.

Areas and topics of interest for this special issue include:

- Structure theory of linear systems and system families
- Stability theory
- Distance problems and analysis of uncertain systems
- Methods of robust control
- Approximation and interpolation problems arising in systems theory
- Geometric control theory and geometry of linear systems
- Linear behaviors
- Multidimensional systems and systems over rings
- Module theoretic techniques in system theory
- Coding theory with connections to systems theory
- Algorithms for linear systems
- Numerical issues in linear systems theory
- Computational complexity in linear algebra and systems theory
- Discrete event systems


The deadline for submission of papers is 31 December 2000, and
the special issue is expected to be published in the first half
of 2002. Papers should be sent to any of its special editors:

Vincent Blondel
Department of Mathematical Engineering, CESAME
Université catholique de Louvain
Avenue Georges Lemaitre, 4
B-1348 Louvain-la-Neuve
Belgium
E-mail: blondel [at] inma [dot] ucl.ac.be

Diederich Hinrichsen
Institut fuer Dynamische Systeme,
Universitaet Bremen
Postfach 330 440
D 28334   Bremen
Germany
E-mail:  dh [at] math [dot] uni-bremen.de

Joachim Rosenthal
Department of Mathematics
University of Notre Dame
Notre Dame, IN 46556-5683
U.S.A.
E-mail: rosen [at] nd [dot] edu

Paul Van Dooren
Department of Mathematical Engineering, CESAME
Université catholique de Louvain
Avenue Georges Lemaitre, 4
B-1348 Louvain-la-Neuve
Belgium
E-mail: vdooren [at] anma [dot] ucl.ac.be


From owner-reliable_computing [at] interval [dot] usl.edu  Sun Feb 27 19:07:16 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id TAA06049
	for reliable_computing-outgoing; Sun, 27 Feb 2000 19:07:16 -0600 (CST)
Received: from mscs.mu.edu (studsys.mscs.mu.edu [134.48.4.15])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with SMTP id TAA06044
	for <reliable_computing [at] interval [dot] usl.edu>; Sun, 27 Feb 2000 19:07:13 -0600 (CST)
Received: (qmail 16454 invoked from network); 28 Feb 2000 01:04:50 -0000
Received: from ppp101.csd.mu.edu (HELO mscs.mu.edu) (134.48.24.1)
  by studsys.mscs.mu.edu with SMTP; 28 Feb 2000 01:04:50 -0000
Message-ID: <38B9CA0A.C5ADDB4 [at] mscs [dot] mu.edu>
Date: Sun, 27 Feb 2000 19:06:18 -0600
From: George Corliss <georgec [at] mscs [dot] mu.edu>
Organization: Marquette University
X-Mailer: Mozilla 4.7 [en] (Win98; U)
X-Accept-Language: en
MIME-Version: 1.0
To: zak [at] NOSPAM [dot] majiq.com
CC: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>,
        reliable_computing [at] interval [dot] usl.edu
Subject: Re: GCD or LCM for fuzzy numbers
References: <200002211640.JAA08144 [at] cs [dot] utep.edu>
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear Eugene,

> > I am looking for an efficient algorithm for finding GCD or LCM of fuzzy
> > numbers. I define a fuzzy number "a" as a=[a_min, a_max], and
> > GCD(a,b) as the greatest among GCD(x,y) where x belongs to [a_min, a_max]
> > and y belongs to [b_min, b_max].
> > LCM(a,b) is the least among LCM(x,y) accordingly.
> > Example:
> > a = [9, 11]
> > b = [14, 16]
> > I would like to have these answers: GCD(a,b) = 5 and LCM( a, b) = 30.
> > A trivial enumeration is not acceptable.
> > Thanks a lot.

In a paper:
Chin1998a:  Paulina Chin, Robert M. Corless, and George F. Corliss, 
Optimization Strategies for the Floating-Point GCD, 
in Proceedings of the 1998 International Symposium on Symbolic and
Algebraic Computation (ISAAC '98), 
Oliver Gloor (ed.), ACM Press, New York, 1998, pp. 228-235. 
[ BibTex | 1998a.ps.gz (Preprint, 52K) ] 
See http://www.mscs.mu.edu/~georgec/Pubs/chapt.html#1998a

we attacked a vaguely similar problem.  The idea in your context
is to formulate the question as an optimization problem

min -GCD
subject to
   GCD * p = a in [a]
   GCD * q = b in [b]

If your GCD is an integer, this is an integer
programming problem. a in [a] and b in [b] are probably expressed
to your integer programming software as bound constraints.

Actually, I guess this is an integer LP problem?  I'm an interval
person, so I'd probably use an interval tool, GlobSol from
Baker Kearfott, but that is almost surely overkill.  Surely a
point integer LP solver will do fine.


[Responses to this and other questions posed to this mailing list
are compiled as Interval Frequently Asked Questions at
http://www.mscs.mu.edu/~georgec/IFAQ/
]

Dr. George F. Corliss
Dept. Math, Stat, Comp Sci
Marquette University
P.O. Box 1881
Milwaukee, WI  53201-1881  USA
georgec [at] mscs [dot] mu.edu; George.Corliss [at] Marquette [dot] edu
http://www.mscs.mu.edu/~georgec/
Office: 414-288-6599;  Dept: 288-7375; Fax: 288-5472

From owner-reliable_computing [at] interval [dot] usl.edu  Mon Feb 28 05:48:39 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id FAA06792
	for reliable_computing-outgoing; Mon, 28 Feb 2000 05:48:39 -0600 (CST)
Received: from ns0.eris.dera.gov.uk (ns0.eris.dera.gov.uk [128.98.1.1])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with SMTP id FAA06787
	for <reliable_computing [at] interval [dot] usl.edu>; Mon, 28 Feb 2000 05:48:29 -0600 (CST)
Received: (qmail 31976 invoked from network); 28 Feb 2000 11:48:20 -0000
Received: from unknown (HELO mail-relay.eris.dera.gov.uk) (128.98.2.7)
  by ns0.eris.dera.gov.uk with SMTP; 28 Feb 2000 11:48:20 -0000
Received: (qmail 30839 invoked from network); 28 Feb 2000 11:48:20 -0000
Received: from boole.eris.dera.gov.uk (HELO eris.dera.gov.uk) (128.98.7.14)
  by mail-relay.eris.dera.gov.uk with SMTP; 28 Feb 2000 11:48:20 -0000
Message-ID: <38BA5EFB.7B08B6B0 [at] eris [dot] dera.gov.uk>
Date: Mon, 28 Feb 2000 11:41:47 +0000
From: "Colin O'Halloran" <c.ohalloran [at] eris [dot] dera.gov.uk>
X-Mailer: Mozilla 4.6 [en-gb] (Win95; I)
X-Accept-Language: en-GB,en,en-*
MIME-Version: 1.0
To: facs [at] lboro [dot] ac.uk, fm-info [at] air16 [dot] larc.nasa.gov,
        formal-methods [at] cs [dot] uidaho.edu,
        hise-safety-critical [at] minster [dot] cs.york.ac.uk, larc-swe [at] larc [dot] nasa.gov,
        reliable_computing [at] interval [dot] usl.edu, seworld [at] cs [dot] colorado.edu,
        system-safety [at] listserv [dot] gsfc.nasa.gov, vdm-forum [at] mailbase [dot] ac.uk,
        zeves [at] ora [dot] on.ca, zforum [at] prg [dot] ox.ac.uk, sag [at] eris [dot] dera.gov.uk
Subject: Call for papers for Automated Software Engineering
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Apologies for multiple copies


              Automated Software Engineering --- ASE'00 
                  15th IEEE International Conference 
              September 11--15, 2000, Grenoble, France 
       Abstracts due: March 24, 2000; Papers due: March 31, 2000 
       Latest information: http://sigart.acm.org/Conferences/ase/ 

Call for Papers 

The IEEE International Conference on Automated Software Engineering 
brings together researchers and practitioners to share ideas on the 
foundations, techniques, tools, and applications of automated software 
engineering technology.  Both automatic systems and systems that 
support and cooperate with people are within the scope of the 
conference, as are models of software and software engineering 
activities.  ASE'00 encourages contributions describing basic 
research, novel applications, and experience relevant to automating 
software engineering activities. Solicited topics include, but are not 
limited to: 

  - Automated software specification 
  - Automated software design and synthesis 
  - Category-theoretic approaches 
  - Computer-supported cooperative work 
  - Domain modeling 
  - Knowledge acquisition 
  - Maintenance and evolution 
  - Process and workflow management 
  - Program understanding 
  - Re-engineering 
  - Requirements engineering 
  - Reuse 
  - Software architectures 
  - Testing 
  - Tutoring, help, documentation systems 
  - Human computer interaction 
  - Verification and validation 

The IEEE International Conference on Automated Software Engineering 
was formerly known as the Knowledge-Based Software Engineering 
Conference.  In conjunction with the name change three years ago, the 
conference expanded to encourage worldwide participation and to reach 
other scientific communities concerned with formal methods, partial 
evaluation, process support, human-computer interface support, 
requirements engineering, reverse engineering, testing, or 
verification & validation. 

Accepted papers will be published in the conference proceedings, at 
IEEE Computer Society Press.  In addition, several of the highest 
quality papers will be selected for a special issue of the Journal of 
Automated Software Engineering (Kluwer).  ASE'00 will also include 
invited talks, tutorials, panel discussions, a doctoral symposium, and 
project demonstrations, for which separate calls for participation 
will be issued. 

Papers should not exceed 6000 words, with full-page figures counting 
as 300 words.  Papers that exceed the length restriction will not be 
reviewed.  Papers will be reviewed by at least three program committee 
members.  All papers, especially application papers and experience 
reports, should clearly identify their novel contributions.  See 
http://sigart.acm.org/Conferences/ase/SubmissionPointers.html for 
guidelines. 

All papers should be submitted electronically to ase00 [at] ittc [dot] ukans.edu 
in PostScript, MS Word, or PDF format, on or before March 31, 2000. 
In addition, a single hard copy should be mailed to Perry Alexander at 
the address below; it serves as a backup should printing problems 
occur, and it may arrive later than the electronic submission date. 
To expedite the review process, each paper's title, authors, abstract, 
keywords, and contact author's email address should be submitted by 
March 24, 2000 through a link at
http://sigart.acm.org/Conferences/ase/.  
Use the returned paper number to identify your paper when submitting it. 
All subsequent communications will take place via email to the 
contact author. 

General Chair 
Yves Ledru 
IMAG 
Grenoble, France 
Yves.Ledru [at] imag [dot] fr 

Program Co-Chairs 
Perry Alexander 
ITTC / The Univ. of Kansas 
2291 Irving Hill Rd 
Lawrence, KS 66044-7321 
Tel +1 785 864-7741 
palexand [at] ukans [dot] edu 

Pierre Flener 
Dept of Information Science 
Uppsala University, Box 513 
S-751 20 Uppsala, Sweden 
Tel +46 18 471-1028 
Pierre.Flener [at] dis [dot] uu.se 

Program Committee: 

Perry Alexander, USA 
Daniel Berry, Israel 
Yves Deville, Belgium 
Steve Easterbrook, USA 
Wolfgang Emmerich, UK 
Martin Feather, USA 
Steve Fickas, USA 
Bernd Fischer, USA 
Pierre Flener, Sweden 
Alfonso Fuggetta, Italy 
Gerry Gannod, USA 
Michael Goedicke, Germany 
Joseph Goguen, USA 
Ian Green, UK 
John Grundy, New Zealand 
Robert Hall, USA 
Mehdi Harandi, USA 
Mats Heimdahl, USA 
Scott Henninger, USA 
Bernd Kraemer, Germany 
Kung-Kiu Lau, UK 
Baudouin Le Charlier, Belgium 
Yves Ledru, France 
Julio Leite, Brazil 
Mike Lowry, USA 
Tom Maibaum, UK 
Neil Maiden, UK 
Renaud Marlet, France 
Mihhail Matskin, Norway 
Ali Mili, USA 
Bashar Nuseibeh, UK 
Colin O'Halloran, UK 
Charles Pecheur, USA 
John Penix, USA 
Alex Quilici, USA 
David Redmiles, USA 
Arthur Reyes, USA 
Debra Richardson, USA 
Julian Richardson, UK 
Spencer Rugaber, USA 
Conor Ryan, Ireland 
Houari Sahraoui, Canada 
Akiyoshi Sato, Japan 
Dorothy Setliff, Australia 
Frank Shipman, USA 
Doug Smith, USA 
Kurt Stirewalt, USA 
Enn Tyugu, Sweden 
Jeff van Baalen, USA 
Richard Waldinger, USA 
Virginie Wiels, France 
Chris Welty, USA 
David Wile, USA

From owner-reliable_computing [at] interval [dot] usl.edu  Tue Feb 29 08:38:05 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id IAA09403
	for reliable_computing-outgoing; Tue, 29 Feb 2000 08:38:04 -0600 (CST)
Received: from e4.ny.us.ibm.com (e4.ny.us.ibm.com [32.97.182.104])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id IAA09398
	for <reliable_computing [at] interval [dot] usl.edu>; Tue, 29 Feb 2000 08:38:02 -0600 (CST)
From: banavar [at] us [dot] ibm.com
Received: from northrelay02.pok.ibm.com (northrelay02.pok.ibm.com [9.117.200.22])
	by e4.ny.us.ibm.com (8.9.3/8.9.3) with ESMTP id JAA131644;
	Tue, 29 Feb 2000 09:35:53 -0500
Received: from D51MTA03.pok.ibm.com (d51mta03.pok.ibm.com [9.117.200.31])
	by northrelay02.pok.ibm.com (8.8.8m2/NCO v2.06) with SMTP id JAA107038;
	Tue, 29 Feb 2000 09:35:54 -0500
Received: by D51MTA03.pok.ibm.com(Lotus SMTP MTA v4.6.5  (863.2 5-20-1999))  id 85256894.00502050 ; Tue, 29 Feb 2000 09:35:11 -0500
X-Lotus-FromDomain: IBMUS
To: MW2K_Publicity [at] us [dot] ibm.com
Message-ID: <85256894.004FDEA5.00 [at] D51MTA03 [dot] pok.ibm.com>
Date: Tue, 29 Feb 2000 01:02:45 -0500
Subject: Middleware 2000 early registration deadline is March 2nd
Mime-Version: 1.0
Content-type: text/plain; charset=us-ascii
Content-Disposition: inline
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

         Please register by March 2nd and save!
===============================================================

                 CALL FOR PARTICIPATION
                    Middleware 2000
        The International Conference on Distributed Systems
              Platforms and Open Distributed Processing
                     April 4 - 8, 2000
          Hudson Valley (near New York City) USA
         http://www.research.ibm.com/Middleware2000

The advance program is available on our web site. We invite you
to register now to join us for this premier conference in April.

               Sponsored by IFIP TC6 WG6.1 and ACM
           Supported by Agilent Technologies and IBM


CONFERENCE BACKGROUND
---------------------
Middleware 2000 will be the premier conference on
distributed systems platforms and open distributed processing
in the opening year of the new millenium. The conference is
a synthesis of the major conferences and workshops in this
area into a single international event.  Middleware 2000
follows in the footsteps of the extremely successful,
inaugural Middleware '98 Conference held in the Lake District
of the UK in September, 1998.

The focus of Middleware 2000 is on the design, implementation,
deployment and evaluation of distributed systems platforms
and architectures for future networked environments. Of
particular interest is the application of both new and
existing architectures and platforms (such as RM-ODP, CORBA,
RMI and DCOM) in environments which may include public and
private networks, overlayed wired and wireless technologies,
IPv6 and IP multicast, multimedia and real-time information
and an increasing volume of WWW and Java traffic.


SOME CONFERENCE HIGHLIGHTS
--------------------------
Middleware 2000 is a single-track conference consisting
of seven paper sessions, two keynote addresses, and a
work-in-progress session.  There will also be posters
presented during breaks.

1) The seven paper sessions are on Messaging, Caching,
   Reflection, Indirection, Quality of Service, Transactions
   and Workflow, and Composition.

   The details of the paper program is at:
   http://www.research.ibm.com/Middleware2000/Program/program.html

2) We are offering four tutorials by leading practitioners:

   April 4 AM Tutorials:

   T1. "Scalability Issues in CORBA-based Systems"
       Steve Vinoski, IONA Technologies

   T2. "Designing with Patterns"
       John Vlissides, IBM TJ Watson Research Center

   April 4 PM Tutorials:

   T3. "Middleware for Programmable Networks"
       Andrew Campbell, Columbia University

   T4. "Applying Patterns for Concurrent and Distributed Components"
       Frank Buschman, Siemens ZT

   More information on the tutorials is at:
   http://www.research.ibm.com/Middleware2000/Tutorials/tutorials.html

3. We are organizing a workshop on Reflective Middleware (RM2000)
   that will be co-located with Middleware 2000.

   Information on the RM2000 workshop can be found at:
   http://www.comp.lancs.ac.uk/computing/RM2000/

4. We will have two keynote addresses by visionaries in the
   field of middleware: Ken Birman, Professor at Cornell University,
   and Jim Waldo of Sun Microsystems.

5. We will have a work-in-progress paper session and multiple
   poster sessions.

   Information on the WiP papers and posters will be available at:
   http://www.research.ibm.com/Middleware2000


LOCATION AND ACTIVITIES
-----------------------
The conference will be held at the beautiful Hudson River Valley.
The IBM Palisades Conference Center is a state-of-the-art
meeting center on 106 acres of land, just north of New York City.
Check out the URL.
    http://www.research.ibm.com/Middleware2000/Location/location.html

There will be social events as part of this year's conference,
including a Welcome Reception where participants can meet
the organizing team and other participants in an informal setting.
We will also be providing luncheons and dinner to all attendees
on all days of the conference, workshop and tutorials. Information
on these activities will be available on the conference web page.


REGISTRATION
------------
Don't delay and register today for Middleware 2000.  It is THE
conference to attend.  With a great location, on a naturally
rich Hudson Valley near culturally rich Manhattan, you can't
ask for anything more. We look forward to seeing you there.

--------------------------------------------------------------------
Important URL for registration:
   http://www.regmaster.com/midd2000.html

Important Dates for registration:
   On or before March 2, 2000 : Discount on registration fees
   After March 2, 2000 or onsite : Regular registration fees
----------------------------------------------------------------------

--------
Guruduth Banavar
Publicity Chair, Middleware 2000 Conference








From owner-reliable_computing [at] interval [dot] usl.edu  Tue Feb 29 14:19:22 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id OAA10261
	for reliable_computing-outgoing; Tue, 29 Feb 2000 14:19:21 -0600 (CST)
Received: from dragon.relcom.ru (dragon.relcom.ru [193.125.152.57])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id OAA10256
	for <reliable_computing [at] interval [dot] usl.edu>; Tue, 29 Feb 2000 14:19:14 -0600 (CST)
Received: from uucp by dragon.relcom.ru with UUCP 
	id 12Pt7o-000GZq-00 for reliable_computing [at] interval [dot] usl.edu; Tue, 29 Feb 2000 23:20:08 +0300
Received: by DRAGON.relcom.ru (UUMAIL/2.0); Tue, 29 Feb  0 23:20:08 -0300
Received: by Relay1.relcom.ru (UUMAIL/2.0); Tue, 29 Feb  0 23:16:55 +0300
Received: by globlab.msk.su (UUPC/@ v5.09gamma, 14Mar93);
          Tue, 29 Feb 2000 23:14:58 +0300
To: reliable_computing [at] interval [dot] usl.edu
From: "Alexander G. Yakovlev" <yakovlev [at] globlab [dot] msk.su>
Date: Tue, 29 Feb 2000 23:14:57 +0300
Subject: Current information from the RC editorial group
Lines: 96
Message-Id: <E12Pt7o-000GZq-00 [at] dragon [dot] relcom.ru>
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

                                         February 29, 2000
Dear colleagues,

I would  like to  inform you  about  two  changes  concerning  terms and
prices for  purchasing issues  of  the  international  journal  RELIABLE
COMPUTING (before 1995 named INTERVAL COMPUTATIONS).

    1) Beginning on March 1, 2000 prices for back issues (1991-1996) are
lower.  The  main  change  is  for  a  complete set  of back issues  and
supplements: almost three times lower! We hope  that now the back issues
have become  available for  all our  potential readers.  To achieve this
purpose we  also have  established a  special  additional  discount  for
students.
    2) The number of the bank account of our official  representative in
Europe  Prof. Dr. J. Wolff von Gudenberg has been changed. Do not use it
for any purpose! See below for the new number.

     The terms and prices, starting March 1, 2000, are as follows:


FOR INDIVIDUALS (postage included):

Each issue from 1/91 until 4/96      -  $7.00 (or 14.00 DM) per issue
(the issue 1/91 as a set of
xeroxed pages)

Supplementum 1 ("Bibliography of
Works on Interval Computations
Published in Russian", 547 items)    - $10.00 (or 20.00 DM)

The collection of Interval'94
abstracts                            -  $5.00 (or 10.00 DM)

The collection of APIC'95
abstracts                            - $10.00 (or 20.00 DM)

The collection of Interval'96
abstracts                            - $10.00 (or 20.00 DM)

FOR  INSTITUTIONS   (universities,  libraries,   companies,  etc.),  all
indicated prices should be doubled.



A COMPLETE  SET of the back issues and supplements may be purchased with
a discount.  The set  includes  22 issues and 4 supplements.  Prices are
as follows (postage included):

FOR INDIVIDUALS     - $100 (or 200 DM);

FOR INSTITUTIONS    - $200 (or 400 DM);

FOR STUDENTS        -  $70 (or 140 DM).


     All issues  of INTERVAL COMPUTATIONS and RELIABLE COMPUTING as well
as supplements  published before  1997 are  available  for  purchase  by
journal's regional representatives:

Prof. R. Baker Kearfott                Prof. Dr. J. Wolff von Gudenberg
Department of Mathematics              Lehrstuhl f. Informatik II
Univ. of Louisiana at Lafayette        Universitaet Wuerzburg
Box 4-1010 Lafayette                   Am Hubland
LA 70504-1010                          Wuerzburg D-97074
USA                                    Germany
Office: (318) 231-5270                 Phone:  +49-931-888-5517
Home:   (318) 981-9744                 Fax:    +49-931-888-4602
E-mail: rbk [at] usl [dot] edu                    E-mail: wolff [at] informatik [dot] uni-
http://interval.usl.edu/kearfott.html          wuerzburg.de
                                       http://www-info2.informatik.uni-
                                       wuerzburg.de/staff/wvg

Please make a check to            Instructions for bank transfer:
the "University of                holder:     J. Wolff v. Gudenberg
Louisiana at Lafayette"           number:     560218901
                                  keyword:    Reliable Computing
                                  bank:       Kreissparkasse Wuerzburg
                                  bank code:  790 501 30


For  purchasing  issues  1997-1999   please   contact   Kluwer  Academic
Publishers, Order  Department (details  see at  the  Kluwer's  Web-site:
http://www.wkap.nl).

For subscribing  for 2000  please contact  Kluwer  Academic  Publishers,
Order  Department, too.  You  can  also subscribe to the journal via the
Internet: http://www.wkap.nl/journalhome.htm/1385-3139.  Besides,  using
this service  you can  order a  free sample  copy of  the journal,  find
complete tables of contents of the journal and other useful information.


Sincerely yours,

Alexander Yakovlev,
Managing Editor


From owner-reliable_computing [at] interval [dot] usl.edu  Wed Mar  1 07:48:24 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id HAA12466
	for reliable_computing-outgoing; Wed, 1 Mar 2000 07:48:24 -0600 (CST)
Received: from mscs.mu.edu (studsys.mscs.mu.edu [134.48.4.15])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with SMTP id HAA12460
	for <reliable_computing [at] interval [dot] usl.edu>; Wed, 1 Mar 2000 07:48:19 -0600 (CST)
Received: (qmail 20001 invoked from network); 1 Mar 2000 13:45:54 -0000
Received: from ppp101.csd.mu.edu (HELO mscs.mu.edu) (134.48.24.1)
  by studsys.mscs.mu.edu with SMTP; 1 Mar 2000 13:45:54 -0000
Message-ID: <38BD1F6C.9F24BDB3 [at] mscs [dot] mu.edu>
Date: Wed, 01 Mar 2000 07:47:24 -0600
From: George Corliss <georgec [at] mscs [dot] mu.edu>
Organization: Marquette University
X-Mailer: Mozilla 4.7 [en] (Win98; U)
X-Accept-Language: en
MIME-Version: 1.0
To: reliable_computing [at] interval [dot] usl.edu
CC: anupama.govindarajan [at] tatainfotech [dot] com, Xin Feng <FengX [at] Marquette [dot] edu>
Subject: Training Neural Network with back propagation
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Forwarded from ANUPAMA V.GOVINDARAJAN:
> 
> Dear Professor Corliss,
> 
> I am working on an Artificial Intelligence related experiment dealing with
> pattern recognition in Uncertainity. We plan to train a Neural network
> (using backpropagation algorithm) to recognize inputs with missing data.
> We would like to use interval arithmetic to represent the uncertainity and
> train the network
> 
> I would like to find information on  modifying the backpropagation
> algorithm to include > intervals instead of crisp inputs during the 
> training phase
> 
> Also I would be grateful if you could put me in touch with Dr Xin Feng and
> Dr Richard Kelnhoffer - Marquette Dept of Electrical and Computer
> Engineering who are using interval arithmetic in Artificial Neural
> Networks
> 
> Thank You,
> Anupama
> 
> ----
> Anupama Govindarajan
> Associate Systems Engineer - Expert Systems
> Applied Technology Group
> Tata Infotech Ltd
> SDF 5, Seepz, Andheri(E), Mumbai - 400096
> India
> 
> ph: +91-22-8291317/ 8291320 Ext 645
> email: anupama.govindarajan [at] tatainfotech [dot] com
>        anupama.g [at] ieee [dot] org

-- 
Dr. George F. Corliss
Dept. Math, Stat, Comp Sci
Marquette University
P.O. Box 1881
Milwaukee, WI  53201-1881  USA
georgec [at] mscs [dot] mu.edu; George.Corliss [at] Marquette [dot] edu
http://www.mscs.mu.edu/~georgec/
Office: 414-288-6599;  Dept: 288-7375; Fax: 288-5472

From owner-reliable_computing [at] interval [dot] usl.edu  Wed Mar  1 10:00:58 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA12888
	for reliable_computing-outgoing; Wed, 1 Mar 2000 10:00:58 -0600 (CST)
Received: from happy.dt.uh.edu (happy.dt.uh.edu [129.7.174.25])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with SMTP id KAA12883
	for <reliable_computing [at] interval [dot] usl.edu>; Wed, 1 Mar 2000 10:00:52 -0600 (CST)
Received: by happy.dt.uh.edu (950413.SGI.8.6.12/940406.SGI.AUTO)
	 id JAA28863; Wed, 1 Mar 2000 09:34:11 -0800
From: "Chenyi Hu" <hu [at] happy [dot] dt.uh.edu>
Message-Id: <10003010934.ZM28861 [at] happy [dot] dt.uh.edu>
Date: Wed, 1 Mar 2000 09:34:10 -0800
In-Reply-To: George Corliss <georgec [at] mscs [dot] mu.edu>
        "Training Neural Network with back propagation" (Mar  1,  7:47am)
References: <38BD1F6C.9F24BDB3 [at] mscs [dot] mu.edu>
X-Mailer: Z-Mail (3.2.3 08feb96 MediaMail)
To: reliable_computing [at] interval [dot] usl.edu
Subject: Re: Training Neural Network with back propagation
Cc: Xin Feng <FengX [at] Marquette [dot] edu>, anupama.govindarajan [at] tatainfotech [dot] com
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Our paper "On Interval Weighted Three-layer Neural
Networks" could be a reference. You may find it in
the Proceedings of the 31 Annual Simulation Symposium,
pp. 188-194, IEEE Computer Society Press, 1998.

It is also available at the URL:
http://happy.dt.uh.edu/~hu/Papers/IEEESimu98.ps

Chenyi HU


On Mar 1,  7:47am, George Corliss wrote:
> Subject: Training Neural Network with back propagation
> Forwarded from ANUPAMA V.GOVINDARAJAN:
> >
> > Dear Professor Corliss,
> >
> > I am working on an Artificial Intelligence related experiment dealing with
> > pattern recognition in Uncertainity. We plan to train a Neural network
> > (using backpropagation algorithm) to recognize inputs with missing data.
> > We would like to use interval arithmetic to represent the uncertainity and
> > train the network
> >
> > I would like to find information on  modifying the backpropagation
> > algorithm to include > intervals instead of crisp inputs during the
> > training phase
> >
> > Also I would be grateful if you could put me in touch with Dr Xin Feng and
> > Dr Richard Kelnhoffer - Marquette Dept of Electrical and Computer
> > Engineering who are using interval arithmetic in Artificial Neural
> > Networks
> >
> > Thank You,
> > Anupama
> >
> > ----
> > Anupama Govindarajan
> > Associate Systems Engineer - Expert Systems
> > Applied Technology Group
> > Tata Infotech Ltd
> > SDF 5, Seepz, Andheri(E), Mumbai - 400096
> > India
> >
> > ph: +91-22-8291317/ 8291320 Ext 645
> > email: anupama.govindarajan [at] tatainfotech [dot] com
> >        anupama.g [at] ieee [dot] org
>
> --
> Dr. George F. Corliss
> Dept. Math, Stat, Comp Sci
> Marquette University
> P.O. Box 1881
> Milwaukee, WI  53201-1881  USA
> georgec [at] mscs [dot] mu.edu; George.Corliss [at] Marquette [dot] edu
> http://www.mscs.mu.edu/~georgec/
> Office: 414-288-6599;  Dept: 288-7375; Fax: 288-5472
>-- End of excerpt from George Corliss



-- 
Ph.D.,  Associate Professor, Computer and Mathematical Sciences

Center for Computational Science and Advanced Distributed Simulation 
University of Houston-Downtown		        Phone:  713 221-8414	 
One Main Street		 		        Fax:    713 221-8086	
Houston, Texas 77002			        E-mail: CHu [at] uh [dot] edu 

http://happy.dt.uh.edu/~hu/Hu.html
  

From owner-reliable_computing [at] interval [dot] usl.edu  Fri Mar  3 12:30:57 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id MAA17657
	for reliable_computing-outgoing; Fri, 3 Mar 2000 12:30:57 -0600 (CST)
Received: from lua.dimap.ufrn.br (IDENT:root [at] lua [dot] dimap.ufrn.br [200.19.160.19])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id MAA17652
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 3 Mar 2000 12:30:42 -0600 (CST)
Received: from dimap.ufrn.br (baltazar.dimap.ufrn.br [10.9.96.16])
	by lua.dimap.ufrn.br (8.9.1a/8.9.2) with ESMTP id PAA02204
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 3 Mar 2000 15:35:09 -0300
Received: from localhost (regivan@localhost)
	by dimap.ufrn.br (8.9.1/8.9.2) with SMTP id PAA03744
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 3 Mar 2000 15:17:56 -0300 (EST)
Date: Fri, 3 Mar 2000 15:17:56 -0300 (EST)
From: Regivan Hugo Nunes Santiago <regivan [at] dimap [dot] ufrn.br>
X-Sender: regivan@baltazar
To: reliable_computing [at] interval [dot] usl.edu
Subject: Scan 2000 and INTERVAL'2000
Message-ID: <Pine.GSO.3.96.1000303151434.3575A-100000@baltazar>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


	Dear Intervalers, I did not found the format of submissions
of abstracts for Scan 2000 and Interval'2000 is it free? or does it have
any limit of pages, format, etc.


						Regards
						Regivan


From owner-reliable_computing [at] interval [dot] usl.edu  Sat Mar  4 15:57:32 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id PAA20087
	for reliable_computing-outgoing; Sat, 4 Mar 2000 15:57:32 -0600 (CST)
Received: from cse.unl.edu (root [at] cse [dot] unl.edu [129.93.33.1])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id PAA20082
	for <reliable_computing [at] interval [dot] usl.edu>; Sat, 4 Mar 2000 15:57:29 -0600 (CST)
Received: from localhost (fayad@localhost)
	by cse.unl.edu (8.9.1/8.9.1) with ESMTP id PAA1075747;
	Sat, 4 Mar 2000 15:40:14 -0600 (CST)
Date: Sat, 4 Mar 2000 15:40:14 -0600
From: Mohamed Fayad <fayad [at] cse [dot] unl.edu>
To: Undisclosed recipients: ;
Subject: Enterprise Frameworks - CFPs  
Message-ID: <Pine.SGI.4.05.10003041538530.950526-100000 [at] cse [dot] unl.edu>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; CHARSET=US-ASCII
Content-ID: <Pine.SGI.4.05.10003022302302.683368 [at] cse [dot] unl.edu>
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk



Dear Colleagues,

You will be doing us a great favor if you disseminate the content of this
Call for Papers  among your interested colleagues.  Please accept our
apologies if you receive multiple copies of this announcement.

Cheers,

M. E. Fayad

---------------------------------------------------------------------
***       Papers submission deadline for the theme issue          ***
***             >>>>>     August 1, 2000     <<<<<                ***
---------------------------------------------------------------------

Software Practice & Experience Journal - Theme Issue
Call for Articles and Reviewers on
Enterprise Frameworks 

Editors:

Dr. Mohamed Fayad -- fayad [at] cse [dot] unl.edu, m.fayad [at] computer [dot] org, fayadm [at] acm [dot] org

David S. Hamu -- dhamu [at] ix [dot] netcom.com, dhamu [at] acm [dot] org

Davide Brugali -- brugali [at] polito [dot] it, dbrugali [at] acm [dot] org

Software Practice & Experience Journal seeks articles and reviewers for
this theme issue, scheduled for publication in March 2001. For more
journal information, check the following 

      link: http://www.interscience.wiley.com/jpages/0038-0644

 
An Object-Oriented Enterprise Framework (Enterprise Framework for short)
is a software architecture exposing a rich set of semantics and modeling
paradigms for developing and extending enterprise applications.
Enterprise frameworks are, by design, the cornerstone of an organization's  
systems engineering activities. Enterprise frameworks offer a streamlined and 
flexible alternative to traditional tools and applications, which feature
numerous point solutions integrated into complex and often inflexible
environments.  Enterprise Frameworks play an important role since they
allow reuse of design knowledge and offer techniques for creating 
reference models and scalable architectures for enterprise integration.
These models and architectures are sufficiently flexible and powerful to
be used at multiple levels, e.g. from the integration of the supply chain
of a multi-national corporation, to the construction of a global virtual
factory, and down to the monitoring and control system for a 
single production cell.

These frameworks implement and enforce well-documented standards for
component integration and collaboration.   The architecture of an
Enterprise framework provides for ready integration with new or existing
components. It defines how these components must interact with the
framework and how objects collaborate.   In addition, it defines how
developers work together to build and extend enterprise applications
based on the framework.  Therefore, the goal of an Enterprise framework
is to reduce complexity and lifecycle costs of enterprise systems, 
while ensuring flexibility. 

The theme issue is designed to help organizations effectively develop or
adapt enterprise framework technology in the real world.  As such, we are
seeking submissions which provide a treatment of:
	+ Comprehensive technical and management guidelines: ranging from
	  specifying enterprise framework structures and behaviors, to
	  cost estimation and selecting the right enterprise framework
	  and tools for the job.
	+ Technical issues such as documenting frameworks and how to
	  utilize enterprise frameworks.  
	+ Real world issues such as keeping your expensive framework
	  up-to-date, ferreting out hidden costs, grappling with the
	  problems of frameworks, and providing insight into successful
	  development or adaptation of OO Enterprise Frameworks.
	+ Limitations such as maintaining frameworks and adding value to
	  your business.

Submissions will be presented in a practical, easy to understand manner.
This is information that readers can apply today.  We seek original
articles on specific issues related to enterprise frameworks that might
be addressed include (but are not limited to):
1. What are the key enterprise-oriented framework issues?
2. How to develop enterprise frameworks and what are the framework design
   guidelines?
3. What kind of evolution does an Enterprise Framework undergo and how is
   it correlated with the enterprise life span?
4. How can the adaptation of OO enterprise framework be accomplished with
   minimum impact on the cost and schedule?
5. Understand make vs. buy decisions, selection guidelines, and how to
   select and adapt the right enterprise framework for the job.
6. Understand the implication of enterprise business requirements on the
   framework design.
7. How to use your large-scale enterprise framework and how to protect
   your investment.
8. How to deal with resource requirements, enterprise framework
   integration problems, framework reporting, and others.
9. What are the impacts of enterprise frameworks on the national and
   global economy?

Reviewers: Please e-mail your contact information and your area of
interests to the lead editor.

Authors: Please submit one electronic copy in RTF interchange or
Microsoft Word document formats by August 1, 2000 to the lead guest editor:

Dr. Mohamed E. Fayad
J.D. Edwards Professor
Computer Science & Engineering Dept., University of Nebraska, Lincoln
108 Ferguson Hall, P.O. Box 880115, Lincoln, NE 68588-0115
Ph: (402) 472-2615, Fax: (402) 472-7767
E-mail: fayad [at] cse [dot] unl.edu, m.fayad [at] computer [dot] org, fayadm [at] acm [dot] org 
URL: http://www.cse.unl.edu/~fayad	

Articles may be of any length, ranging from a few pages (2-3 pages or
1,200 words) to a full treatment of a substantial software system or an
enterprise framework (say 40 pages or 25,000 words), including
illustrations.  Submissions are peer-reviewed and are subject to editing for 
style, clarity, and space.

For detailed author guidelines, check the following web site:

http://www.interscience.wiley.com/jpages/0038-0644/authors.html

or 
	
www.cse.unl.edu/~fayad	Theme Issues


From owner-reliable_computing [at] interval [dot] usl.edu  Mon Mar  6 05:00:53 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id FAA23706
	for reliable_computing-outgoing; Mon, 6 Mar 2000 05:00:53 -0600 (CST)
Received: from iamk4510.mathematik.uni-karlsruhe.de (root [at] iamk4510 [dot] mathematik.uni-karlsruhe.de [129.13.129.10])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id FAA23701
	for <reliable_computing [at] interval [dot] usl.edu>; Mon, 6 Mar 2000 05:00:49 -0600 (CST)
Received: from math.uni-karlsruhe.de (axel@localhost [127.0.0.1])
	by iamk4510.mathematik.uni-karlsruhe.de (8.9.3/8.9.3) with ESMTP id MAA24596;
	Mon, 6 Mar 2000 12:00:40 +0100
Message-ID: <38C38FD8.21D7876A [at] math [dot] uni-karlsruhe.de>
Date: Mon, 06 Mar 2000 12:00:40 +0100
From: Axel Facius <axel.facius [at] math [dot] uni-karlsruhe.de>
X-Mailer: Mozilla 4.61 [en] (X11; I; Linux 2.2.10 i686)
X-Accept-Language: en
MIME-Version: 1.0
To: reliable_computing [at] interval [dot] usl.edu
CC: Regivan Hugo Nunes Santiago <regivan [at] dimap [dot] ufrn.br>
Subject: Re: Scan 2000 and INTERVAL'2000
References: <Pine.GSO.3.96.1000303151434.3575A-100000@baltazar>
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Regivan Hugo Nunes Santiago wrote:
> 
>         Dear Intervalers, I did not found the format of submissions
> of abstracts for Scan 2000 and Interval'2000 is it free? or does it have
> any limit of pages, format, etc.
> 
>                                                 Regards
>                                                 Regivan

Actually, there is not yet a format for submissions specified on our web pages.
We are currently working on the second announcement which will also
contain information about this topic. There will be a limit of 120 words
for the abstract and we are going to provide a TeX-macro for this purpose.
I will post the 'Second Announcement' for the scan2000 and INTERVAL 2000
to all interested people and also send a electronic version to this
mailing list (containing the download address for the TeX-Macro)

I hope to see you in Karlsruhe

       Axel Facius
   (scan2000 OrgaTeam)

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

For all of you hearing about scan 2000 and INTERVAL 2000 for the first
time, please have a look at http:www//scan2000.de or send an email to
mailto:info [at] scan2000 [dot] de.

From owner-reliable_computing [at] interval [dot] usl.edu  Mon Mar  6 11:50:23 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id LAA24324
	for reliable_computing-outgoing; Mon, 6 Mar 2000 11:50:23 -0600 (CST)
Received: from mail.cs.tu-berlin.de (root [at] mail [dot] cs.tu-berlin.de [130.149.17.13])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id LAA24319
	for <reliable_computing [at] interval [dot] usl.edu>; Mon, 6 Mar 2000 11:50:19 -0600 (CST)
Received: from niemand.cs.tu-berlin.de (niemand.cs.tu-berlin.de [130.149.19.34])
	by mail.cs.tu-berlin.de (8.9.3/8.9.3) with ESMTP id SAA17638
	for <reliable_computing [at] interval [dot] usl.edu>; Mon, 6 Mar 2000 18:40:59 +0100 (MET)
Received: (from doris@localhost)
	by niemand.cs.tu-berlin.de (8.9.3/8.9.3) id SAA03782
	for reliable_computing [at] interval [dot] usl.edu; Mon, 6 Mar 2000 18:40:28 +0100 (MET)
Date: Mon, 6 Mar 2000 18:40:28 +0100
From: Doris Faehndrich <doris [at] cs [dot] tu-berlin.de>
To: reliable_computing [at] interval [dot] usl.edu
Subject: ETAPS 2000 - 2nd Call for Participation
Message-ID: <20000306184027.A3779 [at] niemand [dot] cs.tu-berlin.de>
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
X-Mailer: Mutt 1.0i
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

(Sorry, if you receive multiple copies of this Call.
                                       Doris Faehndrich)
------------------------------------------------------------------
ETAPS 2000 - EUROPEAN JOINT CONFERENCES ON
                       THEORY AND PRACTICE OF SOFTWARE

      Technical University of Berlin, March 25 - April 2, 2000

-------- CALL FOR PARTICIPATION ----- REMINDER -------------------

Welcome to Berlin, welcome to ETAPS, the European Joint Conferences on 
Theory and Practice of Software, the European forum for academic and 
industrial researchers working on these topics!  

For 9 days you will be able to choose between 
5 conferences -TACAS 2000, FOSSACS 2000, FASE 2000, ESOP 2000, 
    CC 2000 - with more than 120 regular papers and tool 
    demonstrations  covering a wide range of topics from theory 
    and practice,  
7 invited lectures by Abbas Edalat, David Harel, Martin Odersky, 
    Richard M. Soley, Wlayslaw M. Turski, Reinhard Wilhelm, Pierre
    Wolper, 
5 satellite events - GRATRA 2000, CMCS 2000, CBS 2000, INT 2000,
    CoFi 2000 -,
10 tutorials - XML for Software Engineers, A tutorial on Maude,
    Rigorous Requirements for Safety-Critical Systems: Fundamentals 
    and Applications of the SCR Method, Multi-Paradigm Programming,
    Query-based Automated Debugging, The Unified Modelling Language,
    Swinging Types, Tables and computation, SDL 2000, Software 
    Metrology Basis -
    (We reserve the right to cancel a tutorial owing to unsufficient 
     participation.)

We are pleased that so many people will be attending ETAPS 2000. 
For those who still haven't registered, we are extending

           EARLY REGISTRATION DATE UNTIL 15th MARCH!
 
--------------------------------------------------------------------
Please, check  for details
      http://iks.cs.tu-berlin.de/etaps2000/

Use the option of online registration or one of the downloadable
                 registration forms!

Registration Address: BWO Marketing Service GmbH
                      Mohrenstr. 63-64
                      D-10117 Berlin-Mitte
                      Germany
                      Fax: ++49 30 22 66 84-64
                      Email: Etaps2000@BWO-Berlin.de

Conference Mail Address: etaps2000 [at] iks [dot] cs.tu-berlin.de
--------------------------------------------------------------------
Doris Faehndrich: TU Berlin FB-13 Sekr. FR 5-6, Franklinstr. 28/29,
                10587 Berlin, Tel: 030/31473436
--------------------------------------------------------------------

From owner-reliable_computing [at] interval [dot] usl.edu  Tue Mar  7 17:44:01 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id RAA26633
	for reliable_computing-outgoing; Tue, 7 Mar 2000 17:44:01 -0600 (CST)
Received: from genie.eecs.lehigh.edu (genie.eecs.lehigh.edu [128.180.98.9])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id RAA26628
	for <reliable_computing [at] interval [dot] usl.edu>; Tue, 7 Mar 2000 17:43:58 -0600 (CST)
Received: from olympus.eecs.lehigh.edu (olympus [128.180.98.182])
	by genie.eecs.lehigh.edu (8.8.5/8.8.5) with ESMTP id NAA09257;
	Tue, 7 Mar 2000 13:33:54 -0500 (EST)
From: ASAP User <asap [at] EECS [dot] Lehigh.EDU>
Received: (from asap@localhost)
	by olympus.eecs.lehigh.edu (8.8.5/8.8.5) id NAA16377;
	Tue, 7 Mar 2000 13:33:53 -0500 (EST)
Date: Tue, 7 Mar 2000 13:33:53 -0500 (EST)
Message-Id: <200003071833.NAA16377 [at] olympus [dot] eecs.lehigh.edu>
To: asap-announce [at] EECS [dot] Lehigh.EDU
Subject: ASAP 2000 Call for Papers
Cc: asap [at] EECS [dot] Lehigh.EDU
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear colleagues, 

This is a reminder that the deadline for paper submissions to ASAP 2000 has 
been extended to next Monday March 13, 2000. You can submit your paper and 
cover page via email to asap [at] eecs [dot] lehigh.edu any time between now and 
March 13, 2000. The revised call for papers is given below. 

If you have any questions about the conference or paper submissions, please 
send email to asap [at] eecs [dot] lehigh.edu or mschulte [at] eecs [dot] lehigh.edu. 

We apologize if you receive multiple copies of this email. 

Best regards, 

Mike Schulte

++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
                          ASAP 2000 CALL FOR PAPERS
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
            12th International Conference on Application-specific
                     Systems, Architectures and Processors
    			   Boston, Massachusetts

Revised Dates and Deadlines
  Submission:                 March 13, 2000
  Acceptance notification:    April 13,  2000
  Conference:                 July 10-12, 2000

Topics:
  The conference will cover the theory and practice of application- 
  specific computing systems. Of particular interest are contributions
  that either achieve large performance gains, present formal methods for 
  the specification, design and evaluation, analyze technology dependencies 
  and the integration of hardware and software components, or describe and 
  evaluate fabricated systems.

  Areas for application-specific computing systems are many and varied. 
  Some sample areas include information systems, signal and image processing, 
  multimedia systems, high-speed networks, compression, cryptography. 

  Aspects of application-specific computing systems that are of interest 
  include, but are not limited to:
  * Application-specific architectures:
    special purpose designs, design methodology, CAD tools, fault 
    tolerance strategies, specification and interfaces, hardware/software
    codesign
  * Application-specific processors:
    digital signal processing, computer arithmetic, configurable/custom 
    computing, implementation methodology & rapid prototyping, new 
    technologies, fine-grain parallelism
  * Application-specific systems:
    network computing, special-purpose systems for exotic applications, 
    performance evaluation, standard software objects, languages, 
    compilers, operating systems, hardware/software integration

  The conference will feature a keynote speech, paper presentations, and
  a poster session. The proceedings will be published by IEEE Computer 
  Society Press.

Information for authors:

  Your paper should be a maximum of 5000 words. A PDF version of the
  complete paper and a separate cover page text file, with the following
  information 

  * paper title; 
  * paper abstract; 
  * complete name, address, telephone, fax and email of each author; 
  * author which is responsible for correspondence; 
  * which of the conference areas is most relevant to your paper

  should be submitted via email to asap [at] eecs [dot] lehigh.edu. For further 
  information about the conference, please see the conference 
  web page at http://www.eecs.lehigh.edu/ASAP or send email to
  asap [at] eecs [dot] lehigh.edu.

General Chair:  	Earl Swartzlander e.swartzlander [at] compmail [dot] com
Program Chairs: 	Graham Jullien    jullien [at] uwindsor [dot] ca
			Michael Schulte   mschulte [at] eecs [dot] lehigh.edu

Program committee:

  Magdy Bayoumi, Shuvra Bhattacharyya, Wayne Burleson, Peter Cappello, 
  Liang-Gee Chen, Ed Deprettere, Milos Ercegovac, Gerhard Fettweis, 
  Jose Fortes, Sayfe Kiaei, Israel Koren, S. Y. Kung, Tomas Lang, 
  Wayne Luk, John McCanny, Jean-Michel Muller, Takao Nishitani, Tobias Noll, 
  Peter Pirsch, Patrice Quinton, Sanjay Rajopadhye, Vwani Roychowdhury, 
  Valerie Taylor, Juergen Teich, Lothar Thiele, Mateo Valero, Benjamin Wah, 
  Doran Wilde, Roger Woods, Kung Yao, Pen Yew.

From owner-reliable_computing [at] interval [dot] usl.edu  Tue Mar  7 22:37:59 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id WAA27134
	for reliable_computing-outgoing; Tue, 7 Mar 2000 22:37:59 -0600 (CST)
Received: from genie.eecs.lehigh.edu (genie.eecs.lehigh.edu [128.180.98.9])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id WAA27129
	for <reliable_computing [at] interval [dot] usl.edu>; Tue, 7 Mar 2000 22:37:50 -0600 (CST)
Received: from pandora.newcastle.edu.au (dmk [at] pandora [dot] newcastle.edu.au [134.148.100.234])
	by genie.eecs.lehigh.edu (8.8.5/8.8.5) with ESMTP id SAA13557;
	Tue, 7 Mar 2000 18:37:30 -0500 (EST)
Received: (from dmk@localhost) by pandora.newcastle.edu.au (8.9.1a/8.6.9) id KAA18155; Wed, 8 Mar 2000 10:37:12 +1100 (EST)
Date: Wed, 8 Mar 2000 10:37:12 +1100 (EST)
From: David Koch <dmk [at] engmail [dot] newcastle.edu.au>
Message-Id: <200003072337.KAA18155 [at] pandora [dot] newcastle.edu.au>
To: asap-announce [at] EECS [dot] Lehigh.EDU, asap [at] EECS [dot] Lehigh.EDU
Cc: dmk [at] pandora [dot] newcastle.edu.au
Subject: Pls remove aspray [at] faceng [dot] newcastle.edu.au
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


Please remove aspray [at] faceng [dot] newcastle.edu.au from your
mailing lists.  He left several years ago.

David Koch                          Manager - Computer Systems Group
                                    Faculty of Engineering
                                    University of Newcastle NSW  2291
                                    Australia
                                    Tel: +61 2 4921 5292
                                    Fax: +61 2 4921 6929
                                    Email: dmk [at] cs [dot] newcastle.edu.au

From owner-reliable_computing [at] interval [dot] usl.edu  Wed Mar  8 06:15:13 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id GAA28585
	for reliable_computing-outgoing; Wed, 8 Mar 2000 06:15:13 -0600 (CST)
Received: from genie.eecs.lehigh.edu (genie.eecs.lehigh.edu [128.180.98.9])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id GAA28580
	for <reliable_computing [at] interval [dot] usl.edu>; Wed, 8 Mar 2000 06:15:09 -0600 (CST)
Received: from yogi.urz.unibas.ch (yogi.urz.unibas.ch [131.152.1.4])
	by genie.eecs.lehigh.edu (8.8.5/8.8.5) with ESMTP id CAA18630;
	Wed, 8 Mar 2000 02:20:56 -0500 (EST)
Received: from unibas.ch ([131.152.31.44])
 by ubaclu.unibas.ch (PMDF V5.2-29 #33343)
 with ESMTP id <01JMS7UHO6JU8Y4K00 [at] ubaclu [dot] unibas.ch>; Wed,
 8 Mar 2000 08:19:31 +0100
Date: Wed, 08 Mar 2000 08:21:15 +0100
From: Birgit Westermann <Birgit.Westermann [at] unibas [dot] ch>
Subject: Remove from mailing list
To: ASAP User <asap [at] EECS [dot] Lehigh.EDU>
Cc: asap-announce [at] EECS [dot] Lehigh.EDU
Message-id: <38C5FF6B.EAFF4A01 [at] unibas [dot] ch>
MIME-version: 1.0
X-Mailer: Mozilla 4.61 [en] (WinNT; I)
Content-type: text/plain; charset=us-ascii
Content-transfer-encoding: 7bit
X-Accept-Language: en
References: <200003071833.NAA16377 [at] olympus [dot] eecs.lehigh.edu>
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Please remove birgit [at] ifi [dot] unibas.ch from your
mailing lists.

Birgit Westermann


From owner-reliable_computing [at] interval [dot] usl.edu  Wed Mar  8 06:46:41 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id GAA28942
	for reliable_computing-outgoing; Wed, 8 Mar 2000 06:46:41 -0600 (CST)
Received: from genie.eecs.lehigh.edu (genie.eecs.lehigh.edu [128.180.98.9])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id GAA28937
	for <reliable_computing [at] interval [dot] usl.edu>; Wed, 8 Mar 2000 06:46:30 -0600 (CST)
Received: from mailgate.rz.uni-karlsruhe.de (exim [at] mailgate [dot] rz.uni-karlsruhe.de [129.13.64.97])
	by genie.eecs.lehigh.edu (8.8.5/8.8.5) with ESMTP id CAA18821
	for <asap-announce [at] eecs [dot] lehigh.edu>; Wed, 8 Mar 2000 02:46:41 -0500 (EST)
Received: from rhrk.uni-kl.de (isdn216-56.rz.uni-karlsruhe.de [129.13.216.56])
	by mailgate.rz.uni-karlsruhe.de with esmtp (Exim 3.02 #2)
	id 12Sb8j-0003S6-00; Wed, 08 Mar 2000 08:44:17 +0100
Message-ID: <38C603E3.B3D91D1 [at] rhrk [dot] uni-kl.de>
Date: Wed, 08 Mar 2000 08:40:19 +0100
From: Reiner Hartenstein <hartenst [at] rhrk [dot] uni-kl.de>
Reply-To: hartenst [at] rhrk [dot] uni-kl.de
Organization: University of Kaiserslautern
X-Mailer: Mozilla 4.5 [en] (Win95; I)
X-Accept-Language: en,de-DE
MIME-Version: 1.0
To: Diessel <Oliver.Diessel [at] unisa [dot] edu.au>, Yang <lyang [at] stfx [dot] ca>,
        Postula <adam [at] csee [dot] uq.edu.au>, Lisper <bjorn.lisper [at] mdh [dot] se>,
        Vernalde <vernalde [at] imec [dot] be>, becker <becker [at] mes [dot] tu-darmstadt.de>,
        kurdahi <kurdahi [at] ece [dot] uci.edu>, wnajjar <wnajjar [at] ece [dot] uci.edu>,
        latifi <latifi [at] ee [dot] unlv.edu>, gaudiot <gaudiot [at] usc [dot] edu>,
        wl <wl [at] doc [dot] ic.ac.uk>,
        "catherine.dezan" <catherine.dezan@univ-brest.fr>,
        Brebner <gordon [at] dcs [dot] edinburgh.ac.uk>, lombardi <lombardi [at] cs [dot] tamu.edu>,
        bohm <bohm [at] cs [dot] colostate.edu>,
        asap-announce <asap-announce [at] EECS [dot] Lehigh.EDU>,
        Liste BM-List1 <BM-List1 [at] cs [dot] ucdavis.edu>
Subject: REMINDER: 2nd Call for Papers -- deadline is near
Content-Type: multipart/alternative;
 boundary="------------489B063A501673270C951C21"
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


--------------489B063A501673270C951C21
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit






please, excuse multiple copies
please, distribute



                     2nd Call for Papers


                           FPL 2000


                The 10th International Conference on
            Field Programmable Logic and Applications


                      28 - 30 August 2000
                       Villach, Austria


             >>>  Paper deadline: 17 March 2000  <<<



Growing Conference (growth 1999: 55%)   -   Extended Scope
Prominent Professional Keynote Speakers

Future SoC - System on a Chip: impossible without Reconfigurable
Subsystems

The conference proceedings will be published by Springer Verlag
See:   http://link.springer.de/series/lncs/

Topics to be covered include, but are not limited to:

   Reconfigurable Hardware and Systems:
     Fine grain - Coarse grain - Reconfigurable Computing
     Adaptive  -  Customizable  -  Embedded  -  fault-tolerant
     Architectures  -  Technologies  -  Low Power  -  Dynamically Rec.

   Applications:
     Routing  -   Networking  -  Wireless  -  Evolvable
     Real-world  -  Scientific  -  Rapid-prototyping  -  Others

   CAD, Compilation, Testing and Verification:
     Design Flow  -  Tools  -  Higher Level Synthesis
     Interconnect  -  Parameter Estimation  -  Benchmarks
     Testing and Verification of Dynamically Reconfigurable Apps

   Surveys, Tutorials, Future, History, and Education:
     Roadmaps to Technology, Application and Design
     Teaching Reconfigurables & Evolvables  -  Curricular Impact
     Student Projects  -  Industry / University Programs  - Publicity

   Evolvable Hardware and Evolutionary Compilation Methods:
     Evolvable Hardware (EH) -  Co-Evolution
     Tools and methodologies  -  Genetic Programming

   Emerging and Other RL/RC-related Methodologies:
     State machines -  Cellular Automata
     Biologically inspired - Brain inspired
     fludic reconfigurable logic and applications
     Molecular Biology Applications

For details on topic areas and conference location see:
http://xputers.informatik.uni-kl.de/FPL/FPL2000/detailed_fpl.html

Authors are invited to submit PDF of their paper (10 pages maximum)
by date March 17, 2000 via E-mail to mailto:hartenst [at] rhrk [dot] uni-kl.de
                                and: mailto:hoffmant [at] rhrk [dot] uni-kl.de
For guidelines see    http://www.springer.de/comp/lncs/authors.html
Questions please, address to:      mailto:hoffmant [at] rhrk [dot] uni-kl.de

Download Call for Papers and Registration Form:  PLEASE, DISTRIBUTE :
PDF: http://xputers.informatik.uni-kl.de/FPL/fpl2000/CfP_FPL2000.pdf
ps:  http://xputers.informatik.uni-kl.de/FPL/fpl2000/CfP_FPL2000.ps

Reiner Hartenstein
Program Chair FPL-2000

--------------489B063A501673270C951C21
Content-Type: text/html; charset=us-ascii
Content-Transfer-Encoding: 7bit

<!doctype html public "-//w3c//dtd html 4.0 transitional//en">
<html>
&nbsp;
<br>&nbsp;
<br>&nbsp;
<br>&nbsp;
<p><tt>please, excuse multiple copies</tt>
<br><tt>please, distribute</tt>
<br>&nbsp;
<br>&nbsp;
<p><tt>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;
2nd Call for Papers</tt>
<br>&nbsp;
<p><tt>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;
FPL 2000</tt>
<br>&nbsp;
<p><tt>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;
The 10th International Conference on</tt>
<br><tt>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;
Field Programmable Logic and Applications</tt>
<br>&nbsp;
<p><tt>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;
28 - 30 August 2000</tt>
<br><tt>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;
Villach, Austria</tt>
<br>&nbsp;
<p><tt>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;
>>>&nbsp; Paper deadline: 17 March 2000&nbsp; &lt;&lt;&lt;</tt>
<br>&nbsp;
<br>&nbsp;
<p><tt>Growing Conference (growth 1999: 55%)&nbsp;&nbsp; -&nbsp;&nbsp;
Extended Scope</tt>
<br><tt>Prominent Professional Keynote Speakers</tt>
<p><tt>Future SoC - System on a Chip: impossible without Reconfigurable</tt>
<br><tt>Subsystems</tt>
<p><tt>The conference proceedings will be published by Springer Verlag</tt>
<br><tt>See:&nbsp;&nbsp; <a href="http://link.springer.de/series/lncs/">http://link.springer.de/series/lncs/</a></tt>
<p><tt>Topics to be covered include, but are not limited to:</tt>
<p><tt>&nbsp;&nbsp; Reconfigurable Hardware and Systems:</tt>
<br><tt>&nbsp;&nbsp;&nbsp;&nbsp; Fine grain - Coarse grain - Reconfigurable
Computing</tt>
<br><tt>&nbsp;&nbsp;&nbsp;&nbsp; Adaptive&nbsp; -&nbsp; Customizable&nbsp;
-&nbsp; Embedded&nbsp; -&nbsp; fault-tolerant</tt>
<br><tt>&nbsp;&nbsp;&nbsp;&nbsp; Architectures&nbsp; -&nbsp; Technologies&nbsp;
-&nbsp; Low Power&nbsp; -&nbsp; Dynamically Rec.</tt>
<p><tt>&nbsp;&nbsp; Applications:</tt>
<br><tt>&nbsp;&nbsp;&nbsp;&nbsp; Routing&nbsp; -&nbsp;&nbsp; Networking&nbsp;
-&nbsp; Wireless&nbsp; -&nbsp; Evolvable</tt>
<br><tt>&nbsp;&nbsp;&nbsp;&nbsp; Real-world&nbsp; -&nbsp; Scientific&nbsp;
-&nbsp; Rapid-prototyping&nbsp; -&nbsp; Others</tt>
<p><tt>&nbsp;&nbsp; CAD, Compilation, Testing and Verification:</tt>
<br><tt>&nbsp;&nbsp;&nbsp;&nbsp; Design Flow&nbsp; -&nbsp; Tools&nbsp;
-&nbsp; Higher Level Synthesis</tt>
<br><tt>&nbsp;&nbsp;&nbsp;&nbsp; Interconnect&nbsp; -&nbsp; Parameter Estimation&nbsp;
-&nbsp; Benchmarks</tt>
<br><tt>&nbsp;&nbsp;&nbsp;&nbsp; Testing and Verification of Dynamically
Reconfigurable Apps</tt>
<p><tt>&nbsp;&nbsp; Surveys, Tutorials, Future, History, and Education:</tt>
<br><tt>&nbsp;&nbsp;&nbsp;&nbsp; Roadmaps to Technology, Application and
Design</tt>
<br><tt>&nbsp;&nbsp;&nbsp;&nbsp; Teaching Reconfigurables &amp; Evolvables&nbsp;
-&nbsp; Curricular Impact</tt>
<br><tt>&nbsp;&nbsp;&nbsp;&nbsp; Student Projects&nbsp; -&nbsp; Industry
/ University Programs&nbsp; - Publicity</tt>
<p><tt>&nbsp;&nbsp; Evolvable Hardware and Evolutionary Compilation Methods:</tt>
<br><tt>&nbsp;&nbsp;&nbsp;&nbsp; Evolvable Hardware (EH) -&nbsp; Co-Evolution</tt>
<br><tt>&nbsp;&nbsp;&nbsp;&nbsp; Tools and methodologies&nbsp; -&nbsp;
Genetic Programming</tt>
<p><tt>&nbsp;&nbsp; Emerging and Other RL/RC-related Methodologies:</tt>
<br><tt>&nbsp;&nbsp;&nbsp;&nbsp; State machines -&nbsp; Cellular Automata</tt>
<br><tt>&nbsp;&nbsp;&nbsp;&nbsp; Biologically inspired - Brain inspired</tt>
<br><tt>&nbsp;&nbsp;&nbsp;&nbsp; fludic reconfigurable logic and applications</tt>
<br><tt>&nbsp;&nbsp;&nbsp;&nbsp; Molecular Biology Applications</tt>
<p><tt>For details on topic areas and conference location see:</tt>
<br><tt><a href="http://xputers.informatik.uni-kl.de/FPL/FPL2000/detailed_fpl.html">http://xputers.informatik.uni-kl.de/FPL/FPL2000/detailed_fpl.html</a></tt>
<p><tt>Authors are invited to submit PDF of their paper (10 pages maximum)</tt>
<br><tt>by date March 17, 2000 via E-mail to <a href="mailto:hartenst [at] rhrk [dot] uni-kl.de">mailto:hartenst [at] rhrk [dot] uni-kl.de</a></tt>
<br><tt>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;
and: <a href="mailto:hoffmant [at] rhrk [dot] uni-kl.de">mailto:hoffmant [at] rhrk [dot] uni-kl.de</a></tt>
<br><tt>For guidelines see&nbsp;&nbsp;&nbsp; <a href="http://www.springer.de/comp/lncs/authors.html">http://www.springer.de/comp/lncs/authors.html</a></tt>
<br><tt>Questions please, address to:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; <a href="mailto:hoffmant [at] rhrk [dot] uni-kl.de">mailto:hoffmant [at] rhrk [dot] uni-kl.de</a></tt>
<p><tt>Download Call for Papers and Registration Form:&nbsp; PLEASE, DISTRIBUTE
:</tt>
<br><tt>PDF: <a href="http://xputers.informatik.uni-kl.de/FPL/fpl2000/CfP_FPL2000.pdf">http://xputers.informatik.uni-kl.de/FPL/fpl2000/CfP_FPL2000.pdf</a></tt>
<br><tt>ps:&nbsp; <a href="http://xputers.informatik.uni-kl.de/FPL/fpl2000/CfP_FPL2000.ps">http://xputers.informatik.uni-kl.de/FPL/fpl2000/CfP_FPL2000.ps</a></tt>
<p><tt>Reiner Hartenstein</tt>
<br><tt>Program Chair FPL-2000</tt></html>

--------------489B063A501673270C951C21--


From owner-reliable_computing [at] interval [dot] usl.edu  Wed Mar  8 10:28:41 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA29429
	for reliable_computing-outgoing; Wed, 8 Mar 2000 10:28:41 -0600 (CST)
Received: from mx1.iat.cnr.it (mail.iat.cnr.it [146.48.65.43])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA29424
	for <reliable_computing [at] interval [dot] usl.edu>; Wed, 8 Mar 2000 10:28:38 -0600 (CST)
Received: from mailserv.iei.pi.cnr.it (mailserv.iei.pi.cnr.it [146.48.84.11])
 by mail.iat.cnr.it (PMDF V6.0-21 #36023)
 id <01JMSQHMJ6E88WW520 [at] mail [dot] iat.cnr.it>
 (original mail from t.bolognesi [at] IEI [dot] PI.CNR.IT); Wed,
 08 Mar 2000 17:12:55 +0100 (MET)
Received: from mailserv.iei.pi.cnr.it (mailserv.iei.pi.cnr.it [146.48.84.11])
 by mail.iat.cnr.it (PMDF V6.0-21 #36023)
 with ESMTP id <01JMSQHJ3CO28WW52Q [at] mail [dot] iat.cnr.it> for
 forte-pstv-2000-lists-expand [at] reprocess [dot] iat.cnr.it
 (ORCPT forte-pstv-2000-lists [at] mail [dot] iat.cnr.it); Wed,
 08 Mar 2000 17:12:41 +0100 (MET)
Received: from [146.48.84.49] (mac-bolognesi.iei.pi.cnr.it [146.48.84.49])
	by mailserv.iei.pi.cnr.it (8.9.3/8.8.7) with ESMTP id RAA09819	for
 <forte-pstv-2000-lists [at] mail [dot] iat.cnr.it>; Wed, 08 Mar 2000 17:19:16 +0100
Date: Wed, 08 Mar 2000 17:13:44 +0100
From: Tommaso Bolognesi <t.bolognesi [at] IEI [dot] PI.CNR.IT>
Subject: FORTE/PSTV 2000 DEADLINE EXTENSION
X-Sender: bolog [at] mailserv [dot] iei.pi.cnr.it
To: forte-pstv-2000-lists [at] mail [dot] iat.cnr.it
Reply-to: forte-pstv-2000 [at] cpr [dot] it
Message-id: <l03130300b4ec2c831f4a@[146.48.84.49]>
MIME-version: 1.0
Content-type: text/plain; charset=us-ascii
Content-transfer-encoding: 7BIT
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

------------FORTE / PSTV 2000 AT PISA - EXTENDED DEADLINE ------------

UNDER THE PRESSURE OF SEVERAL LAST MINUTE REQUESTS
WE ARE GOING TO POSTPONE THE SUBMISSION DEADLINE TO

         MARCH 15, 2000

PLEASE USE OUR WEB-BASED SUBMISSION SYSTEM, REACHABLE
FROM THE CONFERENCE SITE AT

      http://forte-pstv-2000.cpr.it


REGARDS

   TOMMASO AND DIEGO



From owner-reliable_computing [at] interval [dot] usl.edu  Wed Mar  8 12:29:27 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id MAA29901
	for reliable_computing-outgoing; Wed, 8 Mar 2000 12:29:26 -0600 (CST)
Received: from genie.eecs.lehigh.edu (genie.eecs.lehigh.edu [128.180.98.9])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id MAA29896
	for <reliable_computing [at] interval [dot] usl.edu>; Wed, 8 Mar 2000 12:29:22 -0600 (CST)
Received: from unknown-147-100.pilot.net (unknown-147-100.pilot.net [198.232.147.100])
	by genie.eecs.lehigh.edu (8.8.5/8.8.5) with ESMTP id IAA21665;
	Wed, 8 Mar 2000 08:00:38 -0500 (EST)
Received: from unknown-24-4.pilot.net (unknown-24-4.pilot.net [206.189.24.4]) by unknown-147-100.pilot.net with ESMTP id FAA26682; Wed, 8 Mar 2000 05:00:35 -0800 (PST)
Received: from crdns.crd.ge.com (localhost [127.0.0.1]) by unknown-24-4.pilot.net with ESMTP id FAA00869; Wed, 8 Mar 2000 05:00:34 -0800 (PST)
Received: from exc01crdge.crd.ge.com (crdmsx01.crd.ge.com [3.1.116.47])
	by crdns.crd.ge.com (8.9.3/8.9.3) with ESMTP id IAA17243;
	Wed, 8 Mar 2000 08:01:11 -0500 (EST)
Received: by crdmsx01.crd.ge.com with Internet Mail Service (5.5.2448.0)
	id <1WSCQSYD>; Wed, 8 Mar 2000 08:00:27 -0500
Message-ID: <FB5C241B1298D111AB6E00805FFE7E16024D8130 [at] exc04crdge [dot] crd.ge.com>
From: "Puckette, Charles M (CRD)" <puckette [at] crd [dot] ge.com>
To: "'Birgit Westermann'" <Birgit.Westermann [at] unibas [dot] ch>,
        ASAP User
	 <asap [at] EECS [dot] Lehigh.EDU>
Cc: asap-announce [at] EECS [dot] Lehigh.EDU
Subject: RE: Remove from mailing list
Date: Wed, 8 Mar 2000 08:00:26 -0500 
X-Mailer: Internet Mail Service (5.5.2448.0)
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Please remove puckette [at] crd [dot] ge.com from your mailing lists.

Sincerely,

C. M. Puckette

GE Corporate R & D
______________________________
C. M. (Don) Puckette
Manager - Systems Integration
Electronic Systems Laboratory
Bldg KW, Room C-1317
P.O. Box 8, Schenectady, NY  12301
Phone: 518-387-5284
Fax:  518-387-4042
E-mail:  puckette [at] crd [dot] ge.com


-----Original Message-----
From: Birgit Westermann [mailto:Birgit.Westermann [at] unibas [dot] ch]
Sent: Wednesday, March 08, 2000 2:21 AM
To: ASAP User
Cc: asap-announce [at] EECS [dot] Lehigh.EDU
Subject: Remove from mailing list


Please remove birgit [at] ifi [dot] unibas.ch from your
mailing lists.

Birgit Westermann

From owner-reliable_computing [at] interval [dot] usl.edu  Thu Mar  9 03:43:48 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id DAA01202
	for reliable_computing-outgoing; Thu, 9 Mar 2000 03:43:47 -0600 (CST)
Received: from omega.nbsp.nsk.su (omega.nbsp.nsk.su [212.20.33.242])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id DAA01197
	for <reliable_computing [at] interval [dot] louisiana.edu>; Thu, 9 Mar 2000 03:43:36 -0600 (CST)
Received: from nbsp.nsk.su (novo0 [129.144.234.240])
	by omega.nbsp.nsk.su (8.8.8+Sun/8.8.8) with SMTP id PAA25549
	for <reliable_computing [at] interval [dot] louisiana.edu>; Thu, 9 Mar 2000 15:44:18 +0600 (NST)
Received: from novo21 by nbsp.nsk.su (SMI-8.6/SMI-SVR4)
	id PAA28380; Thu, 9 Mar 2000 15:43:45 +0600
Received: from novo21 (novo21 [129.144.234.21])
	by novo21 (8.9.1b+Sun/8.9.1) with SMTP id PAA26669
	for <reliable_computing [at] interval [dot] louisiana.edu>; Thu, 9 Mar 2000 15:43:23 +0600 (NST)
Message-Id: <200003090943.PAA26669@novo21>
Date: Thu, 9 Mar 2000 15:43:23 +0600 (NST)
From: "Sergey P. Shary" <ssh [at] nbsp [dot] nsk.su>
Reply-To: "Sergey P. Shary" <ssh [at] nbsp [dot] nsk.su>
Subject: "Symmetric" intervals 
To: reliable_computing [at] interval [dot] louisiana.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: feSWanyWkapSaZN0Psr++A==
X-Mailer: dtmail 1.3.0 CDE Version 1.3 SunOS 5.7 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk





Colleagues, 


I would like to draw your attention to the following terminology problem. 

The intervals [a,b] with the property a=-b are ususally called "symmetric",
but what is a "symmetric interval matrix"?  Nowdays,  the  following  two 
understandigs occur in the literature: 

1) it is a set of all symmetric (in the sense of common linear algebra) 
   point matrices within a given interval matrix whose elements are 
   "symmetric" with respect to the main diagonal,
   
2) it is an interval matrix whose elements are "symmetric intervals".


I myself prefer the first option, which does not violate the classical 
linear algebra, so that there exists a need to somehow correct the very 
term "symmetric interval". Maybe, a "balanced interval" would be a good 
substitute to call the intervals [a,b] with a=-b ? I like it ... 





Sergey Shary 





From owner-reliable_computing [at] interval [dot] usl.edu  Thu Mar  9 06:57:29 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id GAA00402
	for reliable_computing-outgoing; Thu, 9 Mar 2000 06:57:29 -0600 (CST)
Received: from homer.mat.univie.ac.at (homer.mat.univie.ac.at [131.130.29.70])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id GAA00397
	for <reliable_computing [at] interval [dot] louisiana.edu>; Thu, 9 Mar 2000 06:57:25 -0600 (CST)
Received: (from neum@localhost)
	by homer.mat.univie.ac.at (8.9.3/8.9.3) id NAA21123;
	Thu, 9 Mar 2000 13:57:22 +0100 (MET)
Date: Thu, 9 Mar 2000 13:57:22 +0100 (MET)
From: Arnold Neumaier <neum [at] cma [dot] univie.ac.at>
Message-Id: <200003091257.NAA21123 [at] homer [dot] mat.univie.ac.at>
To: reliable_computing [at] interval [dot] louisiana.edu, ssh [at] nbsp [dot] nsk.su
Subject: Re:  "Symmetric" intervals
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

>>The intervals [a,b] with the property a=-b are ususally called "symmetric"<<
I'd call that zero-symmetric, so that symmetric matrices have their
natural meaning.

Arnold Neumaier


From owner-reliable_computing [at] interval [dot] usl.edu  Thu Mar  9 07:23:57 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id HAA00804
	for reliable_computing-outgoing; Thu, 9 Mar 2000 07:23:57 -0600 (CST)
Received: from argo.bas.bg (root [at] argo [dot] bas.bg [195.96.224.7])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id HAA00799
	for <reliable_computing [at] interval [dot] louisiana.edu>; Thu, 9 Mar 2000 07:23:38 -0600 (CST)
Received: from iph.bio.bas.bg (IDENT:0@bas-bio.lines.bas.bg [195.96.252.58])
	by argo.bas.bg (8.9.3/8.9.3/Debian 8.9.3-6) with ESMTP id PAA25413
	for <reliable_computing [at] interval [dot] louisiana.edu>; Thu, 9 Mar 2000 15:23:06 +0200
X-Authentication-Warning: argo.bas.bg: Host IDENT:0@bas-bio.lines.bas.bg [195.96.252.58] claimed to be iph.bio.bas.bg
Received: from biomath.bio.bas.bg (biomath.bio.bas.bg [195.96.247.160])
	by iph.bio.bas.bg (8.9.3/8.9.3) with SMTP id PAA29131
	for <reliable_computing [at] interval [dot] louisiana.edu>; Thu, 9 Mar 2000 15:23:43 +0200
Message-Id: <200003091323.PAA29131 [at] iph [dot] bio.bas.bg>
Comments: Authenticated sender is <smarkov [at] iph [dot] bio.bas.bg>
From: "Svetoslav Markov" <smarkov [at] iph [dot] bio.bas.bg>
Organization: Institute of Mathematics, BAS
To: reliable_computing [at] interval [dot] louisiana.edu
Date: Thu, 9 Mar 2000 15:26:22 +0200
Subject: Re:  "Symmetric" intervals
Reply-to: smarkov [at] iph [dot] bio.bas.bg
Priority: normal
X-mailer: Pegasus Mail for Windows (v2.23)
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

  

In support to Arnold Neumaier's remark let me recall that "zero-symmetric 
convex body", and more generally "t-symmetric convex body " is an established 
notion in convex analysis. Intervals are a particular case of convex bodies.

S. Markov

> >>The intervals [a,b] with the property a=-b are ususally called "symmetric"<<
> I'd call that zero-symmetric, so that symmetric matrices have their
> natural meaning.
> 
> Arnold Neumaier
> 
  
-- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- +

 Svetoslav Markov

 Section "Biomathematics", Inst. of       phone: +3592-979-3704, +3592-707460,
 Mathematics and Computer Sci.,         fax: +3592-971-3649, 
 Bulgarian Academy of Sciences,         e-mail: smarkov [at] iph [dot] bio.bas.bg
 "Acad. G. Bonchev" st., block 8,       
 BG-1113 Sofia,  BULGARIA               

 home address: 11 Mizia, 1124 Sofia, tel. +3592-444651 
 
 -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- +

  
-- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- +

 Svetoslav Markov

 Section "Biomathematics", Inst. of       phone: +3592-979-3704, +3592-707460,
 Mathematics and Computer Sci.,         fax: +3592-971-3649, 
 Bulgarian Academy of Sciences,         e-mail: smarkov [at] iph [dot] bio.bas.bg
 "Acad. G. Bonchev" st., block 8,       
 BG-1113 Sofia,  BULGARIA               

 home address: 11 Mizia, 1124 Sofia, tel. +3592-444651 
 
 -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- +

From owner-reliable_computing [at] interval [dot] usl.edu  Thu Mar  9 09:07:51 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id JAA01184
	for reliable_computing-outgoing; Thu, 9 Mar 2000 09:07:51 -0600 (CST)
Received: from d61.ucs.usl.edu (root [at] d61 [dot] ucs.usl.edu [130.70.114.61])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id JAA01179
	for <reliable_computing [at] interval [dot] louisiana.edu>; Thu, 9 Mar 2000 09:07:48 -0600 (CST)
Received: from d61.ucs.usl.edu (rbk5287 [at] d61 [dot] ucs.usl.edu [130.70.114.61])
	by d61.ucs.usl.edu (8.9.1/8.9.1/ucs-client_1.3) with SMTP id JAA06044
	for <reliable_computing [at] interval [dot] louisiana.edu>; Thu, 9 Mar 2000 09:07:47 -0600 (CST)
Message-Id: <200003091507.JAA06044 [at] d61 [dot] ucs.usl.edu>
Date: Thu, 9 Mar 2000 09:07:47 -0600 (CST)
From: Kearfott Ralph B <rbk5287 [at] louisiana [dot] edu>
Reply-To: Kearfott Ralph B <rbk5287 [at] louisiana [dot] edu>
Subject: Re:  "Symmetric" intervals
To: reliable_computing [at] interval [dot] louisiana.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: cGbJ9PuBwT1zbyxzjEL7Qw==
X-Mailer: dtmail 1.2.1 CDE Version 1.2.1 SunOS 5.6 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

I agree with Sergey that it would be good to use different terms
for "symmetric interval matrices" and for intervals that are symmetric
with respect to zero.  I also support 

    "zero-symmetric" 
    
for intervals that are symmetric with respect to zero, since the 
term is both

   * suggestive and, apparently, 
   
   * consistent with an established term from convex analysis.  
   
(Lamentably, I'm not personally familiar with "t-symmetric", but I'll 
trust Svetoslav.) 

Hopefully such a new use will become  established in our literature.

Best regards,

Baker

> From: "Svetoslav Markov" <smarkov [at] iph [dot] bio.bas.bg>
> To: reliable_computing [at] interval [dot] louisiana.edu
> Date: Thu, 9 Mar 2000 15:26:22 +0200
> Subject: Re:  "Symmetric" intervals
> 
>   
> 
> In support to Arnold Neumaier's remark let me recall that "zero-symmetric 
> convex body", and more generally "t-symmetric convex body " is an established 
> notion in convex analysis. Intervals are a particular case of convex bodies.
> 
> S. Markov
> 
> > >>The intervals [a,b] with the property a=-b are ususally called 
"symmetric"<<
> > I'd call that zero-symmetric, so that symmetric matrices have their
> > natural meaning.
> > 
> > Arnold Neumaier
> > 
>   

---------------------------------------------------------------
R. Baker Kearfott,    rbk [at] louisiana [dot] edu   (337) 482-5346 (fax)
(337) 482-5270 (work)                     (337) 981-9744 (home)
URL: http://interval.louisiana.edu/kearfott.html
Department of Mathematics, University of Louisiana at Lafayette
Box 4-1010, Lafayette, LA 70504-1010, USA
---------------------------------------------------------------


From owner-reliable_computing [at] interval [dot] usl.edu  Thu Mar  9 15:05:49 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id PAA02119
	for reliable_computing-outgoing; Thu, 9 Mar 2000 15:05:49 -0600 (CST)
Received: from smtprtp.ntcom.nortel.net (smtprtp.ntcom.nortel.net [137.118.22.15])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id PAA02114
	for <reliable_computing [at] interval [dot] louisiana.edu>; Thu, 9 Mar 2000 15:05:45 -0600 (CST)
Received: from zrtpd004.us.nortel.com (actually zrtpd004) 
          by smtprtp.ntcom.nortel.net; Thu, 9 Mar 2000 16:05:11 -0500
Received: by zrtpd004.us.nortel.com with Internet Mail Service (5.5.2650.21) 
          id <G2B0M5WD>; Thu, 9 Mar 2000 16:05:09 -0500
Message-ID: <03E3E0690542D211A1490000F80836F402879920 [at] zcard00f [dot] ca.nortel.com>
From: "Bill Older" <wolder [at] nortelnetworks [dot] com>
To: Kearfott Ralph B <rbk5287 [at] louisiana [dot] edu>,
        reliable_computing [at] interval [dot] louisiana.edu
Subject: RE: "Symmetric" intervals
Date: Thu, 9 Mar 2000 16:05:03 -0500
MIME-Version: 1.0
X-Mailer: Internet Mail Service (5.5.2650.21)
Content-Type: multipart/alternative;
              boundary="----_=_NextPart_001_01BF8A0B.254987F4"
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

This message is in MIME format. Since your mail reader does not understand
this format, some or all of this message may not be legible.

------_=_NextPart_001_01BF8A0B.254987F4
Content-Type: text/plain;
	charset="iso-8859-1"

The notion of a symmetric interval is extremely important
because of its "algebraic" properties ( symmetric intervals
being the analogue of an ideal), so I personally find
"zero-symmetric" unduly cumbersome.  And wouldn't
"symmetric matrix of symmetric intervals" be perfectly clear,
even though "symmetric interval matrix" is clearly ambiguous?


-----Original Message-----
From: Kearfott Ralph B [mailto:rbk5287 [at] louisiana [dot] edu]
Sent: Thursday, March 09, 2000 10:08 AM
To: reliable_computing [at] interval [dot] louisiana.edu
Subject: Re: "Symmetric" intervals


I agree with Sergey that it would be good to use different terms
for "symmetric interval matrices" and for intervals that are symmetric
with respect to zero.  I also support 

    "zero-symmetric" 
    
for intervals that are symmetric with respect to zero, since the 
term is both

   * suggestive and, apparently, 
   
   * consistent with an established term from convex analysis.  
   
(Lamentably, I'm not personally familiar with "t-symmetric", but I'll 
trust Svetoslav.) 

Hopefully such a new use will become  established in our literature.

Best regards,

Baker

> From: "Svetoslav Markov" <smarkov [at] iph [dot] bio.bas.bg>
> To: reliable_computing [at] interval [dot] louisiana.edu
> Date: Thu, 9 Mar 2000 15:26:22 +0200
> Subject: Re:  "Symmetric" intervals
> 
>   
> 
> In support to Arnold Neumaier's remark let me recall that "zero-symmetric 
> convex body", and more generally "t-symmetric convex body " is an
established 
> notion in convex analysis. Intervals are a particular case of convex
bodies.
> 
> S. Markov
> 
> > >>The intervals [a,b] with the property a=-b are ususally called 
"symmetric"<<
> > I'd call that zero-symmetric, so that symmetric matrices have their
> > natural meaning.
> > 
> > Arnold Neumaier
> > 
>   

---------------------------------------------------------------
R. Baker Kearfott,    rbk [at] louisiana [dot] edu   (337) 482-5346 (fax)
(337) 482-5270 (work)                     (337) 981-9744 (home)
URL: http://interval.louisiana.edu/kearfott.html
Department of Mathematics, University of Louisiana at Lafayette
Box 4-1010, Lafayette, LA 70504-1010, USA
---------------------------------------------------------------


------_=_NextPart_001_01BF8A0B.254987F4
Content-Type: text/html;
	charset="iso-8859-1"

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
<HTML>
<HEAD>
<META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=iso-8859-1">
<META NAME="Generator" CONTENT="MS Exchange Server version 5.5.2651.65">
<TITLE>RE: &quot;Symmetric&quot; intervals</TITLE>
</HEAD>
<BODY>

<P><FONT SIZE=2>The notion of a symmetric interval is extremely important</FONT>
<BR><FONT SIZE=2>because of its &quot;algebraic&quot; properties ( symmetric intervals</FONT>
<BR><FONT SIZE=2>being the analogue of an ideal), so I personally find</FONT>
<BR><FONT SIZE=2>&quot;zero-symmetric&quot; unduly cumbersome.&nbsp; And wouldn't</FONT>
<BR><FONT SIZE=2>&quot;symmetric matrix of symmetric intervals&quot; be perfectly clear,</FONT>
<BR><FONT SIZE=2>even though &quot;symmetric interval matrix&quot; is clearly ambiguous?</FONT>
</P>
<BR>

<P><FONT SIZE=2>-----Original Message-----</FONT>
<BR><FONT SIZE=2>From: Kearfott Ralph B [<A HREF="mailto:rbk5287 [at] louisiana [dot] edu">mailto:rbk5287 [at] louisiana [dot] edu</A>]</FONT>
<BR><FONT SIZE=2>Sent: Thursday, March 09, 2000 10:08 AM</FONT>
<BR><FONT SIZE=2>To: reliable_computing [at] interval [dot] louisiana.edu</FONT>
<BR><FONT SIZE=2>Subject: Re: &quot;Symmetric&quot; intervals</FONT>
</P>
<BR>

<P><FONT SIZE=2>I agree with Sergey that it would be good to use different terms</FONT>
<BR><FONT SIZE=2>for &quot;symmetric interval matrices&quot; and for intervals that are symmetric</FONT>
<BR><FONT SIZE=2>with respect to zero.&nbsp; I also support </FONT>
</P>

<P><FONT SIZE=2>&nbsp;&nbsp;&nbsp; &quot;zero-symmetric&quot; </FONT>
<BR><FONT SIZE=2>&nbsp;&nbsp;&nbsp; </FONT>
<BR><FONT SIZE=2>for intervals that are symmetric with respect to zero, since the </FONT>
<BR><FONT SIZE=2>term is both</FONT>
</P>

<P><FONT SIZE=2>&nbsp;&nbsp; * suggestive and, apparently, </FONT>
<BR><FONT SIZE=2>&nbsp;&nbsp; </FONT>
<BR><FONT SIZE=2>&nbsp;&nbsp; * consistent with an established term from convex analysis.&nbsp; </FONT>
<BR><FONT SIZE=2>&nbsp;&nbsp; </FONT>
<BR><FONT SIZE=2>(Lamentably, I'm not personally familiar with &quot;t-symmetric&quot;, but I'll </FONT>
<BR><FONT SIZE=2>trust Svetoslav.) </FONT>
</P>

<P><FONT SIZE=2>Hopefully such a new use will become&nbsp; established in our literature.</FONT>
</P>

<P><FONT SIZE=2>Best regards,</FONT>
</P>

<P><FONT SIZE=2>Baker</FONT>
</P>

<P><FONT SIZE=2>&gt; From: &quot;Svetoslav Markov&quot; &lt;smarkov [at] iph [dot] bio.bas.bg&gt;</FONT>
<BR><FONT SIZE=2>&gt; To: reliable_computing [at] interval [dot] louisiana.edu</FONT>
<BR><FONT SIZE=2>&gt; Date: Thu, 9 Mar 2000 15:26:22 +0200</FONT>
<BR><FONT SIZE=2>&gt; Subject: Re:&nbsp; &quot;Symmetric&quot; intervals</FONT>
<BR><FONT SIZE=2>&gt; </FONT>
<BR><FONT SIZE=2>&gt;&nbsp;&nbsp; </FONT>
<BR><FONT SIZE=2>&gt; </FONT>
<BR><FONT SIZE=2>&gt; In support to Arnold Neumaier's remark let me recall that &quot;zero-symmetric </FONT>
<BR><FONT SIZE=2>&gt; convex body&quot;, and more generally &quot;t-symmetric convex body &quot; is an established </FONT>
<BR><FONT SIZE=2>&gt; notion in convex analysis. Intervals are a particular case of convex bodies.</FONT>
<BR><FONT SIZE=2>&gt; </FONT>
<BR><FONT SIZE=2>&gt; S. Markov</FONT>
<BR><FONT SIZE=2>&gt; </FONT>
<BR><FONT SIZE=2>&gt; &gt; &gt;&gt;The intervals [a,b] with the property a=-b are ususally called </FONT>
<BR><FONT SIZE=2>&quot;symmetric&quot;&lt;&lt;</FONT>
<BR><FONT SIZE=2>&gt; &gt; I'd call that zero-symmetric, so that symmetric matrices have their</FONT>
<BR><FONT SIZE=2>&gt; &gt; natural meaning.</FONT>
<BR><FONT SIZE=2>&gt; &gt; </FONT>
<BR><FONT SIZE=2>&gt; &gt; Arnold Neumaier</FONT>
<BR><FONT SIZE=2>&gt; &gt; </FONT>
<BR><FONT SIZE=2>&gt;&nbsp;&nbsp; </FONT>
</P>

<P><FONT SIZE=2>---------------------------------------------------------------</FONT>
<BR><FONT SIZE=2>R. Baker Kearfott,&nbsp;&nbsp;&nbsp; rbk [at] louisiana [dot] edu&nbsp;&nbsp; (337) 482-5346 (fax)</FONT>
<BR><FONT SIZE=2>(337) 482-5270 (work)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; (337) 981-9744 (home)</FONT>
<BR><FONT SIZE=2>URL: <A HREF="http://interval.louisiana.edu/kearfott.html" TARGET="_blank">http://interval.louisiana.edu/kearfott.html</A></FONT>
<BR><FONT SIZE=2>Department of Mathematics, University of Louisiana at Lafayette</FONT>
<BR><FONT SIZE=2>Box 4-1010, Lafayette, LA 70504-1010, USA</FONT>
<BR><FONT SIZE=2>---------------------------------------------------------------</FONT>
</P>

</BODY>
</HTML>
------_=_NextPart_001_01BF8A0B.254987F4--

From owner-reliable_computing [at] interval [dot] usl.edu  Fri Mar 10 03:56:09 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id DAA03134
	for reliable_computing-outgoing; Fri, 10 Mar 2000 03:56:09 -0600 (CST)
Received: from argo.bas.bg (root [at] argo [dot] bas.bg [195.96.224.7])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id DAA03129
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 10 Mar 2000 03:55:47 -0600 (CST)
Received: from iph.bio.bas.bg (IDENT:0@bas-bio.lines.bas.bg [195.96.252.58])
	by argo.bas.bg (8.9.3/8.9.3/Debian 8.9.3-6) with ESMTP id LAA24059;
	Fri, 10 Mar 2000 11:54:51 +0200
X-Authentication-Warning: argo.bas.bg: Host IDENT:0@bas-bio.lines.bas.bg [195.96.252.58] claimed to be iph.bio.bas.bg
Received: from biomath.bio.bas.bg (biomath.bio.bas.bg [195.96.247.160])
	by iph.bio.bas.bg (8.9.3/8.9.3) with SMTP id LAA32433;
	Fri, 10 Mar 2000 11:55:20 +0200
Message-Id: <200003100955.LAA32433 [at] iph [dot] bio.bas.bg>
Comments: Authenticated sender is <smarkov [at] iph [dot] bio.bas.bg>
From: "Svetoslav Markov" <smarkov [at] iph [dot] bio.bas.bg>
Organization: Institute of Mathematics, BAS
To: Kearfott Ralph B <rbk5287 [at] louisiana [dot] edu>
Date: Fri, 10 Mar 2000 11:57:59 +0200
Subject: Re:  "Symmetric" intervals
Reply-to: smarkov [at] iph [dot] bio.bas.bg
CC: reliable_computing [at] interval [dot] louisiana.edu
Priority: normal
X-mailer: Pegasus Mail for Windows (v2.23)
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Let me explain what a t-symmetric convex body in convex analysis is.

A  convex body ( = compact convex set in E^n) is said to be "centrally
symmetric with respect to the translation vector t\in E^n", or briefly 
"t-symmetric", if A-t= -(A-t)   (the vector t is called "center" of A)

According to this definition a convex body A with A= -A is centrally symmetric 
w.r.t. the origin, or briefly 0-symmetric.
 
In  convex analysis, if confusion is possible, then "symmetric" is 
replaced by "0-symmetric". There is no need to use the term "0-symmetric" if no 
confusion occurs -- then we say just "centrally symmetric" or "symmetric".

This is just for information, in principle, I do not object alternative 
terminology.

S. Markov




> I agree with Sergey that it would be good to use different terms
> for "symmetric interval matrices" and for intervals that are symmetric
> with respect to zero.  I also support 
> 
>     "zero-symmetric" 
>     
> for intervals that are symmetric with respect to zero, since the 
> term is both
> 
>    * suggestive and, apparently, 
>    
>    * consistent with an established term from convex analysis.  
>    
> (Lamentably, I'm not personally familiar with "t-symmetric", but I'll 
> trust Svetoslav.) 
> 
> Hopefully such a new use will become  established in our literature.
> 
> Best regards,
> 
> Baker
>  

From owner-reliable_computing [at] interval [dot] usl.edu  Fri Mar 10 06:21:30 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id GAA04458
	for reliable_computing-outgoing; Fri, 10 Mar 2000 06:21:29 -0600 (CST)
Received: from visla.utia.cas.cz (root [at] visla [dot] utia.cas.cz [147.231.12.1])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id GAA04453
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 10 Mar 2000 06:21:25 -0600 (CST)
Received: from [147.231.11.66] (klicava.site.cas.cz [147.231.11.66])
	by visla.utia.cas.cz (8.9.3/8.9.3) with SMTP id NAA04602;
	Fri, 10 Mar 2000 13:20:52 +0100 (MET)
X-NUPop-Charset: IBM 8-Bit
Date: Thu, 9 Mar 00 14:16:53 CET  
From: "Jiri Rohn" <rohn [at] uivt [dot] cas.cz>
Reply-To: rohn [at] uivt [dot] cas.cz
Message-Id: <51417.rohn [at] uivt [dot] cas.cz>
To: ssh [at] nbsp [dot] nsk.su, reliable_computing [at] interval [dot] usl.edu
Subject: RE: "Symmetric" intervals
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear colleagues,

Sergey's letter also contains another question which has not been touched
by previous respondents:

> what is a "symmetric interval matrix"?
>
>1) it is a set of all symmetric (in the sense of common linear algebra)
>   point matrices within a given interval matrix whose elements are
>   "symmetric" with respect to the main diagonal,
>
>2) it is an interval matrix whose elements are "symmetric intervals".
    or, I would add, it is an interval matrix [A,B] where both
    A and B are symmetric.

I have seen the use of 1) in papers in some engineering journals
(devoted e.g. to stability of interval matrices), but my opinion is that,
according to the standard way in which mathematical terms are built, a
symmetric interval matrix should be an interval matrix, which is not the
case of 1). Hence I would support the definition 2).

Best regards,

Jiri

From owner-reliable_computing [at] interval [dot] usl.edu  Fri Mar 10 06:59:46 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id GAA04835
	for reliable_computing-outgoing; Fri, 10 Mar 2000 06:59:46 -0600 (CST)
Received: from homer.mat.univie.ac.at (homer.mat.univie.ac.at [131.130.29.70])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id GAA04830
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 10 Mar 2000 06:59:42 -0600 (CST)
Received: (from neum@localhost)
	by homer.mat.univie.ac.at (8.9.3/8.9.3) id NAA22264;
	Fri, 10 Mar 2000 13:59:39 +0100 (MET)
Date: Fri, 10 Mar 2000 13:59:39 +0100 (MET)
From: Arnold Neumaier <neum [at] cma [dot] univie.ac.at>
Message-Id: <200003101259.NAA22264 [at] homer [dot] mat.univie.ac.at>
To: reliable_computing [at] interval [dot] usl.edu, rohn [at] uivt [dot] cas.cz, ssh [at] nbsp [dot] nsk.su
Subject: RE: "Symmetric" intervals
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

>>what is a "symmetric interval matrix"?<<

I agree with Jiri Rohn, that it should be an interval matrix A
with A^T=A. The restricted interpretation as a set of symmetric
matrices is adequately covered by the concept of a symmetric solution set
for a linear interval system.

Arnold Neumaier


From owner-reliable_computing [at] interval [dot] usl.edu  Fri Mar 10 07:02:55 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id HAA05017
	for reliable_computing-outgoing; Fri, 10 Mar 2000 07:02:55 -0600 (CST)
Received: from omega.nbsp.nsk.su (omega.nbsp.nsk.su [212.20.33.242])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id HAA05012
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 10 Mar 2000 07:02:51 -0600 (CST)
Received: from nbsp.nsk.su (novo0 [129.144.234.240])
	by omega.nbsp.nsk.su (8.8.8+Sun/8.8.8) with SMTP id SAA02410;
	Fri, 10 Mar 2000 18:59:57 +0600 (NST)
Received: from novo21 by nbsp.nsk.su (SMI-8.6/SMI-SVR4)
	id SAA05701; Fri, 10 Mar 2000 18:55:30 +0600
Received: from novo21 (novo21 [129.144.234.21])
	by novo21 (8.9.1b+Sun/8.9.1) with SMTP id SAA26813;
	Fri, 10 Mar 2000 18:55:07 +0600 (NST)
Message-Id: <200003101255.SAA26813@novo21>
Date: Fri, 10 Mar 2000 18:55:07 +0600 (NST)
From: "Sergey P. Shary" <ssh [at] nbsp [dot] nsk.su>
Reply-To: "Sergey P. Shary" <ssh [at] nbsp [dot] nsk.su>
Subject: Re:  "Symmetric" intervals
To: neum [at] cma [dot] univie.ac.at
Cc: reliable_computing [at] interval [dot] louisiana.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: +CjeMKb8YomE26CzqsTZ0w==
X-Mailer: dtmail 1.3.0 CDE Version 1.3 SunOS 5.7 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk



> >>The intervals [a,b] with the property a=-b are ususally called "symmetric"<<
> I'd call that zero-symmetric, so that symmetric matrices have their
> natural meaning.
> 
> Arnold Neumaier
> 


Well, but how should I call an interval matrix [A,B] that combines 
the properties 1 and 2, i.e., A and B are both symmetric point matrices, 
we consider only symmetric point matrices within the above limits and all 
the interval elements of [A,B] are "zero-symmetric"? E.g., something like 
          _                _
         |                  |
         |  [-1,1]  [-3,3]  | 
         |                  | . 
         |  [-3,3]  [-1,1]  |
         |_                _|
         
According to Arnold Neumaier's suggestion, this is a "zero-symmetric symmetric"
matrix, or a "symmetric zero-symmetric" matrix. To tell the truth, that does
not encourage me ... 


Sergey Shary 

 


From owner-reliable_computing [at] interval [dot] usl.edu  Fri Mar 10 07:11:50 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id HAA05381
	for reliable_computing-outgoing; Fri, 10 Mar 2000 07:11:50 -0600 (CST)
Received: from homer.mat.univie.ac.at (homer.mat.univie.ac.at [131.130.29.70])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id HAA05376
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 10 Mar 2000 07:11:46 -0600 (CST)
Received: (from neum@localhost)
	by homer.mat.univie.ac.at (8.9.3/8.9.3) id OAA22277;
	Fri, 10 Mar 2000 14:11:42 +0100 (MET)
Date: Fri, 10 Mar 2000 14:11:42 +0100 (MET)
From: Arnold Neumaier <neum [at] cma [dot] univie.ac.at>
Message-Id: <200003101311.OAA22277 [at] homer [dot] mat.univie.ac.at>
To: neum [at] cma [dot] univie.ac.at, ssh [at] nbsp [dot] nsk.su
Subject: Re:  "Symmetric" intervals
Cc: reliable_computing [at] interval [dot] louisiana.edu
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

>>According to Arnold Neumaier's suggestion, this is a "zero-symmetric 
symmetric" matrix, or a "symmetric zero-symmetric" matrix.<<

This is certainly better than `symmetric, matrix-symmetric matrix', 
which would be the alternative if symmetric were the label for an 
interval with midpoint zero. But one could call it `symmetrix matrix 
with midpoint zero', or perhaps doubly symmetric, to make it sound 
better.

Arnold Neumaier


From owner-reliable_computing [at] interval [dot] usl.edu  Fri Mar 10 07:14:10 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id HAA05552
	for reliable_computing-outgoing; Fri, 10 Mar 2000 07:14:10 -0600 (CST)
Received: from omega.nbsp.nsk.su (omega.nbsp.nsk.su [212.20.33.242])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id HAA05543
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 10 Mar 2000 07:14:01 -0600 (CST)
Received: from nbsp.nsk.su (novo0 [129.144.234.240])
	by omega.nbsp.nsk.su (8.8.8+Sun/8.8.8) with SMTP id TAA02512;
	Fri, 10 Mar 2000 19:14:09 +0600 (NST)
Received: from novo21 by nbsp.nsk.su (SMI-8.6/SMI-SVR4)
	id TAA06071; Fri, 10 Mar 2000 19:13:36 +0600
Received: from novo21 (novo21 [129.144.234.21])
	by novo21 (8.9.1b+Sun/8.9.1) with SMTP id TAA26824;
	Fri, 10 Mar 2000 19:13:13 +0600 (NST)
Message-Id: <200003101313.TAA26824@novo21>
Date: Fri, 10 Mar 2000 19:13:13 +0600 (NST)
From: "Sergey P. Shary" <ssh [at] nbsp [dot] nsk.su>
Reply-To: "Sergey P. Shary" <ssh [at] nbsp [dot] nsk.su>
Subject: Re:  "Symmetric" intervals
To: smarkov [at] iph [dot] bio.bas.bg
Cc: reliable_computing [at] interval [dot] louisiana.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: BQnuIbfxyOF9aIcAzpqU9A==
X-Mailer: dtmail 1.3.0 CDE Version 1.3 SunOS 5.7 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


> In support to Arnold Neumaier's remark let me recall that "zero-symmetric 
> convex body", and more generally "t-symmetric convex body " is an established 
> notion in convex analysis. Intervals are a particular case of convex bodies.
> 
> S. Markov
> 
> > >>The intervals [a,b] with the property a=-b are ususally called "symmetric"<<
> > I'd call that zero-symmetric, so that symmetric matrices have their
> > natural meaning.
> > 
> > Arnold Neumaier


In support to my own standpoint, let me recall the following definition from
classical linear functional analysis:  
   
     a set X in a (real or complex) vector space is called "balanced" 
     if  x \in X and  | \lambda | < 1  implies  \lambda x \in X

(see, e.g., the book  Kantorovich L.V., Akilov G.P. Functional analysis 
 in normed spaces).  

In real one-dimensional case, the "balanced sets" are nothing but the 
"zero-symmetric" intervals.  
 
 
Sergey Shary 
 
 


From owner-reliable_computing [at] interval [dot] usl.edu  Fri Mar 10 07:25:32 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id HAA06041
	for reliable_computing-outgoing; Fri, 10 Mar 2000 07:25:32 -0600 (CST)
Received: from omega.nbsp.nsk.su (omega.nbsp.nsk.su [212.20.33.242])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id HAA06036
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 10 Mar 2000 07:25:28 -0600 (CST)
Received: from nbsp.nsk.su (novo0 [129.144.234.240])
	by omega.nbsp.nsk.su (8.8.8+Sun/8.8.8) with SMTP id TAA02554;
	Fri, 10 Mar 2000 19:26:14 +0600 (NST)
Received: from novo21 by nbsp.nsk.su (SMI-8.6/SMI-SVR4)
	id TAA06240; Fri, 10 Mar 2000 19:25:40 +0600
Received: from novo21 (novo21 [129.144.234.21])
	by novo21 (8.9.1b+Sun/8.9.1) with SMTP id TAA26829;
	Fri, 10 Mar 2000 19:25:17 +0600 (NST)
Message-Id: <200003101325.TAA26829@novo21>
Date: Fri, 10 Mar 2000 19:25:17 +0600 (NST)
From: "Sergey P. Shary" <ssh [at] nbsp [dot] nsk.su>
Reply-To: "Sergey P. Shary" <ssh [at] nbsp [dot] nsk.su>
Subject: Re:  "Symmetric" intervals
To: neum [at] cma [dot] univie.ac.at
Cc: reliable_computing [at] interval [dot] louisiana.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: xBQRiD0WWjM8GJR62UJFOw==
X-Mailer: dtmail 1.3.0 CDE Version 1.3 SunOS 5.7 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


> >>According to Arnold Neumaier's suggestion, this is a "zero-symmetric 
> symmetric" matrix, or a "symmetric zero-symmetric" matrix.<<
> 
> This is certainly better than `symmetric, matrix-symmetric matrix', 
> which would be the alternative if symmetric were the label for an 
> interval with midpoint zero. But one could call it `symmetrix matrix 
> with midpoint zero', or perhaps doubly symmetric, to make it sound 
> better.
> 
> Arnold Neumaier
> 

I did not propose what you wrote. My alternative for 
          _                _
         |                  |
         |  [-1,1]  [-3,3]  | 
         |                  | 
         |  [-3,3]  [-1,1]  |
         |_                _|
         
is "symmetric balanced matrix" or "balanced symmetric matrix", and that 
sounds best of all. 


Sergey Shary 



From owner-reliable_computing [at] interval [dot] usl.edu  Fri Mar 10 07:35:55 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id HAA06407
	for reliable_computing-outgoing; Fri, 10 Mar 2000 07:35:55 -0600 (CST)
Received: from homer.mat.univie.ac.at (homer.mat.univie.ac.at [131.130.29.70])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id HAA06402
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 10 Mar 2000 07:35:52 -0600 (CST)
Received: (from neum@localhost)
	by homer.mat.univie.ac.at (8.9.3/8.9.3) id OAA22481;
	Fri, 10 Mar 2000 14:35:50 +0100 (MET)
Date: Fri, 10 Mar 2000 14:35:50 +0100 (MET)
From: Arnold Neumaier <neum [at] cma [dot] univie.ac.at>
Message-Id: <200003101335.OAA22481 [at] homer [dot] mat.univie.ac.at>
To: reliable_computing [at] interval [dot] louisiana.edu
Subject: Re:  "Symmetric" intervals
Cc: neum [at] cma [dot] univie.ac.at
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


>>"symmetric balanced matrix" or "balanced symmetric matrix", and that 
sounds best of all.<<

I object to a needless multiplicity of concepts. Names that must
be learnt should be reserved to objects that occur very frequently.
zero-symmetric is self-explaining and hence acceptable even if rarely
used; balanced requires one to look up the definition to find out
what is meant, and hence less useful. 

I think the best choice is to avoid a special word for 
`zero-symmetric/balanced' and simply write `with midpoint zero'. 
This is almost as short, natural in language, cannot be misunderstood, 
and self-explaining.

Arnold Neumaier


From owner-reliable_computing [at] interval [dot] usl.edu  Fri Mar 10 09:33:03 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id JAA06911
	for reliable_computing-outgoing; Fri, 10 Mar 2000 09:33:03 -0600 (CST)
Received: from argo.bas.bg (root [at] argo [dot] bas.bg [195.96.224.7])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id JAA06906
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 10 Mar 2000 09:32:44 -0600 (CST)
Received: from iph.bio.bas.bg (IDENT:0@bas-bio.lines.bas.bg [195.96.252.58])
	by argo.bas.bg (8.9.3/8.9.3/Debian 8.9.3-6) with ESMTP id RAA29387;
	Fri, 10 Mar 2000 17:32:05 +0200
X-Authentication-Warning: argo.bas.bg: Host IDENT:0@bas-bio.lines.bas.bg [195.96.252.58] claimed to be iph.bio.bas.bg
Received: from biomath.bio.bas.bg (biomath.bio.bas.bg [195.96.247.160])
	by iph.bio.bas.bg (8.9.3/8.9.3) with SMTP id RAA03814;
	Fri, 10 Mar 2000 17:32:46 +0200
Message-Id: <200003101532.RAA03814 [at] iph [dot] bio.bas.bg>
Comments: Authenticated sender is <smarkov [at] iph [dot] bio.bas.bg>
From: "Svetoslav Markov" <smarkov [at] iph [dot] bio.bas.bg>
Organization: Institute of Mathematics, BAS
To: "Bill Older" <wolder [at] nortelnetworks [dot] com>
Date: Fri, 10 Mar 2000 17:35:24 +0200
Subject: RE: "Symmetric" intervals
Reply-to: smarkov [at] iph [dot] bio.bas.bg
CC: reliable_computing [at] interval [dot] louisiana.edu
Priority: normal
X-mailer: Pegasus Mail for Windows (v2.23)
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

> From:          "Bill Older" <wolder [at] nortelnetworks [dot] com>
> To:            Kearfott Ralph B <rbk5287 [at] louisiana [dot] edu>,
>                reliable_computing [at] interval [dot] louisiana.edu
> Subject:       RE: "Symmetric" intervals
> Date:          Thu, 9 Mar 2000 16:05:03 -0500
 
> The notion of a symmetric interval is extremely important
> because of its "algebraic" properties ( symmetric intervals
> being the analogue of an ideal), so I personally find
> "zero-symmetric" unduly cumbersome.  And wouldn't
> "symmetric matrix of symmetric intervals" be perfectly clear,
> even though "symmetric interval matrix" is clearly ambiguous?
> 
>  

Indeed, symmetric intervals are very important and we need simple terminology 
related to such intervals. In relation to the above comment by Bill Older let 
me formulate another  terminological question. A quasilinear space (O.  Mayer,
H. Ratschek, G. Schroeder, etc) is a modification of a linear space abstracting 
interval properties. Algebraic extension (such as the one used for the 
definition of negative numbers) of a quasilinear space turns it into one having 
group structure.  A quasilinear space with group structure is a direct product 
of a linear space and a symmetric quasilinear space with group structure.

This shows that "symmetric quasilinear spaces with group structure"  are
EXTREMELY important and thus deserve a special name!

I shall  highly appreciate any suggestions in relation to this terminological 
question.

S. Markov
  
-- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- +

 Svetoslav Markov

 Section "Biomathematics", Inst. of       phone: +3592-979-3704, +3592-707460,
 Mathematics and Computer Sci.,         fax: +3592-971-3649, 
 Bulgarian Academy of Sciences,         e-mail: smarkov [at] iph [dot] bio.bas.bg
 "Acad. G. Bonchev" st., block 8,       
 BG-1113 Sofia,  BULGARIA               

 home address: 11 Mizia, 1124 Sofia, tel. +3592-444651 
 
 -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- +

From owner-reliable_computing [at] interval [dot] usl.edu  Sat Mar 11 05:37:13 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id FAA10508
	for reliable_computing-outgoing; Sat, 11 Mar 2000 05:37:13 -0600 (CST)
Received: from relay.rhein-main.de (root [at] hermes [dot] rhein-main.de [195.37.8.6])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id FAA10503
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sat, 11 Mar 2000 05:37:08 -0600 (CST)
Received: from menuett.rhein-main.de (menuett.rhein-main.de [195.37.9.79])
	by relay.rhein-main.de (8.9.3/8.9.3) with ESMTP id MAA13346
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sat, 11 Mar 2000 12:30:15 +0100
Message-ID: <38CA3004.90B342FA [at] menuett [dot] rhein-main.de>
Date: Sat, 11 Mar 2000 12:37:40 +0100
From: Jens Maurer <jmaurer [at] menuett [dot] rhein-main.de>
X-Mailer: Mozilla 4.7 [en] (X11; I; Linux 2.2.13 i686)
X-Accept-Language: en
MIME-Version: 1.0
To: reliable_computing [at] interval [dot] louisiana.edu
Subject: New C++ Library for Interval Arithmetic
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Hello!

I've had a look at the two C++ interval arithmetic packages
available via http://www.cs.utep.edu/interval-comp/main.html,
namely RVInterval 1.1.1 (http://www-math.cudenver.edu/~rvan/Software.html)
and PROFIL/BIAS (http://www.ti3.tu-harburg.de/Software/PROFIL.html).
>From a software design perspective, I felt that both were inadequate.
Most importantly, they are not templated, so they always employ
"double" as the underlying type.

Thus, I have written another C++ package with the following features:
 - Configurable base type (float, double, long double, or even your
own floating-point like type; I've included an example using a rational
type).
 - Configurable behavior for out-of-range arguments (exception or NaN)
 - Abstracted rounding-mode control into a separate class to allow
easy adaption to the computing environment.
 - Transcendental functions implemented.

It is available at
http://www.rhein-main.de/people/jmaurer/interval.tar.gz
for testing now, but its final place will be at http://www.boost.org

You may want to adapt the Makefile to suit your C++ compiler and its
options. I've tested the package on gcc 2.95.2, and I hope I've
removed all things which prevented Microsoft Visual C++ 6.0 SP3
from compiling it as well.

If you have any suggestions for improvement, please send them in.
In particular, I feel that the name of the current "dist" function 
is unintuitive.

Originally, I only intended the package to assess rounding errors
in lengthy computations.  Since then, I've learned that there
are other application domains where interval arithmetic is useful,
so I've provided some utility functions for set-like operations,
affine transforms etc. as well.

What is the current preference among the numeric computing community
regarding behavior on out-of-range argument values?  I've read
W. Kahan
's "Lecture Notes on the Status of IEEE Standard 754 for
Binary Floating Point Arithmetic" which seems to imply that
raising exceptions has growing support.  C++ provides language-based
exceptions, but they are not required to be raised for illegal
floating-point operations.

Thank you for your help.

Jens Maurer

From owner-reliable_computing [at] interval [dot] usl.edu  Sat Mar 11 12:05:37 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id MAA11057
	for reliable_computing-outgoing; Sat, 11 Mar 2000 12:05:36 -0600 (CST)
Received: from lsc.nd.edu (lsc.nd.edu [129.74.22.171])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id MAA11052
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sat, 11 Mar 2000 12:05:33 -0600 (CST)
From: jsiek [at] lsc [dot] nd.edu
Received: from philoctetes.lsc.nd.edu (philoctetes.lsc.nd.edu [129.74.48.56])
	by lsc.nd.edu (8.9.3/8.9.2) with ESMTP id NAA27944;
	Sat, 11 Mar 2000 13:05:08 -0500 (EST)
Received: (from jsiek@localhost)
	by philoctetes.lsc.nd.edu (8.9.3/8.9.2) id NAA16414;
	Sat, 11 Mar 2000 13:05:12 -0500 (EST)
Date: Sat, 11 Mar 2000 13:05:12 -0500 (EST)
Message-Id: <200003111805.NAA16414 [at] philoctetes [dot] lsc.nd.edu>
X-Authentication-Warning: philoctetes.lsc.nd.edu: jsiek set sender to Jeremy Siek <jsiek [at] lsc [dot] nd.edu> using -f
MIME-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
To: reliable_computing [at] interval [dot] louisiana.edu
Cc: Jens Maurer <jmaurer [at] menuett [dot] rhein-main.de>
Subject: New C++ Library for Interval Arithmetic
In-Reply-To: <38CA3004.90B342FA [at] menuett [dot] rhein-main.de>
References: <38CA3004.90B342FA [at] menuett [dot] rhein-main.de>
X-Mailer: VM 6.40 under Emacs 19.34.1
Reply-To: Jeremy Siek <jsiek [at] lsc [dot] nd.edu>
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


Jens Maurer writes:
 > >From a software design perspective, I felt that both were inadequate.
 > Most importantly, they are not templated, so they always employ
 > "double" as the underlying type.

The over-arching advantage of this new interval class is that it would
be suitable for acceptance into the C++ standard. The core interface
follows the design principles used for the C++ std::complex class.
This uniform standard interface is particularly important for modern
C++ libraries that use generic programming, and allows intervals to be
used seemlessly in place of other numeric types. In terms of the
functionality and implementation, the class is quite similar to the
existing interval arithematic software that I have seen. The design
goal of this interval class was to take the best features of the
existing software, and package it in an interface that follows C++
stardard guidelines.

The group of C++ experts at www.boost.org (many of whom are on the C++
stardard committee) has reviewed this interval class to ensure that
the interface would be appropriate for standardization. It would be
excellent if the reliable computing community also reviewed this
class, to ensure that the functionality meets your needs, and
that the implementation provides that functionality in a
high-quality manner.

Regards,

Jeremy Siek

----------------------------------------------------------------------
 Jeremy Siek
 Ph.D. Candidate                  email: jsiek [at] engr [dot] sgi.com
 Univ. of Notre Dame         work phone: (650) 933-8724
 and                         cell phone: (415) 377-5814
 C++ Library & Compiler Group       fax: (650) 932-0127
 SGI                                www: http://www.lsc.nd.edu/~jsiek/
----------------------------------------------------------------------


From owner-reliable_computing [at] interval [dot] usl.edu  Sun Mar 12 03:28:29 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id DAA12001
	for reliable_computing-outgoing; Sun, 12 Mar 2000 03:28:28 -0600 (CST)
Received: from into.nit.spb.ru (into.nit.spb.ru [212.193.6.225])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id DAA11996
	for <reliable_computing [at] interval [dot] usl.edu>; Sun, 12 Mar 2000 03:28:24 -0600 (CST)
Received: from slava.UUCP (uucp@localhost)
	by into.nit.spb.ru (8.8.7/8.8.7) with UUCP id MAA01843
	for reliable_computing [at] interval [dot] usl.edu; Sun, 12 Mar 2000 12:29:11 +0300 (MSK)
	(envelope-from slava.nit.spb.su!nest [at] slava [dot] nit.spb.su)
Received: by slava.nit.spb.su (dMail for DOS v1.23, 15Jun94);
          Sun, 12 Mar 2000 12:24:01 +0300
To: reliable_computing [at] interval [dot] usl.edu
Message-Id: <AAn8souGMG [at] slava [dot] nit.spb.su>
Organization: Slava Nesterov
Date: Sun, 12 Mar 2000 12:24:01 +0300 (MSK)
Reply-To: nest [at] into [dot] nit.spb.su
From: "Slava Nesterov" <nest [at] slava [dot] nit.spb.su>
X-Mailer: dMail [Demos Mail for DOS v1.23]
Subject: special issues
Lines: 37
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear colleagues,

As you know a few special issues of the Reliable Computing journal
were published. Some more will be published soon.
These issues are

Vol. 5, issue 1, 1999
Proceedings of Interval'98
Guest editors: Shen Zuhe and Vladik Kreinovich

Vol. 5, issue 3, 1999
Proceedings of the SCAN-98
Guest editor: Tibor Csendes

Vol. 6, issue 1, 2000
Special issue on Reliable Geometric Computations
Guest editors: Helmut Ratschek, Jon G. Rokne

Vol. 6, issue 3, 2000
Special Issue on Applications to Control, Signals
and Systems
Guest editors: Juergen Garloff and Eric Walter

The practice to publish special issues is good accepted
by our readers and Kluwer Academic Publishers as well.
We are going to continue to publish both types of special
issues: ones devoted to different conferences and devoted
to special topics.

I would appreciate any suggestions concerning future special
issues. If anybody has particular proposals and consider
a possibility to be a guest editor of some issue please
contact me directly.

Thank you,
Slava Nesterov



From owner-reliable_computing [at] interval [dot] usl.edu  Sun Mar 12 06:04:53 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id GAA13281
	for reliable_computing-outgoing; Sun, 12 Mar 2000 06:04:53 -0600 (CST)
Received: from argo.bas.bg (root [at] argo [dot] bas.bg [195.96.224.7])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id GAA13276
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 12 Mar 2000 06:04:48 -0600 (CST)
Received: from iph.bio.bas.bg (IDENT:0@bas-bio.lines.bas.bg [195.96.252.58])
	by argo.bas.bg (8.9.3/8.9.3/Debian 8.9.3-6) with ESMTP id OAA16953
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 12 Mar 2000 14:03:57 +0200
X-Authentication-Warning: argo.bas.bg: Host IDENT:0@bas-bio.lines.bas.bg [195.96.252.58] claimed to be iph.bio.bas.bg
Received: from biomath.bio.bas.bg (biomath.bio.bas.bg [195.96.247.160])
	by iph.bio.bas.bg (8.9.3/8.9.3) with SMTP id OAA07087
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 12 Mar 2000 14:04:40 +0200
Message-Id: <200003121204.OAA07087 [at] iph [dot] bio.bas.bg>
Comments: Authenticated sender is <smarkov [at] iph [dot] bio.bas.bg>
From: "Svetoslav Markov" <smarkov [at] iph [dot] bio.bas.bg>
Organization: Institute of Mathematics, BAS
To: reliable_computing [at] interval [dot] louisiana.edu
Date: Sun, 12 Mar 2000 14:07:16 +0200
Subject: RE: "Symmetric" intervals
Reply-to: smarkov [at] iph [dot] bio.bas.bg
Priority: normal
X-mailer: Pegasus Mail for Windows (v2.23)
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Colleagues,

  In my last leter  I made a mistake: please replace "direct product" by
"direct sum".  I attach the corrected text.

==============

Indeed, symmetric intervals are very important and we need simple terminology 
related to such intervals. In relation to the above comment by Bill Older let 
me formulate another  terminological question. A quasilinear space (O.  Mayer,
H. Ratschek, G. Schroeder, etc) is a modification of a linear space abstracting 
interval properties. Algebraic extension (such as the one used for the 
definition of negative numbers) of a quasilinear space turns it into one having 
group structure.  A quasilinear space with group structure is a direct sum
of a linear space and a symmetric quasilinear space with group structure.

This shows that "symmetric quasilinear spaces with group structure"  are
EXTREMELY important and thus deserve a special name!

I shall  highly appreciate any suggestions in relation to this terminological 
question.

==============

Let me add that a symmetric quasilinear space with group structure is a
quasilinear space with group structure consisting of symmetric elements.

More specifically, I would be interested to know if anybody of you  objects 
the short  term "symmetric spaces" for the above mentioned spaces.

The observation that any quasilinear space is a direct product of a linear and 
a symmetric space  is rather simple to prove. One only needs to extend in a 
natural way the term direct sum to quasilinear spaces with group structure.
  Nevertheless, I have  not found  the above  statement in the literature. H. 
Ratschek et al. consider  general quasilinear space, not specifically ones with 
group structure. E.  Kaucher considers the case of group structure but not in 
the setting of quasilinear spaces (addition and multiplication by scalar).
 Am I wrong?

S. Markov
   
  
-- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- +

 Svetoslav Markov

 Section "Biomathematics", Inst. of       phone: +3592-979-3704, +3592-707460,
 Mathematics and Computer Sci.,         fax: +3592-971-3649, 
 Bulgarian Academy of Sciences,         e-mail: smarkov [at] iph [dot] bio.bas.bg
 "Acad. G. Bonchev" st., block 8,       
 BG-1113 Sofia,  BULGARIA               

 home address: 11 Mizia, 1124 Sofia, tel. +3592-444651 
 
 -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- +

From owner-reliable_computing [at] interval [dot] usl.edu  Tue Mar 14 08:29:09 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id IAA17218
	for reliable_computing-outgoing; Tue, 14 Mar 2000 08:29:09 -0600 (CST)
Received: from mscs.mu.edu (studsys.mscs.mu.edu [134.48.4.15])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with SMTP id IAA17213
	for <reliable_computing [at] interval [dot] louisiana.edu>; Tue, 14 Mar 2000 08:29:03 -0600 (CST)
Received: (qmail 17838 invoked from network); 14 Mar 2000 14:28:53 -0000
Received: from ppp107.csd.mu.edu (HELO mscs.mu.edu) (134.48.24.7)
  by studsys.mscs.mu.edu with SMTP; 14 Mar 2000 14:28:53 -0000
Message-ID: <38CE4C73.506C1591 [at] mscs [dot] mu.edu>
Date: Tue, 14 Mar 2000 08:28:04 -0600
From: George Corliss <georgec [at] mscs [dot] mu.edu>
Organization: Marquette University
X-Mailer: Mozilla 4.7 [en] (Win98; U)
X-Accept-Language: en
MIME-Version: 1.0
To: Jens Maurer <jmaurer [at] menuett [dot] rhein-main.de>
CC: reliable_computing [at] interval [dot] louisiana.edu
Subject: Re: New C++ Library for Interval Arithmetic
References: <38CA3004.90B342FA [at] menuett [dot] rhein-main.de>
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Jens Maurer wrote:

> Originally, I only intended the package to assess rounding errors
> in lengthy computations.  Since then, I've learned that there
> are other application domains where interval arithmetic is useful,
> so I've provided some utility functions for set-like operations,
> affine transforms etc. as well.
Much work has been done in this area for 40 years, and
many sophisticated algorithms exist.  There is a major
conference this fall in Karlsruhe, see
http://www.scan2000.de/

> What is the current preference among the numeric computing community
> regarding behavior on out-of-range argument values?  I've read

I would say the interval community is not of a single mind on this.
For the view that there are NO exceptional conditions, see
www.mscs.mu.edu/~globsol/walster-papers.html, especially

<dl>
<dt><i>The Extended Real Interval System,</i>
<dd>G. William (Bill) Walster,
<dd><a href =
"http://www.mscs.mu.edu/~globsol/Papers/extended_intervals.ps"
    >extended_intervals.ps</a>
(Postscript - 295 Kb) 29 April 1998
<dd><a href = "http://www.mscs.mu.edu/~globsol/Papers/ext_int_fig1.ps"
    >Figure 1, page 8</a>
(Postscript - 130 Kb)
<dd><a href =
"http://www.mscs.mu.edu/~globsol/Papers/ext_int_pg38-41.ps"
    >Figures, pages 38 - 42.</a>
(Postscript - 188 Kb)
<blockquote>
<b>Abstract:</b> Three extended real interval systems are defined and
distinguished by their implementation complexity and result sharpness.
The three systems are closed with respect to interval arithmetic and the
enclosure of functions and relations, notwithstanding domain
restrictions
or the presence of singularities.
</blockquote>


<dt><i>Interval Extensions of Real Functions with Finite Domains,</i>
<dd>G. William (Bill) Walster,
<dd><a href =
"http://www.mscs.mu.edu/~globsol/Papers/domain.ps">domain.ps</a>
(Postscript - 84 Kb) 28 April 1998.
<blockquote>
<b>Abstract:</b> Alternatives are considered for constructing interval
enclosures of real functions with finite domains.
</blockquote>

</dl>

<p>
See also <b>Interval compilers and programming
<a href =
"http://www.mscs.mu.edu/~georgec/IFAQ/environments.html">environments</a></b>


This and many other questions posed to this mailing list
are edited and collected into an Interval FAQ at
www.mscs.mu.edu/~georgec/IFAQ


Dr. George F. Corliss
Dept. Math, Stat, Comp Sci
Marquette University
P.O. Box 1881
Milwaukee, WI  53201-1881  USA
georgec [at] mscs [dot] mu.edu; George.Corliss [at] Marquette [dot] edu
http://www.mscs.mu.edu/~georgec/
Office: 414-288-6599;  Dept: 288-7375; Fax: 288-5472

From owner-reliable_computing [at] interval [dot] usl.edu  Tue Mar 14 09:44:44 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id JAA17613
	for reliable_computing-outgoing; Tue, 14 Mar 2000 09:44:43 -0600 (CST)
Received: from automatix.informatik.uni-wuerzburg.de (root [at] wi2x40 [dot] informatik.uni-wuerzburg.de [132.187.10.40])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id JAA17608
	for <reliable_computing [at] interval [dot] louisiana.edu>; Tue, 14 Mar 2000 09:44:40 -0600 (CST)
Received: from informatik.uni-wuerzburg.de (hystrix [132.187.10.44])
	by automatix.informatik.uni-wuerzburg.de (8.8.8/8.8.8) with ESMTP id QAA02649;
	Tue, 14 Mar 2000 16:44:34 +0100
Message-ID: <38CE5E62.E1ABB7F9 [at] informatik [dot] uni-wuerzburg.de>
Date: Tue, 14 Mar 2000 16:44:34 +0100
From: "J.Wolff v. Gudenberg" <wolff [at] informatik [dot] uni-wuerzburg.de>
X-Mailer: Mozilla 4.7 [en] (X11; I; Linux 2.2.13-SMP i686)
X-Accept-Language: en
MIME-Version: 1.0
To: Jens Maurer <jmaurer [at] menuett [dot] rhein-main.de>
CC: reliable_computing [at] interval [dot] louisiana.edu
Subject: Re: New C++ Library for Interval Arithmetic
References: <38CA3004.90B342FA [at] menuett [dot] rhein-main.de> <38CE4C73.506C1591 [at] mscs [dot] mu.edu>
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

We have prepared a very similar C++ library for interval arithmetic.
It will be published in about 4-6 weeks.
It implements all the extensions described in B. Walster's papers cited
below.

For more information see
http://www.imada.sdu.dk/~kornerup/RNC4/papers/p03.ps

J Wolff v Gudenberg






George Corliss wrote:
> 
> Jens Maurer wrote:
> 
> > Originally, I only intended the package to assess rounding errors
> > in lengthy computations.  Since then, I've learned that there
> > are other application domains where interval arithmetic is useful,
> > so I've provided some utility functions for set-like operations,
> > affine transforms etc. as well.
> Much work has been done in this area for 40 years, and
> many sophisticated algorithms exist.  There is a major
> conference this fall in Karlsruhe, see
> http://www.scan2000.de/
> 
> > What is the current preference among the numeric computing community
> > regarding behavior on out-of-range argument values?  I've read
> 
> I would say the interval community is not of a single mind on this.
> For the view that there are NO exceptional conditions, see
> www.mscs.mu.edu/~globsol/walster-papers.html, especially
> 
> <dl>
> <dt><i>The Extended Real Interval System,</i>
> <dd>G. William (Bill) Walster,
> <dd><a href =
> "http://www.mscs.mu.edu/~globsol/Papers/extended_intervals.ps"
>     >extended_intervals.ps</a>
> (Postscript - 295 Kb) 29 April 1998
> <dd><a href = "http://www.mscs.mu.edu/~globsol/Papers/ext_int_fig1.ps"
>     >Figure 1, page 8</a>
> (Postscript - 130 Kb)
> <dd><a href =
> "http://www.mscs.mu.edu/~globsol/Papers/ext_int_pg38-41.ps"
>     >Figures, pages 38 - 42.</a>
> (Postscript - 188 Kb)
> <blockquote>
> <b>Abstract:</b> Three extended real interval systems are defined and
> distinguished by their implementation complexity and result sharpness.
> The three systems are closed with respect to interval arithmetic and the
> enclosure of functions and relations, notwithstanding domain
> restrictions
> or the presence of singularities.
> </blockquote>
> 
> <dt><i>Interval Extensions of Real Functions with Finite Domains,</i>
> <dd>G. William (Bill) Walster,
> <dd><a href =
> "http://www.mscs.mu.edu/~globsol/Papers/domain.ps">domain.ps</a>
> (Postscript - 84 Kb) 28 April 1998.
> <blockquote>
> <b>Abstract:</b> Alternatives are considered for constructing interval
> enclosures of real functions with finite domains.
> </blockquote>
> 
> </dl>
> 
> <p>
> See also <b>Interval compilers and programming
> <a href =
> "http://www.mscs.mu.edu/~georgec/IFAQ/environments.html">environments</a></b>
> 
> This and many other questions posed to this mailing list
> are edited and collected into an Interval FAQ at
> www.mscs.mu.edu/~georgec/IFAQ
> 
> Dr. George F. Corliss
> Dept. Math, Stat, Comp Sci
> Marquette University
> P.O. Box 1881
> Milwaukee, WI  53201-1881  USA
> georgec [at] mscs [dot] mu.edu; George.Corliss [at] Marquette [dot] edu
> http://www.mscs.mu.edu/~georgec/
> Office: 414-288-6599;  Dept: 288-7375; Fax: 288-5472

-- 

                     __o           
                     \<,           
___________________()/ ()__________________

 Prof. Dr. J. Wolff v. Gudenberg 	Lehrstuhl fuer Informatik II
 wolff [at] informatik [dot] uni-wuerzburg.de	Universitaet Wuerzburg
 Tel. 0931 / 888-6602			Am Hubland	
 Fax. 0931 / 888-6603			D-97074 Wuerzburg
 URL  http://www-info2.informatik.uni-wuerzburg.de/staff/wvg
---------------------------------------------

From owner-reliable_computing [at] interval [dot] usl.edu  Tue Mar 14 12:25:36 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id MAA18281
	for reliable_computing-outgoing; Tue, 14 Mar 2000 12:25:36 -0600 (CST)
Received: from relay.rhein-main.de (root [at] hermes [dot] rhein-main.de [195.37.8.6])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id MAA18276
	for <reliable_computing [at] interval [dot] louisiana.edu>; Tue, 14 Mar 2000 12:25:30 -0600 (CST)
Received: from menuett.rhein-main.de (menuett.rhein-main.de [195.37.9.79])
	by relay.rhein-main.de (8.9.3/8.9.3) with ESMTP id TAA10528;
	Tue, 14 Mar 2000 19:18:19 +0100
Message-ID: <38CE8358.FA5AF25F [at] menuett [dot] rhein-main.de>
Date: Tue, 14 Mar 2000 19:22:16 +0100
From: Jens Maurer <jmaurer [at] menuett [dot] rhein-main.de>
X-Mailer: Mozilla 4.7 [en] (X11; I; Linux 2.3.51 i686)
X-Accept-Language: en
MIME-Version: 1.0
To: George Corliss <georgec [at] mscs [dot] mu.edu>
CC: reliable_computing [at] interval [dot] louisiana.edu
Subject: Re: New C++ Library for Interval Arithmetic
References: <38CA3004.90B342FA [at] menuett [dot] rhein-main.de> <38CE4C73.506C1591 [at] mscs [dot] mu.edu>
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


Thank you very much for the helpful comments and documentation
pointers.

Thanks to your comments and after reading some of the papers, I
know that my implementation is lacking.  However, I feel that the
important issue is the interface; after the interface is agreed
upon, the implementation can be repaired easily.

With a common interface where all C++ interval packages agree,
the implementation becomes interchangeable.  This allows for
 - common and peer-reviewed quality tests
 - common and peer-reviewed performance tests
 - common application software
 - formal standardization
 - vendor-provided optimized implementations

I understand that Dmitri Chiriaev and William Walster did exactly
that for a FORTRAN extension.

There are several interval packages in existence, which all have
different interfaces.  This not only concerns function names,
but also semantics.  Let me highlight a few differences which
hamper re-use of application software with different interval
packages:

 - Allowing for different base types (float, double, even a non-builtin
rational type) may sound far-fetched for most interval arithmetic
application domains.  However, there is no mathematical reason to forbid
them, and they can be useful.  For example, if the usual 64 bits of a
"double" (53 bits mantissa) are not enough for some computations, there
may arise the necessity to employ an extended-precision real class from
some other source.  It would be a pity if one had to re-implement
interval arithmetics just to use that "better" real class.

 - We could specify that the FPU rounding mode is undefined after
some interval arithmetic operation, or that it will not be altered,
i.e. rounding mode changes are always local to an operation.  The
latter specification is useful if you mix interval and point
arithmetic, for example.  From a software design perspective, I think
it is inacceptable to have an indeterminate rounding mode after
some interval arithmetic operation, rendering all future built-in
point operations invalid.

 - Behaviour on illegal operations such as sqrt(-1): Throw an exception,
or do your best and continue (see the specification by Dmitri Chiriaev
and William Walster).  From a C++ software design perspective, I think
it is inacceptable to just terminate the program, but on the other
hand, continuing might be inappropriate as well.  That's where C++
exceptions come in handy.

 - Behaviour of overloaded operator< : There is the choice of
certainly-less-than, possibly-less-than and subset-of.

 - From a software design perspective, the use of macros (instead of
template parameters) is not desirable.  I shall check out the
performance disadvantage for templates claimed by Juergen Wolff
von Gudenberg in the paper advertised in his mail.  Frankly, I have
a hard time believing it.

I understand that the decision in some of these items depends on
the application domain, and thus the item should be a configuration
option for the interval class.  It seems important to me to identify
the resulting space of configuration options.

(I'm off to Malta for two weeks, but I will read my mail after I'm
back.)

Jens Maurer.


From owner-reliable_computing [at] interval [dot] usl.edu  Tue Mar 14 16:48:45 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id QAA18990
	for reliable_computing-outgoing; Tue, 14 Mar 2000 16:48:45 -0600 (CST)
Received: from marnier.ucs.usl.edu (root@ucs-gw.usl.edu [130.70.40.2])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id QAA18985
	for <reliable_computing [at] interval [dot] louisiana.edu>; Tue, 14 Mar 2000 16:48:25 -0600 (CST)
Received: from u8174 (rbk5287 [at] goedel [dot] usl.edu [130.70.49.203])
	by marnier.ucs.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.3) with SMTP id QAA16384;
	Tue, 14 Mar 2000 16:47:56 -0600 (CST)
Message-Id: <2.2.32.20000314225128.0074e188 [at] pop [dot] usl.edu>
X-Sender: rbk5287 [at] pop [dot] usl.edu
X-Mailer: Windows Eudora Pro Version 2.2 (32)
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Date: Tue, 14 Mar 2000 16:51:28 -0600
To: Jens Maurer <jmaurer [at] menuett [dot] rhein-main.de>,
        George Corliss <georgec [at] mscs [dot] mu.edu>
From: "R. Baker Kearfott" <rbk [at] louisiana [dot] edu>
Subject: Re: New C++ Library for Interval Arithmetic
Cc: reliable_computing [at] interval [dot] louisiana.edu
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Jens,

Please see my interpolated comments.

R. Baker Kearfott

At 07:22 PM 3/14/00 +0100, Jens Maurer wrote:
>
>Thank you very much for the helpful comments and documentation
>pointers.
>
>Thanks to your comments and after reading some of the papers, I
>know that my implementation is lacking.  However, I feel that the
>important issue is the interface; after the interface is agreed
>upon, the implementation can be repaired easily.
>
>With a common interface where all C++ interval packages agree,
>the implementation becomes interchangeable.  This allows for
> - common and peer-reviewed quality tests
> - common and peer-reviewed performance tests
> - common application software
> - formal standardization
> - vendor-provided optimized implementations
>

Yes, this is a laudable goal.

>I understand that Dmitri Chiriaev and William Walster did exactly
>that for a FORTRAN extension.
>

We almost convinced the Fortran committee of requiring an
intrinsic interval type in the standard.  As a member of those
committees (US X3J3 and international WG5), I organized input 
to the committee for two years.  For about half of this time,
an interval data type was a stated requirement for Fortran 2000.
In the end, some disagreements within the interval community
coupled with resistance on the part of some vendors to a 
technology they perceived as different, untested and with uncertain
demand, killed the requirement.  I have archives from a mailing
list for discussion of the proposed standard.  There are also 
other documents associated with the standardization effort.

The Chiriaev / Walster (and others) implementation within Sun's
Fortran compiler benefits from the standardization effort, but
goes beyond it in several ways.  Most importantly, Walster et al
have put effort into considering intervals resulting from
operations such as [1,2] / [-1,1] or SQRT([-1,1]) to develop
an exception-free system (using infinities for end points).  

Precursors to the standardization effort are Walster's early
library INTLIB, a library for an intrinsic Fortran data type 
for the Minnesota M77 compiler for CYBER 175 machines, and
my Fortran 90 module INTERVAL_ARITHMETIC (ACM TOMS Algorithm 763).  
(My module uses the FORTRAN 77 module INTLIB, although it is
unrelated to Walster's work;  I was unaware that Bill had named
his library INTLIB when I developed my INTLIB.)

Wolfgang Walter II has also been a player in the standardization
process for intervals, especially as head of the German delegation
to the international committee.  He also developed a module that
partially implements the proposed standard of the time.

I am hoping that we will all examine Sun's Fortran compiler.  We
may or may not agree with precise details, but, in any case, it 
represents  a milestone from which we can start, if we perceive 
we need to go further.  We should send our comments, suggestions, 
and criticism either here or to a support mailing list at 

sun-interval-fortran-questions [at] interval [dot] louisiana.edu

>There are several interval packages in existence, which all have
>different interfaces.  This not only concerns function names,
>but also semantics.  Let me highlight a few differences which
>hamper re-use of application software with different interval
>packages:
>
> - Allowing for different base types (float, double, even a non-builtin
>rational type) may sound far-fetched for most interval arithmetic
>application domains.  However, there is no mathematical reason to forbid
>them, and they can be useful.  For example, if the usual 64 bits of a
>"double" (53 bits mantissa) are not enough for some computations, there
>may arise the necessity to employ an extended-precision real class from
>some other source.  It would be a pity if one had to re-implement
>interval arithmetics just to use that "better" real class.
>

Yes, I agree with the above.  Also, I presently don't see any 
strong objections with allowing different base types.

> - We could specify that the FPU rounding mode is undefined after
>some interval arithmetic operation, or that it will not be altered,
>i.e. rounding mode changes are always local to an operation.  The
>latter specification is useful if you mix interval and point
>arithmetic, for example.  From a software design perspective, I think
>it is inacceptable to have an indeterminate rounding mode after
>some interval arithmetic operation, rendering all future built-in
>point operations invalid.
>

Yes, specifying "undefined" allows some wiggle-room.  In particular,
different computer architectures switch rounding modes in different
ways.  Interval arithmetic can be efficiently implemented with
just a single rounding mode (either "round-down" or "round-up");
that, I think, is an efficient option for most architectures.  Otherwise,
the best architecture for doing a sequence of unrelated computations
interspersed with floating-point computations appears to be 
associating the rounding mode with the operation itself, rather
than with a flag that is switched in the FPU.  

If the architecture
is unknown, specifying that the rounding mode is "undefined" after
an operation lets the interval operations be efficient, but may
cause inefficiencies later due to having to change the rounding
mode back to a desired value.

> - Behaviour on illegal operations such as sqrt(-1): Throw an exception,
>or do your best and continue (see the specification by Dmitri Chiriaev
>and William Walster).  From a C++ software design perspective, I think
>it is inacceptable to just terminate the program, but on the other
>hand, continuing might be inappropriate as well.  That's where C++
>exceptions come in handy.
>

The above has been the subject of some controversy.  My perception
is that, in some contexts, you will want to throw an exception,
and, in others, you will want to continue.  

Fortran does not have
user-defined exceptions.  The reasons, as I understand them,
include efficiency.  Fortran is a very good array-processing language,
and there are major questions about what to do if an exception
occurs in a component while an array operation is executing on
an advanced-architecture machine.

> - Behaviour of overloaded operator< : There is the choice of
>certainly-less-than, possibly-less-than and subset-of.
>

My reading is that the most commonly used meaning is 
"certainly less than", although others may disagree :-)  In my
view, the important thing is that non-interval-experts using
interval arithmetic understand the distinction.

> - From a software design perspective, the use of macros (instead of
>template parameters) is not desirable.  I shall check out the
>performance disadvantage for templates claimed by Juergen Wolff
>von Gudenberg in the paper advertised in his mail.  Frankly, I have
>a hard time believing it.
>

Can we race J{\"u}rgen's package and yours under similar conditions?

By the way, in developing template-like features in Fortran 200x,
a consideration of the standardization committee was "avoiding
performance hits as you see in C++".

>I understand that the decision in some of these items depends on
>the application domain, and thus the item should be a configuration
>option for the interval class.  It seems important to me to identify
>the resulting space of configuration options.
>

Yes, I fully agree with the above.

>(I'm off to Malta for two weeks, but I will read my mail after I'm
>back.)

Best wishes.  Also, if this turns out to be a provocative topic, I 
hope your mailbox has enough space :-)

>
>Jens Maurer.
>
>
---------------------------------------------------------------
R. Baker Kearfott,    rbk [at] louisiana [dot] edu   (337) 482-5346 (fax)
(337) 482-5270 (work)                     (337) 981-9744 (home)
URL: http://interval.louisiana.edu/kearfott.html
Department of Mathematics, University of Louisiana at Lafayette
Box 4-1010, Lafayette, LA 70504-1010, USA
---------------------------------------------------------------


From owner-reliable_computing [at] interval [dot] usl.edu  Tue Mar 14 17:47:46 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id RAA19466
	for reliable_computing-outgoing; Tue, 14 Mar 2000 17:47:46 -0600 (CST)
Received: from mercury.Sun.COM (mercury.Sun.COM [192.9.25.1])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id RAA19461
	for <reliable_computing [at] interval [dot] louisiana.edu>; Tue, 14 Mar 2000 17:47:42 -0600 (CST)
Received: from engmail3.Eng.Sun.COM ([129.144.170.5])
	by mercury.Sun.COM (8.9.3+Sun/8.9.3) with ESMTP id PAA12963;
	Tue, 14 Mar 2000 15:46:34 -0800 (PST)
Received: from ha-sims.eng.sun.com (phys-thestorka.Eng.Sun.COM [129.146.1.231])
	by engmail3.Eng.Sun.COM (8.9.1b+Sun/8.9.1/ENSMAIL,v1.6) with ESMTP id PAA05381;
	Tue, 14 Mar 2000 15:46:33 -0800 (PST)
Received: from gww (gww.Eng.Sun.COM [129.146.78.116])
 by ha-sims.eng.sun.com (Sun Internet Mail Server sims.4.0.1999.06.13.00.20)
 with SMTP id <0FRF00M7QRDK80@ha-sims.eng.sun.com>; Tue,
 14 Mar 2000 15:46:32 -0800 (PST)
Date: Tue, 14 Mar 2000 15:46:33 -0800 (PST)
From: William Walster <bill.walster [at] eng [dot] sun.com>
Subject: Re: New C++ Library for Interval Arithmetic
To: jmaurer [at] menuett [dot] rhein-main.de, georgec [at] mscs [dot] mu.edu, rbk [at] louisiana [dot] edu
Cc: reliable_computing [at] interval [dot] louisiana.edu
Reply-to: William Walster <bill.walster [at] eng [dot] sun.com>
Message-id: <0FRF00M7RRDK80@ha-sims.eng.sun.com>
MIME-version: 1.0
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4m sparc
Content-type: TEXT/plain; charset=us-ascii
Content-MD5: r9EIGs7beV9X6qUrbrvLrw==
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


  >Date: Tue, 14 Mar 2000 16:51:28 -0600
  >From: "R. Baker Kearfott" <rbk [at] louisiana [dot] edu>
  >Subject: Re: New C++ Library for Interval Arithmetic
  >X-Sender: rbk5287 [at] pop [dot] usl.edu
  >To: Jens Maurer <jmaurer [at] menuett [dot] rhein-main.de>, George Corliss <georgec [at] mscs [dot] mu.edu>
  >Cc: reliable_computing [at] interval [dot] louisiana.edu
  >MIME-version: 1.0
  >
  >Jens,
  >
  >Please see my interpolated comments.
  >
  >R. Baker Kearfott
  >
  >At 07:22 PM 3/14/00 +0100, Jens Maurer wrote:
  >>
  >>Thank you very much for the helpful comments and documentation
  >>pointers.
  >>
  >>Thanks to your comments and after reading some of the papers, I
  >>know that my implementation is lacking.  However, I feel that the
  >>important issue is the interface; after the interface is agreed
  >>upon, the implementation can be repaired easily.
  >>
  >>With a common interface where all C++ interval packages agree,
  >>the implementation becomes interchangeable.  This allows for
  >> - common and peer-reviewed quality tests
  >> - common and peer-reviewed performance tests
  >> - common application software
  >> - formal standardization
  >> - vendor-provided optimized implementations
  >>
  >
  >Yes, this is a laudable goal.
  >
  >>I understand that Dmitri Chiriaev and William Walster did exactly
  >>that for a FORTRAN extension.
  >>
  >
  >We almost convinced the Fortran committee of requiring an
  >intrinsic interval type in the standard.  As a member of those
  >committees (US X3J3 and international WG5), I organized input 
  >to the committee for two years.  For about half of this time,
  >an interval data type was a stated requirement for Fortran 2000.
  >In the end, some disagreements within the interval community
  >coupled with resistance on the part of some vendors to a 
  >technology they perceived as different, untested and with uncertain
  >demand, killed the requirement.  I have archives from a mailing
  >list for discussion of the proposed standard.  There are also 
  >other documents associated with the standardization effort.
  >
  >The Chiriaev / Walster (and others) implementation within Sun's
  >Fortran compiler benefits from the standardization effort, but
  >goes beyond it in several ways.  Most importantly, Walster et al
  >have put effort into considering intervals resulting from
  >operations such as [1,2] / [-1,1] or SQRT([-1,1]) to develop
  >an exception-free system (using infinities for end points).  
  >
  >Precursors to the standardization effort are Walster's early
  >library INTLIB, a library for an intrinsic Fortran data type 
  >for the Minnesota M77 compiler for CYBER 175 machines, and
  >my Fortran 90 module INTERVAL_ARITHMETIC (ACM TOMS Algorithm 763).  
  >(My module uses the FORTRAN 77 module INTLIB, although it is
  >unrelated to Walster's work;  I was unaware that Bill had named
  >his library INTLIB when I developed my INTLIB.)
  >
  >Wolfgang Walter II has also been a player in the standardization
  >process for intervals, especially as head of the German delegation
  >to the international committee.  He also developed a module that
  >partially implements the proposed standard of the time.
  >
  >I am hoping that we will all examine Sun's Fortran compiler.  We
  >may or may not agree with precise details, but, in any case, it 
  >represents  a milestone from which we can start, if we perceive 
  >we need to go further.  We should send our comments, suggestions, 
  >and criticism either here or to a support mailing list at 
  >
  >sun-interval-fortran-questions [at] interval [dot] louisiana.edu
  
For sure, our soon to be released compiler has benefitted from the 
helpful work, comments and suggestions of many people, including 
Baker and those he listed, above.  We hope the above mailing list
will be actively used as a forum for getting questions answered and
to express positive and negative comments.

  >
  >>There are several interval packages in existence, which all have
  >>different interfaces.  This not only concerns function names,
  >>but also semantics.  Let me highlight a few differences which
  >>hamper re-use of application software with different interval
  >>packages:
  >>
  >> - Allowing for different base types (float, double, even a non-builtin
  >>rational type) may sound far-fetched for most interval arithmetic
  >>application domains.  However, there is no mathematical reason to forbid
  >>them, and they can be useful.  For example, if the usual 64 bits of a
  >>"double" (53 bits mantissa) are not enough for some computations, there
  >>may arise the necessity to employ an extended-precision real class from
  >>some other source.  It would be a pity if one had to re-implement
  >>interval arithmetics just to use that "better" real class.
  >>
  >
  >Yes, I agree with the above.  Also, I presently don't see any 
  >strong objections with allowing different base types.
  >
  >> - We could specify that the FPU rounding mode is undefined after
  >>some interval arithmetic operation, or that it will not be altered,
  >>i.e. rounding mode changes are always local to an operation.  The
  >>latter specification is useful if you mix interval and point
  >>arithmetic, for example.  From a software design perspective, I think
  >>it is inacceptable to have an indeterminate rounding mode after
  >>some interval arithmetic operation, rendering all future built-in
  >>point operations invalid.
  >>
  >
  >Yes, specifying "undefined" allows some wiggle-room.  In particular,
  >different computer architectures switch rounding modes in different
  >ways.  Interval arithmetic can be efficiently implemented with
  >just a single rounding mode (either "round-down" or "round-up");
  >that, I think, is an efficient option for most architectures.  Otherwise,
  >the best architecture for doing a sequence of unrelated computations
  >interspersed with floating-point computations appears to be 
  >associating the rounding mode with the operation itself, rather
  >than with a flag that is switched in the FPU.  
  >
  >If the architecture
  >is unknown, specifying that the rounding mode is "undefined" after
  >an operation lets the interval operations be efficient, but may
  >cause inefficiencies later due to having to change the rounding
  >mode back to a desired value.
  
In our f95 implementation we guarantee that intervals do not produce any
side effects on non-interval code.  In particular, we "logically" restore the 
rounding mode after every interval operation.

  >
  >> - Behaviour on illegal operations such as sqrt(-1): Throw an exception,
  >>or do your best and continue (see the specification by Dmitri Chiriaev
  >>and William Walster).  From a C++ software design perspective, I think
  >>it is inacceptable to just terminate the program, but on the other
  >>hand, continuing might be inappropriate as well.  That's where C++
  >>exceptions come in handy.
  >>
  >
  >The above has been the subject of some controversy.  My perception
  >is that, in some contexts, you will want to throw an exception,
  >and, in others, you will want to continue.  
  >
  >Fortran does not have
  >user-defined exceptions.  The reasons, as I understand them,
  >include efficiency.  Fortran is a very good array-processing language,
  >and there are major questions about what to do if an exception
  >occurs in a component while an array operation is executing on
  >an advanced-architecture machine.
  
The system we have implemented in f95 is set-based.  The result of an operation
or function evaluated at a point that is outside the closure of its domain is
the empty set, or empty interval.  Depending on the context, an empty result of
an arithmetic operation or function evaluation may or may not indicate that 
an error has been made.  

An exception-like feature is needed to provide a test for expression
continuity, which is an assumption for the interval Newton algorithm and the
Brouwer fixed-point theorem.  This will only be needed in special circumstances
and therefore needs to be invokable only when required.

  >
  >> - Behaviour of overloaded operator< : There is the choice of
  >>certainly-less-than, possibly-less-than and subset-of.
  >>
  >
  >My reading is that the most commonly used meaning is 
  >"certainly less than", although others may disagree :-)  In my
  >view, the important thing is that non-interval-experts using
  >interval arithmetic understand the distinction.
  
The most important practical application for this syntactic sugar I have
uncovered is to make it easy to construct "complete" sets of relational
statements.  This is important to avoid hiding an empty result that
could be the indication of an error condition.

Otherwise, depending on the application, one or the other sense of
relational operator may be what makes the most sense in the particular
context.

  >
  >> - From a software design perspective, the use of macros (instead of
  >>template parameters) is not desirable.  I shall check out the
  >>performance disadvantage for templates claimed by Juergen Wolff
  >>von Gudenberg in the paper advertised in his mail.  Frankly, I have
  >>a hard time believing it.
  >>
  >
  >Can we race J{\"u}rgen's package and yours under similar conditions?
  >
  >By the way, in developing template-like features in Fortran 200x,
  >a consideration of the standardization committee was "avoiding
  >performance hits as you see in C++".
  >
  >>I understand that the decision in some of these items depends on
  >>the application domain, and thus the item should be a configuration
  >>option for the interval class.  It seems important to me to identify
  >>the resulting space of configuration options.
  >>
  >
  >Yes, I fully agree with the above.
  >
  >>(I'm off to Malta for two weeks, but I will read my mail after I'm
  >>back.)
  >
  >Best wishes.  Also, if this turns out to be a provocative topic, I 
  >hope your mailbox has enough space :-)
  >
  >>
  >>Jens Maurer.
  >>
  >>
  >---------------------------------------------------------------
  >R. Baker Kearfott,    rbk [at] louisiana [dot] edu   (337) 482-5346 (fax)
  >(337) 482-5270 (work)                     (337) 981-9744 (home)
  >URL: http://interval.louisiana.edu/kearfott.html
  >Department of Mathematics, University of Louisiana at Lafayette
  >Box 4-1010, Lafayette, LA 70504-1010, USA
  >---------------------------------------------------------------
  >


From owner-reliable_computing [at] interval [dot] usl.edu  Thu Mar 16 14:25:36 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id OAA24609
	for reliable_computing-outgoing; Thu, 16 Mar 2000 14:25:36 -0600 (CST)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id OAA24604
	for <reliable_computing [at] interval [dot] usl.edu>; Thu, 16 Mar 2000 14:25:17 -0600 (CST)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.9.3+Sun/8.9.1) with SMTP id NAA28842;
	Thu, 16 Mar 2000 13:24:54 -0700 (MST)
Message-Id: <200003162024.NAA28842 [at] cs [dot] utep.edu>
Date: Thu, 16 Mar 2000 13:24:55 -0700 (MST)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: Submitting Abstracts to scan2000/Interval2000
To: reliable_computing [at] interval [dot] usl.edu, interval [at] cs [dot] utep.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: rleg6A4Al0zeVL2rzXgq2w==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

FYI. Apologies if you received multiple copies. 

------------- Begin Forwarded Message -------------

To: list [at] scan2000 [dot] de
Subject: Submitting Abstracts to scan2000/Interval2000
Date: Thu, 16 Mar 2000 18:21:57 +0100


please notice that we have postponed the deadline for
the submission of abstracts to the scan2000/Interval2000
conference from March 31, 2000 to

>>>                April 30, 2000                 <<<

Since we plan to provide an online 'book of abstracts'
it would help us very much if you send your abstract
electronically to mailto:abstracts [at] scan2000 [dot] de instead
of sending a hardcopy which we would have to type. Our
preferred format is LaTeX or plain (ASCII) text.
However, you can also use MSWord.
Please refer to http://www.scan2000.de/abstracts.html
for examples and further informations.

...


         Axel Facius
  (scan/Interval OrgaTeam)

------------- End Forwarded Message -------------



From owner-reliable_computing [at] interval [dot] usl.edu  Sat Mar 18 02:34:05 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id CAA27673
	for reliable_computing-outgoing; Sat, 18 Mar 2000 02:34:05 -0600 (CST)
Received: from into.nit.spb.ru (into.nit.spb.ru [212.193.6.225])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id CAA27668
	for <reliable_computing [at] interval [dot] usl.edu>; Sat, 18 Mar 2000 02:33:47 -0600 (CST)
Received: from slava.UUCP (uucp@localhost)
	by into.nit.spb.ru (8.8.7/8.8.7) with UUCP id LAA21579
	for reliable_computing [at] interval [dot] usl.edu; Sat, 18 Mar 2000 11:34:09 +0300 (MSK)
	(envelope-from slava.nit.spb.su!nest [at] slava [dot] nit.spb.su)
Received: by slava.nit.spb.su (dMail for DOS v1.23, 15Jun94);
          Sat, 18 Mar 2000 11:25:52 +0300
To: reliable_computing [at] interval [dot] usl.edu
Message-Id: <AAGspquSRI [at] slava [dot] nit.spb.su>
Organization: Slava Nesterov
Date: Sat, 18 Mar 2000 11:25:52 +0300 (MSK)
Reply-To: nest [at] into [dot] nit.spb.su
From: "Slava Nesterov" <nest [at] slava [dot] nit.spb.su>
X-Mailer: dMail [Demos Mail for DOS v1.23]
Subject: Reliable Computing, issue 3 , 2000
Lines: 37
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

            Reliable Computing
            Volume 6, Issue 3, 2000

Special Issue on Applications to Control, Signals and Systems
Guest Editors: J"urgen Garloff and 'Eric Walter

Foreword
229-230

Composite Interval Control Systems: Some Strong
Kharitonov-Like Properties
Long  Wang
231-246


Nonconvex Polygon Interval Arithmetic  as a Tool for the Analysis and
Design of Robust Control Systems
Yuzo Ohta
247-279

Analysis of the Robustness of Predictive Controllers via Modal Intervals
Josep Veh'i, Jos'e Rodellar, Miguel Sainz, Joaquim Armengol
281-301

Application of Bernstein Expansion to the Solution of Control Problems
J"urgen Garloff
303-320

Interval Methods for Sinusoidal Parameter Estimation:  A Comparative
Analysis
William W. Edmonson, Wen H. Lee, John M. M. Anderson
321-336

Robust Autonomous Robot Localization Using Interval Analysis
Michel Kieffer, Luc Jaulin, 'Eric Walter, Dominique Meizel
337-361



From owner-reliable_computing [at] interval [dot] usl.edu  Sun Mar 19 23:32:17 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id XAA00610
	for reliable_computing-outgoing; Sun, 19 Mar 2000 23:32:17 -0600 (CST)
Received: from bologna.vision.caltech.edu (bologna.vision.caltech.edu [131.215.163.1])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id XAA00605
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 19 Mar 2000 23:31:58 -0600 (CST)
Received: from modena.vision.caltech.edu (modena.vision.caltech.edu [131.215.163.56])
	by bologna.vision.caltech.edu (8.9.3/8.9.3) with ESMTP id VAA08832
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 19 Mar 2000 21:29:54 -0800 (PST)
Received: (from arrigo@localhost)
	by modena.vision.caltech.edu (8.9.3+Sun/8.9.1) id VAA01224;
	Sun, 19 Mar 2000 21:31:30 -0800 (PST)
Date: Sun, 19 Mar 2000 21:31:30 -0800 (PST)
Message-Id: <200003200531.VAA01224 [at] modena [dot] vision.caltech.edu>
X-Authentication-Warning: modena.vision.caltech.edu: arrigo set sender to arrigo [at] vision [dot] caltech.edu using -f
From: Arrigo Benedetti <arrigo [at] vision [dot] caltech.edu>
To: reliable_computing [at] interval [dot] louisiana.edu
Subject: Looking for multi-interval references and software
Reply-to: arrigo [at] vision [dot] caltech.edu
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear interval researchers,

I am looking for references to multi-interval arithmetic and
associated software libraries. The only tool that I have found so far
which supports multi-interval arithmetic is the Interval Solver and
InC++ Libraries from Delisoft.
Is anyone aware of freely available libraries implementing such
arithmetic? The reason why I'm interested in multi-intervals is
because I think that they could be useful to keep track of both the
number of bits and the position of the decimal point in fixed points
calculations found in digital signal processing algorithms.
Any pointer to this kind of applications is also welcome.

Best regards,

-Arrigo Benedetti
--
Dr. Arrigo Benedetti                e-mail: arrigo [at] vision [dot] caltech.edu
Caltech, MS 136-93	  			phone: (626) 395-3695
Pasadena, CA 91125	  			fax:   (626) 795-8649

From owner-reliable_computing [at] interval [dot] usl.edu  Mon Mar 20 04:42:17 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id EAA02024
	for reliable_computing-outgoing; Mon, 20 Mar 2000 04:42:17 -0600 (CST)
Received: from argo.bas.bg (root [at] argo [dot] bas.bg [195.96.224.7])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id EAA02019
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 20 Mar 2000 04:41:38 -0600 (CST)
Received: from iph.bio.bas.bg (IDENT:0@bas-bio.lines.bas.bg [195.96.252.58])
	by argo.bas.bg (8.9.3/8.9.3/Debian 8.9.3-6) with ESMTP id MAA05292;
	Mon, 20 Mar 2000 12:40:34 +0200
X-Authentication-Warning: argo.bas.bg: Host IDENT:0@bas-bio.lines.bas.bg [195.96.252.58] claimed to be iph.bio.bas.bg
Received: from biomath2.bio.bas.bg (biomath2.bio.bas.bg [195.96.247.143])
	by iph.bio.bas.bg (8.9.3/8.9.3) with SMTP id MAA06007;
	Mon, 20 Mar 2000 12:41:51 +0200
Message-Id: <200003201041.MAA06007 [at] iph [dot] bio.bas.bg>
Comments: Authenticated sender is <epopova@iph>
From: "Evgenija Popova" <epopova [at] iph [dot] bio.bas.bg>
Organization: Institute of Mathematics, BAS
To: Arrigo Benedetti <arrigo [at] vision [dot] caltech.edu>,
        reliable_computing [at] interval [dot] louisiana.edu
Date: Mon, 20 Mar 2000 12:31:19 +0200
Subject: Re: Looking for multi-interval references and software
Reply-to: epopova [at] iph [dot] bio.bas.bg
Priority: normal
X-mailer: Pegasus Mail for Windows (v2.32a)
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

The computer algebra system Mathematica supports multi-intervals
and multi-precision interval arithmetic in the kernel.

E. Popova
 
-----------------------------------------------------------------------
Inst.of Mathematics & Informatics     Phone: (+359 2) 979-3704 (office)
Bulgarian Academy of Sciences                (+359 2) 989-9408 (home)
Acad. G. Bonchev str., Block 8          Fax: (+359 2) 971-3649
BG-1113 Sofia, Bulgaria              E-mail: epopova [at] iph [dot] bio.bas.bg
                                             epopova [at] bas [dot] bg
-----------------------------------------------------------------------

From owner-reliable_computing [at] interval [dot] usl.edu  Mon Mar 20 09:24:57 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id JAA02569
	for reliable_computing-outgoing; Mon, 20 Mar 2000 09:24:57 -0600 (CST)
Received: from recife.di.ufpe.br (recife.di.ufpe.br [150.161.2.1])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id JAA02564
	for <reliable_computing [at] interval [dot] usl.edu>; Mon, 20 Mar 2000 09:24:31 -0600 (CST)
Received: from limoeiro.diufpe (limoeiro [150.161.2.69])
	by recife.di.ufpe.br (8.9.3+Sun/8.9.3) with ESMTP id MAA13849;
	Mon, 20 Mar 2000 12:23:37 -0300 (EST)
Received: (from vk@localhost)
	by limoeiro.diufpe (8.9.1b+Sun/8.9.1) id MAA02480;
	Mon, 20 Mar 2000 12:23:37 -0300 (EST)
Date: Mon, 20 Mar 2000 12:23:37 -0300 (EST)
From: Vladik Kreinovich <vk [at] di [dot] ufpe.br>
X-Sender: vk@limoeiro
To: reliable_computing [at] interval [dot] usl.edu
cc: Marcilia Andrade Campos <mac [at] di [dot] ufpe.br>,
        Antonio Carlos da Rocha Costa <acrc [at] di [dot] ufpe.br>
Subject: electronic journal: an idea
Message-ID: <Pine.GSO.3.95.1000320122038.490A-100000@limoeiro>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear Friends,

We need your advise and help.

IDEA: LAUNCHING AN ELECTRONIC JOURNAL

I am currently visiting with Marcilia Campos in Recife, Brazil. 

Marcilia, together with Rocha Costa and Gracaliz (two 
Brazilian researchers who are also currently visiting Recife),
and with several other reseachers from Brazil, 
have an idea of starting an electronic
journal on mathematics of computation, which will have a strong
emphasis on interval computations and related issues. 

We discussed this idea with Ruy Queiroz,
who is one of the founders of a very successful international
electronic journal on logic IGPL. Ruy emphasized that the success of
his journal was due to the fact that the very idea of the journal and
all the changes and decisions were made by a strong consensus among
the logic community, a community which strongly supported the journal and
continues to support it now. 

Following Ruy's advise, we are therefore seeking advise and help from
the interval community. In this following part of this message, I will
describe how I understand the idea. We want the community's opinion on:
* whether launching this journal as an international journal 
  is a good idea at all (see details below), and 
* whether the
  specific implementation that we have in mind is the best or any other
  ideas will serve the community better. 

Please take into consideration that right now, I mainly act as a
communicator, I did not participate in the launching of this journal,
it was all done by the Brazilian team (Siegfried Rump also helped by 
submitting his paper to the preliminary Issue 0). 

This email was discussed by the current editors. 

I myself am
staying here during my spring break, and I will be glad to help
facilitate communications. 

First, the need for the journal as we see it. 

There are several main goals which this journal is intended to
achieve.

WHY SUCH A JOURNAL CAN BENEFIT THE INTERNATIONAL INTERVAL COMMUNITY

Several of these goals are related to the success of Reliable
Computing. We may be not yet a commercial success in the sense that
the number of paying subscribers is still low, but to a large extent,
we are a scientific success in the sense that we already have a lot of
good papers published, accepted, and submitted to the journal. 
Due to this scientific success, there are two problems:
* the lag between submitting and publishing a paper is growing, and
* long survey papers have to wait even longer for a space.

Similar problems caused Ruy and Dov Gabbay to launch the IGPL Bulletin
several years ago, as a journal intended mainly for short
communications and long surveys (in the style, e.g., of Bulletin of
American Mathematical Society).

We are therefore proposing that this electronic journal serve as a
publication venue mainly for two types of papers:

* Short communications of the results, which the authors want to
  publish fast. The word "fast" is where the community's support is
  important. We do not want to create a competitor for Reliable
  Computing. We are not yet at the stage where we can afford two good
  journals, even RC is still struggling financially. However, it may
  often be a good idea to first publish a short result, and then work on a
  longer version that will be published later in RC. This arrangement
  may sound unusual for mathematical community, but in Computer Science
  and Artificial Intelligence, a similar arrangement is normal: 
  * first, a paper is submitted to one of the major conferences, where
    a short paper is refereed and published fast, and then 
  * a longer paper is sent to the journal like Theoretical Computer
    Science or Artificial Intelligence. 
  A similar arrangement exists:
  *  in physics, where a publication, say,
     in Phys. Rev. Letters is usually followed by a slower but longer one,
     and 
  *  to some extent, 
     in mathematics, where a short research report in Bulletin of AMS
     is often followed by a longer paper published elsewhere. 

  One important sources of such short communications is
  conferences. We can ask the authors for 2-4 page extended abstracts,
  and make a selection based on refereeing these abstracts (like people
  in Computer Science do). 

  Conference proceedings published before the conference will form one
  type of special issues. There can be other types, e.g., regional
  issues which highlight the results of one regional group. 

* The second type of papers are surveys. Again, since for the
  electronic journal, there is no limitation on the size, we can publish
  long surveys fast. 

The paper published in the electronic journal should be refereed, so
it is a serious publication, and if this paper is later enlarged and
sent to RC or any other journal, RC will get an additional advantage
that the paper has already been improved:
* by following the advise of
  the referees of the original paper, and 
* by the comments which the
  readers of the electronic journal paper will give to the authors.

In addition to these two types of refereed papers, we can have other
things in the electronic journal:
* non-refereed papers which are published at the discretion of the
  editors as preliminary results for discussion; there should be a
  clearly marked section consisting of such papers;
* information on on-going projects;
* short descriptions of theses and dissertations (this is done in many
  fast-publication journals such as Bulletin of the European
  Association for Theoretical Computer Science);
* announcements of upcoming conferences and other events of interest
  to the community. 

Ruy's experience shows that many people have trouble downloading
papers posted in different formats, especially in the beginning, so it
is very important to have a hardcopy version in addition to the
electronic one. The hardcopy version shall be sent to those who
request it for a nominal fee which covers the cost of printing the
files, mailing the texts, etc. 

The hardcopy version will also serve the needs of the students who
would like to show copies of their published papers to the places
where they interview, etc. 

WHY THIS JOURNAL WOULD BENEFIT BRAZILIAN RESEARCH COMMUNITY

The above were the reason why this journal may be of value to the
international interval community. There are also several reasons why
Brazilian people launch it in the first place. They are very
enthusiastic about interval computations and related issues, and they
believe that if Brazil will be the launching pad of this new
electronic journal, it will boost interval research in Brazil the same
way as launching the original Interval Computations journal boosted
interval research in Russia. 

The 1996 conference did boost interval research in Brazil, and it is
not a bad idea to add the additional boost. 

More specifically,
* The journal will inevitably have a strong Brazilian participation,
  which will add visibility to Brazilian research. 
  * The editors are planning several special issues, some of which 
    will be devoted exclusively to Brazilian
    research.
  * The editors also plan to actively solicit papers from local
    people. 
  
  This will highlight the Brazilian results for the international
  community, and hopefully also boost international collaboration (this
  is the reason why I am here: USA's National Science Foundation and its
  Brazilian counterpart have a joint research program, and collaboration
  with other countries is welcomed by the Brazilian research foundation,
  because there is a feeling that there is not enough collaboration right
  now).

* Second, students and researchers will be encouraged to submit papers
  to the electronic journal. The good thing about Brazilian education
  is that every thesis or dissertation has to have an abstract in
  English, and many are written in English. 

* Third, researchers and students from all Brazilian universities (even
  those which are not subscribed to RC) will get some information about
  intervals (this works for other developing countries as well). 

PLEASE HAVE A LOOK

The preliminary version of the first issue is posted on
http://gmc.ucpel.tche.br/bejmc

Warning: Some ps files do not seem to work well with Netscape,
we are working on it.

Also, we had an argument about whether links should be highlighted
(right now they are not), we are undecided on which is the better way.

Overall, however, most papers are readable, and we will
appreciate any suggestions about the layout. 

TWO OPTIONS: INTERNATIONAL OR REGIONAL E-JOURNAL

Overall, there are two main options:
* If the community agrees that this is a good idea, we can make it an
  international electronic journal; in this case, the title should
  probably be changed to make everyone understand that this is a
  Brazil-published international journal. 

  One possible change is to delete the word "Brazilian" from the
  title, and add a second title which is the same but 
  Portuguese, thus making everyone understand that
  this is a Brazilian-published international journal. 
* On the other hand, if the general feeling of the community is that
  we are not yet ready for a truly international electronic journal, we
  can then launch a Brazilian journal, which will mainly take papers
  from Brazilian researchers but which will welcome papers from the
  international community as well. It may eventually grow into a truly
  international electronic journal when the conditions become ripe.

  Meanwhile, it will be one more English-language journal publishing
  results in interval computations. 

CONCLUSION: WE NEED YOUR ADVISE

We need your suggestions and your advise. 

WHERE TO SEND REPLIES

I am here until Friday, and Gracaliz and Rocha Costa are leaving
Thursday, so if you send your replies before that, we will be able to
react collectively and fast. 

I am using a new interface with which I am not very familiar (I guess it
is a version of XWindows), so please send your replies to this email,
and also, just in case, 
to my regular email address vladik [at] cs [dot] utep.edu, and to Marcilia at
mac [at] di [dot] upfe.br.

Yours sincerely

Vladik


						       


From owner-reliable_computing [at] interval [dot] usl.edu  Tue Mar 21 20:51:19 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id UAA08023
	for reliable_computing-outgoing; Tue, 21 Mar 2000 20:51:19 -0600 (CST)
Received: from kleene.math.wisc.edu (kleene.math.wisc.edu [144.92.166.90])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id UAA08018
	for <reliable_computing [at] interval [dot] louisiana.edu>; Tue, 21 Mar 2000 20:51:08 -0600 (CST)
Received: from bing.math.wisc.edu (bing.math.wisc.edu [144.92.166.133])
	by kleene.math.wisc.edu (8.9.3/8.9.3) with SMTP id UAA21173;
	Tue, 21 Mar 2000 20:43:18 -0600 (CST)
Date: Tue, 21 Mar 2000 20:35:37 -0600 (CST)
From: Hans Schneider <hans [at] math [dot] wisc.edu>
To: NETS -- at-net <at-net [at] mi [dot] uni-erlangen.de>,
        "Hershkowitz, Danny -- Hershkowitz Daniel" <hershkow [at] aluf [dot] technion.ac.il>,
        Danny Hershkowitz <hershkow [at] techunix [dot] technion.ac.il>,
        E-LETTER <eletter-request [at] win [dot] tue.nl>,
        "na.digest" <na.digest@na-net.ornl.gov>, ipnet-digest [at] math [dot] msu.edu,
        wim@bell-labs.com, hjt [at] eos [dot] ncsu.edu, vkm [at] eedsp [dot] gatech.edu,
        reliable_computing [at] interval [dot] louisiana.edu
Subject: LAA contents
Message-ID: <Pine.GSO.3.96.1000321203353.1730A-100000 [at] bing [dot] math.wisc.edu>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk




Dear Net Organizer:

Please circulate the attached LAA contents over your net.

Thanks

hans


------------------------------------------------------------------------------
Hans Schneider                                 hans [at] math [dot] wisc.edu.
Department of Mathematics                      608-262-1402 (Work)
Van Vleck Hall                                 608-271-7252 (Home)
480 Lincoln Drive                              608-263-8891 (Work FAX)
University of Wisconsin-Madison                608-271-8477 (Home FAX)
Madison WI 53706 USA             http://www.math.wisc.edu/~hans (URL)
------------------------------------------------------------------------------





             ContentsDirect from Elsevier Science
            =====================================

URL: http://www.elsevier.nl/locate/jnlnr/07738

Journal: Linear Algebra and Its Applications
ISSN   : 0024-3795
Volume : 307
Issue  : 1-3
Date   : 31-Mar-2000


pp 1-14
The positive definite completion problem relative to a subspace
CR Johnson, RL Smith

pp 15-33
The local exponent sets of primitive digraphs
MINO Zhengke

pp 35-46
Characteristic polynomials of graphs having a semifree action
JAEUN Lee

pp 47-67
Some remarks on quasi-equivalence of bases in Frechet spaces
N Zobin

pp 69-75
A norm bound for projections with complex weights
EY Bobrovnikova, SA Vavasis

pp 77-87
On lattice property of group induced cone orderings
M Niezgoda

pp 89-101
Stable subnorms
M Goldberg

pp 103-117
On the ultimate behavior of the sequence of consecutive powers of a
matrix in the max-plus algebra
B De Schutter

pp 119-129
Strengthening the Gilbert-Varshamov bound
A Barg, J Simonis

pp 131-144
A matrix inequality and its statistical application
J Jiang

pp 145-150
Two-dimensional representations of the free group in two generators
over an arbitrary field
L Vaserstein

pp 151-165
Principal pivot transforms: properties and applications
M Tsatsomeros

pp 167-182
Linear matrix period in max-plus algebra
M Gavalec

pp 183-192
Free product Z_3 * Z_3 of rotations with rational entries
G Liu, LC Robertson

pp 195-195
Author index


-------


NOTE:
ContentsDirect, which is automatically generated, lists the first author
of each paper and the corresponding author (if different). 



From owner-reliable_computing [at] interval [dot] usl.edu  Wed Mar 22 04:06:14 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id EAA08668
	for reliable_computing-outgoing; Wed, 22 Mar 2000 04:06:14 -0600 (CST)
Received: from mbox.diima.unisa.it (mbox.diima.unisa.it [193.205.163.4])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with SMTP id EAA08663
	for <reliable_computing [at] interval [dot] usl.edu>; Wed, 22 Mar 2000 04:05:57 -0600 (CST)
Received: from pc2.diiie.unisa.it [193.205.164.124]
	(HELO pc1)
	by mbox.diima.unisa.it (AltaVista Mail V2.0/2.0 BL23 listener)
	id 0000_0074_38d8_99f0_1f54;
	Wed, 22 Mar 2000 11:01:20 +0100
Message-Id: <4.1.20000322105604.0093a8c0 [at] cesare [dot] diiie.unisa.it>
X-Sender: spanish [at] cesare [dot] diiie.unisa.it
X-Mailer: QUALCOMM Windows Eudora Pro Version 4.1
Date: Wed, 22 Mar 2000 11:04:57 +0100
To: reliable_computing [at] interval [dot] usl.edu
From: "G.Spagnuolo" <spanish [at] ieee [dot] org>
Subject: interval matrix exponential
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear researchers,
I am searching for papers describing new approaches to the calculation of
the exponential of an interval matrix.
Namely I have A as an interval matrix (not diagonal) and I need to
calculate exp(A). 
Of course, by using the classical approach of the Taylor expansion, even
using a nested form, a great overestimation of the result can often be
verified. 
On the other side, an interval extension of the Pade approach is quite
difficult, I think.
Have you any suggestion?
Many thanks in advance.
Regards.
  Giovanni


--
Dr. Giovanni Spagnuolo, Ph.D.
Assistant Professor
Dipartimento di Ingegneria dell'Informazione ed Ingegneria Elettrica
D.I.I.I.E.
University of Salerno
Via Ponte Don Melillo
I-84084 Fisciano (SA) - ITALY
Phone +39 089 964258
Fax +39 089 964218
www page: http://www.diiie.unisa.it/it/aree/el_tcn/persone/collab/gs/gs.htm

NOTE: NEW E-MAIL ADDRESS
-->  spanish [at] ieee [dot] org  <---

From owner-reliable_computing [at] interval [dot] usl.edu  Wed Mar 22 04:35:02 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id EAA09028
	for reliable_computing-outgoing; Wed, 22 Mar 2000 04:35:02 -0600 (CST)
Received: from solon.mat.univie.ac.at (solon.mat.univie.ac.at [131.130.145.131])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id EAA09023
	for <reliable_computing [at] interval [dot] usl.edu>; Wed, 22 Mar 2000 04:34:58 -0600 (CST)
Received: (from neum@localhost)
	by solon.mat.univie.ac.at (8.9.3/8.9.3) id LAA30678;
	Wed, 22 Mar 2000 11:34:55 +0100 (MET)
Date: Wed, 22 Mar 2000 11:34:55 +0100 (MET)
From: Arnold Neumaier <neum [at] cma [dot] univie.ac.at>
Message-Id: <200003221034.LAA30678 [at] solon [dot] mat.univie.ac.at>
To: reliable_computing [at] interval [dot] usl.edu, spanish [at] ieee [dot] org
Subject: Re:  interval matrix exponential
Cc: neum [at] cma [dot] univie.ac.at
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

>>I am searching for papers describing new approaches to the 
calculation of the exponential of an interval matrix.<<

You may find 

A. Neumaier,
Global, rigorous and realistic bounds for the solution of 
dissipative differential equations. Part I: Theory,
Computing 52 (1994), 315-336.
http://solon.cma.univie.ac.at/~neum/papers.html#ode

useful in this respect. (Specialize the general case to a
constant coefficient differential equation.)

Arnold Neumaier


From owner-reliable_computing [at] interval [dot] usl.edu  Wed Mar 22 06:59:48 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id GAA09464
	for reliable_computing-outgoing; Wed, 22 Mar 2000 06:59:48 -0600 (CST)
Received: from csc-sun.math.utah.edu (root@csc-sun.math.utah.edu [128.110.198.2])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id GAA09459
	for <reliable_computing [at] interval [dot] usl.edu>; Wed, 22 Mar 2000 06:59:45 -0600 (CST)
Received: from suncore.math.utah.edu (suncore0.math.utah.edu [128.110.198.5])
	by csc-sun.math.utah.edu (8.9.3/8.9.3) with ESMTP id FAA15780;
	Wed, 22 Mar 2000 05:59:41 -0700 (MST)
Received: (from beebe@localhost)
	by suncore.math.utah.edu (8.9.3/8.9.3) id FAA01779;
	Wed, 22 Mar 2000 05:59:41 -0700 (MST)
Date: Wed, 22 Mar 2000 05:59:41 -0700 (MST)
From: "Nelson H. F. Beebe" <beebe [at] math [dot] utah.edu>
To: "G.Spagnuolo" <spanish [at] ieee [dot] org>
Cc: beebe [at] math [dot] utah.edu, reliable_computing [at] interval [dot] usl.edu
X-US-Mail: "Center for Scientific Computing, Department of Mathematics, 322
        INSCC, University of Utah, 155 S 1400 E RM 233, Salt Lake City, UT
        84112-0090, USA"
X-Telephone: +1 801 581 5254
X-FAX: +1 801 585 1640, +1 801 581 4148
X-URL: http://www.math.utah.edu/~beebe
Subject: Re: interval matrix exponential
Message-ID: <CMM.0.91.0.953729980.beebe [at] suncore [dot] math.utah.edu>
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Giovanni Spagnuolo <spanish [at] ieee [dot] org> writes on Wed, 22 Mar 2000
11:04:57 +0100:

>> I am searching for papers describing new approaches to the calculation of
>> the exponential of an interval matrix.
 
While this paper doesn't address interval arithmetic, if you weren't
aware of it already, you might find it a useful guide into the
older literature:

@String{j-SIAM-REVIEW           = "SIAM Review"}

@Article{Moler:1978:NDW,
  author =       "C. B. Moler and C. F. {Van Loan}",
  title =        "Nineteen dubious ways to compute the exponential of a
                 matrix",
  journal =      j-SIAM-REVIEW,
  volume =       "20",
  number =       "4",
  pages =        "801--836",
  month =        oct,
  year =         "1978",
  CODEN =        "SIREAD",
  ISSN =         "0036-1445",
  bibdate =      "Fri Mar 21 15:55:27 MST 1997",
  acknowledgement = ack-nhfb,
  classcodes =   "C4140 (Linear algebra)",
  corpsource =   "Dept. of Math., Univ. of New Mexico, Albuquerque, NM,
                 USA",
  keywords =     "eig; matrix algebra; matrix exponential; matrix
                 function; nla",
  treatment =    "A Application; G General Review",
}

Here are two more from my files:

@String{j-IEEE-TRANS-CIRCUITS-SYST   = "IEEE Transactions on Circuits and Systems"}

@Article{Oppenheimer:1988:AIAb,
  author =       "E. P. Oppenheimer and Anthony N. Michel",
  title =        "Application of interval analysis techniques to linear
                 systems. {II}. The interval matrix exponential
                 function",
  journal =      j-IEEE-TRANS-CIRCUITS-SYST,
  volume =       "35",
  number =       "10",
  pages =        "1230--1242",
  month =        oct,
  year =         "1988",
  CODEN =        "ICSYBT",
  ISSN =         "0098-4094",
  bibdate =      "Thu Dec 14 17:19:38 MST 1995",
  abstract =     "For pt.I see ibid., vol.35, no.9, p.1129-38 (1988). In
                 part I the authors established new results for
                 continuous and rational interval functions which are of
                 interest in their own right. The authors use these
                 results to study interval matrix exponential functions
                 and to devise a method of constructing augmented
                 partial sums which approximate interval matrix
                 exponential functions as closely as desired. The
                 authors introduce and study `scalar' and matrix
                 interval exponential functions. These functions are
                 represented as infinite power series and their
                 properties are studied in terms of rational functions
                 obtained from truncations. To determine optimal
                 estimates of error bounds for the truncated series
                 representation of the exponential matrix function, the
                 authors establish appropriate results dealing with
                 Householder norms. In order to reduce the
                 conservativeness for interval arithmetic operations,
                 they consider the nested form for interval polynomials
                 and the centered form for interval arithmetic
                 representations. They also discuss briefly machine
                 bounding arithmetic in digital computers. Finally, the
                 authors present an algorithm for the computation of the
                 interval matrix exponential function which yields
                 prespecified error bounds.",
  acknowledgement = ack-nhfb,
  affiliation =  "Appl. Phys. Lab., Johns Hopkins Univ., Laurel, MD,
                 USA",
  classification = "C1210 (General system theory); C4140 (Linear
                 algebra); C4130 (Interpolation and function
                 approximation)",
  keywords =     "Interval analysis techniques; Linear systems; Interval
                 matrix exponential function; Augmented partial sums;
                 Infinite power series; Rational functions; Optimal
                 estimates; Error bounds; Truncated series
                 representation; Householder norms; Nested form;
                 Interval polynomials; Centered form; Interval
                 arithmetic representations; Machine bounding
                 arithmetic; Digital computers",
  language =     "English",
  pubcountry =   "USA",
  thesaurus =    "Linear systems; Matrix algebra; Polynomials",
}

@String{j-COMPUTING             = "Computing"}

@Article{Bochev:1989:SVN,
  author =       "P. Bochev and S. Markov",
  title =        "A self-validating numerical method for the matrix
                 exponential",
  journal =      j-COMPUTING,
  volume =       "43",
  number =       "1",
  pages =        "59--72",
  month =        "",
  year =         "1989",
  CODEN =        "CMPTA2",
  ISSN =         "0010-485X",
  bibdate =      "Thu Dec 14 17:20:22 MST 1995",
  abstract =     "An algorithm is presented, which produces highly
                 accurate and automatically verified bounds for the
                 matrix exponential function. The computational approach
                 involves iterative defect correction, interval analysis
                 and advanced computer arithmetic. The algorithm
                 presented is based on the `scaling and squaring'
                 scheme, utilizing Pade approximations and safe error
                 monitoring. A PASCAL-SC program is reported and
                 numerical results are discussed.",
  acknowledgement = ack-nhfb,
  affiliation =  "Inst. of Math., Bulgarian Acad. of Sci., Sofia,
                 Bulgaria",
  classification = "B0290H (Linear algebra); C4140 (Linear algebra)",
  keywords =     "Self-validating numerical method; Matrix exponential;
                 Computational approach; Iterative defect correction;
                 Interval analysis; Advanced computer arithmetic; Pade
                 approximations; Safe error monitoring; PASCAL-SC
                 program; Numerical results",
  language =     "English",
  pubcountry =   "Austria",
  thesaurus =    "Iterative methods; Matrix algebra",
}

-------------------------------------------------------------------------------
- Nelson H. F. Beebe                    Tel: +1 801 581 5254                  -
- Center for Scientific Computing       FAX: +1 801 585 1640, +1 801 581 4148 -
- University of Utah                    Internet e-mail: beebe [at] math [dot] utah.edu  -
- Department of Mathematics, 322 INSCC      beebe [at] acm [dot] org  beebe [at] computer [dot] org -
- 155 S 1400 E RM 233                       beebe [at] ieee [dot] org                    -
- Salt Lake City, UT 84112-0090, USA    URL: http://www.math.utah.edu/~beebe  -
-------------------------------------------------------------------------------

From owner-reliable_computing [at] interval [dot] usl.edu  Wed Mar 22 10:35:07 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA09959
	for reliable_computing-outgoing; Wed, 22 Mar 2000 10:35:07 -0600 (CST)
Received: from recife.di.ufpe.br (recife.di.ufpe.br [150.161.2.1])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA09954
	for <reliable_computing [at] interval [dot] usl.edu>; Wed, 22 Mar 2000 10:34:10 -0600 (CST)
Received: from limoeiro.diufpe (limoeiro [150.161.2.69])
	by recife.di.ufpe.br (8.9.3+Sun/8.9.3) with ESMTP id NAA10061;
	Wed, 22 Mar 2000 13:32:39 -0300 (EST)
Received: (from vk@localhost)
	by limoeiro.diufpe (8.9.1b+Sun/8.9.1) id NAA12654;
	Wed, 22 Mar 2000 13:32:39 -0300 (EST)
Date: Wed, 22 Mar 2000 13:32:38 -0300 (EST)
From: Vladik Kreinovich <vk [at] di [dot] ufpe.br>
X-Sender: vk@limoeiro
To: reliable_computing [at] interval [dot] usl.edu
cc: toom [at] bernoulli [dot] de.ufpe.br
Subject: computing critical values
Message-ID: <Pine.GSO.3.95.1000322132818.7485D-100000@limoeiro>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear Friends,

Andrei Toom, a researcher from the Federal University of Pernambuco,
Brazil, asked me whether there are any applications of interval
computations to computing critical values for mathematical models in
statistical physics (e.g., percolation). 

Please answer him at toom [at] bernoulli [dot] de.ufpe.br. 

Thanks. 

Vladik


From owner-reliable_computing [at] interval [dot] usl.edu  Sun Mar 26 16:48:23 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id QAA00530
	for reliable_computing-outgoing; Sun, 26 Mar 2000 16:48:23 -0600 (CST)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id QAA00525
	for <reliable_computing [at] interval [dot] usl.edu>; Sun, 26 Mar 2000 16:48:19 -0600 (CST)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.9.3+Sun/8.9.1) with SMTP id PAA12913
	for <reliable_computing [at] interval [dot] usl.edu>; Sun, 26 Mar 2000 15:48:15 -0700 (MST)
Message-Id: <200003262248.PAA12913 [at] cs [dot] utep.edu>
Date: Sun, 26 Mar 2000 15:48:15 -0700 (MST)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: from NA Digest
To: reliable_computing [at] interval [dot] usl.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: 3MkfqiE83trOivLN/GAQZQ==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

From: Paul Barton <pib [at] MIT [dot] EDU>
Date: Mon, 13 Mar 2000 14:56:30 -0500
Subject: DAEPACK Version 1.0 Announcement

ANNOUNCING DAEPACK VERSION 1.0

The Massachusetts Institute of Technology is pleased to announce the
availability of DAEPACK version 1.0 for academic and commercial uses
licensing.

DAEPACK is a symbolic and numeric library for general numerical
calculations. What distinguishes DAEPACK from other software libraries for
numerical computations is a set of symbolic components that operate
directly on very general Fortran-90 code provided by the user.  The
symbolic components take as input a set of Fortran-90 source files defining
a system of equations of interest and generate a new set of Fortran-90
subroutines and functions computing quantities such as analytical
derivatives matrices, sparsity patterns, etc.  The original Fortran-90 code
may contain an arbitrary number of subroutine and function calls, common
blocks, sophisticated solution strategies embedded within the model
evaluation, etc.  The information generated automatically by DAEPACK is
exploited in a collection of state-of-the-art numerical algorithms for
performing tasks such as solution of large sets of nonlinear equations,
efficient numerical integration and parametric sensitivity calculation,
hybrid discrete/continuous simulation, and others.  In addition, this new
information can be used with third party or custom numerical algorithms to
provide information that would otherwise have to be generated by hand.

Currently, the symbolic components generate:

1) General derivative matrices, J(x)S, where J(x) is the Jacobian matrix
and  S is and arbitrary conformable matrix.  Setting S equal to the
identity matrix yields the Jacobian matrix.  Sparsity is exploited both in
derivative computation and storage.
2) Sparsity patterns.
3) Discontinuity-locked models.
4) Interval extensions of the original system of equations.

In all of the cases above, new code is generated that can be compiled and
linked into other applications to provide the desired information.

Currently, the numerical components provided with DAEPACK are:

1) Block solution of large sparse sets of nonlinear algebraic equations.
The  structural information of the system of equations obtained with the
sparsity  pattern code described above is used to permute the system into
block lower  triangular form where the overall system of equations is
solved as a sequence of smaller blocks.  Derivative code is generated in
order to extract efficiently the submatrix of the Jacobian corresponding to
the current block.
2) Efficient numerical integration and parametric sensitivity calculation
exploiting the sparsity pattern and analytical derivatives generated
automatically.
3) Hybrid discrete/continuous numerical integration and parametric sensitivity
calculation using the sparsity pattern, analytical derivatives, and
discontinuity-locked model generated automatically.
4) Intelligent model analysis based on the Dulmage-Mendelsohn
decomposition,  exploiting the sparsity pattern generated automatically.

DAEPACK is available on the following platforms: Windows 9x, Windows NT, UNIX
(HPUX and Sun Solaris), and Linux.  The Windows versions of DAEPACK are
provided with a graphical user interface that facilitates the automatic
generation  of code using the symbolic components.

Future releases of DAEPACK will include a larger set of symbolic and
numeric  algorithms and a graphical environment for "numerical
flowsheeting", the construction of numerical algorithms graphically.
Furthermore, greater support for the automatic construction of CAPE-Open
compliant components from legacy Fortran code will be provided.

More information about DAEPACK can be found at the following website:

    http://yoric.mit.edu/daepack/daepack.html

For additional information, including licensing, contact:

John Tolsma
Postdoctoral Associate
Department of Chemical Engineering
Massachusetts Institute of Technology
77 Massachusetts Avenue  Room 66-365
Cambridge MA 02139
(phone) 617-253-5513
(fax)   617-258-5042
jtolsma [at] mit [dot] edu

Paul I. Barton
Associate Professor
Department of Chemical Engineering
Massachusetts Institute of Technology, 66-464
77 Massachusetts Avenue
Cambridge MA 02139


From owner-reliable_computing [at] interval [dot] usl.edu  Mon Mar 27 00:13:53 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id AAA01117
	for reliable_computing-outgoing; Mon, 27 Mar 2000 00:13:52 -0600 (CST)
Received: from e4.ny.us.ibm.com (e4.ny.us.ibm.com [32.97.182.104])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id AAA01112
	for <reliable_computing [at] interval [dot] usl.edu>; Mon, 27 Mar 2000 00:13:49 -0600 (CST)
From: banavar [at] us [dot] ibm.com
Received: from northrelay02.pok.ibm.com (northrelay02.pok.ibm.com [9.117.200.22])
	by e4.ny.us.ibm.com (8.9.3/8.9.3) with ESMTP id BAA75168;
	Mon, 27 Mar 2000 01:07:22 -0500
Received: from D51MTA03.pok.ibm.com (d51mta03.pok.ibm.com [9.117.200.31])
	by northrelay02.pok.ibm.com (8.8.8m2/NCO v2.06) with SMTP id AAA143108;
	Mon, 27 Mar 2000 00:58:32 -0500
Received: by D51MTA03.pok.ibm.com(Lotus SMTP MTA v4.6.5  (863.2 5-20-1999))  id 852568AF.0020C506 ; Mon, 27 Mar 2000 00:57:55 -0500
X-Lotus-FromDomain: IBMUS
To: ICDCS_99 [at] us [dot] ibm.com, dbworld [at] cs [dot] wisc.edu,
        distributed-ai-request [at] mailbase [dot] ac.uk, ecoop-info [at] ecoop [dot] org,
        podc-post [at] bellcore [dot] com, reliable_computing [at] interval [dot] usl.edu,
        distributed-ai-request [at] mailbase [dot] ac.uk
Message-ID: <852568AF.0020C352.00 [at] D51MTA03 [dot] pok.ibm.com>
Date: Sun, 26 Mar 2000 22:51:20 -0500
Subject: Middleware 2000: Final call for participation
Mime-Version: 1.0
Content-type: text/plain; charset=us-ascii
Content-Disposition: inline
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Colleagues,
This conference is happening next week.  It's promising to
be a big success, with a large participation and several
highlights (see below).  We'll be delighted if you join us.

--------
Guruduth Banavar
Publicity Chair, Middleware 2000 Conference

===============================================================

                 CALL FOR PARTICIPATION
                    Middleware 2000
        The International Conference on Distributed Systems
              Platforms and Open Distributed Processing
                     April 4 - 8, 2000
          Hudson Valley (near New York City) USA
         http://www.research.ibm.com/Middleware2000

The advance program is available on our web site. We invite you
to register now to join us for this premier conference in April.

               Sponsored by IFIP TC6 WG6.1 and ACM
           Supported by Agilent Technologies and IBM


CONFERENCE BACKGROUND
---------------------
Middleware 2000 will be the premier conference on
distributed systems platforms and open distributed processing
in the opening year of the new millenium. The conference is
a synthesis of the major conferences and workshops in this
area into a single international event.  Middleware 2000
follows in the footsteps of the extremely successful,
inaugural Middleware '98 Conference held in the Lake District
of the UK in September, 1998.

The focus of Middleware 2000 is on the design, implementation,
deployment and evaluation of distributed systems platforms
and architectures for future networked environments. Of
particular interest is the application of both new and
existing architectures and platforms (such as RM-ODP, CORBA,
RMI and DCOM) in environments which may include public and
private networks, overlayed wired and wireless technologies,
IPv6 and IP multicast, multimedia and real-time information
and an increasing volume of WWW and Java traffic.


SOME CONFERENCE HIGHLIGHTS
--------------------------
Middleware 2000 is a single-track conference consisting
of seven paper sessions, two keynote addresses, and a
work-in-progress session.  There will also be posters
presented during breaks.

1) The seven paper sessions are on Messaging, Caching,
   Reflection, Indirection, Quality of Service, Transactions
   and Workflow, and Composition.

   The details of the paper program is at:
   http://www.research.ibm.com/Middleware2000/Program/program.html

2) We are offering four tutorials by leading practitioners:

   April 4 AM Tutorials:

   T1. "Scalability Issues in CORBA-based Systems"
       Steve Vinoski, IONA Technologies

   T2. "Designing with Patterns"
       John Vlissides, IBM TJ Watson Research Center

   April 4 PM Tutorials:

   T3. "Middleware for Programmable Networks"
       Andrew Campbell, Columbia University

   T4. "Applying Patterns for Concurrent and Distributed Components"
       Frank Buschman, Siemens ZT

   More information on the tutorials is at:
   http://www.research.ibm.com/Middleware2000/Tutorials/tutorials.html

3. We are organizing a workshop on Reflective Middleware (RM2000)
   that will be co-located with Middleware 2000.

   Information on the RM2000 workshop can be found at:
   http://www.comp.lancs.ac.uk/computing/RM2000/

4. We will have two keynote addresses by visionaries in the
   field of middleware: Ken Birman, Professor at Cornell University,
   and Jim Waldo of Sun Microsystems.

5. We will have a work-in-progress paper session and multiple
   poster sessions.

   Information on the WiP papers and posters will be available at:
   http://www.research.ibm.com/Middleware2000


LOCATION AND ACTIVITIES
-----------------------
The conference will be held at the beautiful Hudson River Valley.
The IBM Palisades Conference Center is a state-of-the-art
meeting center on 106 acres of land, just north of New York City.
Check out the URL.
    http://www.research.ibm.com/Middleware2000/Location/location.html

There will be social events as part of this year's conference,
including a Welcome Reception where participants can meet
the organizing team and other participants in an informal setting.
We will also be providing luncheons and dinner to all attendees
on all three days of the conference.  Lunch will also be provided
to people attending the workshop and to those attending the
tutorials.  Information on these activities will be available
on the conference web page.


REGISTRATION
------------
Don't delay and register today for Middleware 2000.  It is THE
conference to attend.  With a great location, on a naturally
rich Hudson Valley near culturally rich Manhattan, you can't
ask for anything more. We look forward to seeing you there.

--------------------------------------------------------------------
Important URL for registration:
   http://www.regmaster.com/midd2000.html
----------------------------------------------------------------------




From owner-reliable_computing [at] interval [dot] usl.edu  Mon Mar 27 13:28:18 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id NAA02268
	for reliable_computing-outgoing; Mon, 27 Mar 2000 13:28:18 -0600 (CST)
Received: from d71.ucs.usl.edu (root [at] d71 [dot] ucs.usl.edu [130.70.115.71])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id NAA02263
	for <reliable_computing [at] interval [dot] ull.edu>; Mon, 27 Mar 2000 13:28:15 -0600 (CST)
Received: from d71.ucs.usl.edu (rbk5287 [at] d71 [dot] ucs.usl.edu [130.70.115.71])
	by d71.ucs.usl.edu (8.9.1/8.9.1/ucs-client_1.3) with SMTP id NAA04281
	for <reliable_computing [at] interval [dot] ull.edu>; Mon, 27 Mar 2000 13:28:14 -0600 (CST)
Message-Id: <200003271928.NAA04281 [at] d71 [dot] ucs.usl.edu>
Date: Mon, 27 Mar 2000 13:28:13 -0600 (CST)
From: Kearfott Ralph B <rbk5287 [at] louisiana [dot] edu>
Reply-To: Kearfott Ralph B <rbk5287 [at] louisiana [dot] edu>
Subject: Intervals and Fortran
To: reliable_computing [at] interval [dot] ull.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: U1dHn4Dtsf4i7JQWns5OwQ==
X-Mailer: dtmail 1.2.1 CDE Version 1.2.1 SunOS 5.6 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Friends,

Even though I've been off the Fortran standardization
committee for two years, I note that intervals still
have a presence in the Fortran 2000 requirements.
Please see items R4d and R4f in the requirements list
below.  (Also, please, if you have specific comments
concerning interval arithmetic, please reply first
to me or to this list, rather than John Reid.)

Finally, I hope we will continue to educate non-experts
concerning misconceptions, capabilities and limitations
of interval computations.

Best regards,

Baker

P.S.  Support for IEEE arithmetic has been included in the standard
      separately from the enabling technology for interval arithmetic.
      
------------- Begin Forwarded Message -------------

Date: Mon, 27 Mar 2000 13:46:21 +0100 (BST)
From: John Reid <J.Reid [at] letterbox [dot] rl.ac.uk>
To: SC22WG5 [at] dkuug [dot] dk
Subject: (SC22WG5.1727) Content of F2000
MIME-Version: 1.0
X-md5sum: 3667562d0ee17fc1c07417557f6f1aa4
X-md5sum-Origin: ex1.ncsa.uiuc.edu

Dear WG5,
	 To help our work in Oulu, I have constructed a revised version
of N1259 (adopted in 1997). I have added reference keys, as used at the
original meeting and by J3 subsequently, and reordered the items by
key. I have made changes corresponding to resolutions at subsequent WG5
meetings. I believe it represents the current position of WG5 re the
revision. I would be most grateful to hear of any mistakes I have made
in constructing this.

Best wishes,

John. 

.......................



                                        ISO/IEC JTC1/SC22/WG5 N1382 (draft)

                      CONTENT OF FORTRAN 2000

1. Required Content of Fortran 2000

Following Resolutions at the Las Vegas (2/97), Vienna (7/97),
Trollhattan (6/98) and Cadarache (6/99) meetings, WG5 has determined
that Fortran 2000 shall contain the following items:

    Floating point exception handling TR 15580
    Allocatable components            TR 15581
R1  Derived type I/O                  N1322
R2  Asynchronous I/O                  (see N1189 item #52)
R3  Procedure pointers                (see N1189 item #43)    
R4d Enabling technology for interval arithmetic:  
    Control of I/O rounding           T9 in N1323
R4f Enabling technology for interval arithmetic:  
    Constants for opaque types        T9 in N1323
R5  Parameterized derived types       (see N1189 item #14)
R6a Inheritance                       (see N1189 item #88 and N1272)
R6b Polymorphism                      (see N1189 item #88 and N1272)
R7  Constructors/destructors          (see N1189 item #89)
R8  Internationalization              N1320
R9  Interoperability with C           N1321

Note that N1189 is the WG5 Repository of Requirements (Standing Document 5).

It is the intention of WG5 that the revised standard shall be published
in December 2004. 

WG5 requests the primary development body, should it deem necessary any
amendments to the schedule, to include in the WG5 pre-meeting
distribution proposals for modifications, together with detailed
reasons for such recommendations (C5 in N1343).



2. Possible Additional Minor Technical Enhancements

WG5 has also authorised J3 to work on the following minor technical
enhancements for incorporation in Fortran 2000, subject to the proviso
that any work carried out on them does not adversely affect any of the
work required to address the major items listed above:

B1  VOLATILE attribute                     (see N1269)
B2  Allow PUBLIC entities of PRIVATE type  (see N1189 item #75)
B3  PUBLIC and PRIVATE derived type components (see N1267)
B4  Stream I/O                             (see N1189 item #63)
B5  Command-line arguments (M18a)          (see N1189 item #20)
B6  Access to status error messages        (see N1268)
B7  IEEE I/O rounding inquiry intrinsics   (see N1271)
M1  Increased statement length             (see N1189 item #50, J3/96-138)
M2  Intent for pointer arguments           (see N1189 item #44, J3/96-098r1)
M3  Generic rate_count in system_clock     (see N1189 item #61, J3/96-116r1)
M4  Specifying pointer lower bounds        (see N1189 item #02, J3/96-154)
M5  Extend max/min intrinsics to character (see N1189 item #64, J3/96-131r1)
M6  Extended initialization expressions    (see N1189 item #66, J3/96-165)
M7  Mixed case syntax elements             (see N1189 item #67, J3/96-055r1)
M10 Named scratch files                    (see N1189 item #73, J3/96-169r1)
M11 Passing specific/generic names         (see N1189 item #59, J3/96-144)
M15 Renaming defined operators             (see N1189 item #41)
M16 Derived type encapsulation             (see J3/96-133)
M17 Enhanced complex constants             (see J3/96-132r1)
R4a Enabling technology for interval arithmetic:   
    Flexible operation control             T9 in N1323
R4c Enabling technology for interval arithmetic:   
    Control of operation rounding          T9 in N1323

WG5 will review this list at every meeting in the light of information
provided by J3 regarding the progress on the major items for Fortran
2000, and may reduce it if it feels that this will be necessary in
order to meet the publication schedule.




------------- End Forwarded Message -------------


---------------------------------------------------------------
R. Baker Kearfott,    rbk [at] louisiana [dot] edu   (337) 482-5346 (fax)
(337) 482-5270 (work)                     (337) 981-9744 (home)
URL: http://interval.louisiana.edu/kearfott.html
Department of Mathematics, University of Louisiana at Lafayette
Box 4-1010, Lafayette, LA 70504-1010, USA
---------------------------------------------------------------


From owner-reliable_computing [at] interval [dot] usl.edu  Tue Mar 28 00:46:59 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id AAA03323
	for reliable_computing-outgoing; Tue, 28 Mar 2000 00:46:58 -0600 (CST)
Received: from unknown (atlanta-ip-2-50.dynamic.ziplink.net [209.206.59.50])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with SMTP id AAA03309;
	Tue, 28 Mar 2000 00:46:49 -0600 (CST)
From: r2d2 [at] ureach [dot] com
Subject: laser printer toner advertisement
Date: Tue, 28 Mar 2000 10:48:04
Message-Id: <414.122700.326295@>
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk






BENCHMARK SUPPLY
5334 LAKE VIEW CLUB
ATLANTA GA 30338

***LASER PRINTER TONER CARTRIDGES***
***FAX AND COPIER TONER***
 
WE ACCEPT GOVERNMENT, SCHOOL & UNIVERSITY PURCHASE ORDERS
JUST LEAVE YOUR PO # WITH CORRECT BILLING & SHIPPING ADDRESS

   CHECK OUT OUR NEW CARTRIDGE PRICES :
 

APPLE 
 
  LASER WRITER  PRO 600 OR 16/600         $69
  LASER WRITER SELECT 300,310.360         $69
  LASER WRITER 300, 320                   $54 
  LASER WRITER LS,NT,2NTX,2F,2G & 2SC     $54 
  LASER WRITER 12/640                     $79 

HEWLETT PACKARD 

  LASERJET SERIES 2,3 & 3D (95A)          $49 
  LASERJET SERIES  2P AND 3P (75A)        $54 
  LASERJET SERIES 3SI AND 4SI (91A)       $75 
  LASERJET SERIES 4L AND 4P               $49 
  LASERJET SERIES 4, 4M, 5, 5M, 4+ (98A)  $59 
  LASERJET SERIES 4000 HIGH YIELD  (27X)  $99 
  LASERJET SERIES 4V                      $95 
  LASERJET SERIES 5SI , 8000              $95 
  LASERJET SERIES 5L AND 6L               $49 
  LASERJET SERIES 5P, 5MP, 6P, 6MP        $59 
  LASERJET SERIES 5000 (29A)             $135
  LASERJET SERIES 1100 (92A)              $49 
  LASERJET SERIES 2100 (96A)              $89
  LASERJET SERIES 8100 (82X)		 $145


HP LASERFAX 

  LASERFAX 500, 700, FX1,                 $59 
  LASERFAX 5000, 7000, FX2,               $59 
  LASERFAX  FX3                           $69 
  LASERFAX  FX4                           $79 
 

LEXMARK 

  OPTRA  4019, 4029  HIGH YIELD          $135 
  OPTRA R, 4039, 4049 HIGH YIELD         $135 
  OPTRA S 4059 HIGH YIELD                $135 
  OPTRA E                                 $59 
  OPTRA  N                               $115 
 

EPSON 

  EPL-7000, 8000                         $105 
  EPL-1000, 1500                         $105 
 

CANON 

  LBP-430                                 $49 
  LBP-460, 465                            $59 
  LBP-8 II                                $54 
  LBP-LX                                  $54 
  LBP-MX                                  $95 
  LBP-AX                                  $49 
  LBP-EX                                  $59 
  LBP-SX                                  $49 
  LBP-BX                                  $95 
  LBP-PX                                  $49 
  LBP-WX                                  $95 
  LBP-VX                                  $59 
  CANON FAX L700 THRU L790 FX1            $59 
  CANONFAX L5000 L70000  FX2              $59 
 

CANON COPIERS 

  PC 20, 25 ETC....                       $89 
  PC 3, 6RE, 7, 11  (A30)                 $69 
  PC 320 THRU 780  (E40)                  $89 
 

NEC 

  SERIES 2 LASER MODEL 90,95             $105


PLEASE NOTE:

1) ALL OUR CARTRIDGES ARE GENUINE OEM CARTRIDGES.
2) WE DO NOT SEND OUT CATALOGS OR PRICE LISTS 
3) WE DO NOT FAX QUOTES OR PRICE LISTS.  
4) WE DO NOT SELL TO RESELLERS OR BUY FROM DISTRIBUTERS
5) WE DO NOT CARRY: BROTHER-MINOLTA-KYOSERA-PANASONIC PRODUCTS
6) WE DO NOT CARRY: XEROX-FUJITSU-OKIDATA OR SHARP PRODUCTS
7) WE DO NOT CARRY ANY COLOR PRINTER SUPPLIES    
8) WE DO NOT CARRY DESKJET/INKJET OR BUBBLEJET SUPPLIES
9) WE DO NOT BUY FROM OR SELL TO RECYCLERS OR REMANUFACTURERS



               

****OUR  ORDER LINE IS 770-399-0953 ****

****OUR CUSTOMER SERVICE  LINE IS 800-586-0540****
****OUR E-MAIL REMOVAL AND COMPLAINT LINE IS 888-494-8597****

****PLACE YOUR ORDER AS FOLLOWS**** :

BY PHONE   770-399-0953 

BY FAX:    770-698-9700 
BY MAIL:   BENCHMARK PRINT SUPPLY
           7540 BRIDGEGATE COURT
,          ATLANTA GA 30350

MAKE SURE YOU INCLUDE THE FOLLOWING INFORMATION IN YOUR ORDER: 

             1)  YOUR PHONE NUMBER 
             2)  COMPANY NAME 
             3)  SHIPPING ADDRESS 
             4)  YOUR NAME 
             5)  ITEMS NEEDED WITH QUANTITIES 
             6)  METHOD OF PAYMENT. (COD OR CREDIT CARD) 
             7)  CREDIT CARD NUMBER WITH EXPIRATION DATE 

 
1) WE SHIP UPS GROUND. ADD $4.5 FOR SHIPPING AND HANDLING.
2) COD CHECK ORDERS ADD $3.5 TO YOUR SHIPPING COST.
2) WE ACCEPT ALL MAJOR CREDIT CARD OR "COD" ORDERS.
3) OUR STANDARD MERCHANDISE REFUND POLICY IS NET 30 DAYS
4) OUR STANDARD MERCHANDISE REPLCAMENT POLICY IS NET 90 DAYS. 


NOTE NUMBER (1): 

PLEASE DO NOT CALL OUR ORDER LINE TO REMOVE YOUR E-MAIL 
ADDRESS OR COMPLAIN. OUR ORDER LINE IS NOT SETUP TO FORWARD 
YOUR E-MAIL ADDRESS REMOVAL REQUESTS OR PROCESS YOUR 
COMPLAINTS..IT WOULD BE A WASTED PHONE CALL.YOUR ADDRESS 
WOULD NOT BE REMOVED AND YOUR COMPLAINTS WOULD NOT BE 
HANDLED.PLEASE CALL OUR TOLL FREE E-MAIL REMOVAL AND 
COMPLAINT LINE TO DO THAT.

NOTE NUMBER (2):

OUR E-MAIL RETURN ADDRESS IS NOT SETUP TO ANSWER ANY 
QUESTIONS YOU MIGHT HAVE REGARDING OUR PRODUCTS. OUR E-MAIL 
RETURN ADDRESS IS ALSO NOT SETUP TO TAKE ANY ORDERS AT 
THIS TIME. PLEASE CALL THE ORDER LINE TO PLACE YOUR ORDER
 OR HAVE ANY QUESTIONS ANSWERED. OTHERWISE PLEASE CALL OUR 
CUSTOMER SERCICE LINE.







 
 
 
 
 
 
 
 
 
 
 
 
 

From owner-reliable_computing [at] interval [dot] usl.edu  Tue Mar 28 06:23:22 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id GAA04778
	for reliable_computing-outgoing; Tue, 28 Mar 2000 06:23:22 -0600 (CST)
Received: from pamela.lss.supelec.fr (IDENT:root [at] pamela [dot] lss.supelec.fr [160.228.200.4])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id GAA04773
	for <reliable_computing [at] interval [dot] usl.edu>; Tue, 28 Mar 2000 06:23:13 -0600 (CST)
Received: from pcisabelle (dhcp95.lss.supelec.fr [160.228.200.195])
          by pamela.lss.supelec.fr (8.9.3/jtpda-5.3.2) with SMTP id OAA16024
          for <reliable_computing [at] interval [dot] usl.edu>; Tue, 28 Mar 2000 14:24:28 +0200
Message-Id: <200003281224.OAA16024 [at] pamela [dot] lss.supelec.fr>
X-Sender: braems [at] mailhost [dot] lss.supelec.fr
X-Mailer: QUALCOMM Windows Eudora Pro Version 4.0.2 
Date: Tue, 28 Mar 2000 14:21:37 +0200
To: reliable_computing [at] interval [dot] usl.edu
From: Isabelle Braems <braems [at] lss [dot] supelec.fr>
Subject: computation of volumes
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear interval researchers,

I am a first year PHD student in reliable modelization and estimation in a
bounded error context.
To evaluate the reliability of a datum, I need to compute volumes of sets
defined by nonlinear inequalities.
Could you please send me any references about the use of IA to compute such
volumes?

Many thanks in advance,
Isabelle Braems



From owner-reliable_computing [at] interval [dot] usl.edu  Tue Mar 28 07:55:51 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id HAA05200
	for reliable_computing-outgoing; Tue, 28 Mar 2000 07:55:51 -0600 (CST)
Received: from solon.mat.univie.ac.at (solon.mat.univie.ac.at [131.130.145.131])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id HAA05195
	for <reliable_computing [at] interval [dot] usl.edu>; Tue, 28 Mar 2000 07:55:48 -0600 (CST)
Received: (from neum@localhost)
	by solon.mat.univie.ac.at (8.9.3/8.9.3) id PAA18183;
	Tue, 28 Mar 2000 15:22:28 +0200 (MET DST)
Date: Tue, 28 Mar 2000 15:22:28 +0200 (MET DST)
From: Arnold Neumaier <neum [at] cma [dot] univie.ac.at>
Message-Id: <200003281322.PAA18183 [at] solon [dot] mat.univie.ac.at>
To: braems [at] lss [dot] supelec.fr, reliable_computing [at] interval [dot] usl.edu
Subject: Re:  computation of volumes
Cc: neum [at] cma [dot] univie.ac.at
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

>>I need to compute volumes of sets defined by nonlinear inequalities.<<

You'd have to do bisection on a box covering the region of interest,
spitting recursively until the function evaluations (using centered
forms) show that a box is completely inside or outside the set,
or until the box is so small that you can ignore it. Then you add
up the volumes of the subboxes.

This will be feasible in 2 or 3 dimensions but very expensive in
high dimensions since in effect you trace out the n-1 dimensional 
surface by covering it with the undiscarded boxes.

Arnold Neumaier
http://solon.cma.univie.ac.at/~neum/


From owner-reliable_computing [at] interval [dot] usl.edu  Tue Mar 28 13:33:50 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id NAA06061
	for reliable_computing-outgoing; Tue, 28 Mar 2000 13:33:50 -0600 (CST)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id NAA06056
	for <reliable_computing [at] interval [dot] usl.edu>; Tue, 28 Mar 2000 13:33:38 -0600 (CST)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.9.3+Sun/8.9.1) with SMTP id MAA27568
	for <reliable_computing [at] interval [dot] usl.edu>; Tue, 28 Mar 2000 12:33:11 -0700 (MST)
Message-Id: <200003281933.MAA27568 [at] cs [dot] utep.edu>
Date: Tue, 28 Mar 2000 12:33:12 -0700 (MST)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: an article in Notices AMS
To: reliable_computing [at] interval [dot] usl.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: 8P/PBdoV9caLwE1K5PnqPQ==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Thomas C. Hales has published a popular article in April issue of Notices of the 
American Math. Society in which he describes, among other things, the main ideas of 
his proof of the double bubble problem. He talks a lot about how computers helped 
in his proof; he does not specifically mention interval computations, but his 
papers do explicitly metion his use of intervals. 


From owner-reliable_computing [at] interval [dot] usl.edu  Wed Mar 29 17:54:25 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id RAA09023
	for reliable_computing-outgoing; Wed, 29 Mar 2000 17:54:25 -0600 (CST)
Received: from wombat.cs.rmit.edu.au (wombat.cs.rmit.edu.au [131.170.24.41])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id RAA09018
	for <reliable_computing [at] interval [dot] usl.edu>; Wed, 29 Mar 2000 17:54:16 -0600 (CST)
Received: from goanna.cs.rmit.edu.au (zahirt [at] goanna [dot] cs.rmit.edu.au [131.170.24.40])
	by wombat.cs.rmit.edu.au (8.9.3/8.9.3/cshub) with ESMTP id JAA26201;
	Thu, 30 Mar 2000 09:54:07 +1000 (EST)
Received: (from zahirt@localhost)
	by goanna.cs.rmit.edu.au (8.9.3/8.9.3/csnode) id JAA18435;
	Thu, 30 Mar 2000 09:54:04 +1000 (EST)
Message-Id: <200003292354.JAA18435 [at] goanna [dot] cs.rmit.edu.au>
Subject: CFP for Int. Symposium on Distributed Objects and Applications
To: ICDCS_99 [at] us [dot] ibm.com, distributed-ai-request [at] mailbase [dot] ac.uk,
        podc-post [at] bellcore [dot] com, reliable_computing [at] interval [dot] usl.edu,
        distributed-ai-request [at] mailbase [dot] ac.uk
Date: Thu, 30 Mar 2000 09:54:03 +1000 (EST)
From: "Zahir Tari" <zahirt [at] cs [dot] rmit.edu.au>
Cc: zahirt [at] goanna [dot] cs.rmit.edu.au (Zahir Tari)
X-Mailer: ELM [version 2.5 PL3]
MIME-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


                              C A L L   F O R   P A P E R S
                              =============================
___   __   __     __  __
 | | |  | |  | / |  ||  |      International Symposium on
 | | |  | |--|   |  ||  |  DISTRIBUTED OBJECTS AND APPLICATIONS
_|_| |__| |  |   |__||__| Antwerp, Belgium, September 21-23, 2000

                     http://www.cs.rmit.edu.au/conf/doa/2000/

Are you building applications using distributed objects (DO)?
Are you doing research in fundamental technology, methodology or new tools for DO?
Are you using some of the existing distributed object systems?

Consider contributing a practice report or a research paper to this
innovative event, and to present, discuss and obtain feedback for your
ideas among other practitioners and researchers active in the same area.

During DOA'2000 Symposium we want attendees to be able to evaluate
existing ORB middleware products; to analyze, and propose solutions
to major limitations of existing products; and to indicate promising
future research directions for distributed objects. We are particularly
interested in the evaluation of existing distributed object systems
and how they are used to design and to implement large scale industrial
distributed applications. We are seeking theoretical as well as
practical papers addressing innovative issues related to distributed
objects.

IMPORTANT DATES
     Electronic submission:        May 1st, 2000
     Notification of
       acceptance:                 June 10th, 2000
     Camera-ready copies:          June 30th, 2000
     Symposium:                    September 21-23, 2000

TOPICS OF INTEREST
  o Distributed and mobile agents
  o Design patterns for distributed object design
  o Database services, in particular persistency, transaction, query
    and replication services
  o Integration of distributed object and Web technologies
  o Integration with database systems and interfaces
  o Methodologies to develop distributed object applications
  o Reintegration of legacy systems in DO environments 
  o Design of CORBA, COM- and Java-based broker applications
  o Multimedia distributed objects
  o Multicast protocols for distributed objects
  o Object caching
  o Reliability, fault-tolerance and recovery
  o Real-time ORB middleware
  o Reports on Best Practice
  o Security
  o Specification and enforcement of quality of service
  o Standardization of distributed objects
  o ...


From owner-reliable_computing [at] interval [dot] usl.edu  Sat Apr  1 07:38:39 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id HAA15309
	for reliable_computing-outgoing; Sat, 1 Apr 2000 07:38:39 -0600 (CST)
Received: from argo.bas.bg (root [at] argo [dot] bas.bg [195.96.224.7])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id HAA15304
	for <reliable_computing [at] interval [dot] usl.edu>; Sat, 1 Apr 2000 07:38:35 -0600 (CST)
Received: from iph.bio.bas.bg (IDENT:0@bas-bio.lines.bas.bg [195.96.252.58])
	by argo.bas.bg (8.9.3/8.9.3/Debian 8.9.3-6) with ESMTP id QAA08631;
	Sat, 1 Apr 2000 16:38:24 +0300
X-Authentication-Warning: argo.bas.bg: Host IDENT:0@bas-bio.lines.bas.bg [195.96.252.58] claimed to be iph.bio.bas.bg
Received: from biomath.bio.bas.bg (biomath.bio.bas.bg [195.96.247.160])
	by iph.bio.bas.bg (8.9.3/8.9.3) with SMTP id QAA24986;
	Sat, 1 Apr 2000 16:40:23 +0300
Message-Id: <200004011340.QAA24986 [at] iph [dot] bio.bas.bg>
Comments: Authenticated sender is <smarkov [at] iph [dot] bio.bas.bg>
From: "Svetoslav Markov" <smarkov [at] iph [dot] bio.bas.bg>
Organization: Institute of Mathematics, BAS
To: reliable_computing [at] interval [dot] usl.edu
Date: Sat, 1 Apr 2000 15:42:35 +0200
Subject: (Fwd) Communication of last JCA Contents
Reply-to: smarkov [at] iph [dot] bio.bas.bg
CC: "Norbert Heldermann" <helder [at] cc [dot] fh-lippe.de>
Priority: normal
X-mailer: Pegasus Mail for Windows (v2.23)
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear Colleagues,

Intervals are special case of convex bodies (compact convex sets). There
 is a strong interrelation between interval analysis and convex  analysis.

I asked Prof. Heldermann, Editor of Journal of Convex Analysis (JCA) to
 communicate the contenst of JCA to our mailing list.

Prof. Heldermann, please send next JCA contents directly to the RC mailing list.

S. Markov


------- Forwarded Message Follows -------
Reply-to:      "Norbert Heldermann" <helder [at] cc [dot] fh-lippe.de>
From:          "Norbert Heldermann" <helder [at] cc [dot] fh-lippe.de>
To:            <smarkov [at] iph [dot] bio.bas.bg>
Subject:       Communication of last JCA Contents
Date:          Fri, 31 Mar 2000 22:53:25 +0200

Dear Prof. Markov,

I thank you for your offer to communicate the contents of the Journal of
Convex Analysis in the RC mailing list.

Here is my last communication, concerning the publication of Volume 6
(1999), Number 2. The first issue of Volume 7 (2000) will be published in
May 2000.

You find the list of contents of this issue together with abstracts also on
our web site:
www.heldermann.de/jcacon.htm.

Journal of Convex Analysis, Volume 6 (1999), Number 2:

R. Molle, D. Passaseo:
Variational Problems with Pointwise Constraints on the Derivatives,
215--234

T. Pennanen:
Graph-Convex Mappings and K-Convex Functions,
235--266

M. El Jarroudi:
Boundary Homogenization for a Quasi-Linear Elliptic Problem with Dirichlet
Boundary Conditions Posed on Small Inclusions Distributed on the Boundary,
267--292

R. Dziri, J.-P. Zolesio:
Dynamical Shape Control in Non-Cylindrical Navier- Stokes Equations,
293--318

L. M. Bregman, Y. Censor, S. Reich:
Dykstra's Algorithm as the Nonlinear Extension of Bregman's Optimization
Method,
319--334

K. E. Kim:
Relationship Between Dynamic Programming and the Maximum Principle Under
State Constraints,
335--348

G. Bellettini, G. Bouchitte, I. Fragala:
BV Functions with Respect to a Measure and Relaxation of Metric Integral
Functionals,
349--366

D. Pallaschke, R. Urbanski:
Invariants of Pairs of Compact Convex Sets,
367--376

J. Morgan, R. Raucci:
New Convergence Results for Nash Equilibria,
377--386

F. Huesseinov:
A Note on the Closedness of the Convex Hull and Its Applications,
387--394

J. Bair, J. C. Dupin:
The Barrier Cone of a Convex Set and the Closure of the Cover,
395--398

Forthcoming papers are listed on the page www.heldermann.de/jcafopa.htm.

Communicated by Norbert Heldermann, Heldermann Verlag

www.heldermann.de




From owner-reliable_computing [at] interval [dot] usl.edu  Sun Apr  2 15:40:10 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id PAA17726
	for reliable_computing-outgoing; Sun, 2 Apr 2000 15:40:10 -0500 (CDT)
Received: from relay.rhein-main.de (root [at] hermes [dot] rhein-main.de [195.37.8.6])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id PAA17721
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 2 Apr 2000 15:40:05 -0500 (CDT)
Received: from menuett.rhein-main.de (menuett.rhein-main.de [195.37.9.79])
	by relay.rhein-main.de (8.9.3/8.9.3) with ESMTP id WAA10639;
	Sun, 2 Apr 2000 22:31:59 +0200
Message-ID: <38E7AF96.40B3208E [at] menuett [dot] rhein-main.de>
Date: Sun, 02 Apr 2000 22:37:42 +0200
From: Jens Maurer <jmaurer [at] menuett [dot] rhein-main.de>
X-Mailer: Mozilla 4.7 [en] (X11; I; Linux 2.3.99-pre3 i686)
X-Accept-Language: en
MIME-Version: 1.0
To: "R. Baker Kearfott" <rbk [at] louisiana [dot] edu>
CC: reliable_computing [at] interval [dot] louisiana.edu
Subject: Re: New C++ Library for Interval Arithmetic
References: <2.2.32.20000314225128.0074e188 [at] pop [dot] usl.edu>
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


"R. Baker Kearfott" wrote:
[Explanation of Fortran situation]

The C++ situation is different in that a "naturally" looking interval
implementation is possible with existing language features (except for
rounding mode control), thus there is not need for modifying the
compilers.  Of course, if compilers knew how to deal with rounding
mode changes, performance would benefit.

> I am hoping that we will all examine Sun's Fortran compiler.

Since Sun's Fortran compiler is a commercial software package
and I don't know any Fortran at all, this seems currently out of
my reach.

> The above has been the subject of some controversy.  My perception
> is that, in some contexts, you will want to throw an exception,
> and, in others, you will want to continue.

Ok, there's a need for a compile-time configuration flag.
 
> Fortran does not have
> user-defined exceptions.  The reasons, as I understand them,
> include efficiency.  Fortran is a very good array-processing language,
> and there are major questions about what to do if an exception
> occurs in a component while an array operation is executing on
> an advanced-architecture machine.

By using templates, we can completely eliminate exceptions at
compile-time if the application doesn't want any. 

> Can we race J{\"u}rgen's package and yours under similar conditions?

I've performance-optimized my implementation for the basic arithmetic
operations (trigonometric functions still have containment failures)
and put it at the usual place at
http://www.rhein-main.de/people/jmaurer/interval.tar.gz
including the test program.  There's a performance overview at
http://www.rhein-main.de/people/jmaurer/interval_speed.html

I have yet to see J\"urgen's code.

> By the way, in developing template-like features in Fortran 200x,
> a consideration of the standardization committee was "avoiding
> performance hits as you see in C++".

Several C++ experts believe that the C++ language features do not
prohibit efficient implementations. However, current compilers may
still be lacking.  The template-based C++ linear algebra packages
(blitz++ and MTL come to my mind) do compare themselves with Fortran
and claim to outperform Fortran sometimes (both with decent compilers,
of course).

Jens Maurer.


From owner-reliable_computing [at] interval [dot] usl.edu  Sun Apr  2 16:10:10 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id QAA18070
	for reliable_computing-outgoing; Sun, 2 Apr 2000 16:10:09 -0500 (CDT)
Received: from marnier.ucs.usl.edu (root@ucs-gw.usl.edu [130.70.40.2])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id QAA18065
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 2 Apr 2000 16:10:07 -0500 (CDT)
Received: from u8174 (rbk5287 [at] goedel [dot] usl.edu [130.70.49.203])
	by marnier.ucs.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.3) with SMTP id QAA29661;
	Sun, 2 Apr 2000 16:09:50 -0500 (CDT)
Message-Id: <2.2.32.20000402210810.00754cd8 [at] pop [dot] usl.edu>
X-Sender: rbk5287 [at] pop [dot] usl.edu
X-Mailer: Windows Eudora Pro Version 2.2 (32)
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Date: Sun, 02 Apr 2000 16:08:10 -0500
To: Jens Maurer <jmaurer [at] menuett [dot] rhein-main.de>
From: "R. Baker Kearfott" <rbk [at] louisiana [dot] edu>
Subject: Re: New C++ Library for Interval Arithmetic
Cc: reliable_computing [at] interval [dot] louisiana.edu, Bill.Walster [at] Eng [dot] Sun.COM
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

At 10:37 PM 4/2/00 +0200, Jens Maurer wrote:
>
>"R. Baker Kearfott" wrote:
>[Explanation of Fortran situation]
>
>The C++ situation is different in that a "naturally" looking interval
>implementation is possible with existing language features (except for
>rounding mode control), thus there is not need for modifying the
>compilers.  Of course, if compilers knew how to deal with rounding
>mode changes, performance would benefit.
>

What do you mean by "natural-looking"?  Operator overloading is
possible in Fortran without compiler modification, but use of
special symbols such as, say "[" and "]" to denote an interval
[a,b], is not.  Furthermore, good support for overloading I/O
will be available, but not before the next Fortran standard is
implemented, some time after 2004.

Close ties to the computer rounding and also to the intrinsic function
libraries are a major argument for having intrinsic compiler support
for interval arithmetic.  In fact, an efficiency factor of at least 5
is obtainable, even if the overloaded operations are in-lined.  The
observable factor with actual packages has been much higher than 5.
I'd be interested in seeing what Bill Walster has to say about this.

>> I am hoping that we will all examine Sun's Fortran compiler.
>
>Since Sun's Fortran compiler is a commercial software package
>and I don't know any Fortran at all, this seems currently out of
>my reach.

Ah, yes.  That, as I see it, is the strongest argument in favor of
using C++.  Namely, more computer professionals and commercial
software houses are using it, especially outside of the large scale
numerical computing core.  An argument against C++ may be that the
standard is in more of a state of flux, and it may be more difficult
to write portable code.  Is that true?


>> Can we race J{\"u}rgen's package and yours under similar conditions?
>
>I've performance-optimized my implementation for the basic arithmetic
>operations (trigonometric functions still have containment failures)
>and put it at the usual place at
>http://www.rhein-main.de/people/jmaurer/interval.tar.gz
>including the test program.  There's a performance overview at
>http://www.rhein-main.de/people/jmaurer/interval_speed.html
>

>I have yet to see J\"urgen's code.

Does someone volunteer to do the experiments?


>
>> By the way, in developing template-like features in Fortran 200x,
>> a consideration of the standardization committee was "avoiding
>> performance hits as you see in C++".
>
>Several C++ experts believe that the C++ language features do not
>prohibit efficient implementations. However, current compilers may
>still be lacking.  The template-based C++ linear algebra packages
>(blitz++ and MTL come to my mind) do compare themselves with Fortran
>and claim to outperform Fortran sometimes (both with decent compilers,
>of course).
>

It'll be interesting to see how this develops.

Best regards,

Baker


---------------------------------------------------------------
R. Baker Kearfott,    rbk [at] louisiana [dot] edu   (337) 482-5346 (fax)
(337) 482-5270 (work)                     (337) 981-9744 (home)
URL: http://interval.louisiana.edu/kearfott.html
Department of Mathematics, University of Louisiana at Lafayette
Box 4-1010, Lafayette, LA 70504-1010, USA
---------------------------------------------------------------


From owner-reliable_computing [at] interval [dot] usl.edu  Sun Apr  2 17:37:22 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id RAA18470
	for reliable_computing-outgoing; Sun, 2 Apr 2000 17:37:22 -0500 (CDT)
Received: from narech.irin.univ-nantes.fr (IDENT:root [at] narech [dot] irin.sciences.univ-nantes.fr [193.52.99.2])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id RAA18465
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 2 Apr 2000 17:37:19 -0500 (CDT)
Received: from (goualard@localhost)
          by narech.irin.univ-nantes.fr (8.9.3/jtpda-5.3.2) id AAA26673
          ; Mon, 3 Apr 2000 00:37:11 +0200
Date: Mon, 3 Apr 2000 00:37:11 +0200
From: Frederic.Goualard [at] irin [dot] univ-nantes.fr (Frederic Goualard)
Message-Id: <200004022237.AAA26673 [at] narech [dot] irin.univ-nantes.fr>
To: rbk [at] louisiana [dot] edu
Subject: Re: New C++ Library for Interval Arithmetic
Cc: jmaurer [at] menuett [dot] rhein-main.de, reliable_computing [at] interval [dot] louisiana.edu
MIME-Version: 1.0
Content-Type: text/plain; charset=iso-8859-1
Content-Transfer-Encoding: 8bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear Prof. Kearfott,

>>
>>> By the way, in developing template-like features in Fortran 200x,
>>> a consideration of the standardization committee was "avoiding
>>> performance hits as you see in C++".
>>
>>Several C++ experts believe that the C++ language features do not
>>prohibit efficient implementations. However, current compilers may
>>still be lacking.  The template-based C++ linear algebra packages
>>(blitz++ and MTL come to my mind) do compare themselves with Fortran
>>and claim to outperform Fortran sometimes (both with decent compilers,
>>of course).
>>
>
>It'll be interesting to see how this develops.

During my PhD thesis, I have developed a C++ interval library in both templated and non-templated versions. I have tested both versions for speed
using g++ 1.1.2 on a SUN UltraSparc 1/167 MHz. Please find enclosed herein some timings for basic operations.
As you may see, the templated version slightly outperforms the non-templated one. In my humble opinion, an explanation to this is that the compiler has more opportunities to inline the methods from the templated version since then, both the library and the program using it are compiled at the same moment. On the other hand, the compiling time for my benchmarks increases by a factor of about 2.7 when using templates.

-------------------------------------------------
Time in milliseconds on a SUN UltraSparc 1/167 MHz with gcc 1.1.2 and -O2 optimization flag for:

- 43,226,575 additions
- 43,226,575 subtractions
- 24,700,900 multiplications
- 12,350,450 divisions

     templated      non-templated
----------------------------------
Add: 19,204         34,445
Sub: 17,526         34,543
Mul: 17,220         29,709
Div: 33,105         39,561


Sincerely yours,

Frédéric Goualard.

From owner-reliable_computing [at] interval [dot] usl.edu  Mon Apr  3 10:45:52 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA00508
	for reliable_computing-outgoing; Mon, 3 Apr 2000 10:45:52 -0500 (CDT)
Received: from lukla.Sun.COM (lukla.Sun.COM [192.18.98.31])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA00503
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 3 Apr 2000 10:45:48 -0500 (CDT)
Received: from engmail1.Eng.Sun.COM ([129.146.1.13])
	by lukla.Sun.COM (8.9.3+Sun/8.9.3) with ESMTP id JAA29747;
	Mon, 3 Apr 2000 09:45:42 -0600 (MDT)
Received: from ha-sims.eng.sun.com (phys-thestorka.Eng.Sun.COM [129.146.1.231])
	by engmail1.Eng.Sun.COM (8.9.1b+Sun/8.9.1/ENSMAIL,v1.6) with ESMTP id IAA14150;
	Mon, 3 Apr 2000 08:45:41 -0700 (PDT)
Received: from gww (gww.Eng.Sun.COM [129.146.78.116])
 by ha-sims.eng.sun.com (Sun Internet Mail Server sims.4.0.1999.06.13.00.20)
 with SMTP id <0FSG0020N6G466@ha-sims.eng.sun.com>; Mon,
 3 Apr 2000 08:45:40 -0700 (PDT)
Date: Mon, 03 Apr 2000 08:45:41 -0700 (PDT)
From: William Walster <bill.walster [at] eng [dot] sun.com>
Subject: Re: New C++ Library for Interval Arithmetic
To: jmaurer [at] menuett [dot] rhein-main.de, rbk [at] louisiana [dot] edu
Cc: reliable_computing [at] interval [dot] louisiana.edu, Bill.Walster [at] eng [dot] sun.com
Reply-to: William Walster <bill.walster [at] eng [dot] sun.com>
Message-id: <0FSG0020O6G466@ha-sims.eng.sun.com>
MIME-version: 1.0
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4m sparc
Content-type: TEXT/plain; charset=us-ascii
Content-MD5: khRgEi6B1pFdnZlT32hugw==
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


  >Date: Sun, 02 Apr 2000 16:08:10 -0500
  >From: "R. Baker Kearfott" <rbk [at] louisiana [dot] edu>
  >Subject: Re: New C++ Library for Interval Arithmetic
  >X-Sender: rbk5287 [at] pop [dot] usl.edu
  >To: Jens Maurer <jmaurer [at] menuett [dot] rhein-main.de>
  >Cc: reliable_computing [at] interval [dot] louisiana.edu, Bill.Walster [at] Eng [dot] Sun.COM
  >MIME-version: 1.0
  >
  >At 10:37 PM 4/2/00 +0200, Jens Maurer wrote:
  >>
  >>"R. Baker Kearfott" wrote:
  >>[Explanation of Fortran situation]
  >>
  >>The C++ situation is different in that a "naturally" looking interval
  >>implementation is possible with existing language features (except for
  >>rounding mode control), thus there is not need for modifying the
  >>compilers.  Of course, if compilers knew how to deal with rounding
  >>mode changes, performance would benefit.
  >>
  >
  >What do you mean by "natural-looking"?  Operator overloading is
  >possible in Fortran without compiler modification, but use of
  >special symbols such as, say "[" and "]" to denote an interval
  >[a,b], is not.  Furthermore, good support for overloading I/O
  >will be available, but not before the next Fortran standard is
  >implemented, some time after 2004.
  >
  >Close ties to the computer rounding and also to the intrinsic function
  >libraries are a major argument for having intrinsic compiler support
  >for interval arithmetic.  In fact, an efficiency factor of at least 5
  >is obtainable, even if the overloaded operations are in-lined.  The
  >observable factor with actual packages has been much higher than 5.
  >I'd be interested in seeing what Bill Walster has to say about this.
  
Baker and Jens,

We also have a C++ class implementation that is currently being tested
and will be released later this CY.  It implements all of the features
in the Fortran implementation that are not Fortran-specific.  As much
as possible, we have used the same spellings for intrinsic functions and
operators.

Your pointers to existing C++ classes are helpful for the purpose of
doing some performance comparisons.  We believe that the C++ and 
Fortran implementations should have similar runtime performance.  They
both use the same  implementation libraries.

The key is doing whatever is necessary to provide the interval infrastructure
needed for independent software vendors (ISVs) to develop and produce
commercial interval applications.   

Regards,

Bill


	G. William (Bill) Walster, Ph.D. 
	Interval Technology Engineering Manager
	Sun Microsystems, Inc.
	16 Network Circle, MS UMPK16-304
	Menlo Park, CA 94025
	(650) 786-9004 Direct
	(650) 786-9551 Fax
	(800) 759-8888 Pager PIN 171-2423

	bill.walster [at] eng [dot] sun.com



From owner-reliable_computing [at] interval [dot] usl.edu  Mon Apr  3 12:27:27 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id MAA01068
	for reliable_computing-outgoing; Mon, 3 Apr 2000 12:27:27 -0500 (CDT)
Received: from mailhost2.avanticorp.com (mailhost2.avanticorp.com [208.206.213.19])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id MAA01063
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 3 Apr 2000 12:27:23 -0500 (CDT)
Received: from mailhost2.avanticorp.com (root@localhost [127.0.0.1])
	by mailhost2.avanticorp.com (8.9.3/8.9.3) with ESMTP id KAA19468
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 3 Apr 2000 10:27:13 -0700 (PDT)
Received: (from root@localhost)
	by mailhost2.avanticorp.com (8.9.3/8.9.3) id KAA19369;
	Mon, 3 Apr 2000 10:26:45 -0700 (PDT)
Received: (from uucp@localhost)
	by mailhost2.avanticorp.com (8.9.3/8.9.3) id OAA04578
	for <zongwut [at] avanticorp [dot] com>; Sun, 2 Apr 2000 14:10:53 -0700 (PDT)
Received: from interval.usl.edu(130.70.43.77)
 via SMTP by asuras.avanticorp.com, id smtpdAAAa0017W; Sun Apr  2 14:10:50 2000
Received: from localhost (daemon@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with SMTP id QAA18113;
	Sun, 2 Apr 2000 16:10:34 -0500 (CDT)
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id QAA18070
	for reliable_computing-outgoing; Sun, 2 Apr 2000 16:10:09 -0500 (CDT)
Received: from marnier.ucs.usl.edu (root@ucs-gw.usl.edu [130.70.40.2])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id QAA18065
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 2 Apr 2000 16:10:07 -0500 (CDT)
Received: from u8174 (rbk5287 [at] goedel [dot] usl.edu [130.70.49.203])
	by marnier.ucs.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.3) with SMTP id QAA29661;
	Sun, 2 Apr 2000 16:09:50 -0500 (CDT)
Message-Id: <2.2.32.20000402210810.00754cd8 [at] pop [dot] usl.edu>
X-Sender: rbk5287 [at] pop [dot] usl.edu
X-Mailer: Windows Eudora Pro Version 2.2 (32)
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Date: Sun, 02 Apr 2000 16:08:10 -0500
To: Jens Maurer <jmaurer [at] menuett [dot] rhein-main.de>
From: "R. Baker Kearfott" <rbk [at] louisiana [dot] edu>
Subject: Re: New C++ Library for Interval Arithmetic
Cc: reliable_computing [at] interval [dot] louisiana.edu, Bill.Walster [at] Eng [dot] Sun.COM
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


From owner-reliable_computing [at] interval [dot] usl.edu  Mon Apr  3 12:30:06 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id MAA01200
	for reliable_computing-outgoing; Mon, 3 Apr 2000 12:30:06 -0500 (CDT)
Received: from mailhost2.avanticorp.com (mailhost2.avanticorp.com [208.206.213.19])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id MAA01193
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 3 Apr 2000 12:30:00 -0500 (CDT)
Received: from mailhost2.avanticorp.com (root@localhost [127.0.0.1])
	by mailhost2.avanticorp.com (8.9.3/8.9.3) with ESMTP id KAA19931
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 3 Apr 2000 10:29:55 -0700 (PDT)
Received: (from root@localhost)
	by mailhost2.avanticorp.com (8.9.3/8.9.3) id KAA19899;
	Mon, 3 Apr 2000 10:29:48 -0700 (PDT)
Received: (from uucp@localhost)
	by mailhost2.avanticorp.com (8.9.3/8.9.3) id PAA04829
	for <zongwut [at] avanticorp [dot] com>; Sun, 2 Apr 2000 15:41:25 -0700 (PDT)
Received: from interval.usl.edu(130.70.43.77)
 via SMTP by asuras.avanticorp.com, id smtpdAAAa001BR; Sun Apr  2 15:41:24 2000
Received: from localhost (daemon@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with SMTP id RAA18513;
	Sun, 2 Apr 2000 17:37:44 -0500 (CDT)
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id RAA18470
	for reliable_computing-outgoing; Sun, 2 Apr 2000 17:37:22 -0500 (CDT)
Received: from narech.irin.univ-nantes.fr (IDENT:root [at] narech [dot] irin.sciences.univ-nantes.fr [193.52.99.2])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id RAA18465
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 2 Apr 2000 17:37:19 -0500 (CDT)
Received: from (goualard@localhost)
          by narech.irin.univ-nantes.fr (8.9.3/jtpda-5.3.2) id AAA26673
          ; Mon, 3 Apr 2000 00:37:11 +0200
Date: Mon, 3 Apr 2000 00:37:11 +0200
From: Frederic.Goualard [at] irin [dot] univ-nantes.fr (Frederic Goualard)
Message-Id: <200004022237.AAA26673 [at] narech [dot] irin.univ-nantes.fr>
To: rbk [at] louisiana [dot] edu
Subject: Re: New C++ Library for Interval Arithmetic
Cc: jmaurer [at] menuett [dot] rhein-main.de, reliable_computing [at] interval [dot] louisiana.edu
MIME-Version: 1.0
Content-Type: text/plain; charset=iso-8859-1
X-MIME-Autoconverted: from 8bit to quoted-printable by interval.usl.edu id RAA18513
Content-Transfer-Encoding: 8bit
X-MIME-Autoconverted: from quoted-printable to 8bit by interval.usl.edu id MAA01196
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


From owner-reliable_computing [at] interval [dot] usl.edu  Mon Apr  3 12:36:08 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id MAA01520
	for reliable_computing-outgoing; Mon, 3 Apr 2000 12:36:07 -0500 (CDT)
Received: from zmit1.ippt.gov.pl (zmit1.ippt.gov.pl [148.81.53.8])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id MAA01509
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 3 Apr 2000 12:35:54 -0500 (CDT)
Received: (from zkulpa@localhost) by zmit1.ippt.gov.pl (8.8.5/8.7.3-zmit) id TAA12043 for reliable_computing [at] interval [dot] louisiana.edu; Mon, 3 Apr 2000 19:35:27 +0200 (MET DST)
Date: Mon, 3 Apr 2000 19:35:27 +0200 (MET DST)
From: Zenon Kulpa <zkulpa [at] zmit1 [dot] ippt.gov.pl>
Message-Id: <200004031735.TAA12043 [at] zmit1 [dot] ippt.gov.pl>
To: reliable_computing [at] interval [dot] louisiana.edu
Subject: Re: New C++ Library for Interval Arithmetic
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Hey, what is going on on the list?
I have just received two messages with empty contents, see below...

-- Zenon Kulpa

----- Begin Included Message -----

From owner-reliable_computing [at] interval [dot] usl.edu Mon Apr  3 19:31:05 2000
Date: Mon, 3 Apr 2000 00:37:11 +0200
From: Frederic.Goualard [at] irin [dot] univ-nantes.fr (Frederic Goualard)
To: rbk [at] louisiana [dot] edu
Subject: Re: New C++ Library for Interval Arithmetic
Cc: jmaurer [at] menuett [dot] rhein-main.de, reliable_computing [at] interval [dot] louisiana.edu
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Content-Length: 0

----- End Included Message -----


----- Begin Included Message -----

From owner-reliable_computing [at] interval [dot] usl.edu Mon Apr  3 19:28:16 2000
Date: Sun, 02 Apr 2000 16:08:10 -0500
To: Jens Maurer <jmaurer [at] menuett [dot] rhein-main.de>
From: "R. Baker Kearfott" <rbk [at] louisiana [dot] edu>
Subject: Re: New C++ Library for Interval Arithmetic
Cc: reliable_computing [at] interval [dot] louisiana.edu, Bill.Walster [at] Eng [dot] Sun.COM
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Content-Length: 0

----- End Included Message -----


From owner-reliable_computing [at] interval [dot] usl.edu  Mon Apr  3 15:06:33 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id PAA02258
	for reliable_computing-outgoing; Mon, 3 Apr 2000 15:06:33 -0500 (CDT)
Received: from marnier.ucs.usl.edu (root@ucs-gw.usl.edu [130.70.40.2])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id PAA02253
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 3 Apr 2000 15:06:30 -0500 (CDT)
Received: from u8174 (rbk5287 [at] goedel [dot] usl.edu [130.70.49.203])
	by marnier.ucs.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.3) with SMTP id PAA08499
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 3 Apr 2000 15:06:27 -0500 (CDT)
Message-Id: <2.2.32.20000403200401.0076d7a8 [at] pop [dot] usl.edu>
X-Sender: rbk5287 [at] pop [dot] usl.edu
X-Mailer: Windows Eudora Pro Version 2.2 (32)
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Date: Mon, 03 Apr 2000 15:04:01 -0500
To: reliable_computing [at] interval [dot] louisiana.edu
From: "R. Baker Kearfott" <rbk [at] louisiana [dot] edu>
Subject: Re: empty messages from reliable_computing
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

List members:

i'm not sure what caused this, but the list seems to be working
now.  There was a bad electrical storm here this morning, with
a momentary outage.  Perhaps an uninterruptible power supply on
interval.louisiana.edu would help???

I'll be alert to see if this happens again.

Baker

At 07:35 PM 4/3/00 +0200, Zenon Kulpa wrote:
>Hey, what is going on on the list?
>I have just received two messages with empty contents, see below...
>
>-- Zenon Kulpa
>
>----- Begin Included Message -----
>
>>From owner-reliable_computing [at] interval [dot] usl.edu Mon Apr  3 19:31:05 2000
>Date: Mon, 3 Apr 2000 00:37:11 +0200
>From: Frederic.Goualard [at] irin [dot] univ-nantes.fr (Frederic Goualard)
>To: rbk [at] louisiana [dot] edu
>Subject: Re: New C++ Library for Interval Arithmetic
>Cc: jmaurer [at] menuett [dot] rhein-main.de, reliable_computing [at] interval [dot] louisiana.edu
>Sender: owner-reliable_computing [at] interval [dot] usl.edu
>Content-Length: 0
>
>----- End Included Message -----
>
>
>----- Begin Included Message -----
>
>>From owner-reliable_computing [at] interval [dot] usl.edu Mon Apr  3 19:28:16 2000
>Date: Sun, 02 Apr 2000 16:08:10 -0500
>To: Jens Maurer <jmaurer [at] menuett [dot] rhein-main.de>
>From: "R. Baker Kearfott" <rbk [at] louisiana [dot] edu>
>Subject: Re: New C++ Library for Interval Arithmetic
>Cc: reliable_computing [at] interval [dot] louisiana.edu, Bill.Walster [at] Eng [dot] Sun.COM
>Sender: owner-reliable_computing [at] interval [dot] usl.edu
>Content-Length: 0
>
>----- End Included Message -----
>

---------------------------------------------------------------
R. Baker Kearfott,    rbk [at] louisiana [dot] edu   (337) 482-5346 (fax)
(337) 482-5270 (work)                     (337) 981-9744 (home)
URL: http://interval.louisiana.edu/kearfott.html
Department of Mathematics, University of Louisiana at Lafayette
Box 4-1010, Lafayette, LA 70504-1010, USA
---------------------------------------------------------------


From owner-reliable_computing [at] interval [dot] usl.edu  Tue Apr  4 16:34:39 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id QAA05401
	for reliable_computing-outgoing; Tue, 4 Apr 2000 16:34:39 -0500 (CDT)
Received: from relay.rhein-main.de (root [at] hermes [dot] rhein-main.de [195.37.8.6])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id QAA05396
	for <reliable_computing [at] interval [dot] louisiana.edu>; Tue, 4 Apr 2000 16:34:33 -0500 (CDT)
Received: from menuett.rhein-main.de (menuett.rhein-main.de [195.37.9.79])
	by relay.rhein-main.de (8.9.3/8.9.3) with ESMTP id XAA06654;
	Tue, 4 Apr 2000 23:26:11 +0200
Message-ID: <38EA5FFA.B7D7B63C [at] menuett [dot] rhein-main.de>
Date: Tue, 04 Apr 2000 23:34:50 +0200
From: Jens Maurer <jmaurer [at] menuett [dot] rhein-main.de>
X-Mailer: Mozilla 4.7 [en] (X11; I; Linux 2.3.99-pre3 i686)
X-Accept-Language: en
MIME-Version: 1.0
To: "R. Baker Kearfott" <rbk [at] louisiana [dot] edu>
CC: reliable_computing [at] interval [dot] louisiana.edu
Subject: Re: New C++ Library for Interval Arithmetic
References: <2.2.32.20000402210810.00754cd8 [at] pop [dot] usl.edu>
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

"R. Baker Kearfott" wrote:
> What do you mean by "natural-looking"?  Operator overloading is
> possible in Fortran without compiler modification,

This is where my ignorance shows off: I didn't know Fortran had
operator overloading.

>   Furthermore, good support for overloading I/O
> will be available, but not before the next Fortran standard is
> implemented, some time after 2004.

There, C++ has an advantage :-) [Please, no language flame-war.]

> An argument against C++ may be that the
> standard is in more of a state of flux, and it may be more difficult
> to write portable code.  Is that true?

The C++ standard is approved as ISO 14882 since 1998. It is available
for USD 18 at www.ansi.org.  The standard itself is thus fixed
except for a bunch of defect reports, mostly for non-essential library
features.  Writing portable code should therefore be easy, but it
is still not natural have a compiler and library which is actually
standards-compliant.
Much to the grief of the community, the widely used Microsoft Visual
C++ is lacking many features in its compiler which also prevents a
standards-compliant library usable with MSVC from happening.

I plan to make my interval implementation MSVC-compatible so that it
is usable for a substantial audience. Actually, it should work as-is,
but I haven't tested it with MSVC yet.

> >I have yet to see J\"urgen's code.
> 
> Does someone volunteer to do the experiments?

I can do that, but without J"uergen's code, it's going to 
be somewhat difficult :-)
 
Jens Maurer.


From owner-reliable_computing [at] interval [dot] usl.edu  Thu Apr  6 04:45:48 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id EAA09543
	for reliable_computing-outgoing; Thu, 6 Apr 2000 04:45:48 -0500 (CDT)
Received: from dimoni.upc.es (dimoni.upc.es [147.83.2.62])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id EAA09538
	for <reliable_computing [at] interval [dot] usl.edu>; Thu, 6 Apr 2000 04:45:33 -0500 (CDT)
Received: from berlioz.upc.es (berlioz.upc.es [147.83.2.176])
	by dimoni.upc.es (8.8.8+Sun/8.8.8) with ESMTP id LAA28443
	for <reliable_computing [at] interval [dot] usl.edu>; Thu, 6 Apr 2000 11:45:08 +0200 (MET DST)
Received: from upc.es ([147.83.22.29])
          by granados.upc.es (Lotus Domino Release 5.0.3 (Intl))
          with ESMTP id 2000040611450630:794 ;
          Thu, 6 Apr 2000 11:45:06 +0200 
Message-ID: <38EC5CA0.B514501C [at] upc [dot] es>
Date: Thu, 06 Apr 2000 11:45:05 +0200
From: M Rosa Estela Carbonell <m.rosa.estela [at] upc [dot] es>
X-Mailer: Mozilla 4.5 [es] (Win95; I)
X-Accept-Language: es
MIME-Version: 1.0
To: reliable_computing [at] interval [dot] usl.edu
Subject: CLM-stability criterion
X-MIMETrack: Itemize by SMTP Server on Granados/UPC(Release 5.0.3 (Intl)|21 March 2000) at
 04/06/2000 11:45:06 AM,
	Serialize by Router on Berlioz/UPC(Release 5.0.3 (Intl)|21 March 2000) at
 04/06/2000 11:45:12 AM,
	Serialize complete at 04/06/2000 11:45:12 AM
Content-Transfer-Encoding: 7bit
Content-Type: text/plain; charset=us-ascii
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear interval researchers,

I'm interested to get the enunciated of the Cremer-Leonhard-Michailov
(CLM)-
stability criterion that appears in Unbehauen, H. Control Engineering
(in German),
9th edition, Vieweg-Verlag, Braunschweig, (1997).

Many thanks in advance.

M.Rosa Estela Carbonell
m.rosa.estela [at] upc [dot] es


From owner-reliable_computing [at] interval [dot] usl.edu  Wed Apr 12 19:42:35 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id TAA24049
	for reliable_computing-outgoing; Wed, 12 Apr 2000 19:42:34 -0500 (CDT)
Received: from kleene.math.wisc.edu (kleene.math.wisc.edu [144.92.166.90])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id TAA24044
	for <reliable_computing [at] interval [dot] louisiana.edu>; Wed, 12 Apr 2000 19:41:14 -0500 (CDT)
Received: from forelli.math.wisc.edu (forelli.math.wisc.edu [144.92.166.70])
	by kleene.math.wisc.edu (8.9.3/8.9.3) with SMTP id TAA23562;
	Wed, 12 Apr 2000 19:24:55 -0500 (CDT)
Date: Wed, 12 Apr 2000 19:49:46 -0500 (CDT)
From: Hans Schneider <hans [at] math [dot] wisc.edu>
To: NETS -- at-net <at-net [at] mi [dot] uni-erlangen.de>,
        "Hershkowitz, Danny -- Hershkowitz Daniel" <hershkow [at] aluf [dot] technion.ac.il>,
        Danny Hershkowitz <hershkow [at] techunix [dot] technion.ac.il>,
        E-LETTER <eletter-request [at] win [dot] tue.nl>,
        "na.digest" <na.digest@na-net.ornl.gov>, ipnet-digest [at] math [dot] msu.edu,
        wim@bell-labs.com, hjt [at] eos [dot] ncsu.edu, vkm [at] eedsp [dot] gatech.edu,
        reliable_computing [at] interval [dot] louisiana.edu
Subject: LAA contents
Message-ID: <Pine.GSO.3.96.1000412194729.27288B-100000 [at] forelli [dot] math.wisc.edu>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


Dear Net Organizer:

Please circulate the attached LAA contents over your net.

Thanks

hans



------------------------------------------------------------------------------
Hans Schneider                                 hans [at] math [dot] wisc.edu.
Department of Mathematics                      608-262-1402 (Work)
Van Vleck Hall                                 608-271-7252 (Home)
480 Lincoln Drive                              608-263-8891 (Work FAX)
University of Wisconsin-Madison                608-271-8477 (Home FAX)
Madison WI 53706 USA             http://www.math.wisc.edu/~hans (URL)
------------------------------------------------------------------------------





             ContentsDirect from Elsevier Science
            =====================================

URL: http://www.elsevier.nl/locate/jnlnr/07738

Journal: Linear Algebra and Its Applications
ISSN   : 0024-3795
Volume : 308
Issue  : 1-3
Date   : 13-Apr-2000


pp 1-29
Normal forms of generic triangular band matrices and Jordan forms of
nilpotent completions
MI Gekthman, L Rodman

pp 31-64
Generalized-confluent Cauchy and Cauchy-Vandermonde matrices
ZHENGHONG Yang

pp 65-75
Pascal k-eliminated functional matrix and it's property
M Bayat

pp 77-84
Matrix young inequalities for the Hilbert-Schmidt norm
O Hirzallah, F Kittaneh

pp 85-107
Representation and approximation of the outer inverse A_T,S^(2) of a
matrix A
YONGLIN Chen

pp 109-119
Metric projection and stratification of the Grassmannian
M Finzel

pp 121-137
Spectrally arbitrary patterns
JH Drew, P Van Den Driessche

pp 139-152
Decomposable numerical ranges on orthonormal tensors
CK Li

pp 153-161
Estimates for the spectrum near algebraic elements
Y Chen, T Ransford

pp 163-181
An extension problem for discrete- time almost periodically
correlated stochastic processes
D Alpay

pp 183-202
Pade approximation for the exponential of a block triangular matrix
L Diece

pp 203-211
Notes on matrix arithmetic- geometric mean inequalities
R Bhatia

pp 217-217
Author index
---


NOTE:
ContentsDirect, which is automatically generated, lists the first author
of each paper and the corresponding author (if different). 






From owner-reliable_computing [at] interval [dot] usl.edu  Thu Apr 13 11:01:35 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id LAA26046
	for reliable_computing-outgoing; Thu, 13 Apr 2000 11:01:34 -0500 (CDT)
Received: from kleene.math.wisc.edu (kleene.math.wisc.edu [144.92.166.90])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id LAA26041
	for <reliable_computing [at] interval [dot] louisiana.edu>; Thu, 13 Apr 2000 11:01:11 -0500 (CDT)
Received: from forelli.math.wisc.edu (forelli.math.wisc.edu [144.92.166.70])
	by kleene.math.wisc.edu (8.9.3/8.9.3) with SMTP id KAA02761;
	Thu, 13 Apr 2000 10:44:53 -0500 (CDT)
Date: Thu, 13 Apr 2000 11:09:49 -0500 (CDT)
From: Hans Schneider <hans [at] math [dot] wisc.edu>
To: NETS -- at-net <at-net [at] mi [dot] uni-erlangen.de>,
        "Hershkowitz, Danny -- Hershkowitz Daniel" <hershkow [at] aluf [dot] technion.ac.il>,
        Danny Hershkowitz <hershkow [at] techunix [dot] technion.ac.il>,
        E-LETTER <eletter-request [at] win [dot] tue.nl>,
        "na.digest" <na.digest@na-net.ornl.gov>, ipnet-digest [at] math [dot] msu.edu,
        wim@bell-labs.com, hjt [at] eos [dot] ncsu.edu, vkm [at] eedsp [dot] gatech.edu,
        reliable_computing [at] interval [dot] louisiana.edu
Subject: LAA contents
Message-ID: <Pine.GSO.3.96.1000413110702.29451A-100000 [at] forelli [dot] math.wisc.edu>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk



Dear Net Organizer:

Please circulate the attached LAA contents over your net.

Thanks

hans
---



------------------------------------------------------------------------------
Hans Schneider                                 hans [at] math [dot] wisc.edu.
Department of Mathematics                      608-262-1402 (Work)
Van Vleck Hall                                 608-271-7252 (Home)
480 Lincoln Drive                              608-263-8891 (Work FAX)
University of Wisconsin-Madison                608-271-8477 (Home FAX)
Madison WI 53706 USA             http://www.math.wisc.edu/~hans (URL)
------------------------------------------------------------------------------






             ContentsDirect from Elsevier Science
            =====================================

URL: http://www.elsevier.nl/locate/jnlnr/07738

Journal: Linear Algebra and Its Applications
ISSN   : 0024-3795
Volume : 309
Issue  : 1-3
Date   : 20-Apr-2000

Proceedings of the international worskhop on accurate solutions of eigenvalue
problems
Special editors: Jesse L. Barlow, Beresford N. Parlett, Kresimir Veslic

pp 1-2
Preface: The Accurate solution of Eigenvalue Problems
JL Barlow

pp 3-18
Weyl-type relative perturbation bounds for eigenvalues of Hermitian
matrices
FM Dopico, JM Molera

pp 19-43
Optimal perturbation bounds for the Hermitian eigenvalue problem
JL Barlow

pp 45-56
Absolute and relative perturbation bounds for invariant subspaces of
matrices
ICF Ipsen

pp 57-72
Relative perturbation theory for hyperbolic eigenvalue problem
I Slapnicar

pp 73-83
Accuracy assessment for eigencomputations: variety of backward errors
and pseudospectra
F Chaitin-Chatelin, E Traviesas

pp 85-102
Perturbation theory for the eigenvalues of factorised symmetric
matrices
K Veselic

pp 103-119
Rounding-error and perturbation bounds for the indefinite QR
factorization
S Singer

pp 121-151
Relatively robust representations of symmetric tridiagonals
BN Parlett

pp 153-174
QR factorization with complete pivoting and accurate computation of
the SVD
NJ Higham

pp 175-190
Exponential splittings of products of matrices and accurately
computing singular values of long products
S Oliveira, DE Stewart

pp 191-215
Approximate eigenvectors as preconditioner
Z Drmac

pp 217-259
An implementation of dqds algorithm (positive case)
BN Parlett

pp 261-287
Balancing sparse matrices for computing eigenvalues
TY Chen, J Demmel

pp 289-306
Large sparse symmetric eigenvalue problems with homogeneous linear
constraints: the Lanczos process with inner-outer iterations
GH Golub, H Zha

pp 307-323
The influence of orthogonality on the Arnoldi method
T Braconnier

pp 325-337
The relative error in the Pruess method for Sturm-Liouville problems
P Kosowski

pp 339-361
Backward error and condition of polynomial eigenvalue problems
F Tisseur

pp 363-363
Author index
---


NOTE:
ContentsDirect, which is automatically generated, lists the first author
of each paper and the corresponding author (if different). 



From owner-reliable_computing [at] interval [dot] usl.edu  Sat Apr 15 21:15:16 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id VAA00505
	for reliable_computing-outgoing; Sat, 15 Apr 2000 21:15:15 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id VAA00490
	for <reliable_computing [at] interval [dot] usl.edu>; Sat, 15 Apr 2000 21:15:08 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.10.1/8.10.1) with SMTP id e3FKm8125925;
	Sat, 15 Apr 2000 14:48:09 -0600 (MDT)
Message-Id: <200004152048.e3FKm8125925 [at] cs [dot] utep.edu>
Date: Sat, 15 Apr 2000 14:48:09 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: P.S. Conference in St. Petersburg
To: reliable_computing [at] interval [dot] usl.edu, interval [at] cs [dot] utep.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: PquEBqJM+yZ8eXZd0FhnJA==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

In order to set up a program on time, Dr. Vasiliev, the general chair of the 
conference, would like to have the names and titles of almost all the speakers 
by May 1, 2000. Abstracts can still be submitted by May 15. 


From owner-reliable_computing [at] interval [dot] usl.edu  Sat Apr 15 21:15:16 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id VAA00506
	for reliable_computing-outgoing; Sat, 15 Apr 2000 21:15:15 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id VAA00492
	for <reliable_computing [at] interval [dot] usl.edu>; Sat, 15 Apr 2000 21:15:09 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.10.1/8.10.1) with SMTP id e3FLCQZ26183;
	Sat, 15 Apr 2000 15:12:26 -0600 (MDT)
Message-Id: <200004152112.e3FLCQZ26183 [at] cs [dot] utep.edu>
Date: Sat, 15 Apr 2000 15:12:27 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: SCI'2000: submission deadline extended to May 17
To: reliable_computing [at] interval [dot] usl.edu, interval [at] cs [dot] utep.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=ISO-8859-1
Content-MD5: b+dVV5bMOiAp7lUVpQq0ag==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc 
Content-Transfer-Encoding: 8bit
X-MIME-Autoconverted: from QUOTED-PRINTABLE to 8bit by interval.usl.edu id VAA00495
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

FYI: this is the conference about which Dr. Corliss suggested a few months ago 
that an interval presence may be beneficial.

------------- Begin Forwarded Message -------------

Date: Sat, 15 Apr 2000 15:12:38 -0400
From: Nagib Callaos <sci2000 [at] iiisconferences [dot] org>

Subject: 4th World Multiconference on Systemics, Cybernetics, and Informatics 
SCI'2000

Dear Colleague:


Let me inform you that we extended the deadlines because the problems we
had with the server, 
and because we achieved an agreement with proceedings printing shop that
allows us to do it. 
The extended deadlines are as follow:

· May 17, 2000 ~ Submission of extended abstracts (500-1500 words) or paper
Drafts (2000-5000 words)
· May 22, 2000 ~ Acceptance notifications
· June 19, 2000  ~ Submission of camera ready papers: hard copies and
electronic     versions

If you need more time let us know about it, along with your paper title,
topic or area, 
to examine if its potential reviewers would make it feasible for you.

Additional information might be found at the conference web page
www.iiis.org/isas/


Best Regards

Nagib Callaos
SCI2000 General Chair.



------------- End Forwarded Message -------------



From owner-reliable_computing [at] interval [dot] usl.edu  Sat Apr 15 21:15:17 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id VAA00507
	for reliable_computing-outgoing; Sat, 15 Apr 2000 21:15:16 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id VAA00496
	for <reliable_computing [at] interval [dot] usl.edu>; Sat, 15 Apr 2000 21:15:10 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.10.1/8.10.1) with SMTP id e3FKPox25649;
	Sat, 15 Apr 2000 14:25:50 -0600 (MDT)
Message-Id: <200004152025.e3FKPox25649 [at] cs [dot] utep.edu>
Date: Sat, 15 Apr 2000 14:25:51 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: conference in St. Petersburg: deadline extended to May 15
To: reliable_computing [at] interval [dot] usl.edu, interval [at] cs [dot] utep.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: wRFjVBzLasgfpiOfArblRg==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

                         FINAL CALL FOR PAPERS

                           Special Session on 
                INTERVAL AND COMPUTER-ALGEBRAIC METHODS 
                       IN SCIENCE AND ENGINEERING
                               at the 
                     6th International Conference on 
                    Applications of Computer Algebra
                              IMACS-ACA'2000
                             June 25-28, 2000
                          Saint Petersburg, Russia

PREAMBLE: 

There is a need to combine methods of computer algebra and of interval
computations. 

First: 
* Most applications of computer algebra and symbolic computations, 
  (in particular, most applications to control, dynamical system analysis,
  computer graphics, etc.), deal with situations in which we know the
  exact all the coefficients of the corresponding analytical expressions. 
* In many real-life situations, however, these
  coefficients have to be determined from measurements and observations.
  Since a measurement is never 100% accurate, after measuring a value x,
  we can only conclude that the actual (unknown) value of the measured
  coefficient lies within the interval [x-D,x+D], where D is the upper
  bound on the measurement error (guaranteed by the manufacturer of the
  measuring instrument). 
We therefore need to take this interval uncertainty into consideration.

Second: 
* Most algorithms developed in computer algebra assume that all
  the coefficients are (exactly represented) real numbers. 
* In the computers, many real numbers can only be approximately
  represented. The resulting rounding errors lead to the inaccuracy of
  the coefficients in the final result. 
It is therefore desirable to estimate this inaccuracy. For this
estimation, we can also use methods of interval computations. 

In recognition of this need, in 1994, an International Conference on
Interval and Computer-Algebraic Methods in Science and Engineering
(Interval'94) was held in St. Petersburg, Russia. This first
conference of this type was a huge success. At this conference,
more than 100 researchers from 18 countries presented their
practical and theoretical results. 

Since 1994, there has been a tremendous progress both in
computer algebra and in interval computations. This progress is
largely due to the rapidly increasing computer processing speed, which
makes previously theoretical algorithms of computer algebra 
practically feasible. In some cases, we can directly apply these
algorithms; in most cases, however, there is a need for further
fine-tuning, a need which leads to interesting challenging 
new theoretical problems whose solution, in its turn, results in new
exciting applications. 

We believe that time is ripe for a new major meeting devoted to the
relation between computer algebra and interval computations. This
meeting will hopefully not only highlight the results, but it will 
also give a new boost to a much-needed combination of numerical and
symbolic techniques. 

SCOPE: 

For this special session, we are soliciting papers in the following
areas:
* applications of combined interval-analytical techniques in science
  and engineering (and in other possible application areas); 
* special languages, software and hardware tools which either 
  * combine interval techniques with techniques of computer algebra,
    or
  * enhance such a combination;
* theoretical foundations for combining interval and symbolic algebra
  techniques, including (but not limited to):
  * the use of analytical transformations (and other techniques from
    computer algebra) in interval computations;
  * algebraic approach to interval mathematics (including
    interval-based formalisms of computer algebra); 
  * computational complexity analysis of symbolic computation
    problems with interval uncertainty; 
* new semi-heuristic ideas on how interval and computer algebra
  methods can be combined (either in general, and with some specific
  application area in mind), and 
* new potential applications area for the combined interval-analytical
  techniques. 

In this solicitation, we are targeting researchers and practitioners
from both communities: interval computations and computer algebra. To
achieve a greater success, we are making this appeal as broad as
possible:
* It is OK to have a result which is mainly devoted to interval
  computations, but has some relation to computer algebra.
* It is also OK to have a result which is mainly devoted to 
  computer algebra, but has some relation to interval computations. 

Since this session is oriented towards two different communities, we
encourage the authors to do their best to be understandable by
researchers from both communities (even if this means adding 
extra phrases into the introduction which, e.g., for an interval
computations community would not be necessary at all). 

SUBMISSION:

A 2-page abstract in LaTeX format must be submitted
by May 15, 2000 to both organizers (by email, if possible): 

V. M. Nesterov
P. O. Box 52
St. Petersburg 256
195256 Russia
email nest [at] into [dot] nit.spb.su

Vladik Kreinovich
Department of Computer Science
University of Texas at El Paso
El Paso, TX 79968, USA
email vladik [at] cs [dot] utep.edu

Abstracts will be published before the conference.

We are also currently planning to publish refereed proceedings as 
a special issue of the "Reliable Computing" journal. 

If you are interested in coming, please let the organizers know ASAP, 
and, if possible, send a title (even preliminary title if necessary) 
of your submission ASAP.

VENUE:

St. Petersburg is a majestic old imperial capital of Russia.
Numerous imperial palaces located in the city and in the suburbs
attract millions of visitors every year. The main of these palaces -
Winter Palace - hosts the Hermitage, one of the world
largest art museums. Fortresses, churches, mansions, theaters,
monasteries line up the beautiful streets and embankments of this city
of 100+ islands nicknamed the Northern Venice. 

June is the most beautiful and romantic time to visit St. Petersburg, 
the time of the world-famous White Nights, when the sun hardly hides 
behind the horizon, and you can not find even the brightest stars 
in the night sky. All night long street musicians play traditional 
Russian music and new Russian rock, and love-struck young people roam 
the streets in which the palaces and bridges, barely visible in the
dimmed light (and sometimes also shielded by fog and/or drizzle), 
create the magic atmosphere of unreal fairy tale. 

Although the city is located at the same latitude as Alaska, Gulf
Stream makes it much warmer; in June, an average temperature is about
20 C (70 F). 

INFORMATION FOR PARTICIPANTS

IMACS-ACA'2000

International Association for Mathematics and Computers in Simulation
6th International Conference on Applications of Computer Algebra

June 25-28, 2000                         Saint Petersburg, Russia


1. VISA APPLICATION

Please note that nearly every foreign visitor to Russia will need to
get a VISA from a Russian Consulate in any country, where he is staying.
To do so, you will need a special invitation and in addition, your passport
must not expire earlier than the end of September 2000.

To issue the invitation, we need various data and a FAXed copy of the
identification page from your passport (the page containing your name,
passport number, passport expiration date and date of your birth).
Please fill out the registration form below and send it to:

   aca2000 [at] eimi [dot] imi.ras.ru

or fill out the registration form on our web page:

   http://www.pdmi.ras.ru/~aca00/form.html

You can send us a copy of the identification page of your passport by
fax:

    7 812 234 5819 or 7 812 310 5377 (for Elena Novikova)

or you can send a scaned copy of the identification page by email above.

After receiving your data, we will send out an invitation within two/three
weeks.  If you come with accompanying persons, you will have to fill
out a registration form for each of them and fax their passport pages
as well.  If you would like to visit Moscow or other places in Russia,
please mention this in your registration form.

2. CONFERENCE FEE

The conference fee is 200 USD for EARLY payment (up to May 10)
                      225 USD for LATE  payment

In the case of EARLY payment:
  Return completed registration form with payment to:
    ACA'00 Conference                     FAX: +1 (505) 277-5505
    1801 Quincy, SE                       (VISA/MasterCard only)
    Albuquerque, New Mexico          OR
    USA   87108-4427                      Email: aca [at] math [dot] unm.edu
    (Make checks payable to "ACA")        (VISA/MasterCard only)

  Please SEND A NOTE by email to aca [at] math [dot] unm.edu no matter how you send the
  payment as a confirmation!!! All registrations will be acknowledged by email.
  Note that credit card debits may be under the name "Cotopaxi" which is the
  company holding the ACA account.

In the case of LATE payment:
  The LATE payment should be done at the conference site in cash.
  Please take into account that you can use your credit card in
  St. Petersburg (VISA, MasterCard) as well as travel check.

The conference fee will cover the organizing expenses, a car from
and to the airport, coffee breaks, cultural events, conference party.
The accompanying persons could be involved in conference events, in
this case a special conference fee for accompanying persons (100 USD)
should be paid at the conference site.


3. SUPPORT

The funds of the conference are very limited but we are awaiting for
a certain financial support from INTAS and RFBR, which in particular
will cover a part of expenses of participants involved in the INTAS
projects and participants from Russia. The conference fee for young
scientists would be reduced.

4. CONFERENCE SITE

The conference will be located at an old palace on the Fontanka
embankment, 21 (see red mark "X" on the map:
http://www.pdmi.ras.ru/~aca/map2.jpg),  near the Steklov Institute
of Mathematics (address: Fontanka, 27).

5. HOTEL

We have reserved the apartments in two hotels*** "Oktyabrskaya"
and "Sovetskaya" for the participants to the conference.

The "Oktyabrskaya" is in the center not far from the conference site
at the Ploschad' (Square) Vosstaniya at a crossroads of Nevskiy
prospekt (avenue) and Ligovskiy prospekt (see red mark "Y" on the
map: http://www.pdmi.ras.ru/~aca/map2.jpg).
Address: Ligovskiy prospekt (avenue), 41/45.
The current rate is (with taxes without breakfast):

  single room:  925 rub (about 32 USD) or 1220 rub (about 42 USD)
  double room: 1160 rub (about 40 USD) or 1830 rub (about 63 USD)

The more expensive rooms (for both hotels) have slightly higher quality
furniture and wallpaper.


The "Sovetskaya" is of more high level but not close to the conference
site, at a crossroads of Rizhskiy prospekt and Lermontovskiy prospekt.
Address: Lermontovskiy prospekt (avenue), 43/1 (see red mark "Z" on the
map: http://www.pdmi.ras.ru/~aca/map3.jpg).

The current rate is (with taxes and with breakfast):

  single room: 1170 rub (about 40 USD)
  double room: 1965 rub (about 70 USD)

You should pay for the hotel on arrival.  You can use VISA or MasterCard.

Please write in your registration form or separately what hotel
do you prefer, what price is acceptable and what kind of room
do you need.

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

                  REGISTRATION FORM

 e-mail: aca2000 [at] eimi [dot] imi.ras.ru
 (You may also fill out the Registration Form on our web page:
     http://www.pdmi.ras.ru/~aca00/form.html)


 Family name (as in passport):
 First name(s) (as in passport):
 Affiliation:
 Position:
 Address (office):
 City:
 Postal code:
 Country:
 Fax (office):
 Phone (office):
 e-mail:

 I need a hotel: (yes/no)
 Arrival Date:
 Departure Date:

 Please, provide us details about the type of room you wish and the
 persons you wish to share the room with:
 (number of rooms/shared with/price per room/number of persons)

 I intend to give a talk: (yes/no)
 Session:
 Title:

 I need a Russian visa:	(yes/no)
 If you need a visa, please, fill in the following VISA FORM:

 Date of arrival:
 Date of departure:
 Citizenship:
 Passport number:
 Passport expiration date:
 City (with a Russian Consulate) where you will apply for a visa:
 Date of birth:
 FAX number to send the invitation to:
 Mailing address to send the invitation to:
 City you want to visit besides St. Petersburg:

 IMPORTANT: You need to send us a copy of the identification page of your
 passport (the pages containing your name, passport number and passport
 expiration date) by fax to

    7 812 234 5819 or 7 812 310 5377 (for Elena Novikova)

 You need to do likewise with the passports of all accompanying persons.

 I would like to come with accompanying person(s): (yes/no)
 If "yes", please, make a separate registration and visa form for each
 accompanying person: fill in the same fields for everyone.

 IMPORTANT: Please check that your medical insurance is valid in Russia.


 For Credit Card Payment:

 Early Registration fee: US$200

 Card Type ____________________ # ________________________ Exp. Date ________

 Card Holder Name (print) ___________________________________________________

 Signature __________________________________________________________________

 (Email registration is preferred and does not require a signature)
-------------------------------------------------------------------------------



From owner-reliable_computing [at] interval [dot] usl.edu  Sun Apr 16 10:41:13 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA03074
	for reliable_computing-outgoing; Sun, 16 Apr 2000 10:41:13 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA03069
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 16 Apr 2000 10:41:10 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.10.1/8.10.1) with SMTP id e3GFf7k29889
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 16 Apr 2000 09:41:07 -0600 (MDT)
Message-Id: <200004161541.e3GFf7k29889 [at] cs [dot] utep.edu>
Date: Sun, 16 Apr 2000 09:41:06 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: SCI'2000: submission deadline extended to May 17
To: reliable_computing [at] interval [dot] louisiana.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=ISO-8859-1
Content-MD5: aBgvkuq7IeVQvS0EQrmDAA==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc 
Content-Transfer-Encoding: 8bit
X-MIME-Autoconverted: from QUOTED-PRINTABLE to 8bit by interval.usl.edu id KAA03070
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


FYI: this is the conference about which Dr. Corliss suggested a few months ago 
that an interval presence may be beneficial.

------------- Begin Forwarded Message -------------

Date: Sat, 15 Apr 2000 15:12:38 -0400
From: Nagib Callaos <sci2000 [at] iiisconferences [dot] org>

Subject: 4th World Multiconference on Systemics, Cybernetics, and Informatics 
SCI'2000

Dear Colleague:


Let me inform you that we extended the deadlines because the problems we
had with the server, 
and because we achieved an agreement with proceedings printing shop that
allows us to do it. 
The extended deadlines are as follow:

· May 17, 2000 ~ Submission of extended abstracts (500-1500 words) or paper
Drafts (2000-5000 words)
· May 22, 2000 ~ Acceptance notifications
· June 19, 2000  ~ Submission of camera ready papers: hard copies and
electronic     versions

If you need more time let us know about it, along with your paper title,
topic or area, 
to examine if its potential reviewers would make it feasible for you.

Additional information might be found at the conference web page
www.iiis.org/isas/


Best Regards

Nagib Callaos
SCI2000 General Chair.



------------- End Forwarded Message -------------


------------- End Forwarded Message -------------



From owner-reliable_computing [at] interval [dot] usl.edu  Sun Apr 16 10:42:07 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA03123
	for reliable_computing-outgoing; Sun, 16 Apr 2000 10:42:07 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA03114
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 16 Apr 2000 10:42:02 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.10.1/8.10.1) with SMTP id e3GFg1G29894
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 16 Apr 2000 09:42:01 -0600 (MDT)
Message-Id: <200004161542.e3GFg1G29894 [at] cs [dot] utep.edu>
Date: Sun, 16 Apr 2000 09:42:00 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: P.S. Conference in St. Petersburg
To: reliable_computing [at] interval [dot] louisiana.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: KzWucP6RJw2KZEGxkJMb5w==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


In order to set up a program on time, Dr. Vasiliev, the general chair of the 
conference, would like to have the names and titles of almost all the speakers 
by May 1, 2000. Abstracts can still be submitted by May 15. 


From owner-reliable_computing [at] interval [dot] usl.edu  Sun Apr 16 10:44:51 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA03264
	for reliable_computing-outgoing; Sun, 16 Apr 2000 10:44:51 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA03259
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 16 Apr 2000 10:44:48 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.10.1/8.10.1) with SMTP id e3GFik329908
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 16 Apr 2000 09:44:46 -0600 (MDT)
Message-Id: <200004161544.e3GFik329908 [at] cs [dot] utep.edu>
Date: Sun, 16 Apr 2000 09:44:45 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: conference in St. Petersburg: deadline extended to May 15
To: reliable_computing [at] interval [dot] louisiana.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: IqdyQ+d4TF/vOHyDjUOY/Q==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


                         FINAL CALL FOR PAPERS

                           Special Session on 
                INTERVAL AND COMPUTER-ALGEBRAIC METHODS 
                       IN SCIENCE AND ENGINEERING
                               at the 
                     6th International Conference on 
                    Applications of Computer Algebra
                              IMACS-ACA'2000
                             June 25-28, 2000
                          Saint Petersburg, Russia

PREAMBLE: 

There is a need to combine methods of computer algebra and of interval
computations. 

First: 
* Most applications of computer algebra and symbolic computations, 
  (in particular, most applications to control, dynamical system analysis,
  computer graphics, etc.), deal with situations in which we know the
  exact all the coefficients of the corresponding analytical expressions. 
* In many real-life situations, however, these
  coefficients have to be determined from measurements and observations.
  Since a measurement is never 100% accurate, after measuring a value x,
  we can only conclude that the actual (unknown) value of the measured
  coefficient lies within the interval [x-D,x+D], where D is the upper
  bound on the measurement error (guaranteed by the manufacturer of the
  measuring instrument). 
We therefore need to take this interval uncertainty into consideration.

Second: 
* Most algorithms developed in computer algebra assume that all
  the coefficients are (exactly represented) real numbers. 
* In the computers, many real numbers can only be approximately
  represented. The resulting rounding errors lead to the inaccuracy of
  the coefficients in the final result. 
It is therefore desirable to estimate this inaccuracy. For this
estimation, we can also use methods of interval computations. 

In recognition of this need, in 1994, an International Conference on
Interval and Computer-Algebraic Methods in Science and Engineering
(Interval'94) was held in St. Petersburg, Russia. This first
conference of this type was a huge success. At this conference,
more than 100 researchers from 18 countries presented their
practical and theoretical results. 

Since 1994, there has been a tremendous progress both in
computer algebra and in interval computations. This progress is
largely due to the rapidly increasing computer processing speed, which
makes previously theoretical algorithms of computer algebra 
practically feasible. In some cases, we can directly apply these
algorithms; in most cases, however, there is a need for further
fine-tuning, a need which leads to interesting challenging 
new theoretical problems whose solution, in its turn, results in new
exciting applications. 

We believe that time is ripe for a new major meeting devoted to the
relation between computer algebra and interval computations. This
meeting will hopefully not only highlight the results, but it will 
also give a new boost to a much-needed combination of numerical and
symbolic techniques. 

SCOPE: 

For this special session, we are soliciting papers in the following
areas:
* applications of combined interval-analytical techniques in science
  and engineering (and in other possible application areas); 
* special languages, software and hardware tools which either 
  * combine interval techniques with techniques of computer algebra,
    or
  * enhance such a combination;
* theoretical foundations for combining interval and symbolic algebra
  techniques, including (but not limited to):
  * the use of analytical transformations (and other techniques from
    computer algebra) in interval computations;
  * algebraic approach to interval mathematics (including
    interval-based formalisms of computer algebra); 
  * computational complexity analysis of symbolic computation
    problems with interval uncertainty; 
* new semi-heuristic ideas on how interval and computer algebra
  methods can be combined (either in general, and with some specific
  application area in mind), and 
* new potential applications area for the combined interval-analytical
  techniques. 

In this solicitation, we are targeting researchers and practitioners
from both communities: interval computations and computer algebra. To
achieve a greater success, we are making this appeal as broad as
possible:
* It is OK to have a result which is mainly devoted to interval
  computations, but has some relation to computer algebra.
* It is also OK to have a result which is mainly devoted to 
  computer algebra, but has some relation to interval computations. 

Since this session is oriented towards two different communities, we
encourage the authors to do their best to be understandable by
researchers from both communities (even if this means adding 
extra phrases into the introduction which, e.g., for an interval
computations community would not be necessary at all). 

SUBMISSION:

A 2-page abstract in LaTeX format must be submitted
by May 15, 2000 to both organizers (by email, if possible): 

V. M. Nesterov
P. O. Box 52
St. Petersburg 256
195256 Russia
email nest [at] into [dot] nit.spb.su

Vladik Kreinovich
Department of Computer Science
University of Texas at El Paso
El Paso, TX 79968, USA
email vladik [at] cs [dot] utep.edu

Abstracts will be published before the conference.

We are also currently planning to publish refereed proceedings as 
a special issue of the "Reliable Computing" journal. 

If you are interested in coming, please let the organizers know ASAP, 
and, if possible, send a title (even preliminary title if necessary) 
of your submission ASAP.

VENUE:

St. Petersburg is a majestic old imperial capital of Russia.
Numerous imperial palaces located in the city and in the suburbs
attract millions of visitors every year. The main of these palaces -
Winter Palace - hosts the Hermitage, one of the world
largest art museums. Fortresses, churches, mansions, theaters,
monasteries line up the beautiful streets and embankments of this city
of 100+ islands nicknamed the Northern Venice. 

June is the most beautiful and romantic time to visit St. Petersburg, 
the time of the world-famous White Nights, when the sun hardly hides 
behind the horizon, and you can not find even the brightest stars 
in the night sky. All night long street musicians play traditional 
Russian music and new Russian rock, and love-struck young people roam 
the streets in which the palaces and bridges, barely visible in the
dimmed light (and sometimes also shielded by fog and/or drizzle), 
create the magic atmosphere of unreal fairy tale. 

Although the city is located at the same latitude as Alaska, Gulf
Stream makes it much warmer; in June, an average temperature is about
20 C (70 F). 

INFORMATION FOR PARTICIPANTS

IMACS-ACA'2000

International Association for Mathematics and Computers in Simulation
6th International Conference on Applications of Computer Algebra

June 25-28, 2000                         Saint Petersburg, Russia


1. VISA APPLICATION

Please note that nearly every foreign visitor to Russia will need to
get a VISA from a Russian Consulate in any country, where he is staying.
To do so, you will need a special invitation and in addition, your passport
must not expire earlier than the end of September 2000.

To issue the invitation, we need various data and a FAXed copy of the
identification page from your passport (the page containing your name,
passport number, passport expiration date and date of your birth).
Please fill out the registration form below and send it to:

   aca2000 [at] eimi [dot] imi.ras.ru

or fill out the registration form on our web page:

   http://www.pdmi.ras.ru/~aca00/form.html

You can send us a copy of the identification page of your passport by
fax:

    7 812 234 5819 or 7 812 310 5377 (for Elena Novikova)

or you can send a scaned copy of the identification page by email above.

After receiving your data, we will send out an invitation within two/three
weeks.  If you come with accompanying persons, you will have to fill
out a registration form for each of them and fax their passport pages
as well.  If you would like to visit Moscow or other places in Russia,
please mention this in your registration form.

2. CONFERENCE FEE

The conference fee is 200 USD for EARLY payment (up to May 10)
                      225 USD for LATE  payment

In the case of EARLY payment:
  Return completed registration form with payment to:
    ACA'00 Conference                     FAX: +1 (505) 277-5505
    1801 Quincy, SE                       (VISA/MasterCard only)
    Albuquerque, New Mexico          OR
    USA   87108-4427                      Email: aca [at] math [dot] unm.edu
    (Make checks payable to "ACA")        (VISA/MasterCard only)

  Please SEND A NOTE by email to aca [at] math [dot] unm.edu no matter how you send the
  payment as a confirmation!!! All registrations will be acknowledged by email.
  Note that credit card debits may be under the name "Cotopaxi" which is the
  company holding the ACA account.

In the case of LATE payment:
  The LATE payment should be done at the conference site in cash.
  Please take into account that you can use your credit card in
  St. Petersburg (VISA, MasterCard) as well as travel check.

The conference fee will cover the organizing expenses, a car from
and to the airport, coffee breaks, cultural events, conference party.
The accompanying persons could be involved in conference events, in
this case a special conference fee for accompanying persons (100 USD)
should be paid at the conference site.


3. SUPPORT

The funds of the conference are very limited but we are awaiting for
a certain financial support from INTAS and RFBR, which in particular
will cover a part of expenses of participants involved in the INTAS
projects and participants from Russia. The conference fee for young
scientists would be reduced.

4. CONFERENCE SITE

The conference will be located at an old palace on the Fontanka
embankment, 21 (see red mark "X" on the map:
http://www.pdmi.ras.ru/~aca/map2.jpg),  near the Steklov Institute
of Mathematics (address: Fontanka, 27).

5. HOTEL

We have reserved the apartments in two hotels*** "Oktyabrskaya"
and "Sovetskaya" for the participants to the conference.

The "Oktyabrskaya" is in the center not far from the conference site
at the Ploschad' (Square) Vosstaniya at a crossroads of Nevskiy
prospekt (avenue) and Ligovskiy prospekt (see red mark "Y" on the
map: http://www.pdmi.ras.ru/~aca/map2.jpg).
Address: Ligovskiy prospekt (avenue), 41/45.
The current rate is (with taxes without breakfast):

  single room:  925 rub (about 32 USD) or 1220 rub (about 42 USD)
  double room: 1160 rub (about 40 USD) or 1830 rub (about 63 USD)

The more expensive rooms (for both hotels) have slightly higher quality
furniture and wallpaper.


The "Sovetskaya" is of more high level but not close to the conference
site, at a crossroads of Rizhskiy prospekt and Lermontovskiy prospekt.
Address: Lermontovskiy prospekt (avenue), 43/1 (see red mark "Z" on the
map: http://www.pdmi.ras.ru/~aca/map3.jpg).

The current rate is (with taxes and with breakfast):

  single room: 1170 rub (about 40 USD)
  double room: 1965 rub (about 70 USD)

You should pay for the hotel on arrival.  You can use VISA or MasterCard.

Please write in your registration form or separately what hotel
do you prefer, what price is acceptable and what kind of room
do you need.

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

                  REGISTRATION FORM

 e-mail: aca2000 [at] eimi [dot] imi.ras.ru
 (You may also fill out the Registration Form on our web page:
     http://www.pdmi.ras.ru/~aca00/form.html)


 Family name (as in passport):
 First name(s) (as in passport):
 Affiliation:
 Position:
 Address (office):
 City:
 Postal code:
 Country:
 Fax (office):
 Phone (office):
 e-mail:

 I need a hotel: (yes/no)
 Arrival Date:
 Departure Date:

 Please, provide us details about the type of room you wish and the
 persons you wish to share the room with:
 (number of rooms/shared with/price per room/number of persons)

 I intend to give a talk: (yes/no)
 Session:
 Title:

 I need a Russian visa:	(yes/no)
 If you need a visa, please, fill in the following VISA FORM:

 Date of arrival:
 Date of departure:
 Citizenship:
 Passport number:
 Passport expiration date:
 City (with a Russian Consulate) where you will apply for a visa:
 Date of birth:
 FAX number to send the invitation to:
 Mailing address to send the invitation to:
 City you want to visit besides St. Petersburg:

 IMPORTANT: You need to send us a copy of the identification page of your
 passport (the pages containing your name, passport number and passport
 expiration date) by fax to

    7 812 234 5819 or 7 812 310 5377 (for Elena Novikova)

 You need to do likewise with the passports of all accompanying persons.

 I would like to come with accompanying person(s): (yes/no)
 If "yes", please, make a separate registration and visa form for each
 accompanying person: fill in the same fields for everyone.

 IMPORTANT: Please check that your medical insurance is valid in Russia.


 For Credit Card Payment:

 Early Registration fee: US$200

 Card Type ____________________ # ________________________ Exp. Date ________

 Card Holder Name (print) ___________________________________________________

 Signature __________________________________________________________________

 (Email registration is preferred and does not require a signature)
-------------------------------------------------------------------------------


------------- End Forwarded Message -------------



From owner-reliable_computing [at] interval [dot] usl.edu  Mon Apr 17 21:04:03 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id VAA06621
	for reliable_computing-outgoing; Mon, 17 Apr 2000 21:04:03 -0500 (CDT)
Received: from wombat.cs.rmit.edu.au (wombat.cs.rmit.edu.au [131.170.24.41])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id VAA06616
	for <reliable_computing [at] interval [dot] usl.edu>; Mon, 17 Apr 2000 21:03:42 -0500 (CDT)
Received: from goanna.cs.rmit.edu.au (zahirt [at] goanna [dot] cs.rmit.edu.au [131.170.24.40])
	by wombat.cs.rmit.edu.au (8.9.3/8.9.3/cshub) with ESMTP id MAA12705;
	Tue, 18 Apr 2000 12:03:18 +1000 (EST)
Received: (from zahirt@localhost)
	by goanna.cs.rmit.edu.au (8.9.3/8.9.3/csnode) id MAA12541;
	Tue, 18 Apr 2000 12:02:55 +1000 (EST)
Date: Tue, 18 Apr 2000 12:02:55 +1000 (EST)
From: Zahir Tari <zahirt [at] cs [dot] rmit.edu.au>
Message-Id: <200004180202.MAA12541 [at] goanna [dot] cs.rmit.edu.au>
To: Gi-FB5-L [at] aifb [dot] uni-karlsruhe.de, ISCA [at] ipass [dot] net,
        TOOLS_Europe_2000 [at] ulla [dot] irisa.fr, agents [at] cs [dot] umbc.edu, atrfyi [at] SHL [dot] COM,
        chisig [at] venus [dot] it.swin.edu.au, ckbs-int [at] cs [dot] keele.ac.uk,
        comsoc-chapters [at] ieee [dot] org, corba-patterns [at] cs [dot] uiuc.edu,
        csec-adm [at] sdl [dot] hitachi.co.jp, dasig [at] dsto [dot] defence.gov.au,
        distributed-ai-request [at] mailbase [dot] ac.uk, ecoop-info [at] ecoop [dot] org,
        edoc-info [at] iese [dot] fhg.de, interactif [at] lri [dot] fr, is-depts [at] fit [dot] qut.edu.au,
        isworld [at] listserv [dot] heanet.ie, it-announce [at] cs [dot] usyd.edu.au,
        javaCORBA [at] luke [dot] org, maamaw [at] cosmos [dot] imag.fr,
        mas-anwendungen [at] wirtschaft [dot] tu-ilmenau.de, odp [at] dstc [dot] edu.au,
        ontology [at] cs [dot] umbc.edu, open [at] it [dot] swin.edu.au, otug [at] rational [dot] com,
        pdcemail [at] ee [dot] uwa.edu.au, podc-post [at] bellcore [dot] com,
        reliable_computing [at] interval [dot] usl.edu, sb.all [at] ieee [dot] org,
        seminars [at] cs [dot] anu.edu.au, seworld [at] cs [dot] colorado.edu,
        softwarequalitaet@uni-koeln.de
Subject:  CFP for Distributed Objects and Applications Symposium 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk



                              C A L L   F O R   P A P E R S
                              =============================
___   __   __     __  __
 | | |  | |  | / |  ||  |      International Symposium on
 | | |  | |--|   |  ||  |  DISTRIBUTED OBJECTS AND APPLICATIONS
_|_| |__| |  |   |__||__| Antwerp, Belgium, September 21-23, 2000

                     http://www.cs.rmit.edu.au/conf/doa/2000/


IMPORTANT DATES
     Electronic submission:        May 1st, 2000
     Notification of acceptance:   June 10th, 2000
     Camera-ready copies:          June 30th, 2000
     Symposium:                    September 21-23, 2000


OVERVIEW
  Are you building applications using distributed objects (DO)?
  Are you doing research in fundamental technology, methodology 
    or new tools for DO?
  Are you using some of the existing distributed object systems?
  
  Consider contributing a practice report or a research paper to this
  innovative event, and to present, discuss and obtain feedback for your
  ideas among other practitioners and researchers active in the same area.
  
  During DOA'2000 Symposium we want attendees to be able to evaluate
  existing ORB middleware products; to analyze, and propose solutions
  to major limitations of existing products; and to indicate promising
  future research directions for distributed objects. We are particularly
  interested in the evaluation of existing distributed object systems
  and how they are used to design and to implement large scale industrial
  distributed applications. We are seeking theoretical as well as
  practical papers addressing innovative issues related to distributed
  objects.


TOPICS OF INTEREST

  Distributed and mobile agents. Design patterns for distributed object
  design. Database services, in particular persistency, transaction, query. 
  and replication services. Integration of distributed object and Web
  technologies. Integration with database systems and interfaces. Methodologies
  to develop distributed object applications. Reintegration of legacy systems
  in DO environments . Design of CORBA, COM- and Java-based broker applications.
  Multimedia distributed objects. Multicast protocols for distributed objects. 
  Object caching. Reliability, fault-tolerance and recovery. Real-time ORB
  middleware. Reports on Best Practice. Security. Specification and enforcement
  of quality of service. Standardization of distributed objects. ...

PROGRAM COMMITTEE

  Gustavo Alonso (ETH, Zurich). Bill Appelbe (RMIT, Australia). Sean Baker (IONA, Ireland)
  Carlos De Backer (University of Antwerp, Belgium). Jose Blakeley (Microsoft, USA). 
  Gordon Blair (Lancaster University, UK). Anthony Bloesch (Visio Corp., USA). 
  Omran Bukhres (Purdue University, USA).  Akmal B. Chaudhri (Computer Associates, UK). 
  Asuman Dogac (Middle East Technical University, Turkey).  Chris Gokey (NASA, USA). 
  Rachid Guerraoui (EPFL, Switzerland). Arno Jacobsen (Humboldt University, Germany). 
  Dimitris Karagiannis (University of Vienna and B.O.C. GmbH, Austria). 
  Roger King (University of Colorado, USA).  Sacha Krakowiak (University of Grenoble, 
  France). Bernd Kramer (FernUniversitat Hagen, Germany).  Hong Va Leong 
  (Hong Kong Polytechnic University, China).  Ling Liu (Oregon Graduate Institute, USA). 
  Frank Manola (USA). Sophie Monties (EPFL, Switzerland). Jishnu Mukerji
  (HP New Jersey Labs, USA). Tom Northcutt (NASA, USA). Kunio Ohno (INS Engineering
  Corporation, Japan). Tamer Ozsu (University of Alberta, Canada). Mike P. Papazoglou
  (Tilburg University, The Netherlands). Kerry Raymond (DSTC, Australia). Arnie
  Rosenthal (Mitre, USA). Richard Soley (OMG, USA). Marc H. Scholl
  (Universitat Konstanz, Germany). Jean-Bernard Stefani (France Telecom, France). 
  Doug Schmidt (Washington Univ. at St. Louis, USA). Makoto Takizawa 
  (Tokyo Denki University, Japan). Hakki Toroslu (Middle East Technical University,
  Turkey). Yu-Chee Tseng (National Central University, Taiwan). 
  Wilfried Verachtert (MediaGenix, Belgium).  Andreas Vogel (In Prise, USA). 
  Guijun Wang (Boeing, USA).  Andrew Watson (OMG, USA).  Albert Zamoya (UWA, Australia). 



From owner-reliable_computing [at] interval [dot] usl.edu  Tue Apr 18 13:37:15 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id NAA08813
	for reliable_computing-outgoing; Tue, 18 Apr 2000 13:37:15 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id NAA08808
	for <reliable_computing [at] interval [dot] louisiana.edu>; Tue, 18 Apr 2000 13:37:01 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.10.1/8.10.1) with SMTP id e3IIafA09640
	for <reliable_computing [at] interval [dot] louisiana.edu>; Tue, 18 Apr 2000 12:36:44 -0600 (MDT)
Message-Id: <200004181836.e3IIafA09640 [at] cs [dot] utep.edu>
Date: Tue, 18 Apr 2000 12:36:42 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: CALCULEMUS-2000 Deadline Extension
To: reliable_computing [at] interval [dot] louisiana.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: xXkH8Av22qYJcYA7u+w6lQ==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


------------- Begin Forwarded Message -------------

Date: Tue, 18 Apr 2000 12:41:59 -0400 (EDT)
From: Paulina Chin <pchin [at] wlu [dot] ca>
To: "Paulina Chin (physics)" <pchin [at] wlu [dot] ca>, m.kerber [at] cs [dot] bham.ac.uk
Subject: CALCULEMUS-2000 Deadline Extension
MIME-Version: 1.0

Please send inquiries about CALCULEMUS-2000 to Manfred Kerber
at M.Kerber [at] cs [dot] bham.ac.uk.

Due to general demand, we extend the deadline for the Calculemus
Symposium to 1 May 2000.

                         DEADLINE EXTENSION
                            1 May 2000

                           CALCULEMUS-2000
                  Symposium on the Integration of
             Symbolic Computation and Mechanized Reasoning
                            6-7 August 2000
                          St Andrews, Scotland
                      (collocated with ISSAC 2000)

            http://www.calculemus.net/meetings/standrews00/


SCOPE

Both deduction systems and computer algebra systems are receiving
growing attention from industry and academia. On the one hand,
mathematical software systems have been commercially very
successful. Their use is now wide-spread in industry, education, and
scientific contexts. On the other hand, the use of formal methods in
hardware and software development has made deduction systems
indispensable not least because of the complexity and sheer size of
the reasoning tasks involved.  As many application domains fall
outside the scope of existing deduction systems and computer algebra
systems, there is still need for improvement and in particular need
for the integration of computer algebra and deduction systems.

The symposium is intended for researchers and developers interested in
combining the reasoning capabilities of deduction systems and the
computational power of computer algebra systems.


TOPICS

Topics of interest for the symposium include all aspects related to the
combination of deduction systems and computer algebra systems. We
explicitly encourage submissions of results from applications and case
studies where such integration results are particularly important.


FORMAT

The symposium will feature invited talks, contributed presentations
with ample time for discussion, and a panel session.

Consistent with the tradition of the symposium as a lively forum for
discussing controversial ideas, we expect and encourage contributed
talks to present work in progress, rather than polished final results.


INVITED SPEAKERS

- Henk Barendregt, U. Nijmegen, Mathematics and Computer Science
- Arjeh Cohen, Eindhoven University of Technology, Dept. Math.
- Gaston Gonnet, ETH Z"urich, Institute for Scientific Computation


SUBMISSION

Authors are invited to submit papers in the following categories:

- Full papers up to 15 pages describing original results not
  published elsewhere.
- System descriptions of up to 5 pages describing new systems or
  significant upgrades of existing ones, especially including
  experiments.

Authors of accepted full papers and system descriptions are expected
to present their contribution at the symposium. Authors of system
descriptions are expected to demonstrate their systems.

The symposium will have published proceedings with A K Peters
Publishers.  Submissions details can be found at
http://www.cs.bham.ac.uk/~mmk/events/calculemus00-submi.html


IMPORTANT DATES

Submission deadline:               1 May    2000
Notification of acceptance:       22 May    2000
Final versions for proceedings:    5 June   2000
Symposium:                       6-7 August 2000
ISSAC:                           7-9 August 2000


ORGANIZATION and PROGRAMME CHAIRS

 Manfred Kerber,   U. Birmingham,   <M.Kerber [at] cs [dot] bham.ac.uk>
 Michael Kohlhase, U. Saarbr"ucken, <kohlhase [at] cs [dot] uni-sb.de>


LOCAL ORGANIZER

 Steve Linton,     St. Andrews U.   <sal [at] dcs [dot] st-and.ac.uk>


PROGRAMME COMMITTEE

 Alessandro Armando, U. Genova
 Michael Beeson, San Jose State U.
 Manuel Bronstein, INRIA Sophia Antipolis
 Bruno Buchberger, RISC, Linz
 Jaques Calmet, U. Karlsruhe
 Olga Caprotti, TU. Eindhoven
 Edmund Clarke, CMU
 Fausto Giunchiglia, IRST
 Therese Hardin, Paris VI
 John Harrison, Intel Corp.
 Tudor Jebelean, RISC, Linz
 Helene Kirchner, Nancy LORIA/INRIA
 Deepak Kapur, U. New Mexico, Albuquerque
 Steve Linton, St. Andrews U.
 Ursula Martin, St. Andrews U.
 Julian Richardson, U. Edinburgh
 J"org Siekmann, U. Saarbr"ucken
 Carolyn Talcott, Stanford U.
 Andrzej Trybulec, U. Bialystok






------------- End Forwarded Message -------------



From owner-reliable_computing [at] interval [dot] usl.edu  Tue Apr 18 22:44:36 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id WAA09935
	for reliable_computing-outgoing; Tue, 18 Apr 2000 22:44:35 -0500 (CDT)
Received: from cse.unl.edu (root [at] cse [dot] unl.edu [129.93.33.1])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id WAA09930
	for <reliable_computing [at] interval [dot] usl.edu>; Tue, 18 Apr 2000 22:44:31 -0500 (CDT)
Received: from localhost (fayad@localhost)
	by cse.unl.edu (8.9.1/8.9.1) with ESMTP id WAA5468840;
	Tue, 18 Apr 2000 22:36:58 -0500 (CDT)
Date: Tue, 18 Apr 2000 22:36:58 -0500
From: Mohamed Fayad <fayad [at] cse [dot] unl.edu>
To: Undisclosed recipients: ;
Subject: CFCs for S/W Arch., Components, and Frameworks
In-Reply-To: <200004180202.MAA12541 [at] goanna [dot] cs.rmit.edu.au>
Message-ID: <Pine.SGI.4.05.10004182235340.5503745-100000 [at] cse [dot] unl.edu>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk



Greetings,

Apologies if you recieve multitple copies of this cfcs.  Enclosed, please
find a call for chapters and reviewers.

Cheers,

M. Fayad

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

3-volume book on
Software Architectures, Components, and Frameworks
Call for Chapters and Reviewers

Authors and Editors:

Dr. Mohamed Fayad: fayad [at] cse [dot] unl.edu, m.fayad [at] computer [dot] org,
fayadm [at] acm [dot] org, 
URL: http://www.cse.unl.edu/~fayad	

Dr. David Garlan: garlan [at] cs [dot] cmu.edu
URL: http://www.cs.cmu.edu/~garlan      
      
Professor Wolfgang Pree: pree [at] acm [dot] org
URL: www.informatik.uni-konstanz.de/swe

We are developing three-volume series of books on software architectures,
components, and frameworks. If this is your area of interest/research, I
would like to invite you to submit a chapter.  This series of books will
serve as a complete reference set for academics and practitioners. 

Volume 1: Software Architectures

The working title of the first-volume is "Software Architectures."
Architecture-based software engineering research has yielded an impressive
array of technologies and demonstrations over the past decade. Using an
architecture-based approach, applications have been built which:
- Are understandable
- Are expected to evolve
- Exhibit remarkable flexibility
- Demonstrate significant reuse of off-the-shelf components
- Leverage experience from related applications in the same problem
  domain
- Are analyzable earlier in their development than ever before
- Are key milestones in software managerial and development
  processes

Currently, there is relatively little guidance for software developers on
how to develop software architectures.  This volume addresses several
topics crucial to the state of the art and practice of software
architecture.  The book presents a complete reference on how to develop a
good software architecture and provides guidelines for resolving key
software architecture issues, such as evolving software architectures,
leveraging existing investment in software architecture artifacts,
representing architecture description languages, introducing formal models
for software architectures, addressing architectural analysis techniques &
development methods, transitioning from software architecture to coding
and surveying architectural design tools and environments. 

In addition, the book will include sections on: accessing of software
architectures, testing and validating software architectures, improving
software architecture quality, documenting software architectures, and
many more.
 
This is a pragmatic book that is specifically designed to help
organizations develop software architectures for real projects in the real
world. Comprehensive technical and management guidelines are thoroughly
discussed, ranging from specifying software architecture elements and
their behaviors, to the impact of software architecture on the job.
Likewise, technical issues (such as documenting and utilizing software
architectures) are discussed in detail.  

Volume 2: Product-Line Architectures 

The working title of the second-volume is "Product-Line Architectures".
Software product lines are emerging as a new and important software
development paradigm. A Product-Line Architecture (PLA) is a design for a
family of related applications, and its motivation is to simplify the
design and maintenance of program families and to address the needs of
highly customizable applications in an economical manner. Companies are
realizing that the practice of building sets of related systems from
common assets can yield remarkable improvements in productivity, time to
market, product quality and customer satisfaction. But these gains are
only a part of the picture; organizational, technical and management
issues are other factors that should be considered. Although there are
encouraging research experiences with PLAs and some guidelines exist to
help in the development process, some issues about component-based
development in PLAs are still under study.  The goal of this book is to
examine the foundational concepts underlying product lines and address the
essential activities developers should consider to apply a PLA to a number
of lines of products.

The book will include sections on: lessons learned in PLA-based
development, architectural specification, tools and process for software
development, core asset management, domain analysis, configuration
management, evaluation methods, quality factors involved, implementation
strategies, and many more.

Volume 3: Component-Based Software Developments & Enterprise Frameworks

The working title of the third-volume is "Component-Based Software
Development and Enterprise
Frameworks". Nowadays, software engineering is moving forward on an
architecture-based development conception where systems are built by
composing or assembling components that are often developed independently.
The key to making a large variety of software products and reducing time
to market is to build pieces of software where the development effort can
serve in other products as well.  Thus, large-grained components are
becoming a practical part of an enterprise component strategy.  Such
generic components usually include interactions with other components,
code, design models, design patterns and specifications. In addition, they
must provide ways to be adaptable and customizable according with the
client's needs.  In this context, enterprise frameworks offer an
appropriate base for waving the software architectures, components, and
core requirements into one container that is adaptable, customizable,
extensible, and reusable.

The technology of component-based systems is quite well established, but
it is not the same with the methods to develop them.  The need of
well-defined techniques, notations and architectural support is still
pending. The book will cover all these issues.

This book is intended to provide valuable, real world insight into
successful development and/or adaptation of OO Enterprise Frameworks, by
describing the problems with frameworks, explaining the issues related to
the development and adaptation of enterprise frameworks, selecting the
right methods and tools for building frameworks.  The book will be derived
from actual experiences, successes and failures, and is presented in a
practical, easy to understand manner.  This is information that readers
can apply today.  The key issues are:
+ What are the key enterprise-oriented framework issues?
+ How to develop enterprise frameworks and what are the framework
  design guidelines?
+ What kind of evolution does an Enterprise Framework undergo and
  how is it correlated with the enterprise life span?
+ How can the adaptation of OO enterprise framework be accomplished
  with minimum impact on the cost and schedule?
+ Understand make vs. buy decisions, selection guidelines, and how
  to select and adapt the right enterprise framework for the job.
+ Understand the implication of enterprise business requirements on
  the framework design.
+ How to use your large-scale enterprise framework and how to
  protect your investment.
+ How to deal with resource requirements, enterprise framework
  integration problems, framework reporting, and others.
+ What are the impacts of enterprise frameworks on the national and
  global economy?

This volume helps organizations apply component-based technology
effectively by citing examples from the real world.  This book combines
the actual experiences and lessons learned from developing and/or adapting
component-based enterprise framework developments.

Reviewers: Please e-mail your contact information and your area of
interests to the lead author and editor.

Authors: Please submit one electronic copy in RTF interchange or Microsoft
Word document formats by August 1, 2000 or sooner to the lead author and
editor:

Dr. Mohamed E. Fayad
J.D. Edwards Professor
Computer Science & Engineering Dept., University of Nebraska, Lincoln
108 Ferguson Hall, P.O. Box 880115, Lincoln, NE 68588-0115
Ph: (402) 472-2615, Fax: (402) 472-7767
E-mail: fayad [at] cse [dot] unl.edu, m.fayad [at] computer [dot] org, fayadm [at] acm [dot] org 
URL: http://www.cse.unl.edu/~fayad	

Submissions:
Submissions should be presented in a practical, easy to understand manner,
providing information that readers can apply today.  We seek original
articles on specific practical and research issues related to software
architectures, product-line architectures, component-based software
developments and enterprise application frameworks.

Chapters may be of any length, ranging from a few pages (2-3 pages or
1,200 words - sidebars) to a full treatment of substantial software
architectures, components, or frameworks (ranging from 10 pages to say 40
pages or 25,000 words - Chapters), including illustrations.  Submissions
are peer-reviewed and are subject to editing for style, clarity, and
space. We also encourage authors to submit supplement materials, such as
documentation and portions of the detailed implementation of their
frameworks or complete documentation or portions of the software
architecture or product-line architecture.  All submissions should
identify a principal contact author by e-mail address and/or fax and/or
telephone number and postal address.  

Please keep in mind that each volume will be the only complete work on
this topic.  We received excellent responses from most of the authors that
we contacted for this project.  We promise a high-quality and an extremely
useful publication for the computer and software industries.  Your chapter
should have appendixes of annotated references, notation, process, and
definitions.

Each chapter will include the biographies of the authors.  We will also
ask you to perform a final review for two or three chapters, collect
opinions from you related to the organization of each volume and keep you
up-to-date about the progress of this project.  If a chapter is accepted,
the authors will be asked to provide the following sections: 
1.	Review questions, 
2.	Problem sets, and/or 
3.	Projects, and 
4.	Key solutions.  
We would like to finish the work related to this project in twelve to
fifteen months.  

Currently, we have over 10 chapters for the first volume,10 papers for the
second volume, and 5 papers for the third volume.  All papers are under
review.  Questions regarding the suitability of a topic should be sent to:
fayad [at] cse [dot] un1.edu, garlan [at] cs [dot] cmu.edu, or pree [at] acm [dot] org

If you are considering submitting a chapter, I would like to receive the
following information immediately for starting the review process for your
chapter:
1. The title of your chapter
2. The list of authors and their contact information
3. The abstract
4. The point of contact

For further information about this series of books, please contact me at
<fayad [at] cse [dot] un1.edu>, <m.fayad [at] computer [dot] org>, or <fayadm [at] acm [dot] org>


For detailed author guidelines, check the following web site:

www.cse.unl.edu/~fayad	Book Projects






From owner-reliable_computing [at] interval [dot] usl.edu  Wed Apr 19 21:31:28 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id VAA13034
	for reliable_computing-outgoing; Wed, 19 Apr 2000 21:31:27 -0500 (CDT)
Received: from apollon.ito.ecei.tohoku.ac.jp (apollon.ito.ecei.tohoku.ac.jp [130.34.197.37])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id VAA13029
	for <reliable_computing [at] interval [dot] usl.edu>; Wed, 19 Apr 2000 21:31:03 -0500 (CDT)
Received: from localhost (micrus [130.34.197.15])
	by apollon.ito.ecei.tohoku.ac.jp (8.8.8/3.6W-) with ESMTP id LAA19718;
	Thu, 20 Apr 2000 11:37:22 +0900 (JST)
To: haskell [at] haskell [dot] org, csl [at] dbai [dot] tuwien.ac.at, prolog-vendors [at] sics [dot] se,
        papm [at] dcs [dot] ed.ac.uk, clp [at] comp [dot] nus.edu.sg, amast [at] cs [dot] utwente.nl,
        ikbs [at] caad [dot] ed.ac.uk, fsdm [at] it [dot] uq.edu.au, rewrting@ens-lyon.fr,
        skeletons [at] dcs [dot] ed.ac.uk, lprolog [at] cis [dot] upenn.edu,
        lics [at] research [dot] bell-labs.com, idss [at] socs [dot] uts.edu.au, forum [at] jsoftware [dot] com,
        dss [at] cs [dot] auc.dk, erlang-questions [at] erlang [dot] org, types [at] cis [dot] upenn.edu,
        brics-vip [at] daimi [dot] aau.dk, vdm-forum [at] mailbase [dot] ac.uk, nl-kr [at] cs [dot] rpi.edu,
        ecoopws [at] cui [dot] unige.ch, clean-list [at] cs [dot] kun.nl,
        reliable_computing [at] interval [dot] usl.edu, facs [at] lboro [dot] ac.uk,
        atp_alias [at] cs [dot] jcu.edu.au, prolog-pe [at] bach [dot] ces.cwru.edu,
        clp [at] cis [dot] ohio-state.edu
cc: miyakawa [at] ito [dot] ecei.tohoku.ac.jp
Subject: IFIP TCS2000 INFORMATION
X-Mailer: Mew version 1.94.1 on XEmacs 20.4 (Emerald)
Mime-Version: 1.0
Content-Type: Text/Plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Message-Id: <20000420113127Q.miyakawa [at] ito [dot] ecei.tohoku.ac.jp>
Date: Thu, 20 Apr 2000 11:31:27 +0900
From: Shinya MIYAKAWA <miyakawa [at] ito [dot] ecei.tohoku.ac.jp>
X-Dispatcher: imput version 990905(IM130)
Lines: 650
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

[Apologies for multiple copies]

IFIP TCS2000 PRELIMINARY PROGRAM AND REGISTRATION INFORMATION
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
--------------------------------------------------------------------------

IFIP International Conference on Theoretical Computer Science 
                   (IFIP TCS2000)
 --- Exploring New Frontiers of Theoretical Informatics ---

 August 17 - 19, 2000

 Aoba Memorial Bldg., Tohoku University, Sendai, Japan

 Further Information about IFIP TCS2000 can be obtained on the Web, at

       http://tcs2000.ito.ecei.tohoku.ac.jp/tcs2000/

 Any inquiry on IFIP TCS2000 Program and Registration may be directed to

       TCS2000 [at] ito [dot] ecei.tohoku.ac.jp

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

PRELIMINARY PROGRAM
^^^^^^^^^^^^^^^^^^^
  [Outline]
   
      AUGUST 16: 15:00 Registration at Sendai Tokyu Hotel till 20:00
                 18:00 Welcome at Sendai Tokyu Hotel till 19:00

      AUGUST 17:  9:30 Opening Session 
                 10:00 Keynote Plenary Talk 1
                 -----------------------------------------
                 11:10 - 17:30  TRACK (1)  ||  TRACK (2) 
                 -----------------------------------------

      AUGUST 18:  9:10 Keynote Plenary Talk 2 
                 -----------------------------------------
                 10:20 - 15:30  TRACK (1)  ||  TRACK (2)
                 -----------------------------------------
                 15:50 Panel Discussion till 17:10
                 -----------------------------------------
                 18:30 Banquet at Sendai Tokyu Hotel

      AUGUST 19:  9:10 Keynote Plenary Talk 3 
                 -----------------------------------------
                 10:20 - 14:20  TRACK (1)  ||  TRACK (2)
                 -----------------------------------------
                 14:30 Closing Session till 14:40
                 -----------------------------------------
                 15:00 Open Lectures till 17:00
                 -----------------------------------------
                 18:30 Japanese Dinner Party till 20:00
                 -----------------------------------------

AUGUST 16 WEDNESDAY
^^^^^^^^^^^^^^^^^^^
  15:00 REGISTRATION at Sendai Tokyu Hotel till 20:00

  18:00 WELCOME with light snack at Sendai Tokyu Hotel till 19:00

AUGUST 17 THURSDAY
^^^^^^^^^^^^^^^^^^
   9:30 OPENING SESSION
        Giorgio Ausiello (TC1 Chair and IFIP TCS2000 Co-Chair)
        Takayasu Ito (IFIP TCS2000 Co-Chair)
  
  10:00 KEYNOTE PLENARY TALK
        Reconciling Two Views of Cryptography
        Martin Abadi (Bell Labs, Lucent)

  10:50 Break

 [TRACK (1)]

            SESSION (1.1), 11:10 - 12:00

  11:10 Approximation Algorithms for String Folding Problems
        Giancarlo Mauri, Giulio Pavesi

  11:35 An Index for Two Dimensional String Matching Allowing Rotations
        Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen

  12:00 Lunch Break

            SESSION (1.2),  13:30 - 14:20

  13:30 Parallel Edge Coloring of a Tree on a Mesh Connected Computer
        Chang-Sung Jeong, Sung-Up Cho, Mi-Young Choi

  13:55 Parallel Approximation Algorithms for Maximum Weighted Matching
        in General Graphs
        Ryuhei Uehara, Zhi-Zhong Chen

  14:20 Break

  14:40 TRACK (1) INVITED TALK
        It is on the Boundary: Complexity Considerations for Polynomial 
        Ideals
        Ernst Mayr (TU Muenchen)

  15:30 Break

            SESSION (1.3), 15:50 - 17:30

  15:50 An Efficient Parallel Algorithm for Scheduling Interval Ordered 
        Tasks
        Yoojin Chung, Kunsoo Park

  16:15 Task Distributions on Multiprocessor Systems
        Evgeny V. Shchepin, Nodari Vakhania

  16:40 Fast Interpolation using Kohonen Self-Organizing Neural Networks
        Olivier Sarzeaud, Yann Stephan

  17:05 Steganography Using Modern Arts
        Galdi Clemente, Blundo Carlo

  17:30 Break

  -----------//

 [TRACK (2)]

            SESSION (2.1), 11:10 - 12:00

  11:10 Ambient Groups and Mobility Types
        Luca Cardelli, Giorgio Ghelli, Andrew D. Gordon

  11:35 An Asynchronous, Distributed Implementation of Mobile Ambients
        Cedric Fournet, Jean-Jacques Levy, Alan Schmitt

  12:00 Lunch Break

  13:30 TRACK (2) INVITED TALK
        Type Systems for Concurrent Processes: From Deadlock-Freedom to 
        Livelock-Freedom, Time-Boundedness
        Naoki Kobayashi (U. Tokyo)

  14:20 Break

            SESSION (2.2), 14:40 - 15:30

  14:40 Local pi-Calculus at Work: Mobile Objects as Mobile Processes
        Massimo Merro, Josva Kleist, Uwe Nestmann

  15:05 An Interpretation of Typed Concurrent Objects in the Blue Calculus
        Silvano Dal-Zilio

  15:30 Break

            SESSION (2.3), 15:50 - 17:30

  15:50 A Higher-Order Specification of the pi-Calculus
        Joelle Despeyroux

  16:15 Open Ended Systems, Dynamic Bisimulation, and Tile Logic
        Vladimiro Sassone

  16:40 Fibred Models of Processes: Discrete, Continuous, and Hybrid Systems
        Marcelo Fiore

  17:05 On the Complexity of Bisimulation Problems for Pushdown Automata
        Richard Mayr

  17:30 Break

AUGUST 18 FRIDAY
^^^^^^^^^^^^^^^^
   9:10 KEYNOTE PLENARY TALK
        Theory and Construction of Molecular Computers
        Masami Hagiya (U. Tokyo)

  10:00 Break

 [TRACK (1)]

            SESSION (1.4), 10:20 - 12:00

  10:20 Trade-offs between Density and Robustness in Random Interconnection
        Graphs
        P. Flajolet, K. Hatzis, S. Nikoletseas, P. Spirakis

  10:45 The ($\sigma$+1)-Edge-Connectivity Augmentation Problem without 
        Creating Multiple Edges
        Satoshi Taoka, Toshimasa Watababe

  11:10 On the Hardness of Approximating Some NP-optimization Problems 
        Related to Minimum Linear Ordering Problem
        Sounaka Mishra, Kripasindhu Sikdar

  11:35 Maximum Clique and Minimum Clique Partition in Visibility Graphs
        Stephan Eidenbenz

  12:00 Lunch Break

            SESSION (1.5), 13:30 - 14:20

  13:30 Real-Time Language Recognition by Alternating Cellular Automata
        Thomas Buchholz, Andreas Klein, Martin Kutrib

  13:55 Damage Spreading and $\mu$-Sensitivity on CA
        Bruno Martin

  14:20 Break

  14:40 TRACK (1) INVITED TALK
        Discrepancy Theory and its Applications to Finance
        Shu Tezuka (IBM Tokyo Research Lab)

  15:30 Break

  -----------//

 [TRACK (2)]

            SESSION (2.4), 10:20 - 12:00

  10:20 A Type-theoretic Study on Partial Continuations
        Yukiyoshi Kameyama

  10:45 Partially Typed Terms between Church-Style and Curry-Style
        Ken-etsu Fujita, Aleksy Schubert

  11:10 Alternating Automata and Logics over Infinite Words
        Christof Loeding, Wolfgang Thomas

  11:35 Hypothesis Support for Information Integration in Four-Valued Logics
        Yann Loyer, Nicolas Spyratos, Daniel Stamate

  12:00 Lunch Break

  13:30 TRACK (2) INVITED TALK
        A Compositional Model of Time and Uncertainty
        Thomas Henzinger (UC Berkeley)

  14:20 Break

            SESSION (2.5), 14:40 - 15:30

  14:40 A Single Complete Refinement Rule for Demonic Specifications
        Karl Lermer, Paul Strooper

  15:05 Reasoning about Composition using Property Transformers and their 
        Conjugates
        Michel Charpentier, K. Mani Chandy
        
  15:30 Break

  -----------------------
 
  15:50 PANEL DISCUSSION on "New Challenges for TCS"
        Panelists: Giorgio Ausiello (U. Roma "La Sapienza")
                   Jozef Gruska <Co-Chair> (Masaryk U.)
                   Ugo Montanari (U. Pisa)
                   Takao Nishizeki <Co-Chair> (Tohoku U.)
                   Yoshihito Toyama (Tohoku U.)
                   Jiri Wiedermann (Inst. Informatics, Prague)

  17:10 Break

  18:30 BANQUET at Sendai Tokyu Hotel till 20:45
        BANQUET SPEECH
        Non-Random Thoughts about Randomization
        Michael O. Rabin (Harvard U.)

AUGUST 19 SATURDAY
^^^^^^^^^^^^^^^^^^
   9:10 KEYNOTE PLENARY TALK
        List Decoding: Algorithms and Applications
        Madhu Sudan (MIT)

  10:00 Break

 [TRACK (1)]

            SESSION (1.6), 10:20 - 12:00

  10:20 Fully Consistent Extensions of Partially Defined Boolean Functions
        with Missing Bits
        Endre Boros, Toshihide Ibaraki, Kazuhisa Makino

  10:45 Characterization of Optimal Key Set Protocols
        Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki

  11:10 On the Complexity of Integer Programming in the Blum-Shub-Smale
        Computational Model
        Valentin E. Brimkov, Stefan S. Dantchev

  11:35 On Logarithmic Simulated Annealing
        A. Albrecht, C.K. Wong

  12:00 Lunch Break

  13:30 TRACK (1) INVITED TALK
        Hierarchical State Machines
        Mihalis Yannakakis (Bell Labs, Lucent)

  14:20 Break

  -----------//

 [TRACK (2)]

  10:20 TRACK (2) INVITED TALK
        Some New Directions in the Syntax and Semantics of Formal Languages
        Gordon D. Plotkin (Edinburgh U.)

  11:10 Break

  11:20 DEMO SESSION (1) on Verification Tools

  12:00 Lunch Break

  13:30 DEMO SESSION (2) on Verification Tools

  14:20 Break

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

  14:30 CLOSING SESSION till 14:40
        Giorgio Ausiello (TC1 Chair and IFIP TCS2000 Co-Chair) 
        Takayasu Ito (IFIP TCS2000 Co-Chair)

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

 [OPEN LECTURES]

  15:00 On the Power of Interactive Computing
        Jan van Leeuwen (U. Utrecht)

  16:00 The Varieties of Programming Language Semantics
        Peter D. Mosses (U. Aarhus)

  17:00 Break

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

  18:30 JAPANESE DINNER PARTY till 20:00

==========================================================================

GENERAL INFORMATION
^^^^^^^^^^^^^^^^^^^

IFIP TCS2000 is the first International Conference on Theoretical Computer 
Science organized by IFIP TC1 on Foundations of Computer Science, and it 
consists of two tracks: TRACK (1) on Algorithms, Complexity and Models of 
Computation, and TRACK (2) on Logic, Semantics, Specification, and 
Verification. The conference proceedings will be published as a volume
of Lecture Notes in Computer Science, Springer-Verlag.

IFIP TCS2000 will be held on the campus of Tohoku University, Sendai, Japan.
The invited talks and contributed talks will be presented at the Aoba 
Memorial Building and Engineering Conference Hall, Faculty of Engineering 
located on the Aoba Hill about 3 km west of downtown Sendai. The conference
welcome reception and banquet will be held at Sendai Tokyu Hotel, located 
at downtown Sendai.

Please, register and make reservations by returning the completed form 
by email and fax, following the instructions below.
There will also be on-site registration at:
   * Sendai Tokyu Hotel, 15:00 - 20:00, August 16
   * Aoba Memorial Bldg., Tohoku Univ., 9:00 - 17:00 on August 17 - 19.

Transportation

Conference participants arriving at the new Tokyo International (Narita) 
Airport are advised to take the JR Narita Express train from Narita Airport
to Tokyo Station. 
Then, take the Yamabiko super express train of Tohoku Shinkansen (Tohoku 
Bullet Train) to Sendai from Tokyo Station. The Yamabiko runs every 20 - 30
min. and takes about 2 hours from Tokyo to Sendai. Making reservation at 
Narita Station for the Yamabiko is recommended, since it will be the summer
tourist season. 
Those arriving at the new Osaka International Airport (Kansai Airport) can
fly to Sendai Airport, and take Limousine Bus service to Sendai Station. 
The bus takes about 30 min. to go from the Airport to Sendai Station. You 
can also take a shuttle bus service from Kansai Airport to the Osaka-Itami 
Airport to fly from there to Sendai Airport. Alternatively, you can take a 
local train from the Kansai Airport to JR Shin Osaka Station, then take the
Tokaido Shinkansen from Osaka to Tokyo Station and change at Tokyo Station 
to Tohoku Shinkansen. 
Some details on transportation will be available on the TCS2000 Web page, at
        http://tcs2000.ito.ecei.tohoku.ac.jp/tcs2000/
Note: 
(1) In Japan, mid-August is the busiest tourist time during summer, 
    including domestic and international flights. 
(2) No flight service is available from Narita to Sendai Airport, since the
    train service is convenient. There is another train service from Narita
    Airport to downtown Tokyo (Ueno) by Skyliner of the Keisei-Narita Line.
    At Ueno you can take the Yamabiko super express of Tohoku Shinkansen to
    Sendai, but you have to walk about 10 min. from Keisei-Ueno Station to 
    JR Ueno Station to take Tohoku Shinkansen.
(3) If you are going to travel in Japan by JR lines before/after the IFIP 
    TCS2000 conference, it will be convenient and economical to get a JR 
    PASS before your departure. Contact your travel agent for more 
    information on JR PASS (Japan Rail Pass).

Hotels

Two hotels are arranged to offer special discount rates to IFIP TCS2000 
participants: Sendai Tokyu Hotel and Sendai Washington Hotel. They are 
1.2 km west of Sendai Station and about 800 Yen by taxi from the station. 
These hotels are located within 5 min. walk from each other. The conference
welcome reception and banquet will be held at Sendai Tokyu Hotel.

Sendai and Climate

Sendai is the largest city in the northern part of the Honshu Island of 
Japan, with a population of about a million. The City is known in Japan 
as "City of Trees". Sendai is a modern, safe city with a temperate climate 
blessed by four distinct seasons; even in mid August it is quite seldom 
that the highest temperature exceeds 30 C (86 F). 
Usually, the weather in mid August would be mostly sunny with temperatures
ranging from 20 C (68 F) to 30 C (86 F), and rain, if any, would rarely be
heavy.
Note: Average temperatures in August at Sendai, Tokyo and Osaka are about 
      23.5 C, 26.5 C and 27.5, respectively.

REGISTRATION AND RESERVATION INFORMATION
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
                                                                            
REGISTRATION FEES

Registration fees cover attendance in all sessions, a copy of the proceedings, 
refreshments, the welcome reception and banquet, but not the Japanese dinner 
party on August 19. The reduced author rate applies to all authors of the 
accepted papers, and the reduced committee member rate applies to all TC1 
members and to all members of the Program Committee and the Organizing 
Committee. The student rate applies to full time students. Registrants paying
reduced rates have full privileges at the conference. The companion rate 
covers the reception and banquet only.

                      Through July 1st, 2000          From July 2nd, 2000 
   Regular                  40,000 Yen                    50,000 Yen
   Author                   30,000 Yen                    40,000 Yen
   Committee Member         30,000 Yen                    40,000 Yen
   Student                  25,000 Yen                    30,000 Yen
   Companion                 5,000 Yen                     7,000 Yen

HOTELS

Two convenient Western Style hotels offer special IFIP TCS2000 discount rates.
Rates are per person, per night, and include service charge and tax (not 
including breakfast).

                                    Single Room           Twin Room
   Sendai Tokyu Hotel               10,500 Yen            8,400 Yen
   Sendai Washington Hotel II        8,400 Yen            7,350 Yen
   Sendai Washington Hotel I         7,350 Yen            ---------

Note: Twin room reservations are available for two persons. No roommate 
      matching service is available, so that twin room reservations remain 
      the registrant's responsibility.
 
JAPANESE DINNER PARTY

A Japanese dinner party for participants from abroad will be arranged at
SHOZANKAN in the evening of August 19. The invited speakers, some Steering
Committee members, PC members and conference organizers will attend. A 
limited number of reservations will be available for this dinner party. 
The rates are as follows.

   Conference registrant:   10,000 Yen
   Companion:                7,000 Yen

=============================================================================
Cut here to send your registration form after filling in the required items.
=============================================================================

IFIP TCS2000 REGISTRATION AND RESERVATION FORM
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^

Please register and make reservations by completing the form below and 
returning it by email to

        tcs02 [at] thk [dot] jtb.co.jp

Registrants are advised to email a copy of their completed form to

        TCS2000 [at] ito [dot] ecei.tohoku.ac.jp

They are also encouraged to send a signed, printed copy of their completed 
form by fax to

        022-262-5002 (domestic)
     +81-22-262-5002 (from abroad)

which is the fax number of the following agent to take care of the conference
registration and reservation.

    JTB (Japan Travel Bureau) Tohoku Communications Inc.
    Kotsukosha Bldg 3F, 3-6-Chuo
    Aoba-Ku, Sendai 980-0021, Japan

    (Fax)   022-262-5002 (domestic)
            +81-22-262-5002 (from abroad)
    (Phone) 022-262-5055 (domestic)
            +81-22-262-5055 (from abroad)
    (Email) tcs02 [at] thk [dot] jtb.co.jp

Registration and reservations will be completed by your payment, whose method
is described below.

IMPORTANT NOTE: As described below, from the standpoint of the safety, 
    registrants are advised to pay fees by Bank Transfer. When the payment is
    made by a credit card, they are advised to send the required information 
    including Credit Card numbers by FAX; that is, do NOT send Credit Card 
    numbers by email.
  
REGISTRATION FOR IFIP TCS2000
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  Last (Family) Name:

  First (Given) Name:

  Middle:

  Affiliation:

  Postal Address:

  City/State/Zip:

  Country:

  Phone:

  Fax:

  Email:

  Registration Status 
    <Regular, Author, Committee Member, Student>:

  Number of Companions:

  Companions' names (if applicable):

  (A) Total Registration Fee(s) in Yen:

HOTEL RESERVATION

  Hotel First Choice:

  Hotel Second Choice:

  Number of Single Room(s):

  Number of Twin Room(s):

  Roommate's Name(s) for Twin Room(s):

  Check-in Date:

  Check-out Date:

  Number of Nights:

  Special Room or other Request:

JAPANESE DINNER PARTY

  A limited number of reservations are available for the Japanese dinner 
  party at SHOZANKAN on August 19 to be arranged for participants from 
  abroad.

  (B) 10,000 Yen x [   ] conference registrant(s):

  (C)  7,000 Yen x [   ] companion(s):

TOTAL FEE IN YEN

  (A) + (B) + (C):

Signature (not needed for email):

METHOD OF PAYMENT FOR IFIP TCS2000

   From the standpoint of the safety and security, participants are encouraged
   to pay via Bank Transfer. When they pay via credit card, they are advised 
   to send the required information (in particular, Credit Card numbers) by 
   FAX; that is, do NOT send your Credit Card numbers by email. 
   In credit card payment Visa card, MasterCard, and Diners card will be 
   accepted. Personal checks cannot be accepted.
   All payments must be made in Japanese Yen.

Indicate method of payment below:

  [    ] Bank Transfer to

              Bank: Tokyo Mitsubishi Bank, Sendai Branch
              Account Name: IFIP TCS2000 Chair Takayasu Ito
              Account No. 1108671  

         From <bank name>:

         Date of transfer:

         Payer's name:

         Note: In Japan the bank number of Tokyo Mitsubishi Bank is 0005, and
               the number of its Sendai Branch is 320.

  [    ] Payment by Credit Card

         Credit Card Type <Visa, MasterCard, or Diners>:

         Card Number:

         Expiration Date:

         Signature (not needed for email):
                                                                              
  <Note>: When your payment is via Credit Card, send the above information
          by FAX to +81-22-262-5002, the fax no. of JTB Communications Inc. 
          Even when you send the above form by fax, send it by EMAIL 
          without  filling in Credit Card number for safety.
          ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Registration and reservations will be confirmed upon receipt of payment.
Refunds will be made upon written request received through July 31st, 2000
by JTB Tohoku Communications Inc.









                   

  


        












From owner-reliable_computing [at] interval [dot] usl.edu  Thu Apr 20 19:10:10 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id TAA15581
	for reliable_computing-outgoing; Thu, 20 Apr 2000 19:10:10 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id TAA15576
	for <reliable_computing [at] interval [dot] louisiana.edu>; Thu, 20 Apr 2000 19:10:06 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.10.1/8.10.1) with SMTP id e3L0A1728819;
	Thu, 20 Apr 2000 18:10:01 -0600 (MDT)
Message-Id: <200004210010.e3L0A1728819 [at] cs [dot] utep.edu>
Date: Thu, 20 Apr 2000 18:10:02 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: please express your interest by May 1
To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: 2vMyhm8Z5fLqGEePsep+qw==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

                                  URGENT !!!

                               CALL FOR PAPERS

                                Mini-track on 
                  INTERVAL COMPUTATIONS AND FUZZY TECHNIQUES 
                                  at the 
   Joint 9th IFSA World Congress and 20th NAFIPS International Conference
     of NAFIPS, the North American Fuzzy Information Processing Society
            and IFSA, the International Fuzzy Systems Association

INTRODUCTION: FUZZY TECHNIQUES 

In many application areas, we do not have an exact model of the
situation and of the objects and processes that we want to
analyze and to control. Instead, we have expert knowledge about these
objects and processes, knowledge which experts can often only
describe by using imprecise ("fuzzy") words and terms from natural
languages such as "small", "significant", etc. To enable computers to
use this knowledge, it is necessary to reformulate it in
computer-understandable terms, and then be able to process thus
reformulated knowledge. Techniques for reformulating and processing
such "linguistic" (natural-language) knowledge were proposed by Lotfi
Zadeh in early 1960's under the name of "fuzzy techniques". 

In the past decades, these techniques have been successfully used in many
application areas, from control to expert systems to medicine. 

* The success of these techniques is largely due to the fact that from
  the *methodological* viewpoint, these techniques 
  are based on revolutionary new ideas and approaches, which enabled
  researchers and engineers to handle problems which could not be solved
  before. 

* On the other hand, the practical success of fuzzy techniques 
  is also due to the fact that from the purely *mathematical* and
  *computational* viewpoint, the corresponding techniques are related
  to known computational techniques developed and known in non-fuzzy
  ("crisp") situations. Thus, fuzzy techniques can re-use known
  algorithms and programs to solve new problems. 

INTERVAL COMPUTATIONS AND FUZZY TECHNIQUES: MAIN RELATION

One of the main examples of crisp techniques which are useful in fuzzy
applications is interval computations. 

The reason why interval computations are useful is that the main
object of fuzzy techniques - the fuzzy set -- can be viewed as a
nested family of sets, or, in 1-D case, the nested family of
intervals. These sets (intervals) are called "alpha-cuts" of the
original fuzzy set. Many operations with fuzzy sets can be naturally
reformulated in terms of the corresponding sets (intervals). 

Because of this relation, interval methods are widely used in fuzzy
applications. This relation is well recognized: most textbooks and
monographs on fuzzy sets and fuzzy techniques have a chapter on
interval computation (Klir and Yuan have a chapter, Bojadziev's book
is all devoted to this relation, etc.).

INTERVAL COMPUTATIONS AND FUZZY TECHNIQUES: ADDITIONAL RELATIONS

There are many other relations between fuzzy and intervals. For
example, normally, a fuzzy set (e.g., the set of all small objects) 
is defined as a function m(x) which assigns,
to every element x from a certain domain, the degree m(x) to which
this element belongs to this fuzzily defined set. 

It is difficult to
expect that we can come up with an exact value for this degree. It is
more natural to assume that an expert provides us with an *interval*
of possible values. Thus, we get the idea of "interval-valued"
fuzzy sets, which have been successfully used by I. B. Turksen,
L. Kohout, J. Mendel, and many other researchers. Handling
interval-valued functions requires a lot of interval computations.  

INTERVAL COMPUTATIONS AND FUZZY TECHNIQUES: PROBLEMS

Many researchers use interval techniques in fuzzy
applications. However, often, they use outdated (1960s') interval
techniques where more advanced techniques would lead to much more
effective and efficient results. This disconnect is caused by two
reasons:

* On one hand, many researchers in the area of fuzzy methods are not
  very familiar with the latest advances in interval computations. 

* On the other hand, many interval researchers are not very familiar
  with problems and methods of fuzzy techniques.

INTERVAL COMPUTATIONS AND FUZZY TECHNIQUES: UNIQUE OPPORTUNITY

Right now, there is a great opportunity to narrow the gap between 
interval and fuzzy communities. In June 25-28, 2001, there will be a
major event: a joint conference of the North American Fuzzy
Information Processing Society (NAFIPS) and the International Fuzzy
Systems Association (IFSA) in Vancouver (see CFP below). 

The organizers of this joint conference realized that this disconnect
harms both communities and prevents them from even more successful
applications. Therefore, they suggested that we organize a special
mini-track on interval computations and fuzzy techniques. 

The intention is that this mini-track include:

* technical and applied talks on successes and problems 
  of interval methods in fuzzy techniques;

* survey talks by *interval* researchers on the existing interval
  techniques;

* technical talks of *interval* researchers on new algorithms which may
  be of use in fuzzy applications;

* talks by *fuzzy* researchers on interval-related fuzzy problems which
  may benefit from using improved interval algorithms;

* any related talks on techniques which generalize interval and/or
  fuzzy approaches. 

THIS IS REALLY URGENT

To provide maximum publicity to this endeavor, the organizers of
NAFIPS'01 want to publicize it during this year's IEEE Conference
FUZZIEEE'2000 which will take place in early May. 

To be able to do that, they need to have the preliminary idea of this
mini-track by May 1, 2000. This list does not have to be final, but it
will be used to advertise the conference and its interval mini-track.

Since I am very familiar with both communities, I volunteered to serve
as a preliminary contact point for this mini-track. 

I have already
talked with several renown researchers who have successfully combined
interval and fuzzy techniques, and many expressed their interest in
presenting their results at this mini-track. But to have an impact, to
provide a breakthrough, we need as many researchers and papers as possible.

If you are interested in presenting a talk at this mini-track, please
send me (by email) your name and the preliminary title of your talk 
(abstract is also great, but if it is difficult to produce an abstract
at short notice, abstracts are only due by December 15). 

Let us all together make a difference!

Yours

Vladik

Vladik Kreinovich
Department of Computer Science
University of Texas at El Paso
El Paso, TX 79968, USA
email vladik [at] cs [dot] utep.edu
*****************************************************************************
                               Call for Papers

   Joint 9th IFSA World Congress and 20th NAFIPS International Conference

     of NAFIPS, the North American Fuzzy Information Processing Society
            and IFSA, the International Fuzzy Systems Association

              Fuzziness and Soft Computing in the New Millennium

                     Wednesday-Saturday July 25-28, 2001

         Coast Plaza Suite Hotel at Stanley Park, Vancouver, Canada

          URL http://morden.csee.usf.edu/ifsanafips2001.html

In Cooperation with:

                    IEEE Neural Networks Council
                  IEEE Systems, Man and Cybernetics Society

Conference Organization:

          Honorary Conference Chair:Lotfi A. Zadeh (USA)
          General Chairs:           Michael H. Smith (USA, Canada)
                                    William A. Gruver (Canada)
          Finance Chair:            Toshio Fukuda (Japan)
          Program Chair:            Lawrence O. Hall (USA)

Area Chairs:

            Fuzzy Control:              Roger Jang (Taiwan)
            Databases, Intelligent
            Systems:                    Janusz Kacprayk (Poland)
            Mathematics:                 John N. Mordeson (USA)
            Pattern Recognition:        Witold Pedrycz (Canada)

International Program Committee:

J.F. Baldwin (UK), M. Berthold (USA), Z. Bien (Korea), H.R. Berenji (USA),
J.C. Bezdek (USA), P. Bonissone (USA), B. Bouchon-Meunier (FR), J. Buckley
(USA), V. Cross (USA), R.N. Dave (USA), V. Davidson (Canada), K. Demirli
(Canada), C. deSilva (Canada), D. Dubois (France), R. Emami (Canada), A.O.
Esogbue (USA), F. Esteva (Spain), M. Fedrizzi (Italy), D. Filev (USA), T.
Fukuda (Japan), T. Furuhashi (Japan), P. Gader (USA), A. Geva (Israel), F.
Gomide (Brazil), N. Green-Hall (USA), M. Gupta (Canada), R. Hammell (USA),
K. Hirota (Japan), A. Kandel (USA), O. Kaynak (Turkey), J. Keller (USA), E.
Kerre (Belgium), E.P. Klement (Austria), G.J. Klir (USA), G. Knopf (Canada),
L.T. Koczy (Hungary), R. Kruse (Germany), R. Krishnapuram (USA), J. Lee
(Taiwan), C.S. George Lee (USA), Y.M. Liu (China), Z.Q. Liu (Au), R.
Mantaras (Spain), J. Meech (Canada), K.C. Min (Korea), M. Mizumoto (Japan),
D. Nauck (Germany), V. Park (Korea), F. Petry (USA), H. Prade (France),
D.A. Ralescu (USA), I. Rudas (Hungary), E.H. Ruspini (USA), S. Sandri
(Brazil), M. Schneider (Israel), D. Schwartz (USA), T. Sudkamp (USA), M.
Sugeno (Japan), H. Takagi (Japan), H. Thiele (Germany), L. Trajkovic
(Canada), E. Trillas (Spain), I.B. Turksen (Canada), M. Ulieru (Canada), E.
Walker (USA), P. Wang (USA), H.F. Wang (Taiwan), T. Whalen (USA), T.
Yamakawa (Japan), H. Ying (USA), R.R. Yager (USA), J. Yen (USA), D. Yeung
(China), H. J. Zimmermann (Ger).

THEME:

The past few years have witnessed a crystallization of soft computing as a
distinct body of concepts and techniques oriented toward the conception and
design of intelligent systems. Soft Computing is a partnership of fuzzy
logic, neurocomputing and probabilistic reasoning, with the latter subsuming
genetic algorithms, chaotic systems, belief networks and parts of learning
theory. Within soft computing, the principal contribution of fuzzy logic is
a methodology for exploiting the tolerance for imprecision to achieve
tractability, robustness, low solution cost and better rapport with reality.
Given the maturation of fuzzy logic, it is appropriate that this conference,
the first international joint conference of NAFIPS and IFSA, is held in the
new millennium to explore the future breakthroughs in fuzzy sets, fuzzy
logic, and soft computing.

PROGRAM:

There will be excellent research talks, panels, and invited plenaries by
Michio Sugeno, Burhan Turksen, and Lotfi Zadeh. The conference program will
also include focused special sessions and general papers. Contributed papers
will be reviewed based on content relevant to the theme of the conference.
Relevant topics may include, but are not limited to:

* Fuzzy Systems / sets / mathematics / control / databases / theory

* Soft Computing / fuzzy neural networks / fuzzy pattern recognition

* Learning / data mining / image processing

* Applications for the new millennium / successful applications

PAPER SUBMISSION:

Electronic submission is highly encouraged. To submit electronically, please
see our home page for instructions. Otherwise, three copies of 2 page
extended abstracts should be received no later than December 15, 2000, at
the following address:

Lawrence O. Hall
Computer Science & Engineering
University of South Florida
4202 East Fowler Avenue, ENB 118
Tampa, Florida, 33620-5399
USA

Each submission should have a cover page which includes the address, phone
number, fax number, and e-mail address of the corresponding author.
Decisions will be communicated by Feb. 15, 2001, with 5 page camera-ready
papers due by March 15, 2001.

CONFERENCE AND CONFERENCE SITE:

The conference will be held at the Coast Plaza Suite Hotel at Stanley Park
(http://www.coasthotels.com/hotels/stanley.htm, 1-800-663-1144), in
beautiful Vancouver, which is in British Columbia, Canada. The city is on
the coast and has a temperate climate. The hotel is within walking distance
of many restaurants, shops, and beaches. The banquet will be held in the
Vancouver Aquarium with dinner served in the aquarium galleries
(http://www.vancouver-aquarium.org/index2.htm).
The reception will be held on the 35th floor of the Coast Plaza Suite Hotel.

To be placed on the mailing list for future notices, please send name and
email address to the Program Chair, Lawrence O. Hall (hall [at] csee [dot] usf.edu).



From owner-reliable_computing [at] interval [dot] usl.edu  Fri Apr 21 09:20:27 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id JAA16509
	for reliable_computing-outgoing; Fri, 21 Apr 2000 09:20:26 -0500 (CDT)
Received: from mail.iat.cnr.it (mail.iat.cnr.it [146.48.65.43])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id JAA16504
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 21 Apr 2000 09:20:04 -0500 (CDT)
Received: from mailserv.iei.pi.cnr.it (mailserv.iei.pi.cnr.it [146.48.84.3])
 by mail.iat.cnr.it (PMDF V6.0-24 #36023)
 id <01JOI5FHAI6O9PLU0S [at] mail [dot] iat.cnr.it>
 (original mail from t.bolognesi [at] IEI [dot] PI.CNR.IT); Fri,
 21 Apr 2000 16:19:24 +0100 (MET)
Received: from mailserv.iei.pi.cnr.it (mailserv.iei.pi.cnr.it [146.48.84.3])
 by mail.iat.cnr.it (PMDF V6.0-24 #36023)
 with ESMTP id <01JOI5FGRL8G9PLT9B [at] mail [dot] iat.cnr.it> for
 forte-pstv-2000-lists-expand [at] reprocess [dot] iat.cnr.it
 (ORCPT forte-pstv-2000-lists [at] mail [dot] iat.cnr.it); Fri,
 21 Apr 2000 16:19:13 +0100 (MET)
Received: from [146.48.84.49] (mac-bolognesi.iei.pi.cnr.it [146.48.84.49])
	by mailserv.iei.pi.cnr.it (8.9.3/8.9.3) with ESMTP id OAA16639	for
 <forte-pstv-2000-lists [at] mail [dot] iat.cnr.it>; Fri, 21 Apr 2000 14:20:40 -0100 (GMT)
Date: Fri, 21 Apr 2000 16:21:30 +0100
From: Tommaso Bolognesi <t.bolognesi [at] IEI [dot] PI.CNR.IT>
Subject: FORMAL METHODS *ELSEwHeRE* --second CfP
X-Sender: bolog [at] mailserv [dot] iei.pi.cnr.it
To: forte-pstv-2000-lists [at] mail [dot] iat.cnr.it
Reply-to: forte-pstv-2000 [at] cpr [dot] it
Message-id: <l0313031bb5262134d935@[146.48.84.49]>
MIME-version: 1.0
Content-type: text/plain; charset=us-ascii
Content-transfer-encoding: 7BIT
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

--------- Second Call for Papers ---------

         F M - E L S E w H e R E
         ---------------------------------------------------
         (FORMAL METHODS *ELSEWHERE*)
         ---------------------------------------------------

         A Satellite Workshop of FORTE-PSTV-2000,
         devoted to applications of Formal Methods to areas
         *other than* communication protocols and software engineering.

         P i s a ,   I t a l y,   O c t o b e r   1 0 ,   2 0 0 0

FM-ELSEWHERE web page - http://www.cs.ukc.ac.uk/people/staff/hb5/Elsewhere/

FORTE/PSTV web page - http://forte-pstv-2000.cpr.it


OBJECTIVES
==========

A wide variety of formal models, languages and methods have been developed
in the last two decades for supporting the specification, design,
verification, implementation and testing of computer networks and
distributed software systems. These include CCS, pi-calculus, timed and
stochastic process algebra, VDM, Z, B, Automata and Timed Automata, Petri
Nets, Statecharts, Logics, TLA, Message Sequence Charts, ADT's, OBJ, Larch,
formal Object-Oriented approaches, the international standards Estelle,
LOTOS, SDL, ASN.1 and TTCN, and others.

Formal specification languages have been designed to support the
description of system structure and behaviour in terms of concepts such as
event occurrence, observation and experiment, temporal ordering, causality,
cooperation and synchronisation among entities, non determinism,
concurrency and parallelism, state changes and invariants, and others.
While considerable experience has been gained in the application of formal
methods to the areas for which they were initially conceived, the
high abstraction level of these concepts suggests that they could play
an important role in several other disciplines such as chemistry, biology,
physics and even arts, humanites and social sciences.

After two decades of 'traditional' applications, during which the initial
gap between the excessive optimism of academic supporters and the
skepticism of industrial detractors have been substantially reduced, often
leading to a positive and constructive attitude towards their adoption,
formal methods are perhaps ready to spread out of their native territory
and, at the turn of the decade and millenium, invade new exciting areas of
research, thus providing a much wider exploitation of the huge intellectual
investment behind their definition.  In fact, it is often the case that
a technique designed with a particular application in mind, turns out to
perform better and to be more useful in a context other than the originally
intended one.

The FM-ELSEWHERE workshop, co-located with FORTE-PSTV-2000 at Pisa, will
be a forum  for researchers who are interested in the application of
formal methods, as identified above, to virtually any area of research,
except communication protocols and software engineering.

Topics  of interest  include (but are certainly not limited to) the following:

- formal methods in physics, chemistry, biology;
- formal methods in human and social sciences;
- formal methods in the arts;
- formal description of games and generic rule systems;
- formal methods for the analysis and development of user manuals (from
consumer electronics to avionics and nuclear plants);
- formalisation and verification of legal, medical, bureaucratic and
safety critical procedures and protocols;
- formalised music analysis, synthesis and composition;
- formal modeling of narrative (novels, theatre, movie plots).

If you are interested to submit but are not sure whether your
application of formal methods is sufficiently strange, you can
mail Howard Bowman (H.Bowman [at] ukc [dot] ac.uk) to see whether it passes
the "unusualness" criteria.

Also, we will be keeping a list of known non-traditional applications of
formal methods on the workshop web page,

   http://www.cs.ukc.ac.uk/people/staff/hb5/Elsewhere/

and if you wish to contribute an item to the list mail Howard Bowman
(H.Bowman [at] ukc [dot] ac.uk).

ORGANISERS
===========

Howard Bowman (Univ. of Kent at Canterbury)
Tommaso Bolognesi (CNR/I.E.I. at Pisa)
Giorgio Faconti (CNR/CNUCE at Pisa)

WORKSHOP COMMITTEE
===================

Tommaso Bolognesi (CNR/I.E.I. at Pisa, Italy)
Howard Bowman (Univ. of Kent at Canterbury, UK)
Alan Dix (aQtive Limited, UK)
David Duce (Rutherford Appleton Laboratory, UK)
David Duke (University of York, UK)
Giorgio Faconti (CNR/CNUCE at Pisa, Italy)
Chris Johnson (University of Glasgow, UK)
Peter Johnson (University of Bath, UK)
Peter B. Ladkin (University of Bielefeld, Germany)
Scott Smolka (State University of New York at Stony Brook, US)

SUBMISSIONS
============

Send by e-mail a copy of your paper to Howard Bowman (H.Bowman [at] ukc [dot] ac.uk).
A light-weight review process will be employed. Electronic publication of
the workshop contributions is being investigated.

Submission deadline:	May 15, 2000
Notification of acceptance:	June 15, 2000

A 'Most Bizarre FM-Application' Award (of the symbolic value
of one Euro) will be assigned to the authors of the paper that
best matches the spirit of the Workshop -- one of combining
technical soundness with extreme application originality.



From owner-reliable_computing [at] interval [dot] usl.edu  Fri Apr 21 10:04:04 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA16916
	for reliable_computing-outgoing; Fri, 21 Apr 2000 10:04:04 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA16911
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 21 Apr 2000 10:03:56 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.10.1/8.10.1) with SMTP id e3LF3hb02948;
	Fri, 21 Apr 2000 09:03:43 -0600 (MDT)
Message-Id: <200004211503.e3LF3hb02948 [at] cs [dot] utep.edu>
Date: Fri, 21 Apr 2000 09:03:44 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: conference in Vancouver in 2001
To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: e1PmsnW+Fhk78xZwyf3oSg==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

P.S. The organizers have nothing against us having just our own mini-conference 
there, even if most of the talks will be unrelated to fuzzy. The idea is to get 
together is hopefully something that is now unrelated may turn out to be 
useful. 


From owner-reliable_computing [at] interval [dot] usl.edu  Wed Apr 26 14:55:26 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id OAA20365
	for reliable_computing-outgoing; Wed, 26 Apr 2000 14:55:26 -0500 (CDT)
Received: from kleene.math.wisc.edu (kleene.math.wisc.edu [144.92.166.90])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id OAA20116
	for <reliable_computing [at] interval [dot] louisiana.edu>; Wed, 26 Apr 2000 14:55:12 -0500 (CDT)
Received: from forelli.math.wisc.edu (forelli.math.wisc.edu [144.92.166.70])
	by kleene.math.wisc.edu (8.9.3/8.9.3) with SMTP id OAA14023;
	Wed, 26 Apr 2000 14:39:34 -0500 (CDT)
Date: Wed, 26 Apr 2000 15:05:21 -0500 (CDT)
From: Hans Schneider <hans [at] math [dot] wisc.edu>
To: NETS -- at-net <at-net [at] mi [dot] uni-erlangen.de>,
        "Hershkowitz, Danny -- Hershkowitz Daniel" <hershkow [at] aluf [dot] technion.ac.il>,
        Danny Hershkowitz <hershkow [at] techunix [dot] technion.ac.il>,
        E-LETTER <eletter-request [at] win [dot] tue.nl>,
        "na.digest" <na.digest@na-net.ornl.gov>, ipnet-digest [at] math [dot] msu.edu,
        wim@bell-labs.com, hjt [at] eos [dot] ncsu.edu, vkm [at] eedsp [dot] gatech.edu,
        reliable_computing [at] interval [dot] louisiana.edu
cc: "Richard A. Brualdi" <brualdi [at] math [dot] wisc.edu>,
        Volker Mehrmann <mehrmann [at] Mathematik [dot] TU-Chemnitz.de>,
        Aad Thoen <a.thoen [at] elsevier [dot] nl>
Subject: LAA vol 310 contents
Message-ID: <Pine.GSO.3.96.1000426150306.15325A-100000 [at] forelli [dot] math.wisc.edu>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk



------------------------------------------------------------------------------
Hans Schneider                                 hans [at] math [dot] wisc.edu.
Department of Mathematics                      608-262-1402 (Work)
Van Vleck Hall                                 608-271-7252 (Home)
480 Lincoln Drive                              608-263-8891 (Work FAX)
University of Wisconsin-Madison                608-271-8477 (Home FAX)
Madison WI 53706 USA             http://www.math.wisc.edu/~hans (URL)
------------------------------------------------------------------------------



Dear Net Organizer:

Please circulate the attached LAA contents over your net.

Thanks

hans
---


             ContentsDirect from Elsevier Science
            =====================================

URL: http://www.elsevier.nl/locate/jnlnr/07738

Journal: Linear Algebra and its Applications
ISSN   : 0024-3795
Volume : 310
Issue  : 1-3
Date   : May 2000


pp 1-4
Introduction to a group of articles in tribute to Vlastimil Ptak
H. Schneider

pp 5-7
A remark on the Jordan normal form of matrices
V. Ptak, 

pp 9-10
On Ptak's derivation of the Jordan normal form
C.d. Boor

pp 11-17
Applications of the duality method to generalizations of the Jordan
canonical form
O. Holtz

pp 19-20
Circumstances of the submission of my paper in 1956
V. Ptak

pp 21-22
Vlastimil Ptak (8 November 1925 - 9 May 1999)
M. Fiedler

pp 23-24
List of publications of Vlastimil Ptak, 1995-1999
M. Fiedler


pp 25-42
A modified Gram-Schmidt algorithm with iterative orthogonalization
and column pivoting
A. Dax

pp 43-47
On an operator inequality
J. Singh Aujla

pp 49-71
Canonical forms for positive discrete-time linear control systems
R. Bru, S. Romero, E. Sanchez

pp 73-82
Linear preservers of minimal rank
L. Rodman, P. Semrl

pp 83-108
Superfast algorithms for Cauchy-like matrix computations and
extensions
V.Y. Pan, A. Zheng

pp 109-122
On the sequence of powers of a stochastic matrix with large exponent
S. Kirkland

pp 123-128
A note on unsolvable systems of max-min (fuzzy) equations
K. Cechlarova

pp 129-138
On maximal entries in the principal eigenvector of graphs
B. Papendieck, P. Recht

pp 139-148
Commuting pairs and triples of matrices and related varieties
R.M. Guralnick, B.A. Sethuraman

pp 149-165
Graph rigidity via Euclidean distance matrices
A. Alfakih

pp 167-181
Numerical approximation of the product of the square root of a matrix
with a vector
E.J. Allen, J. Baglama, S.K. Boyd

pp 183-194
Poincare series of semi-invariants of 2x2 matrices
M. Domokos

pp 195
Index


-------

NOTE:
ContentsDirect, which is automatically generated, lists the first author
of each paper and the corresponding author (if different). 




From owner-reliable_computing [at] interval [dot] usl.edu  Thu Apr 27 10:11:13 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA27408
	for reliable_computing-outgoing; Thu, 27 Apr 2000 10:11:13 -0500 (CDT)
Received: from mailgate.rz.uni-karlsruhe.de (exim [at] mailgate [dot] rz.uni-karlsruhe.de [129.13.64.97])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA27403
	for <reliable_computing [at] interval [dot] usl.edu>; Thu, 27 Apr 2000 10:11:08 -0500 (CDT)
Received: from iamk4503.mathematik.uni-karlsruhe.de (root [at] iamk4503 [dot] mathematik.uni-karlsruhe.de [129.13.129.3])
	by mailgate.rz.uni-karlsruhe.de with smtp (Exim 3.02 #2)
	id 12kpvA-0001T4-00; Thu, 27 Apr 2000 17:09:40 +0200
Received: from scan2000.de by iamk4503.mathematik.uni-karlsruhe.de (SMI-8.6/SMI-SVR4)
	id RAA10197; Thu, 27 Apr 2000 17:09:34 +0200
Message-ID: <39085837.E3DFAC7F [at] scan2000 [dot] de>
Date: Thu, 27 Apr 2000 17:09:43 +0200
From: scan2000 <orga [at] scan2000 [dot] de>
X-Mailer: Mozilla 4.61 [en] (X11; I; Linux 2.2.10 i686)
X-Accept-Language: en
MIME-Version: 1.0
To: na.digest@na-net.ornl.gov, opt-net@zib-berlin.de,
        im-net-digest [at] iwr [dot] uni-heidelberg.de,
        reliable_computing [at] interval [dot] usl.edu,
        scicomp [at] fauia10 [dot] informatik.uni-erlangen.de,
        numeric-interest [at] validgh [dot] com
Subject: scan2000 / Interval2000  *  2nd Announcement
Content-Type: text/plain; charset=iso-8859-1
Content-Transfer-Encoding: 8bit
X-MIME-Autoconverted: from quoted-printable to 8bit by interval.usl.edu id KAA27404
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

-------------------------------------------------------------------
> SECOND ANNOUNCEMENT  -  CALL FOR PAPERS  -  SECOND ANNOUNCEMENT <
-------------------------------------------------------------------

                            scan 2000
            9th GAMM - IMACS International Symposium on
             Scientific Computing, Computer Arithmetic,
                      and Validated Numerics


                          Interval 2000
         International Conference on Interval Methods in
                     Science and Engineering


           September 19 - 22, 2000, Karlsruhe, Germany


                     http://www.scan2000.de

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

> SUBJECT

The joint  conference continues  the series of scan-symposia under
the  joint sponsorship of GAMM and IMACS.  These conferences  have
traditionally  covered  the numerical  and algorithmic  aspects of
scientific  computing,  with a strong  emphasis on  validation and
verification of  computed results as well  as on arithmetic,  pro-
gramming, and algorithmic tools for this purpose.
The conference further continues  the series of Interval conferen-
ces focusing on interval  methods and their application in science
and engineering. The objectives  are to propagate current applica-
tions and research  as well as to promote a  greater understanding
and increased awareness of the subject matters.


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

> INVITED SPEAKERS

o Martin Berz, Michigan State University, East Lansing, MI 
o Roger A. Golliver, Intel Corp. Hillsboro, OR 
o John M. Guckenheimer, Cornell University, New York 
o John Gustafson, Ames , IA 
o Wilfried Juling, Computing Center, Universität Karlsruhe 
o P. Joseph McKenna, University College Cork, Ireland 
o Rudolf Lohner, Inst. f. Angew. Math., Universität Karlsruhe 
o Wolfram Luther, Universität Duisburg 
o Mitsuhiro T. Nakao, Kyushu University, Fukuoka, Japan 
o Louis B. Rall, University of Wisconsin, Madison, WI 
o Dietmar Ratz, AIFB, Universität Karlsruhe 
o Jiri Rohn, Charles University, Prague, Czech Republic 
o G. William Walster, SunSoft, Inc., Palo Alto, CA

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

> TOPICS OF INTEREST

o Hardware and software support for interval arithmetic 
o Theory, algorithms, and arithmetic for validated numerics 
o Supercomputing and reliability 
o Dynamical Systems and validation 
o Global optimization and validation 
o Programming tools for validating numerics 
o Computer aided proofs 
o Industrial and scientific applications of validating numerics

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

> INFORMATION

- How to register? http://www.scan2000.de/register
- Deadline for submission of abstracts: April 30, 2000
- How to submit an abstract? http://www.scan2000.de/abstracts
- Any Questions: mailto:info [at] scan2000 [dot] de

-------------------------------------------------------------------
> SECOND ANNOUNCEMENT  -  CALL FOR PAPERS  -  SECOND ANNOUNCEMENT <
-------------------------------------------------------------------

From owner-reliable_computing [at] interval [dot] usl.edu  Thu Apr 27 23:47:43 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id XAA22258
	for reliable_computing-outgoing; Thu, 27 Apr 2000 23:47:43 -0500 (CDT)
Received: from wombat.cs.rmit.edu.au (wombat.cs.rmit.edu.au [131.170.24.41])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id XAA21690
	for <reliable_computing [at] interval [dot] usl.edu>; Thu, 27 Apr 2000 23:47:13 -0500 (CDT)
Received: from goanna.cs.rmit.edu.au (zahirt [at] goanna [dot] cs.rmit.edu.au [131.170.24.40])
	by wombat.cs.rmit.edu.au (8.9.3/8.9.3/cshub) with ESMTP id OAA25423;
	Fri, 28 Apr 2000 14:46:33 +1000 (EST)
Received: (from zahirt@localhost)
	by goanna.cs.rmit.edu.au (8.9.3/8.9.3/csnode) id OAA13824;
	Fri, 28 Apr 2000 14:46:00 +1000 (EST)
Date: Fri, 28 Apr 2000 14:46:00 +1000 (EST)
From: Zahir Tari <zahirt [at] cs [dot] rmit.edu.au>
Message-Id: <200004280446.OAA13824 [at] goanna [dot] cs.rmit.edu.au>
To: Gi-FB5-L [at] aifb [dot] uni-karlsruhe.de, ISCA [at] ipass [dot] net,
        TOOLS_Europe_2000 [at] ulla [dot] irisa.fr, agents [at] cs [dot] umbc.edu, atrfyi [at] SHL [dot] COM,
        chisig [at] venus [dot] it.swin.edu.au, ckbs-int [at] cs [dot] keele.ac.uk,
        comsoc-chapters [at] ieee [dot] org, corba-patterns [at] cs [dot] uiuc.edu,
        csec-adm [at] sdl [dot] hitachi.co.jp, dasig [at] dsto [dot] defence.gov.au,
        distributed-ai-request [at] mailbase [dot] ac.uk, ecoop-info [at] ecoop [dot] org,
        edoc-info [at] iese [dot] fhg.de, interactif [at] lri [dot] fr, is-depts [at] fit [dot] qut.edu.au,
        isworld [at] listserv [dot] heanet.ie, it-announce [at] cs [dot] usyd.edu.au,
        javaCORBA [at] luke [dot] org, liz.ungar [at] boeing [dot] com, maamaw [at] cosmos [dot] imag.fr,
        mas-anwendungen [at] wirtschaft [dot] tu-ilmenau.de, odp [at] dstc [dot] edu.au,
        ontology [at] cs [dot] umbc.edu, open [at] it [dot] swin.edu.au, otug [at] rational [dot] com,
        pdcemail [at] ee [dot] uwa.edu.au, podc-post [at] bellcore [dot] com,
        reliable_computing [at] interval [dot] usl.edu, sb.all [at] ieee [dot] org,
        seminars [at] cs [dot] anu.edu.au, seworld [at] cs [dot] colorado.edu,
        softwarequalitaet@uni-koeln.de, zahirt [at] goanna [dot] cs.rmit.edu.au
Subject: CFP - Distributed Objects and Applications Symposium
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk



                              C A L L   F O R   P A P E R S
                              =============================
___   __   __     __  __
 | | |  | |  | / |  ||  |      International Symposium on
 | | |  | |--|   |  ||  |  DISTRIBUTED OBJECTS AND APPLICATIONS
_|_| |__| |  |   |__||__| Antwerp, Belgium, September 21-23, 2000

                     http://www.cs.rmit.edu.au/conf/doa/2000/


  Are you building applications using distributed objects (DO)?
  Are you doing research in fundamental technology, methodology 
    or new tools for DO?
  Are you using some of the existing distributed object systems?
  
  Consider contributing a practice report or a research paper to this
  innovative event, and to present, discuss and obtain feedback for your
  ideas among other practitioners and researchers active in the same area.
  
  During DOA'2000 Symposium we want attendees to be able to evaluate
  existing ORB middleware products; to analyze, and propose solutions
  to major limitations of existing products; and to indicate promising
  future research directions for distributed objects. We are particularly
  interested in the evaluation of existing distributed object systems
  and how they are used to design and to implement large scale industrial
  distributed applications. We are seeking theoretical as well as
  practical papers addressing innovative issues related to distributed
  objects.


TOPICS OF INTEREST

  Distributed and mobile agents. Design patterns for distributed object
  design. Database services, in particular persistency, transaction, query. 
  and replication services. Integration of distributed object and Web
  technologies. Integration with database systems and interfaces. Methodologies
  to develop distributed object applications. Reintegration of legacy systems
  in DO environments . Design of CORBA, COM- and Java-based broker applications.
  Multimedia distributed objects. Multicast protocols for distributed objects. 
  Object caching. Reliability, fault-tolerance and recovery. Real-time ORB
  middleware. Reports on Best Practice. Security. Specification and enforcement
  of quality of service. Standardization of distributed objects. ...


IMPORTANT DATES
     Electronic submission:        May 1st, 2000
     Notification of acceptance:   June 10th, 2000
     Camera-ready copies:          June 30th, 2000
     Symposium:                    September 21-23, 2000

SUBMISSIONS

     All submissions must be in English. Research submissions must not exceed
     8,000 words. Practice reports must not exceed 5,000 words.  Submissions can
     either be in Postscript or HTML format and should be sent to
     Zahir Tari at zahirt [at] cs [dot] rmit.edu.au. 
	
     More details about submissions can be found at
       
          http://www.cs.rmit.edu.au/conf/doa/2000/cfp.html


ORGANISATION COMMITTEE

  Liselore Berghman (UFSIA, Belgium), Pranab Baruah (Boeing, USA), Pamela Drew
  (Boeing, USA), Robert Meersman (VUB, Belgium), Zahir Tari (RMIT, Australia)
  Roberto Zicari (JWGU, Germany),  Liz Ungar (Boeing, USA)


PROGRAM COMMITTEE

  Gustavo Alonso (ETH, Zurich). Bill Appelbe (RMIT, Australia). Sean Baker (IONA, Ireland)
  Carlos De Backer (University of Antwerp, Belgium). Jose Blakeley (Microsoft, USA). 
  Gordon Blair (Lancaster University, UK). Anthony Bloesch (Visio Corp., USA). 
  Omran Bukhres (Purdue University, USA).  Akmal B. Chaudhri (Computer Associates, UK). 
  Asuman Dogac (Middle East Technical University, Turkey).  Chris Gokey (NASA, USA). 
  Rachid Guerraoui (EPFL, Switzerland). Arno Jacobsen (Humboldt University, Germany). 
  Dimitris Karagiannis (University of Vienna and B.O.C. GmbH, Austria). 
  Roger King (University of Colorado, USA).  Sacha Krakowiak (University of Grenoble, 
  France). Bernd Kramer (FernUniversitat Hagen, Germany).  Hong Va Leong 
  (Hong Kong Polytechnic University, China).  Ling Liu (Oregon Graduate Institute, USA). 
  Frank Manola (USA). Sophie Monties (EPFL, Switzerland). Jishnu Mukerji
  (HP New Jersey Labs, USA). Tom Northcutt (NASA, USA). Kunio Ohno (INS Engineering
  Corporation, Japan). Tamer Ozsu (University of Alberta, Canada). Mike P. Papazoglou
  (Tilburg University, The Netherlands). Kerry Raymond (DSTC, Australia). Arnie
  Rosenthal (Mitre, USA). Richard Soley (OMG, USA). Marc H. Scholl
  (Universitat Konstanz, Germany). Jean-Bernard Stefani (France Telecom, France). 
  Doug Schmidt (Washington Univ. at St. Louis, USA). Makoto Takizawa 
  (Tokyo Denki University, Japan). Hakki Toroslu (Middle East Technical University,
  Turkey). Yu-Chee Tseng (National Central University, Taiwan). 
  Wilfried Verachtert (MediaGenix, Belgium).  Andreas Vogel (In Prise, USA). 
  Guijun Wang (Boeing, USA).  Andrew Watson (OMG, USA).  Albert Zamoya (UWA, Australia). 


From owner-reliable_computing [at] interval [dot] usl.edu  Fri Apr 28 10:04:59 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA19549
	for reliable_computing-outgoing; Fri, 28 Apr 2000 10:04:59 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA19445
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 28 Apr 2000 10:04:52 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.10.1/8.10.1) with SMTP id e3SF4jt13690;
	Fri, 28 Apr 2000 09:04:46 -0600 (MDT)
Message-Id: <200004281504.e3SF4jt13690 [at] cs [dot] utep.edu>
Date: Fri, 28 Apr 2000 09:04:45 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: my alias will stop working soon
To: reliable_computing [at] interval [dot] louisiana.edu
Cc: interval [at] cs [dot] utep.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: AfoOxScSY8hwSsf5Vi2jAw==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear Friends, 

* My regular email is vladik [at] cs [dot] utep.edu, it works now and it will 
  (hopefully) work still, but 
* my alias vladik [at] utep [dot] edu (without cs) will stop working in a few days
  due to a change in server. 

Sorry for the invonvenience.

Vladik


From owner-reliable_computing [at] interval [dot] usl.edu  Mon May  1 03:16:12 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id DAA00541
	for reliable_computing-outgoing; Mon, 1 May 2000 03:16:12 -0500 (CDT)
Received: from unknown (ip248.atlanta14.ga.pub-ip.psi.net [38.30.162.248])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with SMTP id DAA00527;
	Mon, 1 May 2000 03:16:03 -0500 (CDT)
From: bench1 [at] hotpop [dot] com
Subject: your imaging supplies
Date: Mon, 1 May 2000 12:34:46
Message-Id: <221.353869.171555@>
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk






BENCHMARK SUPPLY
5334 LAKE VIEW CLUB
ATLANTA GA 30338

***LASER PRINTER TONER CARTRIDGES***
***FAX AND COPIER TONER***
 
WE ACCEPT GOVERNMENT, SCHOOL & UNIVERSITY PURCHASE ORDERS
JUST LEAVE YOUR PO # WITH CORRECT BILLING & SHIPPING ADDRESS

   CHECK OUT OUR NEW CARTRIDGE PRICES :
 

APPLE 
 
  LASER WRITER  PRO 600 OR 16/600         $69
  LASER WRITER SELECT 300,310.360         $69
  LASER WRITER 300, 320                   $54 
  LASER WRITER LS,NT,2NTX,2F,2G & 2SC     $54 
  LASER WRITER 12/640                     $79 

HEWLETT PACKARD 

  LASERJET SERIES 2,3 & 3D (95A)          $49 
  LASERJET SERIES  2P AND 3P (75A)        $54 
  LASERJET SERIES 3SI AND 4SI (91A)       $75 
  LASERJET SERIES 4L AND 4P               $49 
  LASERJET SERIES 4, 4M, 5, 5M, 4+ (98A)  $59 
  LASERJET SERIES 4000 HIGH YIELD  (27X)  $99 
  LASERJET SERIES 4V                      $95 
  LASERJET SERIES 5SI , 8000              $95 
  LASERJET SERIES 5L AND 6L               $49 
  LASERJET SERIES 5P, 5MP, 6P, 6MP        $59 
  LASERJET SERIES 5000 (29A)             $135
  LASERJET SERIES 1100 (92A)              $49 
  LASERJET SERIES 2100 (96A)              $84
  LASERJET SERIES 8100 (82X)		 $145


HP LASERFAX 

  LASERFAX 500, 700, FX1,                 $59 
  LASERFAX 5000, 7000, FX2,               $59 
  LASERFAX  FX3                           $69 
  LASERFAX  FX4                           $79 
 

LEXMARK 

  OPTRA  4019, 4029  HIGH YIELD          $135 
  OPTRA R, 4039, 4049 HIGH YIELD         $135 
  OPTRA S 4059 HIGH YIELD                $135 
  OPTRA E                                 $59 
  OPTRA  N                               $115 
 

EPSON 

  EPL-7000, 8000                         $105 
  EPL-1000, 1500                         $105 
 

CANON 

  LBP-430                                 $49 
  LBP-460, 465                            $59 
  LBP-8 II                                $54 
  LBP-LX                                  $54 
  LBP-MX                                  $95 
  LBP-AX                                  $49 
  LBP-EX                                  $59 
  LBP-SX                                  $49 
  LBP-BX                                  $95 
  LBP-PX                                  $49 
  LBP-WX                                  $95 
  LBP-VX                                  $59 
  CANON FAX L700 THRU L790 FX1            $59 
  CANONFAX L5000 L70000  FX2              $59 
 

CANON COPIERS 

  PC 20, 25 ETC....                       $89 
  PC 3, 6RE, 7, 11  (A30)                 $69 
  PC 320 THRU 780  (E40)                  $89 
 

NEC 

  SERIES 2 LASER MODEL 90,95             $105


PLEASE NOTE:

1) ALL OUR CARTRIDGES ARE GENUINE OEM CARTRIDGES.
2) WE DO NOT SEND OUT CATALOGS OR PRICE LISTS 
3) WE DO NOT FAX QUOTES OR PRICE LISTS.  
4) WE DO NOT SELL TO RESELLERS OR BUY FROM DISTRIBUTERS
5) WE DO NOT CARRY: BROTHER-MINOLTA-KYOSERA-PANASONIC PRODUCTS
6) WE DO NOT CARRY: XEROX-FUJITSU-OKIDATA OR SHARP PRODUCTS
7) WE DO NOT CARRY ANY COLOR PRINTER SUPPLIES    
8) WE DO NOT CARRY DESKJET/INKJET OR BUBBLEJET SUPPLIES
9) WE DO NOT BUY FROM OR SELL TO RECYCLERS OR REMANUFACTURERS



               

****OUR  ORDER LINE IS 770-399-0953 ****

****OUR CUSTOMER SERVICE  LINE IS 800-586-0540****
****OUR E-MAIL REMOVAL AND COMPLAINT LINE IS 888-494-8597****

****PLACE YOUR ORDER AS FOLLOWS**** :

BY PHONE   770-399-0953 

BY FAX:    770-698-9700 
BY MAIL:   BENCHMARK PRINT SUPPLY
           7540 BRIDGEGATE COURT
,          ATLANTA GA 30350

MAKE SURE YOU INCLUDE THE FOLLOWING INFORMATION IN YOUR ORDER: 

             1)  YOUR PHONE NUMBER 
             2)  COMPANY NAME 
             3)  SHIPPING ADDRESS 
             4)  YOUR NAME 
             5)  ITEMS NEEDED WITH QUANTITIES 
             6)  METHOD OF PAYMENT. (COD OR CREDIT CARD) 
             7)  CREDIT CARD NUMBER WITH EXPIRATION DATE 

 
1) WE SHIP UPS GROUND. ADD $4.5 FOR SHIPPING AND HANDLING.
2) COD CHECK ORDERS ADD $3.5 TO YOUR SHIPPING COST.
2) WE ACCEPT ALL MAJOR CREDIT CARD OR "COD" ORDERS.
3) OUR STANDARD MERCHANDISE REFUND POLICY IS NET 30 DAYS
4) OUR STANDARD MERCHANDISE REPLCAMENT POLICY IS NET 90 DAYS. 


NOTE NUMBER (1): 

PLEASE DO NOT CALL OUR ORDER LINE TO REMOVE YOUR E-MAIL 
ADDRESS OR COMPLAIN. OUR ORDER LINE IS NOT SETUP TO FORWARD 
YOUR E-MAIL ADDRESS REMOVAL REQUESTS OR PROCESS YOUR 
COMPLAINTS..IT WOULD BE A WASTED PHONE CALL.YOUR ADDRESS 
WOULD NOT BE REMOVED AND YOUR COMPLAINTS WOULD NOT BE 
HANDLED.PLEASE CALL OUR TOLL FREE E-MAIL REMOVAL AND 
COMPLAINT LINE TO DO THAT.

NOTE NUMBER (2):

OUR E-MAIL RETURN ADDRESS IS NOT SETUP TO ANSWER ANY 
QUESTIONS YOU MIGHT HAVE REGARDING OUR PRODUCTS. OUR E-MAIL 
RETURN ADDRESS IS ALSO NOT SETUP TO TAKE ANY ORDERS AT 
THIS TIME. PLEASE CALL THE ORDER LINE TO PLACE YOUR ORDER
 OR HAVE ANY QUESTIONS ANSWERED. OTHERWISE PLEASE CALL OUR 
CUSTOMER SERCICE LINE.







 
 
 
 
 
 

From owner-reliable_computing [at] interval [dot] usl.edu  Mon May  1 07:08:40 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id HAA01959
	for reliable_computing-outgoing; Mon, 1 May 2000 07:08:40 -0500 (CDT)
Received: from marnier.ucs.usl.edu (root@ucs-gw.usl.edu [130.70.40.2])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id HAA01954
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 1 May 2000 07:08:37 -0500 (CDT)
Received: from liberty (liberty.usl.edu [130.70.46.171])
	by marnier.ucs.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.3) with SMTP id HAA01741;
	Mon, 1 May 2000 07:08:24 -0500 (CDT)
Message-Id: <2.2.32.20000501120945.012d0798 [at] pop [dot] usl.edu>
X-Sender: rbk5287 [at] pop [dot] usl.edu
X-Mailer: Windows Eudora Pro Version 2.2 (32)
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Date: Mon, 01 May 2000 07:09:45 -0500
To: bench1 [at] hotpop [dot] com, reliable_computing [at] interval [dot] louisiana.edu
From: "R. Baker Kearfott" <rbk [at] louisiana [dot] edu>
Subject: Re: spam
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Colleagues,

I recommend you not do business with these people.  They have not
honored repeated requests to remove the "reliable_computing" address
from their list, despite my following their outlined procedure.

Sincerely,

R. Baker Kearfott

At 12:34 PM 5/1/00, you wrote:

>BENCHMARK SUPPLY
>5334 LAKE VIEW CLUB
>ATLANTA GA 30338
>
>***LASER PRINTER TONER CARTRIDGES***
>***FAX AND COPIER TONER***
> 
>WE ACCEPT GOVERNMENT, SCHOOL & UNIVERSITY PURCHASE ORDERS
>JUST LEAVE YOUR PO # WITH CORRECT BILLING & SHIPPING ADDRESS
>
>   CHECK OUT OUR NEW CARTRIDGE PRICES :
> 
>
>APPLE 
> 
>  LASER WRITER  PRO 600 OR 16/600         $69
>  LASER WRITER SELECT 300,310.360         $69
>  LASER WRITER 300, 320                   $54 
>  LASER WRITER LS,NT,2NTX,2F,2G & 2SC     $54 
>  LASER WRITER 12/640                     $79 
>
>HEWLETT PACKARD 
>
>  LASERJET SERIES 2,3 & 3D (95A)          $49 
>  LASERJET SERIES  2P AND 3P (75A)        $54 
>  LASERJET SERIES 3SI AND 4SI (91A)       $75 
>  LASERJET SERIES 4L AND 4P               $49 
>  LASERJET SERIES 4, 4M, 5, 5M, 4+ (98A)  $59 
>  LASERJET SERIES 4000 HIGH YIELD  (27X)  $99 
>  LASERJET SERIES 4V                      $95 
>  LASERJET SERIES 5SI , 8000              $95 
>  LASERJET SERIES 5L AND 6L               $49 
>  LASERJET SERIES 5P, 5MP, 6P, 6MP        $59 
>  LASERJET SERIES 5000 (29A)             $135
>  LASERJET SERIES 1100 (92A)              $49 
>  LASERJET SERIES 2100 (96A)              $84
>  LASERJET SERIES 8100 (82X)		 $145
>
>
>HP LASERFAX 
>
>  LASERFAX 500, 700, FX1,                 $59 
>  LASERFAX 5000, 7000, FX2,               $59 
>  LASERFAX  FX3                           $69 
>  LASERFAX  FX4                           $79 
> 
>
>LEXMARK 
>
>  OPTRA  4019, 4029  HIGH YIELD          $135 
>  OPTRA R, 4039, 4049 HIGH YIELD         $135 
>  OPTRA S 4059 HIGH YIELD                $135 
>  OPTRA E                                 $59 
>  OPTRA  N                               $115 
> 
>
>EPSON 
>
>  EPL-7000, 8000                         $105 
>  EPL-1000, 1500                         $105 
> 
>
>CANON 
>
>  LBP-430                                 $49 
>  LBP-460, 465                            $59 
>  LBP-8 II                                $54 
>  LBP-LX                                  $54 
>  LBP-MX                                  $95 
>  LBP-AX                                  $49 
>  LBP-EX                                  $59 
>  LBP-SX                                  $49 
>  LBP-BX                                  $95 
>  LBP-PX                                  $49 
>  LBP-WX                                  $95 
>  LBP-VX                                  $59 
>  CANON FAX L700 THRU L790 FX1            $59 
>  CANONFAX L5000 L70000  FX2              $59 
> 
>
>CANON COPIERS 
>
>  PC 20, 25 ETC....                       $89 
>  PC 3, 6RE, 7, 11  (A30)                 $69 
>  PC 320 THRU 780  (E40)                  $89 
> 
>
>NEC 
>
>  SERIES 2 LASER MODEL 90,95             $105
>
>
>PLEASE NOTE:
>
>1) ALL OUR CARTRIDGES ARE GENUINE OEM CARTRIDGES.
>2) WE DO NOT SEND OUT CATALOGS OR PRICE LISTS 
>3) WE DO NOT FAX QUOTES OR PRICE LISTS.  
>4) WE DO NOT SELL TO RESELLERS OR BUY FROM DISTRIBUTERS
>5) WE DO NOT CARRY: BROTHER-MINOLTA-KYOSERA-PANASONIC PRODUCTS
>6) WE DO NOT CARRY: XEROX-FUJITSU-OKIDATA OR SHARP PRODUCTS
>7) WE DO NOT CARRY ANY COLOR PRINTER SUPPLIES    
>8) WE DO NOT CARRY DESKJET/INKJET OR BUBBLEJET SUPPLIES
>9) WE DO NOT BUY FROM OR SELL TO RECYCLERS OR REMANUFACTURERS
>
>
>
>               
>
>****OUR  ORDER LINE IS 770-399-0953 ****
>
>****OUR CUSTOMER SERVICE  LINE IS 800-586-0540****
>****OUR E-MAIL REMOVAL AND COMPLAINT LINE IS 888-494-8597****
>
>****PLACE YOUR ORDER AS FOLLOWS**** :
>
>BY PHONE   770-399-0953 
>
>BY FAX:    770-698-9700 
>BY MAIL:   BENCHMARK PRINT SUPPLY
>           7540 BRIDGEGATE COURT
>,          ATLANTA GA 30350
>
>MAKE SURE YOU INCLUDE THE FOLLOWING INFORMATION IN YOUR ORDER: 
>
>             1)  YOUR PHONE NUMBER 
>             2)  COMPANY NAME 
>             3)  SHIPPING ADDRESS 
>             4)  YOUR NAME 
>             5)  ITEMS NEEDED WITH QUANTITIES 
>             6)  METHOD OF PAYMENT. (COD OR CREDIT CARD) 
>             7)  CREDIT CARD NUMBER WITH EXPIRATION DATE 
>
> 
>1) WE SHIP UPS GROUND. ADD $4.5 FOR SHIPPING AND HANDLING.
>2) COD CHECK ORDERS ADD $3.5 TO YOUR SHIPPING COST.
>2) WE ACCEPT ALL MAJOR CREDIT CARD OR "COD" ORDERS.
>3) OUR STANDARD MERCHANDISE REFUND POLICY IS NET 30 DAYS
>4) OUR STANDARD MERCHANDISE REPLCAMENT POLICY IS NET 90 DAYS. 
>
>
>NOTE NUMBER (1): 
>
>PLEASE DO NOT CALL OUR ORDER LINE TO REMOVE YOUR E-MAIL 
>ADDRESS OR COMPLAIN. OUR ORDER LINE IS NOT SETUP TO FORWARD 
>YOUR E-MAIL ADDRESS REMOVAL REQUESTS OR PROCESS YOUR 
>COMPLAINTS..IT WOULD BE A WASTED PHONE CALL.YOUR ADDRESS 
>WOULD NOT BE REMOVED AND YOUR COMPLAINTS WOULD NOT BE 
>HANDLED.PLEASE CALL OUR TOLL FREE E-MAIL REMOVAL AND 
>COMPLAINT LINE TO DO THAT.
>
>NOTE NUMBER (2):
>
>OUR E-MAIL RETURN ADDRESS IS NOT SETUP TO ANSWER ANY 
>QUESTIONS YOU MIGHT HAVE REGARDING OUR PRODUCTS. OUR E-MAIL 
>RETURN ADDRESS IS ALSO NOT SETUP TO TAKE ANY ORDERS AT 
>THIS TIME. PLEASE CALL THE ORDER LINE TO PLACE YOUR ORDER
> OR HAVE ANY QUESTIONS ANSWERED. OTHERWISE PLEASE CALL OUR 
>CUSTOMER SERCICE LINE.
>
>
>
>
>
>
>
> 
> 
> 
> 
> 
> 
>
>
---------------------------------------------------------------
R. Baker Kearfott,    rbk [at] louisiana [dot] edu   (337) 482-5346 (fax)
(337) 482-5270 (work)                     (337) 981-9744 (home)
URL: http://interval.louisiana.edu/kearfott.html
Department of Mathematics, University of Louisiana at Lafayette
Box 4-1010, Lafayette, LA 70504-1010, USA
---------------------------------------------------------------


From owner-reliable_computing [at] interval [dot] usl.edu  Mon May  1 07:46:06 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id HAA02365
	for reliable_computing-outgoing; Mon, 1 May 2000 07:46:05 -0500 (CDT)
Received: from zmit1.ippt.gov.pl (zmit1.ippt.gov.pl [148.81.53.8])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id HAA02360
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 1 May 2000 07:46:02 -0500 (CDT)
Received: (from zkulpa@localhost) by zmit1.ippt.gov.pl (8.8.5/8.7.3-zmit) id OAA04023 for reliable_computing [at] interval [dot] louisiana.edu; Mon, 1 May 2000 14:45:25 +0200 (MET DST)
Date: Mon, 1 May 2000 14:45:25 +0200 (MET DST)
From: Zenon Kulpa <zkulpa [at] zmit1 [dot] ippt.gov.pl>
Message-Id: <200005011245.OAA04023 [at] zmit1 [dot] ippt.gov.pl>
To: reliable_computing [at] interval [dot] louisiana.edu
Subject: Re: spam
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

> From owner-reliable_computing [at] interval [dot] usl.edu Mon May  1 14:08:39 2000
> From: "R. Baker Kearfott" <rbk [at] louisiana [dot] edu>
> 
> I recommend you not do business with these people.  They have not
> honored repeated requests to remove the "reliable_computing" address
> from their list, despite my following their outlined procedure.
> 
I second that suggestion. They were sending their messages to my private
address too - and I cannot use their "removal line" from Poland...
Hence, if they will persist, I will be forced to figure a way 
to become a real nuisance to them through the Internet...

-- Zenon Kulpa



> >BENCHMARK SUPPLY
> >5334 LAKE VIEW CLUB
> >ATLANTA GA 30338
[...]
> 
> >****OUR  ORDER LINE IS 770-399-0953 ****
> >
> >****OUR CUSTOMER SERVICE  LINE IS 800-586-0540****
> >****OUR E-MAIL REMOVAL AND COMPLAINT LINE IS 888-494-8597****
> >
> >****PLACE YOUR ORDER AS FOLLOWS**** :
> >
> >BY PHONE   770-399-0953 
> >
> >BY FAX:    770-698-9700 
> >BY MAIL:   BENCHMARK PRINT SUPPLY
> >           7540 BRIDGEGATE COURT
> >,          ATLANTA GA 30350
[...]> >
> >NOTE NUMBER (1): 
> >
> >PLEASE DO NOT CALL OUR ORDER LINE TO REMOVE YOUR E-MAIL 
> >ADDRESS OR COMPLAIN. OUR ORDER LINE IS NOT SETUP TO FORWARD 
> >YOUR E-MAIL ADDRESS REMOVAL REQUESTS OR PROCESS YOUR 
> >COMPLAINTS..IT WOULD BE A WASTED PHONE CALL.YOUR ADDRESS 
> >WOULD NOT BE REMOVED AND YOUR COMPLAINTS WOULD NOT BE 
> >HANDLED.PLEASE CALL OUR TOLL FREE E-MAIL REMOVAL AND 
> >COMPLAINT LINE TO DO THAT.
> >
> >NOTE NUMBER (2):
> >
> >OUR E-MAIL RETURN ADDRESS IS NOT SETUP TO ANSWER ANY 
> >QUESTIONS YOU MIGHT HAVE REGARDING OUR PRODUCTS. OUR E-MAIL 
> >RETURN ADDRESS IS ALSO NOT SETUP TO TAKE ANY ORDERS AT 
> >THIS TIME. PLEASE CALL THE ORDER LINE TO PLACE YOUR ORDER
> > OR HAVE ANY QUESTIONS ANSWERED. OTHERWISE PLEASE CALL OUR 
> >CUSTOMER SERCICE LINE.
> >

From owner-reliable_computing [at] interval [dot] usl.edu  Wed May  3 09:18:24 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id JAA06346
	for reliable_computing-outgoing; Wed, 3 May 2000 09:18:23 -0500 (CDT)
Received: from marnier.ucs.usl.edu (root@ucs-gw.usl.edu [130.70.40.2])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id JAA06341
	for <reliable_computing [at] interval [dot] louisiana.edu>; Wed, 3 May 2000 09:18:19 -0500 (CDT)
Received: from u8174 (rbk5287 [at] goedel [dot] usl.edu [130.70.49.203])
	by marnier.ucs.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.3) with SMTP id JAA05466
	for <reliable_computing [at] interval [dot] louisiana.edu>; Wed, 3 May 2000 09:18:11 -0500 (CDT)
Message-Id: <2.2.32.20000503141723.00748458 [at] pop [dot] usl.edu>
X-Sender: rbk5287 [at] pop [dot] usl.edu
X-Mailer: Windows Eudora Pro Version 2.2 (32)
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Date: Wed, 03 May 2000 09:17:23 -0500
To: reliable_computing [at] interval [dot] louisiana.edu
From: "R. Baker Kearfott" <rbk [at] louisiana [dot] edu>
Subject: Clarification -- "spam"
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Colleagues,

I apologize if I may have offended anyone concerning my "recommendation"
about the agressive email advertiser.  In all fairness, the
"reliable_computing.usl.edu" address may have been removed, possibly
to be found again when we changed it to "reliable_computing.louisiana.edu"
In other words, the advertiser, although agressive in mailing ad's
unsolicited to a huge number of addresses, may have acted in good 
faith in trying to remove the address.  I hadn't thought of that when
I sent my thoughts yesterday.

I repeat, I do not wish to inhibit genuine interest and discussion
on this list.  Also, I'm preparing to send a little "ad" concerning
the next version of GlobSol.... stay tuned :-)

Sincerely,

R. Baker Kearfott
---------------------------------------------------------------
R. Baker Kearfott,    rbk [at] louisiana [dot] edu   (337) 482-5346 (fax)
(337) 482-5270 (work)                     (337) 981-9744 (home)
URL: http://interval.louisiana.edu/kearfott.html
Department of Mathematics, University of Louisiana at Lafayette
Box 4-1010, Lafayette, LA 70504-1010, USA
---------------------------------------------------------------


From owner-reliable_computing [at] interval [dot] usl.edu  Thu May  4 11:59:50 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id LAA08951
	for reliable_computing-outgoing; Thu, 4 May 2000 11:59:50 -0500 (CDT)
Received: from marnier.ucs.usl.edu (root@ucs-gw.usl.edu [130.70.40.2])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id LAA08946
	for <reliable_computing [at] interval [dot] louisiana.edu>; Thu, 4 May 2000 11:59:47 -0500 (CDT)
Received: from liberty (liberty.usl.edu [130.70.46.171])
	by marnier.ucs.usl.edu (8.9.1/8.9.1/ucs-server-melissa_1.3) with SMTP id LAA23379
	for <reliable_computing [at] interval [dot] louisiana.edu>; Thu, 4 May 2000 11:59:41 -0500 (CDT)
Message-Id: <2.2.32.20000504170111.012ec6ec [at] pop [dot] usl.edu>
X-Sender: rbk5287 [at] pop [dot] usl.edu
X-Mailer: Windows Eudora Pro Version 2.2 (32)
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Date: Thu, 04 May 2000 12:01:11 -0500
To: reliable_computing [at] interval [dot] louisiana.edu
From: "R. Baker Kearfott" <rbk [at] usl [dot] edu>
Subject: New version of GlobSol posted
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Colleagues,

I have just uploaded a new version of GlobSol.  I have run my integration
tests on five machine-compiler-make utility combinations, except I have
not run the tests with the NAG compiler on Sun machines.  (If someone
cares to do this, I would be grateful for the output, that I can
peruse.  Also, if someone cares to try it on a machine I haven't listed
on the download page, I would be grateful to receive copies of the 
modified makefile, etc.)  

I remind you that GlobSol may be obtained from

http://interval.louisiana.edu/GlobSol/download_GlobSol.html

I append the portion of the release notes dealing with the new version.

Best regards,

Baker

=========================================================================
May 2, 2000  --    Differences between the version dated
                   Dec. 7 and the version dated May 2:

1.  Generally, installation use of GlobSol have been further
    simplified.

    (a)  For Unix systems, the "unpack" macros now
         automatically change the root directory for GlobSol to
         the directory in which the macros are being run.

    (b)  The read.me file has been changed to install.html

    (c)  A script (or, a batch file on MS-based systems) "globsol"
         (or globsol.bat) now runs GlobSol's optimizer more
         nearly automatically.  (Thank you, George Corliss, for
         providing this, and also for making various other
         suggestions leading to changes in this version.) This
         script has significant user input checking on unix
         systems.

2.  A bug dealing with bound constraints has been fixed.

         The error was in listops/cmpldopt.f90, the routine
         that takes the complement of a box in another box. THe
         problem was that a box corresponding to a boundary was
         deleted as part of the complement of an interior box
         that is being put on the list. The interior box was
         later rejected as not containing critical points.
         Now, when the complementation of a box in a list is
         taken, only those members of the list with the same
         boundary status as the original box are possibly
         altered. Thank you, Uri Zwick, for your interest and
         diligence.

3.  Versions of unpack, makefile, etc. are now provided for SGI
    with the MIPS compiler.  (These versions are very close to
    other unix-based versions.)

4.  Additional technical changes:

    (a)  Changed a "slope" utility routine so that portions of
         the Fritz-John matrix now are computed using slope
         arithmetic. This had earlier been disabled during a
         search for a bug.

    (b)  Changed the default way the code list creation process
         writes the code list files, to better interface with
         the script globsol.

    (c)  Changed the *.f90 files in the integration_test_data
         directory so they no longer contain the line
         "CODELIST_FILE_NAME = ..."  The default when running
         the "globsol" script is not to make the code list file
         name equal to the name of the *.f90 file.

    (d)  f90intbi/rigorous_global_search.f90 now purges the
         output lists immediately before returning, to catch
         certain boxes that were not caught before.

    (e)  A configuration file variable WANT_TABLE now exists.
         This switch turns on and off production of
         OPTTEST.TBL, a table giving data from multiple runs of
         GlobSol; the data is in a form that can be imported
         into spreadsheets.

    (f)  Made a minor change to random_GN.f90 so it closes unit
         10 after it opens it.
=========================================================================

---------------------------------------------------------------
R. Baker Kearfott,    rbk [at] louisiana [dot] edu   (337) 482-5346 (fax)
(337) 482-5270 (work)                     (337) 981-9744 (home)
URL: http://interval.louisiana.edu/kearfott.html
Department of Mathematics, University of Louisiana at Lafayette
Box 4-1010, Lafayette, LA 70504-1010, USA
---------------------------------------------------------------


From owner-reliable_computing [at] interval [dot] usl.edu  Sat May  6 13:51:17 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id NAA12590
	for reliable_computing-outgoing; Sat, 6 May 2000 13:51:17 -0500 (CDT)
Received: from cse.unl.edu (root [at] cse [dot] unl.edu [129.93.33.1])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id NAA12585
	for <reliable_computing [at] interval [dot] usl.edu>; Sat, 6 May 2000 13:51:14 -0500 (CDT)
Received: from localhost (fayad@localhost)
	by cse.unl.edu (8.9.1/8.9.1) with ESMTP id NAA9072316;
	Sat, 6 May 2000 13:29:27 -0500 (CDT)
Date: Sat, 6 May 2000 13:29:27 -0500
From: Mohamed Fayad <fayad [at] cse [dot] unl.edu>
To: Undisclosed recipients: ;
Subject: CFCs for S/W Arch., Components, and Frameworks
Message-ID: <Pine.SGI.4.05.10005061328120.8726268-100000 [at] cse [dot] unl.edu>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk




Greetings,

Apologies if you recieve multitple copies of this cfcs.  Enclosed, please
find a call for chapters and reviewers.  Please post. Thank you.

Cheers,

M. Fayad

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

3-volume book on
Software Architectures, Components, and Frameworks
Call for Chapters and Reviewers

Authors and Editors:

Dr. Mohamed Fayad: fayad [at] cse [dot] unl.edu, m.fayad [at] computer [dot] org,
fayadm [at] acm [dot] org, 
URL: http://www.cse.unl.edu/~fayad	

Dr. David Garlan: garlan [at] cs [dot] cmu.edu
URL: http://www.cs.cmu.edu/~garlan      
      
Professor Wolfgang Pree: pree [at] acm [dot] org
URL: www.informatik.uni-konstanz.de/swe

We are developing three-volume series of books on software architectures,
components, and frameworks. If this is your area of interest/research, I
would like to invite you to submit a chapter.  This series of books will
serve as a complete reference set for academics and practitioners. 

Volume 1: Software Architectures

The working title of the first-volume is "Software Architectures."
Architecture-based software engineering research has yielded an impressive
array of technologies and demonstrations over the past decade. Using an
architecture-based approach, applications have been built which:
- Are understandable
- Are expected to evolve
- Exhibit remarkable flexibility
- Demonstrate significant reuse of off-the-shelf components
- Leverage experience from related applications in the same problem
  domain
- Are analyzable earlier in their development than ever before
- Are key milestones in software managerial and development
  processes

Currently, there is relatively little guidance for software developers on
how to develop software architectures.  This volume addresses several
topics crucial to the state of the art and practice of software
architecture.  The book presents a complete reference on how to develop a
good software architecture and provides guidelines for resolving key
software architecture issues, such as evolving software architectures,
leveraging existing investment in software architecture artifacts,
representing architecture description languages, introducing formal models
for software architectures, addressing architectural analysis techniques &
development methods, transitioning from software architecture to coding
and surveying architectural design tools and environments. 

In addition, the book will include sections on: accessing of software
architectures, testing and validating software architectures, improving
software architecture quality, documenting software architectures, and
many more.
 
This is a pragmatic book that is specifically designed to help
organizations develop software architectures for real projects in the real
world. Comprehensive technical and management guidelines are thoroughly
discussed, ranging from specifying software architecture elements and
their behaviors, to the impact of software architecture on the job.
Likewise, technical issues (such as documenting and utilizing software
architectures) are discussed in detail.  

Volume 2: Product-Line Architectures 

The working title of the second-volume is "Product-Line Architectures".
Software product lines are emerging as a new and important software
development paradigm. A Product-Line Architecture (PLA) is a design for a
family of related applications, and its motivation is to simplify the
design and maintenance of program families and to address the needs of
highly customizable applications in an economical manner. Companies are
realizing that the practice of building sets of related systems from
common assets can yield remarkable improvements in productivity, time to
market, product quality and customer satisfaction. But these gains are
only a part of the picture; organizational, technical and management
issues are other factors that should be considered. Although there are
encouraging research experiences with PLAs and some guidelines exist to
help in the development process, some issues about component-based
development in PLAs are still under study.  The goal of this book is to
examine the foundational concepts underlying product lines and address the
essential activities developers should consider to apply a PLA to a number
of lines of products.

The book will include sections on: lessons learned in PLA-based
development, architectural specification, tools and process for software
development, core asset management, domain analysis, configuration
management, evaluation methods, quality factors involved, implementation
strategies, and many more.

Volume 3: Component-Based Software Developments & Enterprise Frameworks

The working title of the third-volume is "Component-Based Software
Development and Enterprise
Frameworks". Nowadays, software engineering is moving forward on an
architecture-based development conception where systems are built by
composing or assembling components that are often developed independently.
The key to making a large variety of software products and reducing time
to market is to build pieces of software where the development effort can
serve in other products as well.  Thus, large-grained components are
becoming a practical part of an enterprise component strategy.  Such
generic components usually include interactions with other components,
code, design models, design patterns and specifications. In addition, they
must provide ways to be adaptable and customizable according with the
client's needs.  In this context, enterprise frameworks offer an
appropriate base for waving the software architectures, components, and
core requirements into one container that is adaptable, customizable,
extensible, and reusable.

The technology of component-based systems is quite well established, but
it is not the same with the methods to develop them.  The need of
well-defined techniques, notations and architectural support is still
pending. The book will cover all these issues.

This book is intended to provide valuable, real world insight into
successful development and/or adaptation of OO Enterprise Frameworks, by
describing the problems with frameworks, explaining the issues related to
the development and adaptation of enterprise frameworks, selecting the
right methods and tools for building frameworks.  The book will be derived
from actual experiences, successes and failures, and is presented in a
practical, easy to understand manner.  This is information that readers
can apply today.  The key issues are:
+ What are the key enterprise-oriented framework issues?
+ How to develop enterprise frameworks and what are the framework
  design guidelines?
+ What kind of evolution does an Enterprise Framework undergo and
  how is it correlated with the enterprise life span?
+ How can the adaptation of OO enterprise framework be accomplished
  with minimum impact on the cost and schedule?
+ Understand make vs. buy decisions, selection guidelines, and how
  to select and adapt the right enterprise framework for the job.
+ Understand the implication of enterprise business requirements on
  the framework design.
+ How to use your large-scale enterprise framework and how to
  protect your investment.
+ How to deal with resource requirements, enterprise framework
  integration problems, framework reporting, and others.
+ What are the impacts of enterprise frameworks on the national and
  global economy?

This volume helps organizations apply component-based technology
effectively by citing examples from the real world.  This book combines
the actual experiences and lessons learned from developing and/or adapting
component-based enterprise framework developments.

Reviewers: Please e-mail your contact information and your area of
interests to the lead author and editor.

Authors: Please submit one electronic copy in RTF interchange or Microsoft
Word document formats by August 1, 2000 or sooner to the lead author and
editor:

Dr. Mohamed E. Fayad
J.D. Edwards Professor
Computer Science & Engineering Dept., University of Nebraska, Lincoln
108 Ferguson Hall, P.O. Box 880115, Lincoln, NE 68588-0115
Ph: (402) 472-2615, Fax: (402) 472-7767
E-mail: fayad [at] cse [dot] unl.edu, m.fayad [at] computer [dot] org, fayadm [at] acm [dot] org 
URL: http://www.cse.unl.edu/~fayad	

Submissions:
Submissions should be presented in a practical, easy to understand manner,
providing information that readers can apply today.  We seek original
articles on specific practical and research issues related to software
architectures, product-line architectures, component-based software
developments and enterprise application frameworks.

Chapters may be of any length, ranging from a few pages (2-3 pages or
1,200 words - sidebars) to a full treatment of substantial software
architectures, components, or frameworks (ranging from 10 pages to say 40
pages or 25,000 words - Chapters), including illustrations.  Submissions
are peer-reviewed and are subject to editing for style, clarity, and
space. We also encourage authors to submit supplement materials, such as
documentation and portions of the detailed implementation of their
frameworks or complete documentation or portions of the software
architecture or product-line architecture.  All submissions should
identify a principal contact author by e-mail address and/or fax and/or
telephone number and postal address.  

Please keep in mind that each volume will be the only complete work on
this topic.  We received excellent responses from most of the authors that
we contacted for this project.  We promise a high-quality and an extremely
useful publication for the computer and software industries.  Your chapter
should have appendixes of annotated references, notation, process, and
definitions.

Each chapter will include the biographies of the authors.  We will also
ask you to perform a final review for two or three chapters, collect
opinions from you related to the organization of each volume and keep you
up-to-date about the progress of this project.  If a chapter is accepted,
the authors will be asked to provide the following sections: 
1.	Review questions, 
2.	Problem sets, and/or 
3.	Projects, and 
4.	Key solutions.  
We would like to finish the work related to this project in twelve to
fifteen months.  

Currently, we have over 10 chapters for the first volume,10 papers for the
second volume, and 5 papers for the third volume.  All papers are under
review.  Questions regarding the suitability of a topic should be sent to:
fayad [at] cse [dot] un1.edu, garlan [at] cs [dot] cmu.edu, or pree [at] acm [dot] org

If you are considering submitting a chapter, I would like to receive the
following information immediately for starting the review process for your
chapter:
1. The title of your chapter
2. The list of authors and their contact information
3. The abstract
4. The point of contact

For further information about this series of books, please contact me at
<fayad [at] cse [dot] unl.edu>, <m.fayad [at] computer [dot] org>, or <fayadm [at] acm [dot] org>


For detailed author guidelines, check the following web site:

www.cse.unl.edu/~fayad	Book Projects







From owner-reliable_computing [at] interval [dot] usl.edu  Sun May  7 14:11:07 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id OAA13917
	for reliable_computing-outgoing; Sun, 7 May 2000 14:11:07 -0500 (CDT)
Received: from gauss.Mines.EDU (gauss.Mines.EDU [138.67.22.33])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id OAA13912
	for <reliable_computing [at] interval [dot] usl.edu>; Sun, 7 May 2000 14:11:04 -0500 (CDT)
Received: (from xwu@localhost)
	by gauss.Mines.EDU (8.9.3/8.9.3) id NAA23057
	for reliable_computing [at] interval [dot] usl.edu; Sun, 7 May 2000 13:06:54 -0600 (MDT)
From: Xindong Wu <xwu [at] gauss [dot] Mines.EDU>
Message-Id: <200005071906.NAA23057 [at] gauss [dot] Mines.EDU>
Subject: Knowledge and Information Systems: Vol 2 No 2 (2000)
To: reliable_computing [at] interval [dot] usl.edu
Date: Sun, 7 May 100 13:06:54 -0600 (MDT)
X-Mailer: ELM [version 2.4 PL25]
MIME-Version: 1.0
Content-Type: text/plain; charset=US-ASCII
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

     Knowledge and Information Systems: An International Journal
     -----------------------------------------------------------
                            ISSN 0219-1377
                          by Springer-Verlag

                Home Page: http://kais.mines.edu/~kais/
                =======================================

Volume 2, Number 2 (May 2000): Table of Contents
------------------------------------------------

Regular Papers

  - A Mathematical Foundation for Improved Reduct Generation in
    Information Systems
    by Janusz Starzyk, Dale E. Nelson, and Kirk Sturtz
  - Fast Association Discovery in Derivative Transaction Collections
    by Li Shen, Hong Shen, Ling Cheng and Paul Pritchard
  - An Index Structure for Data Mining and Clustering
    by Xiong Wang, Jason T.L. Wang, King-Ip Lin, Dennis Shasha, Bruce
    A. Shapiro, and Kaizhong Zhang
  - Pattern Analysis and Analogy in Shogi: Predicting Shogi Moves from
    Prior Experience
    by Steven Walczak and Reijer Grimbergen
  - Comparison between Lamarckian and Darwinian Evolution on a Model
    using Neural Networks and GAs
    by Takahiro Sasaki and Mario Tokoro
  - Re-investigating Dempster's Idea on Evidence Combination
    by Weiru Liu and Jun Hong

Short Papers

  - Pest Control Expert System for Tomato (PCEST)
    by EL-Sayed El-Azhary, Hesham A. Hassan, and A. Rafea

From owner-reliable_computing [at] interval [dot] usl.edu  Sun May  7 22:11:17 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id WAA14537
	for reliable_computing-outgoing; Sun, 7 May 2000 22:11:17 -0500 (CDT)
Received: from cse.unl.edu (root [at] cse [dot] unl.edu [129.93.33.1])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id WAA14532
	for <reliable_computing [at] interval [dot] usl.edu>; Sun, 7 May 2000 22:10:54 -0500 (CDT)
Received: from localhost (fayad@localhost)
	by cse.unl.edu (8.9.1/8.9.1) with ESMTP id VAA8975424;
	Sun, 7 May 2000 21:56:08 -0500 (CDT)
Date: Sun, 7 May 2000 21:56:08 -0500
From: Mohamed Fayad <fayad [at] cse [dot] unl.edu>
To: Undisclosed recipients: ;
Subject: CFCs - SW Arch., Components, and Frameworks
Message-ID: <Pine.SGI.4.05.10005072153050.9121306-100000 [at] cse [dot] unl.edu>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk




Greetings,

Apologies if you recieve multitple copies of this cfcs.  Enclosed, please
find a call for chapters and reviewers.  Please post. Thank you.

Cheers,

M. Fayad

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

3-volume book on
Software Architectures, Components, and Frameworks
Call for Chapters and Reviewers

Authors and Editors:

Dr. Mohamed Fayad: fayad [at] cse [dot] unl.edu, m.fayad [at] computer [dot] org,
fayadm [at] acm [dot] org, 
URL: http://www.cse.unl.edu/~fayad	

Dr. David Garlan: garlan [at] cs [dot] cmu.edu
URL: http://www.cs.cmu.edu/~garlan      
      
Professor Wolfgang Pree: pree [at] acm [dot] org
URL: www.informatik.uni-konstanz.de/swe

We are developing three-volume series of books on software architectures,
components, and frameworks. If this is your area of interest/research, I
would like to invite you to submit a chapter.  This series of books will
serve as a complete reference set for academics and practitioners. 

Volume 1: Software Architectures

The working title of the first-volume is "Software Architectures."
Architecture-based software engineering research has yielded an impressive
array of technologies and demonstrations over the past decade. Using an
architecture-based approach, applications have been built which:
- Are understandable
- Are expected to evolve
- Exhibit remarkable flexibility
- Demonstrate significant reuse of off-the-shelf components
- Leverage experience from related applications in the same problem
  domain
- Are analyzable earlier in their development than ever before
- Are key milestones in software managerial and development
  processes

Currently, there is relatively little guidance for software developers on
how to develop software architectures.  This volume addresses several
topics crucial to the state of the art and practice of software
architecture.  The book presents a complete reference on how to develop a
good software architecture and provides guidelines for resolving key
software architecture issues, such as evolving software architectures,
leveraging existing investment in software architecture artifacts,
representing architecture description languages, introducing formal models
for software architectures, addressing architectural analysis techniques &
development methods, transitioning from software architecture to coding
and surveying architectural design tools and environments. 

In addition, the book will include sections on: accessing of software
architectures, testing and validating software architectures, improving
software architecture quality, documenting software architectures, and
many more.
 
This is a pragmatic book that is specifically designed to help
organizations develop software architectures for real projects in the real
world. Comprehensive technical and management guidelines are thoroughly
discussed, ranging from specifying software architecture elements and
their behaviors, to the impact of software architecture on the job.
Likewise, technical issues (such as documenting and utilizing software
architectures) are discussed in detail.  

Volume 2: Product-Line Architectures 

The working title of the second-volume is "Product-Line Architectures".
Software product lines are emerging as a new and important software
development paradigm. A Product-Line Architecture (PLA) is a design for a
family of related applications, and its motivation is to simplify the
design and maintenance of program families and to address the needs of
highly customizable applications in an economical manner. Companies are
realizing that the practice of building sets of related systems from
common assets can yield remarkable improvements in productivity, time to
market, product quality and customer satisfaction. But these gains are
only a part of the picture; organizational, technical and management
issues are other factors that should be considered. Although there are
encouraging research experiences with PLAs and some guidelines exist to
help in the development process, some issues about component-based
development in PLAs are still under study.  The goal of this book is to
examine the foundational concepts underlying product lines and address the
essential activities developers should consider to apply a PLA to a number
of lines of products.

The book will include sections on: lessons learned in PLA-based
development, architectural specification, tools and process for software
development, core asset management, domain analysis, configuration
management, evaluation methods, quality factors involved, implementation
strategies, and many more.

Volume 3: Component-Based Software Developments & Enterprise Frameworks

The working title of the third-volume is "Component-Based Software
Development and Enterprise
Frameworks". Nowadays, software engineering is moving forward on an
architecture-based development conception where systems are built by
composing or assembling components that are often developed independently.
The key to making a large variety of software products and reducing time
to market is to build pieces of software where the development effort can
serve in other products as well.  Thus, large-grained components are
becoming a practical part of an enterprise component strategy.  Such
generic components usually include interactions with other components,
code, design models, design patterns and specifications. In addition, they
must provide ways to be adaptable and customizable according with the
client's needs.  In this context, enterprise frameworks offer an
appropriate base for waving the software architectures, components, and
core requirements into one container that is adaptable, customizable,
extensible, and reusable.

The technology of component-based systems is quite well established, but
it is not the same with the methods to develop them.  The need of
well-defined techniques, notations and architectural support is still
pending. The book will cover all these issues.

This book is intended to provide valuable, real world insight into
successful development and/or adaptation of OO Enterprise Frameworks, by
describing the problems with frameworks, explaining the issues related to
the development and adaptation of enterprise frameworks, selecting the
right methods and tools for building frameworks.  The book will be derived
from actual experiences, successes and failures, and is presented in a
practical, easy to understand manner.  This is information that readers
can apply today.  The key issues are:
+ What are the key enterprise-oriented framework issues?
+ How to develop enterprise frameworks and what are the framework
  design guidelines?
+ What kind of evolution does an Enterprise Framework undergo and
  how is it correlated with the enterprise life span?
+ How can the adaptation of OO enterprise framework be accomplished
  with minimum impact on the cost and schedule?
+ Understand make vs. buy decisions, selection guidelines, and how
  to select and adapt the right enterprise framework for the job.
+ Understand the implication of enterprise business requirements on
  the framework design.
+ How to use your large-scale enterprise framework and how to
  protect your investment.
+ How to deal with resource requirements, enterprise framework
  integration problems, framework reporting, and others.
+ What are the impacts of enterprise frameworks on the national and
  global economy?

This volume helps organizations apply component-based technology
effectively by citing examples from the real world.  This book combines
the actual experiences and lessons learned from developing and/or adapting
component-based enterprise framework developments.

Reviewers: Please e-mail your contact information and your area of
interests to the lead author and editor.

Authors: Please submit one electronic copy in RTF interchange or Microsoft
Word document formats by August 1, 2000 or sooner to the lead author and
editor:

Dr. Mohamed E. Fayad
J.D. Edwards Professor
Computer Science & Engineering Dept., University of Nebraska, Lincoln
108 Ferguson Hall, P.O. Box 880115, Lincoln, NE 68588-0115
Ph: (402) 472-2615, Fax: (402) 472-7767
E-mail: fayad [at] cse [dot] unl.edu, m.fayad [at] computer [dot] org, fayadm [at] acm [dot] org 
URL: http://www.cse.unl.edu/~fayad	

Submissions:
Submissions should be presented in a practical, easy to understand manner,
providing information that readers can apply today.  We seek original
articles on specific practical and research issues related to software
architectures, product-line architectures, component-based software
developments and enterprise application frameworks.

Chapters may be of any length, ranging from a few pages (2-3 pages or
1,200 words - sidebars) to a full treatment of substantial software
architectures, components, or frameworks (ranging from 10 pages to say 40
pages or 25,000 words - Chapters), including illustrations.  Submissions
are peer-reviewed and are subject to editing for style, clarity, and
space. We also encourage authors to submit supplement materials, such as
documentation and portions of the detailed implementation of their
frameworks or complete documentation or portions of the software
architecture or product-line architecture.  All submissions should
identify a principal contact author by e-mail address and/or fax and/or
telephone number and postal address.  

Please keep in mind that each volume will be the only complete work on
this topic.  We received excellent responses from most of the authors that
we contacted for this project.  We promise a high-quality and an extremely
useful publication for the computer and software industries.  Your chapter
should have appendixes of annotated references, notation, process, and
definitions.

Each chapter will include the biographies of the authors.  We will also
ask you to perform a final review for two or three chapters, collect
opinions from you related to the organization of each volume and keep you
up-to-date about the progress of this project.  If a chapter is accepted,
the authors will be asked to provide the following sections: 
1.	Review questions, 
2.	Problem sets, and/or 
3.	Projects, and 
4.	Key solutions.  
We would like to finish the work related to this project in twelve to
fifteen months.  

Currently, we have over 10 chapters for the first volume,10 papers for the
second volume, and 5 papers for the third volume.  All papers are under
review.  Questions regarding the suitability of a topic should be sent to:
fayad [at] cse [dot] un1.edu, garlan [at] cs [dot] cmu.edu, or pree [at] acm [dot] org

If you are considering submitting a chapter, I would like to receive the
following information immediately for starting the review process for your
chapter:
1. The title of your chapter
2. The list of authors and their contact information
3. The abstract
4. The point of contact

For further information about this series of books, please contact me at
<fayad [at] cse [dot] unl.edu>, <m.fayad [at] computer [dot] org>, or <fayadm [at] acm [dot] org>


For detailed author guidelines, check the following web site:

www.cse.unl.edu/~fayad	Book Projects







From owner-reliable_computing [at] interval [dot] usl.edu  Mon May  8 06:24:05 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id GAA16115
	for reliable_computing-outgoing; Mon, 8 May 2000 06:24:05 -0500 (CDT)
Received: from animal.cs.chalmers.se (animal.cs.chalmers.se [129.16.225.30])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id GAA16110
	for <reliable_computing [at] interval [dot] usl.edu>; Mon, 8 May 2000 06:24:01 -0500 (CDT)
Received: from muppet70.cs.chalmers.se (muppet70.cs.chalmers.se [129.16.226.211])
	by animal.cs.chalmers.se (8.8.5/8.8.5) with ESMTP id NAA14658;
	Mon, 8 May 2000 13:22:43 +0200 (MET DST)
Received: from localhost (taha@localhost)
	by muppet70.cs.chalmers.se (8.8.5/8.8.5) with ESMTP id NAA16689;
	Mon, 8 May 2000 13:22:44 +0200 (MET DST)
X-Authentication-Warning: muppet70.cs.chalmers.se: taha owned process doing -bs
Newsgroups: comp.lang.ml,comp.lang.functional,comp.compilers,comp.lang.scheme
Date: Mon, 8 May 2000 13:22:37 +0200 (MET DST)
From: Walid Taha <taha [at] cs [dot] chalmers.se>
Reply-To: saig [at] cs [dot] chalmers.se
To: appsem [at] cs [dot] chalmers.se, concurrency [at] cwi [dot] nl, theorynt [at] listserv [dot] nodak.edu,
        types [at] cis [dot] upenn.edu, haskell [at] dcs [dot] gla.ac.uk, haskell [at] haskell [dot] org
Subject: CFP:  Workshop on Program Generation
Message-ID: <Pine.SOL.4.21.0005081315570.4048-100000 [at] muppet70 [dot] cs.chalmers.se>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


[Reminder:  Deadline in two weeks.]

                         LAST CALL FOR PAPERS 

               Semantics, Applications and Implementation 
                      of Program Generation (SAIG) 
                                                                              
              ICFP Workshop, Montreal, September 20th, 2000.  
                         (Deadline:  May 22, 2000)

                    http://www.md.chalmers.se/~taha/saig/

Numerous recent studies investigate different aspects of program
generation systems, including their semantics, their applications, and
their implementation.  Existing theories and systems address both
high-level (source) language and low-level (machine) language
generation.  A number of programming languages now supports program
generation and manipulation, with different goals, implementation
techniques, and targeted at different applications. The goal of this
workshop is to provide a meeting place for researchers and
practitioners interested in this research area, and in program
generation in general.

Scope: The workshop solicits submissions related to one or more of the
following topics:

  - Multi-level and multi-stage languages, staged computation,
  - Partial evaluation (of e.g. functional, logical, imperative
    programs),
  - Run-time specialization (in e.g. compilers, operating systems),
  - High-level program generation (applications, foundations,
    environments),
  - Symbolic computation, in-lining and macros, 

Submissions are especially welcome if they relate ideas and concepts
from several topics, bridge the gap between theory and practice, cover
new ground, or report exciting applications.  The program committee
will be happy to advise on the appropriateness of a particular
subject.

Distribution: Accepted papers will be published as a Chalmers
technical report, and will be made available online.  A special issue
of the Journal of Higher Order and Symbolic Computation (HOSC) is
planned afterwards.

Format: The one-day workshop will contain slots for participants to
present accepted papers. In addition, there will be time allocated for
open discussions during the workshop.  Invited speakers will be
announced in the near future.

Invited Speaker:

          Frank Pfenning, CMU 

Submission Details: Authors are invited to submit papers of at most
5000 words (excluding figures), in postscript format (letter or A4),
to saig [at] cs [dot] chalmers.se by 22nd May 2000. Both position and technical
papers are welcome.  Please indicate at time of submission. Position
papers are expected to describe ongoing work, future directions,
and/or survey previous results.  Technical papers are expected to
contain novel results.  All papers will be reviewed by the program
committee for the above mentioned criteria, in addition to correctness
and clarity.  Authors will be notified of acceptance by 3 July 2000.
Final version of the papers must be submitted by 31 July 2000.

Program Committee: 

          Cliff Click, Sun Micro Systems 
          Rowan Davies, CMU 
          Torben Mogensen, DIKU 
          Suresh Jagannathan, NEC Research 
          Tim Sheard, OGI 
          Walid Taha, Chalmers (workshop chair) 
          Peter Thiemann, Freiburg 




From owner-reliable_computing [at] interval [dot] usl.edu  Wed May 10 08:50:13 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id IAA20995
	for reliable_computing-outgoing; Wed, 10 May 2000 08:50:12 -0500 (CDT)
Received: from kleene.math.wisc.edu (kleene.math.wisc.edu [144.92.166.90])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id IAA20989
	for <reliable_computing [at] interval [dot] louisiana.edu>; Wed, 10 May 2000 08:49:51 -0500 (CDT)
Received: from bing.math.wisc.edu (bing.math.wisc.edu [144.92.166.133])
	by kleene.math.wisc.edu (8.9.3/8.9.3) with SMTP id IAA25298;
	Wed, 10 May 2000 08:34:52 -0500 (CDT)
Date: Wed, 10 May 2000 08:27:42 -0500 (CDT)
From: Hans Schneider <hans [at] math [dot] wisc.edu>
To: NETS -- at-net <at-net [at] mi [dot] uni-erlangen.de>,
        "Hershkowitz, Danny -- Hershkowitz Daniel" <hershkow [at] aluf [dot] technion.ac.il>,
        Danny Hershkowitz <hershkow [at] techunix [dot] technion.ac.il>,
        E-LETTER <eletter-request [at] win [dot] tue.nl>,
        "na.digest" <na.digest@na-net.ornl.gov>, ipnet-digest [at] math [dot] msu.edu,
        wim@bell-labs.com, hjt [at] eos [dot] ncsu.edu, vkm [at] eedsp [dot] gatech.edu,
        reliable_computing [at] interval [dot] louisiana.edu
cc: LAA/IS special editors -- Patrick Dewilde <p.dewilde [at] dimes [dot] tudelft.nl>,
        "prof. P.M. Dewilde" <dewilde [at] renaer [dot] et.tudelft.nl>,
        Vadim Olshevsky <volshevsky [at] CS [dot] Gsu.EDU>,
        Sally + Hans -- Hans Schneider <hans [at] math [dot] wisc.edu>,
        Sally Rear <rear [at] math [dot] wisc.edu>, "Ali H. Sayed" <sayed [at] EE [dot] UCLA.EDU>
Subject: LAA announcment
Message-ID: <Pine.GSO.3.96.1000510082519.20208B-100000 [at] bing [dot] math.wisc.edu>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


Dear Net-organizer:

Please circulate the attached LAA announcement over your net.

best


hans

------------------------------------------------------------------------------
Hans Schneider                                 hans [at] math [dot] wisc.edu.
Department of Mathematics                      608-262-1402 (Work)
Van Vleck Hall                                 608-271-7252 (Home)
480 Lincoln Drive                              608-263-8891 (Work FAX)
University of Wisconsin-Madison                608-271-8477 (Home FAX)
Madison WI 53706 USA             http://www.math.wisc.edu/~hans (URL)
------------------------------------------------------------------------------



Linear Algebra and its Applications

Special Issue on

STRUCTURED AND INFINITE SYSTEMS OF LINEAR EQUATIONS

Deadline extension

The scope of the 'Special Issue on 'Infinite Linear Systems
of Equations finitely specified' with deadline June 1st
has been slightly extended to include very large structured
systems and methods that may lead to the treatment of 
infinite systems. There have already been submissions
to the previously announced special issue which 
fit the extended scope. We wish to give all potential authors
the chance to submit papers fitting the broader scope and
are therefore extending the deadline for submission
to August 31st. The new, slightly adapted description of
the special session reads as follows:

One of the traditional hunting grounds of linear algebra is
the area of finite systems of linear equations, as described by a
matrix equation $Ax = b$. Here $A$ is a known matrix,
$b$ a known vector of finite dimensions, and $x$ is an unknown
vector of finite dimensions, which is to be determined such 
that the equation is either satisfied, or, if that is not possible, 
approximately satisfied. Many techniques are known for finding solutions 
or approximate solutions, depending on the properties of the
given data and the approximation technique choosen.

If the system of equations is not finite, i.e. $A$ is not a matrix
but an operator, and $b$ and $x$ are of infinite dimension, then
algebraic and numerical techniques can still be used provided the
given data are finitely specified. Operators with such a property
are often called 'structured operators', and it turns out that
one can solve such infinite equations in an exact or approximate sense using
finite methods and algorithms. Also in the case of very large
structured matrices, methods can be devised that are in principle
extendable to the infinite case.

The conjunction of linear algebra and inversion theory for finitely
specified infinite operators brings interesting connections to the
forefront: algebraic equivalents of inner-outer factorizations e.g.,
or the algebraic significance of Kalman filtering. Structured matrices
can be of many types, e.g. systems with finite displacement ranks or
time-varying systems with state spaces of finite dimensions and whose
limiting behaviour is known, e.g. as a time invariant system.

A non-limiting list of topics of interest in this area is (assuming
$A$ is an infinite but finitely described operator of some kind):
- inversion methods
- decomposition methods for the operator A
- quadratic approximation methods
- complexity reduction
- equivalencies
- canonical forms
- transform techniques.

Examples of operator structure:
- systems with low displacement rank
- finitely described time-varying systems
- finitely described almost-periodic systems
- differentials of non-linear systems.

Interested authors are kindly invited to submit full papers with
significant contributions to this area to any of the three
guest editors listed below before August 31st, 2000.


Patrick Dewilde
DIMES, Delft University of Technology
POB 5031,
2600GA Delft, the Netherlands.
Fax:   +31 15 262 3271
email: dewilde [at] DIMES [dot] tudelft.nl

Vadim Olshevsky
Department of Mathematics and Computer Science
Georgia State University
University Plaza
Atlanta, GA 30303, USA
Fax:   +1 404 651 2246
email: volshevsky [at] cs [dot] gsu.edu

Ali Sayed
Rm 44-123A Engr. IV Bldg
Dept. of Electrical Engineering   
University of California
Los Angeles, CA 90095-1594, USA
Fax:    +1 310 206 8495
email:  sayed [at] biruni [dot] icsl.ucla.edu






From owner-reliable_computing [at] interval [dot] usl.edu  Wed May 10 10:43:11 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA21426
	for reliable_computing-outgoing; Wed, 10 May 2000 10:43:11 -0500 (CDT)
Received: from biruni.icsl.ucla.edu (biruni.ICSL.UCLA.EDU [128.97.90.234])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA21421
	for <reliable_computing [at] interval [dot] louisiana.edu>; Wed, 10 May 2000 10:43:07 -0500 (CDT)
Received: from biruni.icsl.ucla.edu (localhost [127.0.0.1])
	by biruni.icsl.ucla.edu (8.8.8/8.8.8) with ESMTP id IAA21195;
	Wed, 10 May 2000 08:37:04 -0700 (PDT)
Message-ID: <3919821F.B1A58437 [at] biruni [dot] icsl.ucla.edu>
Date: Wed, 10 May 2000 08:37:03 -0700
From: "Ali H. Sayed" <sayed [at] icsl [dot] ucla.edu>
Organization: UCLA
X-Mailer: Mozilla 4.61 [en] (X11; I; IRIX 6.3 IP32)
X-Accept-Language: en
MIME-Version: 1.0
To: Hans Schneider <hans [at] math [dot] wisc.edu>
CC: NETS -- at-net <at-net [at] mi [dot] uni-erlangen.de>,
        "Hershkowitz, Danny -- Hershkowitz Daniel" 
 <hershkow [at] aluf [dot] technion.ac.il>,
        Danny Hershkowitz <hershkow [at] techunix [dot] technion.ac.il>,
        E-LETTER <eletter-request [at] win [dot] tue.nl>,
        "na.digest" <na.digest@na-net.ornl.gov>, ipnet-digest [at] math [dot] msu.edu,
        wim@bell-labs.com, hjt [at] eos [dot] ncsu.edu, vkm [at] eedsp [dot] gatech.edu,
        reliable_computing [at] interval [dot] louisiana.edu,
        LAA/IS special editors -- Patrick Dewilde <p.dewilde [at] dimes [dot] tudelft.nl>,
        "prof. P.M. Dewilde" <dewilde [at] renaer [dot] et.tudelft.nl>,
        Vadim Olshevsky <volshevsky [at] CS [dot] Gsu.EDU>,
        Sally Rear <rear [at] math [dot] wisc.edu>, "Ali H. Sayed" <sayed [at] EE [dot] UCLA.EDU>
Subject: Re: LAA announcment
References: <Pine.GSO.3.96.1000510082519.20208B-100000 [at] bing [dot] math.wisc.edu>
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

I forgot to say that the submission date (i.e., received
by my) was March 20, 2000.



Hans Schneider wrote:
> 
> Dear Net-organizer:
> 
> Please circulate the attached LAA announcement over your net.
> 
> best
> 
> hans
> 
> ------------------------------------------------------------------------------
> Hans Schneider                                 hans [at] math [dot] wisc.edu.
> Department of Mathematics                      608-262-1402 (Work)
> Van Vleck Hall                                 608-271-7252 (Home)
> 480 Lincoln Drive                              608-263-8891 (Work FAX)
> University of Wisconsin-Madison                608-271-8477 (Home FAX)
> Madison WI 53706 USA             http://www.math.wisc.edu/~hans (URL)
> ------------------------------------------------------------------------------
> 
> Linear Algebra and its Applications
> 
> Special Issue on
> 
> STRUCTURED AND INFINITE SYSTEMS OF LINEAR EQUATIONS
> 
> Deadline extension
> 
> The scope of the 'Special Issue on 'Infinite Linear Systems
> of Equations finitely specified' with deadline June 1st
> has been slightly extended to include very large structured
> systems and methods that may lead to the treatment of
> infinite systems. There have already been submissions
> to the previously announced special issue which
> fit the extended scope. We wish to give all potential authors
> the chance to submit papers fitting the broader scope and
> are therefore extending the deadline for submission
> to August 31st. The new, slightly adapted description of
> the special session reads as follows:
> 
> One of the traditional hunting grounds of linear algebra is
> the area of finite systems of linear equations, as described by a
> matrix equation $Ax = b$. Here $A$ is a known matrix,
> $b$ a known vector of finite dimensions, and $x$ is an unknown
> vector of finite dimensions, which is to be determined such
> that the equation is either satisfied, or, if that is not possible,
> approximately satisfied. Many techniques are known for finding solutions
> or approximate solutions, depending on the properties of the
> given data and the approximation technique choosen.
> 
> If the system of equations is not finite, i.e. $A$ is not a matrix
> but an operator, and $b$ and $x$ are of infinite dimension, then
> algebraic and numerical techniques can still be used provided the
> given data are finitely specified. Operators with such a property
> are often called 'structured operators', and it turns out that
> one can solve such infinite equations in an exact or approximate sense using
> finite methods and algorithms. Also in the case of very large
> structured matrices, methods can be devised that are in principle
> extendable to the infinite case.
> 
> The conjunction of linear algebra and inversion theory for finitely
> specified infinite operators brings interesting connections to the
> forefront: algebraic equivalents of inner-outer factorizations e.g.,
> or the algebraic significance of Kalman filtering. Structured matrices
> can be of many types, e.g. systems with finite displacement ranks or
> time-varying systems with state spaces of finite dimensions and whose
> limiting behaviour is known, e.g. as a time invariant system.
> 
> A non-limiting list of topics of interest in this area is (assuming
> $A$ is an infinite but finitely described operator of some kind):
> - inversion methods
> - decomposition methods for the operator A
> - quadratic approximation methods
> - complexity reduction
> - equivalencies
> - canonical forms
> - transform techniques.
> 
> Examples of operator structure:
> - systems with low displacement rank
> - finitely described time-varying systems
> - finitely described almost-periodic systems
> - differentials of non-linear systems.
> 
> Interested authors are kindly invited to submit full papers with
> significant contributions to this area to any of the three
> guest editors listed below before August 31st, 2000.
> 
> Patrick Dewilde
> DIMES, Delft University of Technology
> POB 5031,
> 2600GA Delft, the Netherlands.
> Fax:   +31 15 262 3271
> email: dewilde [at] DIMES [dot] tudelft.nl
> 
> Vadim Olshevsky
> Department of Mathematics and Computer Science
> Georgia State University
> University Plaza
> Atlanta, GA 30303, USA
> Fax:   +1 404 651 2246
> email: volshevsky [at] cs [dot] gsu.edu
> 
> Ali Sayed
> Rm 44-123A Engr. IV Bldg
> Dept. of Electrical Engineering
> University of California
> Los Angeles, CA 90095-1594, USA
> Fax:    +1 310 206 8495
> email:  sayed [at] biruni [dot] icsl.ucla.edu

-- 
_________________________________________________________
Ali H. Sayed                   Phone (310)267-2142
Electrical Engineering Dept.   Fax   (310)206-8495
University of California       Email sayed [at] ee [dot] ucla.edu
Los Angeles, CA 90095-1594     http://www.ee.ucla.edu/asl

From owner-reliable_computing [at] interval [dot] usl.edu  Wed May 10 12:10:50 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id MAA21825
	for reliable_computing-outgoing; Wed, 10 May 2000 12:10:49 -0500 (CDT)
Received: from biruni.icsl.ucla.edu (biruni.ICSL.UCLA.EDU [128.97.90.234])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id MAA21820
	for <reliable_computing [at] interval [dot] louisiana.edu>; Wed, 10 May 2000 12:10:46 -0500 (CDT)
Received: from biruni.icsl.ucla.edu (localhost [127.0.0.1])
	by biruni.icsl.ucla.edu (8.8.8/8.8.8) with ESMTP id JAA21328;
	Wed, 10 May 2000 09:30:26 -0700 (PDT)
Message-ID: <39198EA1.CA4707B7 [at] biruni [dot] icsl.ucla.edu>
Date: Wed, 10 May 2000 09:30:25 -0700
From: "Ali H. Sayed" <sayed [at] icsl [dot] ucla.edu>
Organization: UCLA
X-Mailer: Mozilla 4.61 [en] (X11; I; IRIX 6.3 IP32)
X-Accept-Language: en
MIME-Version: 1.0
To: Hans Schneider <hans [at] math [dot] wisc.edu>
CC: NETS -- at-net <at-net [at] mi [dot] uni-erlangen.de>,
        "Hershkowitz, Danny -- Hershkowitz Daniel" 
 <hershkow [at] aluf [dot] technion.ac.il>,
        Danny Hershkowitz <hershkow [at] techunix [dot] technion.ac.il>,
        E-LETTER <eletter-request [at] win [dot] tue.nl>,
        "na.digest" <na.digest@na-net.ornl.gov>, ipnet-digest [at] math [dot] msu.edu,
        wim@bell-labs.com, hjt [at] eos [dot] ncsu.edu, vkm [at] eedsp [dot] gatech.edu,
        reliable_computing [at] interval [dot] louisiana.edu,
        LAA/IS special editors -- Patrick Dewilde <p.dewilde [at] dimes [dot] tudelft.nl>,
        "prof. P.M. Dewilde" <dewilde [at] renaer [dot] et.tudelft.nl>,
        Vadim Olshevsky <volshevsky [at] CS [dot] Gsu.EDU>,
        Sally Rear <rear [at] math [dot] wisc.edu>, "Ali H. Sayed" <sayed [at] EE [dot] UCLA.EDU>,
        na.digest@na-net.ornl.gov
Subject: Re: LAA announcment
References: <Pine.GSO.3.96.1000510082519.20208B-100000 [at] bing [dot] math.wisc.edu>
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


Dear Net-Organizers:

 It seems that by mistake I copied a message to you
all that was supposed to be sent only to Prof. Schneider
and to Sally Rear.

I simply replied to the wrong e-mail. My message was 
about the date of receipt of a manuscript, saying 
something like:

"I forgot to say that the submission date (i.e., received
 by me) was March 20, 2000."

Please ignore this message. Make sure it does not appear
on your (automated) net anouncements!

Please confirm.

Thank you

Ali H. Sayed







Hans Schneider wrote:
> 
> Dear Net-organizer:
> 
> Please circulate the attached LAA announcement over your net.
> 
> best
> 
> hans
> 
> ------------------------------------------------------------------------------
> Hans Schneider                                 hans [at] math [dot] wisc.edu.
> Department of Mathematics                      608-262-1402 (Work)
> Van Vleck Hall                                 608-271-7252 (Home)
> 480 Lincoln Drive                              608-263-8891 (Work FAX)
> University of Wisconsin-Madison                608-271-8477 (Home FAX)
> Madison WI 53706 USA             http://www.math.wisc.edu/~hans (URL)
> ------------------------------------------------------------------------------
> 
> Linear Algebra and its Applications
> 
> Special Issue on
> 
> STRUCTURED AND INFINITE SYSTEMS OF LINEAR EQUATIONS
> 
> Deadline extension
> 
> The scope of the 'Special Issue on 'Infinite Linear Systems
> of Equations finitely specified' with deadline June 1st
> has been slightly extended to include very large structured
> systems and methods that may lead to the treatment of
> infinite systems. There have already been submissions
> to the previously announced special issue which
> fit the extended scope. We wish to give all potential authors
> the chance to submit papers fitting the broader scope and
> are therefore extending the deadline for submission
> to August 31st. The new, slightly adapted description of
> the special session reads as follows:
> 
> One of the traditional hunting grounds of linear algebra is
> the area of finite systems of linear equations, as described by a
> matrix equation $Ax = b$. Here $A$ is a known matrix,
> $b$ a known vector of finite dimensions, and $x$ is an unknown
> vector of finite dimensions, which is to be determined such
> that the equation is either satisfied, or, if that is not possible,
> approximately satisfied. Many techniques are known for finding solutions
> or approximate solutions, depending on the properties of the
> given data and the approximation technique choosen.
> 
> If the system of equations is not finite, i.e. $A$ is not a matrix
> but an operator, and $b$ and $x$ are of infinite dimension, then
> algebraic and numerical techniques can still be used provided the
> given data are finitely specified. Operators with such a property
> are often called 'structured operators', and it turns out that
> one can solve such infinite equations in an exact or approximate sense using
> finite methods and algorithms. Also in the case of very large
> structured matrices, methods can be devised that are in principle
> extendable to the infinite case.
> 
> The conjunction of linear algebra and inversion theory for finitely
> specified infinite operators brings interesting connections to the
> forefront: algebraic equivalents of inner-outer factorizations e.g.,
> or the algebraic significance of Kalman filtering. Structured matrices
> can be of many types, e.g. systems with finite displacement ranks or
> time-varying systems with state spaces of finite dimensions and whose
> limiting behaviour is known, e.g. as a time invariant system.
> 
> A non-limiting list of topics of interest in this area is (assuming
> $A$ is an infinite but finitely described operator of some kind):
> - inversion methods
> - decomposition methods for the operator A
> - quadratic approximation methods
> - complexity reduction
> - equivalencies
> - canonical forms
> - transform techniques.
> 
> Examples of operator structure:
> - systems with low displacement rank
> - finitely described time-varying systems
> - finitely described almost-periodic systems
> - differentials of non-linear systems.
> 
> Interested authors are kindly invited to submit full papers with
> significant contributions to this area to any of the three
> guest editors listed below before August 31st, 2000.
> 
> Patrick Dewilde
> DIMES, Delft University of Technology
> POB 5031,
> 2600GA Delft, the Netherlands.
> Fax:   +31 15 262 3271
> email: dewilde [at] DIMES [dot] tudelft.nl
> 
> Vadim Olshevsky
> Department of Mathematics and Computer Science
> Georgia State University
> University Plaza
> Atlanta, GA 30303, USA
> Fax:   +1 404 651 2246
> email: volshevsky [at] cs [dot] gsu.edu
> 
> Ali Sayed
> Rm 44-123A Engr. IV Bldg
> Dept. of Electrical Engineering
> University of California
> Los Angeles, CA 90095-1594, USA
> Fax:    +1 310 206 8495
> email:  sayed [at] biruni [dot] icsl.ucla.edu

-- 
_________________________________________________________
Ali H. Sayed                   Phone (310)267-2142
Electrical Engineering Dept.   Fax   (310)206-8495
University of California       Email sayed [at] ee [dot] ucla.edu
Los Angeles, CA 90095-1594     http://www.ee.ucla.edu/asl

From owner-reliable_computing [at] interval [dot] usl.edu  Fri May 12 00:29:26 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id AAA25926
	for reliable_computing-outgoing; Fri, 12 May 2000 00:29:26 -0500 (CDT)
Received: from ness.arch.usyd.EDU.AU (ness.arch.usyd.EDU.AU [129.78.92.1])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id AAA25921
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 12 May 2000 00:29:15 -0500 (CDT)
Received: from kasanova.arch.usyd.edu.au (arch-096.arch.usyd.EDU.AU [129.78.92.196])
	by ness.arch.usyd.EDU.AU (8.8.8/8.8.8) with SMTP id PAA03228
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 12 May 2000 15:29:10 +1000 (EST)
Message-ID: <022b01bfbbd2$cc7e0380$c45c4e81 [at] kasanova [dot] arch.usyd.edu.au>
From: "Simeon Simoff" <simeon [at] arch [dot] usyd.edu.au>
To: <reliable_computing [at] interval [dot] usl.edu>
Subject: Reminder: KDD2000 Workshop on Multimedia Data Mining (MDM/KDD2000)
Date: Fri, 12 May 2000 15:27:42 +1000
MIME-Version: 1.0
Content-Type: text/plain;
	charset="iso-8859-1"
Content-Transfer-Encoding: 7bit
X-Priority: 3
X-MSMail-Priority: Normal
X-Mailer: Microsoft Outlook Express 4.72.3612.1700
X-MimeOLE: Produced By Microsoft MimeOLE V4.72.3612.1700
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Gentle reminder - less than a week to the dealine
********************************************************

Workshop on Multimedia Data Mining (MDM/KDD2000)

in conjunction with

Sixth ACM SIGKDD International Conference on Knowledge Discovery & Data
Mining August 20-23, 2000, Boston, MA, USA (KDD2000)

IMPORTANT DATES

- May 15 : Submissions Due
- June 15 : Acceptance Notification
- July 15 : Camera Ready Copy Due
- August 20: Workshop Day

For more information see the workshop web site:
http://www.cs.ualberta.ca/~zaiane/mdm_kdd2000/




From owner-reliable_computing [at] interval [dot] usl.edu  Sun May 14 11:00:26 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id LAA02297
	for reliable_computing-outgoing; Sun, 14 May 2000 11:00:25 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id LAA02292
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 14 May 2000 11:00:21 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.10.1/8.10.1) with SMTP id e4EG0FC18923
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 14 May 2000 10:00:16 -0600 (MDT)
Message-Id: <200005141600.e4EG0FC18923 [at] cs [dot] utep.edu>
Date: Sun, 14 May 2000 10:00:16 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: Re: ISACA'2000: deadline extended
To: reliable_computing [at] interval [dot] louisiana.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: oyh3popBp4OvDedjEvdSVg==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


X-Originating-IP: [134.96.50.58]
From: "RAJENDRA AKERKAR" <rakerkar [at] hotmail [dot] com>
To: vladik [at] cs [dot] utep.edu
Subject: Re: ISACA'2000 First call for papers
Date: Sun, 14 May 2000 17:58:27 IST
Mime-Version: 1.0


Please send this to your friends, colleauges, students.
-----------------
Second call for papers:

ISACA'2000 will be held in Goa,India from 3rd to 5th October 2000.

The International Symposium on Applications of Computer Algebra (ISACA'2000) 
  focus on
actual or
possible applications of computer algebra techniques to other
fields and substantial interactions of computer algebra with other fields.

You are invited to submit a proposal to organize a special session for
this meeting and also invited to submit research papers for conference 
proceedings before June 15th, 2000.

See
        http://tmrf.homepage.com/isaca.html
for more information and registration.


From owner-reliable_computing [at] interval [dot] usl.edu  Tue May 16 13:42:50 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id NAA07858
	for reliable_computing-outgoing; Tue, 16 May 2000 13:42:50 -0500 (CDT)
Received: from pompeii.ise (troy.eiffel.com [198.68.147.5])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id NAA07853
	for <reliable_computing [at] interval [dot] usl.edu>; Tue, 16 May 2000 13:42:45 -0500 (CDT)
Received: from lannion.ise ([10.0.10.105])
	by pompeii.ise with smtp (Exim 3.02 #2)
	id 12rmJ4-00082i-00
	for reliable_computing [at] interval [dot] usl.edu; Tue, 16 May 2000 11:43:02 -0700
Received: by lannion.ise (SMI-8.6/SMI-SVR4)
	id LAA17928; Tue, 16 May 2000 11:42:38 -0700
Date: Tue, 16 May 2000 11:42:38 -0700
Message-Id: <200005161842.LAA17928 [at] lannion [dot] ise>
From: TOOLS Conferences <info@tools-conferences.com>
Reply-to: info@tools-conferences.com
To: reliable_computing [at] interval [dot] usl.edu
Subject: TOOLS EUROPE & TOOLS USA Conference Programs
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

The program of TOOLS EUROPE 2000 -- Mont Saint-Michel, 5-8 June and 
the program for TOOLS USA 2000 -- Santa Barbara, 30 July - 4 August, 
are available online:

	http://www.tools-conferences.com/europe
	http://www.tools-conferences.com/usa

Both conferences have particularly attractive programs with
the most prestigious keynote and tutorial speakers in the field.
Both are held in stunning places. 

TOOLS is the major international conference series devoted to applications
of object and component technology, with a commitment to excellence
renewed by more than 30 sessions in the US, Europe, Australia and Asia.

TOOLS Europe will be held in France from June 5 to June 8 in one of the world's
heritage masterpieces, the Mont Saint-Michel abbey off the coast of
Normandy and Brittany, an easy reach from Paris. The program
(see http://tools-conferences.com/europe) includes: 

	- Top keynotes by J. Coplien, B. Meyer, W. Pree, J. Daniels, I. Graham
	- 18 tutorials by leading experts in Enterprise Architecture, Patterns,
	  Components, UML, Java, Embedded Software, and more...
	- 4 workshops, including J. Coplien's two day "Mastery of Patterns"
	  workshop
	- 7 technical sessions by selected industry and academic presenters,
	  architecture panel etc. 
 	- An exciting social program, with a cocktail diner at the famous
	  "La Mere Poulard" restaurant, a visit of the of Mt St Michel Abbey,
	  and a visit and banquet in St Malo.

TOOLS USA will be the most exciting ever. The conference is sponsored by
Microsoft and there will be a special track about Microsoft component
technologies, with Clemens Szyperski and Jim Miller (Microsoft Research)
as keynote speakers. Among the other highlights:

	- Keynotes also include Don Box, Martin Fowler, Kent Beck, Martin
	  Griss and Bertrand Meyer.

	- Panels: Component-Based Development, with Clemens Szyperski 
	  Bertrand Meyer and other panelists, led by Roger Smith of
	  Software Development magazine; the TOOLS language panel; Project
	  Management panel led by Bill Duncan, former Director of Standards 
	  for the Project Management Institute (PMI); Software Technology 
	  for E-commerce panel led by Dennison Bollay, a pioneer in e-commerce 
	  technology ...

	- Workshops: Business Modeling; Refactoring; eXtreme Programming ...

	- Tutorials: the most impressive list ever, from eXtreme Programming
	  to CORBA 3, Refactoring by Martin Fowler, Advanced Microsoft COM
	  technologies, Idiomatic Java by Angelika Langer, Adding value to
	  the Unified Process, JINI, Real-time critical systems, Mobile
	  Agents systems, Use Case Patterns and many more (see
	  http://tools-conferences.com/usa for more details).

	- over 25 technical contributions 

	- Great social program in the gorgeous Santa Barbara area.

We hope to see you at either or both conference. For any information please
consult the Web pages or write to <info@tools-conferences.com>.

From owner-reliable_computing [at] interval [dot] usl.edu  Tue May 16 17:10:10 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id RAA08377
	for reliable_computing-outgoing; Tue, 16 May 2000 17:10:10 -0500 (CDT)
Received: from genie.eecs.lehigh.edu (genie.eecs.lehigh.edu [128.180.98.9])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id RAA08372
	for <reliable_computing [at] interval [dot] usl.edu>; Tue, 16 May 2000 17:10:06 -0500 (CDT)
Received: (from majordom@localhost)
	by genie.eecs.lehigh.edu (8.8.5/8.8.5) id MAA08430
	for asap-announce-outgoing; Tue, 16 May 2000 12:43:56 -0400 (EDT)
X-Authentication-Warning: genie.eecs.lehigh.edu: majordom set sender to owner-asap-announce [at] majordomo [dot] eecs.lehigh.edu using -f
From: ASAP User <asap [at] EECS [dot] Lehigh.EDU>
Date: Tue, 16 May 2000 12:43:51 -0400 (EDT)
Message-Id: <200005161643.MAA29435 [at] pamir [dot] eecs.lehigh.edu>
To: asap-announce [at] EECS [dot] Lehigh.EDU
Subject: [ASAP] Conference Program for ASAP 2000
Cc: mschulte [at] EECS [dot] Lehigh.EDU
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

The program for the IEEE International Conference on Application-Specific 
Systems, Architectures and Processors (ASAP 2000) is now available from the 
conference web page at: 
   http://www.eecs.lehigh.edu/ASAP/

This year's program includes a rich set of topics and outstanding papers
by distinguished authors. Topics covered include video and multimedia 
processors, reconfigurable computing, modeling and synthesis, cryptography, 
digital signal processing, computer arithmetic, multiprocessor systems, 
application-specific architectures, and design methodology. In addition
to thirty-three contributed papers, the conference features a keynote address 
by Dr. William S. Song of MIT Lincoln Laboratory on "High-Performance
Front-End Signal Processors for Adaptive Sensor Arrays". 

The conference web page also has links to 
(1) Conference Registration
(2) Hotel/Travel Information
(3) Airline Travel Information
More information about each of these topics is given below. 

If you have any questions, please send email to asap [at] eecs [dot] lehigh.edu
or mschulte [at] eecs [dot] lehigh.edu. 

We look forward to seeing you at ASAP 2000! 

Best regards, 

Mike Schulte
ASAP 2000 Program Co-chair
-----------------------------------------------------------------------
Conference Registration:

Online conference registration for ASAP'2000 is available from 
   https://secure.computer.org/conf/asap/register.htm
Advance registration fees apply through 19 June 2000. After 19 June, 
late fees will apply. 

If you are unable to access the online registration, please send email
to asap [at] eecs [dot] lehigh.edu, along with your FAX number, and we will send 
you a copy of the registration form. 

-----------------------------------------------------------------------
Hotel/Travel Information: 

ASAP'2000 will be held in the the Fairmont Copley Plaza Hotel, which is
located at 138 St. James Avenue in Boston, Massachusetts. The hotel is
about 30 minutes by taxi, car or shuttle from Boston's Logan International 
Airport. For conference attendees who are flying into  Logan Airport, you can
rent a car, take a taxi (about $25 each way), or take the Back Bay Coach 
Shuttle (about $7.50 each way). Additional information about the hotel,
including a map and directions are available from: 
   http://www.fairmont.com/Hotels/Index_B.html

Room reservations should be made by calling 800-441-1414 or +1-617-267-5300. 
Attendees should reference IEEE Computer Society ASAP when making reservations. 
The cut-off date will be Friday, 9 June 2000 at 5:00 p.m. Eastern time.
Reservations received after 9 June will be accepted by the Hotel on a space 
available basis at the conference rates. The Hotel confirms the following 
special rates for ASAP. 
     Single/Double: $189 
     Suites: $389 

These rates are exclusive of applicable sales/room tax, currently twelve point 
four five (12.45) percent, and are net non-commissionable. These special rates 
will apply at least three (3) days prior to and three (3) days after the 
Meeting dates based on availability to accommodate those who wish to extend 
their visits and these nights will be credited back to the room block.

-----------------------------------------------------------------------
Airline Travel Information:

Conference attendees who plan to fly to the conference may want to
consider flying into the Logan International Airport, since it is about
30 minutes (by car) from the conference hotel.

IEEE Computer Society is pleased to announce that it has been able to
secure a special discount agreement with United Airlines unavailable to
the general public.  A 5% discount off the lowest applicable fare will be
offered ONLY when you or your travel agent call United's toll-free
number 1-800-521-4041 and refer to the Meeting ID Number 538IQ.  A 10% discount
off the unrestricted mid-week coach fares is available when purchased 7
days in advance.  An additional 5% discount will apply when you purchase
your tickets at least 60 days in advance of your travel date.  Discounts
apply on United, Shuttle by United, and United Express.  Dedicated
reservationists are on duty 7 days a week, 7:00am to 12:00 midnight
Eastern time.  Book early to take advantage of promotional fares that give you
the greatest discount.  Mileage Plus members receive full credit for all
miles flown to this meeting.

From owner-reliable_computing [at] interval [dot] usl.edu  Wed May 17 00:04:00 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id AAA09279
	for reliable_computing-outgoing; Wed, 17 May 2000 00:04:00 -0500 (CDT)
Received: from into.nit.spb.ru (ns.nit.spb.ru [212.193.6.225])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id AAA09274
	for <reliable_computing [at] interval [dot] usl.edu>; Wed, 17 May 2000 00:03:54 -0500 (CDT)
Received: from slava.UUCP (uucp@localhost)
	by into.nit.spb.ru (8.8.7/8.8.7) with UUCP id JAA29982
	for reliable_computing [at] interval [dot] usl.edu; Wed, 17 May 2000 09:05:30 +0400 (MSD)
	(envelope-from slava.nit.spb.su!nest [at] slava [dot] nit.spb.su)
Received: by slava.nit.spb.su (dMail for DOS v1.23, 15Jun94);
          Wed, 17 May 2000 08:57:32 +0400
To: reliable_computing [at] interval [dot] usl.edu
Message-Id: <AAyQY8vGr0 [at] slava [dot] nit.spb.su>
Organization: Slava Nesterov
Date: Wed, 17 May 2000 08:57:32 +0400 (MSD)
Reply-To: nest [at] into [dot] nit.spb.su
From: "Slava Nesterov" <nest [at] slava [dot] nit.spb.su>
X-Mailer: dMail [Demos Mail for DOS v1.23]
Subject: new schedule for 2001
Lines: 13
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear colleagues,

I am glad to inform you that in accordance to new agreement with Kluwer
Academic Publishers,  beginning on 2001  issues  of  the  journal  RELIABLE
COMPUTING will  appear each  2 months (6 times per year). In particular,
this means that now we are able to publish papers faster. I think, it is
a good news for our community. The year page limit will be equal to 500
pages approximately.

Sincerely yours,

Slava Nesterov



From owner-reliable_computing [at] interval [dot] usl.edu  Wed May 17 02:05:19 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id CAA09716
	for reliable_computing-outgoing; Wed, 17 May 2000 02:05:19 -0500 (CDT)
Received: from apollon.ito.ecei.tohoku.ac.jp (apollon.ito.ecei.tohoku.ac.jp [130.34.197.37])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id CAA09711
	for <reliable_computing [at] interval [dot] usl.edu>; Wed, 17 May 2000 02:04:52 -0500 (CDT)
Received: from localhost (micrus [130.34.197.15])
	by apollon.ito.ecei.tohoku.ac.jp (8.8.8/3.6W-) with ESMTP id QAA25837;
	Wed, 17 May 2000 16:05:24 +0900 (JST)
To: haskell [at] haskell [dot] org, csl [at] dbai [dot] tuwien.ac.at, prolog-vendors [at] sics [dot] se,
        papm [at] dcs [dot] ed.ac.uk, clp [at] comp [dot] nus.edu.sg, amast [at] cs [dot] utwente.nl,
        ikbs [at] caad [dot] ed.ac.uk, fsdm [at] it [dot] uq.edu.au, rewrting@ens-lyon.fr,
        skeletons [at] dcs [dot] ed.ac.uk, lprolog [at] cis [dot] upenn.edu,
        lics [at] research [dot] bell-labs.com, idss [at] socs [dot] uts.edu.au, forum [at] jsoftware [dot] com,
        dss [at] cs [dot] auc.dk, erlang-questions [at] erlang [dot] org, brics-vip [at] daimi [dot] aau.dk,
        vdm-forum [at] mailbase [dot] ac.uk, nl-kr [at] cs [dot] rpi.edu, ecoopws [at] cui [dot] unige.ch,
        clean-list [at] cs [dot] kun.nl, reliable_computing [at] interval [dot] usl.edu,
        facs [at] lboro [dot] ac.uk, atp_alias [at] cs [dot] jcu.edu.au, prolog-pe [at] bach [dot] ces.cwru.edu,
        clp [at] cis [dot] ohio-state.edu, dantchev [at] brics [dot] dk,
        brimkov.as [at] mozart [dot] emu.edu.tr
cc: miyakawa [at] ito [dot] ecei.tohoku.ac.jp
Subject: IFIP TCS2000
X-Mailer: Mew version 1.94.1 on XEmacs 20.4 (Emerald)
Mime-Version: 1.0
Content-Type: Text/Plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Message-Id: <20000517160014S.miyakawa [at] ito [dot] ecei.tohoku.ac.jp>
Date: Wed, 17 May 2000 16:00:14 +0900
From: Shinya MIYAKAWA <miyakawa [at] ito [dot] ecei.tohoku.ac.jp>
X-Dispatcher: imput version 990905(IM130)
Lines: 627
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

[Apologies for multiple copies]

IFIP TCS2000 PROGRAM AND REGISTRATION INFORMATION
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
--------------------------------------------------------------------------

IFIP International Conference on Theoretical Computer Science 
                   (IFIP TCS2000)
 --- Exploring New Frontiers of Theoretical Informatics ---

 August 17 - 19, 2000

 Aoba Memorial Bldg., Tohoku University, Sendai, Japan

 Further Information about IFIP TCS2000 can be obtained on the Web, at

       http://tcs2000.ito.ecei.tohoku.ac.jp/tcs2000/

 Any inquiry on IFIP TCS2000 Program and Registration may be directed to

       TCS2000 [at] ito [dot] ecei.tohoku.ac.jp

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

PRELIMINARY PROGRAM
^^^^^^^^^^^^^^^^^^^
  [Outline]
   
      AUGUST 16: 15:00 Registration at Sendai Tokyu Hotel till 20:00
                 18:00 Welcome at Sendai Tokyu Hotel till 19:00

      AUGUST 17:  9:30 Opening Session 
                 10:00 Keynote Plenary Talk 1
                 -----------------------------------------
                 11:10 - 17:30  TRACK (1)  ||  TRACK (2) 
                 -----------------------------------------

      AUGUST 18:  9:10 Keynote Plenary Talk 2 
                 -----------------------------------------
                 10:20 - 15:30  TRACK (1)  ||  TRACK (2)
                 -----------------------------------------
                 15:50 Panel Discussion till 17:10
                 -----------------------------------------
                 18:30 Banquet at Sendai Tokyu Hotel

      AUGUST 19:  9:10 Keynote Plenary Talk 3 
                 -----------------------------------------
                 10:20 - 14:20  TRACK (1)  ||  TRACK (2)
                 -----------------------------------------
                 14:30 Closing Session till 14:40
                 -----------------------------------------
                 15:00 Open Lectures till 17:00
                 -----------------------------------------
                 18:30 Japanese Dinner Party till 20:00
                 -----------------------------------------

AUGUST 16 WEDNESDAY
^^^^^^^^^^^^^^^^^^^
  15:00 REGISTRATION at Sendai Tokyu Hotel till 20:00

  18:00 WELCOME with light snack at Sendai Tokyu Hotel till 19:00

AUGUST 17 THURSDAY
^^^^^^^^^^^^^^^^^^
   9:30 OPENING SESSION
        Giorgio Ausiello (TC1 Chair and IFIP TCS2000 Co-Chair)
        Takayasu Ito (IFIP TCS2000 Co-Chair)
  
  10:00 KEYNOTE PLENARY TALK
        Reconciling Two Views of Cryptography (The Computational Soundness 
        of Formal Encryption) 
        Martin Abadi (Bell Labs, Lucent)*, Phillip Rogaway (UC Davis)
           (*: speaker)

  10:50 Break

 [TRACK (1)]

            SESSION (1.1), 11:10 - 12:00

  11:10 Approximation Algorithms for String Folding Problems
        Giancarlo Mauri, Giulio Pavesi

  11:35 An Index for Two Dimensional String Matching Allowing Rotations
        Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen

  12:00 Lunch Break

            SESSION (1.2),  13:30 - 14:20

  13:30 Parallel Edge Coloring of a Tree on a Mesh Connected Computer
        Chang-Sung Jeong, Sung-Up Cho, Sun-Chul Whang, Mi-Young Choi

  13:55 Parallel Approximation Algorithms for Maximum Weighted Matching
        in General Graphs
        Ryuhei Uehara, Zhi-Zhong Chen

  14:20 Break

  14:40 TRACK (1) INVITED TALK
        It is on the Boundary: Complexity Considerations for Polynomial 
        Ideals
        Ernst Mayr (TU Muenchen)

  15:30 Break

            SESSION (1.3), 15:50 - 17:30

  15:50 An Efficient Parallel Algorithm for Scheduling Interval Ordered 
        Tasks
        Yoojin Chung, Kunsoo Park, Hyuk-Chul Kwon

  16:15 Task Distributions on Multiprocessor Systems
        Evgeny V. Shchepin, Nodari N. Vakhania

  16:40 Fast Interpolation using Kohonen Self-Organizing Neural Networks
        Olivier Sarzeaud, Yann Stephan

  17:05 Steganography Using Modern Arts
        Carlo Blundo, Clemente Galdi

  17:30 Break

  -----------//

 [TRACK (2)]

            SESSION (2.1), 11:10 - 12:00

  11:10 Ambient Groups and Mobility Types
        Luca Cardelli, Giorgio Ghelli, Andrew D. Gordon

  11:35 An Asynchronous, Distributed Implementation of Mobile Ambients
        Cedric Fournet, Jean-Jacques Levy, Alan Schmitt

  12:00 Lunch Break

  13:30 TRACK (2) INVITED TALK
        Type Systems for Concurrent Processes: From Deadlock-Freedom to 
        Livelock-Freedom, Time-Boundedness
        Naoki Kobayashi (U. Tokyo)

  14:20 Break

            SESSION (2.2), 14:40 - 15:30

  14:40 Local pi-Calculus at Work: Mobile Objects as Mobile Processes
        Massimo Merro, Josva Kleist, Uwe Nestmann

  15:05 An Interpretation of Typed Concurrent Objects in the Blue Calculus
        Silvano Dal Zilio

  15:30 Break

            SESSION (2.3), 15:50 - 17:30

  15:50 A Higher-Order Specification of the pi-Calculus
        Joelle Despeyroux

  16:15 Open Ended Systems, Dynamic Bisimulation, and Tile Logic
        Roberto Bruni, Ugo Montanari, Vladimiro Sassone

  16:40 Fibred Models of Processes: Discrete, Continuous, and Hybrid Systems
        Marcelo P. Fiore

  17:05 On the Complexity of Bisimulation Problems for Pushdown Automata
        Richard Mayr

  17:30 Break

AUGUST 18 FRIDAY
^^^^^^^^^^^^^^^^
   9:10 KEYNOTE PLENARY TALK
        Theory and Construction of Molecular Computers
        Masami Hagiya (U. Tokyo)

  10:00 Break

 [TRACK (1)]

            SESSION (1.4), 10:20 - 12:00

  10:20 Trade-offs between Density and Robustness in Random Interconnection
        Graphs
        P. Flajolet, K. Hatzis, S. Nikoletseas, P. Spirakis

  10:45 The ($\sigma$+1)-Edge-Connectivity Augmentation Problem without 
        Creating Multiple Edges of a Graph
        Satoshi Taoka, Toshimasa Watababe

  11:10 On the Hardness of Approximating Some NP-optimization Problems 
        Related to Minimum Linear Ordering Problem
        Sounaka Mishra, Kripasindhu Sikdar

  11:35 Maximum Clique and Minimum Clique Partition in Visibility Graphs
        Stephan Eidenbenz, Christoph Stamm

  12:00 Lunch Break

            SESSION (1.5), 13:30 - 14:20

  13:30 Real-Time Language Recognition by Alternating Cellular Automata
        Thomas Buchholz, Andreas Klein, Martin Kutrib

  13:55 Damage Spreading and $\mu$-Sensitivity on Cellular Automata
        Bruno Martin

  14:20 Break

  14:40 TRACK (1) INVITED TALK
        Discrepancy Theory and its Applications to Finance
        Shu Tezuka (IBM Tokyo Research Lab)

  15:30 Break

  -----------//

 [TRACK (2)]

            SESSION (2.4), 10:20 - 12:00

  10:20 A Type-theoretic Study on Partial Continuations
        Yukiyoshi Kameyama

  10:45 Partially Typed Terms between Church-Style and Curry-Style
        Ken-etsu Fujita, Aleksy Schubert

  11:10 Alternating Automata and Logics over Infinite Words
        Christof Loeding, Wolfgang Thomas

  11:35 Hypothesis Support for Information Integration in Four-Valued Logics
        Yann Loyer, Nicolas Spyratos, Daniel Stamate

  12:00 Lunch Break

  13:30 TRACK (2) INVITED TALK
        Masaccio: A Formal Model for Embedded Components
        Thomas A. Henzinger (UC Berkeley)

  14:20 Break

            SESSION (2.5), 14:40 - 15:30

  14:40 A Single Complete Refinement Rule for Demonic Specifications
        Karl Lermer, Paul Strooper

  15:05 Reasoning about Composition using Property Transformers and their 
        Conjugates
        Michel Charpentier, K. Mani Chandy
        
  15:30 Break

  -----------------------
 
  15:50 PANEL DISCUSSION on "New Challenges for TCS"
        Panelists: Giorgio Ausiello (U. Roma "La Sapienza")
                   Jozef Gruska <Co-Chair> (Masaryk U.)
                   Ugo Montanari (U. Pisa)
                   Takao Nishizeki <Co-Chair> (Tohoku U.)
                   Yoshihito Toyama (Tohoku U.)
                   Jiri Wiedermann (Inst. Informatics, Prague)

  17:10 Break

  18:30 BANQUET at Sendai Tokyu Hotel till 20:45
        BANQUET SPEECH
        Non-Random Thoughts about Randomization
        Michael O. Rabin (Harvard U.)

AUGUST 19 SATURDAY
^^^^^^^^^^^^^^^^^^
   9:10 KEYNOTE PLENARY TALK
        List Decoding: Algorithms and Applications
        Madhu Sudan (MIT)

  10:00 Break

 [TRACK (1)]

            SESSION (1.6), 10:20 - 12:00

  10:20 Fully Consistent Extensions of Partially Defined Boolean Functions
        with Missing Bits
        Endre Boros, Toshihide Ibaraki, Kazuhisa Makino

  10:45 Characterization of Optimal Key Set Protocols
        Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki

  11:10 On the Complexity of Integer Programming in the Blum-Shub-Smale
        Computational Model
        Valentin E. Brimkov, Stefan S. Dantchev

  11:35 On Logarithmic Simulated Annealing
        A. Albrecht, C. K. Wong

  12:00 Lunch Break

  13:30 TRACK (1) INVITED TALK
        Hierarchical State Machines
        Mihalis Yannakakis (Bell Labs, Lucent)

  14:20 Break

  -----------//

 [TRACK (2)]

  10:20 TRACK (2) INVITED TALK
        Some New Directions in the Syntax and Semantics of Formal Languages
        Gordon D. Plotkin (Edinburgh U.)

  11:10 Break

  11:20 DEMO SESSION (1) on Verification Tools

  12:00 Lunch Break

  13:30 DEMO SESSION (2) on Verification Tools

  14:20 Break

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

  14:30 CLOSING SESSION till 14:40
        Giorgio Ausiello (TC1 Chair and IFIP TCS2000 Co-Chair) 
        Takayasu Ito (IFIP TCS2000 Co-Chair)

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

 [OPEN LECTURES]

  15:00 On the Power of Interactive Computing
        Jan van Leeuwen (U. Utrecht)*, Jiri Wiedermann (Acad. Sciences, Czech)
           (*: speaker)

  16:00 The Varieties of Programming Language Semantics
        Peter D. Mosses (U. Aarhus)

  17:00 Break

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

  18:30 JAPANESE DINNER PARTY till 20:00

==========================================================================

GENERAL INFORMATION
^^^^^^^^^^^^^^^^^^^

IFIP TCS2000 is the first International Conference on Theoretical Computer 
Science organized by IFIP TC1 on Foundations of Computer Science, and it 
consists of two tracks: TRACK (1) on Algorithms, Complexity and Models of 
Computation, and TRACK (2) on Logic, Semantics, Specification, and 
Verification. The conference proceedings will be published as a volume
of Lecture Notes in Computer Science, Springer-Verlag.

IFIP TCS2000 will be held on the campus of Tohoku University, Sendai, Japan.
The invited talks and contributed talks will be presented at the Aoba 
Memorial Building and Engineering Conference Hall, Faculty of Engineering 
located on the Aoba Hill about 3 km west of downtown Sendai. The conference
welcome reception and banquet will be held at Sendai Tokyu Hotel, located 
at downtown Sendai.

Please, register and make reservations by returning the completed form 
by email and fax, following the instructions below.
There will also be on-site registration at:
   * Sendai Tokyu Hotel, 15:00 - 20:00, August 16
   * Aoba Memorial Bldg., Tohoku Univ., 9:00 - 17:00 on August 17 - 19.

Transportation

Conference participants arriving at the new Tokyo International (Narita) 
Airport are advised to take the JR Narita Express train from Narita Airport
to Tokyo Station. 
Then, take the Yamabiko super express train of Tohoku Shinkansen (Tohoku 
Bullet Train) to Sendai from Tokyo Station. The Yamabiko runs every 20 - 30
min. and takes about 2 hours from Tokyo to Sendai. Making reservation at 
Narita Station for the Yamabiko is recommended, since it will be the summer
tourist season. 
Those arriving at the new Osaka International Airport (Kansai Airport) can
fly to Sendai Airport, and take Limousine Bus service to Sendai Station. 
The bus takes about 30 min. to go from the Airport to Sendai Station. You 
can also take a shuttle bus service from Kansai Airport to the Osaka-Itami 
Airport to fly from there to Sendai Airport. Alternatively, you can take a 
local train from the Kansai Airport to JR Shin Osaka Station, then take the
Tokaido Shinkansen from Osaka to Tokyo Station and change at Tokyo Station 
to Tohoku Shinkansen. 
Some details on transportation will be available on the TCS2000 Web page, at
        http://tcs2000.ito.ecei.tohoku.ac.jp/tcs2000/
Note: 
(1) In Japan, mid-August is the busiest tourist time during summer, 
    including domestic and international flights. 
(2) No flight service is available from Narita to Sendai Airport, since the
    train service is convenient. There is another train service from Narita
    Airport to downtown Tokyo (Ueno) by Skyliner of the Keisei-Narita Line.
    At Ueno you can take the Yamabiko super express of Tohoku Shinkansen to
    Sendai, but you have to walk about 10 min. from Keisei-Ueno Station to 
    JR Ueno Station to take Tohoku Shinkansen.
(3) If you are going to travel in Japan by JR lines before/after the IFIP 
    TCS2000 conference, it will be convenient and economical to get a JR 
    PASS before your departure. Contact your travel agent for more 
    information on JR PASS (Japan Rail Pass).

Hotels

Two hotels are arranged to offer special discount rates to IFIP TCS2000 
participants: Sendai Tokyu Hotel and Sendai Washington Hotel. They are 
1.2 km west of Sendai Station and about 800 Yen by taxi from the station. 
These hotels are located within 5 min. walk from each other. The conference
welcome reception and banquet will be held at Sendai Tokyu Hotel.

Sendai and Climate

Sendai is the largest city in the northern part of the Honshu Island of 
Japan, with a population of about a million. The City is known in Japan 
as "City of Trees". Sendai is a modern, safe city with a temperate climate 
blessed by four distinct seasons; even in mid August it is quite seldom 
that the highest temperature exceeds 30 C (86 F). 
Usually, the weather in mid August would be mostly sunny with temperatures
ranging from 20 C (68 F) to 30 C (86 F), and rain, if any, would rarely be
heavy.
Note: Average temperatures in August at Sendai, Tokyo and Osaka are about 
      23.5 C, 26.5 C and 27.5, respectively.

REGISTRATION AND RESERVATION INFORMATION
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
                                                                            
REGISTRATION FEES

Registration fees cover attendance in all sessions, a copy of the proceedings, 
refreshments, the welcome reception and banquet, but not the Japanese dinner 
party on August 19. The reduced author rate applies to all authors of the 
accepted papers, and the reduced committee member rate applies to all TC1 
members and to all members of the Program Committee and the Organizing 
Committee. The student rate applies to full time students. Registrants paying
reduced rates have full privileges at the conference. The companion rate 
covers the reception and banquet only.

                      Through July 1st, 2000          From July 2nd, 2000 
   Regular                  40,000 Yen                    50,000 Yen
   Author                   30,000 Yen                    40,000 Yen
   Committee Member         30,000 Yen                    40,000 Yen
   Student                  25,000 Yen                    30,000 Yen
   Companion                 5,000 Yen                     7,000 Yen

HOTELS

Two convenient Western Style hotels offer special IFIP TCS2000 discount rates.
Rates are per person, per night, and include service charge and tax (not 
including breakfast).

                                    Single Room           Twin Room
   Sendai Tokyu Hotel               10,500 Yen            8,400 Yen
   Sendai Washington Hotel II        8,400 Yen            7,350 Yen
   Sendai Washington Hotel I         7,350 Yen            ---------

Note: Twin room reservations are available for two persons. No roommate 
      matching service is available, so that twin room reservations remain 
      the registrant's responsibility.
 
JAPANESE DINNER PARTY

A Japanese dinner party for participants from abroad will be arranged at
SHOZANKAN in the evening of August 19. The invited speakers, some Steering
Committee members, PC members and conference organizers will attend. A 
limited number of reservations will be available for this dinner party. 
The rates are as follows.

   Conference registrant:   10,000 Yen
   Companion:                7,000 Yen

=============================================================================
Cut here to send your registration form after filling in the required items.
=============================================================================

IFIP TCS2000 REGISTRATION AND RESERVATION FORM
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^

Please register and make reservations by completing the form below and 
returning it by email to

        tcs02 [at] thk [dot] jtb.co.jp

Registrants are advised to email a copy of their completed form to

        TCS2000 [at] ito [dot] ecei.tohoku.ac.jp

They are also encouraged to send a signed, printed copy of their completed 
form by fax to

        022-262-5002 (domestic)
     +81-22-262-5002 (from abroad)

which is the fax number of the following agent to take care of the conference
registration and reservation.

    JTB (Japan Travel Bureau) Tohoku Communications Inc.
    Kotsukosha Bldg 3F, 3-6-Chuo
    Aoba-Ku, Sendai 980-0021, Japan

    (Fax)   022-262-5002 (domestic)
            +81-22-262-5002 (from abroad)
    (Phone) 022-262-5055 (domestic)
            +81-22-262-5055 (from abroad)
    (Email) tcs02 [at] thk [dot] jtb.co.jp

Registration and reservations will be completed by your payment, whose method
is described below.

IMPORTANT NOTE: As described below, from the standpoint of the safety, 
    registrants are advised to pay fees by Bank Transfer. When the payment is
    made by a credit card, they are advised to send the required information 
    including Credit Card numbers by FAX; that is, do NOT send Credit Card 
    numbers by email.
  
REGISTRATION FOR IFIP TCS2000
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  Last (Family) Name:

  First (Given) Name:

  Middle:

  Affiliation:

  Postal Address:

  City/State/Zip:

  Country:

  Phone:

  Fax:

  Email:

  Registration Status 
    <Regular, Author, Committee Member, Student>:

  Number of Companions:

  Companions' names (if applicable):

  (A) Total Registration Fee(s) in Yen:

HOTEL RESERVATION

  Hotel First Choice:

  Hotel Second Choice:

  Number of Single Room(s):

  Number of Twin Room(s):

  Roommate's Name(s) for Twin Room(s):

  Check-in Date:

  Check-out Date:

  Number of Nights:

  Special Room or other Request:

JAPANESE DINNER PARTY

  A limited number of reservations are available for the Japanese dinner 
  party at SHOZANKAN on August 19 to be arranged for participants from 
  abroad.

  (B) 10,000 Yen x [   ] conference registrant(s):

  (C)  7,000 Yen x [   ] companion(s):

TOTAL FEE IN YEN

  (A) + (B) + (C):

Signature (not needed for email):

METHOD OF PAYMENT FOR IFIP TCS2000

   From the standpoint of the safety and security, participants are encouraged
   to pay via Bank Transfer. When they pay via credit card, they are advised 
   to send the required information (in particular, Credit Card numbers) by 
   FAX; that is, do NOT send your Credit Card numbers by email. 
   In credit card payment Visa card, MasterCard, and Diners card will be 
   accepted. Personal checks cannot be accepted.
   All payments must be made in Japanese Yen.

Indicate method of payment below:

  [    ] Bank Transfer to

              Bank: Tokyo Mitsubishi Bank, Sendai Branch
              Account Name: IFIP TCS2000 Chair Takayasu Ito
              Account No. 1108671  

         From <bank name>:

         Date of transfer:

         Payer's name:

         Note: In Japan the bank number of Tokyo Mitsubishi Bank is 0005, and
               the number of its Sendai Branch is 320.

  [    ] Payment by Credit Card

         Credit Card Type <Visa, MasterCard, or Diners>:

         Card Number:

         Expiration Date:

         Signature (not needed for email):
                                                                              
  <Note>: When your payment is via Credit Card, send the above information
          by FAX to +81-22-262-5002, the fax no. of JTB Communications Inc. 
          Even when you send the above form by fax, send it by EMAIL 
          without  filling in Credit Card number for safety.
          ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Registration and reservations will be confirmed upon receipt of payment.
Refunds will be made upon written request received through July 31st, 2000
by JTB Tohoku Communications Inc.

From owner-reliable_computing [at] interval [dot] usl.edu  Wed May 17 11:37:09 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id LAA11538
	for reliable_computing-outgoing; Wed, 17 May 2000 11:37:09 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id LAA11533
	for <reliable_computing [at] interval [dot] usl.edu>; Wed, 17 May 2000 11:37:04 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.10.1/8.10.1) with SMTP id e4HGatr00313
	for <reliable_computing [at] interval [dot] usl.edu>; Wed, 17 May 2000 10:36:55 -0600 (MDT)
Message-Id: <200005171636.e4HGatr00313 [at] cs [dot] utep.edu>
Date: Wed, 17 May 2000 10:36:56 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: Forte Developer 6 is LIVE! (Fwd)
To: reliable_computing [at] interval [dot] usl.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: XHAxUYS4caWIjgbbzUUd3A==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


------------- Begin Forwarded Message -------------

Date: Wed, 17 May 2000 08:40:12 -0700 (PDT)
From: William Walster <bill.walster [at] Eng [dot] Sun.COM>
Subject: Forte Developer 6 is LIVE! (Fwd)



Dear members of "The Interval Community."

Many people have contributed to this event.  Special thanks to:

	Ray Moore
	Eldon Hansen
	George Corliss
	Baker Kearfott
	Mike Schulte
	Wolfgang Walter
	Dmitri Chiriaev

Please see ==>, below.

Please send comments, and suggestions for improvement to the interval
email alias that has been established for this purpose.

Spread the word!

Best regards,

Bill Walster

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

The Forte Developer 6/Sun WorkShop 6 suite of products has been released 
today electronically, with the physical release following the end of this week.
The release makes available a suite of products:

	Forte C 6
	Forte C++ Personal Edition 6
	Forte C++ Enterprise Edition 6
	Forte TeamWare 6
	Forte Fortran Desktop Edition 6
	Forte for High Performance Computing 6
	Forte University Edition 6 

Go to the following url to find information about these products. Note,
Forte Developer 6 products are available for eTry/eBuy on the SunStore
and the Download Center.

	http://www.sun.com/forte/
	
Here is a summary of what's new in Forte Developer 6:

	- Additional ANSI/ISO C++ compliance
	- Fortran 95 compiler with OpenMP parallelization directives 
        - Support for the UltraSPARCTM III instruction set architecture 
        - Easier-to-use programming environment 
        - New Performance Analysis tool 
==>     - Fortran 95 interval arithmetic 
        - Installation improvements 
        - Manuals, man pages, READMEs, and online help in HTML



------------- End Forwarded Message -------------



From owner-reliable_computing [at] interval [dot] usl.edu  Wed May 17 11:40:01 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id LAA11639
	for reliable_computing-outgoing; Wed, 17 May 2000 11:40:00 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id LAA11628
	for <reliable_computing [at] interval [dot] louisiana.edu>; Wed, 17 May 2000 11:39:54 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.10.1/8.10.1) with SMTP id e4HGdg300346
	for <reliable_computing [at] interval [dot] louisiana.edu>; Wed, 17 May 2000 10:39:48 -0600 (MDT)
Message-Id: <200005171639.e4HGdg300346 [at] cs [dot] utep.edu>
Date: Wed, 17 May 2000 10:39:43 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: Forte Developer 6 is LIVE! (Fwd)
To: reliable_computing [at] interval [dot] louisiana.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: WPwXPPdv0ncdv78GSVRctw==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


------------- Begin Forwarded Message -------------

Date: Wed, 17 May 2000 08:40:12 -0700 (PDT)
From: William Walster <bill.walster [at] Eng [dot] Sun.COM>


Dear members of "The Interval Community."

Many people have contributed to this event.  Special thanks to:

	Ray Moore
	Eldon Hansen
	George Corliss
	Baker Kearfott
	Mike Schulte
	Wolfgang Walter
	Dmitri Chiriaev

Please see ==>, below.

Please send comments, and suggestions for improvement to the interval
email alias that has been established for this purpose.

Spread the word!

Best regards,

Bill Walster

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

The Forte Developer 6/Sun WorkShop 6 suite of products has been released 
today electronically, with the physical release following the end of this week.
The release makes available a suite of products:

	Forte C 6
	Forte C++ Personal Edition 6
	Forte C++ Enterprise Edition 6
	Forte TeamWare 6
	Forte Fortran Desktop Edition 6
	Forte for High Performance Computing 6
	Forte University Edition 6 

Go to the following url to find information about these products. Note,
Forte Developer 6 products are available for eTry/eBuy on the SunStore
and the Download Center.

	http://www.sun.com/forte/
	
Here is a summary of what's new in Forte Developer 6:

	- Additional ANSI/ISO C++ compliance
	- Fortran 95 compiler with OpenMP parallelization directives 
        - Support for the UltraSPARCTM III instruction set architecture 
        - Easier-to-use programming environment 
        - New Performance Analysis tool 
==>     - Fortran 95 interval arithmetic 
        - Installation improvements 
        - Manuals, man pages, READMEs, and online help in HTML



------------- End Forwarded Message -------------



From owner-reliable_computing [at] interval [dot] usl.edu  Fri May 19 07:15:31 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id HAA02267
	for reliable_computing-outgoing; Fri, 19 May 2000 07:15:30 -0500 (CDT)
Received: from desh.cse.iitd.ernet.in (mailer.cse.iitd.ac.in [202.141.68.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id HAA02262
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 19 May 2000 07:15:09 -0500 (CDT)
Received: from cse.iitd.ernet.in (root [at] sanjiva [dot] cse.iitd.ernet.in [10.20.2.48])
	by desh.cse.iitd.ernet.in (8.8.7/8.8.7) with ESMTP id RAA22161;
	Fri, 19 May 2000 17:37:33 +0530
Received: (from sanjiva@localhost)
	by cse.iitd.ernet.in (8.9.3/8.9.3) id IAA07183;
	Sat, 20 May 2000 08:15:05 +0530
Date: Sat, 20 May 2000 08:15:05 +0530
Message-Id: <200005200245.IAA07183 [at] cse [dot] iitd.ernet.in>
X-Authentication-Warning: localhost.localdomain: sanjiva set sender to sanjiva [at] sanjiva [dot] cse.iitd.ernet.in using -f
From: Sanjiva Prasad <sanjiva [at] cse [dot] iitd.ernet.in>
To: skapoor [at] cse [dot] iitd.ernet.in
Subject:  FSTTCS 2000:  revised Call for Papers 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


--text follows this line--

***********************************************************************
*                                                                     *
*                            FST TCS 2000                             *
*                                                                     *
* Foundations of Software Technology and Theoretical Computer Science *
*                        December 13--15, 2000                        *
*                          New Delhi, India                           *
*                                                                     *
***********************************************************************
*                          Call for Papers                            *
***********************************************************************

New:  Electronic Submission Guidelines
      Revised list of Invited Speakers

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

IARCS, the Indian Association for Research in Computing Science,
announces the 20th Annual FST TCS Conference in New Delhi.
Tentatively planned satellite events include include two workshops: on
Computational Geometry and on Advances in Programming Languages.

Authors are invited to submit papers presenting original and
unpublished research on **any** theoretical aspects of Computer
Science. Papers in applied areas with a strong foundational emphasis
are also welcome.  The proceedings of the last six years' conferences
(Springer-Verlag Lecture Notes in Computer Science volumes 880, 1026,
1180, 1346, 1530, 1738) give an idea of the kind of papers typically
presented at FST TCS.  Typical areas include (but are not restricted to):

         Automata, Languages and Computability 
         Randomized and Approximation Algorithms 
         Computational Geometry
         Computational Biology
         Combinatorial Optimization
         Graph and Network Algorithms 
         Complexity Theory 
         Parallel and Distributed Computing 
         New Models of Computation
         Concurrent, Real-time and Hybrid Systems 
         Logics of Programs and Modal Logics
         Database Theory  and Information Retrieval
         Automated Reasoning, Rewrite Systems, and Applications 
         Logic, Proof Theory, Model Theory and Applications
         Semantics of Programming Languages
         Static Analysis and  Type Systems
         Theory of Functional and Constraint-based Programming 
         Software Specification and Verification 
         Cryptography and Security Protocols


For an accepted paper to be included in the proceedings, one of 
the authors must commit to presenting the paper at the conference.

Important Dates
---------------
  Deadline for Submission                             31 May, 2000
  Notification to Authors                             15 August, 2000
  Final Version of Accepted Papers due                15 September, 2000
  Deadline for Early Registration	       		15 November, 2000 


Submission Guidelines
- ---------------------
Authors may submit drafts of full papers or extended abstracts.
Submissions are limited to 12 A4-size pages, with 1.5 inch top
margin and other margins 1 inch wide with 11 point or larger font.  
Authors who feel that more details are necessary may include a 
clearly marked appendix which will be read at the discretion of 
the Programme Committee.  Each paper should contain a short abstract.  
If available, e-mail addresses and fax numbers of the authors should 
be included.

Electronic Submissions
- --------------------

Electronic submission is very strongly encouraged.  

You may submit your paper using Rich Gerber's system START by visiting
the URL for the conference and following the appropriate links.
The URL for submissions is

    http://www.cse.iitd.ernet.in/~fsttcs20/START/www/submit.html

In case you ar eunable to submit using START, self-contained uuencoded
gzipped Postscript versions of the paper may be sent by e-mail to

		    fsttcs20 [at] cse [dot] iitd.ernet.in

In addition, the following information in ASCII format should be 
sent to this address in a **separate** e-mail: Title; authors; 
communicating author's name, address, and e-mail address and 
fax number if available; abstract of paper.

Hard-Copy Submissions
- ---------------------
If electronic submission is not possible, authors may submit five 
(5) hard-copies of the paper by post to the following address:

		    FST TCS 2000
		    Department of Computer Science  and Engineering 
		    I.I.T., Delhi 
		    Hauz Khas
		    New Delhi 110 016
		    INDIA

Invited Speakers
----------------
Invited Speakers who have confirmed participation include:
 Peter Buneman (U Penn)
 Bernard Chazelle (Princeton)
 E. Allen Emerson (U Texas, Austin)
 Martin Groetschel (ZIB)
 Jose Meseguer (SRI)
 Philip Wadler (Bell Labs)


Programme Committee
-------------------

Pankaj Agarwal		(Duke)
Manindra Agrawal	      (IIT, Kanpur)		
Tetsuo Asano		(JAIST)
Vijay Chandru		(IISc, Bangalore)
Rance Cleaveland	      (Stony Brook)		
Anuj Dawar		      (Cambridge)			
Sampath Kannan		(AT&T Research)
Sanjiv Kapoor		(IIT, Delhi)		(Co-chair)
Kamal Lodaya		(IMSc, Chennai)		
Madhavan Mukund		(CMI, Chennai)		
Gopalan Nadathur	      (Loyola)			
Seffi Naor		      (Bell Labs and Technion)
Tobias Nipkow		(TU Munich)			
Luke Ong		      (Oxford)			
C. Pandu Rangan		(IIT, Chennai)
Paritosh Pandya		(TIFR)		
Benjamin Pierce		(U Penn)			
Sanjiva Prasad		(IIT, Delhi)		(Co-chair)		
Sridhar Rajagopalan     (IBM, Almaden)
Abhiram Ranade	      (IIT, Mumbai)
Dave Sands		      (Chalmers)	
A Prasad Sistla		(U Illinois, Chicago)	
Michiel Smid		(Magdeburg)
Mandayam K. Srivas	(SRI) 


Organized by
------------
Indian Institute of Technology, Delhi
Hauz Khas, New Delhi 100 016. 



Organizing Committee
-------------------
Sandeep Sen			(chair)
Naveen Garg			(treasurer)
S N Maheshwari

Conference Site
---------------
The Conference will take place at the India International Centre,
40 Lodhi Estate, Max Mueller Marg, New Delhi 110 003.

Correspondence Address
----------------------
All correspondence regarding submissions may be addressed to 

    FST TCS 2000
    Department of Computer Science  and Engineering 
    I.I.T., Delhi
    Hauz Khas, 
    New Delhi 110 016, INDIA

    Email:	  fsttcs20 [at] cse [dot] iitd.ernet.in
    Fax:	  +91 11 686 8765
    Phone:	  +91 11 659 1294 / 659 1286
    URL:	  http://www.cse.iitd.ernet.in/~fsttcs20






-- 


				    Sanjiva Prasad
				 Associate Professor

Department of Computer Science and Engineering		sanjiva [at] cse [dot] iitd.ernet.in
Indian Institute of Technology, Delhi			(Off) +91 11 659 1294
Hauz Khas, New Delhi 110016					(Res) +91 11 659 1684
INDIA									(Fax) +91 11 686 8765

		    http://www.cse.iitd.ernet.in/~sanjiva

From owner-reliable_computing [at] interval [dot] usl.edu  Mon May 22 07:09:05 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id HAA06370
	for reliable_computing-outgoing; Mon, 22 May 2000 07:09:05 -0500 (CDT)
Received: from mailhost.uni-koblenz.de (mailhost.uni-koblenz.de [141.26.64.1])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id HAA06365
	for <reliable_computing [at] interval [dot] usl.edu>; Mon, 22 May 2000 07:09:00 -0500 (CDT)
Received: from nostromo.uni-koblenz.de.uni-koblenz.de (peter [at] nostromo [dot] uni-koblenz.de [141.26.66.122])
	by mailhost.uni-koblenz.de (8.9.3/8.9.3) with SMTP id OAA23918;
	Mon, 22 May 2000 14:02:20 +0200 (MET DST)
From: Peter Baumgartner <peter@uni-koblenz.de>
MIME-Version: 1.0
Content-Type: text/plain; charset=iso-8859-1
Content-Transfer-Encoding: 8bit
Message-ID: <14633.8642.599242.823009 [at] nostromo [dot] uni-koblenz.de>
Date: Mon, 22 May 2000 14:02:10 +0200 (CEST)
Subject: FTP 2000 and TABLEAUX 2000 - Call for Participation
X-Mailer: VM 6.75 under 21.1 (patch 8) "Bryce Canyon" XEmacs Lucid
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

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

    FTP 2000 and TABLEAUX 2000      

    Call for Participation

    University of St Andrews
    St Andrews, Scotland

    July 3-7, 2000

    FTP 2000:      http://www.uni-koblenz.de/ftp00/
    TABLEAUX 2000: http://www-theory.dcs.st-and.ac.uk/~rd/tab2000/

---------------------------------------------------------------------
Contents:

	1 - Scope
	2 - Registration
	3 - Contact
	4 - Technical Program (including list of accepted contributions)

---------------------------------------------------------------------
1 - Scope

FTP 2000 (First-Order Theorem Proving), July 3-5, is the third in a
series of workshops intended to focus effort on First-Order Theorem
Proving as a core theme of Automated Deduction, and to provide a forum
for presentation of very recent work and discussion of research in
progress.

TABLEAUX 2000, July 4-7, is a continuation of international meetings
on Automated Reasoning with Analytic Tableaux and Related Methods held
since 1992.  The conference brings together researchers interested in
all aspects - theoretical foundations, implementation techniques,
systems development and applications - of the mechanization of
reasoning with tableaux and related methods.

FTP 2000 is held in conjunction with TABLEAUX 2000. The FTP 2000 and
TABLEAUX 2000 sessions will be partly in series, partly shared and
partly in parallel.

---------------------------------------------------------------------
2 - Registration

To register for FTP 2000 and/or TABLEAUX 2000 please use the online
registration form at http://www.dcs.st-and.ac.uk/~tab2000/register.html

Joint registration at reduced rate is possible.
Early registration ends at May, 31.

---------------------------------------------------------------------
3 - Contact

FTP 2000 related:      ftp00 [at] cs [dot] uiowa.edu
TABLEAUX 2000 related: rd [at] dcs [dot] st-and.ac.uk
Local Organisation:    rd [at] dcs [dot] st-and.ac.uk

---------------------------------------------------------------------
4 - Technical Program

FTP 2000 and TABLEAUX 2000 schedule:   
   http://www.dcs.st-and.ac.uk/~tab2000/schedule.html


Invited Talks
-------------

    FTP 2000                            TABLEAUX 2000
    --------                            -------------
    David Crocker                       Melvin Fitting (CUNY) 
    (Intelligent Micro                  Modality and Databases 
     Software Ltd)
    First Order Theorem  Proving 
    in Software Verification  

    Deepak Kapur (New Mexico)           Alasdair Urquhart (Toronto) 
    'Hardware Verification'             Local Symmetries in 
    (exact title to be announced)	Propositional Logic


                 Franz Baader (Aachen)
                 (Joint invited speaker) 
                 Tableau Algorithms for 
		 Description Logics 

      
FTP 2000 accepted contributions:
--------------------------------

J. Avenhaus, T. Hillenbrand, B. Loechner 
    On Using Ground Joinable Equations in Equational Theorem Proving 
      
Johan Belinfante 
    The Unifying Concept of Subvariance 
      
Domenico Cantone 
    The decision problem in graph theory with reachability related
    constructs
      
Michael Dierkes 
    Defining a Unique Herbrand Model for Sets of Guarded Clauses
      
Lilia Georgieva, Ullrich Hustadt, Renate A. Schmidt 
    Hyperresolution for Guarded Formulae
      
Martin Giese 
    A First-Order Simplification Rule with Constraints
      
Koji Iwanuma, Katsumi Inoue, Ken Satoh 
    Completeness of Pruning Methods for Consequence Finding Procedure
    SOL
      
James J. Lu, Jeffrey S. Rosenthal, Andrew Shaffer 
    Crossword Puzzles: A Case Study in Compute-Intensive
    Meta-Reasoning
      
Nicolas Peltier 
    Combining Resolution and Enumeration for Finite Model Building
      
Reinhard Pichler 
    Equational Problems over a Finite Domain 
      
Regimantas Pliuskevicius 
    On \omega­decidability for a restricted FTL with Unless
      
J.-L. Ruiz-Reina, J.-A. Alonso, M.-J. Hidalgo, F. Martin 
    A mechanical proof of Knuth-Bendix critical pair theorem (using
    ACL2)
      
Nicolas Peltier 
    Model Building with Ordered Resolution
      
Cesare Tinelli 
    Cooperation of Background Reasoners in Theory Reasoning by Residue
    Sharing
      
Bernhard Gramlich 
    Extending First-Order Unification by Tractable Second-Order
    Features
      
Kahlil Hodgson, John Slaney 
    Semantic Guidance for Saturation­Based Theorem Proving
      
Bernhard Beckert 
    Depth­first Proof Search without Backtracking for Free Variable
    Clausal Tableaux
      
Jens Otten, Wolfgang Bibel 
    leanCoP: Lean Connection­Based Theorem Proving (system
    description)

Position Papers

Chris Fermueller 
    Automated Model Building for Non-Classical Logics
      
Martin Giese
    Proof Search without Backtracking using Instance Streams 
      
Markus Moschner 
    Towards Finite Model Building for Propositional Gödel-Logics
      

TABLEAUX 2000 accepted contributions
------------------------------------

Comparison of Theorem Provers for non-classical logics:

Fabio Massacci and Francesco M. Donini
    Design and results of TANCS-2000 non-classical (modal) systems
    comparison

Volker Haarslev and Ralf Möller
    Consistency testing: the RACE experience

Ian Horrocks
    Benchmark analysis with FaCT


Ullrich Hustadt and Renate Schmidt
    MSPASS Modal reasoning by translation and first-order resolution


Peter F. Patel-Schneider
    TANCS-2000 results for DLP


Armando Tacchella
    Evaluating *SAT on TANCS 2000 benchmarks


Research Papers:

Alberto Artosi, Guido Governatori and Antonino Rotolo
    A labelled tableau calculus for nonmonotonic (cumulative)
    consequence relations

Arnon Avron
    A tableau system for Gödel-Dummett logic based on a hypersequent
    calculus

Matthias Baaz, Christian Fermüller and Helmut Veith
    An analytic calculus for quantified propositional Gödel logic

Diderik Batens and Joke Meheus
    A tableau method for inconsistency-adaptive logics

Domenico Cantone and Calogero G. Zarba
    A tableau calculus for integrating first-order reasoning with
    elementary set theory reasoning

Agata Ciabattoni and Mauro Ferrari
    Hypertableau and path-hypertableau calculi for some families of
    intermediate logics

Marta Cialdea Mayer and Serenella Cerrito
    Variants of first-order modal logics

Stéphane Demri
    Complexity of simple dependent bimodal logics

Uwe Egly
    Properties of Embeddings from Int to S4

Melvin Fitting, Lars Thalmann and Andrei Voronkov
    Term-modal logics

Enrico Giunchiglia and Armando Tacchella
    A subset-matching size-bounded cache for satisfiability in modal
    logics

Rajeev Goré
    Dual intuitionistic logic revisited

Ray Gumb
    Model sets in a nonconstructive logic of partial terms with
    definite descriptions

Ortrun Ibens
    Search space compression in connection tableau calculi using
    disjunctive constraints

Christoph Kreitz and Brigitte Pientka
    Matrix-based inductive theorem proving

Pedro J. Martín and Antonio Gavilanes
    Monotonic preorders for free variable tableaux

Maarten Marx, Szabolcs Mikulás and Mark Reynolds
    The mosaic method for temporal logics

Linh Anh Nguyen
    Sequent-like tableau systems with the analytic superformula
    property for the modal logics KB, KDB, K5, KD5

David Pearce, Inmaculada P. de Guzmán and Agustín Valverde
    A tableau calculus for equilibrium entailment

Carla Piazza and Alberto Policriti
    Towards tableau-based decision procedures for non-well-founded
    fragments of set theory

Riccardo Rosati
    Tableau calculus for only knowing and knowing at most

Stephan Schmitt
    A tableau-like representation framework for efficient proof
    reconstruction

Dan Willard
    The semantic tableaux version of the second incompleteness theorem
    extends almost to Robinson's arithmetic Q

System Descriptions:

Joachim Draeger
    Redundancy-free lemmatization in the automated model-elimination
    theorem prover AI-SETHEO


Gernot Stenz and Andreas Wolf
    E-SETHEO: An automated3 theorem prover

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

--
Peter Baumgartner                         
phone: +49 261  287 2777    mail: peter@uni-koblenz.de
fax:   +49 261  287 2731    WWW:  http://www.uni-koblenz.de/~peter/




From owner-reliable_computing [at] interval [dot] usl.edu  Wed May 24 11:19:16 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id LAA10589
	for reliable_computing-outgoing; Wed, 24 May 2000 11:19:16 -0500 (CDT)
Received: from animal.cs.chalmers.se (root [at] animal [dot] cs.chalmers.se [129.16.225.30])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id LAA10584
	for <reliable_computing [at] interval [dot] usl.edu>; Wed, 24 May 2000 11:18:53 -0500 (CDT)
Received: from muppet70.cs.chalmers.se (muppet70.cs.chalmers.se [129.16.226.211])
	by animal.cs.chalmers.se (8.8.5/8.8.5) with ESMTP id SAA24453;
	Wed, 24 May 2000 18:13:39 +0200 (MET DST)
Received: from localhost (taha@localhost)
	by muppet70.cs.chalmers.se (8.8.5/8.8.5) with ESMTP id SAA04782;
	Wed, 24 May 2000 18:13:38 +0200 (MET DST)
X-Authentication-Warning: muppet70.cs.chalmers.se: taha owned process doing -bs
Newsgroups: comp.lang.ml,comp.lang.functional,comp.compilers,comp.lang.scheme
Date: Wed, 24 May 2000 18:13:34 +0200 (MET DST)
From: Walid Taha <taha [at] cs [dot] chalmers.se>
Reply-To: saig [at] cs [dot] chalmers.se
To: appsem [at] cs [dot] chalmers.se, concurrency [at] cwi [dot] nl, theorynt [at] listserv [dot] nodak.edu,
        types [at] cis [dot] upenn.edu, haskell [at] haskell [dot] org, ecoop-info [at] ecoop [dot] org,
        seworld [at] cs [dot] colorado.edu, pept [at] venus [dot] is.s.u-tokyo.ac.jp
Subject: SAIG Deadline Extended to June 5th
In-Reply-To: <Pine.SOL.4.21.0005081315570.4048-100000 [at] muppet70 [dot] cs.chalmers.se>
Message-ID: <Pine.SOL.4.21.0005241809050.1710-100000 [at] muppet70 [dot] cs.chalmers.se>
References: <Pine.SOL.4.21.0005081315570.4048-100000 [at] muppet70 [dot] cs.chalmers.se>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


                             DEADLINE EXTENDED

                 Semantics, Applications and Implementation 
                       of Program Generation (SAIG)

                ( http://www.md.chalmers.se/~taha/saig/ )

              ICFP Workshop, Montreal, September 20th, 2000.  

              NEW DEADLINE:  June 5th, 2000 is final and firm.

Numerous recent studies investigate different aspects of program
generation systems, including their semantics, their applications, and
their implementation.  Existing theories and systems address both
high-level (source) language and low-level (machine) language generation.  
A number of programming languages now supports program generation and
manipulation, with different goals, implementation techniques, and
targeted at different applications. The goal of this workshop is to
provide a meeting place for researchers and practitioners interested in
this research area, and in program generation in general.

Scope:  The workshop solicits submissions related to one or more of the
following topics:

   * Multi-level and multi-stage languages, staged computation,
   * Partial evaluation (of e.g. functional, logical, imperative
     programs),
   * Run-time specialization (in e.g. compilers, operating systems),
   * High-level program generation (applications, foundations,
     environments),
   * Symbolic computation, in-lining and macros,

Submissions are especially welcome if they relate ideas and concepts from
several topics, bridge the gap between theory and practice, cover new
ground, or report exciting applications. The program committee will be
happy to advise on the appropriateness of a particular subject.

Distribution:  Accepted papers will be published as a Chalmers technical
report, and will be made available online.  A special issue of the Journal
of Higher Order and Symbolic Computation (HOSC) is planned afterwards.

Format:  The one-day workshop will contain slots for participants to
present accepted papers. In addition, there will be time allocated for
open discussions during the workshop.  Invited speakers will be announced
in the near future.

Invited Speakers:

   * Gilles Muller, IRISA
   * Dick Kieburtz, OGI
   * Frank Pfenning, CMU

Submission Details:  Authors are invited to submit papers of at most 5000
words (excluding figures), in postscript format (letter or A4), to
saig [at] cs [dot] chalmers.se by June 5th 2000. Both position and technical papers
are welcome.  Please indicate at time of submission. Position papers are
expected to describe ongoing work, future directions, and/or survey
previous results.  Technical papers are expected to contain novel results.  
All papers will be reviewed by the program committee for the above
mentioned criteria, in addition to correctness and clarity.  Authors will
be notified of acceptance by 3 July 2000.  Final version of the papers
must be submitted by 31 July 2000.

Program Committee:

   Cliff Click, Sun Micro Systems
   Rowan Davies, CMU
   Torben Mogensen, DIKU
   Suresh Jagannathan, NEC Research
   Tim Sheard, OGI
   Walid Taha, Chalmers (workshop chair)
   Peter Thiemann, Freiburg



From owner-reliable_computing [at] interval [dot] usl.edu  Tue May 30 07:41:45 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id HAA18837
	for reliable_computing-outgoing; Tue, 30 May 2000 07:41:45 -0500 (CDT)
Received: from desh.cse.iitd.ernet.in (IDENT:root [at] mailer [dot] cse.iitd.ac.in [202.141.68.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id HAA18832
	for <reliable_computing [at] interval [dot] usl.edu>; Tue, 30 May 2000 07:41:34 -0500 (CDT)
Received: from cse.iitd.ernet.in (root [at] sanjiva [dot] cse.iitd.ernet.in [10.20.2.48])
	by desh.cse.iitd.ernet.in (8.8.7/8.8.7) with ESMTP id RAA06448;
	Tue, 30 May 2000 17:54:14 +0530
Received: (from sanjiva@localhost)
	by cse.iitd.ernet.in (8.9.3/8.9.3) id RAA02069;
	Tue, 30 May 2000 17:44:10 +0530
Date: Tue, 30 May 2000 17:44:10 +0530
Message-Id: <200005301214.RAA02069 [at] cse [dot] iitd.ernet.in>
X-Authentication-Warning: localhost.localdomain: sanjiva set sender to sanjiva [at] sanjiva [dot] cse.iitd.ernet.in using -f
From: Sanjiva Prasad <sanjiva [at] cse [dot] iitd.ernet.in>
To: skapoor [at] cse [dot] iitd.ernet.in
Subject:  FST TCS 2000: One week extension on the submission deadline 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


Anticipating down time at our site, and to give interested authors
the benefit of a weekend, we are extending the deadline for submission
to June 6, 2000.  We also encourange authors to submit using the
START program that can be accessed from the home page of the
FST TCS 2000 conference 
    http://www.cse.iitd.ernet.in/fsttcs20



***********************************************************************
*                                                                     *
*                            FST TCS 2000                             *
*                                                                     *
* Foundations of Software Technology and Theoretical Computer Science *
*                        December 13--15, 2000                        *
*                          New Delhi, India                           *
*                                                                     *
***********************************************************************
*                          Call for Papers                            *
***********************************************************************

Submission Guidelines
- ---------------------
Authors may submit drafts of full papers or extended abstracts.
Submissions are limited to 12 A4-size pages, with 1.5 inch top
margin and other margins 1 inch wide with 11 point or larger font.  
We advise authors to employ Springer-Verlag's LNCS style file "llncs.sty".
Authors who feel that more details are necessary may include a 
clearly marked appendix which will be read at the discretion of 
the Programme Committee.  Each paper should contain a short abstract.  
If available, e-mail addresses and fax numbers of the authors should 
be included.

Electronic Submissions
- --------------------

Electronic submission is very strongly encouraged.  

You may submit your paper using Rich Gerber's system START by visiting
the URL for the conference and following the appropriate links.
The URL for submissions is

    http://www.cse.iitd.ernet.in/~fsttcs20/START/www/submit.html

In case you ar eunable to submit using START, self-contained uuencoded
gzipped Postscript versions of the paper may be sent by e-mail to

		    fsttcs20 [at] cse [dot] iitd.ernet.in

In addition, the following information in ASCII format should be 
sent to this address in a **separate** e-mail: Title; authors; 
communicating author's name, address, and e-mail address and 
fax number if available; abstract of paper.

Hard-Copy Submissions
- ---------------------
If electronic submission is not possible, authors may submit five 
(5) hard-copies of the paper by post to the following address:

		    FST TCS 2000
		    Department of Computer Science  and Engineering 
		    I.I.T., Delhi 
		    Hauz Khas
		    New Delhi 110 016
		    INDIA


-- 


				    Sanjiva Prasad
				 Associate Professor

Department of Computer Science and Engineering		sanjiva [at] cse [dot] iitd.ernet.in
Indian Institute of Technology, Delhi			(Off) +91 11 659 1294
Hauz Khas, New Delhi 110016					(Res) +91 11 659 1684
INDIA									(Fax) +91 11 686 8765

		    http://www.cse.iitd.ernet.in/~sanjiva

From owner-reliable_computing [at] interval [dot] usl.edu  Mon Jun  5 23:30:04 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id XAA28302
	for reliable_computing-outgoing; Mon, 5 Jun 2000 23:30:03 -0500 (CDT)
Received: from mmrc.iss.ac.cn (IDENT:ascm@[159.226.47.205])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id XAA28297
	for <reliable_computing [at] interval [dot] usl.edu>; Mon, 5 Jun 2000 23:29:47 -0500 (CDT)
Received: (from ascm@localhost)
	by mmrc.iss.ac.cn (8.9.3/8.9.3) id MAA28472
	for reliable_computing [at] interval [dot] usl.edu; Tue, 6 Jun 2000 12:36:58 +0800
Date: Tue, 6 Jun 2000 12:36:58 +0800
From: ASCM <ascm [at] mmrc [dot] iss.ac.cn>
Message-Id: <200006060436.MAA28472 [at] mmrc [dot] iss.ac.cn>
To: reliable_computing [at] interval [dot] usl.edu
Subject: ASCM
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


Please find the updated information on ASCM'2000.

I apologize to those who might receive duplicate copies of this note.

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

   ASCM '2000 - 4th Asian Symposium on Computer Mathematics
        (Chiang Mai, Thailand, December 17-21, 2000)

* Invited speakers: 

            Gaston H. Gonnet (ETH Zurich, Switzerland)
            Daniel Lazard (Universite Paris VI, France)
            William McCune (Argonne National Laboratory, USA)

* The Proceedings of ASCM '2000 will be published by World Scientific, 
  Singapore/River Edge.

* Deadline for submission of papers: June 30, 2000

* Further information: http://www.mmrc.iss.ac.cn/~ascm/ 
                       ascm [at] mmrc [dot] iss.ac.cn



From owner-reliable_computing [at] interval [dot] usl.edu  Tue Jun  6 04:50:51 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id EAA29636
	for reliable_computing-outgoing; Tue, 6 Jun 2000 04:50:51 -0500 (CDT)
Received: from visla.utia.cas.cz (root [at] visla [dot] utia.cas.cz [147.231.12.1])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id EAA29631
	for <reliable_computing [at] interval [dot] usl.edu>; Tue, 6 Jun 2000 04:50:45 -0500 (CDT)
Received: from [147.231.11.66] (klicava.site.cas.cz [147.231.11.66])
	by visla.utia.cas.cz (8.9.3/8.9.3) with SMTP id LAA06497
	for <reliable_computing [at] interval [dot] usl.edu>; Tue, 6 Jun 2000 11:50:28 +0200 (METDST)
X-NUPop-Charset: IBM 8-Bit
Date: Tue, 6 Jun 00 11:44:29 CET  
From: "Jiri Rohn" <rohn [at] uivt [dot] cas.cz>
Reply-To: rohn [at] uivt [dot] cas.cz
Message-Id: <42271.rohn [at] uivt [dot] cas.cz>
To: reliable_computing [at] interval [dot] usl.edu
Subject: preconditioning and overestimation
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

% Dear colleagues,
% I have recently found an example which shows that for arbitrarily small
% data widths, preconditioning of a linear interval system by midpoint
% inverse may cause a 100% overestimation in some component of the interval
% hull even in case n=4 and for strongly regular interval matrices.
% The example is described in the appended LaTeX file.
% Best regards,
%
% Jiri Rohn


\documentstyle[12pt,a4]{article}
\pagestyle{empty}
\begin{document}
\newcommand{\eps}{\varepsilon}
\noindent For an arbitrary $\eps>0$, consider a linear interval system
$${\bf A}x={\bf b} \eqno{(1)}$$
where
$${\bf A}=\left(\begin{array}{cccc}
{\eps}^2&{[-\eps,\eps]}&{[-\eps,\eps]}&{[-\eps,\eps]}\\
0&1&-3&-3\\
0&-3&1&-3\\
0&-3&-3&1
\end{array}\right)\quad{\rm and}\quad
{\bf b}=\left(\begin{array}{c}
0\\{[-\eps,\eps]}\\{[-\eps,\eps]}\\{[-\eps,\eps]}
\end{array}\right),$$
and the preconditioned system
$$(A_c^{-1}\cdot {\bf A})x=A_c^{-1}\cdot {\bf b}, \eqno{(2)}$$
where $A_c$ is the midpoint of ${\bf A}$ and ``$\cdot$'' denotes
multiplication in interval arithmetic. The interval matrix ${\bf A}$ is
strongly regular ($\varrho=0$). Let $[\underline x,\overline x]$
be the interval hull of the solution set of (1), and $[\underline{\underline x},
\overline{\overline x}]$ the interval hull of the solution set of (2).
Then there holds:
\vspace*{1.5ex}

{\bf Proposition.} {\it We have
$$\overline x=\left(\begin{array}{c}
0.6\\0.4\eps\\0.4\eps\\0.4\eps
\end{array}\right),\qquad
\overline{\overline x}=\left(\begin{array}{c}
1.2\\0.4\eps\\0.4\eps\\0.4\eps
\end{array}\right)$$
and $\underline x=-\overline x$, $\underline{\underline
x}=-\overline{\overline x}$.}
\vspace*{1.5ex}

The {\it proof} can be done by direct, though tedious, computation along the
lines of the proof of the main result of my paper in Reliable Computing
3(1997), 363-368. In particular,
$${\overline{\overline x}}_1=2{\overline x}_1,$$
hence in this example preconditioning causes a $100\%$ overestimation of
${\overline x}_1$
{\bf independently of} $\eps$ {\bf (!)}.
\vspace*{1.5ex}

That means, any enclosure method based on midpoint inverse preconditioning
may yield, for arbitrarily small data widths, an overestimation $\geq 100\%$
in some entry even in case $n=4$ and for strongly regular interval matrices.

\end{document}

From owner-reliable_computing [at] interval [dot] usl.edu  Tue Jun  6 09:22:48 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id JAA00485
	for reliable_computing-outgoing; Tue, 6 Jun 2000 09:22:47 -0500 (CDT)
Received: from marnier.ucs.usl.edu (root@ucs-gw.usl.edu [130.70.40.2])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id JAA00480
	for <reliable_computing [at] interval [dot] usl.edu>; Tue, 6 Jun 2000 09:22:45 -0500 (CDT)
Received: from u8174 (rbk5287 [at] goedel [dot] usl.edu [130.70.49.203])
	by marnier.ucs.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.4) with SMTP id JAA09036;
	Tue, 6 Jun 2000 09:22:30 -0500 (CDT)
Message-Id: <2.2.32.20000606142052.0076faf0 [at] pop [dot] usl.edu>
X-Sender: rbk5287 [at] pop [dot] usl.edu
X-Mailer: Windows Eudora Pro Version 2.2 (32)
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Date: Tue, 06 Jun 2000 09:20:52 -0500
To: rohn [at] uivt [dot] cas.cz, reliable_computing [at] interval [dot] usl.edu
From: "R. Baker Kearfott" <rbk [at] louisiana [dot] edu>
Subject: Re: preconditioning and overestimation
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Jiri,

That's very interesting.  I'll see if I can check out my 
width-optimal preconditioner on this example.

By the way, I'll be in Dresden for the first two weeks in July.

Best regards,

Baker

At 11:44 AM 6/6/00 CET, Jiri Rohn wrote:
>% Dear colleagues,
>% I have recently found an example which shows that for arbitrarily small
>% data widths, preconditioning of a linear interval system by midpoint
>% inverse may cause a 100% overestimation in some component of the interval
>% hull even in case n=4 and for strongly regular interval matrices.
>% The example is described in the appended LaTeX file.
>% Best regards,
>%
>% Jiri Rohn
>


---------------------------------------------------------------
R. Baker Kearfott,    rbk [at] louisiana [dot] edu   (337) 482-5346 (fax)
(337) 482-5270 (work)                     (337) 981-9744 (home)
URL: http://interval.louisiana.edu/kearfott.html
Department of Mathematics, University of Louisiana at Lafayette
Box 4-1010, Lafayette, LA 70504-1010, USA
---------------------------------------------------------------


From owner-reliable_computing [at] interval [dot] usl.edu  Tue Jun  6 10:08:19 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA00917
	for reliable_computing-outgoing; Tue, 6 Jun 2000 10:08:19 -0500 (CDT)
Received: from disi.unige.it (mailhost.disi.unige.it [130.251.61.19])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA00907
	for <reliable_computing [at] interval [dot] usl.edu>; Tue, 6 Jun 2000 10:06:02 -0500 (CDT)
Received: from [130.251.61.155] (reggio [130.251.61.155])
 by disi.unige.it (8.8.8/8.8.8) with SMTP id QAA08437;
 Tue, 6 Jun 2000 16:06:08 +0200 (MET DST)
Date: Tue, 6 Jun 2000 16:06:08 +0200 (MET DST)
Message-Id: <200006061406.QAA08437 [at] disi [dot] unige.it>
Mime-Version: 1.0
Content-Type: text/plain; charset="iso-8859-1"
To: etaps2001 [at] disi [dot] unige.it
From: etaps2001 [at] disi [dot] unige.it (Etaps 2001)
Subject: ETAPS 2001: FIRST ANNOUNCEMENT & CALL FOR SUBMISSIONS
Content-Transfer-Encoding: 8bit
X-MIME-Autoconverted: from quoted-printable to 8bit by interval.usl.edu id KAA00913
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

[ Sorry for multiple copies. Do not reply to this message. If you
believe we have sent this to a list not appropriate, please let us know
by mailing to etaps2001 [at] disi [dot] unige.it ]

                              ETAPS 2001
                          APRIL 2 - 6, 2001
                           GENOVA - ITALY

The European Joint Conferences on Theory and Practice of Software
(ETAPS) is a loose and open confederation of conferences and other
events that has become the primary European forum for academic and
industrial researchers working on topics relating to Software Science.

                 http://www.disi.unige.it/etaps2001/

FIRST ANNOUNCEMENT  & CALL FOR SUBMISSIONS
-----------------------------------------------------------------------
5 Conferences - Tutorials - Tool Demonstrations - 7 Satellite Events
-----------------------------------------------------------------------

Conferences
-----------------------------------------------------------------------
CC 2001: International Conference on Compiler Construction
Chair: Reinhard Wilhelm

ESOP 2001, European Symposium On Programming
Chair: David Sands

FASE 2001, Fundamental Approaches to Software Engineering
Chair: Heinrich Hußmann

FOSSACS 2001,
Foundations of Software Science and Computation Structures
Chair: Furio Honsell

TACAS 2001,
Tools and Algorithms for the Construction and Analysis of Systems
Chairs: Tiziana Margaria and Wang Yi

Prospective authors are invited to submit, before October 20, 2001,
full papers in English presenting original research. Submitted papers
must be unpublished and not submitted for publication elsewhere. In
particular, simultaneous submission of the same contribution to
multiple ETAPS conferences is forbidden. The proceedings of each main
conference will be published as a separate volume in the Springer
Verlag Lecture Notes in Computer Science series.

Tutorials
-----------------------------------------------------------------------
Proposals for half-day or full-day tutorials related to ETAPS 2001 are
invited. Tutorial proposals will be evaluated on the basis of their
assessed benefit for prospective participants to ETAPS 2001.

Contact: Bernhard Rumpe, (Technische Universitaet Munchen, Germany)
etaps2001-tut [at] forsoft [dot] de

Tool Demonstrations
-----------------------------------------------------------------------
Demonstrations of tools presenting advances on the state of the art are
invited. Submissions in this category should present tools having a
clear connection to one of the main ETAPS conferences, possibly
complementing a paper submitted separately. These should not be
confused with contributions to TACAS, which emphasizes principles of
tool design, implementation, and use, rather than focusing on specific
domains of application.

Contact: Don Sannella (University of Edinburgh)
etaps2001-demo [at] dcs [dot] ed.ac.uk

Satellite Events
-----------------------------------------------------------------------
Besides the five main conferences the following satellite events are
planned for ETAPS 2001

CMCS: Co-algebraic Methods in Computer Science
Contact: Ugo Montanari (Universita' di Pisa, Italy)

ETI Day: Electronic Tool Integration platform Day
Contacts: Tiziana Margaria (Universitaet Dortmund, Germany) and
Andreas Podelski (MPI Saarbrucken, Germany)

LDTA: Workshop on Language Descriptions, Tools and Applications
Contact: Mark van den Brand (CWI Amsterdam, The Netherlands)

PFM: Proofs For Mobility
Contact: Davide Sangiorgi (INRIA-Sophia Antipolis, France)

RelMiS: Relational Methods in Software
Contact: Wolfram Kahl (Universitaet der Bundeswehr Munchen, Germany)

UNIGRA:
Uniform Approaches to Graphical Process Specification Techniques
Contact: Julia Padberg (Technische Universitaet Berlin, Germany)

WADT: Workshop on Algebraic Development Techniques
Contact: Maura Cerioli (DISI-Universita' di Genova, Italy)

Important Dates:
-----------------------------------------------------------------------
  October 20, 2000:  Submissions Deadline for the Main Conferences,
                     Demos and Tutorials

  December 15, 2000: Notification of Acceptance/Rejection

  January  15 2001:  Camera-ready Version Due

  April  2-6, 2001:  ETAPS 2001 in Genova

  March 31 - April 8, 2001:  Satellite Events
-----------------------------------------------------------------------






From owner-reliable_computing [at] interval [dot] usl.edu  Thu Jun  8 05:58:29 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id FAA05533
	for reliable_computing-outgoing; Thu, 8 Jun 2000 05:58:29 -0500 (CDT)
Received: from judy.ic.ac.uk (judy.ic.ac.uk [155.198.5.28])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id FAA05528
	for <reliable_computing [at] interval [dot] louisiana.edu>; Thu, 8 Jun 2000 05:58:19 -0500 (CDT)
From: h.haitao [at] ic [dot] ac.uk
Received: from juliet.ic.ac.uk ([155.198.5.4])
	by judy.ic.ac.uk with esmtp (Exim 2.12 #1)
	id 13000u-00017a-00
	for reliable_computing [at] interval [dot] louisiana.edu; Thu, 8 Jun 2000 11:58:16 +0100
Received: from sunfs1-gw.ps.ic.ac.uk ([155.198.164.2] helo=sunfs1.ps.ic.ac.uk)
	by juliet.ic.ac.uk with esmtp (Exim 2.12 #1)
	id 13000v-0007CU-00
	for reliable_computing [at] interval [dot] louisiana.edu; Thu, 8 Jun 2000 11:58:17 +0100
Received: from sunv44.ps.ic.ac.uk by sunfs1.ps.ic.ac.uk (8.8.8+Sun/4.1)
          id LAA05662; Thu, 8 Jun 2000 11:58:13 +0100 (BST)
Date: Thu, 8 Jun 2000 11:58:12 +0100 (BST)
Message-Id: <1091.200006081058 [at] sunv44 [dot] ps.ic.ac.uk>
To: reliable_computing [at] interval [dot] louisiana.edu
Subject: Profil/BIAS linux version
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Content-MD5: XhnncCU4UqCCl5j1iG0hWw==
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear members of "The Interval Community."

I am user of your software 'Profil/BIAS'. It works well on my Sun works station. 
I still want to make it work on my Linux system (S.u.S.e ver 6.4 or Red Hat 6.2 
on AMD-6-2-500 PC). Could you please be so kind to give me an idea whether there 
is a Linux version or how to do it? 

I am also interested in your INTLAB. However it is written in Matlab. I wander 
if I can call the INTLAB from C++ like call FORTRAN function? 

I am doing a work of designing a framework for flexible chemical process 
design. The basic tools for my work are C++ and interval arithmetic. Could you 
please give me any suggestion of which Interval software is more suitable?

Thanks very much

Haitao Huang

From owner-reliable_computing [at] interval [dot] usl.edu  Thu Jun  8 12:00:26 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id MAA06136
	for reliable_computing-outgoing; Thu, 8 Jun 2000 12:00:26 -0500 (CDT)
Received: from cosmos.imag.fr (cosmos.imag.fr [147.171.130.1])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id MAA06131
	for <reliable_computing [at] interval [dot] usl.edu>; Thu, 8 Jun 2000 12:00:21 -0500 (CDT)
Received: from adraste.imag.fr (adraste.imag.fr [147.171.130.20])
	by cosmos.imag.fr (8.9.3/8.8.5) with ESMTP id SAA18165;
	Thu, 8 Jun 2000 18:56:18 +0200 (MET DST)
From: Dongming Wang <Dongming.Wang [at] imag [dot] fr>
Received: (from wang@localhost)
	by adraste.imag.fr (8.9.3/8.8.5) id SAA04917;
	Thu, 8 Jun 2000 18:56:01 +0200 (MET DST)
Date: Thu, 8 Jun 2000 18:56:01 +0200 (MET DST)
Message-Id: <200006081656.SAA04917 [at] adraste [dot] imag.fr>
To: adg2000 [at] ethz [dot] ch
Subject: ADG '2000 update
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

  3rd International Workshop on Automated Deduction in Geometry
          (Zurich, Switzerland, September 25-27, 2000)

* Deadline for extended abstract submission: June 20, 2000

* Invited Speakers: Juergen Bokowski (TU Darmstadt, Germany)
                    Christoph M. Hoffmann (Purdue University, USA)

* Open Session Speaker: Wen-tsun Wu (Academia Sinica, China)

* Further information: http://calfor.lip6.fr/~wang/ADG2000/


From owner-reliable_computing [at] interval [dot] usl.edu  Thu Jun  8 13:16:47 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id NAA06531
	for reliable_computing-outgoing; Thu, 8 Jun 2000 13:16:47 -0500 (CDT)
Received: from cosmos.imag.fr (cosmos.imag.fr [147.171.130.1])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id NAA06525
	for <reliable_computing [at] interval [dot] usl.edu>; Thu, 8 Jun 2000 13:16:42 -0500 (CDT)
Received: (from wang@localhost)
	by cosmos.imag.fr (8.9.3/8.8.5) id SAA17008;
	Thu, 8 Jun 2000 18:31:25 +0200 (MET DST)
Date: Thu, 8 Jun 2000 18:31:25 +0200 (MET DST)
From: Dongming Wang <Dongming.Wang [at] imag [dot] fr>
Message-Id: <200006081631.SAA17008 [at] cosmos [dot] imag.fr>
To: adg2000 [at] ethz [dot] ch
Subject: ADG '2000 update
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

  3rd International Workshop on Automated Deduction in Geometry
          (Zurich, Switzerland, September 25-27, 2000)

* Deadline for extended abstract submission: June 20, 2000

* Invited Speakers: Juergen Bokowski (TU Darmstadt, Germany)
                    Christoph M. Hoffmann (Purdue University, USA)

* Open Session Speaker: Wen-tsun Wu (Academia Sinica, China)

* Further information: http://calfor.lip6.fr/~wang/ADG2000/


From owner-reliable_computing [at] interval [dot] usl.edu  Wed Jun 14 07:29:12 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id HAA18475
	for reliable_computing-outgoing; Wed, 14 Jun 2000 07:29:12 -0500 (CDT)
Received: from interval.usl.edu (rbk5287@interval [130.70.43.77])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with SMTP id HAA18470
	for <reliable_computing>; Wed, 14 Jun 2000 07:29:09 -0500 (CDT)
Message-Id: <200006141229.HAA18470 [at] interval [dot] usl.edu>
Date: Wed, 14 Jun 2000 07:29:09 -0500 (CDT)
From: "Kearfott R. Baker" <rbk5287 [at] interval [dot] usl.edu>
Reply-To: "Kearfott R. Baker" <rbk5287 [at] interval [dot] usl.edu>
Subject: Results: Semiannual subscription verification
To: reliable_computing [at] interval [dot] usl.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: 8Pzb42ScjRYR+ZgHQV5EIg==
X-Mailer: dtmail 1.2.1 CDE Version 1.2.1 SunOS 5.6 sun4m sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear colleagues,

Thank you for your cooperation in the semiannual subscription
verification.

I have removed the following addresses, that have bounced.  If
you have current information about these persons, I would 
appreciate your help. Also, please inform me if you have any
other questions or problems.

Best regards,

Baker

       Address                                 reason for bounce

regivan [at] dimap [dot] ufrn.br                      554 Too many hops 26 (25 max)
bedregal [at] dimap [dot] ufrn.br                     Too many hops 26 (25 max)
ae20 [at] iamk4526 [dot] mathematik.uni-karlsruhe.de  retry timeout exceeded
jean-michel.muller [at] lip [dot] ens-lyon.fr         Host unknown (Name server: 
lip.ens-lyon.fr: host not found)
lidiya [at] mathematik [dot] uni-bremen.de            User unknown
hoon.hong [at] risc [dot] uni-linz.ac.at              User unknown
oliveira [at] andros [dot] inf.pucrs.br               User unknown
marc.daumas [at] lip [dot] ens-lyon.fr                User unknown
Franck.Delcroix [at] devinci [dot] fr                 User unknown
hhong [at] risc [dot] uni-linz.ac.at                  User unknown
stefano.depascale [at] vtt [dot] fi                   User unknown
SMOL [at] prima [dot] tu-chel.ac.ru                   User unknown
bloemer [at] tcs [dot] fu-berlin.de                   User unknown
estela [at] etseccpb [dot] upc.es                     User Maria.Rosa.Estela 
(Maria.Rosa.Estela [at] upc [dot] es) not listed in public Name & Address Book
falken [at] parc [dot] xerox.com                      Service unavailable
nelid [at] iph [dot] bio.acad.bg                      Host unknown (Name server: 
iph.bio.acad.bg: host not found)
immos [at] student [dot] dtu.dk                       Sorry, no mailbox here by that name
mgmtrsh [at] osucc [dot] bitnet                       Node OSUCC is unknown as of VERS9916
eero.hyvonen [at] vtt [dot] fi                        User unknown
obeaumon [at] irisa [dot] fr                          unknown user
rioramr [at] yahoo [dot] com                          This account has been disabled or 
discontinued
ongard [at] dt [dot] uh.edu                           Too Many Hops
T.Csoka [at] rl [dot] ac.uk                           RAL mailer could not determine the 
intended recipient
reid [at] bdc [dot] ubc.ca                            User unknown
jerome [at] be [dot] com                              Sorry, no mailbox here by that name.

---------------------------------------------------------------
R. Baker Kearfott,    rbk [at] louisiana [dot] edu   (337) 482-5346 (fax)
(337) 482-5270 (work)                     (337) 981-9744 (home)
URL: http://interval.louisiana.edu/kearfott.html
Department of Mathematics, University of Louisiana at Lafayette
Box 4-1010, Lafayette, LA 70504-1010, USA
---------------------------------------------------------------


From owner-reliable_computing [at] interval [dot] usl.edu  Fri Jun 16 06:02:56 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id GAA21669
	for reliable_computing-outgoing; Fri, 16 Jun 2000 06:02:56 -0500 (CDT)
Received: from zermelo.dcs.ed.ac.uk (zermelo.dcs.ed.ac.uk [129.215.96.75])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id GAA21664
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 16 Jun 2000 06:02:51 -0500 (CDT)
Received: (from da@localhost)
	by zermelo.dcs.ed.ac.uk (8.9.3/8.9.3) id LAA19494;
	Fri, 16 Jun 2000 11:59:14 +0100
MIME-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Message-ID: <14666.2178.243872.648717 [at] zermelo [dot] dcs.ed.ac.uk>
Date: Fri, 16 Jun 2000 11:59:14 +0100 (BST)
From: David Aspinall <da [at] dcs [dot] ed.ac.uk>
To: coq-club [at] pauillac [dot] inria.fr, isabelle-users [at] cl [dot] cam.ac.uk,
        lego-club [at] dcs [dot] ed.ac.uk, uitp [at] dcs [dot] gla.ac.uk, bra-types [at] cs [dot] chalmers.se,
        info-hol [at] jaguar [dot] cs.byu.edu, pvs [at] csl [dot] sri.com, qed [at] mcs [dot] anl.gov,
        theorem-provers [at] ai [dot] mit.edu, types [at] cis [dot] upenn.edu,
        formal-methods [at] cs [dot] uidaho.edu, reliable_computing [at] interval [dot] usl.edu,
        prog-lang [at] diku [dot] dk
Subject: Proof General --- Version 3.1 release
X-Mailer: VM 6.72 under 21.1 (patch 9) "Canyonlands" XEmacs Lucid
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

[ Apologies for multiple copies.  Also, this is a rather delayed
  announcement: Proof General 3.1 was actually released back
  in March but only advertised on the PG mailing list. ]


            Announcing  Proof General  Version 3.1

   A Generic Emacs interface for Interactive Proof Assistants

            http://www.lfcs.informatics.ed.ac.uk/proofgen

           contact: David Aspinall <da [at] dcs [dot] ed.ac.uk>

		 =========================

Proof General is an Emacs interface for developing proof scripts.
It can be instantiated for the proof assistant of your choice,
and is supplied ready-customised for Isabelle, Coq, LEGO, and HOL.

Proof General includes these features, amongst others:

. Script management: proof assistant state reflected in editor
. Toolbar and menus: commands for building and replaying proofs
. Syntax highlighting of proof scripts and prover output
. Display of real logical symbols, greek letters, etc
. Simplified communication: proof assistant verbosity hidden
. Menu for jumping to theorems in a proof script
. Provision to easily run proof assistant on a remote host
. Works on any platform Emacs does, in window system or plain console 

Summary of changes since 3.0:

. New instantiation for HOL98!  
. Minor cosmetic improvements 
. Bug fixes for Emacs compatibility (FSF, Japanese versions, XEmacs on win32)
. Fix for infamous Solaris ^G bug
. Several other bug fixes
. For full details, see
   http://www.lfcs.ed.ac.uk/proofgen/ProofGeneral-3.1/CHANGES

The user manual contains full details, and is available on-line at: 
http://www.lfcs.informatics.ed.ac.uk/proofgen/index.phtml?page=doc

Proof General needs a recent version of Emacs to run with, and it much
prefers XEmacs to FSF GNU Emacs.  Proof General 3.1 has been tested
with XEmacs 21.1 and Emacs 20.5.  (It should work back to XEmacs 20.4
and Emacs 20.2, though).  

Installing Proof General is easy.  Why not give it a try?

 - David Aspinall <da [at] dcs [dot] ed.ac.uk>
   June 2000.

From owner-reliable_computing [at] interval [dot] usl.edu  Sun Jun 18 10:19:22 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA25619
	for reliable_computing-outgoing; Sun, 18 Jun 2000 10:19:21 -0500 (CDT)
Received: from kleene.math.wisc.edu (kleene.math.wisc.edu [144.92.166.90])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA25614
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 18 Jun 2000 10:19:17 -0500 (CDT)
Received: from bing.math.wisc.edu (bing.math.wisc.edu [144.92.166.133])
	by kleene.math.wisc.edu (8.9.3/8.9.3) with SMTP id KAA24261;
	Sun, 18 Jun 2000 10:00:47 -0500 (CDT)
Date: Sun, 18 Jun 2000 09:53:53 -0500 (CDT)
From: Hans Schneider <hans [at] math [dot] wisc.edu>
To: NETS -- at-net <at-net [at] mi [dot] uni-erlangen.de>,
        "Hershkowitz, Danny -- Hershkowitz Daniel" <hershkow [at] aluf [dot] technion.ac.il>,
        Danny Hershkowitz <hershkow [at] techunix [dot] technion.ac.il>,
        E-LETTER <eletter-request [at] win [dot] tue.nl>,
        "na.digest" <na.digest@na-net.ornl.gov>, ipnet-digest [at] math [dot] msu.edu,
        wim@bell-labs.com, hjt [at] eos [dot] ncsu.edu, vkm [at] eedsp [dot] gatech.edu,
        reliable_computing [at] interval [dot] louisiana.edu
Subject: LAA contents
Message-ID: <Pine.GSO.3.96.1000618095059.27603A-100000 [at] bing [dot] math.wisc.edu>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


Dear Net Organizer:

Please circulate the attached LAA contents over your net.

Thanks

hans
---


------------------------------------------------------------------------------
Hans Schneider                                 hans [at] math [dot] wisc.edu.
Department of Mathematics                      608-262-1402 (Work)
Van Vleck Hall                                 608-271-7252 (Home)
480 Lincoln Drive                              608-263-8891 (Work FAX)
University of Wisconsin-Madison                608-271-8477 (Home FAX)
Madison WI 53706 USA             http://www.math.wisc.edu/~hans (URL)
------------------------------------------------------------------------------



             ContentsDirect from Elsevier Science
            =====================================


Journal: Linear Algebra and its Applications
ISSN   : 0024-3795
Volume : 313
Issue  : 1-3
Date   : 01-Jul-2000

Please note that only subscribers can access full text and abstracts
through the provided URLs.

Visit the journal at http://www.elsevier.nl/locate/jnlnr/07738


pp 1-20
Matrix pencils and a generalized Clifford algebra
C.J. Pappacena
http://www.elsevier.nl/PII/S0024379500000252

pp 21-40
Linear systems with signed solutions
S.-J. Kim, B.L. Shader
http://www.elsevier.nl/PII/S0024379500000926

pp 41-51
A new relative perturbation theorem for singular subspaces
R.-C. Li, G.W. Stewart
http://www.elsevier.nl/PII/S0024379500000744

pp 53-100
Inner-outer factorization and the inversion of locally finite systems
of equations
P. Dewilde, A.-J. van der Veen
http://www.elsevier.nl/PII/S0024379500000835

pp 101-105
A correction: orthogonal representations and connectivity of graphs
L. Lovasz, M. Saks, A. Schrijver
http://www.elsevier.nl/PII/S0024379500000914

pp 107-114
Fast and stable eigendecomposition of symmetric banded plus
semi-separable matrices
S. Chandrasekaran, M. Gu
http://www.elsevier.nl/PII/S0024379500001063

pp 115-126
On the digraphs of sign solvable linear systems
J.-Y. Shao
http://www.elsevier.nl/PII/S0024379500001075

pp 127-139
On vector Hankel determinants
A. Salam
http://www.elsevier.nl/PII/S0024379500001026

pp 141-154
The cycle completable graphs for the completely positive and doubly
nonnegative completion problems
J.H. Drew, C.R. Johnson, S.J. Kilner, A.M. McKay
http://www.elsevier.nl/PII/S0024379500001105

pp 155-161
Reducibility theorems for pairs of matrices as rational criteria
Y.A. Al'pin, K.D. Ikramov
http://www.elsevier.nl/PII/S0024379500001294

pp 163-171
Inverses of Perron complements of inverse M-matrices
M. Neumann
http://www.elsevier.nl/PII/S0024379500001282

pp 173-192
Inverse M-matrix completions of patterns omitting some diagonal
positions
L. Hogben
http://www.elsevier.nl/PII/S0024379500001221

pp 193-201
On a discrete nonlinear boundary value problem
S. Sun Cheng, H.-T. Yen
http://www.elsevier.nl/PII/S0024379500001336

pp 203-206
A test for copositive matrices
W. Kaplan
http://www.elsevier.nl/PII/S0024379500001385

pp 207
Index
http://www.elsevier.nl/PII/S0024379500001555
---


NOTE:
ContentsDirect, which is automatically generated, lists the first author
of each paper and the corresponding author (if different). 



From owner-reliable_computing [at] interval [dot] usl.edu  Mon Jun 19 08:40:53 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id IAA27614
	for reliable_computing-outgoing; Mon, 19 Jun 2000 08:40:53 -0500 (CDT)
Received: from atilla.mim.itu.edu.tr (IDENT:root [at] atilla [dot] mim.itu.edu.tr [160.75.51.2])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id IAA27609
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 19 Jun 2000 08:40:46 -0500 (CDT)
Received: from kasanova.mim.itu.edu.tr (ozsoya.mim.itu.edu.tr [160.75.52.86])
	by atilla.mim.itu.edu.tr (8.9.3/8.9.3) with SMTP id QAA01637
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 19 Jun 2000 16:40:36 +0300
Message-ID: <03f601bfd9f3$9a5671a0$56344ba0 [at] kasanova [dot] mim.itu.edu.tr>
From: "Simeon J. Simoff" <simeon [at] arch [dot] usyd.edu.au>
To: <reliable_computing [at] interval [dot] louisiana.edu>
Subject: DCNet'00: Call for papers
Date: Mon, 19 Jun 2000 23:38:05 +1000
MIME-Version: 1.0
Content-Type: text/plain;
	charset="iso-8859-1"
Content-Transfer-Encoding: 8bit
X-Priority: 3
X-MSMail-Priority: Normal
X-Mailer: Microsoft Outlook Express 4.72.3612.1700
X-MimeOLE: Produced By Microsoft MimeOLE V4.72.3612.1700
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Appologies for cross-postings
===========================================================================
CALL FOR SUBMISSIONS: DCNet00
===========================================================================

DCNet00 is the third conference in a series of online conferences that
focuses on the future of design computing. The online conference will run
over four days in a Virtual Conference Room. DCNet00 is sponsored by The
International Journal of Design Computing - an electronic journal whose
objective is to promote research and technology transfer in design computing
through the publication of interactive, multimedia journal articles within
the general topic of design computing. This conference furthers those
objectives by providing a focused forum on the future of design computing.

Submissions
Submissions are invited on the following broad topics:
… Collaborative Design
… Multimedia in Design
… Virtual Reality
… Artificial Intelligence in Design

The submissions will be reviewed by at least two peers. Acceptance is based
on their relevance to the conference and quality of presentation. Accepted
sumissions will be presented and discussed using both threaded discusssions
and synchronous question and answer sessions with online slide projectors.

When preparing submissions, you are encouraged to use multimedia and
hypertext to enhance the content. Submissions will not be printed and are
not expected to be printable. Submissions must be accessible using http and
html standards. Only the URL is submitted at this point. Please clearly
indicate if plug-ins are required. The length of submission is difficult to
specify, but aim for approximately 3000 words or a presentation that takes
about 10-15 minutes to comprehend.

Dates
28 August - Submissions due
20 November - Final submissions due
4-18 December - Conference papers are available for threaded discussion
18-21 December - Conference online presentations and discussions


Publication
The presentations and edited version of threaded and synchronous discussions
will be published as part of the current volume of the International Journal
of Design Computing. All published presentations will be peer reviewed and
archived in a way consistent with the scholarly journal standards.

Visit the conference web site at:
http://www.arch.usyd.EDU.AU/kcdc/conferences/DCNet00/index.html
for further information.

Mary Lou Maher
Simeon Simoff
Conference Co-Chairs



From owner-reliable_computing [at] interval [dot] usl.edu  Wed Jun 21 19:11:51 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id TAA01847
	for reliable_computing-outgoing; Wed, 21 Jun 2000 19:11:51 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id TAA01842
	for <reliable_computing [at] interval [dot] louisiana.edu>; Wed, 21 Jun 2000 19:11:47 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.10.1/8.10.1) with SMTP id e5M0BeR01464;
	Wed, 21 Jun 2000 18:11:40 -0600 (MDT)
Message-Id: <200006220011.e5M0BeR01464 [at] cs [dot] utep.edu>
Date: Wed, 21 Jun 2000 18:11:40 -0600 (MDT)
From: vladik <vladik [at] cs [dot] utep.edu>
Reply-To: vladik <vladik [at] cs [dot] utep.edu>
Subject:  Special Issues:  Interfaces Between Fuzzy Sets and Interval Analysis
To: interval [at] cs [dot] utep.edu, reliable_computing [at] interval [dot] louisiana.edu,
        nafips-l [at] sphinx [dot] gsu.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=US-ASCII
Content-MD5: l1W6O3wSIOZQj4/ToggOBA==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc 
Content-Transfer-Encoding: 8bit
X-MIME-Autoconverted: from QUOTED-PRINTABLE to 8bit by interval.usl.edu id TAA01843
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

                                 CALL FOR PAPERS
                               Fuzzy Sets and Systems
      Special Issues:  Interfaces Between Fuzzy Sets and Interval Analysis
          http://www-math.cudenver.edu/~wlodwick/journals/fss-call.html

Fuzzy set theory when restricted to sets of real numbers can be approached
via intervals and interval analysis.  The intimate relationship between
interval analysis and fuzzy set theory is especially apparent in fuzzy
arithmetic, fuzzy optimization and some areas of fuzzy mathematical
analysis.  A unimodal fuzzy membership function can be formed from a
continuum of intervals corresponding to alpha-levels or a continuum of
disconnected intervals for multi-modal fuzzy membership functions.
Intervals are one type of fuzzy set possessing a rectangular membership
function.  This being the case, the issues and mathematical analysis
associated with fuzzy set theory and interval analysis are mutually
relevant.  We invite papers on advances that clearly demonstrate the
interrelationships between fuzzy set theory and interval analysis.  We
list some examples of the types of papers we seek.  This list is
indicative and not exhaustive.

* Fuzzy and interval mathematical analysis; for example, the role and
  interrelationship of the fuzzy extension principle of L. Zadeh and
  interval united extension of R.E. Moore in fuzzy functions, fuzzy
  mathematical analysis and foundational issues
* Comparative analyses of the logics associated with fuzzy set theory,
  possibility theory and interval analysis
* Upper and lower probability interpretation of possibility theory
* Fuzzy extensions of interval ordering
* The application of interval analysis to fuzzy algorithms and vice versa 
* Possibilistic, fuzzy, and interval optimization
* Fuzzy and interval systems techniques in operations research
* Fuzzy and interval logic controllers
* Computer systems in support of fuzzy number data types and associated
  numerical algorithms akin to such interval analysis computer systems as
  that of S. Rump, "INTLAB - Interval Laboratory" (see version 3 of INTLAB
  and paper at:
        http://www.ti3.tu-harburg.de/~rump/intalb/index.html
* Fuzzy and interval dynamical systems
* Complexity issues in fuzzy and interval methods
* One of the uses of interval analysis is in the validation of solutions
  under computational and data errors.  Is there a comparable use of fuzzy
  set and possibility theory in the validation of solutions under
  uncertainty?

In addition to new results in theoretical analysis, innovative
applications, and computer implementations, we invite insightful surveys.  

Guest editor: 	Professor Weldon A. Lodwick
		Department of Mathematics - Campus Box 170
		University of Colorado at Denver
		P.O. Box 173364
		Denver, Colorado 80217-3364
		weldon.lodwick [at] cudenver [dot] edu
		Telephone: + 303 556-8462

Procedure for Submission

All contributions must be original, not published elsewhere, and written
clearly in English.  Please send 5 copies of your paper to the Guest
Editor before 01/01/2001.




From owner-reliable_computing [at] interval [dot] usl.edu  Mon Jun 26 17:12:40 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id RAA10624
	for reliable_computing-outgoing; Mon, 26 Jun 2000 17:12:40 -0500 (CDT)
Received: from lukla.Sun.COM (lukla.Sun.COM [192.18.98.31])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id RAA10619
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 26 Jun 2000 17:12:37 -0500 (CDT)
Received: from engmail1.Eng.Sun.COM ([129.146.1.13])
	by lukla.Sun.COM (8.9.3+Sun/8.9.3) with ESMTP id QAA26186;
	Mon, 26 Jun 2000 16:12:34 -0600 (MDT)
Received: from ha-sims.eng.sun.com (phys-thestorka.Eng.Sun.COM [129.146.1.231])
	by engmail1.Eng.Sun.COM (8.9.3+Sun/8.9.3/ENSMAIL,v1.7) with ESMTP id PAA08843;
	Mon, 26 Jun 2000 15:12:33 -0700 (PDT)
Received: from gww (gww.Eng.Sun.COM [129.146.78.116])
 by ha-sims.eng.sun.com (Sun Internet Mail Server sims.4.0.1999.06.13.00.20)
 with SMTP id <0FWS00ML18CXTW@ha-sims.eng.sun.com>; Mon,
 26 Jun 2000 15:12:33 -0700 (PDT)
Date: Mon, 26 Jun 2000 15:12:33 -0700 (PDT)
From: William Walster <bill.walster [at] eng [dot] sun.com>
Subject: Fw: A Great Opportunity
To: interval [at] cs [dot] utep.edu, reliable_computing [at] interval [dot] louisiana.edu
Reply-to: William Walster <bill.walster [at] eng [dot] sun.com>
Message-id: <0FWS00ML28CXTW@ha-sims.eng.sun.com>
MIME-version: 1.0
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4m sparc
Content-type: TEXT/plain; charset=us-ascii
Content-MD5: fK4Obr6UP2jXjq9Ogrx1dA==
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


It is important to demonstrate that interval users are doing real science.  
Now with an interval compiler from Sun, this is an opportunity to kill
two birds with one stone by helping the the interval community and Sun.

Please post interval and/or Sun success stories to: 

	http://www.idc.com:8080/hpc/

Regards,

Bill




From owner-reliable_computing [at] interval [dot] usl.edu  Tue Jun 27 04:46:01 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id EAA12212
	for reliable_computing-outgoing; Tue, 27 Jun 2000 04:46:01 -0500 (CDT)
Received: from satie.u-bourgogne.fr (satie.u-bourgogne.fr [192.134.59.2])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id EAA12207
	for <reliable_computing [at] interval [dot] usl.edu>; Tue, 27 Jun 2000 04:45:56 -0500 (CDT)
Received: from catmull (catmull.u-bourgogne.fr [193.52.237.132])
	by satie.u-bourgogne.fr (8.9.3/8.9.3) with ESMTP id LAA152510
	for <reliable_computing [at] interval [dot] usl.edu>; Tue, 27 Jun 2000 11:45:54 +0200
From: "Dominique Faudot" <Dominique.Faudot@u-bourgogne.fr>
To: <reliable_computing [at] interval [dot] usl.edu>
Subject: eigenvalues
Date: Tue, 27 Jun 2000 11:49:11 +0200
Message-ID: <NDBBLAELMLNOCOKILJMJAEGECCAA.Dominique.Faudot@u-bourgogne.fr>
MIME-Version: 1.0
Content-Type: text/plain;
	charset="iso-8859-1"
Content-Transfer-Encoding: 7bit
X-Priority: 3 (Normal)
X-MSMail-Priority: Normal
X-Mailer: Microsoft Outlook IMO, Build 9.0.2416 (9.0.2910.0)
Importance: Normal
X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2314.1300
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


Hi,
I have a matrix  A (symmetric) which is an interval matrix and i have to
compute the eigenvalues of A. I do not find good results (because of
divisions between intervals including 0).
Is there somewhere a C++ function or a paper about this problem ?

Thanks for help

dominique


From owner-reliable_computing [at] interval [dot] usl.edu  Thu Jun 29 22:18:52 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id WAA16623
	for reliable_computing-outgoing; Thu, 29 Jun 2000 22:18:52 -0500 (CDT)
Received: from mtu.ru (ns.mtu.ru [195.34.32.10])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id WAA16618
	for <reliable_computing [at] interval [dot] usl.edu>; Thu, 29 Jun 2000 22:18:47 -0500 (CDT)
Received: from ns1.glasnet.ru.glasnet.ru (ppp101-174.dialup.mtu-net.ru [212.188.101.174])
	by mtu.ru (Postfix) with SMTP id E6EBA4680
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 30 Jun 2000 07:18:43 +0400 (MSD)
	(envelope-from Yakovlev@rc_journal.mtu-net.ru)
Message-ID: <006401bfe241$9823d520$d103efc3 [at] glasnet [dot] ru.glasnet.ru>
Reply-To: "Alexander G. Yakovlev" <Yakovlev@rc_journal.mtu-net.ru>
From: "Alexander G. Yakovlev" <Yakovlev@rc_journal.mtu-net.ru>
To: <reliable_computing [at] interval [dot] usl.edu>
Subject: My address has been changed
Date: Fri, 30 Jun 2000 07:14:59 +0400
MIME-Version: 1.0
Content-Type: text/plain;
	charset="koi8-r"
Content-Transfer-Encoding: 7bit
X-Priority: 1
X-MSMail-Priority: High
X-Mailer: Microsoft Outlook Express 5.00.2417.2000
X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2314.1300
X-Recipient: reliable_computing [at] interval [dot] usl.edu
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear coleagues,
I would like to inform you that my address Yakovlev [at] globlab [dot] msk.su
is not actual starting this moment. Instead of the former address please
write me to 
               Yakovlev@rc_journal.mtu-net.ru
     However, it is preferable to send me to this address relatively
small messages (for instance, not more than 15 KB). Large
letters please send to another address:
               scdl [at] glasnet [dot] ru
     Usually, mail from the both addresses will be read at least
once per day.

Sincerely yours,

Alexander Yakovlev,
Managing Editor of the journal `Reliable Computing'



From owner-reliable_computing [at] interval [dot] usl.edu  Fri Jun 30 04:44:21 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id EAA17960
	for reliable_computing-outgoing; Fri, 30 Jun 2000 04:44:21 -0500 (CDT)
Received: from genie.eecs.lehigh.edu (genie.eecs.lehigh.edu [128.180.98.9])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id EAA17955
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 30 Jun 2000 04:44:16 -0500 (CDT)
Received: by genie.eecs.lehigh.edu (8.9.3/8.9.3) id AAA21887
	for asap-announce-outgoing; Fri, 30 Jun 2000 00:34:09 -0400 (EDT)
X-Authentication-Warning: genie.eecs.lehigh.edu: majordom set sender to owner-asap-announce [at] majordomo [dot] eecs.lehigh.edu using -f
From: ASAP User <asap [at] EECS [dot] Lehigh.EDU>
Date: Fri, 30 Jun 2000 00:34:04 -0400 (EDT)
Message-Id: <200006300434.AAA05667 [at] pamir [dot] eecs.lehigh.edu>
To: asap-announce [at] EECS [dot] Lehigh.EDU
Subject: [ASAP] ASAP'2000 - Call for Participation
Cc: mschulte [at] EECS [dot] Lehigh.EDU
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

			      ASAP'2000
		   IEEE International Conference on 
	Application-specific Systems, Architectures and Processors
	                July 10-12, 2000, 
			       Boston
---------------------------------------------------------------------------
			CALL FOR PARTICIATION

This year's program includes a rich set of topics and outstanding papers
by distinguished authors. Topics covered include video and multimedia 
processors, reconfigurable computing, modeling and synthesis, cryptography, 
digital signal processing, computer arithmetic, multiprocessor systems, 
application-specific architectures, and design methodology. In addition
to thirty-three contributed papers, the conference features a keynote address 
by Dr. William S. Song of MIT Lincoln Laboratory on "High-Performance
Front-End Signal Processors for Adaptive Sensor Arrays". 

The program for the IEEE International Conference on Application-Specific 
Systems, Architectures and Processors (ASAP 2000) is available from the 
conference web page at: 
   http://www.eecs.lehigh.edu/ASAP/

The conference web page also has links to 
(1) Conference Registration
(2) Hotel/Travel Information
(3) Airline Travel Information
More information about each of these topics is given below. 

If you have any questions, please send email to asap [at] eecs [dot] lehigh.edu
or mschulte [at] eecs [dot] lehigh.edu. 

We look forward to seeing you at ASAP 2000! 

-----------------------------------------------------------------------
Conference Registration:

Online conference registration for ASAP'2000 is available from 
   https://secure.computer.org/conf/asap/register.htm

If you are unable to access the online registration, please send email
to asap [at] eecs [dot] lehigh.edu, along with your FAX number, and we will send 
you a copy of the registration form. 

-----------------------------------------------------------------------
Hotel/Travel Information: 

ASAP'2000 will be held in the the Fairmont Copley Plaza Hotel, which is
located at 138 St. James Avenue in Boston, Massachusetts. The hotel is
about 30 minutes by taxi, car or shuttle from Boston's Logan International 
Airport. For conference attendees who are flying into  Logan Airport, you can
rent a car, take a taxi (about $25 each way), or take the Back Bay Coach 
Shuttle (about $7.50 each way). Additional information about the hotel,
including a map and directions are available from: 
   http://www.fairmont.com/Hotels/Index_B.html

Room reservations should be made by calling 800-441-1414 or +1-617-267-5300. 
Attendees should reference IEEE Computer Society ASAP when making reservations. 
The cut-off date will be Friday, 9 June 2000 at 5:00 p.m. Eastern time.
Reservations received after 9 June will be accepted by the Hotel on a space 
available basis at the conference rates. The Hotel confirms the following 
special rates for ASAP. 
     Single/Double: $189 
     Suites: $389 

These rates are exclusive of applicable sales/room tax, currently twelve point 
four five (12.45) percent, and are net non-commissionable. These special rates 
will apply at least three (3) days prior to and three (3) days after the 
Meeting dates based on availability to accommodate those who wish to extend 
their visits and these nights will be credited back to the room block.

-----------------------------------------------------------------------
Airline Travel Information:

Conference attendees who plan to fly to the conference may want to
consider flying into the Logan International Airport, since it is about
30 minutes (by car) from the conference hotel.

IEEE Computer Society is pleased to announce that it has been able to
secure a special discount agreement with United Airlines unavailable to
the general public.  A 5% discount off the lowest applicable fare will be
offered ONLY when you or your travel agent call United's toll-free
number 1-800-521-4041 and refer to the Meeting ID Number 538IQ.  A 10% discount
off the unrestricted mid-week coach fares is available when purchased 7
days in advance.  An additional 5% discount will apply when you purchase
your tickets at least 60 days in advance of your travel date.  Discounts
apply on United, Shuttle by United, and United Express.  Dedicated
reservationists are on duty 7 days a week, 7:00am to 12:00 midnight
Eastern time.  Book early to take advantage of promotional fares that give you
the greatest discount.  Mileage Plus members receive full credit for all
miles flown to this meeting.

From owner-reliable_computing [at] interval [dot] usl.edu  Fri Jun 30 12:09:55 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id MAA18642
	for reliable_computing-outgoing; Fri, 30 Jun 2000 12:09:54 -0500 (CDT)
Received: from ns.di.fct.unl.pt (IDENT:root [at] ns [dot] di.fct.unl.pt [193.136.122.1])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id MAA18637
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 30 Jun 2000 12:09:49 -0500 (CDT)
Received: from FACULDADF0QADT (gatekeeper.di.fct.unl.pt [193.136.122.225])
	by ns.di.fct.unl.pt (8.9.3/8.9.3) with SMTP id SAA07801;
	Fri, 30 Jun 2000 18:16:52 +0100
Message-ID: <021001bfe2af$e9d04d40$3301000a@FACULDADF0QADT>
Reply-To: =?iso-8859-1?Q?Miguel_Goul=E3o?= <mg [at] di [dot] fct.unl.pt>
From: =?iso-8859-1?Q?Miguel_Goul=E3o?= <miguel.goulao [at] di [dot] fct.unl.pt>
To: <csmr2001 [at] lisbon [dot] portugal>
Subject: CSMR 2001 call for papers
Date: Fri, 30 Jun 2000 15:25:26 +0100
Organization: =?iso-8859-1?Q?Faculdade_de_Ci=EAncias_e_Tecnologia?=
MIME-Version: 1.0
Content-Type: text/plain;
	charset="iso-8859-1"
Content-Transfer-Encoding: 8bit
X-Priority: 3
X-MSMail-Priority: Normal
X-Mailer: Microsoft Outlook Express 5.00.2014.211
X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2014.211
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

                            Fifth European Conference on
                               Software Maintenance and
                                       Reengineering

                                   Lisbon area, Portugal

                                    14 to 16 March 2001


                         http://www.esw.inesc.pt/csmr2001


Call for Papers

CSMR is the premier European Conference on Software Maintenance and
Reengineering. Its purpose is to promote both discussion and interaction
about maintenance
and reengineering.  Topics of interest include, but are not restricted
to:

*        Maintenance and reengineering  metrics and economics
*        Patterns languages for maintenance and reengineering
*        Experience reports on maintenance and reengineering
*        Maintenance and reengineering tools
*        Enabling technologies for maintenance and reengineering
*        Formal methods to support maintenance and reengineering
*        Software evolution and architecture recovery
*        System assessment for reengineering or maintenance
*        Migration and maintenance issues
*        Dealing with legacy systems towards new technologies

One of the basic intentions of this conference is to offer an European
forum for discussion and exchange of experiences among researchers and
practitioners.
Therefore, besides academics, we kindly invite all those in companies
developing maintenance tools, offering reengineering services or going
through legacy systems migration experiences to contribute by submitting
papers or presenting innovative tools, solutions or experience reports.
This conference is not limited to European participants. Authors from
outside Europe are especially welcomed.

SUBMISSIONS:
Two types of submissions will be accepted: full length papers (not
exceeding 4000 words in length and including a 150-200 word abstract)
and short papers (not exceeding 2000 words in length and including a
75-100 word abstract). All papers should be in English. Authors are
requested to submit electronically a PostScript or PDF version of their
papers. In addition, they should send a separate file containing the
title of the paper, full names, affiliations, postal and e-mail
addresses, fax and telephone numbers of all authors. We encourage
authors to make submissions through the web based submission system that
will be available. For submission details please look at the conference
web site.

IEEE Computer Society Press will publish the CSMR=922001 Proceedings.
Full papers exceeding 10 pages (4 pages for short papers) will be
charged for pages in excess. Authors of accepted papers must sign the
IEEE copyright form.

At least one author of each accepted submission should register and
present the paper at the conference. The official language will be
English.

IMPORTANT DATES:
DEADLINE for submissions - Friday, September 15, 2000
Author's notification - Monday, November 20, 2000
DEADLINE for camera-ready of accepted papers - Friday, December 15, 2000


SPECIAL SESSIONS:
Sessions of special interest proposed by delegates will be welcomed.
Please send suggestions to the program chair before the submissions
closing date.

Program Chair:
Pedro Sousa
Lisbon Technical University (IST) & Link
Av. D. =C1vila 23, 1000 Lisboa, Portugal.
Phone: +351-21-3100124
Fax: +351-21-3100079
Email: pedro.sousa [at] link [dot] pt

Program Co-Chair:
Jürgen Ebert
Institut für Softwaretechnik
University of Koblenz-Landau
Rheinau 1, D-56076 Koblenz, Germany
Phone: +49-261-287-2722
Fax: +49-261-287-2721
Email: ebert@uni-koblenz.de

General Chair:
Fernando Brito e Abreu
Lisbon New University (FCT) & INESC
R Alves Redol 9, 1000 Lisboa, Portugal.
Phone: +351-21-3100263
Fax: +351-21-3145843
Email: fba [at] inesc [dot] pt

Web Chair:
Miguel Goulão
Lisbon New University (FCT) & INESC
R Alves Redol 9, 1000 Lisboa, Portugal.
Phone: +351-21-3100263
Fax: +351-21-3145843
Email: miguel.goulao [at] di [dot] fct.unl.pt

Sponsors Chair:
Mendes dos Santos
Instituto de Informática (Min. Finanças)
Email: mendes.santos@inst-informatica.pt

Finance Chair:
Paulo Gomes
EUROCIBER
Email: pagomes [at] eurociber [dot] pt

Local Arrangements Chair:
Judite Delgado
APESI
Email: apesi [at] treal [dot] pt

CSMR Steering Committee:
Lutz Richter, University of Zurich, Switzerland (Chair)
Elliot Chikofsky, META Group, USA
Franz Lehner, University of Regensburg, Germany
Paolo Nesi, Università degli Studi di Firenze, Italy
Harry Sneed, SES GmbH, Germany
Chris Verhoef, University of Amsterdam, The Netherlands



-------------------------------------------------------------------------
Please take our apologies if you receive this information more than once!
--
Miguel Goulão
Departamento de Informática - FCT/UNL
email: mg [at] di [dot] fct.unl.pt
Tel: 351 21 2948536 Ext: 0749 (DI)
       351 21 2948300 Ext: 0749 (Geral)





From owner-reliable_computing [at] interval [dot] usl.edu  Sat Jul  1 22:40:32 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id WAA00456
	for reliable_computing-outgoing; Sat, 1 Jul 2000 22:40:32 -0500 (CDT)
Received: from mtu.ru (ns.mtu.ru [195.34.32.10])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id WAA00451
	for <reliable_computing [at] interval [dot] usl.edu>; Sat, 1 Jul 2000 22:40:14 -0500 (CDT)
Received: from ns1.glasnet.ru.glasnet.ru (ppp111-246.dialup.mtu-net.ru [212.188.111.246])
	by mtu.ru (Postfix) with SMTP
	id 6896B4525; Sun,  2 Jul 2000 07:39:49 +0400 (MSD)
	(envelope-from Yakovlev@rc-journal.mtu-net.ru)
Message-ID: <00d501bfe3d7$3ea77960$be66bcd4 [at] glasnet [dot] ru.glasnet.ru>
Reply-To: "Alexander G. Yakovlev" <Yakovlev@rc-journal.mtu-net.ru>
From: "Alexander G. Yakovlev" <Yakovlev@rc-journal.mtu-net.ru>
To: <Undisclosed-Recipient:;@mtu.ru;;>
Subject: My addres has been changed - 2
Date: Sun, 2 Jul 2000 07:39:27 +0400
MIME-Version: 1.0
Content-Type: text/plain;
	charset="koi8-r"
Content-Transfer-Encoding: 7bit
X-Priority: 1
X-MSMail-Priority: High
X-Mailer: Microsoft Outlook Express 5.00.2417.2000
X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2314.1300
X-Recipient: ae42 [at] rz [dot] uni-karlsruhe.de;andrey [at] leland [dot] stanford.edu;angelique.hempel [at] wkap [dot] nl;dmitri.chiriaev [at] eng [dot] sun.com;Gerd.Bohlender [at] math [dot] uni-karlsruhe.de;fridval [at] hotmail [dot] com;hempel [at] wkap [dot] nl;iosef [at] vms [dot] huji.ac.il;Kerstin.Dick [at] math [dot] uni-karlsruhe.de;Musayev [at] usa [dot] net;rbk [at] usl [dot] edu;roos [at] wkap [dot] nl;Rudi.Klatte [at] math [dot] uni-karlsruhe.de;shulam [at] actcom [dot] co.il;Ulrich.Kulisch [at] math [dot] uni-karlsruhe.de;yohayv [at] microsoft [dot] com;vladik [at] cs [dot] utep.edu;wolff [at] informatik [dot] uni-wuerzburg.de;yiddishstudies@oxf-inst.demon.co.uk
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear colleagues,
After circular sending round my previous message
(see below) I have suddenly found that some mail
servers can't receive messages contaning the sign '_'
after '@'. So, I have corrected my new address.
Its final form is as follows:
               Yakovlev@rc-journal.mtu-net.ru

Sincerely yours,
Alexander Yakovlev

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

Dear colleagues,
I would like to inform you that my address Yakovlev [at] globlab [dot] msk.su
is not actual starting this moment. Instead of the former address please
write me to 
               Yakovlev@rc_journal.mtu-net.ru
     However, it is preferable to send me to this address relatively
small messages (for instance, not more than 15 KB). Large
letters please send to another address:
               scdl [at] glasnet [dot] ru
     Usually, mail from the both addresses will be read at least
once per day.

Sincerely yours,

Alexander Yakovlev,
Managing Editor of the journal `Reliable Computing'




From owner-reliable_computing [at] interval [dot] usl.edu  Tue Jul  4 09:15:36 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id JAA04713
	for reliable_computing-outgoing; Tue, 4 Jul 2000 09:15:36 -0500 (CDT)
Received: from mx2.iat.cnr.it (mx2.iat.cnr.it [146.48.65.89])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id JAA04708
	for <reliable_computing [at] interval [dot] usl.edu>; Tue, 4 Jul 2000 09:15:07 -0500 (CDT)
Received: from CONVERSION.MAIL.IAT.CNR.IT by mail.iat.cnr.it
 (PMDF V6.0-24 #36023) id <01JRDIRKHKGW8Y4ZOS [at] mail [dot] iat.cnr.it>
 (original mail from t.bolognesi [at] IEI [dot] PI.CNR.IT)
 for reliable_computing [at] interval [dot] usl.edu; Tue, 04 Jul 2000 16:12:30 +0100 (MET)
Received: from CONVERSION.MAIL.IAT.CNR.IT by mail.iat.cnr.it
 (PMDF V6.0-24 #36023) id <01JRDIRYM1LS8WWMBE [at] mail [dot] iat.cnr.it>; Tue,
 04 Jul 2000 16:12:44 +0100 (MET)
Received: from mailserv.iei.pi.cnr.it (mailserv.iei.pi.cnr.it [146.48.84.3])
 by mail.iat.cnr.it (PMDF V6.0-24 #36023)
 with ESMTP id <01JRDIRYCNHQ8WWMPR [at] mail [dot] iat.cnr.it>; Tue,
 04 Jul 2000 16:12:43 +0100 (MET)
Received: from [146.48.84.49] (mac-bolognesi.iei.pi.cnr.it [146.48.84.49])
	by mailserv.iei.pi.cnr.it (8.9.3/8.9.3) with ESMTP id OAA02774; Tue,
 04 Jul 2000 14:13:57 -0100 (GMT)
Date: Tue, 04 Jul 2000 16:17:38 +0100
From: Tommaso Bolognesi <t.bolognesi [at] IEI [dot] PI.CNR.IT>
Subject: FORTE/PSTV 2000 - Call for Participation & Poster Contribution
X-Sender: bolog [at] mailserv [dot] iei.pi.cnr.it
To: forte-pstv-2000-people [at] mail [dot] iat.cnr.it,
        forte-pstv-2000-lists [at] mail [dot] iat.cnr.it
Reply-to: forte-pstv-2000 [at] cpr [dot] it
Message-id: <l03130313b587b0143ecd@[146.48.84.49]>
MIME-version: 1.0
Content-type: text/plain; charset=iso-8859-1
Content-Transfer-Encoding: 8bit
X-MIME-Autoconverted: from quoted-printable to 8bit by interval.usl.edu id JAA04709
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk



------------------- CALL FOR PARTICIPATION ------------------------

------------------- CALL FOR POSTER CONTRIBUTION -----------


                  ********
                ********
          **************
         **************
        **************
       **************           F O R T E  /  P S T V   2 0 0 0
      **************     ***
     **************    *****
    **************    *****
   **************    *****
  **************    *****
 **************    *****

-----------------------  Pisa, October 10-13, 2000  ---------------

                                http://forte-pstv-2000.cpr.it

                  IFIP TC6/WG6.1 Joint International Conference

                  FORMAL DESCRIPTION TECHNIQUES
                  for Distributed Systems and Communication Protocols
                  (FORTE XIII)

                  PROTOCOL SPECIFICATION, TESTING, AND VERIFICATION
                  (PSTV XX)

                  Satellite Workshop: FORMAL METHODS *ELSEwHERE*

                  INVITED SPEAKERS
                          Rocco De Nicola
                          Fausto Giunchiglia
                          John Rushby

                   TUTORIALS on Model Checking, Testing, and more.


IFIP TRAVEL GRANTS available for students.
EC GRANTS available for young researchers.

POSTERS
--------------
This year, FORTE/PSTV will offer a Poster Space aimed at giving
young researchers attending the conference an opportunity  to show
their "work-in-progess" and to interact effectively with senior researchers.
Since EC Grants are precisely meant to to promote *active* participation
of young researchers and their interaction with leading scientists,
applications for obtaining these Grants are seen more favourably if
associated with a poster submission (which, however, is not mandatory).

Poster authors should send a 500 word text file describing the contents of
their poster to: forte-pstv-2000 [at] cpr [dot] it.

                   Application:  before August 20, 2000
                   Notification:  before August 30, 2000.


EARLY REGISTRATION DEADLINE:  August 31
--------------------------------------------------------------------

HOTEL ACCOMODATION and CONFERENCE REGISTRATION forms:

                   ===>   http://forte-pstv-2000.cpr.it   <===

For further information: forte-pstv-2000 [at] cpr [dot] it



===============================================
************************************************************


                    FORTE/PSTV 2000 PROGRAMME

                          *** Twentieth Anniversary ***

         *** Formal Methods: Implementation Under Test ***



===============================================
TUESDAY, OCT. 10 - TUTORIALS DAY
===============================================

8:00   Registration

9:00-19:30   TUTORIAL TRACK A
9:00-19:30   TUTORIAL TRACK B

TUTORIAL TRACK A
--------------------------------

A1 - E. Allen Emerson
Model Checking
9:00-10:30    Part I
11:00-12:30  Part II

A2 - Jan Tretmans
Specification based testing with formal methods: from theory via tools to
applications
14:00-15:30   Part I
16:00-17:30   Part II

A3 - Marta Kwiatkowska
Modelling and verification of probabilistic real-time systems using
probabilistic timed automata
18:00-19:30

TUTORIAL TRACK B
-------------------------------

B1 - Hartmut Koenig,  Peter Langendoerfer
Automated Derivation of Efficient Implementations from Formal Protocol
Specifications
9:00-10:30    Part I
11:00-12:30  Part II

B2 - R. Gotzhein,  E. Börger, A. Prinz
Abstract State Machines and their Applications
14:00-15:30   Part I
16:00-17:30   Part II

B3 - C. Petitpierre
Bridging the Gap Between Formal Methods and the Implementation Process
18:00-19:30





===============================================
WEDNESDAY, OCT. 11
===============================================

8:00   REGISTRATION

8:45   OPENING

INVITED TALK I
------------------------------------
9:00-10:30    From Refutation to Verification
                             John Rushby - SRI International

SESSION 1 - VERIFICATION AND THEOREM PROVING
------------------------------------
11:00-11:30   Formal Verification of the TTP Group Membership Algorithm
                                H. Pfeifer (Ulm Univ.)
11:30-12:00   Verification of a Sliding Window Protocol Using IOA and MONA
                                M. A. Smith (IRISA), N. Klarlund (AT&T Labs
Research)
12:00-12:30   A Priori Verification of Reactive Systems
                                M. Majster-Cederbaum, F. Salger, M. Sorea
(Mannheim Univ.)

SESSION 2 - TEST GENERATION
------------------------------------
14:00 - 14:30   From Rule-based to Automata-based Testing
                                  K. Etessami, M. Yannakakis (Bell Labs)
14:30 - 15:00   Integrated System Interoperability Testing with
Applications to VOIP
                                  N. Griffeth, R. Hao, D. Lee, R. K. Sinha
(Bell Labs)
15:00 - 15:30   On Test Derivation from Partial Specifications
                                  A. Petrenko (CRIM), N. Yevtushenko (Tomsk
State Univ.)

SESSION 3 - MODEL CHECKING - THEORY
------------------------------------
16:00-16:30   Compositional Model Checking
                                A. Santone (Pisa Univ.)
16:30-17:00   A Model Checking Method for Partially Symmetric Systems
                                S. Haddad (Paris Dauphine Univ.),
                                J.-M. Ilié, K. Ajami (Paris VI Univ.)

INDUSTRIAL PRESENTATION
------------------------------------
17:00-18:00   TEsTing RAdio Protocols.How to obtain benefits by the
application of
                      Formal Description Techniques to the Software
Development Process.
                                 Vincenzo Cipolla - Marconi Communications





===============================================
THURSDAY, OCT. 12
===============================================

8:30   Registration

INVITED TALK II
------------------------------------
9:00-10:30   Process Algebraic Analysis of Cryptographic Protocols
                              Rocco de Nicola - Florence Univ.

SESSION 4 - MODEL CHECKING - APPLICATIONS
------------------------------------
11:00-11:30   Specification and Verification of Message Sequence Charts
                                D. Peled (Bell Labs)
11:30-12:00   A State-Exploration Technique for Spi-Calculus Testing
Equivalence Verification
                                L. Durante, R. Sisto (Politecnico Torino),
A. Valenzano (CNR-IRITI)
12:00-12:30   Verification of Consistency Protocols via Infinite-State
Symbolic Model Checking
                                G. Delzanno (Genova Univ.)

SESSION 5 - MULTICAST PROTOCOL ANALYSIS AND SIMULATION
------------------------------------
14:00 - 14:30   Systematic Performance Evaluation of Multipoint Protocols
                                  A. Helmy, S. Gupta, D. Estrin, A. Cerpa,
Y. Yu (Univ. Southern California)
14:30-15:00   Simulating Multicast Transport Protocols in Estelle
                                J. Templemore-Finlayson (INT Evry), E.
Borcoci (Univ. Politec. Bucharest)
15:00-15:30   Generation of Realistic Signalling Traffic in an ISDN Load
Test System
                          using SDL User Models
                                T. Steinert (Univ. Stuttgart), G. Roessler
(Tenovis)

SESSION 6 - EXHAUSTIVE AND PROBABILISTIC TESTING
------------------------------------
16:00-16:30   Satisfaction up to Liveness
                                U. Ultes-Nitsche (Univ. of Southampton)
16:30-17:00   Testing IP Routing Protocols - From Probabilistic Algorithms
                       to a Software Tool
                                R. Hao, D. Lee, R. K. Sinha, D. Vlah (Bell
Labs)





===============================================
FRIDAY, OCT. 13
===============================================

INVITED TALK III
------------------------------------
9:00-10:30   A Logic of Belief and a Model Checking Algorithm for Security
Protocols
         		  Fausto Giunchiglia - IRST and Trento Univ.

SESSION 7 - HARDWARE SPECIFICATION, IMPLEMENTATION AND TESTING
------------------------------------
11:00-11:30   Verifying and Testing Asynchronous Circuits using LOTOS
                                J. He, K. Turner (Univ. of Stirling)
11:30-12:00   Hardware implementation of Concurrent Periodic EFSM
                                H. Katagiri, M. Kirimura (Osaka Univ.), K.
Yasumoto (Shiga Univ.),
                                T. Higashino, K. Taniguchi (Osaka Univ.)
12:00-12:30   Modelling Distributed Embedded Systems in Multiclock ESTEREL
                                B. Rayan, R. K. Shyamasundar (Tata Institute)

SESSION 8 - FORMAL SEMANTICS
------------------------------------
14:00 -14:30   Compact Net Semantics for Process Algebras
                                 M. Bernardo, M. Ribaudo (Univ. Torino), N.
Busi (Univ. Bologna)
14:30-15:00   A Concise Compositional Statecharts Semantics Definition
                                 M. von der Beeck (Munich Univ. of Technology)
15:00-15:30   Implementing CCS in Maude
                                A. Verdejo, N. Martí-Oliet (Univ.
Complutense Madrid)

15:30-15:45   CLOSING

=================================================================



From owner-reliable_computing [at] interval [dot] usl.edu  Sat Jul  8 02:19:51 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id CAA10193
	for reliable_computing-outgoing; Sat, 8 Jul 2000 02:19:51 -0500 (CDT)
Received: from into.nit.spb.ru (ns.nit.spb.ru [212.193.6.225])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id CAA10188
	for <reliable_computing [at] interval [dot] usl.edu>; Sat, 8 Jul 2000 02:19:45 -0500 (CDT)
Received: from slava.UUCP (uucp@localhost)
	by into.nit.spb.ru (8.8.7/8.8.7) with UUCP id LAA14470
	for reliable_computing [at] interval [dot] usl.edu; Sat, 8 Jul 2000 11:21:28 +0400 (MSD)
	(envelope-from slava.nit.spb.su!nest [at] slava [dot] nit.spb.su)
Received: by slava.nit.spb.su (dMail for DOS v1.23, 15Jun94);
          Sat,  8 Jul 2000 11:00:31 +0400
To: reliable_computing [at] interval [dot] usl.edu
Message-Id: <ABF6jPv0rA [at] slava [dot] nit.spb.su>
Organization: Slava Nesterov
Date: Sat,  8 Jul 2000 11:00:31 +0400 (MSD)
Reply-To: nest [at] into [dot] nit.spb.su
From: "Slava Nesterov" <nest [at] slava [dot] nit.spb.su>
X-Mailer: dMail [Demos Mail for DOS v1.23]
Subject: Reliable Computing, Vol.6, issue 4
Lines: 39
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

            Reliable Computing
            Volume 6, Issue 4, 2000

Special Issue
Proceedings of the International Conference on Rational Approximation
ICRA99
June 6-11, 1999, Antwerp, Belgium
Guest Editors: Annie Cuyt and Brigitte Verdonk

Foreword
363

Effective Computation of Rational Approximants and Interpolants
Bernhard Beckermann, George Labahn
365-390

Rational Interpolation from Stochastic Data: A New Froissart's
Phenomenon
Jean-Daniel Fournier, Maciej Pindor
391-409

Reliability of Lanczos-Type Product Methods  from Perturbation Theory
Peter R. Graves-Morris
411-428

Hybrid Rational Function Approximation and Its Accuracy Analysis
Hiroshi Kai, Matu-Tarow Noda
429-438

Numerical Computation of the Least Common Multiple of a Set of
Polynomials
Nicos Karcanias, Marilena Mitrouli
439-457

On Factorization of Analytic Functions and Its Verification
Tetsuya Sakurai, Hiroshi Sugiura
459-470




From owner-reliable_computing [at] interval [dot] usl.edu  Sat Jul  8 05:11:59 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id FAA11394
	for reliable_computing-outgoing; Sat, 8 Jul 2000 05:11:59 -0500 (CDT)
Received: from elm.fernuni-hagen.de (elm.fernuni-hagen.de [132.176.114.24])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id FAA11389
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sat, 8 Jul 2000 05:11:55 -0500 (CDT)
Received: from hilbert.theoinf-fernuni-hagen.de (actually hilbert.fernuni-hagen.de) 
          by elm.fernuni-hagen.de via local-channel with SMTP;
          Sat, 8 Jul 2000 12:11:42 +0200
Received: by hilbert.theoinf-fernuni-hagen.de (SMI-8.6/SMI-SVR4) id MAA14603;
          Sat, 8 Jul 2000 12:11:40 +0200
Date: Sat, 8 Jul 2000 12:11:40 +0200
From: Vasco.Brattka@FernUni-Hagen.de (Vasco Brattka)
Message-Id: <200007081011.MAA14603 [at] hilbert [dot] theoinf-fernuni-hagen.de>
To: reliable_computing [at] interval [dot] louisiana.edu
Subject: CCA2000
X-Sun-Charset: US-ASCII
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

_______________________________________________________________________

    C  C  A
    2 0 0 0

    Fourth Workshop on
    Computability and Complexity in Analysis

    September 17-19, 2000, Swansea, Wales
_______________________________________________________________________

    Second Announcement and Call for Papers


    Aim

    The aim of the workshop is to bring together people interested in
    computability and complexity aspects of analysis and to explore
    connections with numerical methods, physics and, of course,
    computer science. Submissions on any aspect of these subjects are
    welcome.


    Program Committee

    Ker-I Ko (Stony Brook, USA)
    Marian Pour-El (Minnesota , USA)
    Dana Scott (Carnegie-Mellon, USA)
    Viggo Stoltenberg-Hansen (Uppsala, Sweden)
    John V. Tucker (Swansea, Wales)
    Klaus Weihrauch, chair (Hagen, Germany)
    Mariko Yasugi (Kyoto Sangyo, Japan)
    Ning Zhong (Cincinnati, USA)
    Jeff Zucker (McMaster, Canada)


    Organizing Committee

    Jens Blanck (Swansea, Wales)    csjens [at] swansea [dot] ac.uk
    Vasco Brattka (Hagen, Germany)  vasco.brattka@fernuni-hagen.de
    Peter Hertling (Hagen, Germany) peter.hertling@fernuni-hagen.de
 

    Competition & Forum

    As part of the workshop a friendly competition between systems 
    for exact real computation, organized by 
                             
    David Lester (Manchester, England) dlester [at] cs [dot] man.ac.uk 

    will take place. The systems will be run on a set of problems and 
    evaluated. The systems should compute an approximation to the exact 
    result to any predetermined accuracy. For further information, 
    including a list of proposed problems, see 

    http://www.cs.man.ac.uk/arch/dlester/arithmetic/comp.html 
                
    Competitors should give an overview of their systems. We wish to 
    inaugurate an ongoing open forum for real number programming. 
    Submissions on implementation issues are encouraged for the workshop. 


    Paper Submission

    Authors are invited to send one copy of an article either
    electronically as a PostScript file to 

    cca@fernuni-hagen.de 

    or a paper copy to

    CCA-2000
    Klaus Weihrauch
    FernUniversitaet
    D-58084 Hagen
    Germany


    Proceedings

    Preliminary proceedings will be available for the workshop in the
    form of a technical report. It is intended for final versions of 
    selected papers to be fully refereed and published in a Springer 
    Lecture Notes in Computer Science. Deadline for inclusion in the 
    preliminary proceedings is 
                                               
    15 August 2000. 


    Authors' instructions

    We advise authors to follow the guidelines for articles in the
    Springer Lecture Notes in Computer Science series, see

    http://www.springer.de/comp/lncs/authors.html

    In particular, we recommend preparing the manuscript with LaTeX2e
    and the document class llncs.cls.


    Venue

    Department of Computer Science, University of Wales Swansea.


    Accommodation

    Accomodation is available on campus for 32 pounds per night 
    including breakfast. A conference fee of 60 pounds including 2 evening 
    meals and two lunches will apply. Bookings need to be made 3 weeks in 
    advance with

    CCA 2000
    Mrs Jill Edwards
    Department of Computer Science
    University of Wales Swansea
    Singleton Park
    Swansea SA2 8PP
    UK


    Web site
    
    http://www.informatik.fernuni-hagen.de/cca/cca2000/

From owner-reliable_computing [at] interval [dot] usl.edu  Tue Jul 11 03:18:51 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id DAA16111
	for reliable_computing-outgoing; Tue, 11 Jul 2000 03:18:51 -0500 (CDT)
Received: from gatesrv.rz.unibw-muenchen.de (gatesrv.RZ.UniBw-Muenchen.de [137.193.10.21])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id DAA16106
	for <reliable_computing [at] interval [dot] usl.edu>; Tue, 11 Jul 2000 03:18:46 -0500 (CDT)
Received: from aeneas.informatik.unibw-muenchen.de (aeneas.Informatik.UniBw-Muenchen.de [137.193.60.85])
	by gatesrv.rz.unibw-muenchen.de (8.9.1b+Sun/8.9.3) with ESMTP id KAA11560;
	Tue, 11 Jul 2000 10:17:54 +0200 (MET DST)
Received: from unibw-muenchen.de (localhost [127.0.0.1])
	by aeneas.informatik.unibw-muenchen.de (8.9.1b+Sun/8.9.1) with ESMTP id KAA04772;
	Tue, 11 Jul 2000 10:17:50 +0200 (MET DST)
Message-ID: <396AD82D.29EDF192@unibw-muenchen.de>
Date: Tue, 11 Jul 2000 10:17:49 +0200
From: Andy Schuerr <Andy.Schuerr@unibw-muenchen.de>
Organization: University Bw Munich
X-Mailer: Mozilla 4.73 [en] (X11; U; SunOS 5.7 sun4u)
X-Accept-Language: en
MIME-Version: 1.0
To: "Andy.Schuerr" <Andy.Schuerr@unibw-muenchen.de>
Subject: CFP: OMER-2 - Object-oriented Modeling of Embedded RT-Systems
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

                     CALL FOR POSITION PAPERS


     O M E R - 2     Object-oriented Modeling of Embedded RT-Systems
                     (http://ist.unibw-muenchen.de/GROOM/OMER-2/)


         10 - 12 May 2001                 Herrsching am Ammersee

  9th Workshop of Working Group     "GROOM: Foundations of OO Modeling"
  of the "GI-Fachgruppe 2.1.9"      "OOSE: OO-Software-Entwicklung"

 
                              *  *  *
                              

SCOPE

  The importance of embedded real-time (RT) systems for our daily 
  life is rapidly increasing. Important application areas are e.g. 
  the aerospace, automotive, chemical process engineering, and 
  telecommunications industry. In all these areas the complexity
  and functionality of functions realized in software increases
  rapidly. Often this software is still developed using software
  engineering technologies of the eighties. As a consequence, it
  does not fulfill our expectations concerning maintenance and
  reusability of developed subcomponents.  Furthermore, it often
  suffers from a separation of functions and data. 

  These are the reasons why object-oriented (OO) approaches are
  needed that facilitate the development of reusable software
  components, which hide data and functions behind well-defined
  interfaces. The workshop OMER-2 addresses all aspects of the
  development and application of object-oriented methods (languages,
  tools, processes) for the design and implementation of embedded
  RT systems. Its main purpose is to serve as a platform for academics
  and industry as well as for tool (method) developers and users to
  exchange their experiences in this field and to discuss new trends.
  A further intention is to clarify a research agenda for the 
  OO development of embedded RT software, allowing academics to
  focus their efforts and practitioners to reflect their daily
  business.


FORMAT

  OMER-2 is planned to be an "informal" workshop (similar to its
  predecessor) with a limited number of participants (authors of
  position paper submissions will be preferred), invited talks of
  distinguished experts, short presentations of accepted submissions,
  a modeling contest, and ample time for discussions and working
  subgroups on different topics. 

INVITED SPEAKER

  * Bruce Douglass (I-Logix, Andover)

MODELING CONTEST (http://www.automotive-uml.com/mc/)

  The workshop is accompanied by a modeling contest. The best models
  will be honored with prize money and be presented at the workshop.


SUBMISSIONS

  Position papers of four to six pages pertaining to all aspects of 
  OO embedded RT system modeling are sought, not limited to the
  following:

  * Architectural styles, patterns, ...
  * Code generation from models
  * Development of reusable components
  * Experience reports of OO projects
  * Extensions of OO modeling languages
  * Testing and verification strategies

  Submissions should be sent as pdf- or ps-files to

    mailto:omer [at] ist [dot] unibw-muenchen.de

  The proceedings of OMER-2 will be published as a technical report. 
  Authors of selected submissions will be invited to submit a journal 
  paper version after the workshop.


DEADLINES

  Deadline for position papers: March 1st, 2001
  Notification of authors:      April 1st, 2001
  Registration for workshop:    April 11th, 2001


LOCAL ORGANIZATION

  A. Schuerr (Andy.Schuerr [at] ist [dot] unibw-muenchen.de)
  Institute for Software Technology
  University of the Federal Armed Forces, Munich
  D-85577 Neubiberg, Germany

PROGRAM COMMITTEE

  P. Hofmann, DaimlerChrysler, Esslingen (co-chair)
  A. Schuerr, University Bw, Muenchen (co-chair)
  M. von der Beeck, TU Muenchen 
  M. Cohen, I-Logix, Andover
  W. Damm, OFFIS, Oldenburg
  G. Engels, University of Paderborn
  M. Fuchs, BMW, Muenchen
  D. Hogrefe, University of Luebeck
  J. Hooman, University of Nijmegen
  J. Kaiser, Universitaet Ulm
  B. Moller-Pedersen, Ericsson AS, Billingstad
  U. Pansa, Telelogic Germany
  A. Radermacher, Siemens AG, Muenchen
  R. Resch, Berner & Mattner GmbH, Muenchen
  St. Schmerler, FZI Karlsruhe
  B. Selic, ObjecTime Limited, Kanata
  A. Shaw, University of Washington, Seattle
  H.-Ch. von der Wense, Motorola GmbH, Muenchen
  J. Ziegler, Nokia, Helsinki

From owner-reliable_computing [at] interval [dot] usl.edu  Fri Jul 21 01:37:30 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id BAA04289
	for reliable_computing-outgoing; Fri, 21 Jul 2000 01:37:29 -0500 (CDT)
Received: from gcet_int.gcet.ac.in (PPP49-36.ahd.vsnl.net.in [202.54.49.36])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id BAA04284
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 21 Jul 2000 01:37:01 -0500 (CDT)
Received: from CABIN2 by gcet_int.gcet.ac.in with SMTP (Microsoft Exchange Internet Mail Service Version 5.0.1460.8)
	id 3FTBC15P; Fri, 21 Jul 2000 12:07:33 +0530
Message-ID: <002c01bff2de$16fdb350$170a0a0a [at] gcet [dot] ac.in>
From: "Mr. Ketan Kotecha" <kk [at] gcet [dot] ac.in>
To: <reliable_computing [at] interval [dot] usl.edu>
Subject: forte-fortran-95
Date: Fri, 21 Jul 2000 12:06:42 +0530
MIME-Version: 1.0
Content-Type: multipart/alternative;
	boundary="----=_NextPart_000_0029_01BFF30C.21D2E650"
X-Priority: 3
X-MSMail-Priority: Normal
X-Mailer: Microsoft Outlook Express 5.00.2314.1300
X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2314.1300
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

This is a multi-part message in MIME format.

------=_NextPart_000_0029_01BFF30C.21D2E650
Content-Type: text/plain;
	charset="iso-8859-1"
Content-Transfer-Encoding: quoted-printable

Is Sun's forte-Fortran-95  availble on Windows platform?
What is the price?

------=_NextPart_000_0029_01BFF30C.21D2E650
Content-Type: text/html;
	charset="iso-8859-1"
Content-Transfer-Encoding: quoted-printable

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD>
<META content=3D"text/html; charset=3Diso-8859-1" =
http-equiv=3DContent-Type>
<META content=3D"MSHTML 5.00.2314.1000" name=3DGENERATOR>
<STYLE></STYLE>
</HEAD>
<BODY bgColor=3D#ffffff>
<DIV><FONT face=3DArial size=3D2>Is Sun's forte-Fortran-95&nbsp; =
availble on Windows=20
platform?</FONT></DIV>
<DIV><FONT face=3DArial size=3D2>What is the =
price?</FONT></DIV></BODY></HTML>

------=_NextPart_000_0029_01BFF30C.21D2E650--


From owner-reliable_computing [at] interval [dot] usl.edu  Fri Jul 21 05:22:49 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id FAA05525
	for reliable_computing-outgoing; Fri, 21 Jul 2000 05:22:48 -0500 (CDT)
Received: from d15.ucs.usl.edu (rbk5287 [at] d15 [dot] ucs.usl.edu [130.70.112.15])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id FAA05520
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 21 Jul 2000 05:22:45 -0500 (CDT)
Received: (from rbk5287@localhost)
	by d15.ucs.usl.edu (8.9.1/8.9.1/ucs-client_1.3) id FAA26642;
	Fri, 21 Jul 2000 05:21:56 -0500 (CDT)
Date: Fri, 21 Jul 2000 05:21:56 -0500 (CDT)
From: Kearfott Ralph B <rbk5287 [at] louisiana [dot] edu>
Message-Id: <200007211021.FAA26642 [at] d15 [dot] ucs.usl.edu>
To: Bill.Walster [at] Eng [dot] Sun.COM, kk [at] gcet [dot] ac.in,
        reliable_computing [at] interval [dot] usl.edu
Subject: Re: forte-fortran-95
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Probably the most appropriate person to answer this question is
someone within Sun, or perhaps you can look at the Sun web page.

However, based on the traditional marketing strategy of Sun, I
seriously doubt it would be available for MS-Windows.
Nonetheless, Sun has a version of its Solaris operating system
for Intel-based machines, and there's a good chance that the
compiler will be available for that system.  There's also a
chance (perhaps not as good a one) that the compiler will be
available for Linux.

Again, I probably should have looked (or asked) Sun directly
about this. Anyone who has looked this up, or who knows, please
feel free to post the answer to this list.

Best regards,

Baker

	From: "Mr. Ketan Kotecha" <kk [at] gcet [dot] ac.in>
	To: <reliable_computing [at] interval [dot] usl.edu>
	Subject: forte-fortran-95
	Date: Fri, 21 Jul 2000 12:06:42 +0530

	Is Sun's forte-Fortran-95  availble on Windows platform?
	What is the price?


From owner-reliable_computing [at] interval [dot] usl.edu  Fri Jul 21 06:48:51 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id GAA05871
	for reliable_computing-outgoing; Fri, 21 Jul 2000 06:48:51 -0500 (CDT)
Received: from yonge.cs.toronto.edu (root [at] yonge [dot] cs.toronto.edu [128.100.1.8])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with SMTP id GAA05866
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 21 Jul 2000 06:48:47 -0500 (CDT)
Received: from jane.cs.toronto.edu ([128.100.2.31]) by yonge.cs.toronto.edu with SMTP id <33966-23052>; Fri, 21 Jul 2000 07:48:39 -0400
Received: from qew.cs.toronto.edu by jane.cs.toronto.edu id <453138-18344>; Fri, 21 Jul 2000 07:48:30 -0400
From: Ken Jackson <krj [at] cs [dot] toronto.edu>
To: reliable_computing [at] interval [dot] usl.edu
Subject: Re: Announcement:  2001-02 NA Year at the Fields Institute in Toronto
Cc: krj [at] cs [dot] toronto.edu
Message-Id: <00Jul21.074830edt.453138-18344 [at] jane [dot] cs.toronto.edu>
Date: 	Fri, 21 Jul 2000 07:48:24 -0400
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

The Fields Institute in Toronto is sponsoring a Thematic Year on
"Numerical and Computational Challenges in Science and Engineering"
(NCCSE) from August 2001 to July 2002.  The main point of this
announcement is to inform the scientific computing committee about this
event so that any people interested in participating can include it in
their plans for 2001-02.

A key to the success of this program will be the senior long-term
visitors that it attracts. Their research interests will shape many of
the events that take place during the year and their participation in
the program will attract many junior colleagues, postdocs and graduate
students.

We are now considering applications from senior researchers to visit
the Fields Institute for a month or more, possibly spread out over
several shorter visits, such as a couple of weeks around two or more
workshops or one day each week for a term.  We would particularly
welcome visitors for one or both terms of the year.

We have some funds to support travel and local expenses for senior
researchers, but not to pay their salaries. If you are a senior
researcher interested in participating in the program, please e-mail
Ken Jackson at krj [at] cs [dot] utoronto.ca.

More information about the Fields Institute in general and the NCCSE
Thematic Year in particular can be found at

        http://www.fields.utoronto.ca

and

        http://www.fields.utoronto.ca/numerical.html

respectively.




From owner-reliable_computing [at] interval [dot] usl.edu  Fri Jul 21 10:04:48 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA06308
	for reliable_computing-outgoing; Fri, 21 Jul 2000 10:04:47 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA06303
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 21 Jul 2000 10:04:44 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.10.1/8.10.1) with SMTP id e6LF4bg07301
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 21 Jul 2000 09:04:38 -0600 (MDT)
Message-Id: <200007211504.e6LF4bg07301 [at] cs [dot] utep.edu>
Date: Fri, 21 Jul 2000 09:04:37 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: Special issue of the TCS
To: reliable_computing [at] interval [dot] louisiana.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: 8YgBPSGT36zFJz3hO+zREg==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


------------- Begin Forwarded Message -------------

Date: Fri, 21 Jul 2000 15:30:05 +0200 (MEST)
From: Peter Kornerup <kornerup [at] imada [dot] sdu.dk>
To: RNC4 List: ;
Subject: Special issue of the TCS
MIME-Version: 1.0

Dear Colleague,

As promised in the information on the 4th "Real Numbers and Computers"
held at Scloss Dagstuhl last April, we have now obtained the approval of 
a special issue of the journal "Theoretical Computer Science". Please
consider if you may have a paper suitable to submit.

I apologize if you receive this message more than once.

Best Regards,

Peter Kornerup

           ----------- CALL FOR PAPERS: Please distribute ----------


                       Theoretical Computer Science

                Special issue: Real Numbers and Computers

                        
Guest Editors: Jean-Claude Bajard, Christiane Frougny, Jean-Michel Muller
               and Peter Kornerup.


Important Dates:

 - Deadline for submissions of manuscripts (full papers only; extended 
   abstracts will be rejected):  January 5, 2001

 - Notification of acceptance/rejection: March 15, 2001

 - Deadline for reception of final papers: April 16, 2001

Efficient manipulation  of (some)  real   numbers in computers is  still  a
challenge!   Many  interesting  theoretical   and algorithmic  problems are
linked with that topic, and belong to quite distant fields such as computer
science, number theory, numerical analysis, computer algebra and logics.  A
number of  TCS special issues on real  numbers and computers has previously
been issued, as  follow-up to the now bi-annual  meetings on  these topics,
the last one being RNC4 which took place at Schloss Dagstuhl in April 2000,
proceeding of which can be found at the following URL:

http://www.dagstuhl.de/DATA/Events/00/00162.proceedings/

The success of these meetings and  the special issues  of the TCS has shown
an increasing interest  for such questions  in many scientific communities.
The  aim   of this new  special issue   of the TCS   is likewise  to gather
contributions on what is becoming a new active research domain.  Scientists
working on questions related to  real computer arithmetic are encouraged to
present the theoretical or algorithmic aspects of their results.

Email a PostScript version of your full paper to:

              kornerup [at] imada [dot] sdu.dk
              (subject: TCS)

before January 5!!!  Please clearly indicate that your submission is to the
special issue of TCS.

Make sure that your  PostScript file  can be  printed  on a standard  laser
printer. Another possible check is to view it by Ghostscript.

Language: English.

--------
Peter Kornerup                 | Email: kornerup [at] imada [dot] sdu.dk 
Dept. of Math. & Comp. Science | URL: http://www.imada.sdu.dk/~kornerup/
SDU/Odense University          | Phone: +45 6550 2357
DK-5230 Odense M, DENMARK      | Fax: +45 6593 2691, Home: +45 6591 0395

------------- End Forwarded Message -------------



From owner-reliable_computing [at] interval [dot] usl.edu  Fri Jul 21 10:14:46 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA06562
	for reliable_computing-outgoing; Fri, 21 Jul 2000 10:14:46 -0500 (CDT)
Received: from lukla.Sun.COM (lukla.Sun.COM [192.18.98.31])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA06556
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 21 Jul 2000 10:14:42 -0500 (CDT)
Received: from engmail1.Eng.Sun.COM ([129.146.1.13])
	by lukla.Sun.COM (8.9.3+Sun/8.9.3) with ESMTP id JAA10667
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 21 Jul 2000 09:14:39 -0600 (MDT)
Received: from susila.eng.sun.com (susila.Eng.Sun.COM [129.146.79.72])
	by engmail1.Eng.Sun.COM (8.9.3+Sun/8.9.3/ENSMAIL,v1.7) with ESMTP id IAA04690;
	Fri, 21 Jul 2000 08:08:37 -0700 (PDT)
Received: from susila (susila [129.146.79.72])
	by susila.eng.sun.com (8.9.3+Sun/8.9.3) with SMTP id IAA23528;
	Fri, 21 Jul 2000 08:08:36 -0700 (PDT)
Message-Id: <200007211508.IAA23528 [at] susila [dot] eng.sun.com>
Date: Fri, 21 Jul 2000 08:08:36 -0700 (PDT)
From: "Gregory V. Tarsy" <gvt [at] susila [dot] eng.sun.com>
Reply-To: "Gregory V. Tarsy" <gvt [at] susila [dot] eng.sun.com>
Subject: Re: forte-fortran-95
To: reliable_computing [at] interval [dot] usl.edu, kk [at] gcet [dot] ac.in
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: 73iG0onSSe4ymOfC4rUNzQ==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Forte Fortran95 is only available on Solaris/SPARC platforms.




........................................
Gregory V. Tarsy, Ph.D.
Manager, Floating Point and Performance
Sun Microsystems Inc. M/S MPK16-303
901 San Antonio Ave. Palo Alto, CA 94303
V:(650)786-8908 F:(650)786-9551
gvt [at] eng [dot] sun.com
........................................

#From: "Mr. Ketan Kotecha" <kk [at] gcet [dot] ac.in>
#To: <reliable_computing [at] interval [dot] usl.edu>
#Subject: forte-fortran-95
#Date: Fri, 21 Jul 2000 12:06:42 +0530
#MIME-Version: 1.0
#X-Priority: 3
#X-MSMail-Priority: Normal
#X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2314.1300
#
#Is Sun's forte-Fortran-95  availble on Windows platform?
#What is the price?


From owner-reliable_computing [at] interval [dot] usl.edu  Sat Jul 22 14:49:28 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id OAA08788
	for reliable_computing-outgoing; Sat, 22 Jul 2000 14:49:27 -0500 (CDT)
Received: from gauss.Mines.EDU (gauss.Mines.EDU [138.67.22.33])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id OAA08783
	for <reliable_computing [at] interval [dot] usl.edu>; Sat, 22 Jul 2000 14:49:23 -0500 (CDT)
Received: (from xwu@localhost)
	by gauss.Mines.EDU (8.9.3/8.9.3) id NAA16733
	for reliable_computing [at] interval [dot] usl.edu; Sat, 22 Jul 2000 13:42:52 -0600 (MDT)
From: Xindong Wu <xwu [at] gauss [dot] Mines.EDU>
Message-Id: <200007221942.NAA16733 [at] gauss [dot] Mines.EDU>
Subject: Knowledge and Information Systems: Vol 2 No 3 (2000)
To: reliable_computing [at] interval [dot] usl.edu
Date: Sat, 22 Jul 100 13:42:52 -0600 (MDT)
X-Mailer: ELM [version 2.4 PL25]
MIME-Version: 1.0
Content-Type: text/plain; charset=US-ASCII
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

     Knowledge and Information Systems: An International Journal
     -----------------------------------------------------------
                            ISSN 0219-1377
                          by Springer-Verlag

                Home Page: http://kais.mines.edu/~kais/
                =======================================

Volume 2, Number 3 (August 2000): Table of Contents
---------------------------------------------------

Critical Reviews

  - The State of the Art in Agent Communication Languages
    by Mamadou Tadiou Kone, Akira Shimazu and Tatsuo Nakajima

Regular Papers

  - Simulating the Ecology of Oligopoly Competition with Genetic
    Algorithms
    by Shu-Heng Chen and Chih-Chi Ni
  - Intentions in the Coordinated Generation of Graphics and Text
    from Tabular Data
    by Massimo Fasciano and Guy Lapalme
  - An Intelligent Decision Support System for Investment Analysis
    by K.L. Poh

Short Papers

  - Spatio-Temporal Analysis with the Self-Organizing Feature Map
    by Susan E. George
  - A Probe-based Technique to Optimize Join Queries in Distributed
    Internet Databases
    by Cyrus Shahabi, Latifur Khan, and Dennis McLeod

From owner-reliable_computing [at] interval [dot] usl.edu  Sat Jul 22 19:25:49 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id TAA09262
	for reliable_computing-outgoing; Sat, 22 Jul 2000 19:25:49 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id TAA09257
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sat, 22 Jul 2000 19:25:45 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.10.1/8.10.1) with SMTP id e6N0PaT12511
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sat, 22 Jul 2000 18:25:36 -0600 (MDT)
Message-Id: <200007230025.e6N0PaT12511 [at] cs [dot] utep.edu>
Date: Sat, 22 Jul 2000 18:25:35 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: new server for the interval computations website
To: reliable_computing [at] interval [dot] louisiana.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: iJBT7r6L6IhQ5Yz6oo4thg==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear Friends,

As you probably know, the interval computations website resides on our 
Department's web. 

Our system administrator has moved all the web material to a new server 
http://www.cs.utep.edu which is only doing the web connections (all the other 
system functions stay with the previous server http://cs.utep.edu). 

Since we now have a special server which only does web connections, this should 
lead to a faster and more reliable connection to all our web material. 

If you use the old address http://cs.utep.edu/interval-comp, you can still get 
the access, but since it goes through the old server, you will not notice any 
improvement in the connection speed. To utilize this speed up, it is necessary 
to link to the interval computations page as 
http://www.cs.utep.edu/interval-comp, with "www" before "cs". 

Please change your bookmarked links accordingly. Again, there is no big problem 
if you keep the old URL, but if you use the new one hopefully the connection 
will be faster.

If there are any problems with the old or new URL's please let me know.

Sorry for the inconvenience and I hope that increased access speed will be a 
compensation for it.

Thanks

Vladik


From owner-reliable_computing [at] interval [dot] usl.edu  Sun Jul 23 08:18:35 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id IAA10954
	for reliable_computing-outgoing; Sun, 23 Jul 2000 08:18:35 -0500 (CDT)
Received: from henoch.cc.fh-lippe.de (henoch.cc.fh-lippe.de [193.16.112.72])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id IAA10949
	for <reliable_computing [at] interval [dot] usl.edu>; Sun, 23 Jul 2000 08:18:30 -0500 (CDT)
Received: from spock.cc.fh-lippe.de([193.16.118.120]) (3363 bytes) 
	by henoch.cc.fh-lippe.de
	via sendmail with P:esmtp/R:inet_hosts/T:smtp
	(sender: <helder [at] cc [dot] fh-lippe.de>) 
	id <m13GLeG-0000VDC [at] henoch [dot] cc.fh-lippe.de>
	for <reliable_computing [at] interval [dot] usl.edu>; Sun, 23 Jul 2000 15:18:28 +0200 (MET DST)
	(Smail-3.2.0.111 2000-Feb-17 #1 built 2000-Mar-17)
Received: from aleph(placida.cc.fh-lippe.de[193.16.112.184]) (2974 bytes) by spock.cc.fh-lippe.de
	via sendmail with P:smtp/R:smart_host/T:smtp
	(sender: <helder [at] cc [dot] fh-lippe.de>) 
	id <m13GLeE-0006yvC [at] spock [dot] cc.fh-lippe.de>
	for <reliable_computing [at] interval [dot] usl.edu>; Sun, 23 Jul 2000 15:18:26 +0200 (MET DST)
	(Smail-3.2.0.111 2000-Feb-17 #1 built 2000-Mar-17)
Message-ID: <013601bff4a7$df19f7c0$a67010c1@aleph>
Reply-To: "Norbert Heldermann" <helder [at] cc [dot] fh-lippe.de>
From: "Norbert Heldermann" <helder [at] cc [dot] fh-lippe.de>
To: <reliable_computing [at] interval [dot] usl.edu>
Subject: JCA 7 (2000) Number 1 has appeared
Date: Sun, 23 Jul 2000 15:13:10 +0200
MIME-Version: 1.0
Content-Type: text/plain;
	charset="iso-8859-1"
Content-Transfer-Encoding: 7bit
X-Priority: 3
X-MSMail-Priority: Normal
X-Mailer: Microsoft Outlook Express 5.00.2615.200
X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2615.200
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear Collegues:

Number 1 of Volume 7 (2000) of the Journal of Convex Analysis has just
appeared. We have completed today the shipping of all issues to editors,
authors and subscribers.

The distribution of reprints and free copies to authors has also been done.

You find the list of contents below. This list -- enriched with abstracts --
can also be found on our web site:
www.heldermann.de/jcacon.htm.

Finally I would like to draw your attention to the "Journal Price Survey",
published by the American Mathematical Society at
http://www.ams.org/index/membership/journal-survey.html

I have ordered the 251 journals in this list according to the parameter
"price per page". The resulting Excel list is available from me upon
request.

The Journal of Convex Analysis achieved place 37. Five journals of
Heldermann Verlag achieved places among the 37 leading publications -- a
remarkable result.

Finally I would like to draw your attention also to the list of forthcoming
papers in JCA, which you find at
http://www.heldermann.de/jcafopa.htm

Sincerely yours, Norbert Heldermann.

Heldermann Verlag, www.heldermann.de
Email heldermann [at] gmx [dot] net

Journal of Convex Analysis 7 (2000) Number 1:

D. Aze, S. Bolintineanu
Optimality Conditions for Constrained Convex Parabolic Control Problems Via
Duality
001--018

K.-W. Zhang
Rank-One Connections at Infinity and Quasiconvex Hulls
019--046

A. Eberhard, R. Wenczel
Epi-Distance Convergence of Parametrised Sums of Convex Functions in
Non-Reflexive Spaces
047--072

M. Finzel, W. Li
Piecewise Affine Selections for Piecewise Polyhedral Multifunctions and
Metric Projections
073--094

J.-P. Penot, C. Zalinescu
Harmonic Sum and Duality
095--114

A. Verona, M. E. Verona
Regular Maximal Monotone Operators and the Sum Theorem
115--128

S. Markov
On the Algebraic Properties of Convex Bodies and Some Applications
129--166

G. Crasta, A. Malusa
Euler-Lagrange Inclusions and Existence of Minimizers for a Class of
Non-Coercive Variational Problems
167--182

B. Aghezzaf, S. Sajid
On the Second-Order Contingent Set and Differential Inclusions
183--196

F. Alvarez
Absolute Minimizer in Convex Programming by Exponential Penalty
197--202

Li Feng-Quan, Li Guang-Wei
Summability of the Solutions to Nonlinear Parabolic Equations with Measure
Data
203--208



From owner-reliable_computing [at] interval [dot] usl.edu  Sun Jul 23 16:38:27 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id QAA11582
	for reliable_computing-outgoing; Sun, 23 Jul 2000 16:38:27 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id QAA11577
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 23 Jul 2000 16:38:22 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.10.1/8.10.1) with SMTP id e6NLYOS14050;
	Sun, 23 Jul 2000 15:34:24 -0600 (MDT)
Message-Id: <200007232134.e6NLYOS14050 [at] cs [dot] utep.edu>
Date: Sun, 23 Jul 2000 15:34:23 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: simple material on interval analysis
To: kosko [at] sipi [dot] usc.edu
Cc: reliable_computing [at] interval [dot] louisiana.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: GMGPTZEjxNmUoTA4Iu85Iw==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear Bart, 

Thanks a lot for your request.

I think it is a very good idea to give students exposure to interval 
techniques. 

I do not have such material ready, but I am sending your request to the 
interval computations mailing list, hopefully, someone already has such 
material (Bill Walster was thinking of preparing something like this a while 
ago). 

Vladik

> From: Bart Kosko <kosko [at] sipi [dot] usc.edu>
 
> Do you have any simple material on interval analysis that
> would count as homework problem in an upper-division probability
> course?  That's a great way to introduce students to such concepts
> and I have many opportunities to do so.  (Secret:  I also enjoy
> working pen-and-paper problems myself.)


From owner-reliable_computing [at] interval [dot] usl.edu  Tue Jul 25 07:44:41 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id HAA15074
	for reliable_computing-outgoing; Tue, 25 Jul 2000 07:44:41 -0500 (CDT)
Received: from liasun13.epfl.ch (liasun13.epfl.ch [128.178.155.37])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id HAA15069
	for <reliable_computing [at] interval [dot] louisiana.edu>; Tue, 25 Jul 2000 07:44:38 -0500 (CDT)
Received: from liasun22.epfl.ch (root [at] liasun22 [dot] epfl.ch [128.178.155.61])
	by liasun13.epfl.ch (8.8.X/EPFL-8.1a) with ESMTP id OAA15423;
	Tue, 25 Jul 2000 14:44:04 +0200 (MET DST)
Received: from lia.di.epfl.ch (haroud@localhost [127.0.0.1])
	by liasun22.epfl.ch (8.8.X/EPFL-8.1a) with ESMTP id OAA22017;
	Tue, 25 Jul 2000 14:44:06 +0200 (MET DST)
Message-ID: <397D8B96.5F40C595 [at] lia [dot] di.epfl.ch>
Date: Tue, 25 Jul 2000 14:44:06 +0200
From: haroud <haroud [at] lia [dot] di.epfl.ch>
X-Mailer: Mozilla 4.5 [en] (X11; I; SunOS 5.6 sun4u)
X-Accept-Language: en
MIME-Version: 1.0
To: reliable_computing [at] interval [dot] louisiana.edu
CC: haroud [at] lia [dot] di.epfl.ch
Subject: Postdoc position (Lausanne, Switzerland)
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

The Swiss Federal Institute of Technology, Lausanne

    Artificial Intelligence Laboratory
        (Director: B. Faltings)

is seeking to fill a

        Post-doctoral Research Position


for research combining techniques of interval arithmetic, constraint
programming and non-linear programming, with application to real-world
constraint satisfaction and optimisation problems in numerical
domains.

Required background:


  * Ph.D. in Computer Science or Mathematics

  * Strong academic background in constraint programming and/or
     non-linear programming and optimisation

  * Interest to pursue research on combining techniques from
    different areas (interval methods, non-linear programming,
     constraint programming and large-scale local optimization)

  * Knowledge of French not essential


Conditions:


  * Competitive salary

  * International and dynamic environment

  * Lausanne, Switzerland is located on the shores of lake Geneva
     and offers one of the best living environments in Europe

  * Starting date: as soon as possible

  * Duration: 12 months (extension possible, max. 36 months)


More information about the laboratory is available on the WWW
at http://liawww.epfl.ch/

Please submit a detailed CV (with e-mail), statement of interest and
list
of publications to:

  Dr. Djamila Sam-Haroud
  Artificial Intelligence Laboratory
  LIA(DI), EPFL
  IN-Ecublens
  1015 Lausanne, Switzerland
  haroud [at] lia [dot] di.epfl.ch

who may also be contacted for further information.



--
-------------------------------------------------------------------------------
Djamila Sam-Haroud| haroud [at] lia [dot] di.epfl.ch
ArtificiaI Intelligence lab.
Swiss Federal Institute of Technology(EPFL)
DI-Ecublens, 1015 Lausanne
Switzerland.
Voice: +41 21 693 52 09     Fax: +41 21 693 52 25
-------------------------------------------------------------------------------




From owner-reliable_computing [at] interval [dot] usl.edu  Tue Jul 25 08:03:20 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id IAA15371
	for reliable_computing-outgoing; Tue, 25 Jul 2000 08:03:20 -0500 (CDT)
Received: from buffalo.ens-lyon.fr (buffalo.ens-lyon.fr [140.77.1.8])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id IAA15366
	for <reliable_computing [at] interval [dot] louisiana.edu>; Tue, 25 Jul 2000 08:03:16 -0500 (CDT)
Received: from ENS-Lyon.Fr (rye [140.77.13.119])
	by buffalo.ens-lyon.fr (8.9.1a/8.9.1) with ESMTP id PAA02072
	for <reliable_computing [at] interval [dot] louisiana.edu>; Tue, 25 Jul 2000 15:03:11 +0200 (MET DST)
Message-ID: <397D9015.6E1D6FCA@ENS-Lyon.Fr>
Date: Tue, 25 Jul 2000 15:03:17 +0200
From: Marc Daumas <Marc.Daumas@ENS-Lyon.Fr>
Organization: CNRS - LIP - INRIA
X-Mailer: Mozilla 4.74 [en] (Windows NT 5.0; U)
X-Accept-Language: fr,en
MIME-Version: 1.0
To: reliable_computing [at] interval [dot] louisiana.edu
Subject: Interval arithmetic vs. running error analysis (Wilkinson)
References: <200007230025.e6N0PaT12511 [at] cs [dot] utep.edu>
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

-----BEGIN PGP SIGNED MESSAGE-----

Dear Interval readers,

I am interested in a reference that would compare the running error
analysis method presented by Wilkinson (for example in "Error
analysis revisited" - 1986, or in pages 72-73 of Higham's 1996 book)
and a straightforward implementation with interval arithmetic. 

Many thanks.

- -- 
Marc Daumas - Charge de recherches au CNRS (LIP - ENS de Lyon)
mailto:Marc.Daumas@ENS-Lyon.Fr - http://www.ens-lyon.fr/~daumas
PGP Key FP : A3AF 0AB0 DE64 06EE AF57  7010 497B BD84 4F87 B768
ENS de Lyon - 46, allee d'Italie - 69364 Lyon Cedex 07 - FRANCE
Phone: (+33) 4 72 72 83 52 - Fax: (+33) 4 72 72 80 80

-----BEGIN PGP SIGNATURE-----
Version: PGPfreeware 6.5.3 for non-commercial use <http://www.pgp.com>

iQBFAwUBOX2B9Nfza7LJVCWlAQHB1QF/VeM0eOqhcVc8+7haK/QG1MjE2SdGra7t
GJndR2PVE5wRUhu01bKppyZEZOJ9LnTP
=4tU/
-----END PGP SIGNATURE-----

From owner-reliable_computing [at] interval [dot] usl.edu  Tue Jul 25 14:17:28 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id OAA15941
	for reliable_computing-outgoing; Tue, 25 Jul 2000 14:17:28 -0500 (CDT)
Received: from awcst094.netaddress.usa.net (awcst094.netaddress.usa.net [204.68.24.94])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with SMTP id OAA15936
	for <reliable_computing [at] interval [dot] usl.edu>; Tue, 25 Jul 2000 14:17:15 -0500 (CDT)
Received: (qmail 14330 invoked by uid 60001); 25 Jul 2000 19:17:12 -0000
Message-ID: <20000725191712.14329.qmail [at] awcst094 [dot] netaddress.usa.net>
Received: from 204.68.24.94 by awcst094 for [131.107.3.87] via web-mailer(34FM1.5A.01A) on Tue Jul 25 19:17:12 GMT 2000
Date: 25 Jul 00 14:17:12 CDT
From: ELDAR MUSAYEV <musayev [at] usa [dot] net>
To: Kearfott Ralph B <rbk5287 [at] louisiana [dot] edu>, Bill.Walster [at] Eng [dot] Sun.COM,
        kk [at] gcet [dot] ac.in, reliable_computing [at] interval [dot] usl.edu
Subject: Re: [Re: forte-fortran-95]
X-Mailer: USANET web-mailer (34FM1.5A.01A)
Mime-Version: 1.0
Content-Type: text/plain; charset=US-ASCII
Content-Transfer-Encoding: 8bit
X-MIME-Autoconverted: from quoted-printable to 8bit by interval.usl.edu id OAA15937
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


Dmitry Shiraev may know that. If I know correctly, Dima works for Sun,
but I don't know his current email.

I am also sure that such a compiler will be a major pain to move from
processor to processor.

Eldar

Kearfott Ralph B <rbk5287 [at] louisiana [dot] edu> wrote:
> Probably the most appropriate person to answer this question is
> someone within Sun, or perhaps you can look at the Sun web page.
> 
> However, based on the traditional marketing strategy of Sun, I
> seriously doubt it would be available for MS-Windows.
> Nonetheless, Sun has a version of its Solaris operating system
> for Intel-based machines, and there's a good chance that the
> compiler will be available for that system.  There's also a
> chance (perhaps not as good a one) that the compiler will be
> available for Linux.
> 
> Again, I probably should have looked (or asked) Sun directly
> about this. Anyone who has looked this up, or who knows, please
> feel free to post the answer to this list.
> 
> Best regards,
> 
> Baker
> 
> 	From: "Mr. Ketan Kotecha" <kk [at] gcet [dot] ac.in>
> 	To: <reliable_computing [at] interval [dot] usl.edu>
> 	Subject: forte-fortran-95
> 	Date: Fri, 21 Jul 2000 12:06:42 +0530
> 
> 	Is Sun's forte-Fortran-95  availble on Windows platform?
> 	What is the price?


____________________________________________________________________
Get free email and a permanent address at http://www.amexmail.com/?A=1

From owner-reliable_computing [at] interval [dot] usl.edu  Tue Jul 25 14:27:09 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id OAA16180
	for reliable_computing-outgoing; Tue, 25 Jul 2000 14:27:09 -0500 (CDT)
Received: from marnier.ucs.usl.edu (root@[130.70.40.2])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id OAA16173
	for <reliable_computing [at] interval [dot] usl.edu>; Tue, 25 Jul 2000 14:27:04 -0500 (CDT)
Received: from liberty (liberty.usl.edu [130.70.46.171])
	by marnier.ucs.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.4) with SMTP id OAA00118
	for <reliable_computing [at] interval [dot] usl.edu>; Tue, 25 Jul 2000 14:27:03 -0500 (CDT)
Message-Id: <2.2.32.20000725193219.012a388c [at] pop [dot] usl.edu>
X-Sender: rbk5287 [at] pop [dot] usl.edu
X-Mailer: Windows Eudora Pro Version 2.2 (32)
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Date: Tue, 25 Jul 2000 14:32:19 -0500
To: reliable_computing [at] interval [dot] usl.edu
From: "R. Baker Kearfott" <rbk [at] louisiana [dot] edu>
Subject: Re: [Re: forte-fortran-95]
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

I got a definitive reply from Sun personnel that the 
compiler will be available only for Solaris on Sparc.
The stated reason was that Solaris on Sparc is the most 
appropriate platform for high-performance interval computations.

Best regards,

Baker

At 02:17 PM 7/25/00 CDT, ELDAR MUSAYEV wrote:
>
>Dmitry Shiraev may know that. If I know correctly, Dima works for Sun,
>but I don't know his current email.
>
>I am also sure that such a compiler will be a major pain to move from
>processor to processor.
>
>Eldar
>
>Kearfott Ralph B <rbk5287 [at] louisiana [dot] edu> wrote:
>> Probably the most appropriate person to answer this question is
>> someone within Sun, or perhaps you can look at the Sun web page.
>> 
>> However, based on the traditional marketing strategy of Sun, I
>> seriously doubt it would be available for MS-Windows.
>> Nonetheless, Sun has a version of its Solaris operating system
>> for Intel-based machines, and there's a good chance that the
>> compiler will be available for that system.  There's also a
>> chance (perhaps not as good a one) that the compiler will be
>> available for Linux.
>> 
>> Again, I probably should have looked (or asked) Sun directly
>> about this. Anyone who has looked this up, or who knows, please
>> feel free to post the answer to this list.
>> 
>> Best regards,
>> 
>> Baker
>> 
>> 	From: "Mr. Ketan Kotecha" <kk [at] gcet [dot] ac.in>
>> 	To: <reliable_computing [at] interval [dot] usl.edu>
>> 	Subject: forte-fortran-95
>> 	Date: Fri, 21 Jul 2000 12:06:42 +0530
>> 
>> 	Is Sun's forte-Fortran-95  availble on Windows platform?
>> 	What is the price?
>
>
>____________________________________________________________________
>Get free email and a permanent address at http://www.amexmail.com/?A=1
>
>
---------------------------------------------------------------
R. Baker Kearfott,    rbk [at] louisiana [dot] edu   (337) 482-5346 (fax)
(337) 482-5270 (work)                     (337) 981-9744 (home)
URL: http://interval.louisiana.edu/kearfott.html
Department of Mathematics, University of Louisiana at Lafayette
Box 4-1010, Lafayette, LA 70504-1010, USA
---------------------------------------------------------------


From owner-reliable_computing [at] interval [dot] usl.edu  Thu Jul 27 09:30:48 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id JAA19264
	for reliable_computing-outgoing; Thu, 27 Jul 2000 09:30:48 -0500 (CDT)
Received: from lukla.Sun.COM (lukla.Sun.COM [192.18.98.31])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id JAA19259
	for <reliable_computing [at] interval [dot] usl.edu>; Thu, 27 Jul 2000 09:30:45 -0500 (CDT)
Received: from engmail1.Eng.Sun.COM ([129.146.1.13])
	by lukla.Sun.COM (8.9.3+Sun/8.9.3) with ESMTP id IAA17088
	for <reliable_computing [at] interval [dot] usl.edu>; Thu, 27 Jul 2000 08:30:38 -0600 (MDT)
Received: from ha-sims.eng.sun.com (phys-thestorkb.Eng.Sun.COM [129.146.1.232])
	by engmail1.Eng.Sun.COM (8.9.3+Sun/8.9.3/ENSMAIL,v1.7) with ESMTP id HAA28755
	for <reliable_computing [at] interval [dot] usl.edu>; Thu, 27 Jul 2000 07:30:37 -0700 (PDT)
Received: from gww (gww.Eng.Sun.COM [129.146.78.116])
 by ha-sims.eng.sun.com (Sun Internet Mail Server sims.4.0.1999.06.13.00.20)
 with SMTP id <0FYD00K961N1QE@ha-sims.eng.sun.com> for
 reliable_computing [at] interval [dot] usl.edu; Thu, 27 Jul 2000 07:30:37 -0700 (PDT)
Date: Thu, 27 Jul 2000 07:30:37 -0700 (PDT)
From: William Walster <bill.walster [at] eng [dot] sun.com>
Subject: OON: Smallest Eigenvalue Routine?
To: reliable_computing [at] interval [dot] usl.edu
Reply-to: William Walster <bill.walster [at] eng [dot] sun.com>
Message-id: <0FYD00K971N1QE@ha-sims.eng.sun.com>
MIME-version: 1.0
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4.2 SunOS 5.8 sun4u sparc
Content-type: TEXT/plain; charset=us-ascii
Content-MD5: 97loXxxa6/f1r6yuARHCgg==
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


------------- Begin Forwarded Message -------------

Date: Thu, 27 Jul 2000 12:42:32 +0000
From: Volker_Claus.Falk@t-online.de
Subject: OON: Smallest Eigenvalue Routine?
X-Sender: 320052663093-0002@t-dialin.net
To: oon-list [at] oonumerics [dot] org
MIME-version: 1.0
Content-transfer-encoding: 7BIT
X-Authentication-warning: www.oonumerics.org: majordomo set sender to 
owner-oon-list [at] oonumerics [dot] org using -f

Hi all out there,

any good idea where to find an algorithm or routine for getting 
rather quick the smallest eigenvalue (and only this one) of a 
_sparse_ matrix (want to decide if it has _negative_ eigenvalues)?

As much as I understood ARPACK++ it will only solve the whole 
eigenvalue problem and this would be useless as I need only the 
smallest value.

Any hints appreciated

Thanx

Volker C. Falk




Volker Claus Falk
Ingenieurbuero BAU+FE
Reichertsklinge 9
75323 Bad Wildbad

Germany

voice:    +49 - 7081 - 384398
fax:      +49 - 7081 - 384396
cellular: +49 - 173  - 3171711

e-mail: volker_claus.falk@t-online.de

--------------------- Object Oriented Numerics List --------------------------
* To subscribe/unsubscribe: use the handy web form at
http://oonumerics.org/oon/
* If this doesn't work, please send a note to owner-oon-list [at] oonumerics [dot] org

------------- End Forwarded Message -------------



From owner-reliable_computing [at] interval [dot] usl.edu  Thu Jul 27 10:40:34 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA19630
	for reliable_computing-outgoing; Thu, 27 Jul 2000 10:40:34 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA19625
	for <reliable_computing [at] interval [dot] usl.edu>; Thu, 27 Jul 2000 10:40:22 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.10.1/8.10.1) with SMTP id e6RFdiX02769;
	Thu, 27 Jul 2000 09:39:44 -0600 (MDT)
Message-Id: <200007271539.e6RFdiX02769 [at] cs [dot] utep.edu>
Date: Thu, 27 Jul 2000 09:39:42 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: Re: OON: Smallest Eigenvalue Routine?
To: reliable_computing [at] interval [dot] usl.edu, bill.walster [at] eng [dot] sun.com
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: GUh5XAO8kHciBt63FEcoIg==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear Bill, 

This may be of help:

There are many good algorithms for finding the _largest_ eigenvalue and 
eignevector of a non-negatively definite matrix A, e.g., pick a random initial 
vector x(0) and then do the following iterations: x(k+1):=Ax(k)/||Ax(k)||, 
where ||.|| is a Euclidean norm. For almost all starting vectors, this 
procedure converges to the eignevector corresponding to the largest eigenvalue, 
and the corresponding norm ||Ax(k)|| converges to the largest eigenvalue. 

There are other algorithms, but I am mentioning this simple one because it 
clearly takes advantage of the sparseness of A by cutting the time needed to 
compute the matrix-vector product Ax.

If you know a lower bound C on the negative eignevalues of your matrix M, then 
the matrix A:=|C|I-M (I the unary matrix) is non-negative definite (positive 
semidefinite) and its largest eignevalue is exactly |C|-the smallest eigenvalue 
of your matrix M. So, you can apply one of the known algorithms to compute the 
largest eigenvalue mu of A and then compute the desired smallest eignevalue of 
M as |C|-mu. 

When M is sparse, A is also sparse.

I may have misunderstood you and you are looking for a _reliable_ (interval) 
algorithm, then you have to use some interval algorithm for finding the largest 
eignevector instead of the one described above. 

Vladik

> Date: Thu, 27 Jul 2000 07:30:37 -0700 (PDT)
> From: William Walster <bill.walster [at] eng [dot] sun.com>
> Subject: OON: Smallest Eigenvalue Routine?
> To: reliable_computing [at] interval [dot] usl.edu
> MIME-version: 1.0
> Content-MD5: 97loXxxa6/f1r6yuARHCgg==
> 
> 
> ------------- Begin Forwarded Message -------------
> 
> Date: Thu, 27 Jul 2000 12:42:32 +0000
> From: Volker_Claus.Falk@t-online.de
> Subject: OON: Smallest Eigenvalue Routine?
> X-Sender: 320052663093-0002@t-dialin.net
> To: oon-list [at] oonumerics [dot] org
> MIME-version: 1.0
> Content-transfer-encoding: 7BIT
> X-Authentication-warning: www.oonumerics.org: majordomo set sender to 
> owner-oon-list [at] oonumerics [dot] org using -f
> 
> Hi all out there,
> 
> any good idea where to find an algorithm or routine for getting 
> rather quick the smallest eigenvalue (and only this one) of a 
> _sparse_ matrix (want to decide if it has _negative_ eigenvalues)?
> 
> As much as I understood ARPACK++ it will only solve the whole 
> eigenvalue problem and this would be useless as I need only the 
> smallest value.
> 
> Any hints appreciated
> 
> Thanx
> 
> Volker C. Falk
> 
> 
> 
> 
> Volker Claus Falk
> Ingenieurbuero BAU+FE
> Reichertsklinge 9
> 75323 Bad Wildbad
> 
> Germany
> 
> voice:    +49 - 7081 - 384398
> fax:      +49 - 7081 - 384396
> cellular: +49 - 173  - 3171711
> 
> e-mail: volker_claus.falk@t-online.de
> 
> --------------------- Object Oriented Numerics List 
--------------------------
> * To subscribe/unsubscribe: use the handy web form at
> http://oonumerics.org/oon/
> * If this doesn't work, please send a note to owner-oon-list [at] oonumerics [dot] org
> 
> ------------- End Forwarded Message -------------
> 


From owner-reliable_computing [at] interval [dot] usl.edu  Thu Jul 27 10:53:02 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA19904
	for reliable_computing-outgoing; Thu, 27 Jul 2000 10:53:02 -0500 (CDT)
Received: from judy.ic.ac.uk (judy.ic.ac.uk [155.198.5.28])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA19898
	for <reliable_computing [at] interval [dot] usl.edu>; Thu, 27 Jul 2000 10:52:58 -0500 (CDT)
From: h.haitao [at] ic [dot] ac.uk
Received: from juliet.ic.ac.uk ([155.198.5.4])
	by judy.ic.ac.uk with esmtp (Exim 2.12 #1)
	id 13Hpxu-0006UA-00
	for reliable_computing [at] interval [dot] usl.edu; Thu, 27 Jul 2000 16:52:54 +0100
Received: from sunfs1-gw.ps.ic.ac.uk ([155.198.164.2] helo=sunfs1.ps.ic.ac.uk)
	by juliet.ic.ac.uk with esmtp (Exim 2.12 #1)
	id 13Hpxz-0006O2-00
	for reliable_computing [at] interval [dot] usl.edu; Thu, 27 Jul 2000 16:53:00 +0100
Received: from sunv44.ps.ic.ac.uk by sunfs1.ps.ic.ac.uk (8.8.8+Sun/4.1)
          id QAA17571; Thu, 27 Jul 2000 16:52:53 +0100 (BST)
Date: Thu, 27 Jul 2000 16:52:52 +0100 (BST)
Message-Id: <22789.200007271552 [at] sunv44 [dot] ps.ic.ac.uk>
To: reliable_computing [at] interval [dot] usl.edu
Subject: Question on bounding dynamic non-linear system using Interval methods
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Content-MD5: ymw7Qecx7uZFNY9Pp9heMA==
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear all,

May I get help from you to prove theoretically the bounding on a dynamic system?

I am considering safety issue of a chemical reactor with a cooling jacket. In the 
reactor, there is a exothermic first order reaction (A to B) taking place. This is a 
dynamic system (the temperature (T) and conversion (X) of A in the reactor is changing 
with time). The safety concerns are that the T must be less than a maximum temperature 
(Tmax) during the reaction time horizon and the final conversion X (at the end of time 
horizon ) should be greater than a minimum conversion (Xmin). The dynamic equations for 
the system are:

dX/dt = k*R*T(1 - X)        (1);
k = k1*exp(-E/(R*T))        (2);
Cp*(dT/dt) = H*NA*dX + Q    (3);

T(0) = T0 (initial temperature);
X(0) = 1 (initial conversion);

In these equations, X and T vary with time t while Q is a variable parameter within the 
interval [Q_inf, Q_sup], where inf and sup represent lower bound and upper bound 
separately; the other symbols are constant.

Apparently, at given time t, the value of X and T depend on T0[T0_inf, T0_sup] and 
Q[Q_inf, Q_sup]. So the questions are :

1. How can I bound X and T for the domain region T0[T0_inf, T0_sup]*Q[Q_inf, Q_sup] at 
given time t?

2. When I discretise on time t to do the simulation, there is a stable problem with the 
delta t. I was asked to prove I have get the stable solution. Does any one know how to 
prove or any relevant paper (book) on this issue or methods avoiding discretising to do 
the job?

3. After discretising, I use the following way to bound X and T,

   X_inf(t+1) = f1(X_inf(t), T_inf(t))
   X_sup(t+1) = f1(X_sup(t), T_sup(t))
   
    where f1 means equation (1)
    
    
   T_inf(t+1) = f3(X_sup(t), T_inf(t), Q_inf)
   T_sup(t+1) = f3(X_inf(t), T_sup(t), Q_sup)
   
   where f3 means equation (3)
   
   While this bound method is numerally proved, I can not prove it theoretically. Does 
any one can help me on this or any other good bounding (inclusion) method? 
   


Thanks in advance


Haitao 

From owner-reliable_computing [at] interval [dot] usl.edu  Thu Jul 27 10:56:05 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA20071
	for reliable_computing-outgoing; Thu, 27 Jul 2000 10:56:04 -0500 (CDT)
Received: from marnier.ucs.usl.edu (root@[130.70.40.2])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA20065
	for <reliable_computing [at] interval [dot] usl.edu>; Thu, 27 Jul 2000 10:56:00 -0500 (CDT)
Received: from u8174 (rbk5287 [at] goedel [dot] usl.edu [130.70.49.203])
	by marnier.ucs.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.4) with SMTP id KAA19795;
	Thu, 27 Jul 2000 10:55:26 -0500 (CDT)
Message-Id: <2.2.32.20000727155604.0073cdec [at] pop [dot] usl.edu>
X-Sender: rbk5287 [at] pop [dot] usl.edu
X-Mailer: Windows Eudora Pro Version 2.2 (32)
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Date: Thu, 27 Jul 2000 10:56:04 -0500
To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>,
        reliable_computing [at] interval [dot] usl.edu, bill.walster [at] eng [dot] sun.com
From: "R. Baker Kearfott" <rbk [at] louisiana [dot] edu>
Subject: Re: OON: Smallest Eigenvalue Routine?
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Vladik and colleagues,

That, of course, is just the power method, traditionally taught in a
first numerical analysis course.  More sophisticated variants include
using origin shifts and the "QR" method, which, to my understanding,
is used frequently in practice.  My understanding is that Lanczos
methods are frequently used for LARGE systems.

Regarding reliable methods, I think Alefeld et al have said some
things in the literature.  Basically, the quadratic system
AX - \lambda X = 0, along with a normalization condition, is solved
using an interval Newton method.  There are some opportunities for
taking advantage of sparsity there, although my understanding
is that, at present, the opportunities are somewhat less than 
in the point case.

Best regards,

Baker

At 09:39 AM 7/27/00 -0600, Vladik Kreinovich wrote:
>Dear Bill, 
>
>This may be of help:
>
>There are many good algorithms for finding the _largest_ eigenvalue and 
>eignevector of a non-negatively definite matrix A, e.g., pick a random initial 
>vector x(0) and then do the following iterations: x(k+1):=Ax(k)/||Ax(k)||, 
>where ||.|| is a Euclidean norm. For almost all starting vectors, this 
>procedure converges to the eignevector corresponding to the largest eigenvalue, 
>and the corresponding norm ||Ax(k)|| converges to the largest eigenvalue. 
>
>There are other algorithms, but I am mentioning this simple one because it 
>clearly takes advantage of the sparseness of A by cutting the time needed to 
>compute the matrix-vector product Ax.
>
>If you know a lower bound C on the negative eignevalues of your matrix M, then 
>the matrix A:=|C|I-M (I the unary matrix) is non-negative definite (positive 
>semidefinite) and its largest eignevalue is exactly |C|-the smallest eigenvalue 
>of your matrix M. So, you can apply one of the known algorithms to compute the 
>largest eigenvalue mu of A and then compute the desired smallest eignevalue of 
>M as |C|-mu. 
>
>When M is sparse, A is also sparse.
>
>I may have misunderstood you and you are looking for a _reliable_ (interval) 
>algorithm, then you have to use some interval algorithm for finding the largest 
>eignevector instead of the one described above. 
>
>Vladik
>
>> Date: Thu, 27 Jul 2000 07:30:37 -0700 (PDT)
>> From: William Walster <bill.walster [at] eng [dot] sun.com>
>> Subject: OON: Smallest Eigenvalue Routine?
>> To: reliable_computing [at] interval [dot] usl.edu
>> MIME-version: 1.0
>> Content-MD5: 97loXxxa6/f1r6yuARHCgg==
>> 
>> 
>> ------------- Begin Forwarded Message -------------
>> 
>> Date: Thu, 27 Jul 2000 12:42:32 +0000
>> From: Volker_Claus.Falk@t-online.de
>> Subject: OON: Smallest Eigenvalue Routine?
>> X-Sender: 320052663093-0002@t-dialin.net
>> To: oon-list [at] oonumerics [dot] org
>> MIME-version: 1.0
>> Content-transfer-encoding: 7BIT
>> X-Authentication-warning: www.oonumerics.org: majordomo set sender to 
>> owner-oon-list [at] oonumerics [dot] org using -f
>> 
>> Hi all out there,
>> 
>> any good idea where to find an algorithm or routine for getting 
>> rather quick the smallest eigenvalue (and only this one) of a 
>> _sparse_ matrix (want to decide if it has _negative_ eigenvalues)?
>> 
>> As much as I understood ARPACK++ it will only solve the whole 
>> eigenvalue problem and this would be useless as I need only the 
>> smallest value.
>> 
>> Any hints appreciated
>> 
>> Thanx
>> 
>> Volker C. Falk
>> 
>> 
>> 
>> 
>> Volker Claus Falk
>> Ingenieurbuero BAU+FE
>> Reichertsklinge 9
>> 75323 Bad Wildbad
>> 
>> Germany
>> 
>> voice:    +49 - 7081 - 384398
>> fax:      +49 - 7081 - 384396
>> cellular: +49 - 173  - 3171711
>> 
>> e-mail: volker_claus.falk@t-online.de
>> 
>> --------------------- Object Oriented Numerics List 
>--------------------------
>> * To subscribe/unsubscribe: use the handy web form at
>> http://oonumerics.org/oon/
>> * If this doesn't work, please send a note to owner-oon-list [at] oonumerics [dot] org
>> 
>> ------------- End Forwarded Message -------------
>> 
>
>
---------------------------------------------------------------
R. Baker Kearfott,    rbk [at] louisiana [dot] edu   (337) 482-5346 (fax)
(337) 482-5270 (work)                     (337) 981-9744 (home)
URL: http://interval.louisiana.edu/kearfott.html
Department of Mathematics, University of Louisiana at Lafayette
Box 4-1010, Lafayette, LA 70504-1010, USA
---------------------------------------------------------------


From owner-reliable_computing [at] interval [dot] usl.edu  Thu Jul 27 10:56:35 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA20101
	for reliable_computing-outgoing; Thu, 27 Jul 2000 10:56:34 -0500 (CDT)
Received: from homer.mat.univie.ac.at (homer.mat.univie.ac.at [131.130.145.130])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA20091
	for <reliable_computing [at] interval [dot] usl.edu>; Thu, 27 Jul 2000 10:56:28 -0500 (CDT)
Received: (from neum@localhost)
	by homer.mat.univie.ac.at (8.9.3/8.9.3) id RAA21614;
	Thu, 27 Jul 2000 17:56:13 +0200 (MET DST)
Date: Thu, 27 Jul 2000 17:56:13 +0200 (MET DST)
From: Arnold Neumaier <neum [at] cma [dot] univie.ac.at>
Message-Id: <200007271556.RAA21614 [at] homer [dot] mat.univie.ac.at>
To: bill.walster [at] eng [dot] sun.com, reliable_computing [at] interval [dot] usl.edu
Subject: Re:  OON: Smallest Eigenvalue Routine?
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

>>want to decide if it has _negative_ eigenvalues<<

Try spectrum slicing, described in Parlett's book.

Arnold Neumaier


From owner-reliable_computing [at] interval [dot] usl.edu  Thu Jul 27 11:18:59 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id LAA20872
	for reliable_computing-outgoing; Thu, 27 Jul 2000 11:18:59 -0500 (CDT)
Received: from marnier.ucs.usl.edu (root@[130.70.40.2])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id LAA20867
	for <reliable_computing [at] interval [dot] ull.edu>; Thu, 27 Jul 2000 11:18:55 -0500 (CDT)
Received: from u8174 (rbk5287 [at] goedel [dot] usl.edu [130.70.49.203])
	by marnier.ucs.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.4) with SMTP id LAA20153;
	Thu, 27 Jul 2000 11:18:26 -0500 (CDT)
Message-Id: <2.2.32.20000727161905.00744140 [at] pop [dot] usl.edu>
X-Sender: rbk5287 [at] pop [dot] usl.edu
X-Mailer: Windows Eudora Pro Version 2.2 (32)
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Date: Thu, 27 Jul 2000 11:19:05 -0500
To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
From: "R. Baker Kearfott" <rbk [at] louisiana [dot] edu>
Subject: Re: OON: Smallest Eigenvalue Routine?
Cc: reliable_computing [at] interval [dot] ull.edu
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Vladik,

Thanks.  I guess I should have read it more carefully.

Best regards,

Baker

At 10:10 AM 7/27/00 -0600, you wrote:
>Dear Baker,
>
>Thanks for an immediate reply and useful comment.
>
>I was citing this simple power method as an example, my main point is that 
>Bill's seemingly-rarely-solved problem of computing the _smallest_ eignevalue 
>is easily reducible to a more well known and well-researched problem of dinding 
>the _largest_ eignevalue (provided we know the lower bound; if we do not, then 
>we can use a lower bound based on the matrix itself. 
>
>For example (and only for example, I know that better lower bounds are 
>possible), we can take the minimum of all elements of a matrix. 
>
>> X-Sender: rbk5287 [at] pop [dot] usl.edu
>> Mime-Version: 1.0
>> Date: Thu, 27 Jul 2000 10:56:04 -0500
>> To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>, 
>reliable_computing [at] interval [dot] usl.edu, bill.walster [at] eng [dot] sun.com
>> From: "R. Baker Kearfott" <rbk [at] louisiana [dot] edu>
>> Subject: Re: OON: Smallest Eigenvalue Routine?
>> 
>> Vladik and colleagues,
>> 
>> That, of course, is just the power method, traditionally taught in a
>> first numerical analysis course.  More sophisticated variants include
>> using origin shifts and the "QR" method, which, to my understanding,
>> is used frequently in practice.  My understanding is that Lanczos
>> methods are frequently used for LARGE systems.
>> 
>> Regarding reliable methods, I think Alefeld et al have said some
>> things in the literature.  Basically, the quadratic system
>> AX - \lambda X = 0, along with a normalization condition, is solved
>> using an interval Newton method.  There are some opportunities for
>> taking advantage of sparsity there, although my understanding
>> is that, at present, the opportunities are somewhat less than 
>> in the point case.
>> 
>> Best regards,
>> 
>> Baker
>> 
>> At 09:39 AM 7/27/00 -0600, Vladik Kreinovich wrote:
>> >Dear Bill, 
>> >
>> >This may be of help:
>> >
>> >There are many good algorithms for finding the _largest_ eigenvalue and 
>> >eignevector of a non-negatively definite matrix A, e.g., pick a random 
>initial 
>> >vector x(0) and then do the following iterations: x(k+1):=Ax(k)/||Ax(k)||, 
>> >where ||.|| is a Euclidean norm. For almost all starting vectors, this 
>> >procedure converges to the eignevector corresponding to the largest 
>eigenvalue, 
>> >and the corresponding norm ||Ax(k)|| converges to the largest eigenvalue. 
>> >
>> >There are other algorithms, but I am mentioning this simple one because it 
>> >clearly takes advantage of the sparseness of A by cutting the time needed to 
>> >compute the matrix-vector product Ax.
>> >
>> >If you know a lower bound C on the negative eignevalues of your matrix M, 
>then 
>> >the matrix A:=|C|I-M (I the unary matrix) is non-negative definite (positive 
>> >semidefinite) and its largest eignevalue is exactly |C|-the smallest 
>eigenvalue 
>> >of your matrix M. So, you can apply one of the known algorithms to compute 
>the 
>> >largest eigenvalue mu of A and then compute the desired smallest eignevalue 
>of 
>> >M as |C|-mu. 
>> >
>> >When M is sparse, A is also sparse.
>> >
>> >I may have misunderstood you and you are looking for a _reliable_ (interval) 
>> >algorithm, then you have to use some interval algorithm for finding the 
>largest 
>> >eignevector instead of the one described above. 
>> >
>> >Vladik
>> >
>> >> Date: Thu, 27 Jul 2000 07:30:37 -0700 (PDT)
>> >> From: William Walster <bill.walster [at] eng [dot] sun.com>
>> >> Subject: OON: Smallest Eigenvalue Routine?
>> >> To: reliable_computing [at] interval [dot] usl.edu
>> >> MIME-version: 1.0
>> >> Content-MD5: 97loXxxa6/f1r6yuARHCgg==
>> >> 
>> >> 
>> >> ------------- Begin Forwarded Message -------------
>> >> 
>> >> Date: Thu, 27 Jul 2000 12:42:32 +0000
>> >> From: Volker_Claus.Falk@t-online.de
>> >> Subject: OON: Smallest Eigenvalue Routine?
>> >> X-Sender: 320052663093-0002@t-dialin.net
>> >> To: oon-list [at] oonumerics [dot] org
>> >> MIME-version: 1.0
>> >> Content-transfer-encoding: 7BIT
>> >> X-Authentication-warning: www.oonumerics.org: majordomo set sender to 
>> >> owner-oon-list [at] oonumerics [dot] org using -f
>> >> 
>> >> Hi all out there,
>> >> 
>> >> any good idea where to find an algorithm or routine for getting 
>> >> rather quick the smallest eigenvalue (and only this one) of a 
>> >> _sparse_ matrix (want to decide if it has _negative_ eigenvalues)?
>> >> 
>> >> As much as I understood ARPACK++ it will only solve the whole 
>> >> eigenvalue problem and this would be useless as I need only the 
>> >> smallest value.
>> >> 
>> >> Any hints appreciated
>> >> 
>> >> Thanx
>> >> 
>> >> Volker C. Falk
>> >> 
>> >> 
>> >> 
>> >> 
>> >> Volker Claus Falk
>> >> Ingenieurbuero BAU+FE
>> >> Reichertsklinge 9
>> >> 75323 Bad Wildbad
>> >> 
>> >> Germany
>> >> 
>> >> voice:    +49 - 7081 - 384398
>> >> fax:      +49 - 7081 - 384396
>> >> cellular: +49 - 173  - 3171711
>> >> 
>> >> e-mail: volker_claus.falk@t-online.de
>> >> 
>> >> --------------------- Object Oriented Numerics List 
>> >--------------------------
>> >> * To subscribe/unsubscribe: use the handy web form at
>> >> http://oonumerics.org/oon/
>> >> * If this doesn't work, please send a note to 
>owner-oon-list [at] oonumerics [dot] org
>> >> 
>> >> ------------- End Forwarded Message -------------
>> >> 
>> >
>> >
>> ---------------------------------------------------------------
>> R. Baker Kearfott,    rbk [at] louisiana [dot] edu   (337) 482-5346 (fax)
>> (337) 482-5270 (work)                     (337) 981-9744 (home)
>> URL: http://interval.louisiana.edu/kearfott.html
>> Department of Mathematics, University of Louisiana at Lafayette
>> Box 4-1010, Lafayette, LA 70504-1010, USA
>> ---------------------------------------------------------------
>
>
---------------------------------------------------------------
R. Baker Kearfott,    rbk [at] louisiana [dot] edu   (337) 482-5346 (fax)
(337) 482-5270 (work)                     (337) 981-9744 (home)
URL: http://interval.louisiana.edu/kearfott.html
Department of Mathematics, University of Louisiana at Lafayette
Box 4-1010, Lafayette, LA 70504-1010, USA
---------------------------------------------------------------


From owner-reliable_computing [at] interval [dot] usl.edu  Thu Jul 27 11:36:57 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id LAA21171
	for reliable_computing-outgoing; Thu, 27 Jul 2000 11:36:56 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id LAA21166
	for <reliable_computing [at] interval [dot] usl.edu>; Thu, 27 Jul 2000 11:36:35 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.10.1/8.10.1) with SMTP id e6RGaOG03022;
	Thu, 27 Jul 2000 10:36:24 -0600 (MDT)
Message-Id: <200007271636.e6RGaOG03022 [at] cs [dot] utep.edu>
Date: Thu, 27 Jul 2000 10:36:22 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: Re: Question on bounding dynamic non-linear system using Interval methods
To: reliable_computing [at] interval [dot] usl.edu
Cc: h.haitao [at] ic [dot] ac.uk
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: pe5E6MmVpUQi5TEnfw/RrA==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear Haitao, I am forwarding your correction to the mailing list. Vladik

------------- Begin Forwarded Message -------------

From: h.haitao [at] ic [dot] ac.uk
Date: Thu, 27 Jul 2000 17:29:37 +0100 (BST)
To: vladik [at] cs [dot] utep.edu
Subject: Re: Question on bounding dynamic non-linear system using Interval 
methods
Mime-Version: 1.0
Content-Transfer-Encoding: 7bit
Content-MD5: 3d4EV0VBE8d8kvHPqNfs5g==

> From vladik [at] cs [dot] utep.edu Thu Jul 27 17:12 BST 2000
> Date: Thu, 27 Jul 2000 10:12:17 -0600 (MDT)
> From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
> Subject: Re: Question on bounding dynamic non-linear system using Interval 
methods
> To: h.haitao [at] ic [dot] ac.uk
> MIME-Version: 1.0
> Content-MD5: Ir3PqjFYtFShxgHpHP+Xhw==
> 
> There must be a typo in your equation (3):
> 
> Cp*(dT/dt) = H*NA*dX + Q    (3);
> 
> what is dX? A new constant? 
> 

Sorry, I have not made it correct. The dX should be (\dot X in latex) dX/dt.

I am waiting for your help.

Thanks 

haitao

------------- End Forwarded Message -------------



From owner-reliable_computing [at] interval [dot] usl.edu  Fri Jul 28 11:37:21 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id LAA23237
	for reliable_computing-outgoing; Fri, 28 Jul 2000 11:37:20 -0500 (CDT)
Received: from cse.psu.edu (root [at] claven [dot] cse.psu.edu [130.203.3.50])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id LAA23232
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 28 Jul 2000 11:37:14 -0500 (CDT)
Received: from sweetpea.cse.psu.edu (barlow [at] sweetpea [dot] cse.psu.edu [130.203.8.8])
	by cse.psu.edu (8.8.8/8.8.8) with ESMTP id MAA19420
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 28 Jul 2000 12:36:54 -0400 (EDT)
Received: (from barlow@localhost)
	by sweetpea.cse.psu.edu (8.9.3+Sun/8.9.1) id MAA11106;
	Fri, 28 Jul 2000 12:36:52 -0400 (EDT)
Date: Fri, 28 Jul 2000 12:36:52 -0400 (EDT)
Message-Id: <200007281636.MAA11106 [at] sweetpea [dot] cse.psu.edu>
X-Authentication-Warning: sweetpea.cse.psu.edu: barlow set sender to barlow [at] sweetpea [dot] cse.psu.edu using -f
From: Jesse Barlow <barlow [at] cse [dot] psu.edu>
To: reliable_computing [at] interval [dot] louisiana.edu
Subject: LAA Special Issue on Accurate Solution of Eigenvalue Problems
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear Reader,
  I would like to submit this to your newsletter.

Jesse Barlow.

_____________________________________________________________________________
Jesse L. Barlow, Professor                               Phone:+1-814-863-1705
Department of Computer Science and Engineering           FAX:  +1-814-865-3176
312 Pond Laboratory                                  E-mail:barlow [at] cse [dot] psu.edu
The Pennsylvania State University           URL:http://www.cse.psu.edu/~barlow
University Park, PA 16802-6106 USA
-------------------------------------------------------------------------------


       Special Issue of Linear Algebra and Its Applications 
          ACCURATE SOLUTION OF EIGENVALUE PROBLEMS II


In the last several years, there have been a number of advances in the 
accurate solution of eigenvalue problems. Many of the results have come from 
the realization that eigenvalue algorithms that exploit the structure of the
problem can lead to more accurate eigenvalue and eigenvector computations. 
Well known examples include faster and more accurate methods for solving the
symmetric tridiagonal eigenproblem, more accurate methods for computing the
singular value decompostion, and further understanding of the conditioning 
theory for the non--symmetric eigenvalue problem.

To recognize these advances and to encourage further advances, we are 
proposing to have a special issue of Linear Algebra and Its Applications on
Accurate Solution of Eigenvalue Problems. This is the second such special 
issue. The first was volume 309 of Linear Algebra and Its Applications,
published in early 2000.

This special issue is in coordination with the International Workshop on Accurate Solution of Eigenvalue Problems  III held in Hagen, Germany on 
July 3-6,2000. The participants in the workshop have been strongly encouraged
to submit papers to the special issue. Submissions are alsowelcome from 
non-participants as long as they are consistent with the themes of
the workshop.

The editors for this special issue will be


Jesse L. Barlow
Department of Computer Science 
and Engineering 
The Pennsylvania State University
University Park, PA 16802--6106 
USA


Beresford N. Parlett
Department of Mathematics
University of California at Berkeley 
Berkeley, CA 94720
USA

Kresimir Veselic'
Fernuniversitaet Hagen 
Lehrgebeit Math. Physik 
Postfach 940 
58084 Hagen, Germany 

Please submit three (3) copies of your manuscript to the editor of your 
choice. However, if another editor is deemed more qualified to handle your
 manuscript, it may be forwarded to that editor. Manuscripts submitted to 
this special issue will be refereed according to standard procedures for
Linear Algebra and Its Applications.

All papers for this special issue should be postmarked by February 1, 2001. 



From owner-reliable_computing [at] interval [dot] usl.edu  Fri Jul 28 19:33:41 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id TAA23890
	for reliable_computing-outgoing; Fri, 28 Jul 2000 19:33:41 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id TAA23885
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 28 Jul 2000 19:33:37 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.10.1/8.10.1) with SMTP id e6T0XWR09481
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 28 Jul 2000 18:33:32 -0600 (MDT)
Message-Id: <200007290033.e6T0XWR09481 [at] cs [dot] utep.edu>
Date: Fri, 28 Jul 2000 18:33:31 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: possible faculty position in El Paso
To: reliable_computing [at] interval [dot] louisiana.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: GtWLFu2QI2CvxyxhyRVDaA==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear Friends,

This is FYI: It is highly probable that our Department of Computer Science will 
get an extra tenure-track faculty position starting from the year 2001/02, and 
interval computations is one of the targeted areas in which the Department 
would like to hire. If you are interested or if you have graduating students or 
post-docs who may be interested please contact me. 

This is not official yet, the official approval will (hopefully) come in the 
middle to late Fall, then the official ad will be sent out.  

Yours

Vladik


From owner-reliable_computing [at] interval [dot] usl.edu  Sun Jul 30 07:34:14 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id HAA27179
	for reliable_computing-outgoing; Sun, 30 Jul 2000 07:34:14 -0500 (CDT)
Received: from maebashi-it.ac.jp (zhong01.maebashi-it.ac.jp [202.236.152.193] (may be forged))
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id HAA27174
	for <reliable_computing [at] interval [dot] usl.edu>; Sun, 30 Jul 2000 07:34:09 -0500 (CDT)
Received: (from zhong@localhost)
	by maebashi-it.ac.jp (8.9.1/8.9.1) id VAA09301
	for reliable_computing [at] interval [dot] usl.edu; Sun, 30 Jul 2000 21:43:00 +0900 (JST)
	(envelope-from zhong)
Date: Sun, 30 Jul 2000 21:43:00 +0900 (JST)
From: Ning Zhong <zhong@maebashi-it.ac.jp>
Message-Id: <200007301243.VAA09301@maebashi-it.ac.jp>
To: reliable_computing [at] interval [dot] usl.edu
Subject: IEEE Data Mining 2001: Call for Papers 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

[Apologies if you receive this more than once]

----------------------------------------------------------------------
   ICDM '01: The 2001 IEEE International Conference on Data Mining
               Sponsored by the IEEE Computer Society
----------------------------------------------------------------------
                   Silicon Valley, California, USA
                    November 29 - December 2, 2001
       Home Page: http://kais.mines.edu/~xwu/icdm/icdm-01.html

                            Call for Papers
                            ***************

The  2001  IEEE International Conference  on  Data  Mining  (ICDM '01)
provides a forum  for  the sharing  of  original research results  and
practical development experiences  among  researchers  and application
developers  from different data mining related areas  such as  machine
learning,   automated   scientific   discovery,  statistics,   pattern
recognition, knowledge acquisition, soft computing, databases and data
warehousing,  data visualization,  and  knowledge-based  systems.  The
conference   seeks  solutions  to  challenging   problems  facing  the
development of data mining systems,  and  shapes  future directions of
research   by  promoting  high  quality,  novel  and  daring  research
findings.  As  an important part  of  the  conference,  the  workshops
program will focus on new research challenges and initiatives.

Topics of Interest
==================

Topics  related to  the design,  analysis  and  implementation of data
mining  theory,  systems  and  applications  are  of  interest.  These
include, but are not limited to the following areas:

  - Foundations and principles of data mining 
  - Data mining algorithms and methods in traditional areas (such as
    classification, clustering, probabilistic modeling, and
    association analysis), and in new areas
  - Data and knowledge representation for data mining 
  - Modeling of structured, textual, temporal, spatial, multimedia and
    Web data to support data mining
  - Complexity, efficiency, and scalability issues in data mining
  - Data pre-processing, data reduction, feature selection and feature
    transformation
  - Statistics and probability in large-scale data mining
  - Soft computing (including neural networks, fuzzy logic,
    evolutionary computation, and rough sets) and uncertainty
    management for data mining
  - Integration of data warehousing, OLAP and data mining 
  - Man-machine interaction in data mining and visual data mining 
  - Artificial intelligence contributions to data mining 
  - High performance and distributed data mining 
  - Machine learning, pattern recognition and automated scientific
    discovery
  - Quality assessment and interestingness metrics of data mining
    results
  - Process centric data mining and models of data mining process 
  - Security and social impact of data mining 
  - Emerging data mining applications, such as electronic commerce,
    Web mining and intelligent learning database systems

Conference Publications and ICDM Best Paper Awards
==================================================

High quality papers  in all data mining areas  are  solicited.  Papers
exploring  new  directions  will  receive  a  careful  and  supportive
review.  All submitted papers should be limited to a maximum of  6,000
words (approximately 20 A4 pages),  and  will be reviewed on the basis
of   technical  quality,  relevance  to  data   mining,   originality,
significance,  and clarity.  Accepted papers  will be published in the
conference proceedings by the IEEE Computer Society Press.  A selected
number of ICDM '01 accepted papers  will be  expanded and revised  for
possible  inclusion  in  the Knowledge and Information Systems journal
(http://kais.mines.edu/~kais/) by Springer-Verlag.

ICDM Best Paper Awards  will be conferred  on the authors  of the best
papers at the conference.

Important Dates
===============

     June 15, 2001                    Paper submissions. 
     July 31, 2001                    Acceptance notices.
     August 31, 2001                  Final camera-readies.
     Nov 29 - Dec 2, 2001             Conference.

Detailed instructions  for paper submissions  will be provided  on the
conference home page at http://kais.mines.edu/~xwu/icdm/icdm-01.html.

Conference Chair:
=================

      Xindong Wu, Colorado School of Mines, USA
         (xindong [at] computer [dot] org)
 
Program Committee Chairs:
=========================

      Nick Cercone,  University of Waterloo, Canada
         (ncercone [at] math [dot] uwaterloo.ca)
      T.Y. Lin, San Jose State University, USA
         (tylin [at] mathcs [dot] sjsu.edu)
 
ICDM '01 Workshops Chair:
=========================

      Johannes Gehrke, Cornell University, USA
         (johannes [at] cs [dot] cornell.edu)

ICDM '01 Tutorials Chair:
=========================

      Chris Clifton, MITRE, USA
         (clifton [at] mitre [dot] org)

ICDM '01 Panels Chair:
======================

      Ramamohanarao Kotagiri, University of Melbourne, Australia
         (rao [at] cs [dot] mu.oz.au)

ICDM '01 Publicity Chair:
========================= 

      Ning Zhong, Maebashi Institute of Technology, Japan
         (zhong@maebashi-it.ac.jp)
   
ICDM '01 Local Arrangements Chair:
================================== 

      Xiaohua (Tony) Hu, Blue Martini Software Inc., USA
         (tonyhu [at] bluemartini [dot] com)

ICDM Steering Committee
=======================

      Max Bramer, University of Portsmouth, UK
      Nick Cercone, University of Waterloo, Canada
      Ramamohanarao Kotagiri, University of Melbourne, Australia
      Katharina Morik, University of Dortmund, Germany
      Xindong Wu, Chair (Colorado School of Mines, USA)
      Philip S. Yu, IBM T.J. Watson Research Center, USA
      Ning Zhong, Maebashi Institute of Technology, Japan
      Jan M. Zytkow, University of North Carolina, Charlotte, USA

Further Information
===================

      Dr. Xindong Wu
      Dept. of Mathematical and Computer Sciences,
      Colorado School of Mines,
      1500 Illinois Street,
      Golden, Colorado 80401, 
      USA.

      Telephone: +1-303-273-3874
      Facsimile: +1-303-273-3875
      E-mail: xindong [at] computer [dot] org




From owner-reliable_computing [at] interval [dot] usl.edu  Wed Aug  2 20:20:30 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id UAA03319
	for reliable_computing-outgoing; Wed, 2 Aug 2000 20:20:30 -0500 (CDT)
Received: from cse.unl.edu (root [at] cse [dot] unl.edu [129.93.33.1])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id UAA03314
	for <reliable_computing [at] interval [dot] usl.edu>; Wed, 2 Aug 2000 20:20:25 -0500 (CDT)
Received: from localhost (fayad@localhost)
	by cse.unl.edu (8.9.1/8.9.1) with ESMTP id UAA1665342;
	Wed, 2 Aug 2000 20:11:43 -0500 (CDT)
Date: Wed, 2 Aug 2000 20:11:43 -0500
From: Mohamed Fayad <fayad [at] cse [dot] unl.edu>
To: Undisclosed recipients: ;
Subject: 3-vol. Book - Extended Deadline 
Message-ID: <Pine.SGI.4.05.10008022010080.1729575-100000 [at] cse [dot] unl.edu>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk



Greetings,

Based on many requests, the deadline for submissions has been extended to 
October 1, 2000.

Apologies if you recieve multitple copies of this cfcs.  Enclosed, please
find a call for chapters and reviewers.  Please post. Thank you.

Cheers,

M. Fayad

----------------------------------------------------------
***        Chapters submission: extended deadline      ***
***         >>>>>     October 1, 2000     <<<<<        ***
----------------------------------------------------------

3-volume book on
Software Architectures, Components, and Frameworks
Call for Chapters and Reviewers

Authors and Editors:

Dr. Mohamed Fayad: fayad [at] cse [dot] unl.edu, m.fayad [at] computer [dot] org,
fayadm [at] acm [dot] org, 
URL: http://www.cse.unl.edu/~fayad	

Dr. David Garlan: garlan [at] cs [dot] cmu.edu
URL: http://www.cs.cmu.edu/~garlan      
      
Professor Wolfgang Pree: pree [at] acm [dot] org
URL: www.informatik.uni-konstanz.de/swe

We are developing three-volume series of books on software architectures,
components, and frameworks. If this is your area of interest/research, I
would like to invite you to submit a chapter.  This series of books will
serve as a complete reference set for academics and practitioners. 

Volume 1: Software Architectures

The working title of the first-volume is "Software Architectures."
Architecture-based software engineering research has yielded an impressive
array of technologies and demonstrations over the past decade. Using an
architecture-based approach, applications have been built which:
- Are understandable
- Are expected to evolve
- Exhibit remarkable flexibility
- Demonstrate significant reuse of off-the-shelf components
- Leverage experience from related applications in the same problem
  domain
- Are analyzable earlier in their development than ever before
- Are key milestones in software managerial and development
  processes

Currently, there is relatively little guidance for software developers on
how to develop software architectures.  This volume addresses several
topics crucial to the state of the art and practice of software
architecture.  The book presents a complete reference on how to develop a
good software architecture and provides guidelines for resolving key
software architecture issues, such as evolving software architectures,
leveraging existing investment in software architecture artifacts,
representing architecture description languages, introducing formal models
for software architectures, addressing architectural analysis techniques &
development methods, transitioning from software architecture to coding
and surveying architectural design tools and environments. 

In addition, the book will include sections on: accessing of software
architectures, testing and validating software architectures, improving
software architecture quality, documenting software architectures, and
many more.
 
This is a pragmatic book that is specifically designed to help
organizations develop software architectures for real projects in the real
world. Comprehensive technical and management guidelines are thoroughly
discussed, ranging from specifying software architecture elements and
their behaviors, to the impact of software architecture on the job.
Likewise, technical issues (such as documenting and utilizing software
architectures) are discussed in detail.  

Volume 2: Product-Line Architectures 

The working title of the second-volume is "Product-Line Architectures".
Software product lines are emerging as a new and important software
development paradigm. A Product-Line Architecture (PLA) is a design for a
family of related applications, and its motivation is to simplify the
design and maintenance of program families and to address the needs of
highly customizable applications in an economical manner. Companies are
realizing that the practice of building sets of related systems from
common assets can yield remarkable improvements in productivity, time to
market, product quality and customer satisfaction. But these gains are
only a part of the picture; organizational, technical and management
issues are other factors that should be considered. Although there are
encouraging research experiences with PLAs and some guidelines exist to
help in the development process, some issues about component-based
development in PLAs are still under study.  The goal of this book is to
examine the foundational concepts underlying product lines and address the
essential activities developers should consider to apply a PLA to a number
of lines of products.

The book will include sections on: lessons learned in PLA-based
development, architectural specification, tools and process for software
development, core asset management, domain analysis, configuration
management, evaluation methods, quality factors involved, implementation
strategies, and many more.

Volume 3: Component-Based Software Developments & Enterprise Frameworks

The working title of the third-volume is "Component-Based Software
Development and Enterprise
Frameworks". Nowadays, software engineering is moving forward on an
architecture-based development conception where systems are built by
composing or assembling components that are often developed independently.
The key to making a large variety of software products and reducing time
to market is to build pieces of software where the development effort can
serve in other products as well.  Thus, large-grained components are
becoming a practical part of an enterprise component strategy.  Such
generic components usually include interactions with other components,
code, design models, design patterns and specifications. In addition, they
must provide ways to be adaptable and customizable according with the
client's needs.  In this context, enterprise frameworks offer an
appropriate base for waving the software architectures, components, and
core requirements into one container that is adaptable, customizable,
extensible, and reusable.

The technology of component-based systems is quite well established, but
it is not the same with the methods to develop them.  The need of
well-defined techniques, notations and architectural support is still
pending. The book will cover all these issues.

This book is intended to provide valuable, real world insight into
successful development and/or adaptation of OO Enterprise Frameworks, by
describing the problems with frameworks, explaining the issues related to
the development and adaptation of enterprise frameworks, selecting the
right methods and tools for building frameworks.  The book will be derived
from actual experiences, successes and failures, and is presented in a
practical, easy to understand manner.  This is information that readers
can apply today.  The key issues are:
+ What are the key enterprise-oriented framework issues?
+ How to develop enterprise frameworks and what are the framework
  design guidelines?
+ What kind of evolution does an Enterprise Framework undergo and
  how is it correlated with the enterprise life span?
+ How can the adaptation of OO enterprise framework be accomplished
  with minimum impact on the cost and schedule?
+ Understand make vs. buy decisions, selection guidelines, and how
  to select and adapt the right enterprise framework for the job.
+ Understand the implication of enterprise business requirements on
  the framework design.
+ How to use your large-scale enterprise framework and how to
  protect your investment.
+ How to deal with resource requirements, enterprise framework
  integration problems, framework reporting, and others.
+ What are the impacts of enterprise frameworks on the national and
  global economy?

This volume helps organizations apply component-based technology
effectively by citing examples from the real world.  This book combines
the actual experiences and lessons learned from developing and/or adapting
component-based enterprise framework developments.

Reviewers: Please e-mail your contact information and your area of
interests to the lead author and editor.

Authors: Please submit one electronic copy in RTF interchange or Microsoft
Word document formats by October 1, 2000 or sooner to the lead author and
editor:

Dr. Mohamed E. Fayad
J.D. Edwards Professor
Computer Science & Engineering Dept., University of Nebraska, Lincoln
108 Ferguson Hall, P.O. Box 880115, Lincoln, NE 68588-0115
Ph: (402) 472-2615, Fax: (402) 472-7767
E-mail: fayad [at] cse [dot] unl.edu, m.fayad [at] computer [dot] org, fayadm [at] acm [dot] org 
URL: http://www.cse.unl.edu/~fayad	

Submissions:
Submissions should be presented in a practical, easy to understand manner,
providing information that readers can apply today.  We seek original
articles on specific practical and research issues related to software
architectures, product-line architectures, component-based software
developments and enterprise application frameworks.

Chapters may be of any length, ranging from a few pages (2-3 pages or
1,200 words - sidebars) to a full treatment of substantial software
architectures, components, or frameworks (ranging from 10 pages to say 40
pages or 25,000 words - Chapters), including illustrations.  Submissions
are peer-reviewed and are subject to editing for style, clarity, and
space. We also encourage authors to submit supplement materials, such as
documentation and portions of the detailed implementation of their
frameworks or complete documentation or portions of the software
architecture or product-line architecture.  All submissions should
identify a principal contact author by e-mail address and/or fax and/or
telephone number and postal address.  

Please keep in mind that each volume will be the only complete work on
this topic.  We received excellent responses from most of the authors that
we contacted for this project.  We promise a high-quality and an extremely
useful publication for the computer and software industries.  Your chapter
should have appendixes of annotated references, notation, process, and
definitions.

Each chapter will include the biographies of the authors.  We will also
ask you to perform a final review for two or three chapters, collect
opinions from you related to the organization of each volume and keep you
up-to-date about the progress of this project.  If a chapter is accepted,
the authors will be asked to provide the following sections: 
1.	Review questions, 
2.	Problem sets, and/or 
3.	Projects, and 
4.	Key solutions.  
We would like to finish the work related to this project in twelve to
fifteen months.  

Currently, we have over 10 chapters for the first volume,10 papers for the
second volume, and 5 papers for the third volume.  All papers are under
review.  Questions regarding the suitability of a topic should be sent to:
fayad [at] cse [dot] un1.edu, garlan [at] cs [dot] cmu.edu, or pree [at] acm [dot] org

If you are considering submitting a chapter, I would like to receive the
following information immediately for starting the review process for your
chapter:
1. The title of your chapter
2. The list of authors and their contact information
3. The abstract
4. The point of contact

For further information about this series of books, please contact me at
<fayad [at] cse [dot] unl.edu>, <m.fayad [at] computer [dot] org>, or <fayadm [at] acm [dot] org>


For detailed author guidelines, check the following web site:

www.cse.unl.edu/~fayad	Book Projects















From owner-reliable_computing [at] interval [dot] usl.edu  Thu Aug  3 06:27:30 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id GAA04818
	for reliable_computing-outgoing; Thu, 3 Aug 2000 06:27:30 -0500 (CDT)
Received: from homer.mat.univie.ac.at (homer.mat.univie.ac.at [131.130.145.130])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id GAA04813
	for <reliable_computing [at] interval [dot] louisiana.edu>; Thu, 3 Aug 2000 06:27:25 -0500 (CDT)
Received: (from neum@localhost)
	by homer.mat.univie.ac.at (8.9.3/8.9.3) id NAA26067
	for reliable_computing [at] interval [dot] louisiana.edu; Thu, 3 Aug 2000 13:27:22 +0200 (MET DST)
Date: Thu, 3 Aug 2000 13:27:22 +0200 (MET DST)
From: Arnold Neumaier <neum [at] cma [dot] univie.ac.at>
Message-Id: <200008031127.NAA26067 [at] homer [dot] mat.univie.ac.at>
To: reliable_computing [at] interval [dot] louisiana.edu
Subject: Position at the University of Vienna (Austria)
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk




              Position at the University of Vienna (Austria)
              ----------------------------------------------

                Development of modular global optimization 
         techniques and software in a branch and bound framework



The Institute for Mathematics of the University of Vienna invites 
applications for a post-doctoral research position in optimization.
The contract is for at most three years, probably beginning Fall 2000
(dependent on the starting date of a European project to be funded by 
the European Union).
 
Vienna, the capital of Austria, is one of the great scientific, 
politic, and cultural centers of the world.

The Computational Mathematics group (URL: http://solon.cma.univie.ac.at)
is currently primarily involved in the development of high quality 
software for global optimization and in interdisciplinary applications 
of optimization (e.g., to protein folding and to parameter estimation 
in stochastic models). The successful applicant will participate in the 
development of modular techniques and software for global optimization 
in a branch and bound framework, with emphasis on the combination of 
techniques from
  - large-scale local optimization
  - combinatorial optimization
  - constrained (logic) programming
  - interval analysis

Candidates must have a Ph. D. in Mathematics, Operations Research, 
or Computer Science. Especially welcome are applicants who have
  - excellent practical knowledge of numerical methods for optimization 
    and linear algebra,
  - excellent programming skills in C and C++, and
  - previous experience with branch and bound methods.

Interested researchers should contact 
Prof. Arnold Neumaier (neum [at] cma [dot] univie.ac.at),
preferably before September 15, 2000.


From owner-reliable_computing [at] interval [dot] usl.edu  Fri Aug  4 16:55:02 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id QAA02289
	for reliable_computing-outgoing; Fri, 4 Aug 2000 16:55:02 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id QAA02284
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 4 Aug 2000 16:54:59 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.10.1/8.10.1) with SMTP id e74LssN28515
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 4 Aug 2000 15:54:54 -0600 (MDT)
Message-Id: <200008042154.e74LssN28515 [at] cs [dot] utep.edu>
Date: Fri, 4 Aug 2000 15:54:53 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: from NA Digest
To: reliable_computing [at] interval [dot] louisiana.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: KFBWv0gGcGXBVTiVy0UyyQ==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

I apologize for multiple messages. 

From: Paul Barton <pib [at] mit [dot] edu>
Date: Thu, 27 Jul 2000 10:34:25 +0200
Subject: Postdoctoral Position at MIT

POSTDOCTORAL RESEARCH ASSOCIATE POSITION AT MIT

Candidates are sought for the position of Postdoctoral Research Associate
at the Department of Chemical Engineering at MIT. The position will involve
the development of novel algorithms and software for sensitivity and
interval analysis of differential-algebraic equations (DAEs). The task will
involve close collaboration with other researchers participating in the
DAEPACK project a MIT (http://yoric.mit.edu/daepack/daepack.html), and with
colleagues in industry and at national laboratories.

Candidates should have a Ph.D. in computational science or engineering, or
closely related science or engineering discipline. Please send a curriculum
vitae plus a list of a least three referees to:

Paul I. Barton
Associate Professor
Department of Chemical Engineering
Massachusetts Institute of Technology, 66-464
77 Massachusetts Avenue
Cambridge
MA 01239
U.S.A.


From owner-reliable_computing [at] interval [dot] usl.edu  Mon Aug  7 10:04:11 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA07509
	for reliable_computing-outgoing; Mon, 7 Aug 2000 10:04:11 -0500 (CDT)
Received: from judy.ic.ac.uk (judy.ic.ac.uk [155.198.5.28])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA07504
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 7 Aug 2000 10:04:01 -0500 (CDT)
From: h.haitao [at] ic [dot] ac.uk
Received: from juliet.ic.ac.uk ([155.198.5.4])
	by judy.ic.ac.uk with esmtp (Exim 2.12 #1)
	id 13LoRb-0006Zb-00
	for reliable_computing [at] interval [dot] louisiana.edu; Mon, 7 Aug 2000 16:03:59 +0100
Received: from sunfs1-gw.ps.ic.ac.uk ([155.198.164.2] helo=sunfs1.ps.ic.ac.uk)
	by juliet.ic.ac.uk with esmtp (Exim 2.12 #1)
	id 13LoRa-0006zD-00
	for reliable_computing [at] interval [dot] louisiana.edu; Mon, 7 Aug 2000 16:03:58 +0100
Received: from sunv44.ps.ic.ac.uk by sunfs1.ps.ic.ac.uk (8.8.8+Sun/4.1)
          id QAA09919; Mon, 7 Aug 2000 16:03:50 +0100 (BST)
Date: Mon, 7 Aug 2000 16:03:49 +0100 (BST)
Message-Id: <1293.200008071503 [at] sunv44 [dot] ps.ic.ac.uk>
To: reliable_computing [at] interval [dot] louisiana.edu
Subject: Bounding on dynamic system
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Content-MD5: dg/7cc4QoLene84lPXeoSg==
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear all,

I am considering a dynamic process system, which is described by a set of 
ordinary differential equations (ODE) or differential algebraic equations (DAE). 
Traditionally, we consider a point system at t1, then we can use integration 
method to get the corresponding point at t2. Now, if we  consider a continuous 
space (a lot of point systems) at time t1, we want to find the corresponding 
space at time t2. The way I am doing is to find models to bounding the space at 
time t2. However, I must ensure the space at time t2 is still continuous, then I 
can do some other evaluations on the space. My problem is how to prove the space 
at t2 is still continuous or what assumptions on the underlying ODE (or DAE) 
need to be made to ensure the space at t2 still continuous. It may be a silly 
question for a mathematician, but it is difficult and important for me. Could 
anyone please help me or give a clue on how to prove this. 

haitao

From owner-reliable_computing [at] interval [dot] usl.edu  Fri Aug 11 06:19:36 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id GAA14612
	for reliable_computing-outgoing; Fri, 11 Aug 2000 06:19:36 -0500 (CDT)
Received: from yonge.cs.toronto.edu (root [at] yonge [dot] cs.toronto.edu [128.100.1.8])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with SMTP id GAA14607
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 11 Aug 2000 06:19:31 -0500 (CDT)
Received: from jane.cs.toronto.edu ([128.100.2.31]) by yonge.cs.toronto.edu with SMTP id <33976-6694>; Fri, 11 Aug 2000 07:19:20 -0400
Received: from qew.cs.toronto.edu by jane.cs.toronto.edu id <453134-13040>; Fri, 11 Aug 2000 07:19:11 -0400
From: Ken Jackson <krj [at] cs [dot] toronto.edu>
To: reliable_computing [at] interval [dot] usl.edu
Subject: Announcement:  2001-02 NA Year at the Fields Institute in Toronto
Cc: krj [at] cs [dot] toronto.edu
Message-Id: <00Aug11.071911edt.453134-13040 [at] jane [dot] cs.toronto.edu>
Date: 	Fri, 11 Aug 2000 07:19:08 -0400
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

The Fields Institute in Toronto is sponsoring a Thematic Year on
"Numerical and Computational Challenges in Science and Engineering"
(NCCSE) from August 2001 to July 2002.  The main point of this
announcement is to inform the scientific computing committee about this
event so that any people interested in participating can include it in
their plans for 2001-02.

A key to the success of this program will be the senior long-term
visitors that it attracts. Their research interests will shape many of
the events that take place during the year and their participation in
the program will attract many junior colleagues, postdocs and graduate
students.

We are now considering applications from senior researchers to visit
the Fields Institute for a month or more, possibly spread out over
several shorter visits, such as a couple of weeks around two or more
workshops or one day each week for a term.  We would particularly
welcome visitors for one or both terms of the year.

We have some funds to support travel and local expenses for senior
researchers, but not to pay their salaries. If you are a senior
researcher interested in participating in the program, please e-mail
Ken Jackson at krj [at] cs [dot] utoronto.ca.

More information about the Fields Institute in general and the NCCSE
Thematic Year in particular can be found at

        http://www.fields.utoronto.ca

and

        http://www.fields.utoronto.ca/numerical.html

respectively.


From owner-reliable_computing [at] interval [dot] usl.edu  Mon Aug 14 16:27:54 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id QAA20340
	for reliable_computing-outgoing; Mon, 14 Aug 2000 16:27:54 -0500 (CDT)
Received: from mcs.anl.gov (cliff.mcs.anl.gov [140.221.9.17])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id QAA20335
	for <reliable_computing [at] interval [dot] usl.edu>; Mon, 14 Aug 2000 16:27:50 -0500 (CDT)
Received: from cliff.mcs.anl.gov (merlin.mcs.anl.gov [140.221.11.61])
	by mcs.anl.gov (8.9.3/8.9.3) with ESMTP id QAA302018;
	Mon, 14 Aug 2000 16:27:43 -0500
Message-Id: <200008142127.QAA302018 [at] mcs [dot] anl.gov>
To: reliable_computing [at] interval [dot] usl.edu
cc: dolan [at] mcs [dot] anl.gov, more [at] mcs [dot] anl.gov
Subject: Expansion of the NEOS Server for Optimization
Date: Mon, 14 Aug 2000 16:27:43 -0500
From: "Jorge More'" <more [at] mcs [dot] anl.gov>
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


The NEOS Server continues to expand and improve as we add new services
and facilities. We are currently processing about 3,000 jobs/month. 
Among the recent developments:

  GAMS solvers
  Semidefinite programming solvers
  JAVA Submission Tool
  The NEOS Server 3.0 package.


*** GAMS *** 

Through the help of GAMS Development Corporation, we now have
extensive support for solving optimization problems with GAMS
(General Algebraic Modeling System).  

The NEOS Server currently hosts the following solvers, which accept
input in the GAMS modeling language.

  CONOPT (ARKI Consulting and Development)
  MINOS (Murtagh and Saunders)
  SNOPT (Gill, Murray, and Saunders)
  BDMLP (Brooke, Drud, and Meeraus)
  MILES (Rutherford) and PATH (Dirkse, Ferris, and Munson)

*** Semidefinite Programming *** 

Hans Mittelmann has added an extensive list of semidefinite
programming solvers in sparse SDPA format:

  CSDP (Brian Borchers)
  SDPA (Katsuki Fujisawa, Masakazu Kojima, and Kazuhide Nakata)
  SDPT3 (Kim Toh, Mike Todd, and Reha Tutuncu)
  SeDuMi (Jos Sturm)

These solvers run on machines at the Arizona State University.

*** JAVA Submission Tool for Windows users ***

We now have Java-based Submission Tool which connects to the NEOS
Server through TCP/IP sockets. This tool provides Windows and Unix
users with rapid access to the Server and allows submission forms to
be saved for repeated use.

http://www-neos.mcs.anl.gov/neos/server-submit.html

*** NEOS Server 3.0 package ***

You can now download the software behind the Server!
While the NEOS Server does not provide downloads of any solver
software, the NEOS Server 3.0 package provides a ready-made Application =
Service Provider.  Your own applications can be brought on-line through
NEOS without the pain of creating from scratch such necessities as user
interfaces, submission parsing and scheduling software, or the
communications handling necessary to run jobs on remote systems.

http://www-neos.mcs.anl.gov/neos/server-downloads.html

***

To learn more about recent developments in the NEOS Server, visit

  http://www-neos.mcs.anl.gov/


Liz Dolan and Jorge More' for the NEOS Group.

The NEOS Server is a project of the Optimization Technology Center,
jointly managed by Argonne National Laboratory and Northwestern University.


From owner-reliable_computing [at] interval [dot] usl.edu  Fri Aug 18 12:34:06 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id MAA27750
	for reliable_computing-outgoing; Fri, 18 Aug 2000 12:34:06 -0500 (CDT)
Received: from into.nit.spb.ru (ns.nit.spb.ru [212.193.6.225])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id MAA27745
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 18 Aug 2000 12:33:37 -0500 (CDT)
Received: from slava.UUCP (uucp@localhost)
	by into.nit.spb.ru (8.8.7/8.8.7) with UUCP id VAA25096
	for reliable_computing [at] interval [dot] usl.edu; Fri, 18 Aug 2000 21:35:25 +0400 (MSD)
	(envelope-from slava.nit.spb.su!nest [at] slava [dot] nit.spb.su)
Received: by slava.nit.spb.su (dMail for DOS v1.23, 15Jun94);
          Fri, 18 Aug 2000 21:21:30 +0400
To: reliable_computing [at] interval [dot] usl.edu
Message-Id: <AAQ2Ndvm4S [at] slava [dot] nit.spb.su>
Organization: Slava Nesterov
Date: Fri, 18 Aug 2000 21:21:30 +0400 (MSD)
Reply-To: nest [at] into [dot] nit.spb.su
From: "Slava Nesterov" <nest [at] slava [dot] nit.spb.su>
X-Mailer: dMail [Demos Mail for DOS v1.23]
Subject: Reliable Computing, Volume 7, issue 1
Lines: 63
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

              Reliable Computing
           Volume 7, Issue 1, 2001

           Mathematical Research

Path Planning Using Intervals and Graphs
Luc Jaulin
1-15

Automatic Computation of a Linear Interval Enclosure
Lubomir V. Kolev
17-28

On Kernel Inclusions
Hans-Juergen Dobner
29-39

Roundoff-Free Number Fields for Interval Computations
Vladik Kreinovich
41-47

                Short Communications

A Note on a Uniqueness Theorem for the  Second-Derivative Test of Qi
Michael A. Wolfe
49-52

On $\wedge$-Subdistributivity and $\vee$-Superdistributivity
with Respect to Interval Map in Kaucher Arithmetic
Gregory G. Menshikov, Alexey V. Tomashevsky
53-57

The Feasibility of the Interval Gaussian Algorithm for Arrowhead
Matrices
Uwe Schaefer
59-62

Reminiscences "Back in the Good Old Days"
The Mystery of Intervals
Svetoslav Markov
63-65

                   Information

Interval Methods and Their Applications: invited sessions at the World
Automation Congress (WAC'2000)
67-68

Session ``Interval and Computer-Algebraic Methods in  Science and
Engineering''  at the 6th International Association for Mathematics and
Computers in Simulation (IMACS) Conference on Applications  of Computer
Algebra (ACA'2000)
69-70

A special session on Granular Computing and Interval Computations at the
19th International Conference of the North  American Fuzzy Information
Processing Society (NAFIPS)
71-72

Minisymposium on Applications of Interval Computations at the Third
World Congress of Nonlinear Analysts
73-74



From owner-reliable_computing [at] interval [dot] usl.edu  Sun Aug 20 15:41:30 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id PAA02220
	for reliable_computing-outgoing; Sun, 20 Aug 2000 15:41:29 -0500 (CDT)
Received: from kleene.math.wisc.edu (kleene.math.wisc.edu [144.92.166.90])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id PAA02215
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 20 Aug 2000 15:41:25 -0500 (CDT)
Received: from forelli.math.wisc.edu (forelli.math.wisc.edu [144.92.166.70])
	by kleene.math.wisc.edu (8.9.3/8.9.3) with SMTP id PAA08648;
	Sun, 20 Aug 2000 15:32:56 -0500 (CDT)
Date: Sun, 20 Aug 2000 15:34:11 -0500 (CDT)
From: Hans Schneider <hans [at] math [dot] wisc.edu>
To: NETS -- at-net <at-net [at] mi [dot] uni-erlangen.de>,
        "Hershkowitz, Danny -- Hershkowitz Daniel" <hershkow [at] aluf [dot] technion.ac.il>,
        Danny Hershkowitz <hershkow [at] techunix [dot] technion.ac.il>,
        E-LETTER <eletter-request [at] win [dot] tue.nl>,
        "na.digest" <na.digest@na-net.ornl.gov>, ipnet-digest [at] math [dot] msu.edu,
        wim@bell-labs.com, hjt [at] eos [dot] ncsu.edu, vkm [at] eedsp [dot] gatech.edu,
        reliable_computing [at] interval [dot] louisiana.edu
Subject: LAA Contents
Message-ID: <Pine.GSO.3.96.1000820152315.17683D-100000 [at] forelli [dot] math.wisc.edu>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk




Dear Net Organizer:

Please circulate the attached LAA contents over your net.

Thanks

hans



------------------------------------------------------------------------------
Hans Schneider                                 hans [at] math [dot] wisc.edu.
Department of Mathematics                      608-262-1402 (Work)
Van Vleck Hall                                 608-271-7252 (Home)
480 Lincoln Drive                              608-263-8891 (Work FAX)
University of Wisconsin-Madison                608-271-8477 (Home FAX)
Madison WI 53706 USA             http://www.math.wisc.edu/~hans (URL)
------------------------------------------------------------------------------


NOTE:
ContentsDirect, which is automatically generated, lists the first author
of each paper and the corresponding author (if different). 

Visit the journal at http://www.elsevier.nl/locate/jnlnr/07738

Please note that subscribers can access full text and abstracts
through the provided URL:

             ContentsDirect from Elsevier Science
            =====================================


Journal: Linear Algebra and its Applications
ISSN   : 0024-3795
Volume : 314
Issue  : 1-3
Date   : 15-Jul-2000



pp 1-47
On Lie gradings III. Gradings of the real forms of classical Lie
algebras
M. Havlicek, J. Patera, E. Pelantova
http://www.elsevier.nl/PII/S0024379500000999

pp 49-74
On triality and automorphisms and derivations of composition algebras
A. Elduque
http://www.elsevier.nl/PII/S0024379500001051

pp 75-89
Construction of the Jordan decomposition by means of Newton's method
D. Schmidt
http://www.elsevier.nl/PII/S0024379500001117

pp 91-136
Interpolation theory in sectorial Stieltjes classes and explicit
system solutions
D. Alpay, E. Tsekanovskii
http://www.elsevier.nl/PII/S0024379500001130

pp 137-164
Hankel matrices, positive functions and related questions
Y.V. Genin
http://www.elsevier.nl/PII/S002437950000121X

pp 165-189
The eigenvalue problem for networks of beams
B. Dekoninck, S. Nicaise
http://www.elsevier.nl/PII/S002437950000118X

pp 191-203
On the nonuniqueness of the factorization factors in the product
singular value decomposition
D. Chu, B. De Moor
http://www.elsevier.nl/PII/S0024379500001361

pp 205
Index


-------



             ContentsDirect from Elsevier Science
            =====================================


Journal: Linear Algebra and its Applications
ISSN   : 0024-3795
Volume : 315
Issue  : 1-3
Date   : 15-Aug-2000



pp 1-23
Sums of diagonalizable matrices
J.D. Botha
http://www.elsevier.nl/PII/S0024379599002803

pp 25-38
Convexity properties of Tr[(a^*a)^n]
L.E. Mata-Lorenzo, L. Recht
http://www.elsevier.nl/PII/S0024379500000501

pp 39-59
Identification of almost invariant aggregates in reversible nearly
uncoupled Markov chains
P. Deuflhard, W. Huisinga, A. Fischer, C. Schutte
http://www.elsevier.nl/PII/S0024379500000951

pp 61-81
Some general techniques on linear preserver problems
A. Guterman, C.-K. Li, P. Semrl
http://www.elsevier.nl/PII/S0024379500001191

pp 83-112
On the curvature of monotone metrics and a conjecture concerning the
Kubo-Mori metric
J. Dittmann
http://www.elsevier.nl/PII/S0024379500001300

pp 113-123
Explicit factorization of the Vandermonde matrix
H. Oruc, G.M. Phillips
http://www.elsevier.nl/PII/S0024379500001245

pp 125-138
The invariant polynomials degrees of the Kronecker sum of two linear
operators and additive theory
C. Caldeira, J.A. Dias da Silva
http://www.elsevier.nl/PII/S0024379500001257

pp 139-144
The determinant of random power series matrices over finite fields
K.A.S. Abdel-Ghaffar
http://www.elsevier.nl/PII/S0024379500001348

pp 145-154
Numerical ranges and matrix completions
D.W. Hadwin, K.J. Harrison, J.A. Ward
http://www.elsevier.nl/PII/S002437950000135X

pp 155-173
Maximal orthogonality and pseudo-orthogonality with applications to
generalized inverses
M.Q. Rieck
http://www.elsevier.nl/PII/S0024379500001427

pp 175-188
Characterization of joint spectral radius via trace
Q. Chen, X. Zhou
http://www.elsevier.nl/PII/S002437950000149X

pp 189-196
The Ostrowski-Reich theorem for SOR iterations: extensions to the
rank deficient case
J.-Y. Yuan
http://www.elsevier.nl/PII/S0024379500001488

pp 197-205
Two-dimensional Q-algebras
T. Nakazi
http://www.elsevier.nl/PII/S0024379500001518

pp 209
Index


-------



From owner-reliable_computing [at] interval [dot] usl.edu  Tue Aug 22 12:56:37 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id MAA06568
	for reliable_computing-outgoing; Tue, 22 Aug 2000 12:56:37 -0500 (CDT)
Received: from mailhost.uni-koblenz.de (mailhost.uni-koblenz.de [141.26.64.1])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id MAA06563
	for <reliable_computing [at] interval [dot] usl.edu>; Tue, 22 Aug 2000 12:56:30 -0500 (CDT)
Received: from nostromo.uni-koblenz.de (root [at] nostromo [dot] uni-koblenz.de [141.26.66.122])
	by mailhost.uni-koblenz.de (8.9.3/8.9.3) with ESMTP id TAA07690;
	Tue, 22 Aug 2000 19:55:56 +0200 (MET DST)
Received: (from peter@localhost)
	by nostromo.uni-koblenz.de (8.9.3/8.9.1) id TAA27592;
	Tue, 22 Aug 2000 19:55:52 +0200
MIME-Version: 1.0
Content-Type: text/plain; charset=iso-8859-1
Content-Transfer-Encoding: 8bit
Message-ID: <14754.48808.89342.325193 [at] nostromo [dot] uni-koblenz.de>
Date: Tue, 22 Aug 2000 19:55:52 +0200 (CEST)
From: IJCAR Publicity Chair <ijcar-publicity [at] dii [dot] unisi.it>
Reply-to: IJCAR Publicity Chair <ijcar-publicity [at] dii [dot] unisi.it>
Subject: CFP: IJCAR 2001 - International Joint Conference on Automated Reasoning
X-Mailer: VM 6.75 under 21.1 (patch 12) "Channel Islands" XEmacs Lucid
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

+------------------------------------------------------------------+
|                                                                  |
|                              IJCAR 2001                          |
|                                                                  |
|    The International Joint Conference on Automated Reasoning     |
|                                                                  |
|                   June 18-23, 2001, Siena, Italy                 |
|                                                                  |
|                  http://www.dii.uni-si.it/~ijcar/                |
|                                                                  |
|               CALL FOR PAPERS / TUTORIALS / WORKSHOPS            |
|                                                                  |
+------------------------------------------------------------------+

CALL FOR PAPERS
===============

The International Joint Conference on Automated Reasoning (IJCAR) is
the fusion of three major conferences in Automated Reasoning: CADE
(The International Conference on Automated Deduction), TABLEAUX (The
International Conference on Automated Reasoning with Analytic Tableaux
and Related Methods) and FTP (The International Workshop on
First-Order Theorem Proving). These three events will join for the
first time at the IJCAR conference in Siena in June 2001.

IJCAR 2001 invites submissions related to all aspects of automated
reasoning, including foundations, implementations, and
applications. Original research papers and descriptions of working
automated deduction systems are solicited.

Topics
------
LOGICS of interest include propositional, first-order, classical,
equational, higher-order, non-classical, constructive, modal,
temporal, many-valued, substructural, description, and meta-logics,
type theory and set theory.

TECHNIQUES of interest include model-elimination, tableaux, sequent
calculi, resolution, connection method, inverse method, term
rewriting, induction, unification, constraint solving, decision
procedures, model generation, model checking, semantic guidance,
interactive theorem proving, logical frameworks, and AI-related
methods for deductive systems such as proof planning and proof
presentation.

APPLICATIONS of interest include hardware and software development,
systems analysis and verification, functional and logic programming,
proof carrying code, deductive databases, knowledge representation,
computer mathematics, natural language processing, linguistics,
planning and other AI areas.


Submissions - Research papers and system descriptions
-----------------------------------------------------
Submitted research papers and system descriptions must be original and
not submitted for publication elsewhere. Research papers can be up to
15 proceedings pages long, and system descriptions can be up to 5
pages long. The proceedings of IJCAR 2001 will be published by
Springer-Verlag in the LNAI series.

All submissions must be received by January 14, 2001. Submissions that
are late or too long or require substantial revision will not be
considered. Authors of accepted papers will be requested to sign a
form transfering copyright of their contribution to Springer-Verlag.

IN THE RESEARCH PAPER CATEGORY, SUBMISSIONS OF THEORETICAL, PRACTICAL
AND EXPERIMENTAL NATURE ARE EQUALLY ENCOURAGED.

Submissions - Short papers
--------------------------
Short papers are intended for quick dissemination of work in progress
or results not substantial enough for a full research paper. Their
length is limited to 10 pages. Submissions under this category will
not be formally refereed, but their content and relevance will be
reviewed. Those submissions accepted will be published in a technical
report, which will be available at the conference. Authors of accepted
papers are expected to present a brief outline of their work at the
conference and to prepare a poster for display at the conference
venue.

The submission deadline is April 2, 2001.

Submission details - All categories
-----------------------------------
Authors are strongly encouraged to use LATEX2e and the Springer llncs
class files. The primary means of submission is electronic. More
submission details can be found at the IJCAR 2001 web site.

Best Student Paper Award
------------------------
A prize of 500 Euros will be given to the best paper, as judged by the
program committee, written solely by one or more students. A
submission is eligible if all authors are full-time students at the
time of submission. This should be indicated in the submission
letter. The program committee may decline to make the award or may
split it among several papers.

Organization
------------
Conference Chair:

    Fabio Massacci
    University of Siena
    Dipartimento di Ingegneria dell'Informazione
    via Roma 56
    53100 Siena, Italy

    Phone: +39 0577 234607
    FAX: +39 0577 233602
    Email: ijcar-cch [at] dii [dot] unisi.it

Workshop Chair:

    D. Hutter (Saarbr"ucken)
    ijcar-workshop [at] dii [dot] unisi.it

    Tutorial Chair:
    T. Walsh (York)
    ijcar-tutorial [at] dii [dot] unisi.it

Program Co-Chairs:

    Rajeev Gor'e (ARP-ANU, Australia)
    Alexander Leitsch (TU-Wien, Austria)
    Tobias Nipkow (TU-M"unchen, Germany)                 
                                                                 
    collective Email address: ijcar-pch [at] dii [dot] unisi.it

Publicity Chair:
    P. Baumgartner (Koblenz)

Treasurer: 
    E. Giunchiglia (Genova)

Invited speakers                      
----------------
    N. Jones (DIKU, DK)                 
    L. Paulson (Cambridge, UK)              
    H. Schwichtenberg (M"unchen, D)         
    A. Voronkov (Manchester, UK)            
    D. Zeilberger (Temple Univ., USA)       

Program committee
-----------------
    R. Alur (Philadelphia)
    F. Baader (Aachen)
    M. Baaz (Wien)
    B. Beckert (Karlsruhe)
    R. Caferra (Grenoble)
    R. Dyckhoff (St. Andrews)
    U. Furbach (Koblenz)
    D. Galmiche (Nancy)
    H. Ganzinger (MPI Saarbr"ucken)
    J. Goubault-Larrecq (INRIA Rocq.)
    R. H"ahnle (Chalmers)
    J. Harrison (Intel, Hillsboro)
    D. Kapur (New Mexico)
    H. Kautz (ATT, Florham Park)
    M. Kohlhase (Saarbr"ucken)
    Z. Manna (Stanford)
    P. Patel-Schneider (Bell Labs)
    F. Pfenning (Pittsburgh)
    A. Podelski (MPI Saarbr"ucken)
    W. Reif (Augsburg)
    G. Salzer (Wien)
    M. Vardi (Houston)

Important dates
---------------
(all dates in 2001)

January 14   Submission deadline - 
             Research papers and system descriptions
  March 19   Notification of acceptance - 
             Research papers and system descriptions
  April  2   Submission deadline - 
             Short papers
  April 12   Camera-ready copy due - 
             Research papers and system descriptions
  April 30   Notification of acceptance - 
             Short papers 
    May 14   Camera-ready copy due - Short papers

   June 18 -
   June 23   IJCAR 2001


CALL FOR TUTORIALS
==================

Scope
-----
It is planned to hold a number of tutorials within the technical
programme of the confer ence. We invite proposals for these tutorials
(as well as suggestions for topics that might be covered). The topics
of the tutorials can cover any area related to automated reasoning and
any related cross-disciplinary areas that might be of interest
(constraints, formal methods, ...). At present, the tutorials are
scheduled to take place on Monday 18th and Tuesday 19th June.

How to Propose a Tutorial 
-------------------------
Proposals should be in English and between one and two pages in
length. They should contain:

       * The title of the tutorial.                           
       * The names, and affiliations of the person or persons who will
         present the tutorial.
       * A brief technical description of the topics covered by the tutorial.
       * Contact details (email, web page, phone, fax, etc).
       * A list of tutorials previously given in this or related areas.

Proposals should be submitted electronically (in ASCII, Ghostscript
compatible Postscript or LaTeX) at the follwing address:

     Toby Walsh, IJCAR Tutorial Chair
     Artificial Intelligence Group
     Department of Computer Science
     University of York
     York YO10 5DD, U.K. 

     Email: ijcar-tutorial [at] dii [dot] unisi.it
       Tel: +44 1904 432745
       Fax: +44 1904 432767

Important dates
---------------
Tutorial proposal deadline: January 15, 2001 
Notification of acceptance: January 29, 2001 
                 Tutorials: June 18+19, 2001 


CALL FOR WORKSHOPS
==================

Scope
-----
Researchers and practitioners are invited to submit proposals for
workshops on IJCAR related topics as mentioned in the "Call for
Papers". Proposals that promise to bring new topics into IJCAR, of
either practical or theoretical importance, or provide a forum for
more detailed discussion on central topics of continuing importance
are also welcomed. Workshops that close the gap between automated
reasoning and related areas, like for instance formal methods or
software engineering, are especially encouraged.

Recent workshops of participating conferences have included, for
instance, automated model building, automation of proofs by induction,
empirical studies in logic algorithms, mechanization of partial
functions, proof search in type-theoretic languages, strategies in
automated deduction, automated theorem proving in software engineering
and in mathematics, and integration of symbolic computation and
deduction.

Submission Details
------------------
Anyone wishing to organize a workshop in conjunction with IJCAR should
send in postscript format (e-mail preferred) a proposal no longer than
two pages to the workshop chair (ijcar-workshop [at] dii [dot] unisi.it) by
January 1, 2001.

Proposals should consist of two parts. First, a short scientific
justification of the proposed topic, its significance and the
particular benefits of the workshop. A second part should include the
proposed format and agenda, the procedures for selecting papers and
participants, and contact information for the organizers. In
particular it should also include estimated dates for paper
submissions, acceptance of notification (before May 1, 2001) and
camera ready copy.

Proposals will be evaluated, and decisions will be communicated by
January 15, 2001. Further information about the arrangements for
workshops can be obtained from the IJCAR 2001 Web site.

Important dates
---------------
Workshop proposal deadline: January 1, 2001
Notification of acceptance: January 15, 2001
                 Workshops: June 18+19, 2001

Workshop chair
--------------
   Dieter Hutter (Saarbr"ucken, D)
   ijcar-workshop [at] dii [dot] unisi.it

Sponsors
--------
   Università degli Studi di Siena, the University of Siena
   AI*IA, l'Associazione Italiana per l'Intelligenza Artificiale 
   CADE Inc., The Conference on Automated Deduction. 
   EATCS, The European Association for Theoretical Computer Sciences. 
   ECCAI, The European Coordinating Committee on Artificial Intelligence. 
   ERCIM, The European Research Consortium for Informatics and Mathematics. 
   IJCAI Inc., The International Joint Conferences on Artificial Intelligence.
   MPS, Monte dei Paschi di Siena 

-- 
Peter Baumgartner                         
phone: +49 261  287 2777    mail: peter@uni-koblenz.de
fax:   +49 261  287 2731    WWW:  http://www.uni-koblenz.de/~peter/



From owner-reliable_computing [at] interval [dot] usl.edu  Wed Aug 23 12:09:24 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id MAA09162
	for reliable_computing-outgoing; Wed, 23 Aug 2000 12:09:23 -0500 (CDT)
Received: from kleene.math.wisc.edu (kleene.math.wisc.edu [144.92.166.90])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id MAA09157
	for <reliable_computing [at] interval [dot] louisiana.edu>; Wed, 23 Aug 2000 12:09:17 -0500 (CDT)
Received: from forelli.math.wisc.edu (forelli.math.wisc.edu [144.92.166.70])
	by kleene.math.wisc.edu (8.9.3/8.9.3) with SMTP id MAA19077;
	Wed, 23 Aug 2000 12:00:48 -0500 (CDT)
Date: Wed, 23 Aug 2000 12:02:15 -0500 (CDT)
From: Hans Schneider <hans [at] math [dot] wisc.edu>
To: NETS -- at-net <at-net [at] mi [dot] uni-erlangen.de>,
        "Hershkowitz, Danny -- Hershkowitz Daniel" <hershkow [at] aluf [dot] technion.ac.il>,
        Danny Hershkowitz <hershkow [at] techunix [dot] technion.ac.il>,
        E-LETTER <eletter-request [at] win [dot] tue.nl>,
        "na.digest" <na.digest@na-net.ornl.gov>, ipnet-digest [at] math [dot] msu.edu,
        wim@bell-labs.com, hjt [at] eos [dot] ncsu.edu, vkm [at] eedsp [dot] gatech.edu,
        reliable_computing [at] interval [dot] louisiana.edu
Subject: LAA contents
Message-ID: <Pine.GSO.3.96.1000823120033.27999A-100000 [at] forelli [dot] math.wisc.edu>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


Dear Net Organizer:

Please circulate the attached LAA contents over your net.

Thanks

hans


------------------------------------------------------------------------------
Hans Schneider                                 hans [at] math [dot] wisc.edu.
Department of Mathematics                      608-262-1402 (Work)
Van Vleck Hall                                 608-271-7252 (Home)
480 Lincoln Drive                              608-263-8891 (Work FAX)
University of Wisconsin-Madison                608-271-8477 (Home FAX)
Madison WI 53706 USA             http://www.math.wisc.edu/~hans (URL)
------------------------------------------------------------------------------














             ContentsDirect from Elsevier Science
            =====================================


Journal: Linear Algebra and its Applications
ISSN   : 0024-3795
Volume : 316
Issue  : 1-3
Date   : 01-Sep-2000

Please note that subscribers can access full text and abstracts
through the provided URLs.

Visit the journal at http://www.elsevier.nl/locate/jnlnr/07738

NOTE:
ContentsDirect, which is automatically generated, lists the first author
of each paper and the corresponding author (if different). 

pp 1-12
Dedication to Robert J. Plemmons
http://www.elsevier.nl/PII/S0024379500001804

pp 13-20
Lower bounds for the eigenvalues of Laplacian matrices
A. Berman, X.-D. Zhang
http://www.elsevier.nl/PII/S0024379599002645

pp 21-28
Markov chain sensitivity measured by mean first passage times
G.E. Cho, C.D. Meyer
http://www.elsevier.nl/PII/S0024379599002633

pp 29-43
Structuredmatrixrepresentationsoftwo-parameter Hankel transforms in
adaptive optics
V.P. Pauca, B.L. Ellerbroek, R.J. Plemmons, X. Sun
http://www.elsevier.nl/PII/S0024379599002670

pp 45-65
Regular Markov chains for which the transition matrix has large exponent
S.J. Kirkland, M. Neumann
http://www.elsevier.nl/PII/S0024379599002657

pp 67-87
Comparison theorems for the convergence factor of iterative methods for
singular matrices
I. Marek, D.B. Szyld
http://www.elsevier.nl/PII/S002437959900275X

pp 89-104
Cosine transform preconditioners for high resolution image reconstruction
M.K. Ng, R.H. Chan, T.F. Chan, A.M. Yip
http://www.elsevier.nl/PII/S0024379599002748

pp 105-112
Domain decomposition splittings
R.E. White
http://www.elsevier.nl/PII/S0024379500000161

pp 113-135
A mathematical framework for the linear reconstructor problem in adaptive
optics
M. Chu, V. Pauca, R. Plemmons, X. Sun
http://www.elsevier.nl/PII/S0024379500000197

pp 137-156
Solving total least-squares problems in information retrieval
E. Jiang, M. Berry
http://www.elsevier.nl/PII/S0024379500000306

pp 157-169
GMRES-type methods for inconsistent systems
D. Calvetti, B. Lewis, L. Reichel
http://www.elsevier.nl/PII/S0024379500000641

pp 171-182
A fast eigenvalue algorithm for Hankel matrices
F.T. Luk, S. Qiao
http://www.elsevier.nl/PII/S0024379500000847

pp 183-197
Unifying unitary and hyperbolic transformations
A. Bojanczyk, S. Qiao, A.O. Steinhardt
http://www.elsevier.nl/PII/S0024379500001087

pp 199-222
On the existence and computation of rank-revealing LU factorizations
C.-T. Pan
http://www.elsevier.nl/PII/S0024379500001208

pp 223-236
Quasi-Newton approach to nonnegative image restorations
M. Hanke, J.G. Nagy, C. Vogel
http://www.elsevier.nl/PII/S0024379500001166

pp 237-258
A new approach to constrained total least squares image restoration
M.K. Ng, R.J. Plemmons, F. Pimentel
http://www.elsevier.nl/PII/S0024379500001154

pp 259-285
Convergence of the alternating minimization algorithm for blind
deconvolution
T. Chan, C.K. Wong
http://www.elsevier.nl/PII/S0024379500001415

pp 287
Index


-------



From owner-reliable_computing [at] interval [dot] usl.edu  Sun Aug 27 06:42:43 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id GAA17061
	for reliable_computing-outgoing; Sun, 27 Aug 2000 06:42:42 -0500 (CDT)
Received: from unknown ([206.215.214.219])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with SMTP id GAA17046;
	Sun, 27 Aug 2000 06:42:29 -0500 (CDT)
From: bench1 [at] lakmail [dot] com
Subject: your imaging supplies
Date: Wed, 27 Aug 1997 03:59:23
Message-Id: <810.280387.633716@>
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk






BENCHMARK SUPPLY
5334 LAKE VIEW CLUB
ATLANTA GA 30338

***LASER PRINTER TONER CARTRIDGES***
***FAX AND COPIER TONER***
 
WE ACCEPT GOVERNMENT, SCHOOL & UNIVERSITY PURCHASE ORDERS
JUST LEAVE YOUR PO # WITH CORRECT BILLING & SHIPPING ADDRESS

CHECK OUT OUR NEW CARTRIDGE PRICES FOR USE IN THE FOLLOWING 
PRINTERS:
 

APPLE 
 
  LASER WRITER  PRO 600 OR 16/600         $69
  LASER WRITER SELECT 300,310.360         $69
  LASER WRITER 300, 320                   $54 
  LASER WRITER LS,NT,2NTX,2F,2G & 2SC     $54 
  LASER WRITER 12/640                     $79 

HEWLETT PACKARD 

  LASERJET SERIES 2,3 & 3D (95A)          $49 
  LASERJET SERIES  2P AND 3P (75A)        $54 
  LASERJET SERIES 3SI AND 4SI (91A)       $75 
  LASERJET SERIES 4L AND 4P               $49 
  LASERJET SERIES 4, 4M, 5, 5M, 4+ (98A)  $59 
  LASERJET SERIES 4000 HIGH YIELD  (27X)  $89 
  LASERJET SERIES 4V                      $95 
  LASERJET SERIES 5SI , 8000              $95 
  LASERJET SERIES 5L AND 6L               $49 
  LASERJET SERIES 5P, 5MP, 6P, 6MP        $59 
  LASERJET SERIES 5000 (29A)             $135
  LASERJET SERIES 1100 (92A)              $49 
  LASERJET SERIES 2100 (96A)              $79
  LASERJET SERIES 8100 (82X)		 $145


HP LASERFAX 

  LASERFAX 500, 700, FX1,                 $59 
  LASERFAX 5000, 7000, FX2,               $59 
  LASERFAX  FX3                           $69 
  LASERFAX  FX4                           $79 
 

LEXMARK 

  OPTRA  4019, 4029  HIGH YIELD          $135 
  OPTRA R, 4039, 4049 HIGH YIELD         $135 
  OPTRA S 4059 HIGH YIELD                $135 
  OPTRA E                                 $59 
  OPTRA  N                               $115 
 

EPSON 

  EPL-7000, 8000                         $105 
  EPL-1000, 1500                         $105 
 

CANON 

  LBP-430                                 $49 
  LBP-460, 465                            $59 
  LBP-8 II                                $54 
  LBP-LX                                  $54 
  LBP-MX                                  $95 
  LBP-AX                                  $49 
  LBP-EX                                  $59 
  LBP-SX                                  $49 
  LBP-BX                                  $95 
  LBP-PX                                  $49 
  LBP-WX                                  $95 
  LBP-VX                                  $59 
  CANON FAX L700 THRU L790 FX1            $59 
  CANONFAX L5000 L70000  FX2              $59 
 

CANON COPIERS 

  PC 20, 25 ETC....                       $89 
  PC 3, 6RE, 7, 11  (A30)                 $69 
  PC 320 THRU 780  (E40)                  $89 
 

NEC 

  SERIES 2 LASER MODEL 90,95             $105


PLEASE NOTE:

2) WE DO NOT SEND OUT CATALOGS OR PRICE LISTS 
3) WE DO NOT FAX QUOTES OR PRICE LISTS.  
5) WE DO NOT CARRY: BROTHER-MINOLTA-KYOSERA-PANASONIC PRODUCTS
6) WE DO NOT CARRY: XEROX-FUJITSU-OKIDATA OR SHARP PRODUCTS
7) WE DO NOT CARRY ANY COLOR PRINTER SUPPLIES    
8) WE DO NOT CARRY DESKJET/INKJET OR BUBBLEJET SUPPLIES



               

****OUR  ORDER LINE IS 770-399-0953 ****

****OUR CUSTOMER SERVICE  LINE IS 770-512-7444****
****OUR E-MAIL REMOVAL AND COMPLAINT LINE IS 888-494-8597****

****PLACE YOUR ORDER AS FOLLOWS**** :

BY PHONE   770-399-0953 

BY FAX:    770-698-9700 
BY MAIL:   BENCHMARK SUPPLY
           5334 LAKE VIEW CLUB
           ATLANTA GA 30338

MAKE SURE YOU INCLUDE THE FOLLOWING INFORMATION IN YOUR ORDER: 

             1)  YOUR PHONE NUMBER 
             2)  COMPANY NAME 
             3)  SHIPPING ADDRESS 
             4)  YOUR NAME 
             5)  ITEMS NEEDED WITH QUANTITIES 
             6)  METHOD OF PAYMENT. (COD OR CREDIT CARD) 
             7)  CREDIT CARD NUMBER WITH EXPIRATION DATE 

 
1) WE SHIP UPS GROUND. ADD $4.5 FOR SHIPPING AND HANDLING.
2) COD CHECK ORDERS ADD $3.5 TO YOUR SHIPPING COST.
2) WE ACCEPT ALL MAJOR CREDIT CARD OR "COD" ORDERS.
3) OUR STANDARD MERCHANDISE REPLCAMENT POLICY IS NET 90 DAYS. 


NOTE NUMBER (1): 

PLEASE DO NOT CALL OUR ORDER LINE TO REMOVE YOUR E-MAIL 
ADDRESS OR COMPLAIN. OUR ORDER LINE IS NOT SETUP TO FORWARD 
YOUR E-MAIL ADDRESS REMOVAL REQUESTS OR PROCESS YOUR 
COMPLAINTS..IT WOULD BE A WASTED PHONE CALL.YOUR ADDRESS 
WOULD NOT BE REMOVED AND YOUR COMPLAINTS WOULD NOT BE 
HANDLED.PLEASE CALL OUR TOLL FREE E-MAIL REMOVAL AND 
COMPLAINT LINE TO DO THAT.

NOTE NUMBER (2):

OUR E-MAIL RETURN ADDRESS IS NOT SETUP TO ANSWER ANY 
QUESTIONS YOU MIGHT HAVE REGARDING OUR PRODUCTS. OUR E-MAIL 
RETURN ADDRESS IS ALSO NOT SETUP TO TAKE ANY ORDERS AT 
THIS TIME. PLEASE CALL THE ORDER LINE TO PLACE YOUR ORDER
 OR HAVE ANY QUESTIONS ANSWERED. OTHERWISE PLEASE CALL OUR 
CUSTOMER SERCICE LINE.







 
 
 
 
 
 
 
 
 
 
 

From owner-reliable_computing [at] interval [dot] usl.edu  Mon Aug 28 08:49:33 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id IAA19231
	for reliable_computing-outgoing; Mon, 28 Aug 2000 08:49:33 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id IAA19226
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 28 Aug 2000 08:49:29 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.10.1/8.10.1) with SMTP id e7SDnKu16573
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 28 Aug 2000 07:49:20 -0600 (MDT)
Message-Id: <200008281349.e7SDnKu16573 [at] cs [dot] utep.edu>
Date: Mon, 28 Aug 2000 07:49:18 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: ISIPTA '01: Preliminary Call for Papers
To: reliable_computing [at] interval [dot] louisiana.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: xCdcuWgDCF07pEPkkQ4YUw==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


------------- Begin Forwarded Message -------------

Date: Mon, 28 Aug 2000 15:12:44 +0200
From: Gert de Cooman <Gert.DeCooman [at] rug [dot] ac.be>
X-Accept-Language: en
Subject: ISIPTA '01: Preliminary Call for Papers

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

ISIPTA '01

THE SECOND INTERNATIONAL SYMPOSIUM ON
IMPRECISE PROBABILITIES AND THEIR APPLICATIONS

Cornell University
Ithaca, NY, USA
26 - 29 June 2001

PRELIMINARY CALL FOR PAPERS

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

Encouraged by the success of the First International Symposium on
Imprecise Probabilities and Their Applications (ISIPTA '99, Ghent,
Belgium, 30 June - 2 July 1999, see the web site
http://ippserv.rug.ac.be/~isipta99 for more detailed information; see
http://decsai.ugr.es/~smc/isipta99/proc/proceedings.html for an
electronic version of the proceedings), we have decided to create a
biennial series of ISIPTA conferences on imprecise probabilities, each
to take place at a different location.

The Second International Symposium on Imprecise Probabilities and Their
Applications (ISIPTA '01), will be held at Cornell University, Ithaca,
NY, USA, from 26 till 29 June 2001. 

Steering Committee
------------------
Gert de Cooman (Universiteit Gent, Belgium)
Fabio G. Cozman (Universidade de Sao Paulo, Brazil)
Terrence Fine (Cornell University, USA)
Serafin Moral (Universidad de Granada, Spain)

Program Committee 
-----------------

Board: 	Gert de Cooman (Belgium)
       	Terrence Fine (USA)
	Teddy Seidenfeld (USA)
       
Russell Almond (USA)    		Charles F. Manski (USA)    
Paul Anand (UK)				Massimo Marinacci (Italy)       
Thomas Augustin (Germany)       	Serafin Moral (Spain)   
Salem Benferhat (France)        	Sujoy Mukerji (UK)
Jean-Marc Bernard (France)      	Klaus Nehring (USA)     
David Budescu (USA)     		Robert Nau (USA)        
Fabio G. Cozman (Brazil)        	Endre Pap (Yugoslavia) 
Dieter Denneberg (Germany) 		Jeff Paris (UK) 
James M. Dickey (USA)   		David Pennock (USA)     
Didier Dubois (France)  		Henri Prade (France)     
Itzhak Gilboa (Israel)  		Giuliana Regoli (Italy)
Angelo Gilio (Italy)    		Romano Scozzafava (Italy)
Fernando Gomide (Brazil)        	Glenn Shafer (USA)      
Michel Grabisch (France)        	Philippe Smets (Belgium) 
Pierre Hanssen (Canada) 		Michael Smithson (Australia)    
David Harmanec (Czech Republic) 	Wynn Stirling (USA)     
Jean-Yves Jaffray (France)		Milan Studeny (Czech Republic)  
Hugo Janssen (Belgium)  		Lev Utkin (Russia)      
Etienne Kerre (Belgium) 		Jirina Vejnarova (Czech Republic)
George Klir (USA) 			Paolo Vicig (Italy)
Henry Kyburg (USA)      		Frans Voorbraak (The Netherlands)       
Isaac Levi (USA)        		Kurt Weichselberger (Germany)   
Thomas Lukasiewicz (Austria)    	Nic Wilson (UK) 
Mark Machina (USA)      		Marco Zaffalon (Switzerland)    

More information about the organising committee will appear soon on the
symposium web site.

What is imprecise probability?
------------------------------
Imprecise probability is a generic term for the many mathematical models
which measure chance or uncertainty without sharp numerical
probabilities. These models include belief functions, Choquet
capacities, comparative probability orderings, convex sets of
probability measures, fuzzy measures, interval-valued probabilities,
possibility measures, plausibility measures, and upper and lower
expectations or previsions. Such models are needed in inference problems
where the relevant information is scarce, vague or conflicting, and in
decision problems where preferences may also be incomplete. See the IPP
web site <http://ippserv.rug.ac.be> for introductory articles about
imprecise probabilities, an extensive bibliography, and a collection of
survey articles on special types of imprecise probability models.  

Symposium language
------------------
The working language of the symposium will be English. No simultaneous
translation in other languages will be available. 

How to submit a paper
---------------------
Papers are encouraged on all aspects of imprecise probability and its
applications. Those wishing to present a paper at the symposium should
submit a short paper of 4-10 pages electronically, by 15 January 2001.
LaTeX and Word style files will be made available on the symposium web
site (http://ippserv.rug.ac.be/~isipta01) well before the submission
deadline. The Program Committee will decide which of these papers are
accepted. The successful authors will then be invited to submit a final
version of their paper, for publication in a volume of symposium
proceedings (which will be available for the symposium).  

Each accepted paper will be given the opportunity for both a brief oral
presentation as well as a poster session.

All the papers that are accepted for the symposium will also be made
available on our web site (http://ippserv.rug.ac.be/~isipta01) well
before the conference. This will allow the participants to study the
papers in some detail before they are actually presented. 

Symposium web site
------------------
All information relating to the symposium will be published on the
symposium web site: http://ippserv.rug.ac.be/~isipta01

Important dates (still tentative)
---------------
Paper submission deadline:  	15 January 2001
Notification of acceptance: 	9 March 2001
Deadline for revised papers: 	30 March 2001
Symposium: 			30 June - 2 July 1999

Questions
---------
If you have any questions about the symposium, please contact the
Organising Committee, at the following address:

Terrence Fine
Director
Center for Applied Mathematics
Rhodes Hall 612
Cornell University
Ithaca NY 14853
USA

Tel: +1-607-255-4336/3643
E-mail: tlfine [at] cam [dot] cornell.edu

------------- End Forwarded Message -------------



From owner-reliable_computing [at] interval [dot] usl.edu  Mon Aug 28 11:24:01 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id LAA19628
	for reliable_computing-outgoing; Mon, 28 Aug 2000 11:24:01 -0500 (CDT)
Received: from marnier.ucs.usl.edu (root@[130.70.40.2])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id LAA19623
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 28 Aug 2000 11:23:58 -0500 (CDT)
Received: from liberty (liberty.usl.edu [130.70.46.171])
	by marnier.ucs.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.4) with SMTP id LAA05761
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 28 Aug 2000 11:23:56 -0500 (CDT)
Message-Id: <2.2.32.20000828163045.012c19c8 [at] pop [dot] usl.edu>
X-Sender: rbk5287 [at] pop [dot] usl.edu
X-Mailer: Windows Eudora Pro Version 2.2 (32)
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Date: Mon, 28 Aug 2000 11:30:45 -0500
To: reliable_computing [at] interval [dot] louisiana.edu
From: "R. Baker Kearfott" <rbk [at] louisiana [dot] edu>
Subject: Inner estimation?
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Colleagues,

Can you post anything you know about literature regarding inner estimation
of arithmetic expressions?  In particular, if {\ivl x} is a usual interval,
and E(x) is an algebraic expression in the real variable x, how might
we use arithmetic to obtain a set I such that

I \subseteq {y | y\in the range of E over {\ivl x}} 

and such that I is not empty???

I am aware of some of the work of Sergei Shary in this regard, in
particular, for inner estimates of solutions to linear systems, but 
can that arithmetic be used for general expressions?  What, in your
opinion, is the best introductory literature to the subject?

Best regards,

Baker

---------------------------------------------------------------
R. Baker Kearfott,    rbk [at] louisiana [dot] edu   (337) 482-5346 (fax)
(337) 482-5270 (work)                     (337) 981-9744 (home)
URL: http://interval.louisiana.edu/kearfott.html
Department of Mathematics, University of Louisiana at Lafayette
Box 4-1010, Lafayette, LA 70504-1010, USA
---------------------------------------------------------------


From owner-reliable_computing [at] interval [dot] usl.edu  Mon Aug 28 13:53:21 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id NAA20082
	for reliable_computing-outgoing; Mon, 28 Aug 2000 13:53:20 -0500 (CDT)
Received: from solon.mat.univie.ac.at (solon.mat.univie.ac.at [131.130.145.131])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id NAA20077
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 28 Aug 2000 13:52:43 -0500 (CDT)
Received: (from neum@localhost)
	by solon.mat.univie.ac.at (8.9.3/8.9.3) id UAA04677;
	Mon, 28 Aug 2000 20:51:32 +0200 (MET DST)
Date: Mon, 28 Aug 2000 20:51:32 +0200 (MET DST)
From: Arnold Neumaier <neum [at] cma [dot] univie.ac.at>
Message-Id: <200008281851.UAA04677 [at] solon [dot] mat.univie.ac.at>
To: rbk [at] louisiana [dot] edu, reliable_computing [at] interval [dot] louisiana.edu
Subject: Re:  Inner estimation?
Cc: neum [at] cma [dot] univie.ac.at, rbk [at] usl [dot] edu
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Baker Kearfott asked,

>>Can you post anything you know about literature regarding inner 
estimation of arithmetic expressions?  In particular, if {\ivl x} 
is a usual interval, and E(x) is an algebraic expression in the 
real variable x, how might we use arithmetic to obtain a set I 
such that
     I \subseteq {y | y\in the range of E over {\ivl x}} 
and such that I is not empty???<<



On very tiny intervals, any inner enclosure computable without
extended precision by an arbitrary method might turn out to be 
empty, while one always has a more natural measure of quality of an 
outer enclosure, namely the Haussdorff distance. If q is the 
Haussdorff-distance of an enclosure [x] of a range in the infty-norm 
then moving each boundary by q inward gives an inner enclosure. 

Upper bounds on the Haussdorff distance may be computed recursively;
see my (now unfortunately out of print) book
     A. Neumaier, Interval Methods for Systems of Equations 
     Cambridge Univ. Press, Cambridge 1990 
in particular Theorem 2.1.1 and Theorem 2.3.3.



For scalar-valued functions, branch and bound schemes provide inner 
estimates for the range, by taking the (possibly empty) interval
[min(f(x_i).sup),max(f(x_i).inf)] over all x_i whose function value 
has been evaluated. There are usually some evaluations quite close to 
the extrema, so the quality of these inner estimates can be excellent. 

For scalar-valued functions of a single variable, I made a INTLAB
program for inner and outer range enclosure available at
http://solon.cma.univie.ac.at/~neum/software/1Drange
(Since INTLAB is designed for matrix computations it is  v e r y  slow
for univariate functions. I'd appreciate if someone provided a 
faster Fortran 90 or C++ implementation for the public domain.)



The problem is somewhat ill-posed for vector-valued functions since 
there are uncountably many maximal such boxes, and if one allows more 
general shapes the only natural set I is the range...

Arnold Neumaier


From owner-reliable_computing [at] interval [dot] usl.edu  Tue Aug 29 10:27:10 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA00622
	for reliable_computing-outgoing; Tue, 29 Aug 2000 10:27:10 -0500 (CDT)
Received: from pilot28.cl.msu.edu (pilot28.cl.msu.edu [35.9.5.48])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA00617
	for <reliable_computing [at] interval [dot] louisiana.edu>; Tue, 29 Aug 2000 10:26:58 -0500 (CDT)
Received: from berz ([35.10.52.114])
	by pilot28.cl.msu.edu (8.10.2/8.10.2) with SMTP id e7TFOfp83498;
	Tue, 29 Aug 2000 11:24:41 -0400
From: "Martin Berz" <berz [at] msu [dot] edu>
To: "R. Baker Kearfott" <rbk [at] louisiana [dot] edu>,
        <reliable_computing [at] interval [dot] louisiana.edu>
Cc: "Makino, Kyoko" <makino [at] msu [dot] edu>,
        "Hoefkens Jens" <hoefkens [at] dvorak [dot] nscl.msu.edu>
Subject: RE: Inner estimation?
Date: Tue, 29 Aug 2000 11:23:17 -0400
Message-ID: <LOBBLFLDLCOABDBDAMICEEFHCPAA.berz [at] msu [dot] edu>
MIME-Version: 1.0
Content-Type: text/plain;
	charset="iso-8859-1"
Content-Transfer-Encoding: 7bit
X-Priority: 3 (Normal)
X-MSMail-Priority: Normal
X-Mailer: Microsoft Outlook IMO, Build 9.0.2416 (9.0.2910.0)
X-MIMEOLE: Produced By Microsoft MimeOLE V5.50.4133.2400
Importance: Normal
In-Reply-To: <2.2.32.20000828163045.012c19c8 [at] pop [dot] usl.edu>
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear Baker and Colleagues,

> Can you post anything you know about literature regarding inner estimation
> of arithmetic expressions?  In particular, if {\ivl x} is a usual
> interval,
> and E(x) is an algebraic expression in the real variable x, how might
> we use arithmetic to obtain a set I such that
>
> I \subseteq {y | y\in the range of E over {\ivl x}}
>
> and such that I is not empty???
>
> I am aware of some of the work of Sergei Shary in this regard, in
> particular, for inner estimates of solutions to linear systems, but
> can that arithmetic be used for general expressions?  What, in your
> opinion, is the best introductory literature to the subject?
>
> Best regards,
>
> Baker

I cannot quite answer the question regarding the literature, but there is a
nearly elementary way of doing this efficiently within the framework of
Taylor model arithmetic. Some of you may recall that around 11/15/99, there
was a question on the mailing list of getting higher-order convergent bounds
for complicated functions, for which Baker posed the challenge of finding
tight bounds for "Gritton's Problem". This function, merely a polynomial of
around order around 20, exhibits a tremendous amount of overestimation when
evaluated with intervals, yet can be bounded under almost complete avoidance
of the dependency problem with the Taylor model approach.

Specifically, using Taylor model arithmetic, one obtains an enclosure of the
range of the dependencies within Taylor polynomial plus an interval
remainder bound. This can lead to very sharp inclusions; as an example, we
had considered the point x=1, and with a domain width of 0.1, we had
obtained remaider intervals:

>*** Width 0.1000000000000000
>
>    REMAINDER BOUND INTERVAL
>    Order 5       [-.6726596225651657E-004,0.6726596225651657E-004]
>    Order 10      [-0.5340837667066269E-12, 0.5340837667066269E-12]
>

which when bounding the Taylor polynomial part (even by mere evaluation with
intervals) leads to the following sharp overall bounds:

> Bound evaluation of the function
> Taylor Model: 	 [  3.639055771004044    ,  5.004415060553268    ]
> Naive Interval:  [ -1942.104301934065    ,  1832.828958028471    ]
> Rastering: 	 [  3.794653671645733    ,  4.617163892782912    ]
>

This method can be modified easily to also provide wide inner bounds for the
range;  the exact range of the fifth order Taylor polynomial can be obtained
analytically, then adding the lower bound of the fifth order remainder bound
to the max gives an upper inner bound for the range, and adding the upper
bound to the min gives a lower inner bound.

Many variations of this basic idea are possible; for example instead of
bounding the high order polynomial one can just bound it up to a certain
order, and bound the rest by mere interval evaluation; this corresponds to
the bounding scheme used for the above examples. This can still avoid most
of the dependency problem for things like Gritton's problem, as it is still
analogous in sharpness to the outer bounding problem.


Martin Berz


From owner-reliable_computing [at] interval [dot] usl.edu  Fri Sep  1 09:57:19 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id JAA04905
	for reliable_computing-outgoing; Fri, 1 Sep 2000 09:57:19 -0500 (CDT)
Received: from hplms26.hpl.hp.com (hplms26.hpl.hp.com [15.255.168.31])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id JAA04900
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 1 Sep 2000 09:57:10 -0500 (CDT)
From: sventek [at] labs [dot] agilent.com
Received: from hplms2.hpl.hp.com (hplms2.hpl.hp.com [15.0.152.33])
	by hplms26.hpl.hp.com (8.9.3 (PHNE_18979)/HPL-PA Relay) with ESMTP id HAA28742
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 1 Sep 2000 07:56:30 -0700 (PDT)
Received: from sqf2004.sqf.hp.com (sqf2004.sqf.hp.com [15.144.184.84])
	by hplms2.hpl.hp.com (8.10.2/8.10.2 HPL-PA Hub) with SMTP id e81EuSh12889
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 1 Sep 2000 07:56:28 -0700 (PDT)
Message-Id: <200009011456.e81EuSh12889 [at] hplms2 [dot] hpl.hp.com>
Subject: Middleware 2001 Call for Participation
Date: Fri, 01 Sep 2000 15:56:20 GDT
To: reliable_computing [at] interval [dot] usl.edu
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


========================================================
APOLOGIES to those who receive duplicates of this call
========================================================

                         Call For Contributions

                            Middleware 2001
  IFIP/ACM INTERNATIONAL CONFERENCE ON DISTRIBUTED SYSTEMS PLATFORMS

Middleware is now widely acknowledged to be the premier conference on 
distributed systems platforms and open distributed processing.  The 
conference is a synthesis of the major conferences and workshops in this area 
into a single international event.  Highlights of Middleware 2001 will 
include a high-quality technical program, full and half-day tutorials, 
invited speakers, poster presentations and an advanced topic workshop, all 
held in the beautiful university city of Heidelberg, Germany.

The focus of Middleware 2001 is on the design, implementation, deployment and 
evaluation of distributed systems platforms and architectures for future 
networked environments.  Of particular interest is the experience with both 
new and existing architectures and platforms (such as RM-ODP, CORBA, RMI and 
DCOM) in environments which may include public, private and mobile networks, 
overlaid wired and wireless technologies, IPv6 and IP multicast, multimedia 
and real-time information and an increasing volume of WWW and Java traffic.

Key Topics
==========

The conference seeks original, unpublished research and experience papers on 
all aspects of systems support for distributed applications including case 
studies on the use of such technologies and examples of advanced distributed 
applications. 

The following topics have been identified by the program committee as being 
of special relevance to the conference:

 * integration of middleware platforms with web and Java technologies.
 * real-time middleware platforms including real-time ORBs. 
 * reliable middleware platforms including fault-tolerant ORBs.   
 * provision of multimedia support in middleware platforms.  
 * applications of, and support for, QoS in middleware platforms.
 * event based, publish/subscribe and asynchronous platforms.  
 * novel paradigms and APIs for distributed systems platforms.  
 * open architectures for adaptive and reflective systems.
 * applications of middleware technologies including telematics and commerce.
 * extensions and refinements to RM-ODP, CORBA, DCOM etc.
 * the impact of emerging Internet technologies on middleware platforms.
 * distributed systems management and interactive configuration and
   development tools. 
 * issues of scalability in existing and new distributed systems platforms.  
 * engineering distributed systems in heterogeneous and mobile networks.


Advanced Topic Workshop - Middleware for Mobile Computing
=========================================================

The software infrastructure to support mobile applications is becoming 
critically important to the next horizon in computing.  This one-day workshop 
is intended as a forum for understanding the issues associated with this 
emerging area of middleware for mobile computing.  We propose to focus the 
discussion on the following key topics:

 * Requirements on mobile middleware.
 * Paradigms and platforms for mobile computing.
 * Service architectures and novel services.
 * Performance and manageability issues.

We are interested in work-in-progress and visionary papers as well as 
experimental and systems-related papers.  To encourage a working atmosphere, 
the workshop will invite a limited number of conference participants based on 
position papers.  Position papers should be two to four pages in length and 
will be reviewed by the workshop program committee.


Submission Guidelines
=====================

Middleware 2001 seeks submissions in the following forms:

 * Full technical papers. These should describe original, unpublished 
   research or experience and be no longer than 7000 words. 
 * Work-in-progress papers. These should describe on-going work and 
   interim results. Submissions should be no longer than 2500 words.
 * Posters. Posters can be used to publicize current research initiatives. 
   A 500-word summary of the poster's contents should be submitted.
 * Tutorial proposals. Middleware 2001 aims to include a number of high-
   quality tutorials in areas relevant to the conference themes. Tutorial 
   proposals should be no longer than 1000 words and should include the 
   intended audience, duration (full or half day) and speaker biographies 
   for the tutorial.
 * Advanced topic position papers.  These should be 2-4 pages in length.

All technical papers will be reviewed by members of the Program Committee; 
advanced topic position papers will be reviewed by the workshop program 
committee.  Full papers accepted for presentation at Middleware 2001 will be 
included in the proceedings published by Springer Verlag (LNCS series). 

For outstanding full papers and workshop position papers, extended versions 
of selected research papers will be considered for publication in "IEEE 
Transactions on Parallel and Distributed Systems" and extended versions of 
experience papers will be considered for publication in "Software: Practice 
and Experience". 
 
Work in progress and poster submissions will be made available to conference 
delegates but will not appear in the published proceedings.  Advanced topic 
position papers will be made available to workshop attendees.

Papers must be submitted in Postscript or PDF formats.

Please ensure the first page of your submission includes the paper title, an 
abstract and the address, telephone, FAX and email of the primary contact 
person and that the nature of your submission (full paper, work-in-progress 
paper etc.) is clearly identified. Conference information and style 
guidelines for submissions will be available soon at

	http://www.labs.agilent.com/middleware2001

Further information may be obtained from the program chair, the tutorial 
chair, the works-in-progress chair, or the workshop chair. 

Important dates 
===============

07 May 2001  regular paper abstract
15 May 2001  full regular paper
15 June 2001 tutorial proposal
15 June 2001 work in progress paper
15 June 2001 poster proposal
15 June 2001 workshop position paper

Notification by: 07 July 2001
Final versions due by: 07 August 2001
Conference convenes: 12-16 November 2001


Organization
============

General Chair
-------------
Joe Sventek, Agilent Laboratories, Scotland.


WIP and Poster Chair
--------------------
Maartin van Steen, Vrije Universiteit, the Netherlands.

Tutorials Chair
---------------
Frank Buschmann, Siemens AG, Germany.

Publicity Chair
---------------
Joe Sventek, Agilent Laboratories, Scotland.

Advanced Workshop Chair
-----------------------
Guruduth Banavar, IBM, USA.

Local Arrangements Chair
------------------------
Alex Buchmann, Universitaet Darmstadt, Germany.

Steering Committee
------------------
Jan de Meer (chair), GMD-Fokus, Germany.
Partha Dasgupta, Arizona State University, USA.
Kerry Raymond, DSTC, Australia.
Alexander Schill, TU Dresden, Germany. 
Jacob Slonim, Dalhousie University, Canada.
Gordon Blair, Lancaster University, UK.
Guy LeDuc, University of Liege, Belgium.

Program Chair
-------------
Rachid Guerraoui, EPF Lausanne, Switzerland.

Program Committee
-----------------
Gustavo Alonso, ETH Zurich, Switzerland.
Jean Bacon, Cambridge University, UK.
Geoff Coulson, Lancaster University, UK.
Pascal Felber, Bell Labs, USA.
Jean-Charle Fabre, Laas-CNRS, France.
Svend Frolund, HP Labs, USA.
Naranker Dulay, Imperial College, UK.
Peter Honeyman, CITI, University of Michigan, USA.
Yennun Huang, AT&T Labs, USA.
Anne-Marie Kermarrec, Microsoft Research, UK.
Doug Lea, SUNY at Oswego, USA.
Christoph Liebig, Universitaet Darmstadt, Germany.
Claudia Linnhoff-Popien, Universitaet Muenchen, Germany.
Louise Moser, University of California at Santa Barbara.
Silvano Maffeis, Softwired Inc., Switzerland.
Fabio Panzieri, Universita' di Bologna, Italy.
Luis Rodrigues, Universidade de Lisboa, Portugal.
Isabelle Rouvellou, IBM, USA.
Jean-Bernard Stefani, France Telecom R&D, Grenoble, France.
Santosh Shrivastava, Newcastle University, UK. 
Zahir Tari, RMIT University, Australia.
Steve Vinoski, IONA Technologies, USA.
Werner Vogels, Cornell University, USA.
Gregor von Bochmann, University of Ottawa, Canada. 


From owner-reliable_computing [at] interval [dot] usl.edu  Sun Sep  3 20:11:24 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id UAA09021
	for reliable_computing-outgoing; Sun, 3 Sep 2000 20:11:24 -0500 (CDT)
Received: from mtu.ru (ns.mtu.ru [195.34.32.10])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id UAA09016
	for <reliable_computing [at] interval [dot] usl.edu>; Sun, 3 Sep 2000 20:11:19 -0500 (CDT)
Received: from ns1.glasnet.ru.glasnet.ru (ppp105-134.dialup.mtu-net.ru [212.188.105.134])
	by mtu.ru (Postfix) with SMTP
	id 4298045FA; Mon,  4 Sep 2000 05:10:27 +0400 (MSD)
	(envelope-from Yakovlev@rc-journal.mtu-net.ru)
Message-ID: <003e01c0160c$d6477600$0f03efc3 [at] glasnet [dot] ru.glasnet.ru>
Reply-To: "Alexander G. Yakovlev" <Yakovlev@rc-journal.mtu-net.ru>
From: "Alexander G. Yakovlev" <Yakovlev@rc-journal.mtu-net.ru>
To: <Undisclosed-Recipient:;@mtu.ru;;>
Subject: My additional address has been changed
Date: Mon, 4 Sep 2000 05:08:46 +0400
MIME-Version: 1.0
Content-Type: text/plain;
	charset="koi8-r"
Content-Transfer-Encoding: 7bit
X-Priority: 1
X-MSMail-Priority: High
X-Mailer: Microsoft Outlook Express 5.00.2417.2000
X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2314.1300
X-Recipient: ae42 [at] rz [dot] uni-karlsruhe.de
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


Dear colleagues,
I would like to inform you that my additional (for large messages)
address scdl [at] glasnet [dot] ru is not actual starting this moment. Instead
of this address please write me to 

                               scdl [at] online [dot] ru

    My main address Yakovlev@rc-journal.mtu-net.ru is also
available. Please use it for relatively small messages (for instance,
not more than 15 KB).

Sincerely yours,

Alexander Yakovlev,
Managing Editor of the journal `Reliable Computing'




From owner-reliable_computing [at] interval [dot] usl.edu  Mon Sep  4 08:34:29 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id IAA10608
	for reliable_computing-outgoing; Mon, 4 Sep 2000 08:34:29 -0500 (CDT)
Received: from into.nit.spb.ru (ns.nit.spb.ru [212.193.6.225])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id IAA10603
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 4 Sep 2000 08:34:14 -0500 (CDT)
Received: from slava.UUCP (uucp@localhost)
	by into.nit.spb.ru (8.8.7/8.8.7) with UUCP id RAA02251
	for reliable_computing [at] interval [dot] louisiana.edu; Mon, 4 Sep 2000 17:36:09 +0400 (MSD)
	(envelope-from slava.nit.spb.su!nest [at] slava [dot] nit.spb.su)
Received: by slava.nit.spb.su (dMail for DOS v1.23, 15Jun94);
          Sun,  3 Sep 2000 15:09:16 +0400
To: reliable_computing [at] interval [dot] louisiana.edu
Message-Id: <ABS5ZivS08 [at] slava [dot] nit.spb.su>
Organization: Slava Nesterov
Date: Sun,  3 Sep 2000 15:09:16 +0400 (MSD)
Reply-To: nest [at] into [dot] nit.spb.su
From: "Slava Nesterov" <nest [at] slava [dot] nit.spb.su>
X-Mailer: dMail [Demos Mail for DOS v1.23]
Subject: Re: Inner estimation?
Lines: 27
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Baker,

My paper in Reliable Computing vol 3, n.4, 1997
is devoted to exactly this problem.

Slava

--Can you post anything you know about literature regarding inner estimation
--of arithmetic expressions?  In particular, if {\ivl x} is a usual interval,
--and E(x) is an algebraic expression in the real variable x, how might
--we use arithmetic to obtain a set I such that
--
--I \subseteq {y | y\in the range of E over {\ivl x}}
--
--and such that I is not empty???
--
--I am aware of some of the work of Sergei Shary in this regard, in
--particular, for inner estimates of solutions to linear systems, but
--can that arithmetic be used for general expressions?  What, in your
--opinion, is the best introductory literature to the subject?
--
--Best regards,
--
--Baker





From owner-reliable_computing [at] interval [dot] usl.edu  Tue Sep  5 07:41:29 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id HAA12680
	for reliable_computing-outgoing; Tue, 5 Sep 2000 07:41:29 -0500 (CDT)
Received: from interval.usl.edu (rbk5287@interval [130.70.43.77])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with SMTP id HAA12675
	for <reliable_computing>; Tue, 5 Sep 2000 07:41:25 -0500 (CDT)
Message-Id: <200009051241.HAA12675 [at] interval [dot] usl.edu>
Date: Tue, 5 Sep 2000 07:41:24 -0500 (CDT)
From: "Kearfott R. Baker" <rbk5287 [at] interval [dot] usl.edu>
Reply-To: "Kearfott R. Baker" <rbk5287 [at] interval [dot] usl.edu>
Subject: Change of address for Eldar Musaev
To: reliable_computing [at] interval [dot] usl.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: kA2dASR2Q34Tv2AQf8pkOw==
X-Mailer: dtmail 1.2.1 CDE Version 1.2.1 SunOS 5.6 sun4m sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Subject: Change of address
Date: Sun, 3 Sep 2000 22:33:01 -0700
MIME-Version: 1.0
Dear friends and colleagues,

I'd like to inform you that my address Eldar [at] ibm [dot] net, you were using to =
communicate with me for about 4 years will cease to exist shortly.

Please, use my new address Musayev [at] usa [dot] net. Alternatively you can use =
address EMusayev [at] acm [dot] org, which will redirect the mail to my current =
correct address, whatever it will be for any foreseeable future.

With best regards,
Eldar Musayev


From owner-reliable_computing [at] interval [dot] usl.edu  Wed Sep  6 23:02:30 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id XAA16498
	for reliable_computing-outgoing; Wed, 6 Sep 2000 23:02:29 -0500 (CDT)
Received: from kleene.math.wisc.edu (kleene.math.wisc.edu [144.92.166.90])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id XAA16493
	for <reliable_computing [at] interval [dot] louisiana.edu>; Wed, 6 Sep 2000 23:02:21 -0500 (CDT)
Received: from bing.math.wisc.edu (bing.math.wisc.edu [144.92.166.133])
	by kleene.math.wisc.edu (8.9.3/8.9.3) with SMTP id WAA04563;
	Wed, 6 Sep 2000 22:53:17 -0500 (CDT)
Date: Wed, 6 Sep 2000 22:35:57 -0500 (CDT)
From: Hans Schneider <hans [at] math [dot] wisc.edu>
Reply-To: Hans Schneider <hans [at] math [dot] wisc.edu>
To: NETS -- at-net <at-net [at] mi [dot] uni-erlangen.de>,
        "Hershkowitz, Danny -- Hershkowitz Daniel" <hershkow [at] aluf [dot] technion.ac.il>,
        Danny Hershkowitz <hershkow [at] techunix [dot] technion.ac.il>,
        E-LETTER <eletter-request [at] win [dot] tue.nl>,
        "na.digest" <na.digest@na-net.ornl.gov>, ipnet-digest [at] math [dot] msu.edu,
        wim@bell-labs.com, hjt [at] eos [dot] ncsu.edu, vkm [at] eedsp [dot] gatech.edu,
        reliable_computing [at] interval [dot] louisiana.edu
Subject: LAA Contents
Message-ID: <Pine.GSO.3.96.1000906222913.20922D-100000 [at] bing [dot] math.wisc.edu>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear Net Oerganizer:

Please circulate these LAA contents over your net,   Thanks


hans

------------------------------------------------------------------------------
Hans Schneider                                 hans [at] math [dot] wisc.edu.
Department of Mathematics                      608-262-1402 (Work)
Van Vleck Hall                                 608-271-7252 (Home)
480 Lincoln Drive                              608-263-8891 (Work FAX)
University of Wisconsin-Madison                608-271-8477 (Home FAX)
Madison WI 53706 USA             http://www.math.wisc.edu/~hans (URL)
------------------------------------------------------------------------------





             ContentsDirect from Elsevier Science
            =====================================


Journal: Linear Algebra and its Applications
ISSN   : 0024-3795
Volume : 317
Issue  : 1-3
Date   : 15-Sep-2000


NOTE:
ContentsDirect, which is automatically generated, lists the first author
of each paper and the corresponding author (if different). 


Please note that subscribers can access full text and abstracts
through the provided URLs.

Visit the journal at http://www.elsevier.nl/locate/jnlnr/07738


pp 1-12
Algebraic constructions of the minimal forbidden digraphs of strong sign
nonsingular matrices
J.-Y. Shao, Z.-X. Hu
http://www.elsevier.nl/PII/S0024379500001038

pp 13-40
Normal forms of ''near similarity'' transformations and linear matrix
equations
A. Tovbis
http://www.elsevier.nl/PII/S0024379500001129

pp 41-52
Nearly L-matrices and generalized row sign balanced matrices
J.-Y. Shao, S.-G. Hwang
http://www.elsevier.nl/PII/S0024379500001178

pp 53-102
Canonical matrices for linear matrix problems
V.V. Sergeichuk
http://www.elsevier.nl/PII/S0024379500001506

pp 103-125
Block ILU factorization preconditioners for a block-tridiagonal H-matrix
S.W. Kim, J.H. Yun
http://www.elsevier.nl/PII/S0024379500001464

pp 127-141
Numerical range of linear pencils
P.J. Psarrakos
http://www.elsevier.nl/PII/S0024379500001452

pp 143-176
Anti-triangular and anti-m-Hessenberg forms for Hermitian matrices and
pencils
C. Mehl
http://www.elsevier.nl/PII/S0024379500001567

pp 177-192
State feedback in linear control theory
S. Mondie, P. Zagalak, V. Kucera
http://www.elsevier.nl/PII/S0024379500001531

pp 193-200
On the third largest eigenvalue of a graph
B. Liu, Z. Bo
http://www.elsevier.nl/PII/S0024379500001592

pp 201-205
Disproof of a conjecture on the existence of the path-recursive period for
a connected graph
X. Yong, S. Cao
http://www.elsevier.nl/PII/S0024379500001622

pp 207-216
Elementary operators and orthogonality
A. Turnsek
http://www.elsevier.nl/PII/S0024379500001634

pp 217-224
A note on diagonally dominant matrices
G. Dahl
http://www.elsevier.nl/PII/S0024379500001786

pp 225-226
The exponential Vandermonde matrix
J. Robbin, D. Salamon
http://www.elsevier.nl/PII/S0024379500001865

pp 227-240
Modified Gauss-Seidel type methods and Jacobi type methods for Z-matrices
W. Li, W. Sun
http://www.elsevier.nl/PII/S0024379500001403

pp 241
Index


w


From owner-reliable_computing [at] interval [dot] usl.edu  Thu Sep  7 09:39:34 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id JAA18145
	for reliable_computing-outgoing; Thu, 7 Sep 2000 09:39:33 -0500 (CDT)
Received: from elm.fernuni-hagen.de (elm.fernuni-hagen.de [132.176.114.24])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id JAA18140
	for <reliable_computing [at] interval [dot] louisiana.edu>; Thu, 7 Sep 2000 09:39:26 -0500 (CDT)
Received: from hilbert.theoinf-fernuni-hagen.de (actually hilbert.fernuni-hagen.de) 
          by elm.fernuni-hagen.de via local-channel with SMTP;
          Thu, 7 Sep 2000 16:39:17 +0200
Received: by hilbert.theoinf-fernuni-hagen.de (SMI-8.6/SMI-SVR4) id QAA06000;
          Thu, 7 Sep 2000 16:39:16 +0200
Date: Thu, 7 Sep 2000 16:39:16 +0200
From: Vasco.Brattka@FernUni-Hagen.de (Vasco Brattka)
Message-Id: <200009071439.QAA06000 [at] hilbert [dot] theoinf-fernuni-hagen.de>
To: reliable_computing [at] interval [dot] louisiana.edu
Subject: CCA2000
X-Sun-Charset: US-ASCII
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

_______________________________________________________________________

C  C  A
2 0 0 0

Fourth Workshop on
Computability and Complexity in Analysis

September 17-19, 2000, Swansea, Wales
_______________________________________________________________________

Call for Participation
_______________________________________________________________________


Aim

The aim of the workshop is to bring together people interested in
computability and complexity aspects of analysis and to explore
connections with numerical methods, physics and, of course,
computer science. Submissions on any aspect of these subjects are
welcome.


Program Committee

Ker-I Ko (Stony Brook, USA)
Marian Pour-El (Minnesota , USA)
Dana Scott (Carnegie-Mellon, USA)
Viggo Stoltenberg-Hansen (Uppsala, Sweden)
John V. Tucker (Swansea, Wales)
Klaus Weihrauch, chair (Hagen, Germany)
Mariko Yasugi (Kyoto Sangyo, Japan)
Ning Zhong (Cincinnati, USA)
Jeff Zucker (McMaster, Canada)


Organizing Committee

Jens Blanck (Swansea, Wales)    csjens [at] swansea [dot] ac.uk
Vasco Brattka (Hagen, Germany)  vasco.brattka@fernuni-hagen.de
Peter Hertling (Hagen, Germany) peter.hertling@fernuni-hagen.de
 

Competition & Forum

David Lester (Manchester, England) dlester [at] cs [dot] man.ac.uk 

_______________________________________________________________________

Preliminary Program
_______________________________________________________________________

Sunday, September 17
_______________________________________________________________________

14:00 Opening

14:10 Ning Zhong 
      Turing Computability of the Schroedinger Propagator 

14:35 Abbas Edalat and Andre Lieutier 
      Domain of Differentiable Functions 

15:00 Break

15:30 Keye Martin 
      Complexity and Verification of a Renee Equation

15:55 Matthias Schroeder 
      Admissible Representations of Limit Spaces 

16:20 Break 

16:50 Yoshiki Tsujii, Mariko Yasugi and Takakazu Mori
      Some Properties of the Effectively Uniform Topological Space 

17:15 Armin Hemmerling
      Standard Representations of Effective Metric Spaces 

17:40 Break

18:30 Dinner

_______________________________________________________________________

Monday, September 18
_______________________________________________________________________

 8:35 Ulrich Kohlenbach 
      On the Computational Content of the Krasnoselski and Ishikawa 
      Fixed Point Theorems

 9:00 Dmitry Buy 
      Some Remarks about Fixpoint Theorems

 9:25 Izumi Takeuti 
      Effective Fixed Point Theorem Over a Non-Separable Space
       
 9:50 Break

10:20 Martin Ziegler and Vasco Brattka
      A Computable Spectral Theorem

10:45 Tobias Gaertner and Guenter Hotz
      Recursive Analytic Functions of a Complex Variable 

11:10 Break

11:40 Abbas Edalat, Elham Kashefi and Andre Lieutier 
      The Convex Hull is Computable! 

12:05 Marko Krznaric 
      Computing a Required Absolute Precision from an Exact Floating 
      Point Number
 
-----------------------------------------------------------------------
12:30 Lunch break
-----------------------------------------------------------------------

14:30 Namhyun Hur and James H. Davenport 
      A Generic Root Operation for Exact Real Arithmetic

14:55 Tom Kelsey
      Exact Numerical Computation via Symbolic Computation

15:20 Break

15:50 Norbert Th. Mueller 
      The iRRAM: Exact Arithmetic in C++
 
16:15 Paul Gowland and David Lester
      A Survey on Exact Computer Arithmetic 

16:40 Break
   
17:10 Competition

18:10 Break

19:00 Dinner

_______________________________________________________________________

Tuesday, September 19
_______________________________________________________________________

 8:35 Jens Blanck
      Effectivity of Regular Spaces

 9:00 Hiroyasu Kamo 
      Effective Contraction Theorem and its Application 

 9:25 Charles Meyssonnier, Paolo Boldi and Sebastiano Vigna 
      delta-approximable Functions

 9:50 Break

10:20 Daniel Richardson 
      The Uniformity Conjecture 

10:45 Klaus Weihrauch 
      On Computable Metric Spaces Tietze-Urysohn Extension is 
      Computable 

11:10 Break

11:40 Takakazu Mori 
      Computabilities of Functions on Effectively Separable Metric 
      Spaces
 
12:05 Forum

-----------------------------------------------------------------------
12:30 Lunch break
-----------------------------------------------------------------------

14:30 Peter Hertling
      Banach-Mazur Computable Functions on Metric Spaces

14:55 George Kapoulas 
      Polynomially Time Computable Functions over p-adic Fields

15:20 Break

15:50 Hideki Tsuiki 
      Computational Dimension of Topological Spaces Based on 
      Embeddings to n-bottom-Sequence Spaces
 
16:15 Margarita V. Korovina and Oleg V. Kudinov 
      A Formalisation of Computability of Operators and Real-Valued 
      Functionals via Domain Theory 

16:40 Break
   
17:10 Ashley Burrows and David Lester 
      Exact Arithmetic and the Korteweg-de Vries Equation
 
17:35 Vasco Brattka 
      A Computable Kolmogorov Superposition Theorem

18:00 End of CCA'2000

_______________________________________________________________________

Venue

The venue of the workshop is Department of Computer Science, 
University of Wales Swansea.


How to get there

If you arrive at Heathrow the fastest way is to take the raillink bus 
to Reading and change to train. Tickets can be bought for the whole 
trip at the train ticket desks in the terminals. The trains are 
operated by Great Western. There are also buses operated by National 
Express leaving from the central bus station. Once in Swansea you 
should take a taxi to the university.

If you arrive by car on the M4 you should leave at Junction 42 for 
Swansea  and Gower. Continue to head for Gower until the signs for 
the university appears on the right hand side. 


Finding your way on campus

The conference will take place in building 8.1. The accommodation is 
in building 20. The lunches and the dinner on Sunday will be served 
in building 17.


Accommodation

Accomodation is available on campus for 32 pounds per night including 
breakfast. Bookings need to be made as soon as possible:
                                                       
CCA2000
Mrs Jill Edwards
Department of Computer Science
University of Wales Swansea
Singleton Park
Swansea SA2 8PP
UK
Phone +44 1792 295393
csjill [at] swan [dot] ac.uk
                                                  
The on campus accommodation is in building 20. There should be porters 
there to give you keys to your room. 


Fee

A conference fee of 60 pounds including 2 evening meals and two lunches 
will apply.


Finding something to eat

There is a pub situated just outside the campus to the southwest. 
Plenty of restaurants can of course be found in the city of Swansea, 
which is about 3 km away. The Dylan Thomas Centre, between the museum 
and Sainsbury's on the city map, serves excellent meals at reasonable 
prices. The former fishing village of Mumbles is situated 4 km south 
of campus and has a number of restaurants. 


Web site
    
http://www.informatik.fernuni-hagen.de/cca/cca2000/




                

From owner-reliable_computing [at] interval [dot] usl.edu  Thu Sep  7 11:22:31 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id LAA18550
	for reliable_computing-outgoing; Thu, 7 Sep 2000 11:22:30 -0500 (CDT)
Received: from disi.unige.it (mailhost.disi.unige.it [130.251.61.19])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id LAA18545
	for <reliable_computing [at] interval [dot] usl.edu>; Thu, 7 Sep 2000 11:22:25 -0500 (CDT)
Received: from [130.251.61.155] (reggio [130.251.61.155])
 by disi.unige.it (8.8.8/8.8.8) with ESMTP id RAA23773;
 Thu, 7 Sep 2000 17:25:15 +0200 (MET DST)
Mime-Version: 1.0
Message-Id: <f04320405b5dd716346ed@[130.251.61.155]>
Date: Thu, 7 Sep 2000 17:23:13 +0100
To: etaps2001 [at] disi [dot] unige.it
From: Etaps 2001 <etaps2001 [at] disi [dot] unige.it>
Subject: ETAPS 2001: SECOND ANNOUNCEMENT  &  CALL FOR SUBMISSIONS
Content-Type: text/plain; charset="us-ascii" ; format="flowed"
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

                             ETAPS 2001
                 APRIL 2 - 6, 2001 - GENOVA, ITALY

The European Joint Conferences on Theory and Practice of Software
(ETAPS) is a loose and open confederation of conferences and other
events that has become the primary European forum for academic and
industrial researchers working on topics relating to Software Science.

                  http://www.disi.unige.it/etaps2001/

SECOND ANNOUNCEMENT  &  CALL FOR SUBMISSIONS
-----------------------------------------------------------------------
5 Conferences - Tutorials - Tool Demonstrations - 8 Satellite Events
-----------------------------------------------------------------------

CONFERENCES
-----------------------------------------------------------------------
CC 2001: International Conference on Compiler Construction
Chair: Reinhard Wilhelm

ESOP 2001, European Symposium On Programming
Chair: David Sands

FASE 2001, Fundamental Approaches to Software Engineering
Chair: Heinrich Hussmann

FOSSACS 2001,
Foundations of Software Science and Computation Structures
Chair: Furio Honsell

TACAS 2001,
Tools and Algorithms for the Construction and Analysis of Systems
Chairs: Tiziana Margaria and Wang Yi

Prospective authors are invited to submit, before October 20, 2001,
full papers in English presenting original research. Submitted papers
must be unpublished and not submitted for publication elsewhere. In
particular, simultaneous submission of the same contribution to
multiple ETAPS conferences is forbidden. The proceedings of each main
conference will be published as a separate volume in the Springer
Verlag Lecture Notes in Computer Science series.

TUTORIALS
-----------------------------------------------------------------------
Proposals for half-day or full-day tutorials related to ETAPS 2001 are
invited. Tutorial proposals will be evaluated on the basis of their
assessed benefit for prospective participants to ETAPS 2001.

Contact: Bernhard Rumpe (Technische Universitaet Munchen, Germany)

TOOL DEMONSTRATIONS
-----------------------------------------------------------------------
Demonstrations of tools presenting advances on the state of the art are
invited. Submissions in this category should present tools having a
clear connection to one of the main ETAPS conferences, possibly
complementing a paper submitted separately. These should not be
confused with contributions to TACAS, which emphasizes principles of
tool design, implementation, and use, rather than focusing on specific
domains of application.

Contact: Don Sannella (University of Edinburgh)

SATELLITE EVENTS
-----------------------------------------------------------------------
Besides the five main conferences the following satellite events are
planned for ETAPS 2001

CMCS: Co-algebraic Methods in Computer Science
Contact: Ugo Montanari (Universita' di Pisa, Italy)

ETI Day: Electronic Tool Integration platform Day
Contacts: Tiziana Margaria (Universitaet Dortmund, Germany) and
Andreas Podelski (MPI Saarbrucken, Germany)

JOSES: Java Optimization Strategies for Embedded Systems
Contact: Uwe Assmann (Universitat Karlsruhe, Germany)

LDTA: Workshop on Language Descriptions, Tools and Applications
Contact: Mark van den Brand (CWI Amsterdam, The Netherlands)

PFM: Proofs For Mobility
Contact: Davide Sangiorgi (INRIA-Sophia Antipolis, France)

RelMiS: Relational Methods in Software
Contact: Wolfram Kahl (Universitaet der Bundeswehr Munchen, Germany)

UNIGRA:
Uniform Approaches to Graphical Process Specification Techniques
Contact: Julia Padberg (Technische Universitaet Berlin, Germany)

WADT: Workshop on Algebraic Development Techniques
Contact: Maura Cerioli (DISI-Universita' di Genova, Italy)

IMPORTANT DATES:
-----------------------------------------------------------------------
   October 20, 2000:  Submissions Deadline for the Main Conferences,
                      Demos and Tutorials

   December 15, 2000: Notification of Acceptance/Rejection

   January  15 2001:  Camera-ready Version Due

   April  2-6, 2001:  ETAPS 2001 in Genova

   March 31 - April 8, 2001:  Satellite Events
-----------------------------------------------------------------------

[ Sorry for multiple copies. Do not reply to this message. If you
believe we have sent this to a list not appropriate, please let us know
by mailing to etaps2001 [at] disi [dot] unige.it ]

From owner-reliable_computing [at] interval [dot] usl.edu  Thu Sep  7 13:28:55 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id NAA19161
	for reliable_computing-outgoing; Thu, 7 Sep 2000 13:28:55 -0500 (CDT)
Received: from wren.prod.itd.earthlink.net (wren.prod.itd.earthlink.net [207.217.121.64])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id NAA19156
	for <reliable_computing [at] interval [dot] usl.edu>; Thu, 7 Sep 2000 13:28:52 -0500 (CDT)
Received: from company.mail (ip81.garden-city2.ny.pub-ip.psi.net [38.26.50.81])
	by wren.prod.itd.earthlink.net (8.9.3/8.9.3) with ESMTP id LAA19014
	for <reliable_computing [at] interval [dot] usl.edu>; Thu, 7 Sep 2000 11:25:42 -0700 (PDT)
Received: from ramas.com [192.0.0.24] by company.mail [127.0.0.1]
	with SMTP (MDaemon.v3.1.0.R)
	for <reliable_computing [at] interval [dot] usl.edu>; Thu, 07 Sep 2000 14:23:51 -0400
Message-ID: <39B7DC16.1D366EA6 [at] ramas [dot] com>
Date: Thu, 07 Sep 2000 14:19:02 -0400
From: Scott Ferson <scott [at] ramas [dot] com>
Organization: Applied Biomathematics
X-Mailer: Mozilla 4.73 [en] (Win98; U)
X-Accept-Language: en
MIME-Version: 1.0
To: "reliable_computing [at] interval [dot] usl.edu" 
 <reliable_computing [at] interval [dot] usl.edu>
Subject: axioms for interval analysis?
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
X-MDaemon-Deliver-To: reliable_computing [at] interval [dot] usl.edu
X-Return-Path: scott [at] ramas [dot] com
X-MDRcpt-To: reliable_computing [at] interval [dot] usl.edu
X-MDRemoteIP: 192.0.0.24
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk


I think that Vladik Kreinovich may disapprove of
the following question, but I ask it out of curiosity.

Have there been axiomatizations of interval analysis?

It might be suggested that the axioms of arithmetic
(http://library.thinkquest.org/10030/2arithax.htm):
    closure,
    commutativity,
    associativity,
    identity element,
    inverse element, and
    distributivity,
for addition and multiplication could simply be
weakened so that inverse element becomes
subcancellation, and distributivity becomes
subdistributivity.  Should such a weakened set be
considered the "axioms of interval analysis"?  If so,
it would seem that fuzzy arithmetic (sensu Kauffman
and Gupta) must be a special case, because it
obeys them too.  What distinguishes the essence
of the interval approach?

In 1993, Rabinovich offered three "axioms" for the
theory measurement error:
    1) the true value exists,
    2) the true value is constant, and
    3) the true value cannot be found.
While these lack a certain mathematical character,
they do seem closer to the spirit of interval analysis.

Is this an inappropriate question?

Scott Ferson
Applied Biomathematics
631-751-4350,  fax -3435



From owner-reliable_computing [at] interval [dot] usl.edu  Thu Sep  7 14:56:45 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id OAA19614
	for reliable_computing-outgoing; Thu, 7 Sep 2000 14:56:45 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id OAA19609
	for <reliable_computing [at] interval [dot] usl.edu>; Thu, 7 Sep 2000 14:56:37 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.10.1/8.10.1) with SMTP id e87JtmO11185;
	Thu, 7 Sep 2000 13:55:48 -0600 (MDT)
Message-Id: <200009071955.e87JtmO11185 [at] cs [dot] utep.edu>
Date: Thu, 7 Sep 2000 13:55:47 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: Re: axioms for interval analysis?
To: reliable_computing [at] interval [dot] usl.edu, scott [at] ramas [dot] com
Cc: smarkov [at] iph [dot] bio.bas.bg
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: IwwklsxOPACg7xtMkKLmkQ==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear Scott,

Svetoslav Markov (email smarkov [at] iph [dot] bio.bas.bg) has done a lot of work on 
algebraic characterization of interval arithmetic. I think he would give you 
the best bibliography of his and related work. 

Vladik

P.S. Nothing wrong with asking a question, why should I disapprove of it.

smarkov [at] iph [dot] bio.bas.bg

> Date: Thu, 07 Sep 2000 14:19:02 -0400
> From: Scott Ferson <scott [at] ramas [dot] com>
> X-Accept-Language: en
> MIME-Version: 1.0
> To: "reliable_computing [at] interval [dot] usl.edu"  
<reliable_computing [at] interval [dot] usl.edu>
> Subject: axioms for interval analysis?
> Content-Transfer-Encoding: 7bit
> X-MDaemon-Deliver-To: reliable_computing [at] interval [dot] usl.edu
> X-Return-Path: scott [at] ramas [dot] com
> X-MDRcpt-To: reliable_computing [at] interval [dot] usl.edu
> X-MDRemoteIP: 192.0.0.24
> 
> 
> I think that Vladik Kreinovich may disapprove of
> the following question, but I ask it out of curiosity.
> 
> Have there been axiomatizations of interval analysis?
> 
> It might be suggested that the axioms of arithmetic
> (http://library.thinkquest.org/10030/2arithax.htm):
>     closure,
>     commutativity,
>     associativity,
>     identity element,
>     inverse element, and
>     distributivity,
> for addition and multiplication could simply be
> weakened so that inverse element becomes
> subcancellation, and distributivity becomes
> subdistributivity.  Should such a weakened set be
> considered the "axioms of interval analysis"?  If so,
> it would seem that fuzzy arithmetic (sensu Kauffman
> and Gupta) must be a special case, because it
> obeys them too.  What distinguishes the essence
> of the interval approach?
> 
> In 1993, Rabinovich offered three "axioms" for the
> theory measurement error:
>     1) the true value exists,
>     2) the true value is constant, and
>     3) the true value cannot be found.
> While these lack a certain mathematical character,
> they do seem closer to the spirit of interval analysis.
> 
> Is this an inappropriate question?
> 
> Scott Ferson
> Applied Biomathematics
> 631-751-4350,  fax -3435
> 


From owner-reliable_computing [at] interval [dot] usl.edu  Fri Sep  8 04:42:35 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id EAA21493
	for reliable_computing-outgoing; Fri, 8 Sep 2000 04:42:35 -0500 (CDT)
Received: from animal.cs.chalmers.se (root [at] animal [dot] cs.chalmers.se [129.16.225.30])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id EAA21488
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 8 Sep 2000 04:42:29 -0500 (CDT)
Received: from cs.chalmers.se (muppet13.cs.chalmers.se [129.16.226.24])
	by animal.cs.chalmers.se (8.8.5/8.8.5) with ESMTP id LAA06266;
	Fri, 8 Sep 2000 11:04:59 +0200 (MET DST)
Message-ID: <39B8ABB9.5391DC9E [at] cs [dot] chalmers.se>
Date: Fri, 08 Sep 2000 11:04:57 +0200
From: Bengt Nordstrom <bengt [at] cs [dot] chalmers.se>
Organization: Dept. of CS, Chalmers, Sweden
X-Mailer: Mozilla 4.7 [en] (X11; U; SunOS 5.6 sun4u)
X-Accept-Language: en
MIME-Version: 1.0
Subject: Professorship in Software Engineering 
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Apologies for multiple copies!

Our sister department, the dept of Computer Engineering is announcing
a chair in Software Engineering. From their description:

   "The professorship will deal with methods and techniques 
    for the development of software, and also in industrial settings. 
    This includes theories and applied methods for specification, 
    verification and validation of functional characteristics 
    along with issues pertaining to quality, dependability, 
    security and safety. 
    Issues related to production, maintenance and management of 
    software systems are also of interest." 


The full description can be found from their homepage

http://www.ce.chalmers.se/MenyE/

Sincerely,

Bengt Nordstrom

From owner-reliable_computing [at] interval [dot] usl.edu  Fri Sep  8 09:30:12 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id JAA22168
	for reliable_computing-outgoing; Fri, 8 Sep 2000 09:30:12 -0500 (CDT)
Received: from iph.bio.bas.bg (IDENT:0@bas-bio.lines.bas.bg [195.96.252.58])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id JAA22163
	for <reliable_computing [at] interval [dot] usl.edu>; Fri, 8 Sep 2000 09:30:02 -0500 (CDT)
Received: from biomath (biomath.bio.bas.bg [195.96.247.160])
	by iph.bio.bas.bg (8.9.3/8.9.3) with ESMTP id RAA02368;
	Fri, 8 Sep 2000 17:36:13 +0300
From: "Svetoslav Markov" <smarkov [at] iph [dot] bio.bas.bg>
Organization: Institute of Mathematics, BAS
To: reliable_computing [at] interval [dot] usl.edu
Date: Fri, 8 Sep 2000 17:28:19 +0200
X-Total-Enclosures: 1
X-Enclosure-Info: DOS,"MAXIOMS.TXT",,,,Text
Subject: Re: axioms for interval analysis?
Reply-to: smarkov [at] iph [dot] bio.bas.bg
CC: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>, scott [at] ramas [dot] com,
        Dr John D Pryce <J.D.Pryce [at] rmcs [dot] cranfield.ac.uk>
Message-ID: <39B921B3.7131.177A806@localhost>
Priority: normal
In-reply-to: <200009071955.e87JtmO11185 [at] cs [dot] utep.edu>
X-mailer: Pegasus Mail for Win32 (v3.12c)
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

 

> Dear Scott,
> 
> Svetoslav Markov (email smarkov [at] iph [dot] bio.bas.bg) has done a lot of work on 
> algebraic characterization of interval arithmetic. I think he would give you the
> best bibliography of his and related work. 
> 
> Vladik
> 
> P.S. Nothing wrong with asking a question, why should I disapprove of it.
>  

Vladik, thank you, I  compiled a list, but this list is not exaustive. Besides,
axiomatic studies are strongly related to studies of the algebraic properties, 
and it is difficult to separate the sources.  I appologize also that most of the 
items are well-known.

I have enlisted 3  related unpublished papers of mine. I can send abstracts to 
those who are interested.

Svetoslav
  
-- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- +

 Svetoslav Markov

 Section "Biomathematics", Inst. of       phone: +3592-979-3704, +3592-707460,
 Mathematics and Computer Sci.,         fax: +3592-971-3649, 
 Bulgarian Academy of Sciences,         e-mail: smarkov [at] iph [dot] bio.bas.bg
 "Acad. G. Bonchev" st., block 8,       
 BG-1113 Sofia,  BULGARIA               

 home address: 11 Mizia, 1124 Sofia, tel. +3592-444651 
 
 -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- +



-------------- Enclosure number 1 ----------------

Selected  papers on the algebra of intervals by S. Markov


 Markov, S., Extended interval arithmetic.  Compt.  rend.  Acad.
bulg.  Sci. 30, 9, 1977, 1239--1242.

  Markov, S., On the extended interval arithmetic.  Compt.  rend.
Acad.  bulg.  Sci., 31, 2, 1978, 163--166.

  Markov, S.  M.:  On the Presentation of Ranges of Monotone
Functions Using Interval Arithmetic; Interval Computations  4(6)
(1992), 19--31.

  Markov, S.  M.:  Extended interval arithmetic involving infinite
intervals.  Mathematica Balkanica, New Series {\sl 6}, 3, 269--304
(1992).

  Markov, S.  M.:  On Directed Interval Arithmetic and its
Applications, J.  UCS 1, 7 (1995), 514--526.
 http://www.iicm.edu/jucs 1 7

  Markov, S., On the Foundations of Interval Arithmetic.
Scientific Computing and Validated Numerics, G.  Alefeld, A.
Frommer, B.  Lang (eds.), Mathematical Research, Vol.  90,
Akademie Verlag, Berlin, 307--313, 1996.

 Markov, S., Isomorphic Embeddings of Abstract Interval Systems. Reliable
Computing 3, No. 3, 199--207, 1997.

 Markov, S., On the Algebra of Intervals and Convex Bodies,
J. UCS 4, No. 1, 34--47, 1998.
 http://www.iicm.edu/jucs_4_1

 Markov, S. An Iterative Method for Algebraic Solution to Interval
Equations,  Applied Numerical Mathematics 30, No. 2-3 (1999), 225--239.

  Markov, S., On the Algebraic Properties of Convex Bodies and Some
Applications,   J. Convex Analysis 7 (2000), No. 1, 129--166.

 Markov, S., On the Algebraic Properties of Intervals and some
Applications,  Reliable Computing, to be published.

 Markov, S., Reducing Linear Interval Systems to Systems of
 Coordinates, manuscript.

 Markov, S. The algebra of errors (symmetric intervals), manuscript.




===================

Selected  literature on interval algebraic systems:
         (ordered chronologically)

  Warmus, M., {\em Calculus of Approximations}, Bull.
Acad.  Polon.  Sci., Cl.  III 4 (1956), 253--259.

 Sunaga, T., {\em Theory of an Interval Algebra
and its Application to Numerical Analysis}, RAAG Memoirs 2 (1958),
Misc. II, 547--564.
(see also:  S.  Markov, K.  Okumura:  The Contribution of T.
Sunaga to Interval Analysis and Reliable Computing, In:  T.
Csendes (ed.), Developments in Reliable Computing, Kluwer, 1999,
163--184. )

  Warmus, M., {\em Approximations and Inequalities in
the Calculus of Approximations.  Classification of Approximate
numbers}, Bull.  Acad.  Polon.  Sci., Ser.  math.  astr.  et phys.,
9 (1961), 241--245.

 Ratschek, H., \"{U}ber einige
intervallarithmetische Grundbegriffe. Computing, 4, 1969, 43--55.

 Ortolf, H-J., {\em Eine Verallgemeinerung der
Intervallarithmetik}. Geselschaft fuer Mathematik und
Datenverarbeitung, Bonn 11, 1969.

 Mayer, O., {\em Algebraische und metrische
Strukturen in der Intervallrechnung und einige Anwendungen},
Computing 5 (1970), 144--162.

 Henrici, P., {\em Circular Arithmetic and the
Determination of Polynomial Zeroes}.  Springer Lecture Notes in
Mathematics 228 (1971), 86--92.

 Ratschek, H., Die Subdistributivit\"{a}t der
Intervallarithmetik, ZAMM, 51, 1971, 189--192.

 Ratschek H., Teilbarkeitskriterien der
Intervallarithmetik. J. Reine Angew. Math. 252, 128--138 (1972).

 Kracht, M., Schr\"{o}der, G., Eine
Einf\"{u}rung in der Theorie der quasilinearen R\"{a}ume mit Anwendung
auf die in der Intervalrechnung augftr\"{a}tenden R\"{a}ume, Math.-Phys.
Semesterber.  20, 226--242 (1973).

 Kracht, M., Schr\"{o}der, G., Zur
Intervallrechnung in Quasilinearen R\"{a}umen, Computing 11,
73--79 (1973).

 Kaucher E., \"{U}ber metrische und algebraische
Eigenschaften einiger beim numerischen Rechnen auftretender R\"{a}ume.
Dissertation, Universit\"{a}t Karlsruhe, 1973.

 Alefeld G., Herzberger J. Einf\"{u}hrung in der
Intervallrechnung, Bibliographisches Institut Mannheim, 1974.

 Kulisch U., Grundlagen des Numerischen Rechnens,
Mathematische Begr\"{u}ndung der Rechnerarithmetik,
Bibliographisches Institut Manncheim, 1976.


 Ratschek, H., G.  Schr\"{o}der, {\em
\"{U}ber den quasilinearen Raum}, Ber.  Math.-statist.  Sekt.,
Forschungszentrum Graz, No.  65 (1976).

 Kaucher, E.,{\em Algebraische Erweiterungen
der Intervallrechnung unter Erhaltung der Ordnungs- und
Verbandstrukturen}, Computing Suppl., 1 (1977), 65--79.

 Ratschek, H., G.  Schr\"{o}der, {\em
Representation of Semigroups as Systems of Compact Convex Sets},
Proc. Amer. Math. Soc. 65 (1977), 24--28.

 Ratschek, H.,  {\em Representation of
Interval Operations by Coordinates}, Computing 24 (1980), 93--96.

 Kaucher, E., {\em Interval Analysis in the
Extended Interval Space} $I\R$, Computing Suppl.  2, 33--49 (1980).

 Garde\~{n}es, E., A.  Trepat, {\em
Fundamentals of SIGLA, an Interval Computing System over the
Completed Set of Intervals}, Computing 24, 161--179 (1980).

 Garde\~{n}es, E.; Trepat, A.; Janer,
 J.~M.:  {\em SIGLA-PL/1 Development and Applications}.  In:
 Nickel, K.:  {\em Interval Mathematics 1980}.  Academic Press,
 1980,   301--315.

 Dimitrova, N., {\em \"{U}ber die
Distributiveges\"{a}tze der Erweiterten Intervallarithmetik}.
Computing 24, 33--49 (1980).

 Wolff v.  Gudenberg, J., {\em
Determination of Minimum Sets of the Set of Zeros of a Function},
Computing 24, 1980, 203--212.

 Garde\~{n}es, E.; Trepat, A.; Janer, J.
 M.:  {\em Approaches to Simulation and to the Linear Problem in
 the SIGLA System.} Freiburger Interval-Berichte 81/8, 1981,
 1--28.

 Garde\~{n}es, E.; Trepat, A.; Mieglo
 H.:  {\em Present Perspective of the SIGLA Interval System}.
 Freiburger Interval-Berichte 82/9, 1982, pp.  1--65.

 Neumaier, A., {\em A Distributive Interval
Arithmetic},  Freiburger Intervall--Berichte 82/10, Inst.  f.
Angew.  Math., U.  Freiburg i.  Br., 1982, 31--38.

 Garde\~{n}es, E.; Trepat, A.; Mieglo H.; Trepat, A.:
{\em Modal Intervals:  Reasons and Ground Semantics}.  In ``Interval
Mathematics 1985'' (Ed.  K.  Nickel), Lecture Notes in Computer
Science 212, Springer, 27--35 (1986).

 Neumaier, A., {\em Interval Methods for
Systems of Equations}, Cambridge University Press, 1990.

 Popova, E., {\em Algebraic Solutions to a Class
of Interval Equations}, J. UCS 4, 48--67 (1998).

Kosheleva, O., V.  Kreinovich, Only Intervals Preserve the
Invertibility of Arithmetic Operations.  Reliable Computing 5, 4,
1999, 385--394.

 Popova, E., {\em Generalized Interval
Distributive Relations and their Applications}.  In MISC'99
Preprints, Workshop  Appl. of Interval Analysis to
Systems and Control, Girona, Spain, 24--26. 02.  1999, U.
of Girona, 1999, 13--23.

 Rump, S.  M., {\em Fast and Parallel Interval
Arithmetic}, BIT 39 (1999), 3, 534--554.


==========================

Selected literature on inner estimations


  Markov, S., Some applications of the extended interval arithmetic
to interval iterations, Computing Suppl.  2, 1980, 69--84.


  Markov S., On the Interval Computation of Elementary Functions,
Comp.  Rend.  Acad.  Bulg.  Sci. 34, 32, 319--322 (1981).


 N.  Dimitrova, S.  M.  Markov.  \"{U}ber die
intervall-arithmetische Berechnung des Wertebereichs einer Funktion
mit Anwendungen, Freiburger Intervall-Berichte, Univ.  Freiburg, 81/4
(1981), 1--22.

 Dimitrova, N., S. M. Markov, On the
interval-arithmetic presentation of the range of a class of monotone
functions of many variables. In: Computer arithmetic, scientific
computation annd mathematical modelling (Ed. by E.Kaucher, S.M.Markov,
G.Mayer), J.C.Balzer, Basel, 1991, 213-228.

  Markov, S.  M.:  Some Interpolation Problems Involving Interval
Data, Interval Computations  3 (1993), 164--182.


 Dimitrova, N., S.  Markov, A Validated Newton Type Method for
Nonlinear Equations, Interval Computation 2 (1994), 27-51.

V. Nesterov: How to use Monotonicity-Type Information To Get Better
Estimates of the Range of Real-Valued Functions, Interval
Computations, 4, 1993, 3--12. (5 cit)


Bartholomew-Biggs, M., Zakovic, S.:  Using Markov's interval
arithmetic to evaluate Bessel Functions, Num.  Algorithms, 10,
1995, 261--287.

 Markov, S., E.  D.  Popova, U.  Schneider, J.  Schulze, On Linear
Interpolation under Interval Data.  Mathematics and Computers in
Simulation 42, 1 (1996), 35--45.

 Markov, S.  M.:  On the Presentation of Ranges of Monotone
Functions Using Interval Arithmetic; Interval Computations, No.  4(6)
(1992), 19--31.

  Markov, S., Some applications of the extended interval arithmetic
to interval iterations, Computing Suppl.  2, 1980, 69--84.

 Markov, S., Reducing Linear Interval Systems to Systems of
 Coordinates, manuscript.


From owner-reliable_computing [at] interval [dot] usl.edu  Fri Sep  8 10:10:40 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA22539
	for reliable_computing-outgoing; Fri, 8 Sep 2000 10:10:40 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA22534
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 8 Sep 2000 10:10:35 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.10.1/8.10.1) with SMTP id e88FAQh16488;
	Fri, 8 Sep 2000 09:10:27 -0600 (MDT)
Message-Id: <200009081510.e88FAQh16488 [at] cs [dot] utep.edu>
Date: Fri, 8 Sep 2000 09:10:24 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: ISSAC-2001: ISSAC 2001 - Call for Papers
To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu
MIME-Version: 1.0
Content-Type: MULTIPART/mixed; BOUNDARY=Exaltation_of_Larks_520_000
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

--Exaltation_of_Larks_520_000
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: PGwTt6ZTu+STyqDvBQnQkQ==

forwarding: apologies for multiple copies
------------- Begin Forwarded Message -------------

X-Authentication-Warning: mailsrv2.zib.de: mail set sender to 
issac2001 [at] orcca [dot] on.ca using -f
Date: Fri, 08 Sep 2000 14:17:15 +0200
From: Publicity Chair <issac2001 [at] orcca [dot] on.ca>
MIME-Version: 1.0
To: issac2001 [at] zib [dot] de
Subject: ISSAC-2001: ISSAC 2001 - Call for Papers

CALL FOR PAPERS 
                            
    International Symposium on Symbolic and Algebraic Computation
              University of Western Ontario, Canada, 
                      July 22-25, 2001
    
              http://www.orcca.on.ca/issac2001/

ISSAC is the yearly premier international symposium in Symbolic and
Algebraic Computation that provides an opportunity to learn of new
developments and to present original research results in all areas 
of symbolic mathematical computation. ISSAC'2001 will be locally 
hosted by the University of Western Ontario at London and the Ontario 
Research Centre for Computer Algebra (ORCCA).

                               Important dates

         Before January 15, 2001      Submission to the Program
                                      Committee Chair deadline
         March 12, 2001               Notification of acceptance
         April 2, 2001                Camera -ready copy received

Original research results and insightful analyses of current concerns 
are solicited for submission. Papers will be reviewed by a program 
committee and referees. Survey articles may be suitable for submission 
if identified as such, they will be considered in a separate category 
from the research papers. Proceedings will be distributed at the 
symposium. Electronic submission is encouraged.

           Program Committee Chair:  Gilles.Villard@ens-lyon.fr


Conference Topics:

Topics of the meeting include, but are not limited to,

  Algorithmic mathematics.  Algebraic, symbolic and symbolic-numeric
algorithms. Simplification, function manipulation, equations,
summation, integration, ODE/PDE, linear algebra, number theory, group
and geometric computing.

  Computer Science. Theoretical and practical problems in symbolic
computation. Systems, problem solving environments, user interfaces,
softwares, libraries, parallel/distributed computing and programming 
languages for symbolic computation, concrete analysis, benchmarking, 
complexity of computer algebra algorithms, automatic differentiation, 
code generation, mathematical data structures and exchange protocols.

  Applications. Problem treatments using algebraic, symbolic or
symbolic-numeric computation in an essential or a novel way.
Engineering, economics and finance, physical and biological sciences,
computer science, logic, mathematics, statistics, education.

Program Committee:

 Chair: Gilles Villard, CNRS IMAG Grenoble, 
                              Gilles.Villard@ens-lyon.fr

Proceedings Editor: Bernard Mourrain, INRIA Sophia Antipolis,
                                       mourrain [at] sophia [dot] inria.fr

Submissions must not substantially duplicate work published 
or submitted for publication elsewhere. Late submissions will 
be rejected.

Best student author award. 

This award will be given to the best student author. An author 
is eligible if full-time student at the time of submission, this 
should be indicated.

Notification. 

Authors will be sent notification of acceptance or rejection by 
e-mail on or before March 12, 2001. A final copy of each accepted 
paper will be required by April 2, 2001. This is again a firm 
deadline. An author of each accepted paper must attend the Conference 
and present the paper, or make arrangements to have it presented.

Preparing final versions. 

Formatting requirements will be based  on the ACM Proceedings 
Templates, for instance in LaTeX2e you should use the
acm_proc_article-sp.cls document class file to format your document.

------------- End Forwarded Message -------------


--Exaltation_of_Larks_520_000
Content-Type: TEXT/html; name="call_for_papers.html"; charset=us-ascii
Content-Description: call_for_papers.html
Content-MD5: Hm7LuhDpLQHKo649X9AOBQ==

<BASE HREF="/lager/walter/ISSAC2001/call_for_papers.html">

<!doctype html public "-//w3c//dtd html 4.0 transitional//en">
<html>
<head>
   <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
   <meta name="GENERATOR" content="Mozilla/4.6 [en] (X11; I; SunOS 5.7 i86pc) [Netscape]">
   <title>Gilles VILLARD,  ISSAC 2001 Call for Papers
</title>
</head>
<body text="#000000" bgcolor="#FFFFFF" link="#000099" vlink="#000099" alink="#000099">
<font color="#000066"><b>Call
for Papers&nbsp; </b>- 05/09/2000</font>
<center><b><font color="#000066"><font size=+4>ISSAC'2001</font></font></b>
<br><b><font color="#000066">International Symposium on Symbolic and Algebraic
Computation</font></b>
<br><b><font color="#000066">University of Western Ontario, Canada, July
22-25, 2001</font></b>
<br><font color="#000066">[<a href="http://www.orcca.on.ca/issac2001/">home
page</a>]</font></center>

<p>ISSAC is the yearly premier international symposium in Symbolic and
Algebraic Computation that provides an opportunity to learn of new developments
and to present original research results in all areas of symbolic mathematical
computation. ISSAC'2001 will be locally hosted by the <a href="http://www.uwo.ca/">University
of Western Ontario</a> at London and the <a href="http://www.orcca.on.ca/">Ontario
Research Centre for Computer Algebra</a> (ORCCA).
<br>&nbsp;
<center><table BORDER CELLSPACING=0 COLS=1 WIDTH="80%" BGCOLOR="#330000" NOSAVE >
<tr NOSAVE>
<td BGCOLOR="#000099" NOSAVE>
<center><font color="#FFFFFF"><font size=+1>Important dates</font></font></center>
</td>
</tr>

<tr BGCOLOR="#330000" NOSAVE>
<td BGCOLOR="#33CCFF" NOSAVE>
<center><table BORDER=0 CELLSPACING=4 CELLPADDING=0 COLS=2 WIDTH="97%" NOSAVE >
<tr VALIGN=TOP NOSAVE>
<td NOSAVE><b>Before January 15, 2001</b></td>

<td NOSAVE>Submission to the Program Committee Chair deadline</td>
</tr>

<tr VALIGN=TOP NOSAVE>
<td NOSAVE><b>March 12, 2001&nbsp;</b></td>

<td NOSAVE>Notification of acceptance</td>
</tr>

<tr VALIGN=TOP NOSAVE>
<td NOSAVE><b>April 2, 2001</b></td>

<td NOSAVE>Camera -ready copy received&nbsp;</td>
</tr>
</table></center>

<p>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Original research results and insightful
analyses of current concerns are solicited for submission. Papers will
be reviewed by a program committee and referees. Survey articles may be
suitable for submission if identified as such, they will be considered
in a separate category from the research papers. Proceedings will be distributed
at the symposium.&nbsp; Electronic submission is encouraged, a description
of the procedure will appear on this site.&nbsp;
<p>&nbsp;&nbsp; <b>Program Committee Chair:</b>&nbsp; <a href="mailto:Gilles.Villard [at] imag [dot] fr">Gilles.Villard@ens-lyon.fr</a>
<br>&nbsp;</td>
</tr>
</table></center>

<p><b>Conference Topics:</b>
<p>Topics of the meeting include, but are not limited to,
<ul><i>Algorithmic mathematics.&nbsp;</i> Algebraic, symbolic and symbolic-numeric
algorithms. Simplification, function manipulation, equations, summation,
integration, ODE/PDE, linear algebra, number theory, group and geometric
computing.
<p><i>Computer Science.</i> Theoretical and practical problems in symbolic
computation. Systems, problem solving environments, user interfaces, softwares,
libraries, parallel/distributed computing and&nbsp; programming languages
for symbolic computation, concrete analysis, benchmarking, complexity of
computer algebra algorithms, automatic differentiation, code generation,
mathematical data structures and exchange protocols.
<p><i>Applications.</i> Problem treatments using algebraic, symbolic or
symbolic-numeric computation in an essential or a novel way. Engineering,
economics and finance, physical and biological sciences, computer science,
logic, mathematics, statistics, education.</ul>
<b>Program Committee:</b>
<p><b>&nbsp;&nbsp;&nbsp;&nbsp; Chair:</b> <i><a href="http://www-lmc.imag.fr/lmc-cf/Gilles.Villard/">Gilles
Villard</a></i>, C<font size=-1>NRS</font> I<font size=-1>MAG</font> Grenoble,
<a href="mailto:Gilles.Villard [at] imag [dot] fr">Gilles.Villard@ens-lyon.fr</a>
<p><b>Proceedings Editor: </b><i><a href="http://www-sop.inria.fr/saga/personnel/Bernard.Mourrain/index.html">Bernard
Mourrain</a>, </i>I<font size=-1>NRIA</font> Sophia Antipolis, <a href="mailto:mourrain [at] sophia [dot] inria.fr">mourrain [at] sophia [dot] inria.fr</a>
<p>Submissions must not substantially duplicate work published or submitted
for publication elsewhere.&nbsp; Late submissions will be rejected.
<p><b>Best student author award.</b> This award will be given to the best
student author. An author is eligible if full-time student at the time
of submission, this should be indicated.
<p><b>Notification.</b> Authors will be sent notification of acceptance
or rejection by e-mail on or before <b>March 12, 2001</b>. A final copy
of each accepted paper will be required by <b>April 2, 2001</b>. This is
again a firm deadline. An author of each accepted paper must attend the
Conference and present the paper, or make arrangements to have it presented.
<p><b>Preparing final versions. </b>Formatting requirements will be based&nbsp;
on the <a href="http://www.acm.org/sigs/pubs/proceed/template.html">ACM
Proceedings Templates</a>, for instance in LaTeX2e you should use the
<a href="http://www.acm.org/sigs/pubs/proceed/acm_proc_article-sp.cls">acm_proc_article-sp.cls</a>
document class file to format your document.
</body>
</html>

--Exaltation_of_Larks_520_000--

From owner-reliable_computing [at] interval [dot] usl.edu  Sat Sep  9 21:24:51 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id VAA00964
	for reliable_computing-outgoing; Sat, 9 Sep 2000 21:24:51 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id VAA00959
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sat, 9 Sep 2000 21:24:46 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.10.1/8.10.1) with SMTP id e8A2OZk00491;
	Sat, 9 Sep 2000 20:24:35 -0600 (MDT)
Message-Id: <200009100224.e8A2OZk00491 [at] cs [dot] utep.edu>
Date: Sat, 9 Sep 2000 20:24:34 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: axiomatizations of interval analysis
To: reliable_computing [at] interval [dot] louisiana.edu, scott [at] ramas [dot] com
Cc: vladik [at] cs [dot] utep.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: tPMXLsp8T4GGjb2L7Z6c5A==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear Scott, 

Let me add, to my previous reply, a comment about the second part of your 
question. 

The three "axioms" which Rabinovich describes in his book "Measurement errors: 
theory and practice" (on foundations of uncertainty in measurement theory) seem 
very reasonable indeed from the viewpoint of measurement theory - one of the 
major sources of applications for interval mathematics. 

However, none of the existing axiomatizations of interval mathematics is 
directly reflecting these three properties. 

I think that a natural formalization of these properties would come if we 
consider modal logic: Traditional axiomatization of real numbers is using the 
traditional (first order) logic in which every statement is either true or 
false. In modal logic, there are two additional connectives: "possible" and 
"necessary", with the usual interpretation that there are several possible 
models ("worlds");
* "possible A" means that A is true in one of the possible worlds;
* "necessarily A" means that A is true in all possible worlds, and 
* simply "A" means that A is true in the actual world (we do not know which
  of the possible worlds is the actual world). 
In these terms, Rabinovich's idea is that when a measurement results in an 
interval [a,b], this means that the (unknown) actual value X of the measured 
quantity can possibly be equal to any value from this interval. In other words,
"possible (X=x) if and only if a<= x<=b" 
If we thus interpret the intervals of possible values of several variables 
X1,...,Xn, then, for an arbitrary algebraic function X=f(X_1,...,Xn), we get 
exactly the same interval of possible values as interval computation.

This analogy is known: it was first orginally proposed by Gardenes (who went - 
in his Modal Interval Analysis - much further than formalizing interval 
computations). It is used in our book with Lakeyev, Rohn, and Kahl on 
Computational Complexity and Feasibility of Data Processing and Interval 
Computations (Appendix C) from the viewpoint of computational complexity of the 
corresponding problems. 

It may be a good idea to exploit this modal logic idea as a foundations for 
interval mathematics. I am sending this message to the entire list so that we 
may get some more references and ideas on this. 

Maybe, this formalization will be as easy as selecting a piece of morer 
sophisticated Gardenes's ideas. Maybe, we will need to think some more about 
it. 

And it may fit nicely with a more algebraic approach - since some of Markov's 
papers actually formalize not just the usual interval computations, but also 
its generalizations - some of it by operations which were proposed by 
Gardenes's Modal Interval Analysis. 

Vladik 
**************************************************************************
On Thu, 7 Sep 2000, Scott Ferson wrote:

I think that Vladik Kreinovich may disapprove of
the following question, but I ask it out of curiosity.

Have there been axiomatizations of interval analysis?

It might be suggested that the axioms of arithmetic
(http://library.thinkquest.org/10030/2arithax.htm):
    closure,
    commutativity,
    associativity,
    identity element,
    inverse element, and
    distributivity,
for addition and multiplication could simply be
weakened so that inverse element becomes
subcancellation, and distributivity becomes
subdistributivity.  Should such a weakened set be
considered the "axioms of interval analysis"?  If so,
it would seem that fuzzy arithmetic (sensu Kauffman
and Gupta) must be a special case, because it
obeys them too.  What distinguishes the essence
of the interval approach?

In 1993, Rabinovich offered three "axioms" for the
theory measurement error:
    1) the true value exists,
    2) the true value is constant, and
    3) the true value cannot be found.
While these lack a certain mathematical character,
they do seem closer to the spirit of interval analysis.

Is this an inappropriate question?

Scott Ferson
Applied Biomathematics
631-751-4350,  fax -3435





From owner-reliable_computing [at] interval [dot] usl.edu  Sun Sep 10 08:42:28 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id IAA02562
	for reliable_computing-outgoing; Sun, 10 Sep 2000 08:42:28 -0500 (CDT)
Received: from iph.bio.bas.bg (IDENT:0@bas-bio.lines.bas.bg [195.96.252.58])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id IAA02557
	for <reliable_computing [at] interval [dot] usl.edu>; Sun, 10 Sep 2000 08:42:17 -0500 (CDT)
Received: from biomath (biomath.bio.bas.bg [195.96.247.160])
	by iph.bio.bas.bg (8.9.3/8.9.3) with ESMTP id QAA05352;
	Sun, 10 Sep 2000 16:48:46 +0300
From: "Svetoslav Markov" <smarkov [at] iph [dot] bio.bas.bg>
Organization: Institute of Mathematics, BAS
To: reliable_computing [at] interval [dot] usl.edu, Scott Ferson <scott [at] ramas [dot] com>
Date: Sun, 10 Sep 2000 16:40:42 +0200
Subject: Re: axioms for interval analysis?
Reply-to: smarkov [at] iph [dot] bio.bas.bg
CC: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Message-ID: <39BBB98A.18207.4CE785@localhost>
Priority: normal
In-reply-to: <39B7DC16.1D366EA6 [at] ramas [dot] com>
X-mailer: Pegasus Mail for Win32 (v3.12c)
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Dear Dr Ferson,

You are right in your intuitive idea of axiomatization of interval arithmetic, as 
one important step in this direction has been namely the weekening of the 
distributive law  leading to the concept of quasilinear space (Mayer, 
Ratschek, Schroeder, Kracht, etc.). Another important  step has been the 
turnover of the semigroup systems into group systems (Ortolf, Kaucher, 
Gardenes etc) and the isomorphic extension of inclusion (Kaucher) in the 
same manner as nonnegative numbers are extended by negative ones.
I should like to mention (in connection to Vladik's answer) that, when working 
in a group system we need an interpretation of inproper results (in the same 
way we interprete negative results). Such an interpretation is offered by the 
modal interval arithmetic proposed by Gardenes.  There are other 
interpretations as well. 

The axiomatization of interval arithmetic has not been yet finished. Again, to 
make it more precise, denote:

I(R) the set of (proper) interval on the real line

+ addition

* multiplication by scalar

X interval multiplication

\subseteq  inclusion

<=  preceeding

distance, norm etc.


Then the following systems have been axiomatized:

(I(R),+,*)  quasilinear space (Mayer, Ratschek, etc) 

(I, X, \subseteq)  Ortolf, Kaucher, Gardenes

(I write "I" because this is a group structure including improper elements)

(I,+) is trivial system, but it should be mentioned

Let me note that quasilinear systems with group structure connect both lines 
of investigations.  

Still little is published  about (I,+,X,\subseteq, <=).

There are many investigations related to distance, norm, etc.

Much remains to be done, but I think that we are very close to a full 
axiomatization of interval arithmetic. This subject is closed to the one of 
axiomatization of convex analysis (where an arithmetic of convex bodies is 
needed).

It should be noted expressively that interval arithmetic has enriched the 
algebra by the concept of quasilinear space. This is an important concept, 
because it provides a better understanding of linear spaces. It is a pity that it 
seems to be so little known  within us.

The group system (I,X) is also very interesting as it has  the symmetries
identity, negation, opposite and dual.  I dare hope that this system will also 
be studied soon in the textbooks of algebra.

S. Markov



> 
> I think that Vladik Kreinovich may disapprove of
> the following question, but I ask it out of curiosity.
> 
> Have there been axiomatizations of interval analysis?
> 
> It might be suggested that the axioms of arithmetic
> (http://library.thinkquest.org/10030/2arithax.htm):
>     closure,
>     commutativity,
>     associativity,
>     identity element,
>     inverse element, and
>     distributivity,
> for addition and multiplication could simply be
> weakened so that inverse element becomes
> subcancellation, and distributivity becomes
> subdistributivity.  Should such a weakened set be
> considered the "axioms of interval analysis"?  If so,
> it would seem that fuzzy arithmetic (sensu Kauffman
> and Gupta) must be a special case, because it
> obeys them too.  What distinguishes the essence
> of the interval approach?
> 
> In 1993, Rabinovich offered three "axioms" for the
> theory measurement error:
>     1) the true value exists,
>     2) the true value is constant, and
>     3) the true value cannot be found.
> While these lack a certain mathematical character,
> they do seem closer to the spirit of interval analysis.
> 
> Is this an inappropriate question?
> 
> Scott Ferson
> Applied Biomathematics
> 631-751-4350,  fax -3435
> 


  
-- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- +

 Svetoslav Markov

 Section "Biomathematics", Inst. of       phone: +3592-979-3704, +3592-707460,
 Mathematics and Computer Sci.,         fax: +3592-971-3649, 
 Bulgarian Academy of Sciences,         e-mail: smarkov [at] iph [dot] bio.bas.bg
 "Acad. G. Bonchev" st., block 8,       
 BG-1113 Sofia,  BULGARIA               

 home address: 11 Mizia, 1124 Sofia, tel. +3592-444651 
 
 -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- +

From owner-reliable_computing [at] interval [dot] usl.edu  Sun Sep 10 19:00:42 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id TAA03253
	for reliable_computing-outgoing; Sun, 10 Sep 2000 19:00:42 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id TAA03248
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 10 Sep 2000 19:00:38 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.10.1/8.10.1) with SMTP id e8B00T402993;
	Sun, 10 Sep 2000 18:00:29 -0600 (MDT)
Message-Id: <200009110000.e8B00T402993 [at] cs [dot] utep.edu>
Date: Sun, 10 Sep 2000 18:00:29 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: Thiland conference: deadline extended, interval papers sought
To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu
Cc: pratit@s-t.au.ac.th
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: Sf+zm76XjWWf8nJj3Ucw9w==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

September 10, 2000

Dear Friends, 

On December 13-15, 2000, the first international conference on intelligent 
technologies will be held in Thailand. The official deadline for
submission was September 4. Quite a few researchers have already asked for
an extension, since they have been out of town for Summer and need
time to finish their papers. 

Professor Hung T. Nguyen, the conference's Organizing Co-Chair,
has recently returned from Bangkok, where he discussed this problem
with the local organizers. With the commitment of referees, it looks
like it is possible to referee a paper and publish it before the
conference if the paper is submitted before October 1. 

So, if you are interested in submitting a paper, then the special 
new deadline is 
  October 1, 2000
Please refer to this email when submitting your paper.
(Camera-ready copies of the final versions of accepted papers are currently 
scheduled to go to the publisher on November 1, so no further deadline
extension seems possible.) 

Also, if anyone is interested in organizing an invited session with 4-5
papers, so that this organizer will take care of the refereeing
process, please contact me and Dr. Pratit Santiprabhob, the General
Chair of the conference (email pratit@s-t.au.ac.th), as soon as
possible. We will set up the deadlines for the refereed papers
and, if necessary, help with the refereeing. 

If you are also interested in serving as a referee, please also let us
know. 

The conference will be covering a wide range of different topics. 
In particular, since Professor Santiprabhob is a former student of 
Ladislav Kohout, one of the pioneers in interval methods in knowledge
representation, we would like to greatly encourage submissions in
this area. If someone is interested in organizing a special invited 
session in this topic it will be great.

Professor Santiprabhob also 
asked us to assure potential authors that the local organizers will do
their best to make the trip not only scientifically interesting, but
also pleasurable. During his recent visit, Hung T. Nguyen was very much 
impressed by the organization, by the amazing campus and the beautiful
country.

Vladik
------------------------------------------------------------------------
                               CALL FOR PAPERS
       INTERNATIONAL CONFERENCE ON INTELLIGENT TECHNOLOGIES - BANGKOK
                            DECEMBER 13-15, 2000
------------------------------------------------------------------------
The International Conference on Intelligent Technologies (InTech'2000) is
the first international conference on intelligent technologies to be held in
Bangkok, Thailand. The conference especially focuses on topics in Artificial
Intelligence, Soft Computing and related fields. The aims of InTech'2000 are
to:
* bring together researchers and practitioner in order to exchange
  their ideas and discuss issues occurred when implementing intelligent
  technologies in real-world environment
* provide a forum for discussion of new research areas, results, and
  issues.
* encourage national researches in this technology

Selected, extended, revised and refereed papers from the Conference will
be published in:
* Special Issue on Intelligent Technologies in the International Journal
  of Intelligent Systems (Ron Yager, Editor-in-Chief, John Wiley
  publishers, USA); and
* A special issue of the International Journal of Uncertainty, Fuzziness
  and Knowledge-Based Systems (Bernadette Bouchon-Meunier, Editor-in-Chief)

For more information, see the website http://www.s-t.au.ac.th/~Intech2000/






From owner-reliable_computing [at] interval [dot] usl.edu  Sun Sep 10 19:22:33 2000
Received: (from root@localhost)
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id TAA03566
	for reliable_computing-outgoing; Sun, 10 Sep 2000 19:22:33 -0500 (CDT)
Received: from corinna.its.utas.edu.au (corinna.its.utas.edu.au [131.217.10.51])
	by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id TAA03561
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 10 Sep 2000 19:22:19 -0500 (CDT)
Received: from [131.217.124.71] (colyvan.phil.utas.edu.au [131.217.124.71])
	by corinna.its.utas.edu.au (8.9.3/8.9.3) with ESMTP id LAA25379
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 11 Sep 2000 11:21:57 +1100 (EST)
Mime-Version: 1.0
X-Sender: mcolyvan [at] postoffice [dot] utas.edu.au
Message-Id: <v04210100b5e1d0eb2f45@[131.217.124.71]>
In-Reply-To: <20000910235827.26791.qmail [at] web901 [dot] mail.yahoo.com>
References: <20000910235827.26791.qmail [at] web901 [dot] mail.yahoo.com>
Date: Mon, 11 Sep 2000 11:26:26 +1100
To: reliable_computing [at] interval [dot] louisiana.edu
From: Mark Colyvan <Mark.Colyvan [at] utas [dot] edu.au>
Subject: Re: axiomatizations of interval analysis
Content-Type: text/plain; charset="us-ascii" ; format="flowed"
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk

>Dear Scott,
>
>Let me add, to my previous reply, a comment about the second part of your
>question.
>
>The three "axioms" which Rabinovich describes in his book "Measurement errors:
>theory and practice" (on foundations of uncertainty in measurement 
>theory) seem
>very reasonable indeed from the viewpoint of measurement theory - one of the
>major sources of applications for interval mathematics.
>
>However, none of the existing axiomatizations of interval mathematics is
>directly reflecting these three properties.
>
>I think that a natural formalization of these properties would come if we
>consider modal logic: Traditional axiomatization of real numbers is using the
>traditional (first order) logic in which every statement is either true or
>false. In modal logic, there are two additional connectives: "possible" and
>"necessary", with the usual interpretation that there are several possible
>models ("worlds");
>* "possible A" means that A is true in one of the possible worlds;
>* "necessarily A" means that A is true in all possible worlds, and
>* simply "A" means that A is true in the actual world (we do not know which
>  of the possible worlds is the actual world).
>In these terms, Rabinovich's idea is that when a measurement results in an
>interval [a,b], this means that the (unknown) actual value X of the measured
>quantity can possibly be equal to any value from this interval. In 
>other words,
>"possible (X=x) if and only if a<= x<=b"
>If we thus interpret the intervals of possible values of several variables
>X1,...,Xn, then, for an arbitrary algebraic function X=f(X_1,...,Xn), we get
>exactly the same interval of possible values as interval computation.
>
>This analogy is known: it was first orginally proposed by Gardenes (who went -
>in his Modal Interval Analysis - much further than formalizing interval
>computations). It is used in our book with Lakeyev, Rohn, and Kahl on
>Computational Complexity and Feasibility of Data Processing and Interval
>Computations (Appendix C) from the viewpoint of computational 
>complexity of the
>corresponding problems.
>
>It may be a good idea to exploit this modal logic idea as a foundations for
>interval mathematics. I am sending this message to the entire list so that we
>may get some more references and ideas on this.
>
>Maybe, this formalization will be as easy as selecting a piece of morer
>sophisticated Gardenes's ideas. Maybe, we will need to think some more about
>it.
>
>And it may fit nicely with a more algebraic approach - since some of Markov's
>papers actually formalize not just the usual interval computations, but also
>its generaliza