From owner-reliable_computing [at] interval [dot] louisiana.edu Mon Oct  1 14:07:24 2001
Received: (from root@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f91J7OA05660
	for reliable_computing-outgoing; Mon, 1 Oct 2001 14:07:24 -0500 (CDT)
Received: from clmboh1-smtp3.columbus.rr.com (clmboh1-smtp3.columbus.rr.com [65.24.0.112])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f91J7Eq05655
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 1 Oct 2001 14:07:19 -0500 (CDT)
Received: from oemcomputer (dhcp065-024-174-102.columbus.rr.com [65.24.174.102])
	by clmboh1-smtp3.columbus.rr.com (8.11.2/8.11.2) with SMTP id f91J2jR25481;
	Mon, 1 Oct 2001 15:02:45 -0400 (EDT)
Message-ID: <000801c14aab$d9b0f300$66ae1841 [at] columbus [dot] rr.com>
From: "Ramon Moore" <rmoore17 [at] columbus [dot] rr.com>
To: "R. Baker Kearfott" <rbk [at] louisiana [dot] edu>
Cc: <reliable_computing [at] interval [dot] louisiana.edu>
References: <2.2.32.20010929005651.036c262c [at] 130 [dot] 70.132.231>
Subject: Re: Moore's early papers available electronically
Date: Mon, 1 Oct 2001 15:04:09 -0400
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.50.4133.2400
X-MimeOLE: Produced By Microsoft MimeOLE V5.50.4133.2400
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

The list does contain some of the early work, but the one that was perhaps
the most important in its influence and in tracing the early development of
the subject is missing, namely:

"The automatic analysis and control of error in digital computation based on
the use of interval numbers", pages 61-130 in the volume Error in Digital
Computation, Edited by Louis B. Rall, John Wiley & Sons, NY, 1965.

Ramon Moore

----- Original Message -----
From: "R. Baker Kearfott" <rbk [at] louisiana [dot] edu>
To: <reliable_computing [at] interval [dot] louisiana.edu>
Sent: Friday, September 28, 2001 8:56 PM
Subject: Moore's early papers available electronically


> Colleagues,
>
> Bill Walster has collected the early works of Ray Moore and his
> colleagues, has scanned them into electronic form, and has obtained
> permission from the publishers to post them.  (Sun has sponsored
> this endeavor, including paying copyright fees.)  Eldon
> Hansen has written a short introduction, that I have converted
> to HTML.  This HTML file contains links to the actual papers (in
> PDF format),  that you can access and read.  The collection is
> available at the address:
>
> http://interval.louisiana.edu/Moores_early_papers/bibliography.html
>
> 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] louisiana.edu Wed Oct  3 20:00:24 2001
Received: (from root@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f9410Nr06769
	for reliable_computing-outgoing; Wed, 3 Oct 2001 20:00:23 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f9410DW06755
	for <reliable_computing [at] interval [dot] louisiana.edu>; Wed, 3 Oct 2001 20:00:15 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.11.3/8.11.3) with SMTP id f940xts26515;
	Wed, 3 Oct 2001 18:59:56 -0600 (MDT)
Message-Id: <200110040059.f940xts26515 [at] cs [dot] utep.edu>
Date: Wed, 3 Oct 2001 18:59:55 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: FYI: conference in Poland
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: /PX39Nqta4uQUhqXNdgkXg==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

Dear Vladik,

we want to gather people interested in "nonclassical" approaches
to probability and statistics. Thus the interval-valued probability approach
is also welcome. 

Best regards
Przemyslaw
************************************************************************

http://www.ibspan.waw.pl/smps2002/

FIRST INTERNATIONAL WORKSHOP ON 
SOFT METHODS IN PROBABILITY AND STATISTICS
SMPS'2002, Warsaw, Poland, September 9-13, 2002

 During the last thirty years a considerable
 number of papers have been published with the aim
 to extend the existing theory of probability and
 those attempts is to "soften" the classical theory.

 Some "softening" approaches utilise concepts and
 techniques developed in such theories like the
 fuzzy set theory or the theory of possibility, some
 other approaches, like the Dempster-Shafer theory,
 have their origins in the classical theory of
 probability.


 The soft methods in probability and mathematical
 statistics have obviously many common features.
 Unfortunately, due to visible lack of a common

 forum, there are not too many occasions to exchange
 ideas and applicable techniques. To have such a
 forum seems very important, as in many cases we are
 talking about similar things using different
 language. Therefore, we believe that there is a
 need to establish a new conference oriented on
 people who are involved in the theoretical and
 applied research in the field of soft methods in
 probability and statistics.

 The scope of the conference is to bring together
 experts representing all existing approaches used
 in soft probability and statistics. In particular,
 we would welcome papers on fuzzy probability and
 statistics , applications of the Dempster-Shafer
 theory , and applications of the rough set theory .
 Both theoretical and applied papers are welcome.

INTERNATIONAL PROGRAM COMMITTEE

 GENERAL CHAIRMAN:
 O. Hryniewicz (Poland)

 MEMBERS:
 D. Dubois (France)
 M.A. Gil (Spain)
 J. Kacprzyk (Poland)
 E. Kerre (Belgium)
 D. Ralescu (USA)
 A. Skowron (Poland)

ORGANISING COMMITTEE
 P. Grzegorzewski - chairman
 E. Mrowka

ABSTRACT

 Abstracts of 1-2 pages (A4) written in English
 should be submitted no later than December 31, 2001 to
 the chairman of organising committee:

 Przemyslaw Grzegorzewski
 Systems Research Institute
 Polish Academy of Sciences
 Newelska 6
 01-447 Warsaw, Poland
 e-mail: pgrzeg [at] ibspan [dot] waw.pl

 Full papers of 5-8 pages may only be submitted by e-mail
 as LaTeX file by May 15, 2002.

TIMETABLE

 Registration and submission of abstracts by December 31, 2001.

 Notification of acceptance by February 28, 2002.

 Submission of finale conference papers and payment of the
 conference fee by May 15, 2002.

REGISTRATION

 Fill out this form in order to apply on conference:
 (the deadline of adopting application is December 31st,
 2001):

 PERSONAL DETAILS:

 Surname:
 First name:
 Title:
 Organisation:
 Your Contact Information :
 Postal address:
 Postcode:
 Country:
 Telephone:
 Fax:
 E-mail:
 Information about paper:
 Submitting a paper: yes no
 Authors:
 Title of paper:
 Remarks:

CORRESPONDENCE

 All correspondence should be addressed to:

 Przemyslaw Grzegorzewski
 Systems Research Institute
 Polish Academy of Sciences
 Newelska 6
 01-447 Warsaw, Poland
 tel. +(48 22) 837 35 78 int. 207
 fax +(48 22) 837 27 72
 e-mail: pgrzeg [at] ibspan [dot] waw.pl

CONFERENCE FEE

 The conference fee expected to be approximately 200
 US dollars. This includes a copy of the conference
 proceedings, attendance at seminars, refreshments and
 the conference dinner.





From owner-reliable_computing [at] interval [dot] louisiana.edu Fri Oct  5 16:05:29 2001
Received: (from root@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f95L5Te01275
	for reliable_computing-outgoing; Fri, 5 Oct 2001 16:05:29 -0500 (CDT)
Received: from imf00bis.bellsouth.net (mail000.mail.bellsouth.net [205.152.58.20])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f95L5Od01269
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 5 Oct 2001 16:05:24 -0500 (CDT)
Received: from u8174 ([66.20.82.62]) by imf00bis.bellsouth.net
          (InterMail vM.5.01.01.01 201-252-104) with SMTP
          id <20011005210621.KAPX14209.imf00bis.bellsouth.net@u8174>
          for <reliable_computing [at] interval [dot] louisiana.edu>;
          Fri, 5 Oct 2001 17:06:21 -0400
Message-Id: <2.2.32.20011005210438.039451a8 [at] 130 [dot] 70.132.231>
X-Sender: rbk5287 [at] 130 [dot] 70.132.231
X-Mailer: Windows Eudora Pro Version 2.2 (32)
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Date: Fri, 05 Oct 2001 16:04:38 -0500
To: reliable_computing [at] interval [dot] louisiana.edu
From: "R. Baker Kearfott" <rbk [at] louisiana [dot] edu>
Subject: Validated Computing 2002: Deadline extended
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

Colleague,

We have extended the deadline for submission of abstracts to be
considered for highlighted talks from October 5 to November 1.
This makes the deadline consistent with the deadline for contributions
to the SIAM Conference on Optimization, immediately preceeding
Validated Computing 2002.

There seems to have been some confusion about highlighted talks.
These are 40-minute talks, rather than the usual 30 minutes; they
are a way for the organizers to honor abstracts judged to be
particularly worthy.

Also note that, in spite of the fact that Validated Computing 2002
follows the SIAM Conference on Optimization, topics are not limited
to optimization.

In any case, we hope to have as many contributions as possible
early, and we encourage everyone to submit a contribution by 
October 30, if possible.

I have appended a copy of the call for papers.  You can also 
browse this information, with links, at

http://interval.louisiana.edu/conferences/Validated_computing_2002/html_notice.html

Sincerely,

R. Baker Kearfott
===================================================================================

Validated Computing 2002
SIAM Workshop
Toronto, Canada, May 23-25, 2002

(including a special session honoring Ray Moore)

Immediately following the Seventh SIAM Conference on
Optimization (May 20-23, 2002)
(see http://www.siam.org/meetings/op02/index.htm)

To be followed by a Fields Institute working group on
optimization

Call for Papers
---------------

We invite submission of papers dealing with validated computing.
Areas of interest include, but are not limited to, interval
arithmetic and analysis, use of mathematical theory to assure
reliable scientific computation, and fuzzy logic.
We are especially interested in applications of these techniques
and in tools that support the techniques.

Submit an extended abstract of 2-3 pages to R. Baker Kearfott
at rbk [at] louisiana [dot] edu by October 5.  Submissions
must be in Latex using ONLY the standard article style.  Use
psfig.sty if you include figures.


The Program Committee will review the submissions contributed.
Most papers will be presented as 30 minute talks.  Depending
on the number of submissions, 8-12 talks will be selected for
40 minute highlighted talks.  A few talks may be selected for
other special sessions.

We invite proposals for minisymposia of 4-5 speakers
coordinated to focus on a particular topic. Minisymposia
proposals should include the extended abstracts of each speaker
AND a one paragraph abstract for the session. Submit
minisymposia proposals to R. Baker Kearfott at rbk [at] louisiana [dot] edu
by October 5.Minisymposia will have the same visibility and
length of talks as the contributed paper sessions.

The Program Committee will attempt to arrange contributed papers
into coherent sessions.  The advantage of a minisymposium is that
the minisymposium organizer and speakers are encouraged to
communicate and coordinate their presentations to increase impact,
use a common notation, and reduce duplications.

Deadlines
---------

October   5   Minisymposia proposals including extended abstracts
              of each speaker AND a one paragraph abstract for the
              session.
November  1   Extended 2-3 page abstracts to be considered for
              highlighted talks
November 30   Notification of accepted talks, and talks
              selected for highlighting
January  15   Extended 2-3 page abstracts for LATE submissions, which
              will be considered only as contributed talks
February 15   Notification of accepted talks
March 1 (tentative)  End of early registration
April 1 (tentative)  Hotel reservations
May 23-25     Workshop itself

Speakers who have already accepted invitations
----------------------------------------------

Goetz Alefeld
Bill Walster
Annie Cuyt
William Edmonson
Andreas Griewank
Eldon Hansen
Kaj Madsen
Arnold Neumaier
Linda Petzold
Louis Rall
Mark Stadtherr
Bill Walster

Special informal week
---------------------

Participants in the workshop are invited to participate in a week
of informal discussions at the Fields Institute at the University
of Toronto, immediately following the workshop. This week is part
of the Fields Institute's special thematic year on computational
challenges in science and engineering.  Depending on
numbers, the Fields Institute can provide office space and
meeting areas for this activity. For general information on
the Fields Institute and the thematic year, see

 http://www.fields.utoronto.ca/programs/scientific/01-02/numerical/)

Persons interested in this week at the Fields Institute should
contact R. Baker Kearfott (rbk [at] louisiana [dot] edu) or
or Tibor Csendes (csendes [at] inf [dot] u-szeged.hu)
before October 5, 2001. You may express your interest when you submit
your abstract.

Web page:
--------

A web-page with this and other information is available at
http://interval.louisiana.edu/conferences/Validated_computing_2002/html_notice.html.

Description and rationale
-------------------------

Reliable computing is essential. There is no feasible alternative.
Modern societies rely more and more on computer systems. Usually, our
systems appear to work successfully, but there are sometimes serious,
and often minor, errors. Ever increasing reliance on computer systems
brings ever increasing need for reliability.

Validated computing is one essential technology to achieve increased
software reliability. Validated computing uses controlled rounding of
computer arithmetic to guarantee that hypotheses of suitable
mathematical theorems are (or are not) satisfied. Mathematical rigor
in the computer arithmetic, in algorithm design, and in program
execution allow us to guarantee that the stated problem has (or does
not have) a solution in an enclosing interval we compute. If the
enclosure is narrow, we are certain that we know the answer reliably
and accurately. If the enclosing interval is wide, we have a clear
warning that our uncertainty is large, and a closer study is demanded.

Intervals capture uncertainly in modeling and problem formulation, in
model parameter estimation, in algorithm truncation, in operation
round off, and in model interpretation.

The techniques of validated computing have proven their merits
in many scientific and engineering applications. They help
answer questions from, "How much irrigation water does a desert
golf course return effectively unused to its bordering stream?"
to "Will a near earth asteroid hit the earth, possibly ending
life as we know it?".

The techniques of validated computing rest on solid and interesting
theoretical studies in mathematics and computer science.
Contributions from fields including real, complex and functional
analysis, semigroups, probability, statistics, fuzzy logic, automatic
differentiation, computer hardware, operating systems, compiler
construction, parallel processing, and software engineering are all
essential.

The major emphasis of the program is on applications. We will hear
from many people who have used tools from validated computing to
attack, and often solve, significant practical problems.
Successful applications have included medical diagnosis and
treatment, financial simulation, mechanical design, oil reservoir
simulation, aeronautics, high energy particle accelerators,
environmental engineering, chemical process simulation and control,
computer graphics for motion picture special effects, astrophysics,
and many more.

Not all applications are as yet successful.  We will also hear from
people with challenging applications to which validated techniques
have not yet been successfully applied.  Hopefully, by encouraging
experts in such applications to lay out their problems, we will
foster long-term collaborations leading to significant advances in
those fields.

The workshop follows the SIAM Optimization meeting because
global optimization is a major concern of both the optimization
and the validated computing communities.  By holding the meetings
consecutively, we encourage validated computing researchers to
become more involved in the wider optimization community, and
we encourage people more interested in standard techniques of
optimization to participate in interval discussions.

We will have one special session and a conference banquet to honor
Ray Moore.  His 1966 book defined the field, he pioneered many
applications, and he continues to contribute insights and papers.
Most of the ideas in our interval algorithms of today directly
trace their ancestry to Ray's 1966 and 1979 (from SIAM) books.

In parallel with the traditional scientific program following SIAM's
usual pattern of highlighted and contributed papers, we are considering
half-day detailed workshops.  Tentative topics include:

1.  Jiri Rohn on complexity.  This would follow up on his talk at SCAN
2000 in Karlsruhe "Finite Characterization of Some Linear Problems with
Inexact Data."

2.  Tutorial on validated techniques, interval arithmetic, and related
tools.  We would start at the beginning by defining directed rounding,
and progress to a "Numerical Recipes" level view of several widely used
algorithms, e.g., linear systems, interval Newton, global optimization,
ordinary and partial differential equations.

3.  Hands-on tools and demonstrations.


Program Committee
-----------------

R. Baker Kearfott
   University of Louisiana at Lafayette
   rbk [at] louisiana [dot] edu
Vladik Kreinovich
   University of Texas at El Paso
   vladik [at] cs [dot] utep.edu
George Corliss
   Marquette University
   George.Corliss [at] Marquette [dot] edu
Weldon Lodwick
   University of Colorado at Denver
   wlodwick [at] carbon [dot] cudenver.edu
Ken Jackson
   University of Toronto
   krj [at] cs [dot] toronto.edu
Bill Walster
   Sun Microsystems
   Bill.Walster [at] eng [dot] sun.com


---------------------------------------------------------------
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] louisiana.edu Fri Oct  5 17:25:24 2001
Received: (from root@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f95MPOI01538
	for reliable_computing-outgoing; Fri, 5 Oct 2001 17:25:24 -0500 (CDT)
Received: from imf02bis.bellsouth.net (mail002.mail.bellsouth.net [205.152.58.22])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f95MPKd01533
	for <reliable_computing [at] interval [dot] ull.edu>; Fri, 5 Oct 2001 17:25:20 -0500 (CDT)
Received: from u8174 ([66.20.82.62]) by imf02bis.bellsouth.net
          (InterMail vM.5.01.01.01 201-252-104) with SMTP
          id <20011005222616.OFDO17685.imf02bis.bellsouth.net@u8174>
          for <reliable_computing [at] interval [dot] ull.edu>;
          Fri, 5 Oct 2001 18:26:16 -0400
Message-Id: <2.2.32.20011005222425.0396cf7c [at] 130 [dot] 70.132.231>
X-Sender: rbk5287 [at] 130 [dot] 70.132.231
X-Mailer: Windows Eudora Pro Version 2.2 (32)
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Date: Fri, 05 Oct 2001 17:24:25 -0500
To: reliable_computing [at] interval [dot] ull.edu
From: "R. Baker Kearfott" <rbk [at] louisiana [dot] edu>
Subject: Validated Computing 2002: Deadline extended
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

Date: Fri, 05 Oct 2001 16:04:38 -0500
To: reliable_computing [at] interval [dot] louisiana.edu
From: "R. Baker Kearfott" <rbk [at] louisiana [dot] edu>
Subject: Validated Computing 2002: Deadline extended

Colleague,

>We have extended the deadline for submission of abstracts to be
considered for highlighted talks from October 5 to November 1.
This makes the deadline consistent with the deadline for contributions
to the SIAM Conference on Optimization, immediately preceeding
Validated Computing 2002.

There seems to have been some confusion about highlighted talks.
These are 40-minute talks, rather than the usual 30 minutes; they
are a way for the organizers to honor abstracts judged to be
particularly worthy.

Also note that, in spite of the fact that Validated Computing 2002
follows the SIAM Conference on Optimization, topics are not limited
to optimization.

In any case, we hope to have as many contributions as possible
early, and we encourage everyone to submit a contribution by 
October 30, if possible.

I have appended a copy of the call for papers.  You can also 
browse this information, with links, at

http://interval.louisiana.edu/conferences/Validated_computing_2002/html_notice.hml
Sincerely,

R. Baker Kearfott
===================================================================================

Validated Computing 2002
SIAM Workshop
Toronto, Canada, May 23-25, 2002

(including a special session honoring Ray Moore)

Immediately following the Seventh SIAM Conference on
Optimization (May 20-23, 2002)
(see http://www.siam.org/meetings/op02/index.htm)

To be followed by a Fields Institute working group on
optimization

Call for Papers
---------------

We invite submission of papers dealing with validated computing.
Areas of interest include, but are not limited to, interval
arithmetic and analysis, use of mathematical theory to assure
reliable scientific computation, and fuzzy logic.
We are especially interested in applications of these techniques
and in tools that support the techniques.

Submit an extended abstract of 2-3 pages to R. Baker Kearfott
at rbk [at] louisiana [dot] edu by October 5.  Submissions
must be in Latex using ONLY the standard article style.  Use
psfig.sty if you include figures.


The Program Committee will review the submissions contributed.
Most papers will be presented as 30 minute talks.  Depending
on the number of submissions, 8-12 talks will be selected for
40 minute highlighted talks.  A few talks may be selected for
other special sessions.

We invite proposals for minisymposia of 4-5 speakers
coordinated to focus on a particular topic. Minisymposia
proposals should include the extended abstracts of each speaker
AND a one paragraph abstract for the session. Submit
minisymposia proposals to R. Baker Kearfott at rbk [at] louisiana [dot] edu
by October 5.Minisymposia will have the same visibility and
length of talks as the contributed paper sessions.

The Program Committee will attempt to arrange contributed papers
into coherent sessions.  The advantage of a minisymposium is that
the minisymposium organizer and speakers are encouraged to
communicate and coordinate their presentations to increase impact,
use a common notation, and reduce duplications.

Deadlines
---------

October   5   Minisymposia proposals including extended abstracts
              of each speaker AND a one paragraph abstract for the
              session.
November  1   Extended 2-3 page abstracts to be considered for
              highlighted talks
November 30   Notification of accepted talks, and talks
              selected for highlighting
January  15   Extended 2-3 page abstracts for LATE submissions, which
              will be considered only as contributed talks
February 15   Notification of accepted talks
March 1 (tentative)  End of early registration
April 1 (tentative)  Hotel reservations
May 23-25     Workshop itself

Speakers who have already accepted invitations
----------------------------------------------

Goetz Alefeld
Bill Walster
Annie Cuyt
William Edmonson
Andreas Griewank
Eldon Hansen
Kaj Madsen
Arnold Neumaier
Linda Petzold
Louis Rall
Mark Stadtherr
Bill Walster

Special informal week
---------------------

Participants in the workshop are invited to participate in a week
of informal discussions at the Fields Institute at the University
of Toronto, immediately following the workshop. This week is part
of the Fields Institute's special thematic year on computational
challenges in science and engineering.  Depending on
numbers, the Fields Institute can provide office space and
meeting areas for this activity. For general information on
the Fields Institute and the thematic year, see

 http://www.fields.utoronto.ca/programs/scientific/01-02/numerical/)

Persons interested in this week at the Fields Institute should
contact R. Baker Kearfott (rbk [at] louisiana [dot] edu) or
or Tibor Csendes (csendes [at] inf [dot] u-szeged.hu)
before October 5, 2001. You may express your interest when you submit
your abstract.

Web page:
--------

A web-page with this and other information is available at
http://interval.louisiana.edu/conferences/Validated_computing_2002/html_notice.html.

Description and rationale
-------------------------

Reliable computing is essential. There is no feasible alternative.
Modern societies rely more and more on computer systems. Usually, our
systems appear to work successfully, but there are sometimes serious,
and often minor, errors. Ever increasing reliance on computer systems
brings ever increasing need for reliability.

Validated computing is one essential technology to achieve increased
software reliability. Validated computing uses controlled rounding of
computer arithmetic to guarantee that hypotheses of suitable
mathematical theorems are (or are not) satisfied. Mathematical rigor
in the computer arithmetic, in algorithm design, and in program
execution allow us to guarantee that the stated problem has (or does
not have) a solution in an enclosing interval we compute. If the
enclosure is narrow, we are certain that we know the answer reliably
and accurately. If the enclosing interval is wide, we have a clear
warning that our uncertainty is large, and a closer study is demanded.

Intervals capture uncertainly in modeling and problem formulation, in
model parameter estimation, in algorithm truncation, in operation
round off, and in model interpretation.

The techniques of validated computing have proven their merits
in many scientific and engineering applications. They help
answer questions from, "How much irrigation water does a desert
golf course return effectively unused to its bordering stream?"
to "Will a near earth asteroid hit the earth, possibly ending
life as we know it?".

The techniques of validated computing rest on solid and interesting
theoretical studies in mathematics and computer science.
Contributions from fields including real, complex and functional
analysis, semigroups, probability, statistics, fuzzy logic, automatic
differentiation, computer hardware, operating systems, compiler
construction, parallel processing, and software engineering are all
essential.

The major emphasis of the program is on applications. We will hear
from many people who have used tools from validated computing to
attack, and often solve, significant practical problems.
Successful applications have included medical diagnosis and
treatment, financial simulation, mechanical design, oil reservoir
simulation, aeronautics, high energy particle accelerators,
environmental engineering, chemical process simulation and control,
computer graphics for motion picture special effects, astrophysics,
and many more.

Not all applications are as yet successful.  We will also hear from
people with challenging applications to which validated techniques
have not yet been successfully applied.  Hopefully, by encouraging
experts in such applications to lay out their problems, we will
foster long-term collaborations leading to significant advances in
those fields.

The workshop follows the SIAM Optimization meeting because
global optimization is a major concern of both the optimization
and the validated computing communities.  By holding the meetings
consecutively, we encourage validated computing researchers to
become more involved in the wider optimization community, and
we encourage people more interested in standard techniques of
optimization to participate in interval discussions.

We will have one special session and a conference banquet to honor
Ray Moore.  His 1966 book defined the field, he pioneered many
applications, and he continues to contribute insights and papers.
Most of the ideas in our interval algorithms of today directly
trace their ancestry to Ray's 1966 and 1979 (from SIAM) books.

In parallel with the traditional scientific program following SIAM's
usual pattern of highlighted and contributed papers, we are considering
half-day detailed workshops.  Tentative topics include:

1.  Jiri Rohn on complexity.  This would follow up on his talk at SCAN
2000 in Karlsruhe "Finite Characterization of Some Linear Problems with
Inexact Data."

2.  Tutorial on validated techniques, interval arithmetic, and related
tools.  We would start at the beginning by defining directed rounding,
and progress to a "Numerical Recipes" level view of several widely used
algorithms, e.g., linear systems, interval Newton, global optimization,
ordinary and partial differential equations.

3.  Hands-on tools and demonstrations.


Program Committee
-----------------

R. Baker Kearfott
   University of Louisiana at Lafayette
   rbk [at] louisiana [dot] edu
Vladik Kreinovich
   University of Texas at El Paso
   vladik [at] cs [dot] utep.edu
George Corliss
   Marquette University
   George.Corliss [at] Marquette [dot] edu
Weldon Lodwick
   University of Colorado at Denver
   wlodwick [at] carbon [dot] cudenver.edu
Ken Jackson
   University of Toronto
   krj [at] cs [dot] toronto.edu
Bill Walster
   Sun Microsystems
   Bill.Walster [at] eng [dot] sun.com


---------------------------------------------------------------
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] louisiana.edu Fri Oct  5 17:27:30 2001
Received: (from root@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f95MPOI01538
	for reliable_computing-outgoing; Fri, 5 Oct 2001 17:25:24 -0500 (CDT)
Received: from imf02bis.bellsouth.net (mail002.mail.bellsouth.net [205.152.58.22])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f95MPKd01533
	for <reliable_computing [at] interval [dot] ull.edu>; Fri, 5 Oct 2001 17:25:20 -0500 (CDT)
Received: from u8174 ([66.20.82.62]) by imf02bis.bellsouth.net
          (InterMail vM.5.01.01.01 201-252-104) with SMTP
          id <20011005222616.OFDO17685.imf02bis.bellsouth.net@u8174>
          for <reliable_computing [at] interval [dot] ull.edu>;
          Fri, 5 Oct 2001 18:26:16 -0400
Message-Id: <2.2.32.20011005222425.0396cf7c [at] 130 [dot] 70.132.231>
X-Sender: rbk5287 [at] 130 [dot] 70.132.231
X-Mailer: Windows Eudora Pro Version 2.2 (32)
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Date: Fri, 05 Oct 2001 17:24:25 -0500
To: reliable_computing [at] interval [dot] ull.edu
From: "R. Baker Kearfott" <rbk [at] louisiana [dot] edu>
Subject: Validated Computing 2002: Deadline extended
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

Date: Fri, 05 Oct 2001 16:04:38 -0500
To: reliable_computing [at] interval [dot] louisiana.edu
From: "R. Baker Kearfott" <rbk [at] louisiana [dot] edu>
Subject: Validated Computing 2002: Deadline extended

Colleague,

>We have extended the deadline for submission of abstracts to be
considered for highlighted talks from October 5 to November 1.
This makes the deadline consistent with the deadline for contributions
to the SIAM Conference on Optimization, immediately preceeding
Validated Computing 2002.

There seems to have been some confusion about highlighted talks.
These are 40-minute talks, rather than the usual 30 minutes; they
are a way for the organizers to honor abstracts judged to be
particularly worthy.

Also note that, in spite of the fact that Validated Computing 2002
follows the SIAM Conference on Optimization, topics are not limited
to optimization.

In any case, we hope to have as many contributions as possible
early, and we encourage everyone to submit a contribution by 
October 30, if possible.

I have appended a copy of the call for papers.  You can also 
browse this information, with links, at

http://interval.louisiana.edu/conferences/Validated_computing_2002/html_notice.hml
Sincerely,

R. Baker Kearfott
===================================================================================

Validated Computing 2002
SIAM Workshop
Toronto, Canada, May 23-25, 2002

(including a special session honoring Ray Moore)

Immediately following the Seventh SIAM Conference on
Optimization (May 20-23, 2002)
(see http://www.siam.org/meetings/op02/index.htm)

To be followed by a Fields Institute working group on
optimization

Call for Papers
---------------

We invite submission of papers dealing with validated computing.
Areas of interest include, but are not limited to, interval
arithmetic and analysis, use of mathematical theory to assure
reliable scientific computation, and fuzzy logic.
We are especially interested in applications of these techniques
and in tools that support the techniques.

Submit an extended abstract of 2-3 pages to R. Baker Kearfott
at rbk [at] louisiana [dot] edu by October 5.  Submissions
must be in Latex using ONLY the standard article style.  Use
psfig.sty if you include figures.


The Program Committee will review the submissions contributed.
Most papers will be presented as 30 minute talks.  Depending
on the number of submissions, 8-12 talks will be selected for
40 minute highlighted talks.  A few talks may be selected for
other special sessions.

We invite proposals for minisymposia of 4-5 speakers
coordinated to focus on a particular topic. Minisymposia
proposals should include the extended abstracts of each speaker
AND a one paragraph abstract for the session. Submit
minisymposia proposals to R. Baker Kearfott at rbk [at] louisiana [dot] edu
by October 5.Minisymposia will have the same visibility and
length of talks as the contributed paper sessions.

The Program Committee will attempt to arrange contributed papers
into coherent sessions.  The advantage of a minisymposium is that
the minisymposium organizer and speakers are encouraged to
communicate and coordinate their presentations to increase impact,
use a common notation, and reduce duplications.

Deadlines
---------

October   5   Minisymposia proposals including extended abstracts
              of each speaker AND a one paragraph abstract for the
              session.
November  1   Extended 2-3 page abstracts to be considered for
              highlighted talks
November 30   Notification of accepted talks, and talks
              selected for highlighting
January  15   Extended 2-3 page abstracts for LATE submissions, which
              will be considered only as contributed talks
February 15   Notification of accepted talks
March 1 (tentative)  End of early registration
April 1 (tentative)  Hotel reservations
May 23-25     Workshop itself

Speakers who have already accepted invitations
----------------------------------------------

Goetz Alefeld
Bill Walster
Annie Cuyt
William Edmonson
Andreas Griewank
Eldon Hansen
Kaj Madsen
Arnold Neumaier
Linda Petzold
Louis Rall
Mark Stadtherr
Bill Walster

Special informal week
---------------------

Participants in the workshop are invited to participate in a week
of informal discussions at the Fields Institute at the University
of Toronto, immediately following the workshop. This week is part
of the Fields Institute's special thematic year on computational
challenges in science and engineering.  Depending on
numbers, the Fields Institute can provide office space and
meeting areas for this activity. For general information on
the Fields Institute and the thematic year, see

 http://www.fields.utoronto.ca/programs/scientific/01-02/numerical/)

Persons interested in this week at the Fields Institute should
contact R. Baker Kearfott (rbk [at] louisiana [dot] edu) or
or Tibor Csendes (csendes [at] inf [dot] u-szeged.hu)
before October 5, 2001. You may express your interest when you submit
your abstract.

Web page:
--------

A web-page with this and other information is available at
http://interval.louisiana.edu/conferences/Validated_computing_2002/html_notice.html.

Description and rationale
-------------------------

Reliable computing is essential. There is no feasible alternative.
Modern societies rely more and more on computer systems. Usually, our
systems appear to work successfully, but there are sometimes serious,
and often minor, errors. Ever increasing reliance on computer systems
brings ever increasing need for reliability.

Validated computing is one essential technology to achieve increased
software reliability. Validated computing uses controlled rounding of
computer arithmetic to guarantee that hypotheses of suitable
mathematical theorems are (or are not) satisfied. Mathematical rigor
in the computer arithmetic, in algorithm design, and in program
execution allow us to guarantee that the stated problem has (or does
not have) a solution in an enclosing interval we compute. If the
enclosure is narrow, we are certain that we know the answer reliably
and accurately. If the enclosing interval is wide, we have a clear
warning that our uncertainty is large, and a closer study is demanded.

Intervals capture uncertainly in modeling and problem formulation, in
model parameter estimation, in algorithm truncation, in operation
round off, and in model interpretation.

The techniques of validated computing have proven their merits
in many scientific and engineering applications. They help
answer questions from, "How much irrigation water does a desert
golf course return effectively unused to its bordering stream?"
to "Will a near earth asteroid hit the earth, possibly ending
life as we know it?".

The techniques of validated computing rest on solid and interesting
theoretical studies in mathematics and computer science.
Contributions from fields including real, complex and functional
analysis, semigroups, probability, statistics, fuzzy logic, automatic
differentiation, computer hardware, operating systems, compiler
construction, parallel processing, and software engineering are all
essential.

The major emphasis of the program is on applications. We will hear
from many people who have used tools from validated computing to
attack, and often solve, significant practical problems.
Successful applications have included medical diagnosis and
treatment, financial simulation, mechanical design, oil reservoir
simulation, aeronautics, high energy particle accelerators,
environmental engineering, chemical process simulation and control,
computer graphics for motion picture special effects, astrophysics,
and many more.

Not all applications are as yet successful.  We will also hear from
people with challenging applications to which validated techniques
have not yet been successfully applied.  Hopefully, by encouraging
experts in such applications to lay out their problems, we will
foster long-term collaborations leading to significant advances in
those fields.

The workshop follows the SIAM Optimization meeting because
global optimization is a major concern of both the optimization
and the validated computing communities.  By holding the meetings
consecutively, we encourage validated computing researchers to
become more involved in the wider optimization community, and
we encourage people more interested in standard techniques of
optimization to participate in interval discussions.

We will have one special session and a conference banquet to honor
Ray Moore.  His 1966 book defined the field, he pioneered many
applications, and he continues to contribute insights and papers.
Most of the ideas in our interval algorithms of today directly
trace their ancestry to Ray's 1966 and 1979 (from SIAM) books.

In parallel with the traditional scientific program following SIAM's
usual pattern of highlighted and contributed papers, we are considering
half-day detailed workshops.  Tentative topics include:

1.  Jiri Rohn on complexity.  This would follow up on his talk at SCAN
2000 in Karlsruhe "Finite Characterization of Some Linear Problems with
Inexact Data."

2.  Tutorial on validated techniques, interval arithmetic, and related
tools.  We would start at the beginning by defining directed rounding,
and progress to a "Numerical Recipes" level view of several widely used
algorithms, e.g., linear systems, interval Newton, global optimization,
ordinary and partial differential equations.

3.  Hands-on tools and demonstrations.


Program Committee
-----------------

R. Baker Kearfott
   University of Louisiana at Lafayette
   rbk [at] louisiana [dot] edu
Vladik Kreinovich
   University of Texas at El Paso
   vladik [at] cs [dot] utep.edu
George Corliss
   Marquette University
   George.Corliss [at] Marquette [dot] edu
Weldon Lodwick
   University of Colorado at Denver
   wlodwick [at] carbon [dot] cudenver.edu
Ken Jackson
   University of Toronto
   krj [at] cs [dot] toronto.edu
Bill Walster
   Sun Microsystems
   Bill.Walster [at] eng [dot] sun.com


---------------------------------------------------------------
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] louisiana.edu Sun Oct  7 10:19:23 2001
Received: (from root@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f97FJM000510
	for reliable_computing-outgoing; Sun, 7 Oct 2001 10:19:22 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f97FJG700505
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 7 Oct 2001 10:19:17 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.11.3/8.11.3) with SMTP id f97FJD918774;
	Sun, 7 Oct 2001 09:19:14 -0600 (MDT)
Message-Id: <200110071519.f97FJD918774 [at] cs [dot] utep.edu>
Date: Sun, 7 Oct 2001 09:19:13 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: ICMS-2002
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: /pJtIQwMRw3F5zt+QMo2Lw==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

Dear Friends, 

This is FYI. 

This should be of interest to our community because 
in the very first lines of the CFP, the oragnizing committee mentions proving 
theorems (i.e., providing guaranteed results) by using mathematical software - 
something that validated computing and interval computations have been doing 
for quite some time. 

Vladik

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

Date: Sun, 7 Oct 2001 16:57:51 +0800
From: icms <icms [at] mmrc [dot] iss.ac.cn>
To: vladik [at] cs [dot] utep.edu
Subject: ICMS-2002


We apologize if you receive this message more than onces.
============================================================
== International Congress of Mathematical Software, 2002  ==
==                Call For Papers                         ==
============================================================
A Satellite Conference of ICM 2002
Beijing,  China
August 17 - 19, 2002 

Webpage:
   http://www.mathsoftware.org
mirror sites: 
   http://www.mmrc.iss.ac.cn/~icms
   http://www.math.kobe-u.ac.jp/icms

The appearance of mathematical software is one of the most important
events in mathematics.  Mathematical software systems are used to
construct examples, to prove theorems, and to find new mathematical
phenomena.  On the other hand, mathematical research often motivates
developments of new algorithms and new systems.

Mathematical software systems rely on a cooperation of mathematicians,
designers of algorithms, and mathematical programmers. Main audiences
are software developers in mathematics and programming mathematicians,
but we also intend to provide an opportunity to discuss about these
topics with mathematicians. Topics for the conference include but are
not limited to:

(A) Software engineering problems for mathematical software
    (A1) Designs of programming languages for mathematics 
    (A2) Data structures for mathematics
    (A3) Standards to allow cooperation
    (A4) Review of internal structures of systems  
    (A5) Optimization techniques in real implementations
(B) Mathematics and media (including user interfaces)
(C) Mathematics related to mathematical software (experiments, algorithms)
(D) Optimization techniques in high performance computing
(E) Applications of mathematical software  
(F) Presentation of mathematical software
(G) Poster demonstration for ICM participants.

Invited Speakers:
 We are now inviting the following person as as plenary speakers.  
   Jonathan Borwein (confirmed)
   John Cannon
   Henri Cohen  (confirmed)
   Richard Constable
   Gunter Ziegler
   Steve Wolfram

Submitting papers: 
 We have organized sessions and general sessions of contributed papers.
 You can choose either an organized session or the general session for
 your submission.  All papers will be refereed by the program
 committee.  We have the following organized sessions.

 Arjeh Cohen      "OpenMath, mathematics on Web" 
 Komei Fukuda     "Optimization, geometric and combinatorial computation" 
 Xiao-Shan Gao    "Software for differential equations"
 Zhuojun Liu       TBA 
 Michael Pohst    "Number theory" 
 Mike Stillman    "Computational Algebraic Geometry" 
 Nobuki Takayama  "Algebraic Analysis" 
 Dongming Wang    "Geometry Software" or "Software for Polynomial Algebra" 

 All submissions should be sent to 

  Nobuki Takayama,   
  Department of Mathematics,   
  Kobe University, 
  Rokko, Kobe, 657-8501, Japan
  Email:    takayama [at] math [dot] kobe-u.ac.jp

 We electronically accept papers in LaTeX2e format with the style 

  \documentclass[10pt]{article}.  

 PS figures should be included by 

   \usepackage{epsfig}.

 PS figures should be archived by the ``tar'' command.
 If you are using other format, we will accept your submission by
 a harcopy for refereeing, but the final camera-ready version should be 
 sent by LaTeX format with publisher's macro.

 We will accept not only research papers, but also excellent
 expositions.  The page limit is 10 pages by the LaTeX article format.

 If you want to give your lecture in an organized session, please
 do not forget to mention the name of the orpganized session.

Proceedings: 
 The proceedings will be published by World Scientific Pub.

Key dates:
  Submission deadline:  	January 30, 2002  
  Notification of acceptance:  	March 31, 2002  
  Camera-ready copy due:  	May 15, 2002  
  Conference will be held:  	August 17 - 19, 2002  
  ICM 2002 starts at:  		August 20, 2002  

Conference Organization:
 General advisory board
   David Eisenbud,  (MSRI,  USA) 
   Bernd Sturmfels, (UCB,   USA)
 Program Committee co-chairs
   A.Cohen, X.Gao and N.Takayama 
 Program committee Members
   Johannes Buchmann, (Darmstadt,  Germany) 
   Arjeh M. Cohen,    (Eindhoven,  Netherland)  
   Jack Dongarra,     (Tennessee,  USA) 
   Komei Fukuda,      (ETH,  Switzerland) 
   Xiao-Shan  Gao,    (Chinese Academy of Sciences, China) 
   Steve Linton,      (St.Andrews, England) 
   Micheal Pohst,     (TU-berlin, Germany) 
   Mike Stillman,     (Cornell,    USA) 
   Nobuki Takayama,   (Kobe,      Japan) 
   Dongming Wang,     (Paris 6,   France) 
   K.Yokoyama,        (Kyushu,    Japan) 
   Ya-Xiang Yuan,     (Chinese Academy of Sciences, China) 
 Poster session chair
   M.Noro,        (Kobe,  Japan) 
 Organization co-chairs
   Zhuojun Liu        (Chinese Academy of Sciences, China) 
   Nobuki Takayama,   (Kobe,      Japan) 
 Organization committee 
   Arjeh Cohen     	(Eindhoven, Netherland) 
   Lian LI         	(Lanzhou, China) 
   Ken Nakamula    	(Tokyo, Japan) 
   Nobuki Takayama  	(Kobe,  Japan) 
   Dingkang WANG 	(Beijing, China) 
   Lu YANG 		(Chengdu, China) 

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



From owner-reliable_computing [at] interval [dot] louisiana.edu Sun Oct  7 10:47:26 2001
Received: (from root@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f97FlQ900662
	for reliable_computing-outgoing; Sun, 7 Oct 2001 10:47:26 -0500 (CDT)
Received: from clmboh1-smtp3.columbus.rr.com (clmboh1-smtp3.columbus.rr.com [65.24.0.112])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f97FlL700657
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 7 Oct 2001 10:47:21 -0500 (CDT)
Received: from oemcomputer (dhcp065-024-174-102.columbus.rr.com [65.24.174.102])
	by clmboh1-smtp3.columbus.rr.com (8.11.2/8.11.2) with SMTP id f97FhAR22792;
	Sun, 7 Oct 2001 11:43:11 -0400 (EDT)
Message-ID: <001a01c14f46$f3192160$66ae1841 [at] columbus [dot] rr.com>
From: "Ramon Moore" <rmoore17 [at] columbus [dot] rr.com>
To: "Vladik Kreinovich" <vladik [at] cs [dot] utep.edu>
Cc: <reliable_computing [at] interval [dot] louisiana.edu>, <interval [at] cs [dot] utep.edu>
References: <200110071519.f97FJD918774 [at] cs [dot] utep.edu>
Subject: Re: ICMS-2002
Date: Sun, 7 Oct 2001 11:43:55 -0400
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.50.4133.2400
X-MimeOLE: Produced By Microsoft MimeOLE V5.50.4133.2400
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

Dear Vladik,

Thanks for bringing this to the attention of the interval community. As you
say, "proving
 theorems (i.e., providing guaranteed results) by using mathematical
software -
something that validated computing and interval computations have been doing
for quite some time", and yet we do not see any of our people listed among
the invited speakers nor among the organizing committee. Evidently our
methods and results are still not very visible in the wider mathematical
community. Only by participating in such conferences and publishing in
mathematics journals will that ever happen.

best regards,  Ramon Moore



> This should be of interest to our community because
> in the very first lines of the CFP, the oragnizing committee mentions
proving
> theorems (i.e., providing guaranteed results) by using mathematical
software -
> something that validated computing and interval computations have been
doing
> for quite some time.
>
> Vladik
>
> ------------- Begin Forwarded Message -------------
>
> Date: Sun, 7 Oct 2001 16:57:51 +0800
> From: icms <icms [at] mmrc [dot] iss.ac.cn>
> To: vladik [at] cs [dot] utep.edu
> Subject: ICMS-2002
>
>
> We apologize if you receive this message more than onces.
> ============================================================
> == International Congress of Mathematical Software, 2002  ==
> ==                Call For Papers                         ==
> ============================================================
> A Satellite Conference of ICM 2002
> Beijing,  China
> August 17 - 19, 2002
>
> Webpage:
>    http://www.mathsoftware.org
> mirror sites:
>    http://www.mmrc.iss.ac.cn/~icms
>    http://www.math.kobe-u.ac.jp/icms
>
> The appearance of mathematical software is one of the most important
> events in mathematics.  Mathematical software systems are used to
> construct examples, to prove theorems, and to find new mathematical
> phenomena.  On the other hand, mathematical research often motivates
> developments of new algorithms and new systems.
>
> Mathematical software systems rely on a cooperation of mathematicians,
> designers of algorithms, and mathematical programmers. Main audiences
> are software developers in mathematics and programming mathematicians,
> but we also intend to provide an opportunity to discuss about these
> topics with mathematicians. Topics for the conference include but are
> not limited to:
>
> (A) Software engineering problems for mathematical software
>     (A1) Designs of programming languages for mathematics
>     (A2) Data structures for mathematics
>     (A3) Standards to allow cooperation
>     (A4) Review of internal structures of systems
>     (A5) Optimization techniques in real implementations
> (B) Mathematics and media (including user interfaces)
> (C) Mathematics related to mathematical software (experiments, algorithms)
> (D) Optimization techniques in high performance computing
> (E) Applications of mathematical software
> (F) Presentation of mathematical software
> (G) Poster demonstration for ICM participants.
>
> Invited Speakers:
>  We are now inviting the following person as as plenary speakers.
>    Jonathan Borwein (confirmed)
>    John Cannon
>    Henri Cohen  (confirmed)
>    Richard Constable
>    Gunter Ziegler
>    Steve Wolfram
>
> Submitting papers:
>  We have organized sessions and general sessions of contributed papers.
>  You can choose either an organized session or the general session for
>  your submission.  All papers will be refereed by the program
>  committee.  We have the following organized sessions.
>
>  Arjeh Cohen      "OpenMath, mathematics on Web"
>  Komei Fukuda     "Optimization, geometric and combinatorial computation"
>  Xiao-Shan Gao    "Software for differential equations"
>  Zhuojun Liu       TBA
>  Michael Pohst    "Number theory"
>  Mike Stillman    "Computational Algebraic Geometry"
>  Nobuki Takayama  "Algebraic Analysis"
>  Dongming Wang    "Geometry Software" or "Software for Polynomial Algebra"
>
>  All submissions should be sent to
>
>   Nobuki Takayama,
>   Department of Mathematics,
>   Kobe University,
>   Rokko, Kobe, 657-8501, Japan
>   Email:    takayama [at] math [dot] kobe-u.ac.jp
>
>  We electronically accept papers in LaTeX2e format with the style
>
>   \documentclass[10pt]{article}.
>
>  PS figures should be included by
>
>    \usepackage{epsfig}.
>
>  PS figures should be archived by the ``tar'' command.
>  If you are using other format, we will accept your submission by
>  a harcopy for refereeing, but the final camera-ready version should be
>  sent by LaTeX format with publisher's macro.
>
>  We will accept not only research papers, but also excellent
>  expositions.  The page limit is 10 pages by the LaTeX article format.
>
>  If you want to give your lecture in an organized session, please
>  do not forget to mention the name of the orpganized session.
>
> Proceedings:
>  The proceedings will be published by World Scientific Pub.
>
> Key dates:
>   Submission deadline:  January 30, 2002
>   Notification of acceptance:  March 31, 2002
>   Camera-ready copy due:  May 15, 2002
>   Conference will be held:  August 17 - 19, 2002
>   ICM 2002 starts at:  August 20, 2002
>
> Conference Organization:
>  General advisory board
>    David Eisenbud,  (MSRI,  USA)
>    Bernd Sturmfels, (UCB,   USA)
>  Program Committee co-chairs
>    A.Cohen, X.Gao and N.Takayama
>  Program committee Members
>    Johannes Buchmann, (Darmstadt,  Germany)
>    Arjeh M. Cohen,    (Eindhoven,  Netherland)
>    Jack Dongarra,     (Tennessee,  USA)
>    Komei Fukuda,      (ETH,  Switzerland)
>    Xiao-Shan  Gao,    (Chinese Academy of Sciences, China)
>    Steve Linton,      (St.Andrews, England)
>    Micheal Pohst,     (TU-berlin, Germany)
>    Mike Stillman,     (Cornell,    USA)
>    Nobuki Takayama,   (Kobe,      Japan)
>    Dongming Wang,     (Paris 6,   France)
>    K.Yokoyama,        (Kyushu,    Japan)
>    Ya-Xiang Yuan,     (Chinese Academy of Sciences, China)
>  Poster session chair
>    M.Noro,        (Kobe,  Japan)
>  Organization co-chairs
>    Zhuojun Liu        (Chinese Academy of Sciences, China)
>    Nobuki Takayama,   (Kobe,      Japan)
>  Organization committee
>    Arjeh Cohen     (Eindhoven, Netherland)
>    Lian LI         (Lanzhou, China)
>    Ken Nakamula    (Tokyo, Japan)
>    Nobuki Takayama  (Kobe,  Japan)
>    Dingkang WANG (Beijing, China)
>    Lu YANG (Chengdu, China)
>
> ------------- End Forwarded Message -------------
>
>
>


From owner-reliable_computing [at] interval [dot] louisiana.edu Wed Oct 10 08:30:59 2001
Received: (from root@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f9ADUxC04198
	for reliable_computing-outgoing; Wed, 10 Oct 2001 08:30:59 -0500 (CDT)
Received: from clmboh1-smtp3.columbus.rr.com (clmboh1-smtp3.columbus.rr.com [65.24.0.112])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f9ADUrA04193
	for <reliable_computing [at] interval [dot] louisiana.edu>; Wed, 10 Oct 2001 08:30:53 -0500 (CDT)
Received: from oemcomputer (dhcp065-024-174-102.columbus.rr.com [65.24.174.102])
	by clmboh1-smtp3.columbus.rr.com (8.11.2/8.11.2) with SMTP id f9ADQl617180
	for <reliable_computing [at] interval [dot] louisiana.edu>; Wed, 10 Oct 2001 09:26:47 -0400 (EDT)
Message-ID: <007701c1518f$631b6f00$66ae1841 [at] columbus [dot] rr.com>
From: "Ramon Moore" <rmoore17 [at] columbus [dot] rr.com>
To: <reliable_computing [at] interval [dot] louisiana.edu>
Subject: challenges for interval researchers
Date: Wed, 10 Oct 2001 09:27:58 -0400
MIME-Version: 1.0
Content-Type: multipart/alternative;
	boundary="----=_NextPart_000_0074_01C1516D.D9520200"
X-Priority: 3
X-MSMail-Priority: Normal
X-Mailer: Microsoft Outlook Express 5.50.4133.2400
X-MimeOLE: Produced By Microsoft MimeOLE V5.50.4133.2400
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

This is a multi-part message in MIME format.

------=_NextPart_000_0074_01C1516D.D9520200
Content-Type: text/plain;
	charset="iso-8859-1"
Content-Transfer-Encoding: quoted-printable

I have received the following list of interesting and worthwhile =
challenges for the interval community, from Professor Rafael de la Llave =
at UTexas.

I pass them along here, hoping that some of you might pick up on one or =
another of them. For further details, you might contact=20
Rafael de la Llave
E-mail Address(es):
  llave [at] mail [dot] ma.utexas.edu

--------------------------------
One possibility would be to think hard about how to represent the data=20
that people who solve functional equations use. =20

For example, the renormalization theory abounds with those. Many of
which have been left on shaky ground since they were only=20
done numerically and the numerics is sometimes suspect.=20
The current implementations of these things could be=20
certainly improved.


In harmonic analysis, there are several "maximal operators" which=20
would be useful to bound accurately. (Once you get good bounds on=20
those, you can start applying contraction arguments)

In dynamical systems, one often is interested in knowing whether=20
some concrete features are present in the system and to obtain=20
quantitative estimates of them (e.g. intersection of manifolds that=20
determine capture etc.)=20

Another problem that I  would like  a lot to see=20
solved  is the implementation  of the Ziglin criterion=20
(or Morales-Ramis-Simo) that just looking at properties of
a periodic orbit can conclude that the system is not integrable.

Recently, there are many results estimating Lyapunov exponents of=20
certain dynamical systems. Some particularly important examples=20
are those dynamical systems that appear in number theory.=20
Just the existence of those Lyapunov exponents, implies
that certain continued fraction algorithms work.

I point out to some recent success stories which I would like to=20
see repeated: The proof of the double bubble conjecture and=20
the proof of the existence of the Lorenz attractor=20
(the later is more exemplary since there was a serious cooperation=20
between the mathematician and the people who implemented the package=20
that was used)=20

-------------------
best regards to all,

Ramon Moore



------=_NextPart_000_0074_01C1516D.D9520200
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 http-equiv=3DContent-Type content=3D"text/html; =
charset=3Diso-8859-1">
<META content=3D"MSHTML 5.50.4134.600" name=3DGENERATOR>
<STYLE></STYLE>
</HEAD>
<BODY bgColor=3D#ffffff>
<DIV><FONT face=3DArial>I have received the following list of =
interesting and=20
worthwhile challenges for the interval community, from Professor Rafael =
de la=20
Llave at UTexas.</FONT></DIV>
<DIV><FONT face=3DArial></FONT>&nbsp;</DIV>
<DIV><FONT face=3DArial>I pass them along here, hoping that some of you =
might pick=20
up on one or another of them. For further details, you might contact=20
</FONT></DIV>
<DIV><FONT face=3DArial>Rafael de la Llave<BR>E-mail =
Address(es):<BR>&nbsp; <A=20
href=3D"mailto:llave [at] mail [dot] ma.utexas.edu">llave [at] mail [dot] ma.utexas.edu</A></FO=
NT></DIV>
<DIV><FONT face=3DArial></FONT>&nbsp;</DIV>
<DIV><FONT face=3DArial>--------------------------------</FONT></DIV>
<DIV>One possibility would be to think hard about how to represent the =
data=20
<BR>that people who solve functional equations use.&nbsp; <BR><BR>For =
example,=20
the renormalization theory abounds with those. Many of<BR>which have =
been left=20
on shaky ground since they were only <BR>done numerically and the =
numerics is=20
sometimes suspect. <BR>The current implementations of these things could =
be=20
<BR>certainly improved.<BR><BR><BR>In harmonic analysis, there are =
several=20
"maximal operators" which <BR>would be useful to bound accurately. (Once =
you get=20
good bounds on <BR>those, you can start applying contraction=20
arguments)<BR><BR>In dynamical systems, one often is interested in =
knowing=20
whether <BR>some concrete features are present in the system and to =
obtain=20
<BR>quantitative estimates of them (e.g. intersection of manifolds that=20
<BR>determine capture etc.) <BR><BR>Another problem that I&nbsp; would=20
like&nbsp; a lot to see <BR>solved&nbsp; is the implementation&nbsp; of =
the=20
Ziglin criterion <BR>(or Morales-Ramis-Simo) that just looking at =
properties=20
of<BR>a periodic orbit can conclude that the system is not=20
integrable.<BR><BR>Recently, there are many results estimating Lyapunov=20
exponents of <BR>certain dynamical systems. Some particularly important =
examples=20
<BR>are those dynamical systems that appear in number theory. <BR>Just =
the=20
existence of those Lyapunov exponents, implies<BR>that certain continued =

fraction algorithms work.<BR><BR>I point out to some recent success =
stories=20
which I would like to <BR>see repeated: The proof of the double bubble=20
conjecture and <BR>the proof of the existence of the Lorenz attractor =
<BR>(the=20
later is more exemplary since there was a serious cooperation =
<BR>between the=20
mathematician and the people who implemented the package <BR>that was =
used)=20
<BR></DIV>
<DIV><FONT face=3DArial>-------------------</FONT></DIV>
<DIV><FONT face=3DArial>best regards to all,</FONT></DIV>
<DIV><FONT face=3DArial></FONT>&nbsp;</DIV>
<DIV><FONT face=3DArial>Ramon Moore</FONT></DIV>
<DIV>&nbsp;</DIV>
<DIV><FONT face=3DArial></FONT>&nbsp;</DIV></BODY></HTML>

------=_NextPart_000_0074_01C1516D.D9520200--


From owner-reliable_computing [at] interval [dot] louisiana.edu Fri Oct 12 09:10:05 2001
Received: (from root@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f9CEA5v00653
	for reliable_computing-outgoing; Fri, 12 Oct 2001 09:10:05 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f9CE9wq00648
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 12 Oct 2001 09:09:59 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.11.3/8.11.3) with SMTP id f9CE9tj07958
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 12 Oct 2001 08:09:55 -0600 (MDT)
Message-Id: <200110121409.f9CE9tj07958 [at] cs [dot] utep.edu>
Date: Fri, 12 Oct 2001 08:09:54 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: a question forwarded; please reply to Marek not to me
To: reliable_computing [at] interval [dot] louisiana.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: BNbLMGfSI+16eBRTFhGT5g==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

Date: Fri, 12 Oct 2001 11:49:32 +0200
From: "Marek W. Gutowski" <gutow [at] ifpan [dot] edu.pl>
X-Accept-Language: pl, en

Dear interval researchers,

The usual definition of convergence of a sequence of intervals
is
	lim [xl_k, xu_k]      = [xl_0, xu_0]
     as k goes to infinity

when  both limits below exist in the usual (e.g. Cauchy) sense, i.e.

	xl_k --> xl_0   and   xu_k --> xu_0  as k goes to infinity.

If this is the case then, indeed, the convergence to thin interval
is equivalent to:  width([xl_l, xu_k])  --> 0.

But,  is it indeed a correct definition in IR ?   What if I try to
investigate the monotonicity or continuity of inclusion for
a function 'f', say at the point x0, and I use the two sequences

	xl_k = x0 + 2^{-k}
	xu_k = x0 + 2^{1-k}   ??

Shouldn't the definition of convergence take into account the partial
order generated by inverse inclusion existing in IR, as an additional
requirement?
What I mean is that the sequence should have the required property

	[xu_{k+1}, xl_{k+1}] \subset [xl_k, xu_k]    for k > K

which might be necessary for various proofs.

Sincerely yours,
Marek Gutowski
-- 
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Marek Gutowski                | gutow [at] ifpan [dot] edu.pl
Institute of Physics, ON-3.2  | ###  #####  ####      #    #  #
Al. Lotnikow 32/46            |  #   #      #   #    # #   ## #
(PL) 02-668 Warszawa, Poland  |  #   ###    ####    #####  # ##
tel. 8437001 ext. 3122        | ###  #      #      #     # #  #
  ***   To talk or not to talk?  Yes, talk, plain ASCII please ***


From owner-reliable_computing [at] interval [dot] louisiana.edu Fri Oct 12 09:13:51 2001
Received: (from root@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f9CEDoQ00706
	for reliable_computing-outgoing; Fri, 12 Oct 2001 09:13:50 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f9CEDiq00701
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 12 Oct 2001 09:13:45 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.11.3/8.11.3) with SMTP id f9CEDeT07972
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 12 Oct 2001 08:13:40 -0600 (MDT)
Message-Id: <200110121413.f9CEDeT07972 [at] cs [dot] utep.edu>
Date: Fri, 12 Oct 2001 08:13:39 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: a question by Marek W. Gutowski
To: reliable_computing [at] interval [dot] louisiana.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: cIqVyj2WMCKpqFTdr8tCfQ==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

P.S. My personal opinion: Marek is right in saying that it is often useful to 
have a definition of convergence which includes monotonicity.

On the other hand, it is sometimes useful to have the more usual convergence in 
the sense of the standard topology on the set of all intervals. 

Just like there are many different topologies on the set of all the functions 
and many of them are very useful, why cannot there be several useful notions of 
convergence on the set of all intervals? 



From owner-reliable_computing [at] interval [dot] louisiana.edu Fri Oct 12 09:42:34 2001
Received: (from root@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f9CEgX900921
	for reliable_computing-outgoing; Fri, 12 Oct 2001 09:42:33 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f9CEgQq00916
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 12 Oct 2001 09:42:28 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.11.3/8.11.3) with SMTP id f9CEgKq08152;
	Fri, 12 Oct 2001 08:42:20 -0600 (MDT)
Message-Id: <200110121442.f9CEgKq08152 [at] cs [dot] utep.edu>
Date: Fri, 12 Oct 2001 08:42:21 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: Issac2002 Preliminary Call For Papers (forwarded)
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: d2YMeuPUS800t2oCL8i6/g==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

PRELIMINARY ANNOUNCEMENT

ISSAC 2002
International Symposium on Symbolic and Algebraic Computation
University of Lille, France, July 7-10, 2002
http://www.lifl.fr/issac2002

ISSAC is the yearly premier international symposium in Symbolic and
Algebraic Computation. It provides an opportunity to learn of new
developments and to present original research results in all areas of
symbolic mathematical computation.

Recent advances are communicated through its refereed conference
proceedings (available at the conference), prestigious invited talks,
tutorials, product exhibits, software demonstrations, poster
presentations and other activities.

CONFERENCE COMMITTEE: have accepted to serve:
General Chair: Marc Giusti (Marc.Giusti [at] GAGE [dot] Polytechnique.fr)
Program Committee Chair: Luis Miguel Pardo Vasallo
  (pardo [at] matesco [dot] unican.es)
Local Arrangements Chair: Marc Moreno Maza
  (Marc.Moreno-Maza [at] lifl [dot] fr,moreno [at] orcca [dot] on.ca,boulier [at] lifl [dot] fr)
Treasurer and Registration Chair: Nicole Dubois
  (Nicole.Dubois [at] GAGE [dot] Polytechnique.fr)
Proceedings Editor: Teo Mora (theomora [at] gauvain [dot] dima.unige.it)
Exhibits: Gregoire Lecerf, Marc Moreno Maza, Renaud Rioboo
Publicity Chair and Webmaster: Francois Lemaire
  (francois.lemaire [at] lifl [dot] fr,lemaire [at] orcca [dot] on.ca)

PROGRAM COMMITTEE: have accepted to serve
Jacques Calmet              
Rob Corless
Erich Kaltofen
Daniel Lazard  
Teo Mora (Proceedings Editor)
Francois Ollivier
Luis Miguel Pardo (Chair)    
Bruno Salvy
Michael Singer 
Mike Stillman 
Mark Van Hoeij
Gilles Villard
Volker Weispfenning         
Jean-Claude Yakoubsohn


From owner-reliable_computing [at] interval [dot] louisiana.edu Fri Oct 12 10:31:26 2001
Received: (from root@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f9CFVQP01115
	for reliable_computing-outgoing; Fri, 12 Oct 2001 10:31:26 -0500 (CDT)
Received: from iph.bio.bas.bg (IDENT:0@bas-bio.lines.bas.bg [195.96.252.58])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f9CFVKq01110
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 12 Oct 2001 10:31:21 -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 SAA26732;
	Fri, 12 Oct 2001 18:43:36 +0300
From: "Svetoslav Markov" <smarkov [at] iph [dot] bio.bas.bg>
Organization: Institute of Mathematics, BAS
To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>, gutow [at] ifpan [dot] edu.pl
Date: Fri, 12 Oct 2001 18:26:04 +0200
Subject: Re: a question by Marek W. Gutowski
Reply-to: smarkov [at] iph [dot] bio.bas.bg
CC: reliable_computing [at] interval [dot] louisiana.edu
Message-ID: <3BC735BC.19948.221B75C@localhost>
Priority: normal
In-reply-to: <200110121413.f9CEDeT07972 [at] cs [dot] utep.edu>
X-mailer: Pegasus Mail for Win32 (v3.12c)
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

Date sent:      	Fri, 12 Oct 2001 08:13:39 -0600 (MDT)
From:           	Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Send reply to:  	Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject:        	a question by Marek W. Gutowski
To:             	reliable_computing [at] interval [dot] louisiana.edu

> P.S. My personal opinion: Marek is right in saying that it is often useful to
> have a definition of convergence which includes monotonicity.
> 
> On the other hand, it is sometimes useful to have the more usual convergence in
> the sense of the standard topology on the set of all intervals. 
> 
> Just like there are many different topologies on the set of all the functions
> and many of them are very useful, why cannot there be several useful notions of
> convergence on the set of all intervals? 
> 
 
Dear Vladik, 
dear Marek,

A relevant concept of convergence has been investigated in:

Sendov, Bl.,  Some topics of segment analysis, Interval Mathematics 1980,
Ed. K. Nickel, AP, 1981, 203--222.

Angelov, R., S. Markov, Extended segment analysis, Freiburger Intervall-
Berichte, Univ. Freiburg i. Br. 81/10 (1981), 1--63.

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 
 web: http://www.math.bas.bg/~bio/

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

From owner-reliable_computing [at] interval [dot] louisiana.edu Fri Oct 12 10:52:51 2001
Received: (from root@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f9CFqou01259
	for reliable_computing-outgoing; Fri, 12 Oct 2001 10:52:50 -0500 (CDT)
Received: from sigma.ifpan.edu.pl (sigma.ifpan.edu.pl [148.81.44.1])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f9CFqiq01254
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 12 Oct 2001 10:52:45 -0500 (CDT)
Received: from ifpan.edu.pl (gutow [at] gutow [dot] ifpan.edu.pl [148.81.45.16])
	by sigma.ifpan.edu.pl (8.9.3/8.9.2) with ESMTP id RAA00094
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 12 Oct 2001 17:52:54 +0200
Message-ID: <3BC711F0.E4061019 [at] ifpan [dot] edu.pl>
Date: Fri, 12 Oct 2001 17:53:20 +0200
From: "Marek W. Gutowski" <gutow [at] ifpan [dot] edu.pl>
Reply-To: gutow [at] ifpan [dot] edu.pl
Organization: Institute of Physics, Polish Academy of Sciences
X-Mailer: Mozilla 4.77 [en] (X11; U; Linux 2.2.16 i586)
X-Accept-Language: pl, en
MIME-Version: 1.0
To: reliable_computing [at] interval [dot] louisiana.edu
Subject: FYI: historical note
Content-Type: text/plain; charset=iso-8859-2
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

Just today I have found the article:

	Calculus of Approximations
	by M. (Mieczys{\l}aw) Warmus

presented on February 6, 1956 (that's three years before the pioneering
work of Ramon E. Moore!) by H. Steinhaus in:
Bulletin de l'Academie Polonaise des Sciences, Cl.III - Vol. IV, No. 5,
1956, pp. 253-259.

Both Mieczys{\l}aw Warmus and Hugo Steinhaus were polish mathematicians,
working behind the iron courtain at that time, of course.

All basic notions of interval arithmetics are presented in this work,
i.e. four arithmetic operations are defined, the norm is defined as
|| [a,b] ||  =  |(a+b)/2| + |(a-b)/2|  (sum of center + radius, not
the usual l_1 norm)  with nice property:

	||XY|| <= ||X|| ||Y||

and the convergency defined as

	lim [a_n, b_n] = [a,b]   iff  lim || [a_n, b_n] - [a,b] || = 0
  as n goes to infinity

(the norm '||.||' is defined as above).
Presented is the subdistributivity of multiplication and division.
Here we encounter also an interesting geometric interpretation of
'approximate numbers' (also called 'intervals' there) as the points
on a plane, the relations (or better to say similarities) with
operations
on complex numbers, definitions of: 'approximate functions' (similar
to inclusion functions, but not identical at first sight), continuity,
derivative and integral - all for approximate functions.

There are no dual intervals, but the 'approximate numbers' are defined
as     x=[a,A] = [min(a,A), max(a,A)]
When  a <= A, the approximate number is called 'positively oriented
interval' or just 'interval', while otherwise it is called 'negatively
oriented interval'.  

Nice piece of work, regrettably overlooked.

-- 
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Marek Gutowski                | gutow [at] ifpan [dot] edu.pl
Institute of Physics, ON-3.2  | ###  #####  ####      #    #  #
Al. Lotnikow 32/46            |  #   #      #   #    # #   ## #
(PL) 02-668 Warszawa, Poland  |  #   ###    ####    #####  # ##
tel. 8437001 ext. 3122        | ###  #      #      #     # #  #
  ***   To talk or not to talk?  Yes, talk, plain ASCII please ***
----------------------------------------------------------------------

From owner-reliable_computing [at] interval [dot] louisiana.edu Fri Oct 12 11:21:58 2001
Received: (from root@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f9CGLwp01419
	for reliable_computing-outgoing; Fri, 12 Oct 2001 11:21:58 -0500 (CDT)
Received: from lcyoung.math.wisc.edu (lcyoung.math.wisc.edu [144.92.166.90])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f9CGLmq01414
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 12 Oct 2001 11:21:48 -0500 (CDT)
Received: from forelli.math.wisc.edu (forelli.math.wisc.edu [144.92.166.70])
	by lcyoung.math.wisc.edu (8.11.4/8.11.4) with ESMTP id f9CGLbr20394;
	Fri, 12 Oct 2001 11:21:37 -0500 (CDT)
Received: from localhost (hans@localhost)
	by forelli.math.wisc.edu (8.9.3+Sun/8.9.3) with ESMTP id LAA08831;
	Fri, 12 Oct 2001 11:21:36 -0500 (CDT)
X-Authentication-Warning: forelli.math.wisc.edu: hans owned process doing -bs
Date: Fri, 12 Oct 2001 11:21:35 -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 <pmisra [at] cs [dot] wright.edu>, "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.4.10.10110121117250.8766-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] louisiana.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
---






Journal: Linear Algebra and its Applications
ISSN   : 0024-3795
Volume : 338
Issue  : 1-3
Date   : 15-Nov-2001

Please note: The access restrictions on articles/abstracts vary. Many journals have free access to abstracts, but in general access to full text PDFs is restricted to subscribers.

Visit the journal at http://www.elsevier.nl/locate/jnlnr/07738


pp 1-17
Algebraic aspects of the discrete KP hierarchy
R. Felipe, F. Ongay
http://www.elsevier.nl/PII/S0024379501003652

pp 19-26
Extension of MacMahon's Master Theorem to pre-semi-rings
M. Minoux
http://www.elsevier.nl/PII/S0024379501003767

pp 27-36
Rectangular Vandermonde matrices on Chebyshev nodes
A. Eisinberg, G. Franze, N. Salerno
http://www.elsevier.nl/PII/S002437950100355X

pp 37-51
Is a Chebyshev method optimal for an elliptic region also optimal for a
nearly elliptic region?
X. Li
http://www.elsevier.nl/PII/S0024379501003627

pp 53-66
An improvement on the perturbation of the group inverse and oblique
projection
X. Li, Y. Wei
http://www.elsevier.nl/PII/S002437950100369X

pp 67-76
Three coefficients of a polynomial can determine its instability
A. Borobia, S. Dormido
http://www.elsevier.nl/PII/S0024379501003664

pp 77-98
Some 2-step nilpotent Lie algebras I
B. Ren, D. Ji Meng
http://www.elsevier.nl/PII/S0024379501003676

pp 99-104
On characterizing Z-matrices
R.L. Smith
http://www.elsevier.nl/PII/S0024379501003718

pp 105-123
On the shape of numerical range of matrix polynomials
H. Nakazato, P. Psarrakos
http://www.elsevier.nl/PII/S0024379501003743

pp 125-138
A generalization of Serre's conjecture and some related issues
Z. Lin, N.K. Bose
http://www.elsevier.nl/PII/S0024379501003706

pp 139-144
Denseness for norm attaining operator-valued functions
P. Enflo, J. Kover, L. Smithies
http://www.elsevier.nl/PII/S002437950100372X

pp 145-152
Modular automorphisms preserving idempotence and Jordan isomorphisms of
triangular matrices over commutative rings
X. MinTang, C. GuangCao, X. Zhang
http://www.elsevier.nl/PII/S0024379501003792

pp 153-169
Symmetric sign pattern matrices that require unique inertia
F.J. Hall, Z. Li, D. Wang
http://www.elsevier.nl/PII/S0024379501003810

pp 171-199
Using noncommutative Grobner bases in solving partially prescribed matrix
inverse completion problems
F. Dell Kronewitter
http://www.elsevier.nl/PII/S0024379501003822

pp 201-218
A robust ILU with pivoting based on monitoring the growth of the inverse
factors
M. Bollhofer
http://www.elsevier.nl/PII/S0024379501003858

pp 219-237
A two-step even-odd split Levinson algorithm for Toeplitz systems
A. Melman
http://www.elsevier.nl/PII/S002437950100386X

pp 239-244
The numerical range of elementary operators II
A. Seddik
http://www.elsevier.nl/PII/S0024379501003895

pp 245-249
The inverse of a non-singular free matrix
T. Britz
http://www.elsevier.nl/PII/S0024379501004098

pp 251-259
Backward minimal points for bounded linear operators on finite-dimensional
vector spaces
E.B. Wiesner
http://www.elsevier.nl/PII/S0024379501003949

pp 261-273
Generalized inverses of a sum of morphisms
H. You, J. Chen
http://www.elsevier.nl/PII/S0024379501003901

pp 275-285
More on positive subdefinite matrices and the linear complementarity
problem
S.R. Mohan, S.K. Neogy, A.K. Das
http://www.elsevier.nl/PII/S0024379501003937

pp 287-290
A generalization of Sylvester's law of inertia
C.R. Johnson, S. Furtado
http://www.elsevier.nl/PII/S0024379501004086

pp 291
Author index
whttp://www.elsevier.nl/PII/S0024379501004979


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

You can access for FREE full text articles of Linear Algebra and Its
Applications as well as 16 related journal titles from:
http://www.mathformath.com. Simply send a blank email to
mailto:join-mathformath-offer1 [at] lyris [dot] elsevier.nl . In return, you will
receive the instructions for FREE access until 31st October 2001.






From owner-reliable_computing [at] interval [dot] louisiana.edu Fri Oct 12 11:31:32 2001
Received: (from root@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f9CGVWY01570
	for reliable_computing-outgoing; Fri, 12 Oct 2001 11:31:32 -0500 (CDT)
Received: from clmboh1-smtp3.columbus.rr.com (clmboh1-smtp3.columbus.rr.com [65.24.0.112])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f9CGVRq01565
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 12 Oct 2001 11:31:27 -0500 (CDT)
Received: from oemcomputer (dhcp065-024-174-102.columbus.rr.com [65.24.174.102])
	by clmboh1-smtp3.columbus.rr.com (8.11.2/8.11.2) with SMTP id f9CGQu615271;
	Fri, 12 Oct 2001 12:27:00 -0400 (EDT)
Message-ID: <001601c1533b$4c1672c0$66ae1841 [at] columbus [dot] rr.com>
From: "Ramon Moore" <rmoore17 [at] columbus [dot] rr.com>
To: <gutow [at] ifpan [dot] edu.pl>
Cc: "interval" <reliable_computing [at] interval [dot] louisiana.edu>
References: <3BC711F0.E4061019 [at] ifpan [dot] edu.pl>
Subject: Re: historical note
Date: Fri, 12 Oct 2001 12:31:04 -0400
MIME-Version: 1.0
Content-Type: text/plain;
	charset="iso-8859-2"
Content-Transfer-Encoding: 8bit
X-Priority: 3
X-MSMail-Priority: Normal
X-Mailer: Microsoft Outlook Express 5.50.4133.2400
X-MimeOLE: Produced By Microsoft MimeOLE V5.50.4133.2400
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

Dear Marek,

Thank you for the interesting historical note. I did not know of this work
or of the work of any others on interval computations when I wrote my first
papers at Lockheed and my 1962 thesis at Stanford. After having been told by
my advisor at Stanford to go look for related work in the literature. I
found what I could and put in references to what earlier works I could find.
Indeed on page 1 of my 1966 book Interval Analysis, I credit Archimedes for
his much earlier method of finding upper and lower bounds to pi.

best regards

Ramon Moore

----- Original Message -----
From: "Marek W. Gutowski" <gutow [at] ifpan [dot] edu.pl>
To: <reliable_computing [at] interval [dot] louisiana.edu>
Sent: Friday, October 12, 2001 11:53 AM
Subject: FYI: historical note


> Just today I have found the article:
>
> Calculus of Approximations
> by M. (Mieczys{\l}aw) Warmus
>
> presented on February 6, 1956 (that's three years before the pioneering
> work of Ramon E. Moore!) by H. Steinhaus in:
> Bulletin de l'Academie Polonaise des Sciences, Cl.III - Vol. IV, No. 5,
> 1956, pp. 253-259.
>
> Both Mieczys{\l}aw Warmus and Hugo Steinhaus were polish mathematicians,
> working behind the iron courtain at that time, of course.
>
> All basic notions of interval arithmetics are presented in this work,
> i.e. four arithmetic operations are defined, the norm is defined as
> || [a,b] ||  =  |(a+b)/2| + |(a-b)/2|  (sum of center + radius, not
> the usual l_1 norm)  with nice property:
>
> ||XY|| <= ||X|| ||Y||
>
> and the convergency defined as
>
> lim [a_n, b_n] = [a,b]   iff  lim || [a_n, b_n] - [a,b] || = 0
>   as n goes to infinity
>
> (the norm '||.||' is defined as above).
> Presented is the subdistributivity of multiplication and division.
> Here we encounter also an interesting geometric interpretation of
> 'approximate numbers' (also called 'intervals' there) as the points
> on a plane, the relations (or better to say similarities) with
> operations
> on complex numbers, definitions of: 'approximate functions' (similar
> to inclusion functions, but not identical at first sight), continuity,
> derivative and integral - all for approximate functions.
>
> There are no dual intervals, but the 'approximate numbers' are defined
> as     x=[a,A] = [min(a,A), max(a,A)]
> When  a <= A, the approximate number is called 'positively oriented
> interval' or just 'interval', while otherwise it is called 'negatively
> oriented interval'.
>
> Nice piece of work, regrettably overlooked.
>
> --
> ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
> Marek Gutowski                | gutow [at] ifpan [dot] edu.pl
> Institute of Physics, ON-3.2  | ###  #####  ####      #    #  #
> Al. Lotnikow 32/46            |  #   #      #   #    # #   ## #
> (PL) 02-668 Warszawa, Poland  |  #   ###    ####    #####  # ##
> tel. 8437001 ext. 3122        | ###  #      #      #     # #  #
>   ***   To talk or not to talk?  Yes, talk, plain ASCII please ***
> ----------------------------------------------------------------------


From owner-reliable_computing [at] interval [dot] louisiana.edu Fri Oct 12 14:39:36 2001
Received: (from root@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f9CJda401966
	for reliable_computing-outgoing; Fri, 12 Oct 2001 14:39:36 -0500 (CDT)
Received: from suntana.fh-konstanz.de (suntana.fh-konstanz.de [141.37.9.230])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f9CJdVq01960
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 12 Oct 2001 14:39:31 -0500 (CDT)
Received: from fh-konstanz.de (dialup167.fh-konstanz.de [141.37.217.167])
	by suntana.fh-konstanz.de (8.9.3+Sun/8.9.3) with ESMTP id VAA07626
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 12 Oct 2001 21:37:32 +0200 (MEST)
Message-ID: <3BC74881.C51F4F21@fh-konstanz.de>
Date: Fri, 12 Oct 2001 21:46:09 +0200
From: Garloff [at] suntana [dot] fh-konstanz.de,
   =?iso-8859-1?Q?J=FCrgen?= <garloff@fh-konstanz.de>
Organization: Fachhochschule Konstanz
X-Mailer: Mozilla 4.51 [en] (Win98; I)
X-Accept-Language: en
MIME-Version: 1.0
To: reliable_computing [at] interval [dot] louisiana.edu
Subject: Re: historical note
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

I do not agree with Marek Gutowski that the work of Prof. Warmus is
forgotten. I had listed in my bibliography on interval mathematics the
paper cited by Marek Gutowski as well as the paper

Approximations and Inequalities in the Calculus of Approximations.
Classification of Approximate Numbers
Bull. Acad. Polon. Sci. Ser. Sci. Math. Astronom. Phys. 9, pp. 241-245
(1961).

I came in contact with Prof. Warmus in 1977 and had informed him that
his work is related to interval mathematics. Later on, he attended the
Intervall-Symposium in Seefeld/Austria, May 16 - 19, 1978. Years later,
I learnt that he had moved to an Australian university (University of
Woologong or similarly).

Juergen Garloff

From owner-reliable_computing [at] interval [dot] louisiana.edu Fri Oct 12 21:15:40 2001
Received: (from root@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f9D2Fde02692
	for reliable_computing-outgoing; Fri, 12 Oct 2001 21:15:39 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f9D2FYq02687
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 12 Oct 2001 21:15:34 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.11.3/8.11.3) with SMTP id f9D2FU113409;
	Fri, 12 Oct 2001 20:15:30 -0600 (MDT)
Message-Id: <200110130215.f9D2FU113409 [at] cs [dot] utep.edu>
Date: Fri, 12 Oct 2001 20:15:29 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: interval session at NAFIPS'02
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: 1QhZ98NwPsEafyUxoLziQw==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

October 12, 2001

Dear Friends,

North American Fuzzy Information Processing Society (NAFIPS) is planning to
have its 2002 conference in New Orleans at Tulane University, 
just a short distance from the French quarter. 

The organizers will be glad to see an interval track just like at
the NAFIPS'01 conference this past July - that outlined the 
relations between fuzzy and interval computations. 

The NAFIPS'02 Call for Papers is attached.

Some interval folks have already expressed their interest after 
my preliminary email sent a few months ago, including Martin Berz. 

We need to submit our proposal by December 1, so if you are interested, 
please let me know ASAP, ideally by November 20. By that time, 
we need a title and a short abstract to form a proposal. 

Vladik
****************************************************************************
 North American Fuzzy Information Processing Society - NAFIPS
 NAFIPS 2002

 New Orleans, LA
 June 27-29, 2002

 CALL FOR PAPERS

 Honorary Conference Chair:  Lotfi A. Zadeh (USA)
 General Chairs:             Donald Kraft
                             Fred Petry
 Local Arrangements Chair:   Ashley Morris
 Finance Chair:              Karen Legrand
 Publications Chair:         Jianhua Chen
 Program Chair:              Jim Keller
 Program Co-chair:           Olfa Nasraoui
 Information Architect:      Gigi C. Phillips

 PROGRAM COMMITTEE

 M. Berthold (USA), J.C. Bezdek (USA), Z. Bien (Korea), 
 P. Bonissone (USA), G. Bordogna (Italy), 
 B. Bouchon-Meunier (FR), M. Cobb (USA), V. Cross (USA), 
 R.N. Dave (USA), D. Dubois (France), A.O. Esogbue (USA), 
 T. Fukuda (Japan), P. Gader (USA), F. Gomide (Brazil), 
 N. Green-Hall (USA), M. Gupta (Canada), L. Hall (USA), 
 K. Hirota (Japan), A. Kandel (USA), E. Kerre (Belgium), 
 G.J. Klir (USA), L.T. Koczy (Hungary), R. Krishnapuram (USA), 
 R. Kruse (Germany), L. Kuncheva (UK), J. Lee (Taiwan), 
 Y.M. Liu (China), Z.Q. Liu (Au), R. Mantaras (Spain), 
 M. Mizumoto (Japan), N. Pal (India), G. Pasi (Italy), 
 W. Pedrycz (Canada), H. Prade (France), S.H. Rubin (USA), 
 E.H. Ruspini (USA), M. Schneider (Israel), M.Smith (Canada),
 T. Sudkamp (USA), I.B. Turksen (Canada), E. Walker (USA), 
 P. Wang (USA), T. Whalen (USA), R.R. Yager (USA), 
 T. Yamakawa (Japan), A. Yazici (Turkey), H.Zimmermann (Ger)

 PROGRAM:
 The conference will feature plenary sessions by
 Jim Bezdek, Vince Robinson, and Lotti Zadeh. The
 conference program will allow carefully focused
 invited sessions. Potential special session
 proposals should be sumbmitted to the conference
 chairs by Dec. 1, 2001.

 Ordinary contributed papers will be reviewed
 based on content. Relevant topics may include,
 but are not limited to:

 * Fuzzy systems / sets / mathematics / control
 / databases / theory
 * Soft computing / neural and fuzzy neural
 networks /genetic algorithms
 * Learning systems / data mining / robotics /
 image processing / pattern recognition
 * Applications of soft computing / successful
 applications and case studies

 In order to foster in depth exchange and emphasis
 in some specific areas, proposals for
 organized-area-sessions are welcomed. Proposals
 to organize such a session should be submitted to
 the Program Co-Chairs by January 4, 2002. Please
 supply a short explanation of the area as well as
 a potential list of contributors. The areas
 chosen by the Program Committe will be open to
 all NAFIPS contributors. All abstracts will be
 reviewed and placed in the session by the program
 chairs in consultation with the session
 organizers.

 A Special Track on Fuzzy Sets and the Internet is
 being organized by Dr. Ron Yager and submissions
 for this track are especially invited. This track
 is following in the same spirit as the recent
 FLINT meeting in Berkeley

 Those submitting a paper which they want included
 in this special track please indicate with your
 submission. Those interested in organizing
 special sessions within this track please contact
 Ron Yager.

 PAPER SUBMISSION:

 Papers will be reviewed on the basis of a 2 page 
 extended abstract. The deadline for receipt of
 the abstract is January 15, 2002. Electronic
 submission is highly encouraged. Instructions for
 electronic submission are given on the
 conference website http://bit.csc.lsu.edu/nafips2002.html/. 
 Otherwise, three copies of an extended abstract should be 
 sent to the following address:

 Jim Keller
 Department of Computer Engineering and Computer
 Science
 University of Missouri
 Columbia MO 65211-2060 USA

 SUBMISSION GUIDELINES

 Authors are requested to send three copies of
 extended abstracts with minimum 2 and maximum 4
 pages. Extended abstracts should be prepared on
 A4 white paper, two column format, in Times or
 similar style, 10 points. Extended abstracts must
 be single sided and they should include title,
 author's name(s), affiliation(s) and keywords on
 top of the first page. E-mail submissions are
 encouraged. Please indicate the corresponding
 authors with their e-mail addresses.

 If accepted, the authors have to prepare the
 final camera-ready manuscript in time for
 inclusion in the proceedings and personally
 present the paper at the conference.

 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 March 1, 2002,
 with 5 page camera-ready papers due by April 15,
 2002.

 CONFERENCE AND CONFERENCE SITE:

 The conference will be held at the
 Tulane University campus in the Tulane University
 Center in enchanting and historic New Orleans,
 Louisiana. New Orleans is world renowned for its
 fine food and music. Housing has been made
 available at very reasonable costs on campus in
 the Aron Residences. A number of other hotels are
 available via about a 15 minute ride on the
 national landmark St. Charles streetcar. The
 conference banquet will be held at a site to be
 decided.

 To be placed on the mailing list for future
 notices, please send name and email address to
 the Publications Chair, Jianhua Chen
 (Jianhua [at] bit [dot] csc.lsu.edu).

 IMPORTANT DATES

 Extended abstract due:       January 15, 2002
 Notification of acceptance:  March 1, 2002
 Camera ready paper due:      April 15, 2002   
 Submission of proposals for 
  organized sessions on 
  special topics:             January 4 2002                           
 Conference and Exhibition:   June 27-29, 2002



From owner-reliable_computing [at] interval [dot] louisiana.edu Fri Oct 12 23:04:12 2001
Received: (from root@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f9D44CK02975
	for reliable_computing-outgoing; Fri, 12 Oct 2001 23:04:12 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f9D446q02970
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 12 Oct 2001 23:04:06 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.11.3/8.11.3) with SMTP id f9D441C13656;
	Fri, 12 Oct 2001 22:04:01 -0600 (MDT)
Message-Id: <200110130404.f9D441C13656 [at] cs [dot] utep.edu>
Date: Fri, 12 Oct 2001 22:04:02 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: Eighteenth National Conference on Artificial Intelligence (from the webpage)
To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu
Cc: dechter [at] ics [dot] uci.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: uZdeNgi01oOKex56C7pZrA==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

Dear Friends, 

I hope this CFP will be of interest to the interval community, especially since 
Rina Dechter, one of the two program co-chairs, is one of the world's leading  
specialists in constraint-based reasoning and reasoning under uncertainty. 
According to her website, "Her ongoing focus is on constraint processing, which 
emerges as a unifying theme that cuts across many traditional areas in
Artificial Intelligence."

Her research covers many techniques of constraint processing, including 
interval techniques. Her paper

Shapiro, R., Feldman, Y. A., and Dechter, R., "On the Complexity of 
Interval-Based Constraint Networks" In "MISC'99
       Workshop on Applications of Interval Analysis to Systems and Control", 
February, 1999 pp. 389-399. 

appeared in the proceedings of the 1999 international interval conference in 
Girona, Spain. 

Constraint processing is explicitly mentioned as one of the topics of the 
conference. 

This is the top conference in Artificial Intelligence. In the past, there have 
been some interval-related papers presented at AAAI conferences (e.g., I myself 
presented a one in 2000, an interval-based robot was briefly described in 1996 
and 1997, etc.), but our important techniques and useful applications deserve a 
better exposure to the AI community.

If you are doing interval research related to AI, please consider submission! 

Vladik
****************************************************************************
Eighteenth National Conference on Artificial Intelligence 
Call for Papers
http://www.aaai.org/Conferences/National/2002/aaai02.html

AAAI-02 is the Eighteenth National Conference on Artificial Intelligence
(AI). The purpose of this conference is to promote research in AI and
scientific interchange among AI researchers, practitioners, and scientists
and engineers in related disciplines. The conference provides a forum for a
broad range of topics, including (but not limited to) knowledge
representation, machine learning, autonomous agents, planning, robotics and
machine perception, expert systems, theorem proving, commonsense reasoning,
probabilistic inference, constraint satisfaction, game playing, automated
diagnosis, data mining, natural language processing, neural networks,
reinforcement learning, and cognitive modeling.

As the national conference for all of AI, AAAI-02 is intended to play a
centralizing and unifying role that complements more specialized
conferences. To encourage papers that speak to the whole AI community, this
year we will avoid multiple parallel sessions. Instead, all accepted papers
will be presented as posters, and a subset will also be presented orally in
a single plenary track. All papers will appear identically in the
proceedings, and all will be subject to the same rigorous review process.

Timetable for Authors

   * January 21, 2002: Electronic submission of title page, abstract
     and paper
   * January 22, 2002: Submission of two (2) paper copies to AAAI
     office
   * March 15, 2002: Notification of acceptance or rejection
   * April 9, 2002: Camera-ready copy due at AAAI office

Electronic Title Page

Because of the blind reviewing process, we require that authors who plan to
submit a full paper submit a separate electronic title page by the
electronic paper submission deadline, January 21, 2002. This is done by
using a web browser to fill out the form linked to the Authors Web site:
http://www.aaai.org/Conferences/National/2002/Author/titlepage.html

The form will include the abstract, keywords, and other information as
indicated. After submitting the form, the page will display a unique
tracking number. Authors should print two (2) hard copies of this electronic
title page (unstapled) and submit them with the hard copy of their papers as
described below. Information for authors without access to a forms-capable
browser will appear on the web site.

Paper Submission

Electronic paper submission is required. Instructions about how to do this
will be available at the URL above. Authors should also submit two (2) hard
copies of the paper. If an author has been excused by the program cochairs
from submitting the electronic version of a paper, the author is required to
submit six (6) hard copies of the paper. Both hard copy and electronic
submissions may be no longer than 6 pages long including references, and
formatted in AAAI two-column camera ready style. We cannot accept
submissions by e-mail or fax. Please send papers to:

     AAAI-02
     American Association for Artificial Intelligence
     445 Burgess Drive
     Menlo Park, CA 94025-3442
     Telephone: 650-328-3123

Reviewing for AAAI-02 will be blind to the identities of the authors.
Details on formatting and preparing the paper for blind review can be found
at the authors' web site noted above.

Submissions to Other Conferences or Journals

Papers submitted to this conference must not have been accepted for
publication elsewhere or be under review for another AI conference. However,
to encourage interdisciplinary contributions, we may consider work that has
been submitted or presented in part to a forum outside of AI. The guidelines
of the AAAI policy on multiple submissions are fully detailed at the
authors' web site noted above and must be carefully followed.

Review Process

Program committee members will identify papers they are qualified to review
based on the information electronically submitted (the paper's title,
content areas, and abstract). Their reviewing will be done blind to the
identities of the authors and their institutions. The program committee's
reviews will make recommendations to the senior program committee, which in
turn will make recommendations to the program cochairs. Although the program
cochairs will formally make all final decisions, in practice almost all will
be made earlier in the process.

Publication

Accepted papers will be allocated six (6) pages in the conference
proceedings. Up to two (2) additional pages may be used at a cost to the
authors of $275 per page. Papers exceeding eight (8) pages and those
violating the instructions to authors will not be included in the
proceedings. Authors will be required to transfer copyright of their paper
to AAAI.

Questions and Suggestions

Concerning author instructions and conference registration, write to:
ncai [at] aaai [dot] org.

Concerning suggestions for the conference and other inquiries, write to the
Program Cochairs: Rina Dechter, University of California, Irvine
dechter [at] ics [dot] uci.edu or Richard S. Sutton, AT&T Shannon Laboratory
sutton [at] research [dot] att.com



From owner-reliable_computing [at] interval [dot] louisiana.edu Sat Oct 13 04:57:28 2001
Received: (from root@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f9D9vSv05076
	for reliable_computing-outgoing; Sat, 13 Oct 2001 04:57:28 -0500 (CDT)
Received: from iph.bio.bas.bg (bas-bio.lines.bas.bg [195.96.252.58])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f9D9vLq05070
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sat, 13 Oct 2001 04:57:22 -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 NAA28610
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sat, 13 Oct 2001 13:10:29 +0300
From: "Svetoslav Markov" <smarkov [at] iph [dot] bio.bas.bg>
Organization: Institute of Mathematics, BAS
To: reliable_computing [at] interval [dot] louisiana.edu
Date: Sat, 13 Oct 2001 12:52:53 +0200
Subject: Re: historical note
Reply-to: smarkov [at] iph [dot] bio.bas.bg
Message-ID: <3BC83925.9090.529737@localhost>
Priority: normal
X-mailer: Pegasus Mail for Win32 (v3.12c)
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

In our paper:

Markov, S., K. Okumura, The Contribution of T. Sunaga to
Interval Analysis and Reliable Computing, in: Developements
in Reliable Computing (Ed. T. Csendes), Kluwer, 1999, 167-188.

we give credit to M. Warmus as one of the pioneers in the field and
cite both of his related papers.  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 
 web: http://www.math.bas.bg/~bio/

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

From owner-reliable_computing [at] interval [dot] louisiana.edu Sat Oct 13 20:10:47 2001
Received: (from root@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f9E1Ak901323
	for reliable_computing-outgoing; Sat, 13 Oct 2001 20:10:46 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f9E1AfC01318
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sat, 13 Oct 2001 20:10:42 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.11.3/8.11.3) with SMTP id f9E1Aci16828
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sat, 13 Oct 2001 19:10:38 -0600 (MDT)
Message-Id: <200110140110.f9E1Aci16828 [at] cs [dot] utep.edu>
Date: Sat, 13 Oct 2001 19:10:37 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: CFP: Imprecise and Indeterminate Probabilities in AI
To: reliable_computing [at] interval [dot] louisiana.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: PWM3KPUKWsVhq7ldZ2QWAQ==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

Dear Friends, I have forwarded this CFP to the list some time ago but it looks 
like the mailing list was not functioning properly at that time. Just in case, 
I am resending this CFP. Vladik

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

Date: Fri, 7 Sep 2001 14:52:45 -0500 (CDT)
X-Authentication-Warning: canopus.coginst.uwf.edu: teng set sender to 
cmteng [at] ai [dot] uwf.edu using -f
From: cmteng [at] ai [dot] uwf.edu (Choh Man Teng)



  ------------------------------------------------------------------------
                              Call for Papers

                                Special Track
                                     on
    Imprecise and Indeterminate Probabilities in Artificial Intelligence

                                 FLAIRS 2002
                  The 15th International FLAIRS Conference

                             Pensacola, Florida
                      Crown Plaza Pensacola Grand Hotel
                               May 16-18, 2002

                          In cooperation with AAAI
  ------------------------------------------------------------------------

Imprecise and indeterminate probabilities encompass the many mathematical
models of uncertainty that cannot be given sharp numerical boundaries. This
arises from information that is scare, vague, inconsistent, or incomplete.
There is little reason to assume that we can always obtain exact
point-valued probabilities, especially since we are modelling events that
are inherently uncertain. Statements such as "the probability of a power
outage is between 0.3 and 0.5" is more natural and realistic than their
"exact" counterparts such as "the probability of a power outage is 0.39482."

Research papers are solicited for the Special Track on Imprecise and
Indeterminate Probabilities in Artificial Intelligence, as part of the
FLAIRS-2002 conference. Topics of interest include, but are not limited to,

   * Modelling and representation of imprecise and indeterminate
     information, using for instance
        o Belief functions
        o Choquet capacities
        o Comparative probability orderings
        o Convex sets of probability measures
        o Bayes' nets with imprecise probabilities
        o Interval-valued probabilities
        o Upper and lower expectations or previsions
   * Inference and decision making using imprecise and indeterminate
     probabilities
   * Comparative analyses and integration of approaches
   * Extending standard techniques for imprecise and indeterminate
     information


Paper Submission and Publication
---------------------------------
Full papers of a maximum of 5 pages (AAAI style) will be reviewed.
Formatting guidelines can be found at
http://www.aaai.org/Publications/Author/authorinstructions.html

Electronic submission (postscript or PDF files preferred) should be sent to
Choh Man Teng at cmteng [at] ai [dot] uwf.edu. Please also include in a plain text
message the following information: title, author(s), abstract, and a list of
keywords.

If electronic submission is not possible, hardcopies can be snail mailed to

     Choh Man Teng
     Institute for Human and Machine Cognition
     University of West Florida
     40 South Alcaniz Street
     Pensacola FL 32501 USA

The deadline for submission is October 28, 2001.

Accepted papers will appear as regular papers in the FLAIRS-2002 conference
proceedings published by AAAI Press. Selected papers will be considered for
publication in a special issue of the International Journal of Pattern
Recognition and Artificial Intelligence.


Important Dates
----------------
Papers due: October 28, 2001
Notification of acceptance: January 3, 2002
Camera ready copies due: March 4, 2002
Conference: May 16-18, 2002


Organizing Committee
---------------------
Fabio Cozman (University of Sao Paulo, Brazil)
Gert de Cooman (Ghent University, Belgium)
Henry Kyburg, Jr. (University of Rochester, USA)
Isaac Levi (Columbia University, USA)
Serafin Moral (University of Granada, Spain)
Eric Neufeld (University of Saskatchewan, Canada)
Choh Man Teng (University of West Florida, USA)


For Further Information
------------------------
Conference web site: http://www.flairs.com
Imprecise and indeterminate probabilities special track web site:
http://www.coginst.uwf.edu/users/cmteng/flairs_iip.html

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



From owner-reliable_computing [at] interval [dot] louisiana.edu Sun Oct 14 12:34:53 2001
Received: (from root@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f9EHYqx00549
	for reliable_computing-outgoing; Sun, 14 Oct 2001 12:34:52 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f9EHYle00544
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 14 Oct 2001 12:34:48 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.11.3/8.11.3) with SMTP id f9EHYhd18730;
	Sun, 14 Oct 2001 11:34:43 -0600 (MDT)
Message-Id: <200110141734.f9EHYhd18730 [at] cs [dot] utep.edu>
Date: Sun, 14 Oct 2001 11:34:43 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: warning: server where interval webpage and my own page are
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: M0x+5nx/rtqwNYLatX+7ZQ==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

Dear Friends, 

I have just been informed that next week, there will be some restucturing of 
the departmental webserver which hosts, in particular, the interval 
computations website.

Our webmaster assured me that he will do his best not to disrupt connections 
but things happen. If you experience problems connecting to the interval 
website please let me know ASAP. 

My personal webpage will probably have to change. The new URL is 
http://www.cs.utep.edu/vladik
The old link still works, it may stop working at any time. 

Sorry for the inconvenience. Vladik


From owner-reliable_computing [at] interval [dot] louisiana.edu Sun Oct 14 18:30:48 2001
Received: (from root@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f9ENUl001201
	for reliable_computing-outgoing; Sun, 14 Oct 2001 18:30:47 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f9ENUge01196
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 14 Oct 2001 18:30:43 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.11.3/8.11.3) with SMTP id f9ENUbm19678;
	Sun, 14 Oct 2001 17:30:37 -0600 (MDT)
Message-Id: <200110142330.f9ENUbm19678 [at] cs [dot] utep.edu>
Date: Sun, 14 Oct 2001 17:30:37 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: interval session at the IEEE Fuzzy conference: call for papers
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: lPtbxwSlfHngdsSdgRS1Og==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

                              CALL FOR PAPERS

                             Special Session on 
                  INTERVAL COMPUTATIONS AND FUZZY TECHNIQUES 
                                  at the 
             2002 IEEE International Conference on Fuzzy Systems
                               May 12-17, 2002
                Hilton Hawaiian Village, Honolulu, HI
       held as part of the World Congress on Computational Intelligence

BACKGROUND
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. 

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.).

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.  

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.

To solve this problem, a special mini-track on interval computations 
and fuzzy techniques was organized at the recent 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, July 25-28, 2001,
Vancouver, Canada. This mini-track turned out to be the largest and
included a lot of interesting talks. 

PROPOSAL
2002 is a year when several IEEE conferences - including the
International IEEE Conference on Fuzzy Systems - get together to have 
a joint World Congress on Computational Intelligence. This joint
conference provides an additional exposure to all the presentations. 

In view of this year's success, we strongly believe that it will be
beneficial to organize a special interval session at the 2002 IEEE 
Conference on Fuzzy Systems. Similarly to last year, the intent is to
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. 

In view of the importance of this area, the conference organizers
kindly agreed to extend, for our session, their deadline for
submitting the special session proposals. 

Please let us know ASAP if you are interested in contributing. At this
moment, all we need is author(s) name(s), affiliation(s), and title. 
Please let us know ASAP, ideally, by November 1.
Please send the information to me by email at vladik [at] cs [dot] utep.edu.

LATER
If the session is approved, the papers are due by December 10. Please
submit them to vladik [at] cs [dot] utep.edu. The conference webpage contains
detailed format information (no LaTeX style file yet). 

We hope the session will make it, but if it does not,
please submit the intended papers directly to the conference. 

MESSAGE FROM THE CONFERENCE ORGANIZERS
The organizers of the general conference asked to inform all potential
participants of the special sessions about the following two
conference rules:

1) First, according to the conference rules, every paper submitted to the
conference - including papers submitted to a special session - will
undergo a peer review process, with at least two independent reviews
for each submission. 

2) Second, according to the conference rules, only papers presented at
the conference (with registration paid) will be published in the
proceedings. Thus, by agreeing to participate in the special
session, a potential participant (participants) agree(s):
* to prepare a paper, and, 
* if the proposal for the special session is approved and
  the paper is accepted, to present this paper at the conference. 

IN BRIEF: IMPORTANT DATES
November 1: authors, affiliation, title 
December 10: actual paper

Yours

Vladik Kreinovich and and Scott A. Starks

P.S. Just in case, our mailing address is:

Vladik Kreinovich and Scott A. Starks 
NASA Pan-American Center for Earth and Environmental Studies
University of Texas at El Paso
500 W. University 
El Paso, TX 79968, USA
*****************************************************************************
http://www.wcci2002.org/            

2002 IEEE International Conference on Fuzzy Systems

CALL FOR PAPERS

May 12-17, 2002
Hilton Hawaiian Village, Honolulu, HI
held as part of the World Congress on Computational Intelligence

The Annual IEEE International Conference on Fuzzy Systems, FUZZ-IEEE, is one
of the premier international conferences in the field. It covers all topics
in fuzzy systems, including: fuzzy logic, fuzzy-neuro-evolutionary hybrid
systems, fuzzy optimization and design, fuzzy system architectures and
hardware, fuzzy control and robotics, fuzzy database mining and financial
forecasting, fuzzy information retrieval, fuzzy human interfaces, fuzzy
intelligent Internet and multimedia applications, computing with words, and
more. The emphasis of FUZZ-IEEE2002 will be on original theories and novel
applications of fuzzy-related technologies. The conference welcomes paper
submissions from researchers, practitioners, and students worldwide.

FUZZ-IEEE2002 will be held in conjunction with the International Joint
Conference on Neural Networks (IJCNN) and the Congress on Evolutionary
Computation (CEC2002) as part of the World Congress on Computational
Intelligence (WCCI). Crossfertilization of the three fields will be strongly
encouraged. The Congress will feature keynote speeches and tutorials by
world-leading researchers. It also will include a number of special sessions
and workshops on the latest hot topics. Your registration admits you to all
events and includes the World Congress proceedings and banquet. The deadline
for submissions is December 10, 2001. Look for more details on paper
submission and conference registration coming soon.

General Chairman, WCCI2002:
          David B. Fogel, Natural Selection, Inc., USA
Vice-General Chairman, WCCI2002:
          Mohamed A. El-Sharkawi, University of Washington, Inc., USA
Program Chairman, FUZZ-IEEE2002:
          Toshio Fukuda, Nagoya University, Japan
Technical co-Chairmen, FUZZ-IEEE2002:
          Michael Smith, University of Calgary, Canada
          Kaoru Hirota, Tokyo Institute of Technology, Japan
          Didier Dubois, Inst. de Recherche en Inform. de Toulouse, France
          Henri Prade, Inst. de Recherche en Inform. de Toulouse, France
          Piero Bonissone, General Electric, USA
Special Sessions Chair, IJCNN2002:
          Valerie Cross, University of South Carolina, USA
Publicity Chairman, FUZZ-IEEE2002:
          Larry Hall, University of South Florida, USA
Local Arrangements Chairman, WCCI2002:
          Anthony Kuh, University of Hawaii at Manoa, USA


From owner-reliable_computing [at] interval [dot] louisiana.edu Tue Oct 16 22:31:21 2001
Received: (from root@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f9H3VLm00694
	for reliable_computing-outgoing; Tue, 16 Oct 2001 22:31:21 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f9H3VDS00689
	for <reliable_computing [at] interval [dot] louisiana.edu>; Tue, 16 Oct 2001 22:31:14 -0500 (CDT)
Received: from earth (earth [129.108.5.21])
	by cs.utep.edu (8.11.3/8.11.3) with SMTP id f9H3V9S06479;
	Tue, 16 Oct 2001 21:31:09 -0600 (MDT)
Message-Id: <200110170331.f9H3V9S06479 [at] cs [dot] utep.edu>
Date: Tue, 16 Oct 2001 21:31:10 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: Interval Session at the World Automation Congress: call for papers
To: reliable_co