From owner-reliable_computing [at] interval [dot] louisiana.edu Fri Apr  2 08:42:56 2004
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id i32Egsp08960
	for reliable_computing-outgoing; Fri, 2 Apr 2004 08:42:54 -0600 (CST)
Received: (from rbk5287@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id i32Egnw08955
	for reliable_computing [at] interval [dot] louisiana.edu; Fri, 2 Apr 2004 08:42:49 -0600 (CST)
Received: from poster2.unibo.it (poster.unibo.it [137.204.24.58])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with SMTP id i31G2L507731
	for <reliable_computing [at] interval [dot] louisiana.edu>; Thu, 1 Apr 2004 10:02:22 -0600 (CST)
Received: from EXBK02 ([IP=137.204.25.125]) by eSafe SMTP Relay 1080803779; Thu Apr  1 17:40:43 2004
Received: from exfe01.personale.dir.unibo.it ([137.204.24.56]) by EXBK02 with Microsoft SMTPSVC(5.0.2195.6713); Thu, 1 Apr
	 2004 17:40:34 +0200
Received: from [137.204.45.65] ([137.204.45.65]) by exfe01.personale.dir.unibo.it over TLS secured channel with Microsoft
	 SMTPSVC(5.0.2195.6713); Thu, 1 Apr 2004 17:40:33 +0200
Mime-Version: 1.0 (Apple Message framework v613)
Content-Type: text/plain;
	charset=US-ASCII;
	format=flowed
Message-Id: <E72431FD-83F2-11D8-9B10-0003935B5D9E [at] deis [dot] unibo.it>
Content-Transfer-Encoding: 7bit
Cc: Hisham Haddad <hhaddad [at] kennesaw [dot] edu>, Lorie Liebrock <liebrock [at] cs [dot] nmt.edu>,
   Roger Wainwright <rogerw [at] utulsa [dot] edu>
From: Andrea Omicini <aomicini [at] deis [dot] unibo.it>
Subject: Call for Track Proposals at the 20th ACM Symposium on Applied Computing (SAC 2005)
Date: Thu, 1 Apr 2004 17:40:29 +0200
To: Andrea Omicini <andrea.omicini [at] unibo [dot] it>
X-Mailer: Apple Mail (2.613)
X-OriginalArrivalTime: 01 Apr 2004 15:40:33.0910 (UTC) FILETIME=[ABC48960:01C417FF]
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

======================================================
   (Apologies if you receive this more than once)
======================================================

                 CALL FOR TRACK PROPOSALS

The 20th ACM Symposium on Applied Computing (SAC 2005)
March 13 - 17, 2005, Santa Fe, New Mexico, USA

For the past nineteen years the ACM Symposium on Applied Computing (SAC)
has been a primary and international forum for applied computer
scientists, computer engineers and application developers to gather,
interact and present their work. The ACM Special Interest Group on
Applied Computing  (SIGAPP) is the sole sponsor of SAC.
The conference proceedings are published by ACM and are also available
online through ACM's Digital Library.

SAC is based on a flexible structure of mostly self-contained and
self-managed tracks. Over the past years SAC hosted tracks on a
variety of timely topics such as Artificial Intelligence, 
Bioinformatics,
Computational Sciences, Database Technology, Data Mining, Embedded 
Systems,
Evolutionary Computing, Parallel and Distributed Systems,
Mobile Computing, Programming Languages, Software Engineering,
and Web Technologies. SAC 2004, which was held in Nicosia, Cyprus,
consisted of 26 tracks that hosted 268 accepted papers out of 780
submissions. More information on past SAC events can be found at
http://www.acm.org/conferences/sac/

The 20th Annual SAC (SAC 2005) will be held 13-17 March, 2005 in
Santa Fe, New Mexico, USA, and hosted by New Mexico Institute of Mining
and Technology. The conference Steering Committee solicits proposals
for organizing and hosting tracks. Perspective track chairs should
submit an up to two pages description for organizing a track, which
should include at least the following items:

1) The proposed title for the track with a description of its aims,
topics it will cover and rationale for having such a track in SAC.
This rationale should refer to any related conference events that
are held regularly and why the proposed track differs from them or
complements them. The proposed track should not be overly general
but also not overly specialized, thus being able to attract a wide
audience of people sharing similar interests. Proposals from industry
are also welcomed. Despite its name, SAC also welcomes topics of
mostly theoretical nature, provided there is clear practical potential
in applying the results of such work.

2) A short description of the activities the track chair will
undertake upon acceptance of the proposal, to disseminate the
call-for-papers for his/her track, manage the review process and
collect final materials from authors of accepted papers. (Specific
guidelines to track chairs regarding these issues will also be 
provided.)

3) A short CV of the perspective track chair(s) with reference to
research interests and publication record directly related to the
themes of the proposed track, and any previous experience of involvement
in the organization of similar events (in the interest of brevity,
reference to a personal web page where such information can be found
will be sufficient).

All proposals will be reviewed by the Program Chairs with
respect to the above criteria. The Program Chairs reserve the right to:
(1) accept a proposal as is,
(2) require modifications before acceptance,
(3) recommend merging of similar proposals with a considerable
overlap in the topics addressed (in this case the track chairs of
the different proposals will be asked to form a single chair),
(4) reject a proposal. Upon acceptance of a proposal, the track
chairs will be notified of their responsibilities in managing the
affairs of their tracks; as such responsibilities are defined by
both the ACM and SAC conference rules. The Program Chairs reserve
the right to cancel at any time a track, if these responsibilities
are not addressed adequately by the track chair(s).

Please submit your proposal electronically in any acceptable
readable form by April 16, 2004 to:

Roger L. Wainwright,
SAC 2005 Program Co-Chair
University of Tulsa
Tulsa, Oklahoma, USA
mailto:rogerw [at] utulsa [dot] edu

From owner-reliable_computing [at] interval [dot] louisiana.edu Sat Apr  3 01:13:04 2004
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id i337D3k09683
	for reliable_computing-outgoing; Sat, 3 Apr 2004 01:13:03 -0600 (CST)
Received: from mail.comset.net (mail.comset.net [213.172.0.3])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id i337Cr509675
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sat, 3 Apr 2004 01:12:54 -0600 (CST)
Received: from [213.172.8.63] (helo=e0gumi46)
	by mail.comset.net with smtp (Exim 3.33 #1)
	id 1B9fPT-0004uX-00
	for reliable_computing [at] interval [dot] louisiana.edu; Sat, 03 Apr 2004 11:17:43 +0400
Message-ID: <00d801c4194a$e39e6760$1708acd5 [at] wplus [dot] net>
From: "Vyacheslav Nesterov" <slnest [at] comset [dot] net>
To: "RC mailing list" <reliable_computing [at] interval [dot] louisiana.edu>
Subject: Reliable Computing, Vol. 10, issue 5, 2004
Date: Sat, 3 Apr 2004 11:10:16 +0400
MIME-Version: 1.0
Content-Type: multipart/alternative;
	boundary="----=_NextPart_000_00C7_01C4196C.3DF75C00"
X-Priority: 3
X-MSMail-Priority: Normal
X-Mailer: Microsoft Outlook Express 5.00.2615.200
X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2615.200
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

This is a multi-part message in MIME format.

------=_NextPart_000_00C7_01C4196C.3DF75C00
Content-Type: text/plain;
	charset="koi8-r"
Content-Transfer-Encoding: quoted-printable

              Reliable Computing
            Volume 10, issue 5, 2004

Special Issue on Interval Analysis and Fuzzy Sets
Guest Editor: Weldon A. Lodwick

Modeling Uncertain Sparse Data with Fuzzy B-splines
Angelo Marcello Anile, Salvatore Spinella
335-355

Fuzzy Linear Programming with Interactive Uncertain Parameters
Masahiro Inuiguchi, Tetsuzo Tanino
357-367

Application of Functional Intervals to the Response Evaluation of
Linear Time-Invariant Systems with Fuzzy Input
Jorge Bondia, Jesus Pico=20
369-387

Solutions for the Portfolio Selection Problem with
Interval and Fuzzy Coefficients
Masaaki Ida
389-400

Eliminating Duplicates under Interval and Fuzzy Uncertainty:
An Asymptotically Optimal Algorithm and Its Geospatial Applications
Roberto Torres, G. Randy Keller, Vladik Kreinovich, Luc Longpre, Scott =
A. Starks
401-422



------=_NextPart_000_00C7_01C4196C.3DF75C00
Content-Type: text/html;
	charset="koi8-r"
Content-Transfer-Encoding: quoted-printable

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD>
<META content=3D"text/html; charset=3Dkoi8-r" http-equiv=3DContent-Type>
<META content=3D"MSHTML 5.00.2614.3500" name=3DGENERATOR>
<STYLE></STYLE>
</HEAD>
<BODY bgColor=3D#ffffff>
<DIV><FONT face=3D"Arial Cyr"=20
size=3D2>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbs=
p;&nbsp;&nbsp;=20
Reliable=20
Computing<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=
&nbsp;=20
Volume 10, issue 5, 2004</FONT></DIV>
<DIV>&nbsp;</DIV>
<DIV><FONT face=3D"Arial Cyr" size=3D2>Special Issue on Interval =
Analysis and Fuzzy=20
Sets<BR>Guest Editor: Weldon A. Lodwick</FONT></DIV>
<DIV>&nbsp;</DIV>
<DIV><FONT face=3D"Arial Cyr" size=3D2>Modeling Uncertain Sparse Data =
with Fuzzy=20
B-splines<BR>Angelo Marcello Anile, Salvatore =
Spinella<BR>335-355</FONT></DIV>
<DIV>&nbsp;</DIV>
<DIV><FONT face=3D"Arial Cyr" size=3D2>Fuzzy Linear Programming with =
Interactive=20
Uncertain Parameters<BR>Masahiro Inuiguchi, Tetsuzo=20
Tanino<BR>357-367</FONT></DIV>
<DIV>&nbsp;</DIV>
<DIV><FONT face=3D"Arial Cyr" size=3D2>Application of Functional =
Intervals to the=20
Response Evaluation of<BR>Linear Time-Invariant Systems with Fuzzy=20
Input<BR>Jorge Bondia, Jesus Pico <BR>369-387</FONT></DIV>
<DIV>&nbsp;</DIV>
<DIV><FONT face=3D"Arial Cyr" size=3D2>Solutions for the Portfolio =
Selection Problem=20
with<BR>Interval and Fuzzy Coefficients<BR>Masaaki =
Ida<BR>389-400</FONT></DIV>
<DIV>&nbsp;</DIV>
<DIV><FONT face=3D"Arial Cyr" size=3D2>Eliminating Duplicates under =
Interval and=20
Fuzzy Uncertainty:<BR>An Asymptotically Optimal Algorithm and Its =
Geospatial=20
Applications<BR>Roberto Torres, G. Randy Keller, Vladik Kreinovich, Luc =
Longpre,=20
Scott A. Starks<BR>401-422</FONT></DIV>
<DIV>&nbsp;</DIV>
<DIV>&nbsp;</DIV></BODY></HTML>

------=_NextPart_000_00C7_01C4196C.3DF75C00--


From owner-reliable_computing [at] interval [dot] louisiana.edu Sat Apr  3 01:13:11 2004
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id i337DAB09696
	for reliable_computing-outgoing; Sat, 3 Apr 2004 01:13:10 -0600 (CST)
Received: from mail.comset.net (mail.comset.net [213.172.0.3])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id i337Cs509676
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sat, 3 Apr 2004 01:12:55 -0600 (CST)
Received: from [213.172.8.63] (helo=e0gumi46)
	by mail.comset.net with smtp (Exim 3.33 #1)
	id 1B9fPR-0004uX-00
	for reliable_computing [at] interval [dot] louisiana.edu; Sat, 03 Apr 2004 11:17:42 +0400
Message-ID: <00d701c4194a$e2d4fce0$1708acd5 [at] wplus [dot] net>
From: "Vyacheslav Nesterov" <slnest [at] comset [dot] net>
To: "RC mailing list" <reliable_computing [at] interval [dot] louisiana.edu>
Subject: Reliable Computing, Vol. 10, issue 4, 2004
Date: Sat, 3 Apr 2004 11:09:09 +0400
MIME-Version: 1.0
Content-Type: multipart/alternative;
	boundary="----=_NextPart_000_00C0_01C4196C.16173AC0"
X-Priority: 3
X-MSMail-Priority: Normal
X-Mailer: Microsoft Outlook Express 5.00.2615.200
X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2615.200
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

This is a multi-part message in MIME format.

------=_NextPart_000_00C0_01C4196C.16173AC0
Content-Type: text/plain;
	charset="koi8-r"
Content-Transfer-Encoding: quoted-printable

              Reliable Computing
            Volume 10, issue 4, 2004

Special Issue on Interval Analysis and Fuzzy Sets
Guest Editor: Weldon A. Lodwick

Introduction
247-248

Clouds, Fuzzy Sets, and Probability Intervals
Arnold Neumaier
249-272

Probability-Possibility Transformations, Triangular Fuzzy Sets, and
Probabilistic Inequalities
Didier Dubois, Laurent Foulloy, Gilles Mauris, Henri Prade
273-297

Characterization of Interval Fuzzy Logic Systems of Connectives by
Group Transformations
Ladislav J. Kohout, Eunjin Kim
299-334


------=_NextPart_000_00C0_01C4196C.16173AC0
Content-Type: text/html;
	charset="koi8-r"
Content-Transfer-Encoding: quoted-printable

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD>
<META content=3D"text/html; charset=3Dkoi8-r" http-equiv=3DContent-Type>
<META content=3D"MSHTML 5.00.2614.3500" name=3DGENERATOR>
<STYLE></STYLE>
</HEAD>
<BODY bgColor=3D#ffffff>
<DIV><FONT face=3D"Arial Cyr"=20
size=3D2>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbs=
p;&nbsp;&nbsp;=20
Reliable=20
Computing<BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=
&nbsp;=20
Volume 10, issue 4, 2004</FONT></DIV>
<DIV>&nbsp;</DIV>
<DIV><FONT face=3D"Arial Cyr" size=3D2>Special Issue on Interval =
Analysis and Fuzzy=20
Sets<BR>Guest Editor: Weldon A. Lodwick</FONT></DIV>
<DIV>&nbsp;</DIV>
<DIV><FONT face=3D"Arial Cyr" =
size=3D2>Introduction<BR>247-248</FONT></DIV>
<DIV>&nbsp;</DIV>
<DIV><FONT face=3D"Arial Cyr" size=3D2>Clouds, Fuzzy Sets, and =
Probability=20
Intervals<BR>Arnold Neumaier<BR>249-272</FONT></DIV>
<DIV>&nbsp;</DIV>
<DIV><FONT face=3D"Arial Cyr" size=3D2>Probability-Possibility =
Transformations,=20
Triangular Fuzzy Sets, and<BR>Probabilistic Inequalities<BR>Didier =
Dubois,=20
Laurent Foulloy, Gilles Mauris, Henri Prade<BR>273-297</FONT></DIV>
<DIV>&nbsp;</DIV>
<DIV><FONT face=3D"Arial Cyr" size=3D2>Characterization of Interval =
Fuzzy Logic=20
Systems of Connectives by<BR>Group Transformations<BR>Ladislav J. =
Kohout, Eunjin=20
Kim<BR>299-334<BR></FONT></DIV></BODY></HTML>

------=_NextPart_000_00C0_01C4196C.16173AC0--


From owner-reliable_computing [at] interval [dot] louisiana.edu Sat Apr  3 16:09:25 2004
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id i33M9P810695
	for reliable_computing-outgoing; Sat, 3 Apr 2004 16:09:25 -0600 (CST)
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.3) with ESMTP id i33M9K510691
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sat, 3 Apr 2004 16:09:20 -0600 (CST)
Received: from aragorn (aragorn [129.108.5.35])
	by cs.utep.edu (8.11.7/8.11.7) with SMTP id i33M9Al11143;
	Sat, 3 Apr 2004 15:09:13 -0700 (MST)
Message-Id: <200404032209.i33M9Al11143 [at] cs [dot] utep.edu>
Date: Sat, 3 Apr 2004 15:09:09 -0700 (MST)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: Call for Track Proposals at the 20th ACM Symposium on Applied Computing (SAC 2005)
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: +i5zAtnoFkr7U0CMXGknSA==
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

any interest in having an interval session? 

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

Mime-Version: 1.0 (Apple Message framework v613)
Content-Transfer-Encoding: 7bit
Cc: Hisham Haddad <hhaddad [at] kennesaw [dot] edu>, Lorie Liebrock <liebrock [at] cs [dot] nmt.edu>, 
Roger Wainwright <rogerw [at] utulsa [dot] edu>
From: Andrea Omicini <aomicini [at] deis [dot] unibo.it>
Subject: Call for Track Proposals at the 20th ACM Symposium on Applied 
Computing (SAC 2005)
Date: Thu, 1 Apr 2004 17:40:29 +0200
To: Andrea Omicini <andrea.omicini [at] unibo [dot] it>
X-OriginalArrivalTime: 01 Apr 2004 15:40:33.0910 (UTC) 
FILETIME=[ABC48960:01C417FF]

======================================================
   (Apologies if you receive this more than once)
======================================================

                 CALL FOR TRACK PROPOSALS

The 20th ACM Symposium on Applied Computing (SAC 2005)
March 13 - 17, 2005, Santa Fe, New Mexico, USA

For the past nineteen years the ACM Symposium on Applied Computing (SAC)
has been a primary and international forum for applied computer
scientists, computer engineers and application developers to gather,
interact and present their work. The ACM Special Interest Group on
Applied Computing  (SIGAPP) is the sole sponsor of SAC.
The conference proceedings are published by ACM and are also available
online through ACM's Digital Library.

SAC is based on a flexible structure of mostly self-contained and
self-managed tracks. Over the past years SAC hosted tracks on a
variety of timely topics such as Artificial Intelligence, 
Bioinformatics,
Computational Sciences, Database Technology, Data Mining, Embedded 
Systems,
Evolutionary Computing, Parallel and Distributed Systems,
Mobile Computing, Programming Languages, Software Engineering,
and Web Technologies. SAC 2004, which was held in Nicosia, Cyprus,
consisted of 26 tracks that hosted 268 accepted papers out of 780
submissions. More information on past SAC events can be found at
http://www.acm.org/conferences/sac/

The 20th Annual SAC (SAC 2005) will be held 13-17 March, 2005 in
Santa Fe, New Mexico, USA, and hosted by New Mexico Institute of Mining
and Technology. The conference Steering Committee solicits proposals
for organizing and hosting tracks. Perspective track chairs should
submit an up to two pages description for organizing a track, which
should include at least the following items:

1) The proposed title for the track with a description of its aims,
topics it will cover and rationale for having such a track in SAC.
This rationale should refer to any related conference events that
are held regularly and why the proposed track differs from them or
complements them. The proposed track should not be overly general
but also not overly specialized, thus being able to attract a wide
audience of people sharing similar interests. Proposals from industry
are also welcomed. Despite its name, SAC also welcomes topics of
mostly theoretical nature, provided there is clear practical potential
in applying the results of such work.

2) A short description of the activities the track chair will
undertake upon acceptance of the proposal, to disseminate the
call-for-papers for his/her track, manage the review process and
collect final materials from authors of accepted papers. (Specific
guidelines to track chairs regarding these issues will also be 
provided.)

3) A short CV of the perspective track chair(s) with reference to
research interests and publication record directly related to the
themes of the proposed track, and any previous experience of involvement
in the organization of similar events (in the interest of brevity,
reference to a personal web page where such information can be found
will be sufficient).

All proposals will be reviewed by the Program Chairs with
respect to the above criteria. The Program Chairs reserve the right to:
(1) accept a proposal as is,
(2) require modifications before acceptance,
(3) recommend merging of similar proposals with a considerable
overlap in the topics addressed (in this case the track chairs of
the different proposals will be asked to form a single chair),
(4) reject a proposal. Upon acceptance of a proposal, the track
chairs will be notified of their responsibilities in managing the
affairs of their tracks; as such responsibilities are defined by
both the ACM and SAC conference rules. The Program Chairs reserve
the right to cancel at any time a track, if these responsibilities
are not addressed adequately by the track chair(s).

Please submit your proposal electronically in any acceptable
readable form by April 16, 2004 to:

Roger L. Wainwright,
SAC 2005 Program Co-Chair
University of Tulsa
Tulsa, Oklahoma, USA
mailto:rogerw [at] utulsa [dot] edu

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



From owner-reliable_computing [at] interval [dot] louisiana.edu Sun Apr  4 10:34:38 2004
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id i34FYb612113
	for reliable_computing-outgoing; Sun, 4 Apr 2004 10:34:37 -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.3) with ESMTP id i34FYU512109
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 4 Apr 2004 10:34:31 -0500 (CDT)
Received: from aragorn (aragorn [129.108.5.35])
	by cs.utep.edu (8.11.7/8.11.7) with SMTP id i34FYJi02241
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 4 Apr 2004 09:34:21 -0600 (MDT)
Message-Id: <200404041534.i34FYJi02241 [at] cs [dot] utep.edu>
Date: Sun, 4 Apr 2004 09:34:21 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: ACM IEEE fellows ?
To: reliable_computing [at] interval [dot] louisiana.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: qfYbGluREWcmwex9sbcgTQ==
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, 

At Computer Science and Eletrical Engineering departments, there is a tendency 
lately to ask candidates to suggest lists of potential reviewers who are ACM or 
IEEE Fellows or at least department chairs (preferable at good schools). 

It is therefore desirable to keep track of those Fellows who are either doing 
research in intervals, or at least who are familiar with interval-related 
research and who are willing to review interval applicants. 

If any person on this list is an ACM or IEEE Fellow and/or a chair and is 
willing to serve as potential reviewer please let us know, we can start a list. 

If you know of anyone who is an ACM or IEEE fellow and who is willing to review 
interval applicants let us know. 

Dan Berleant and myself will try to make a list. 

Vladik




From owner-reliable_computing [at] interval [dot] louisiana.edu Sun Apr  4 11:39:44 2004
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id i34GdhO12268
	for reliable_computing-outgoing; Sun, 4 Apr 2004 11:39:43 -0500 (CDT)
Received: from mailhub-3.iastate.edu (mailhub-3.iastate.edu [129.186.140.13])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id i34Gdc512264
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 4 Apr 2004 11:39:38 -0500 (CDT)
Received: from mailout-1.iastate.edu (mailout-1.iastate.edu [129.186.140.1])
	by mailhub-3.iastate.edu (8.12.10/8.12.10) with SMTP id i34GdLJs007282;
	Sun, 4 Apr 2004 11:39:23 -0500
Received: from myles.eng.iastate.edu(129.186.23.96) by mailout-1.iastate.edu via csmap 
	 id 26083f68_8656_11d8_982a_00304811d932_27891;
	Sun, 04 Apr 2004 16:35:58 +0000 (UTC)
Received: from dq.engr.iastate.edu ([129.186.5.76]) by myles.eng.iastate.edu with Microsoft SMTPSVC(5.0.2195.6713);
	 Sun, 4 Apr 2004 11:38:17 -0500
content-class: urn:content-classes:message
MIME-Version: 1.0
Content-Type: text/plain;
	charset="US-ASCII"
X-MimeOLE: Produced By Microsoft Exchange V6.0.6249.0
Subject: RE: ACM IEEE fellows ?
Date: Sun, 4 Apr 2004 11:38:17 -0500
Message-ID: <D8F193CE6B861649985140733ECDCC6582B936 [at] dq [dot] ece.iastate.edu>
X-MS-Has-Attach: 
X-MS-TNEF-Correlator: 
Thread-Topic: ACM IEEE fellows ?
Thread-Index: AcQaYBk5J0TZsXObS6OparCmlBqakwAApLMg
From: "Berleant, Dan" <berleant [at] iastate [dot] edu>
To: "Vladik Kreinovich" <vladik [at] cs [dot] utep.edu>,
   <reliable_computing [at] interval [dot] louisiana.edu>
X-OriginalArrivalTime: 04 Apr 2004 16:38:17.0463 (UTC) FILETIME=[3B720870:01C41A63]
Content-Transfer-Encoding: 8bit
X-MIME-Autoconverted: from quoted-printable to 8bit by interval.louisiana.edu id i34Gdd512265
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

Dear Colleagues,
  If you are a Fellow of *any* professional organization, please let us
know. No need to limit it to IEEE or ACM by any means.

Regards,

DB


-----Original Message-----
From: Vladik Kreinovich [mailto:vladik [at] cs [dot] utep.edu] 
Sent: Sunday, April 04, 2004 9:34 AM
To: reliable_computing [at] interval [dot] louisiana.edu
Subject: ACM IEEE fellows ?


Dear Friends, 

At Computer Science and Eletrical Engineering departments, there is a
tendency lately to ask candidates to suggest lists of potential
reviewers who are ACM or IEEE Fellows or at least department chairs
(preferable at good schools). 

It is therefore desirable to keep track of those Fellows who are either
doing research in intervals, or at least who are familiar with
interval-related research and who are willing to review interval
applicants. 

If any person on this list is an ACM or IEEE Fellow and/or a chair and
is willing to serve as potential reviewer please let us know, we can
start a list. 

If you know of anyone who is an ACM or IEEE fellow and who is willing to
review interval applicants let us know. 

Dan Berleant and myself will try to make a list. 

Vladik





From owner-reliable_computing [at] interval [dot] louisiana.edu Sun Apr  4 12:18:30 2004
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id i34HIUk12387
	for reliable_computing-outgoing; Sun, 4 Apr 2004 12:18:30 -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.3) with ESMTP id i34HIP512383
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 4 Apr 2004 12:18:25 -0500 (CDT)
Received: from aragorn (aragorn [129.108.5.35])
	by cs.utep.edu (8.11.7/8.11.7) with SMTP id i34HIIF02843;
	Sun, 4 Apr 2004 11:18:18 -0600 (MDT)
Message-Id: <200404041718.i34HIIF02843 [at] cs [dot] utep.edu>
Date: Sun, 4 Apr 2004 11:18:20 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: Fellows: P.S.
To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu
Cc: berleant [at] iastate [dot] edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: FPo0HpK++M0PfYlQa/mgSw==
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, Thanks to all who replied! 

Dan and I are placing the Fellows info on the Personalia part of the interval 
computations website http://www.cs.utep.edu/icpersons.html 

Since Fellows list are usually publicly and proudly available, we hope it is 
OK. 

It also boosts the status of our research if someone browsing sees these big 
names. 

Vladik


From owner-reliable_computing [at] interval [dot] louisiana.edu Sun Apr  4 12:27:13 2004
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id i34HRDK12520
	for reliable_computing-outgoing; Sun, 4 Apr 2004 12:27:13 -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.3) with ESMTP id i34HR7512516
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 4 Apr 2004 12:27:08 -0500 (CDT)
Received: from aragorn (aragorn [129.108.5.35])
	by cs.utep.edu (8.11.7/8.11.7) with SMTP id i34HR1q02920;
	Sun, 4 Apr 2004 11:27:01 -0600 (MDT)
Message-Id: <200404041727.i34HR1q02920 [at] cs [dot] utep.edu>
Date: Sun, 4 Apr 2004 11:27:02 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: Re: Fellows: P.S.
To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu,
   vladik [at] cs [dot] utep.edu
Cc: berleant [at] iastate [dot] edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: UJMHHZP1VxH/PunSA86LjA==
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

Oops, correction: URL is http://www.cs.utep.edu/interval-comp/icpersons.html

> Date: Sun, 4 Apr 2004 11:18:20 -0600 (MDT)
> From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
> Subject: Fellows: P.S.
> To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu
> Cc: berleant [at] iastate [dot] edu
> MIME-Version: 1.0
> Content-MD5: FPo0HpK++M0PfYlQa/mgSw==
> 
> Dear Friends, Thanks to all who replied! 
> 
> Dan and I are placing the Fellows info on the Personalia part of the interval 
> computations website http://www.cs.utep.edu/icpersons.html 
> 
> Since Fellows list are usually publicly and proudly available, we hope it is 
> OK. 
> 
> It also boosts the status of our research if someone browsing sees these big 
> names. 
> 
> Vladik


From owner-reliable_computing [at] interval [dot] louisiana.edu Sun Apr  4 12:36:45 2004
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id i34HaiB12623
	for reliable_computing-outgoing; Sun, 4 Apr 2004 12:36:44 -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.3) with ESMTP id i34Hac512617
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 4 Apr 2004 12:36:39 -0500 (CDT)
Received: from aragorn (aragorn [129.108.5.35])
	by cs.utep.edu (8.11.7/8.11.7) with SMTP id i34HaWv02990;
	Sun, 4 Apr 2004 11:36:32 -0600 (MDT)
Message-Id: <200404041736.i34HaWv02990 [at] cs [dot] utep.edu>
Date: Sun, 4 Apr 2004 11:36:33 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: Call for Track Proposals at the 20th ACM Symposium on Applied  Computing (SAC 2005)
To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu
Cc: martineceberio [at] yahoo [dot] com, mceberio [at] cs [dot] utep.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: 0gJzXxWRct9Pv7jqGAYNRQ==
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,

Martine Ceberio (she is currently in Japan) volunteered to take a lead in doing 
all the hard work of organizing an interval session. Thanks a lot! 

We will prepare the proposal ASAP (deadline is April 16). 

Since the deadline is soon, please send your ideas and potential topics to her 
at mceberio [at] cs [dot] utep.edu and martineceberio [at] yahoo [dot] com (copy to me) ASAP. 

Santa Fe is a very nice place to visit, and we have a chance to make a good 
presentation to the applied computing community. 

For details about the March 2005 meeting, please see the link at the 
Forthcoming Conference part of the interval computations website 
http://www.cs.utep.edu/interval-comp

Vladik

P.S. Chenyi Hu raised the issue that a title should be attractive, and interval 
computations sounds too narrow (although we know it is not). Any suggestions 
are welcome. 

Applied Computing with Uncertainty - good but maybe too wide 

computations with guaranteed results -maybe too boring? 





From owner-reliable_computing [at] interval [dot] louisiana.edu Sun Apr  4 12:46:34 2004
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id i34HkXj12721
	for reliable_computing-outgoing; Sun, 4 Apr 2004 12:46:33 -0500 (CDT)
Received: from ms-smtp-01-eri0.ohiordc.rr.com (ms-smtp-01-smtplb.ohiordc.rr.com [65.24.5.135])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id i34HkR512717
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 4 Apr 2004 12:46:27 -0500 (CDT)
Received: from Moore (wor226164.columbus.rr.com [204.210.226.164])
	by ms-smtp-01-eri0.ohiordc.rr.com (8.12.10/8.12.7) with SMTP id i34HkHMW002280;
	Sun, 4 Apr 2004 13:46:19 -0400 (EDT)
Message-ID: <000c01c41a6c$b2cbd730$1702a8c0@Moore>
From: "Ray Moore" <rmoore17 [at] columbus [dot] rr.com>
To: "Vladik Kreinovich" <vladik [at] cs [dot] utep.edu>,
   <reliable_computing [at] interval [dot] louisiana.edu>, <interval [at] cs [dot] utep.edu>
Cc: <martineceberio [at] yahoo [dot] com>, <mceberio [at] cs [dot] utep.edu>
References: <200404041736.i34HaWv02990 [at] cs [dot] utep.edu>
Subject: Re: Call for Track Proposals at the 20th ACM Symposium on Applied Computing (SAC 2005)
Date: Sun, 4 Apr 2004 13:46:02 -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 6.00.2800.1158
X-MIMEOLE: Produced By Microsoft MimeOLE V6.00.2800.1165
X-Virus-Scanned: Symantec AntiVirus Scan Engine
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

Well, isn't "Reliable Computing" OK for a title?
R.M.

----- Original Message ----- 
From: "Vladik Kreinovich" <vladik [at] cs [dot] utep.edu>
To: <reliable_computing [at] interval [dot] louisiana.edu>; <interval [at] cs [dot] utep.edu>
Cc: <martineceberio [at] yahoo [dot] com>; <mceberio [at] cs [dot] utep.edu>
Sent: Sunday, April 04, 2004 1:36 PM
Subject: Call for Track Proposals at the 20th ACM Symposium on Applied
Computing (SAC 2005)


> Dear Friends,
>
> Martine Ceberio (she is currently in Japan) volunteered to take a lead in
doing
> all the hard work of organizing an interval session. Thanks a lot!
>
> We will prepare the proposal ASAP (deadline is April 16).
>
> Since the deadline is soon, please send your ideas and potential topics to
her
> at mceberio [at] cs [dot] utep.edu and martineceberio [at] yahoo [dot] com (copy to me) ASAP.
>
> Santa Fe is a very nice place to visit, and we have a chance to make a
good
> presentation to the applied computing community.
>
> For details about the March 2005 meeting, please see the link at the
> Forthcoming Conference part of the interval computations website
> http://www.cs.utep.edu/interval-comp
>
> Vladik
>
> P.S. Chenyi Hu raised the issue that a title should be attractive, and
interval
> computations sounds too narrow (although we know it is not). Any
suggestions
> are welcome.
>
> Applied Computing with Uncertainty - good but maybe too wide
>
> computations with guaranteed results -maybe too boring?
>
>
>
>
>



From owner-reliable_computing [at] interval [dot] louisiana.edu Sun Apr  4 12:51:24 2004
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id i34HpOR12817
	for reliable_computing-outgoing; Sun, 4 Apr 2004 12:51:24 -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.3) with ESMTP id i34HpH512813
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 4 Apr 2004 12:51:18 -0500 (CDT)
Received: from aragorn (aragorn [129.108.5.35])
	by cs.utep.edu (8.11.7/8.11.7) with SMTP id i34HpBo03095;
	Sun, 4 Apr 2004 11:51:11 -0600 (MDT)
Message-Id: <200404041751.i34HpBo03095 [at] cs [dot] utep.edu>
Date: Sun, 4 Apr 2004 11:51:12 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: Re: Call for Track Proposals at the 20th ACM Symposium on Applied Computing (SAC 2005)
To: vladik [at] cs [dot] utep.edu, reliable_computing [at] interval [dot] louisiana.edu,
   interval [at] cs [dot] utep.edu, rmoore17 [at] columbus [dot] rr.com
Cc: martineceberio [at] yahoo [dot] com, mceberio [at] cs [dot] utep.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: 6zXtW7z1sShVilajqRrZmA==
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 Ray, Thanks for a very good suggestion. 

Minor point: we had this discussion when the journal was renamed, and one point 
was that there is a trend in computing on how to make results of computations 
more reliable when performed on not 100% reliable components, something that 
people are interested in since John von Neumann himself and something that is 
very similar to reliability engineering. This purely probabilistic area of 
research is also called relaible computing, and this is not what we are 
interested in. 

For the journal, we take care of this by a subtitle. Maybe witha  similar 
subtitle, we can do it. 

Vladik

> From: "Ray Moore" <rmoore17 [at] columbus [dot] rr.com>
> To: "Vladik Kreinovich" <vladik [at] cs [dot] utep.edu>, 
<reliable_computing [at] interval [dot] louisiana.edu>, <interval [at] cs [dot] utep.edu>
> Cc: <martineceberio [at] yahoo [dot] com>, <mceberio [at] cs [dot] utep.edu>
> Subject: Re: Call for Track Proposals at the 20th ACM Symposium on Applied 
Computing (SAC 2005)
> Date: Sun, 4 Apr 2004 13:46:02 -0400
> MIME-Version: 1.0
> Content-Transfer-Encoding: 7bit
> X-Priority: 3
> X-MSMail-Priority: Normal
> X-MIMEOLE: Produced By Microsoft MimeOLE V6.00.2800.1165
> X-Virus-Scanned: Symantec AntiVirus Scan Engine
> 
> Well, isn't "Reliable Computing" OK for a title?
> R.M.
> 
> ----- Original Message ----- 
> From: "Vladik Kreinovich" <vladik [at] cs [dot] utep.edu>
> To: <reliable_computing [at] interval [dot] louisiana.edu>; <interval [at] cs [dot] utep.edu>
> Cc: <martineceberio [at] yahoo [dot] com>; <mceberio [at] cs [dot] utep.edu>
> Sent: Sunday, April 04, 2004 1:36 PM
> Subject: Call for Track Proposals at the 20th ACM Symposium on Applied
> Computing (SAC 2005)
> 
> 
> > Dear Friends,
> >
> > Martine Ceberio (she is currently in Japan) volunteered to take a lead in
> doing
> > all the hard work of organizing an interval session. Thanks a lot!
> >
> > We will prepare the proposal ASAP (deadline is April 16).
> >
> > Since the deadline is soon, please send your ideas and potential topics to
> her
> > at mceberio [at] cs [dot] utep.edu and martineceberio [at] yahoo [dot] com (copy to me) ASAP.
> >
> > Santa Fe is a very nice place to visit, and we have a chance to make a
> good
> > presentation to the applied computing community.
> >
> > For details about the March 2005 meeting, please see the link at the
> > Forthcoming Conference part of the interval computations website
> > http://www.cs.utep.edu/interval-comp
> >
> > Vladik
> >
> > P.S. Chenyi Hu raised the issue that a title should be attractive, and
> interval
> > computations sounds too narrow (although we know it is not). Any
> suggestions
> > are welcome.
> >
> > Applied Computing with Uncertainty - good but maybe too wide
> >
> > computations with guaranteed results -maybe too boring?
> >
> >
> >
> >
> >
> 


From owner-reliable_computing [at] interval [dot] louisiana.edu Sun Apr  4 16:18:22 2004
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id i34LILg12961
	for reliable_computing-outgoing; Sun, 4 Apr 2004 16:18: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.3) with ESMTP id i34LIF512957
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 4 Apr 2004 16:18:15 -0500 (CDT)
Received: from aragorn (aragorn [129.108.5.35])
	by cs.utep.edu (8.11.7/8.11.7) with SMTP id i34LI7N04435;
	Sun, 4 Apr 2004 15:18:07 -0600 (MDT)
Message-Id: <200404042118.i34LI7N04435 [at] cs [dot] utep.edu>
Date: Sun, 4 Apr 2004 15:18:10 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: Conference on Intelligent Technologies in Houston
To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu
Cc: hunguyen [at] nmsu [dot] edu, vladik [at] cs [dot] utep.edu, ralo [at] uh [dot] edu, pratit@s-t.au.ac.th
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: jMkjKQQSSnDYdMPvkUhSUA==
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, 

Please find enclosed Call for Papers for the intelligent technologies 
conference. 

Hung T. Nguyen and myself are also planning to organize a special session on 
Reliable Computing with Imprecise Data. 

The plan is to bring together researchers who are interested in processing 
imprecise data such as:

* interval-valued data (when we do not know the exact value of the observed 
quantity, only an interval of possible values), 

* set-valued observations, 

* fuzzy-valued observations (i.e., data points coming from expert estinmates),

etc. 
 
For many types of such imprecise data, there exist heuristic data processing 
techniques. We want to emphasize validated (justified) methods - and the need 
for such methods when they are not readily available.  

The immediate objective is to enhance reliability of data processing techniques 
by emphasizing theoretically justified methods. The ultimate objective is to 
enhance algorithms for processing such data and to encourage more and better 
applications. 

>From this viewpoint, we especially encourage application-related talks. 

If there is enough interest, we can have a special session with 
interval-related talks. 

If you are interested in participating in this session, please let us know 
ASAP. 

Hung and Vladik
hunguyen [at] nmsu [dot] edu vladik [at] cs [dot] utep.edu

*************************************************************************
International Conference on Intelligent Technologies Intech'04
Houston, Texas, December 2-4, 2004
 
Co-organized by: 
  Assumption University, Thailand
  University of Houston, Texas, USA 

General chair: Richard Alo (USA)

Honorary General Chairs:
  Hung T. Nguyen (USA)
  Pratit Santiprabhob (Thailand)

InTech'04 Programme
  InTech'04 will comprise of plenary sessions, oral and poster
  presentations, exhibitions and excursions. The events will be open
  to all participants. The main objectives of the conference are: 
* Bring together researchers and practitioners in order to exchange their
  ideas and discuss issues occurring when implementing intelligent and
  fuzzy technologies in real world environments. 
* Provide a forum for discussion of new research areas, results 
  and issues. 
* Encourage international research in intelligent and fuzzy 
  technologies.

Topics of Intech'04 include but not limited to 
* Mathematical Foundations of Intelligent Technologies
* Traditional Artificial Intelligence Techniques.
* Encourage international researches in intelligent and fuzzy
  technologies.

Proceedings
 Proceedings will be distributed to participants during the
conference. Selected, extended and revised papers from InTech'04 will
be published in a Special issue of the International Journal of
Advanced Computational Intelligence. 

Paper Submissions 
 Papers related to both theoretical and real-world applications in the
areas listed above are welcome. The maximum number of pages is 10
pages including all tables, figures and references. Over-length and
late submission papers will be rejected without review.
 
Important Dates 
* Full paper submission deadline   August 2, 2004
* Acceptance notification          September 13, 2004
* Camera-ready deadline            October 15, 2004
* Early-bird registration deadline October 15, 2004

Conference Fees 
  Early-bird registration (by November 1, 2004)
    General Participant     Student
      250 USD               150 USD 
  After November, 2004
    General Participant     Student
      300 USD               200 USD 
 
Information and Correspondence 

 Center for Computational Science, University of Houston-Downtown
 One Main Street, Suite 722 South, Houston, Texas, 77002, USA
 Tel: +1 713 221 8207, Fax: +1 713 226 5290 
 
 Faculty of Science and Technology, Assumption University
 Hua Mak, Bangkapi, Bankgok, 10240, Thailand
 Tel: +66 2719 1515, Fax: +66 2719 1639
 URL: http://www.s-t.au.ac.th/~intech/
 E-mail: intech@s-t.au.ac.th


 





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



From owner-reliable_computing [at] interval [dot] louisiana.edu Mon Apr  5 14:41:42 2004
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id i35Jfg014478
	for reliable_computing-outgoing; Mon, 5 Apr 2004 14:41:42 -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.3) with ESMTP id i35JfZ514474
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 5 Apr 2004 14:41:36 -0500 (CDT)
Received: from aragorn (aragorn [129.108.5.35])
	by cs.utep.edu (8.11.7/8.11.7) with SMTP id i35JfS014300;
	Mon, 5 Apr 2004 13:41:28 -0600 (MDT)
Message-Id: <200404051941.i35JfS014300 [at] cs [dot] utep.edu>
Date: Mon, 5 Apr 2004 13:41:27 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: P.S.: InTech'04
To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu
Cc: hunguyen [at] nmsu [dot] edu, ralo [at] uh [dot] edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: SjtZiEGsDpMjg1/0wTt0kg==
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


This is just FYI; our proposed special session 
Reliable Computing with Imprecise Data
for the 
International Conference on Intelligent Technologies Intech'04
Houston, Texas, December 2-4, 2004
http://www.s-t.au.ac.th/~intech/
has been officially approved. 

Please send in your papers to us! Deadline is August 2. 

Hung and Vladik


From owner-reliable_computing [at] interval [dot] louisiana.edu Wed Apr  7 23:34:04 2004
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id i384Y4017562
	for reliable_computing-outgoing; Wed, 7 Apr 2004 23:34:04 -0500 (CDT)
Received: from capricorn.l.math.kyushu-u.ac.jp (hidden-user [at] capricorn [dot] math.kyushu-u.ac.jp [133.5.165.1])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id i384Xu517558
	for <reliable_computing [at] interval [dot] louisiana.edu>; Wed, 7 Apr 2004 23:33:57 -0500 (CDT)
Received: from capricorn (capricorn [127.0.0.1])
	by capricorn.l.math.kyushu-u.ac.jp (Postfix) with ESMTP
	id 832E578085; Thu,  8 Apr 2004 13:32:09 +0900 (JST)
Received: from dhcp99.l.math.kyushu-u.ac.jp (172.24.16.99)
 by capricorn (F-Secure/virusgw_smtp/1.0/Sep 29 2003);
 Thu, 8 Apr 2004 13:32:09 +0900 (JST)
X-Virus-Status: clean
Message-ID: <003101c41d22$a20dbf40$631018ac@ibm03dtvn7b20r>
From: "Mitsuhiro Nakao" <mtnakao [at] math [dot] kyushu-u.ac.jp>
To: <reliable_computing [at] interval [dot] louisiana.edu>
Cc: "scan2004 [at] math [dot] kyushu-u.ac" <scan2004 [at] math [dot] kyushu-u.ac.jp>
Subject: deadline of abstract submission for SCAN2004
Date: Thu, 8 Apr 2004 13:33:25 +0900
MIME-Version: 1.0
Content-Type: text/plain;
	charset="iso-2022-jp"
Content-Transfer-Encoding: 7bit
X-Priority: 3
X-MSMail-Priority: Normal
X-Mailer: Microsoft Outlook Express 6.00.2800.1158
X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2800.1165
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

Dear Friends:

(Please accept our sincere apology if you received this message in duplicate
or already sent an abstract.)

Notice that the deadline of submission of the abstract for the conference
SCAN2004, October 4-8, 2004 is now only one week away, i.e., April 15.

Please refer the following URL and send an abstract immediately, if not yet.

http://scan2004.math.kyushu-u.ac.jp/abs.html

 Concerning your registration, since the detailed procedure for online
 registration will be opened in the middle of April, please register by
using the following site,

 http://scan2004.math.kyushu-u.ac.jp/reg.html

If you have any question, please make contact us anytime. We look forward to
seeing you here in Fukuoka.


With my best regards,

Conference Chairman:
 Mitsuhiro T. Nakao(Faculty of Mathematics)

Faculty of Mathematics
Kyushu University 33
Fukuoka 812-8581, Japan

Local Organizing committee:
Mitsuhiro T. Nakao(Faculty of Mathematics)
Masahisa Tabata(Faculty of Mathematics)
Seiji Fujino(Computing and Communications Center)
Kaori Nagatou(Faculty of Mathematics)
Yoshitaka Watanabe(Computing and Communications Center)

Coneference Secretary:
 Chiyoko Nakaoka
 Faculty of Mathematics
 Kyushu University 33
 Fukuoka 812-8581, Japan
 nakaokac [at] math [dot] kyushu-u.ac.jp


From owner-reliable_computing [at] interval [dot] louisiana.edu Fri Apr  9 14:05:19 2004
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id i39J5Io00720
	for reliable_computing-outgoing; Fri, 9 Apr 2004 14:05:18 -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.3) with ESMTP id i39J5E700716
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 9 Apr 2004 14:05:14 -0500 (CDT)
Received: from aragorn (aragorn [129.108.5.35])
	by cs.utep.edu (8.11.7/8.11.7) with SMTP id i39J58b03534;
	Fri, 9 Apr 2004 13:05:08 -0600 (MDT)
Message-Id: <200404091905.i39J58b03534 [at] cs [dot] utep.edu>
Date: Fri, 9 Apr 2004 13:05:09 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: Fellows sought: clarification
To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu
Cc: berleant [at] iastate [dot] edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: mvx6oMQsQISydkNiRvD2iA==
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, 

First, on behalf of Dan and myself, let me thank all who replied about their 
Fellow status and the Fellow status of their colleagues. 

Dan and I have added most of this information to the Personalia part of the 
interval computations website http://www.cs.utep.edu/interval-comp

The more we add, the more impressive it becomes, with the scope of different 
application areas. 

We also encountered a minor problem. Our email about Fellows caused some 
confusion among non-US participants of the mailing list. Let me therefore 
clarify the situation. 

We apologigize for the inconvenience. 

CLARIFICATION OF THE TERM "FELLOW". Most US-based research societies, like ACM 
or IEEE, have several degrees of membership. There is usually a regular 
membership for which anyone with a professional degree (like Ph.D. in this 
particular area) and/or professional experience like publications (for us in 
academe) are eligible. To join a socety, all you need to do is apply, pay fees, 
and sometimes get letters of recommendation from those who are members already. 

Within some of these organizations, there is an additional status often called 
Senior Member which is a recognition that a person contributed to the 
community.

The ultimate and rare recognition is a special status of a Fellow. Every year, 
a few dozen new fellows are selected by the societies and/or special interest 
groups and after a selection process, approved by some process involving the 
organization as a whole. 

Many other organizations have this special Fellow status, like American Society 
of Civil Engineers, American Association for Artificial Intelligence, etc. 

WHY WE LOOK FOR FELLOWS. In recent years, when considering tenure and promotion 
issues, many departments specifically look for Fellows as potential referees, 
the idea being that because of their prestigious status in the corresponding 
communities, they will provide a more reliable evaluation of the candidate. 

Getting the information on who is a Fellow is difficult, because while this is 
usually public knowledge, researchers are not (at least not always :-) in the 
habit of bragging around. Sometimes a Fellowship status is modestly marked on a 
researcher's webpage, but it is difficult to find all this information. 

We believe that collecting all this info on the Personalia part of the interval 
computations webiste will help interval folks who apply for tenure and 
promotion to give the list of possible referees to their chairs

PROBLEMS WITH THIS TERM. Dan and I realize now, after getting quite a few 
replies, that some non-US based organizations have a similar rare status but it 
is not called Fellow. 

Other organizations, in the US and abroad, have only this special 
invitation-only type membership. US examples include National Scademy of 
Sciences, National Academy of Engineering, other countries have similar 
Academies of Sciences. 

RELATED REQUEST. Both types of special memberships should be, in our opinion, 
included. 

Please send this info to us as well. 

COMMENT. If you are a Fellow of a known organization, then a name would 
suffice, a Google search usually produces enough info. 

On the other hand, if you are a Fellow (or equivalent) of an organization that 
we interval folks rarely encounter, and it is difficult to find the info about 
this organization on the web, please send us also the URL (if any) of this 
organization, we will place a link on the Perfsonalia webpage so that potential 
chairs will know where to look. 

If there is no webpage and the name is not self-evident (or in, say, German 
:-(), please send a very brief description of what this organization is about. 

Thanks a lot.

Vladik





From owner-reliable_computing [at] interval [dot] louisiana.edu Fri Apr  9 23:19:18 2004
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id i3A4JHo01182
	for reliable_computing-outgoing; Fri, 9 Apr 2004 23:19:17 -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.3) with ESMTP id i3A4JB701178
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 9 Apr 2004 23:19:11 -0500 (CDT)
Received: from aragorn (aragorn [129.108.5.35])
	by cs.utep.edu (8.11.7/8.11.7) with SMTP id i3A4J4T07888;
	Fri, 9 Apr 2004 22:19:04 -0600 (MDT)
Message-Id: <200404100419.i3A4J4T07888 [at] cs [dot] utep.edu>
Date: Fri, 9 Apr 2004 22:19:05 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: deadline of abstract submission for SCAN2004
To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu
Cc: mtnakao [at] math [dot] kyushu-u.ac.jp
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: Ep4+wv4mqhpaLmGdJSa+vA==
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

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


From: "Mitsuhiro Nakao" <mtnakao [at] math [dot] kyushu-u.ac.jp>

Dear Friends:

(Please accept our sincere apology if you received this message in duplicate
or already sent an abstract.)

Notice that the deadline of submission of abstract for the conference
SCAN2004, October 4-8, 2004 is now only one week away, i.e., April 15.

Please refer the following URL and send an abstract immediately, if not yet.

http://scan2004.math.kyushu-u.ac.jp/abs.html

 Concerning your registration, since the detailed procedure for online
 registration will be opened in the middle of April, please register by
using the following site,

 http://scan2004.math.kyushu-u.ac.jp/reg.html

If you have any question, please make contact us anytime. We look forward to
seeing you here in Fukuoka.


With my best regards,

Conference Chairman:
 Mitsuhiro T. Nakao(Faculty of Mathematics)

Faculty of Mathematics
Kyushu University 33
Fukuoka 812-8581, Japan

Local Organizing committee:
Mitsuhiro T. Nakao(Faculty of Mathematics)
Masahisa Tabata(Faculty of Mathematics)
Seiji Fujino(Computing and Communications Center)
Kaori Nagatou(Faculty of Mathematics)
Yoshitaka Watanabe(Computing and Communications Center)

Coneference Secretary:
 Chiyoko Nakaoka
 Faculty of Mathematics
 Kyushu University 33
 Fukuoka 812-8581, Japan
 nakaokac [at] math [dot] kyushu-u.ac.jp

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



From owner-reliable_computing [at] interval [dot] louisiana.edu Sat Apr 10 19:42:46 2004
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id i3B0gkj02443
	for reliable_computing-outgoing; Sat, 10 Apr 2004 19:42: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.3) with ESMTP id i3B0ge702439
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sat, 10 Apr 2004 19:42:40 -0500 (CDT)
Received: from aragorn (aragorn [129.108.5.35])
	by cs.utep.edu (8.11.7/8.11.7) with SMTP id i3B0gS214631;
	Sat, 10 Apr 2004 18:42:28 -0600 (MDT)
Message-Id: <200404110042.i3B0gS214631 [at] cs [dot] utep.edu>
Date: Sat, 10 Apr 2004 18:42:26 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: Broken link on interval languages page
To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu
Cc: berleant [at] iastate [dot] edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: 2CnhP0tsSiorg4mNd8aySQ==
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, 

If anyone knows the new location of CLP (BNR) please let Dan Berleant and 
myself know. 

I could not find it on Google, and the ALS webpage looks abandoned; it has not 
been revised since 2001, and the phone number listed on the page is no longer 
in service.

I would appreciate any help. 

Vladik

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

Date: Fri, 9 Apr 2004 15:29:04 -0400
From: David Wittenberg <dkw [at] cs [dot] brandeis.edu>


On http://www.cs.utep.edu/interval-comp/intlang.html (Languages for
Interval Analysis), there is a link for CLP(BNR) pointing to
<http://www.als.com/als/clpbnr/clp_info.html>   That link gives a file
not found error.  

-- 
--David Wittenberg
dkw [at] cs [dot] brandeis.edu

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



From owner-reliable_computing [at] interval [dot] louisiana.edu Sun Apr 11 11:00:12 2004
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id i3BG0BK03819
	for reliable_computing-outgoing; Sun, 11 Apr 2004 11:00:11 -0500 (CDT)
Received: (from rbk5287@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id i3BFxdt03806
	for reliable_computing [at] interval [dot] louisiana.edu; Sun, 11 Apr 2004 10:59:39 -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.3) with ESMTP id i39FlY700535
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 9 Apr 2004 10:47:34 -0500 (CDT)
Received: from ultra7.math.wisc.edu (ultra7.math.wisc.edu [144.92.166.188])
	by lcyoung.math.wisc.edu (8.11.6p2-20030921/8.11.6) with ESMTP id i39Fk9P02123;
	Fri, 9 Apr 2004 10:46:09 -0500 (CDT)
Date: Fri, 9 Apr 2004 10:46:09 -0500 (CDT)
From: Hans Schneider <hans [at] math [dot] wisc.edu>
To: NETS -- at-net <at-net-dl@uni-giessen.de>, E-LETTER <pmisra [at] cs [dot] wright.edu>,
   Pradeep Misra <pradeep.misra [at] wright [dot] edu>,
   Shaun Fallat <sfallat [at] MATH [dot] UREGINA.CA>,
   "na.digest" <na.digest@na-net.ornl.gov>, ipnet-digest [at] math [dot] msu.edu,
   Michael.Unser [at] epfl [dot] ch, SIAGLA-DIGEST <owner-siagla-digest [at] turing [dot] siam.org>,
   hjt [at] eos [dot] ncsu.edu, SMBnet [at] smb [dot] org, vkm [at] eedsp [dot] gatech.edu,
   reliable_computing [at] interval [dot] louisiana.edu
Subject: lAA contents
Message-ID: <Pine.GSO.4.10.10404091044570.25078-100000 [at] ultra7 [dot] math.wisc.edu>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
X-UWMath-MailScanner: Found to be clean
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

* Linear Algebra and its Applications
  Volume 382, (1 May 2004)
  http://www.sciencedirect.com/science/issue/5653-2004-996179999-493382

TABLE OF CONTENTS

Spectral problems for generalized Jacobi matrices, Pages 1-24
Maxim Derevyagin and Vladimir Derkach 

Uniformly symmetrizable 3 x 3 matrices, Pages 25-38
Lorenzo Mencherini  and Sergio Spagnolo 

About two trigonometric matrices, Pages 39-59
G. Molteni

Confluent polynomial Vandermonde-like matrices: displacement structures, inversion formulas and fast algorithm, Pages 61-82
Zheng-Hong Yang  and Yong-Jian Hu

On the solution space of discrete time AR-representations over a finite time horizon, Pages 83-116
N. P. Karampetakis 

Caratheodory Fejer interpolation in the ball with mixed derivatives, Pages 117-133
D. Alpay  and C. Dubi

Customizable triangular factorizations of matrices, Pages 135-154
Pengwei Hao 

Numerical range circumscribed by two polygons, Pages 155-170
Hwa-Long Gau  and Pei Yuan Wu 

Non-separating cocircuits in binary matroids, Pages 171-178
Manoel Lemos 

Groups of generalized Pascal matrices, Pages 179-194
Luis Verde-Star

Computing the automorphism group of a solvable Lie algebra, Pages 195-209
Bettina Eick 

Dispersion matrix in balanced mixed ANOVA models, Pages 211-219
Jiming Jiang

Isolated points of spectrum of (p,k)-quasihyponormal operators, Pages 221-229
Kotaro Tanahashi , Atsushi Uchiyama  and Muneo Ch

An elementary note on asymptotic properties of Toeplitz and multilevel Toeplitz matrices, Pages 231-235
William F. Trench 

Jordan elementary maps on rings, Pages 237-245
Pengtong Li  and Wu Jing

Burnside's theorem: irreducible pairs of transformations, Pages 247-269
W. E. Longstaff

A note on the structure of algebraic curvature tensors, Pages 271-277
J. Carlos Diaz-Ramos  and Eduardo Garcia-Rio 







From owner-reliable_computing [at] interval [dot] louisiana.edu Mon Apr 12 14:31:47 2004
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id i3CJVl800309
	for reliable_computing-outgoing; Mon, 12 Apr 2004 14:31: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.3) with ESMTP id i3CJVZC00292;
	Mon, 12 Apr 2004 14:31:35 -0500 (CDT)
Received: from aragorn (aragorn [129.108.5.35])
	by cs.utep.edu (8.11.7/8.11.7) with SMTP id i3CJVNG14021;
	Mon, 12 Apr 2004 13:31:23 -0600 (MDT)
Message-Id: <200404121931.i3CJVNG14021 [at] cs [dot] utep.edu>
Date: Mon, 12 Apr 2004 13:31:23 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: nominations for the 2004 Prize for Applications of Interval Analysis
To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu
Cc: rc_editors [at] interval [dot] louisiana.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: dnM0G0hazqeerfYsLzhNGQ==
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, 

As many of you may remember, in 2002, the Editorial Board of 
"Reliable Computing", an International Journal devoted to reliable
mathematical computations based on finite representations and
guaranteed accuracy, decided to set up a biannual Prize for
Applications of Interval Analysis, a prize that would be awarded at a
major interval meeting. 

The first R. E. Moore Prize for Applications of Interval
Analysis was awarded in 2002 to Dr. Warwick Tucker, a mathematician
from Cornell University, who proved, using interval techniques, that
the renowned Lorenz equations do in fact possess a strange
attractor. This problem, Smale's 14th conjecture, is of particular
note in large part because the Lorenz model is widely recognized as
signaling the beginning of chaos theory. This prize was awarded at 
the SIAM Validated Computing 2002 in Toronto. 

It is time to consider applications for the 2004 prize. Professor
Mitsuhiro Nakao, Chair of the 11th GAMM-IMACS International 
Symposium on Scientific Computing, Computer Arithmetic, and Validated
Numerics SCAN'2004 (Fukuoka, Japan, October 4-8, 2004) has encouraged us
to select the best paper and to hold the awarding ceremony during
SCAN'2004. For more information about the SCAN'04 conference, see 
http://scan2004.math.kyushu-u.ac.jp/

Please submit your nominations. 

WHO IS ELIGIBLE. Dissertations and papers that appeared in 2002
and later may be nominated.

HOW TO SUBMIT. To nominate a paper or dissertation (including your
own work or any other work you deem appropriate), send either an
electronic copy (Postscript, PDF, or portable LaTeX), or a URL (web
address) from where such an electronic copy can be downloaded, to
vladik [at] cs [dot] utep.edu 

If such an electronic copy is not available, a complete citation to a
commonly available public journal may be emailed to
vladik [at] cs [dot] utep.edu. If that is a problem, a printed copy may be mailed 
to: 

  Vladik Kreinovich 
  Attention: R. E. Moore Prize 
  Department of Computer Science
  University of Texas at El Paso
  500 W. University
  El Paso, TX 79968, USA

WHEN TO SUBMIT. Make sure the materials are nominated before May 15,
2004. (If you need more time to collect the materials, let me know ASAP). 
 
Thanks a lot. 

Vladik
 
APPPENDIX
The R. E. Moore Prize for Applications of Interval Analysis: 
Description and Rationale 
(from http://interval.louisiana.edu/Moore_prize.html)

The idea of arithmetic over sets to encompass finiteness, roundoff
error, and uncertainty dates back to the first part of the twentieth
century or earlier. By the late 1950's, with exponentially increasing
use of digital electronic computers for mathematical computations,
interval arithmetic was a concept whose time had come. With his 1962
dissertation "Interval Arithmetic and Automatic Error Analysis in
Digital Computing," encouraged by George Forsythe, Prof. Ramon Moore
was one of the first to publicize the underlying principles of
interval arithmetic in their modern form. Prof. Moore subsequently
dedicated much of his life to furthering the subject. This includes
guidance of seven Ph.D. students, interaction with other prominent
figures in the area such as Eldon Hansen, Louis Rall, and Bill
Walster, and publication of the seminal work "Interval Analysis"
(Prentice Hall, 1966) and its update "Methods and Applications of
Interval Analysis" (SIAM, 1979). In addition, Prof. Moore published a
related book "Computational Functional Analysis" (Horwood, 1985), and
organized the conference with proceedings Reliability in Computing
(Academic Press, 1988). This latter conference was a major catalyst
for renewed interest in the subject. It is safe to say that these
accomplishments of Professor Moore have made interval analysis what it
is today. To continue and further this tradition, in 2002, we decided
to dedicate to Prof. Moore a biennial prize for the best dissertation
or paper in applications of interval analysis. 

Note:  By "applications" we intend primarily applications in
engineering and the sciences that will bring further recognition to
the power of interval computations. However, we do not wish to  rule
out significant and widely recognized "pure" applications. The
editorial board of the journal "Reliable Computing"  will judge this. 



From owner-reliable_computing [at] interval [dot] louisiana.edu Tue Apr 13 17:09:00 2004
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id i3DM8xD02302
	for reliable_computing-outgoing; Tue, 13 Apr 2004 17:08:59 -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.3) with ESMTP id i3DM8tC02298
	for <reliable_computing [at] interval [dot] louisiana.edu>; Tue, 13 Apr 2004 17:08:55 -0500 (CDT)
Received: from aragorn (aragorn [129.108.5.35])
	by cs.utep.edu (8.11.7/8.11.7) with SMTP id i3DM8od28491;
	Tue, 13 Apr 2004 16:08:50 -0600 (MDT)
Message-Id: <200404132208.i3DM8od28491 [at] cs [dot] utep.edu>
Date: Tue, 13 Apr 2004 16:08:49 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: congratulations to Professor Alefeld
To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu
Cc: vladik [at] cs [dot] utep.edu, goetz.alefeld [at] math [dot] uni-karlsruhe.de
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: SayG/kxLtHX5YWKtok1YDA==
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 learned that our own Professor Goetz Alefeld has been recently 
elected a member of the European Academy of Sciences.

According to the European Academy of Sciences webpage http://www.eurasc.org, he 
was "elected for outstanding and lasting contributions to mathematical 
sciences and development of novel numerical algorithms and computational 
methods to be applied to solving complex problems".

Here is a description of what being a member is: 

"The Members of the Academy are elected on the basis of their 
distinguished and unique contribution to modern science and technology. 
Academy membership is considered one of the highest honours attributed 
to a researcher or an engineer." 

Congratulations to Professor Alefeld!

Vladik


















Vladik Kreinovich schrieb:

>Dear Friends, 
>
>First, on behalf of Dan and myself, let me thank all who replied about their 
>Fellow status and the Fellow status of their colleagues. 
>
>Dan and I have added most of this information to the Personalia part of the 
>interval computations website http://www.cs.utep.edu/interval-comp
>
>The more we add, the more impressive it becomes, with the scope of different 
>application areas. 
>
>We also encountered a minor problem. Our email about Fellows caused some 
>confusion among non-US participants of the mailing list. Let me therefore 
>clarify the situation. 
>
>We apologigize for the inconvenience. 
>
>CLARIFICATION OF THE TERM "FELLOW". Most US-based research societies, like ACM 
>or IEEE, have several degrees of membership. There is usually a regular 
>membership for which anyone with a professional degree (like Ph.D. in this 
>particular area) and/or professional experience like publications (for us in 
>academe) are eligible. To join a socety, all you need to do is apply, pay 
fees, 
>and sometimes get letters of recommendation from those who are members 
already. 
>
>Within some of these organizations, there is an additional status often called 
>Senior Member which is a recognition that a person contributed to the 
>community.
>
>The ultimate and rare recognition is a special status of a Fellow. Every year, 
>a few dozen new fellows are selected by the societies and/or special interest 
>groups and after a selection process, approved by some process involving the 
>organization as a whole. 
>
>Many other organizations have this special Fellow status, like American 
Society 
>of Civil Engineers, American Association for Artificial Intelligence, etc. 
>
>WHY WE LOOK FOR FELLOWS. In recent years, when considering tenure and 
promotion 
>issues, many departments specifically look for Fellows as potential referees, 
>the idea being that because of their prestigious status in the corresponding 
>communities, they will provide a more reliable evaluation of the candidate. 
>
>Getting the information on who is a Fellow is difficult, because while this is 
>usually public knowledge, researchers are not (at least not always :-) in the 
>habit of bragging around. Sometimes a Fellowship status is modestly marked on 
a 
>researcher's webpage, but it is difficult to find all this information. 
>
>We believe that collecting all this info on the Personalia part of the 
interval 
>computations webiste will help interval folks who apply for tenure and 
>promotion to give the list of possible referees to their chairs
>
>PROBLEMS WITH THIS TERM. Dan and I realize now, after getting quite a few 
>replies, that some non-US based organizations have a similar rare status but 
it 
>is not called Fellow. 
>
>Other organizations, in the US and abroad, have only this special 
>invitation-only type membership. US examples include National Scademy of 
>Sciences, National Academy of Engineering, other countries have similar 
>Academies of Sciences. 
>
>RELATED REQUEST. Both types of special memberships should be, in our opinion, 
>included. 
>
>Please send this info to us as well. 
>
>COMMENT. If you are a Fellow of a known organization, then a name would 
>suffice, a Google search usually produces enough info. 
>
>On the other hand, if you are a Fellow (or equivalent) of an organization that 
>we interval folks rarely encounter, and it is difficult to find the info about 
>this organization on the web, please send us also the URL (if any) of this 
>organization, we will place a link on the Perfsonalia webpage so that 
potential 
>chairs will know where to look. 
>
>If there is no webpage and the name is not self-evident (or in, say, German 
>:-(), please send a very brief description of what this organization is about. 
>
>Thanks a lot.
>
>Vladik
>
>
>
>
>  
>


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



From owner-reliable_computing [at] interval [dot] louisiana.edu Wed Apr 14 09:11:28 2004
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id i3EEBRk03458
	for reliable_computing-outgoing; Wed, 14 Apr 2004 09:11:27 -0500 (CDT)
Received: from mion.elka.pw.edu.pl (root [at] mion [dot] elka.pw.edu.pl [194.29.160.35])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id i3EEApC03454
	for <reliable_computing [at] interval [dot] louisiana.edu>; Wed, 14 Apr 2004 09:11:17 -0500 (CDT)
Received: (from localhost user: 'bkubica', uid#6972) by mion.elka.pw.edu.pl
	with ESMTP id <S17155AbUDNOK1>; Wed, 14 Apr 2004 16:10:27 +0200
Date: 	Wed, 14 Apr 2004 16:08:41 +0200 (CEST)
From: Bartlomiej Jacek KUBICA <B.Kubica [at] elka [dot] pw.edu.pl>
To: reliable_computing [at] interval [dot] louisiana.edu
Subject: C-XSC
In-Reply-To: <Pine.GSO.4.58.0404141601090.10709 [at] mion [dot] elka.pw.edu.pl>
Message-ID: <Pine.GSO.4.58.0404141605030.10709 [at] mion [dot] elka.pw.edu.pl>
References: <2.2.32.20031203004935.009d9098 [at] pop [dot] louisiana.edu>
 <Pine.GSO.4.58.0404141601090.10709 [at] mion [dot] elka.pw.edu.pl>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
X-Virus-Scanned: by AMaViS perl-11 mion
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk


Dear Interval Researchers,

If some of you use the XSC software, please tell me, if there is a way to
evaluate only an element of a gradient/hessian/jacobi matrix etc., not
the whole vector/matrix.
It may be beneficial e.g. when using the componentwise Newton method.

Best regards
	Bartlomiej Kubica

From owner-reliable_computing [at] interval [dot] louisiana.edu Wed Apr 14 11:34:24 2004
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id i3EGYOm03676
	for reliable_computing-outgoing; Wed, 14 Apr 2004 11:34:24 -0500 (CDT)
Received: from mion.elka.pw.edu.pl (root [at] mion [dot] elka.pw.edu.pl [194.29.160.35])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id i3EGYEC03672
	for <reliable_computing [at] interval [dot] louisiana.edu>; Wed, 14 Apr 2004 11:34:15 -0500 (CDT)
Received: (from localhost user: 'bkubica', uid#6972) by mion.elka.pw.edu.pl
	with ESMTP id <S19368AbUDNQeC>; Wed, 14 Apr 2004 18:34:02 +0200
Date: 	Wed, 14 Apr 2004 18:33:01 +0200 (CEST)
From: Bartlomiej Jacek KUBICA <B.Kubica [at] elka [dot] pw.edu.pl>
To: reliable_computing [at] interval [dot] louisiana.edu
Subject: bound constraints (fwd)
Message-ID: <Pine.GSO.4.58.0404141832270.25025 [at] mion [dot] elka.pw.edu.pl>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
X-Virus-Scanned: by AMaViS perl-11 mion
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk


I resend it, because it didn't arrive up to now.
Excuse me, if you receive two copies.

---------- Forwarded message ----------
Date: Wed, 14 Apr 2004 16:04:46 +0200 (CEST)
From: Bartlomiej Jacek KUBICA <bkubica [at] elka [dot] pw.edu.pl>
To: reliable_computing [at] interval [dot] louisiana.edu
Subject: bound constraints


Dear Interval Researchers,

I have a few questions about handling bound constraints in interval
optimization algorithms

1) It's known that the complexity grows exponentially with the number of
bound constraints. So, if you have bounds on each variable is it good to
use the ,,peeling process'' or not ?

2) How to use interval Newton method on boxes tangent to bounds, when not
using the peeling process ?

Thank you in advance for clariffication

With best regards
	Bartlomiej Kubica

From owner-reliable_computing [at] interval [dot] louisiana.edu Wed Apr 14 18:15:23 2004
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id i3ENFMX03953
	for reliable_computing-outgoing; Wed, 14 Apr 2004 18:15:22 -0500 (CDT)
Received: from fe3.cox-internet.com (fe3-cox.cox-internet.com [66.76.2.40])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id i3ENFGC03949
	for <reliable_computing [at] interval [dot] louisiana.edu>; Wed, 14 Apr 2004 18:15:16 -0500 (CDT)
Received: from Inspiron-8200 ([68.229.156.209]) by fe3.cox-internet.com
          (InterMail vK.4.04.00.03 201-232-140-20030416 license ac98e04b23802b25ff26d48c352bda07)
          with SMTP id <20040414231509.ZDDN24817.fe3@Inspiron-8200>;
          Wed, 14 Apr 2004 18:15:09 -0500
Message-Id: <2.2.32.20040414231458.00c2f920 [at] pop [dot] louisiana.edu>
X-Sender: rbk5287 [at] pop [dot] louisiana.edu
X-Mailer: Windows Eudora Pro Version 2.2 (32)
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Date: Wed, 14 Apr 2004 18:14:58 -0500
To: Bartlomiej Jacek KUBICA <B.Kubica [at] elka [dot] pw.edu.pl>,
   reliable_computing [at] interval [dot] louisiana.edu
From: "R. Baker Kearfott" <rbk [at] louisiana [dot] edu>
Subject: Re: bound constraints (fwd)
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

Basrtlomiej,

I envisioned the "peeling process" and implemented it in GlobSol
mainly for a small number of variables, and for cases when there
is much overestimation and evaluation at the vertices of the search
box could rapidly lead to feasible points with low values of the 
objective.  In the worst case, however, the peeling process in GlobSol
will examine 3^k boxes, where k is the number of variables with lower
and upper bounds.  This worst case will occur if the process doesn't
find a feasible point with low objective value among the first few
boundary boxes examined.

I suggest, for a higher number of variables, you try including bound
constraints as general inequality constraints, if you are using GlobSol.
(Also, I'm presently working on improving GlobSol's ability to handle
constrained problems.)

Also, consider if the bounds on the variables are actually constraints
or if you just know the variables to lie within those bounds.  However,
based on your question on interval Newton methods, it sounds like
they are actually bound constraints.

I have implemented an interval Newton method on boxes "tangent to
bounds"  (that is, on boxes that are degenerate in the full space,
having one or more coordinates fixed)
in the GlobSol routine precond/optinlgq.f90.  This "reduced interval
Newton method" is, mathematically, very simple.  I believe
"reduced space" methods are common, both with  constraints corresponding
to fixed coordinates and more general linear constraints, throughout
traditional optimization algorithms.  I think the text by
Gill, Murray and Wright, for example, treats them.  Did I understand your 
question correctly?

Best regards,

Baker

P.S. Did you receive your second sending?  The list server may
     need some work.

At 06:33 PM 4/14/2004 +0200, Bartlomiej Jacek KUBICA wrote:
>
>I resend it, because it didn't arrive up to now.
>Excuse me, if you receive two copies.
>
>---------- Forwarded message ----------
>Date: Wed, 14 Apr 2004 16:04:46 +0200 (CEST)
>From: Bartlomiej Jacek KUBICA <bkubica [at] elka [dot] pw.edu.pl>
>To: reliable_computing [at] interval [dot] louisiana.edu
>Subject: bound constraints
>
>
>Dear Interval Researchers,
>
>I have a few questions about handling bound constraints in interval
>optimization algorithms
>
>1) It's known that the complexity grows exponentially with the number of
>bound constraints. So, if you have bounds on each variable is it good to
>use the ,,peeling process'' or not ?
>
>2) How to use interval Newton method on boxes tangent to bounds, when not
>using the peeling process ?
>
>Thank you in advance for clariffication
>
>With best regards
>	Bartlomiej Kubica
>
>

---------------------------------------------------------------
R. Baker Kearfott,    rbk [at] louisiana [dot] edu   (337) 482-5346 (fax)
(337) 482-5270 (work)                     (337) 993-1827 (home)
URL: http://interval.louisiana.edu/kearfott.html
Department of Mathematics, University of Louisiana at Lafayette
(Moom 217 Maxim D. Doucet Hall, 1403 Johnston Street)
Box 4-1010, Lafayette, LA 70504-1010, USA
---------------------------------------------------------------


From owner-reliable_computing [at] interval [dot] louisiana.edu Thu Apr 15 08:51:22 2004
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id i3FDpLv05081
	for reliable_computing-outgoing; Thu, 15 Apr 2004 08:51:21 -0500 (CDT)
Received: from mion.elka.pw.edu.pl (root [at] mion [dot] elka.pw.edu.pl [194.29.160.35])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id i3FDpEC05077
	for <reliable_computing [at] interval [dot] louisiana.edu>; Thu, 15 Apr 2004 08:51:15 -0500 (CDT)
Received: (from localhost user: 'bkubica', uid#6972) by mion.elka.pw.edu.pl
	with ESMTP id <S17068AbUDONon>; Thu, 15 Apr 2004 15:44:43 +0200
Date: 	Thu, 15 Apr 2004 15:42:56 +0200 (CEST)
From: Bartlomiej Jacek KUBICA <B.Kubica [at] elka [dot] pw.edu.pl>
To: reliable_computing [at] interval [dot] louisiana.edu
Subject: Re: bound constraints (fwd)
In-Reply-To: <2.2.32.20040414231458.00c2f920 [at] pop [dot] louisiana.edu>
Message-ID: <Pine.GSO.4.58.0404151532160.10595 [at] mion [dot] elka.pw.edu.pl>
References: <2.2.32.20040414231458.00c2f920 [at] pop [dot] louisiana.edu>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
X-Virus-Scanned: by AMaViS perl-11 mion
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk


How do you do ?

Thanks to Arnold Neumaier and Roger Baker Kearfott for clariffications.
I will write a silly example to be more precise:

The problem is:

min x_1^3 + x_2^2

subject to bound constraints:

-1 <= x_1 <= 1
-1 <= x_2 <= 1

During the branch and bound process we split the box [-1, 1]*[-1, 1] and
in one of the iterations we have to analyse the subbox:

x_1 \in [-1, 0], x_2 \in [0, 0.5]

This box is _not_ a reduced box (when some coordinates are fixed), but
it's tangent to the bound constraint -1 <= x_1

So the interval Newton method shoul seek for minimum of the following
problem:

min x_1^3 + x_2^2 + \lambda*(-x_1 - 1)

s.t.

\lambda >= 0

Do I understand it correctly ?

Will it be beneficial to increase the number of variables by adding the
Lagrange multiplier \lambda ?

With best regards
	Bartlomiej Kubica

From owner-reliable_computing [at] interval [dot] louisiana.edu Thu Apr 15 11:10:11 2004
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id i3FGAA705295
	for reliable_computing-outgoing; Thu, 15 Apr 2004 11:10:10 -0500 (CDT)
Received: from fe3.cox-internet.com (fe3-cox.cox-internet.com [66.76.2.40])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id i3FGA4C05291
	for <reliable_computing [at] interval [dot] louisiana.edu>; Thu, 15 Apr 2004 11:10:04 -0500 (CDT)
Received: from Inspiron-8200 ([68.229.156.209]) by fe3.cox-internet.com
          (InterMail vK.4.04.00.03 201-232-140-20030416 license ac98e04b23802b25ff26d48c352bda07)
          with SMTP id <20040415160956.OPKP24817.fe3@Inspiron-8200>;
          Thu, 15 Apr 2004 11:09:56 -0500
Message-Id: <2.2.32.20040415160938.00d0db68 [at] pop [dot] louisiana.edu>
X-Sender: rbk5287 [at] pop [dot] louisiana.edu
X-Mailer: Windows Eudora Pro Version 2.2 (32)
Mime-Version: 1.0
Content-Type: multipart/mixed; boundary="=====================_1082063378==_"
Date: Thu, 15 Apr 2004 11:09:38 -0500
To: Bartlomiej Jacek KUBICA <B.Kubica [at] elka [dot] pw.edu.pl>,
   reliable_computing [at] interval [dot] louisiana.edu
From: "R. Baker Kearfott" <rbk [at] louisiana [dot] edu>
Subject: Re: bound constraints (fwd)
X-Attachments: C:\GlobSol\examples\miscellaneous\Kubica_2004_04_15_L.OT1
 ; C:\GlobSol\examples\miscellaneous\Kubica_2004_04_15.DT1;
  C:\GlobSol\examples\miscellaneous\Kubica_2004_04_15.f90;
  C:\GlobSol\examples\miscellaneous\Kubica_2004_04_15_L.DT1;
  C:\GlobSol\examples\miscellaneous\Kubica_2004_04_15_L.f90;
  C:\GlobSol\examples\miscellaneous\Kubica_2004_04_15.OT1;
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

--=====================_1082063378==_
Content-Type: text/plain; charset="us-ascii"

Bartolomiej:

Trying your "simple" problem with my experimental version of GlobSol using
the peeling process, on a 1.6 GHz Pentium-4 machine with 
Compaq Fortran 6.1 compiled
with debugging (without optimization), GlobSol completed by processing 2
boxes, in less than 1/100 of a second.  Trying your simnple problem with
my experimental version of GlobSol and not using "peeling", but introducing
the bound constraints as inequality constraints, GlobSol completed by 
processing 4 boxes and taking 2/100 of a second.

I have attached the relevant GlobSol input and output files (at total
of 6 files).

Thus, in your simple case, it would seem to pay to use "peeling".  
I would say that this is so for most two- and three-dimensional problems,
but not for higher dimensional problems.  Unfortunately, I do not have
a general answer yet on when to use "peeling" and when not to, other
than what I have mentioned in previous emails.  Some
years ago, during the "Sun" funded project and with an earlier version
of GlobSol, George Corliss and I experimented with peeling on a number
of practical problems.  We found that it sometimes paid, for some
problems with more dimensions, to start with an unconstrained problem, 
which often gives "no optima in search region".  One then selectively
adds one or more bound constraints at a time (via the peeling mechanism)
and observes what one gets.

By the way, Dietmar Ratz proposed an alternate way of handling bound
constraints in his Ph.D. dissertation.  I was impressed with his
clever idea, but I do not have first-hand experience with his technique.

Best regards,

Baker

At 03:42 PM 4/15/2004 +0200, Bartlomiej Jacek KUBICA wrote:
>
>How do you do ?
>
>Thanks to Arnold Neumaier and Roger Baker Kearfott for clariffications.
>I will write a silly example to be more precise:
>
>The problem is:
>
>min x_1^3 + x_2^2
>
>subject to bound constraints:
>
>-1 <= x_1 <= 1
>-1 <= x_2 <= 1
>
>During the branch and bound process we split the box [-1, 1]*[-1, 1] and
>in one of the iterations we have to analyse the subbox:
>
>x_1 \in [-1, 0], x_2 \in [0, 0.5]
>
>This box is _not_ a reduced box (when some coordinates are fixed), but
>it's tangent to the bound constraint -1 <= x_1
>
>So the interval Newton method shoul seek for minimum of the following
>problem:
>
>min x_1^3 + x_2^2 + \lambda*(-x_1 - 1)
>
>s.t.
>
>\lambda >= 0
>
>Do I understand it correctly ?
>
>Will it be beneficial to increase the number of variables by adding the
>Lagrange multiplier \lambda ?
>
>With best regards
>	Bartlomiej Kubica
>
>

--=====================_1082063378==_
Content-Type: text/plain; charset="us-ascii"
Content-Disposition: attachment; filename="Kubica_2004_04_15_L.OT1"

 Output from FIND_GLOBAL_MIN on  04/15/2004  at  11:04:48.
 Version for the system is: November 22, 2003
 
 Codelist file name is: Kubica_2004_04_15_LG.CDL
 Box data file name is: Kubica_2004_04_15_L.DT1       
 
 
 Initial box:
 [   -0.1000D+01,   0.1000D+01 ] [   -0.1000D+01,   0.1000D+01 ]
 
 BOUND_CONSTRAINT:
   F F   F F
 
 ---------------------------------------
 CONFIGURATION VALUES:
 
 EPS_DOMAIN:   0.1000D-07   MAXITR:  100000
 MAX_CPU_SECONDS:    0.3600D+04
 DO_INTERVAL_NEWTON: T  QUADRATIC: T  FULL_SPACE: F
 VERY_GOOD_INITIAL_GUESS: F
 USE_SUBSIT: T
 OUTPUT UNIT:           7  PRINT_LENGTH:           1
 PHI_MUST_CONVERGE: T
 EQ_CNS_MUST_CONVERGE: T
 INEQ_CNS_MUST_CONVERGE: T
 PHI_THICKNESS_FACTOR:   0.5000D+00
 EQ_CNS_THICKNESS_FACTOR:   0.5000D+00
 INEQ_CNS_THICKNESS_FACTOR:   0.5000D+00
 PHI_MUST_CONVERGE: T
 EQ_CNS_MUST_CONVERGE: T
 INEQ_CNS_MUST_CONVERGE: T
 PHI_CONVERGENCE_FACTOR:   0.1000D-13
 EQ_CNS_CONVERGENCE_FACTOR:   0.1000D-13
 INEQ_CNS_CONVERGENCE_FACTOR:   0.1000D-13
 CONTINUITY_ACROSS_BRANCHES: F
 SINGULAR_EXPANSION_FACTOR:   0.1000D+02
 HEURISTIC PARAMETER ALPHA:   0.5000D+00
 APPROX_OPT_BEFORE_BISECTION: F
 USE_LP:  T
 ITERATE__LP:  F
 EPS_LP_FIT:   0.100000000000000     
 USE_TAYLOR_EQUALITY_CONSTRAINTS F
 USE_TAYLOR_INEQ_CONSTRAINTS F
 USE_TAYLOR_OBJECTIVE F
 USE_TAYLOR_EQ_CNS_GRD F
 USE_TAYLOR_GRAD F
 USE_TAYLOR_INEQ_CNS_GRD F
 USE_TAYLOR_REDUCED_INEWTON T
 COSY_POLYNOMIAL_ORDER           5
 LEAST_SQUARES_FUNCTIONS: F
 NONLINEAR_SYSTEM: F
 Success in initial location of an approximate optimum
 feasible_region returned:
 [   -0.5000D-08,   0.5000D-08 ] [   -0.5000D-08,   0.5000D-08 ]
 after the interval Newton method, APPROX_OPT_BOX
 Box coordinates:
 [   -0.1000D-02,   0.1000D-02 ] [   -0.1000D-02,   0.1000D-02 ]
PHI:
 [   -0.1000D-08,   0.1001D-05 ]
 B%LIUI(1,*):
 F F
 B%LIUI(2,*):
 F F
 B%SIDE(*):
 F F
 B%PEEL(*):
 F F
 Level:            0
 Box contains the following approximate root:
    0.0000D+00   0.0000D+00
 OBJECTIVE ENCLOSURE AT APPROXIMATE ROOT:
 [   -0.2225-307,   0.4450-307 ]
 Unknown =  T    Contains_root = T
 Changed coordinates:
 F F
 U0:
 [    0.0000D+00,   0.1000D+01 ]
 U:
 [    0.0000D+00,   0.1000D+01 ] [    0.0000D+00,   0.1000D+01 ]
 [    0.0000D+00,   0.1000D+01 ] [    0.0000D+00,   0.1000D+01 ]
 INEQ_CERT_FEASIBLE:
  F F F F
 NIN_POSS_BINDING:           4
 After PEEL_BOUNDARY, number of boxes in current_list:           1
 After COMPLEMENT_LIST, number of boxes in current_list:           1
 
 THERE WERE NO BOXES IN THE LIST OF SMALL BOXES.
 
 LIST OF BOXES CONTAINING VERIFIED FEASIBLE POINTS:
 
 Box no.:           1
 Box coordinates:
 [   -0.1000D+01,  -0.1000D+01 ] [   -0.6867D-12,   0.6867D-12 ]
PHI:
 [   -0.1000D+01,  -0.1000D+01 ]
 B%LIUI(1,*):
 F F
 B%LIUI(2,*):
 F F
 B%SIDE(*):
 F F
 B%PEEL(*):
 T T
 Level:            2
 Box contains the following approximate root:
   -0.1000D+01   0.3219D-20
 OBJECTIVE ENCLOSURE AT APPROXIMATE ROOT:
 [   -0.1000D+01,  -0.1000D+01 ]
 Unknown =  T    Contains_root = T
 Changed coordinates:
 T T
 U0:
 [    0.2500D+00,   0.2500D+00 ]
 U:
 [    0.0000D+00,   0.1000D+01 ] [    0.7500D+00,   0.7500D+00 ]
 [    0.0000D+00,   0.1000D+01 ] [    0.0000D+00,   0.1000D+01 ]
 INEQ_CERT_FEASIBLE:
  T F T T
 NIN_POSS_BINDING:           1
 -------------------------------------------------
 ALGORITHM COMPLETED WITH LESS THAN THE MAXIMUM NUMBER,
      100000  OF BOXES.
 Number of bisections:            3
 No. dense interval residual evaluations -- gradient code list:           68
 Number of orig. system C-LP preconditioner rows:           69
 Number of solutions for a component in the expanded system:            8
 Total number of forward_substitutions:          204
 Number of Gauss--Seidel steps on the dense system:           69
 Number of gradient evaluations from a gradient code list:           18
 Total number of dense slope matrix evaluations:           46
 Total number second-order interval evaluations of the
       original function:           18
 Total number dense interval constraint evaluations:          376
 Total number dense interval constraint gradient component
       evaluations:          496
 Total number dense point constraint gradient component
       evaluations:           16
 Total number dense interval reduced gradient evaluations:           46
 Total number of calls to FRITZ_JOHN_RESIDUALS:           16
 Number of times the interval Newton method made a coordinate
       interval smaller:           43
 Total time spent doing linear algebra (preconditioners
       and solution processes):   1.001440000000000E-002
 Total time spent in the LP filter (creating and
       solving the LP):   1.001440000000000E-002
 Total time spent actually solving the linear relaxations: 
  1.001440000000000E-002
 Number of times the approximate solver was called:            2
 Number Fritz-John matrix evaluations:           14
 Total number of boxes processed in loop:            4
 BEST_ESTIMATE:   -0.1000D+01
 Overall CPU time:    0.3004D-01
 CPU time in PEEL_BOUNDARY:    0.0000D+00
 CPU time in REDUCED_INTERVAL_NEWTON:    0.0000D+00

--=====================_1082063378==_
Content-Type: text/plain; charset="us-ascii"
Content-Disposition: attachment; filename="Kubica_2004_04_15.DT1"

1D-8 ! Kubica_2004_04_15.DT1
-1 1
-1 1
T T
T T

--=====================_1082063378==_
Content-Type: text/plain; charset="us-ascii"
Content-Disposition: attachment; filename="Kubica_2004_04_15.f90"

PROGRAM Kubica_2004_04_15

  USE CODELIST_CREATION

      TYPE(CDLVAR), DIMENSION(2):: X
      TYPE(CDLLHS), DIMENSION(1):: PHI

      CALL INITIALIZE_CODELIST(X)

  PHI(1) = X(1)**3 + X(2)**2

      CALL FINISH_CODELIST

END PROGRAM Kubica_2004_04_15

--=====================_1082063378==_
Content-Type: text/plain; charset="us-ascii"
Content-Disposition: attachment; filename="Kubica_2004_04_15_L.DT1"

1D-8 ! Kubica_2004_04_15_L.DT1
-1 1
-1 1
F F
F F


--=====================_1082063378==_
Content-Type: text/plain; charset="us-ascii"
Content-Disposition: attachment; filename="Kubica_2004_04_15_L.f90"

PROGRAM Kubica_2004_04_15_L

  USE CODELIST_CREATION

      TYPE(CDLVAR), DIMENSION(2):: X
      TYPE(CDLLHS), DIMENSION(1):: PHI
      TYPE(CDLINEQ), DIMENSION(4) :: G

      CALL INITIALIZE_CODELIST(X)

  PHI(1) = X(1)**3 + X(2)**2

  G(1) = X(1) - 1
  G(2) = -1 - X(1)

  G(3) = X(2) - 1
  G(4) = -1 - X(2)

      CALL FINISH_CODELIST

END PROGRAM Kubica_2004_04_15_L

--=====================_1082063378==_
Content-Type: text/plain; charset="us-ascii"
Content-Disposition: attachment; filename="Kubica_2004_04_15.OT1"

 Output from FIND_GLOBAL_MIN on  04/15/2004  at  10:50:14.
 Version for the system is: November 22, 2003
 
 Codelist file name is: Kubica_2004_04_15G.CDL
 Box data file name is: Kubica_2004_04_15.DT1         
 
 
 Initial box:
 [   -0.1000D+01,   0.1000D+01 ] [   -0.1000D+01,   0.1000D+01 ]
 
 BOUND_CONSTRAINT:
   T T   T T
 
 ---------------------------------------
 CONFIGURATION VALUES:
 
 EPS_DOMAIN:   0.1000D-07   MAXITR:  100000
 MAX_CPU_SECONDS:    0.3600D+04
 DO_INTERVAL_NEWTON: T  QUADRATIC: T  FULL_SPACE: F
 VERY_GOOD_INITIAL_GUESS: F
 USE_SUBSIT: T
 OUTPUT UNIT:           7  PRINT_LENGTH:           1
 PHI_MUST_CONVERGE: T
 EQ_CNS_MUST_CONVERGE: T
 INEQ_CNS_MUST_CONVERGE: T
 PHI_THICKNESS_FACTOR:   0.5000D+00
 EQ_CNS_THICKNESS_FACTOR:   0.5000D+00
 INEQ_CNS_THICKNESS_FACTOR:   0.5000D+00
 PHI_MUST_CONVERGE: T
 EQ_CNS_MUST_CONVERGE: T
 INEQ_CNS_MUST_CONVERGE: T
 PHI_CONVERGENCE_FACTOR:   0.1000D-13
 EQ_CNS_CONVERGENCE_FACTOR:   0.1000D-13
 INEQ_CNS_CONVERGENCE_FACTOR:   0.1000D-13
 CONTINUITY_ACROSS_BRANCHES: F
 SINGULAR_EXPANSION_FACTOR:   0.1000D+02
 HEURISTIC PARAMETER ALPHA:   0.5000D+00
 APPROX_OPT_BEFORE_BISECTION: F
 USE_LP:  T
 ITERATE__LP:  F
 EPS_LP_FIT:   0.100000000000000     
 USE_TAYLOR_EQUALITY_CONSTRAINTS F
 USE_TAYLOR_INEQ_CONSTRAINTS F
 USE_TAYLOR_OBJECTIVE F
 USE_TAYLOR_EQ_CNS_GRD F
 USE_TAYLOR_GRAD F
 USE_TAYLOR_INEQ_CNS_GRD F
 USE_TAYLOR_REDUCED_INEWTON T
 COSY_POLYNOMIAL_ORDER           5
 LEAST_SQUARES_FUNCTIONS: F
 NONLINEAR_SYSTEM: F
 Success in initial location of an approximate optimum
 feasible_region returned:
 [   -0.1000D-02,   0.1000D-02 ] [   -0.1000D-02,   0.1000D-02 ]
 after the interval Newton method, APPROX_OPT_BOX
 Box coordinates:
 [   -0.1000D-02,   0.1000D-02 ] [   -0.4450-307,   0.4450-307 ]
PHI:
 [   -0.1000D-08,   0.1000D-08 ]
 B%LIUI(1,*):
 F F
 B%LIUI(2,*):
 F F
 B%SIDE(*):
 F F
 B%PEEL(*):
 F F
 Level:            0
 Box contains the following approximate root:
    0.0000D+00   0.0000D+00
 OBJECTIVE ENCLOSURE AT APPROXIMATE ROOT:
 [   -0.2225-307,   0.4450-307 ]
 Unknown =  T    Contains_root = T
 Changed coordinates:
 F F
 After PEEL_BOUNDARY, number of boxes in current_list:           2
 After COMPLEMENT_LIST, number of boxes in current_list:           2
 
 THERE WERE NO BOXES IN THE LIST OF SMALL BOXES.
 
 LIST OF BOXES CONTAINING VERIFIED FEASIBLE POINTS:
 
 Box no.:           1
 Box coordinates:
 [   -0.1000D+01,  -0.1000D+01 ] [   -0.2225-307,   0.2225-307 ]
PHI:
 [   -0.1000D+01,  -0.1000D+01 ]
 B%LIUI(1,*):
 T F
 B%LIUI(2,*):
 F F
 B%SIDE(*):
 T F
 B%PEEL(*):
 T T
 Level:            0
 Box contains the following approximate root:
   -0.1000D+01   0.0000D+00
 OBJECTIVE ENCLOSURE AT APPROXIMATE ROOT:
 [   -0.1000D+01,  -0.1000D+01 ]
 Unknown =  T    Contains_root = T
 Changed coordinates:
 T F
 -------------------------------------------------
 ALGORITHM COMPLETED WITH LESS THAN THE MAXIMUM NUMBER,
      100000  OF BOXES.
 No. dense interval residual evaluations -- gradient code list:           72
 Number of orig. system C-LP preconditioner rows:            5
 Number of solutions for a component in the expanded system:           24
 Total number of forward_substitutions:          236
 Number of Gauss--Seidel steps on the dense system:            3
 Number of gradient evaluations from a gradient code list:            9
 Total number of dense slope matrix evaluations:           36
 Total number second-order interval evaluations of the
       original function:           30
 Total number dense interval reduced gradient evaluations:           11
 Number of times the interval Newton method made a coordinate
       interval smaller:            3
 Number of times a box was rejected because the gradient or
       reduced gradient did not contain zero:            1
 Number of times the approximate solver was called:            8
 Number Fritz-John matrix evaluations:            4
 Number of times SUBSIT decreased one or more 
       coordinate widths:            2
 Total number of boxes processed in loop:            2
 BEST_ESTIMATE:   -0.1000D+01
 Overall CPU time:    0.1001D-01
 CPU time in PEEL_BOUNDARY:    0.1001D-01
 CPU time in REDUCED_INTERVAL_NEWTON:    0.0000D+00

--=====================_1082063378==_
Content-Type: text/plain; charset="us-ascii"


---------------------------------------------------------------
R. Baker Kearfott,    rbk [at] louisiana [dot] edu   (337) 482-5346 (fax)
(337) 482-5270 (work)                     (337) 993-1827 (home)
URL: http://interval.louisiana.edu/kearfott.html
Department of Mathematics, University of Louisiana at Lafayette
(Moom 217 Maxim D. Doucet Hall, 1403 Johnston Street)
Box 4-1010, Lafayette, LA 70504-1010, USA
---------------------------------------------------------------

--=====================_1082063378==_--


From owner-reliable_computing [at] interval [dot] louisiana.edu Thu Apr 15 11:18:25 2004
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id i3FGIOA05405
	for reliable_computing-outgoing; Thu, 15 Apr 2004 11:18:24 -0500 (CDT)
Received: from fe3.cox-internet.com (fe3-cox.cox-internet.com [66.76.2.40])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id i3FGIJC05401
	for <reliable_computing [at] interval [dot] louisiana.edu>; Thu, 15 Apr 2004 11:18:19 -0500 (CDT)
Received: from Inspiron-8200 ([68.229.156.209]) by fe3.cox-internet.com
          (InterMail vK.4.04.00.03 201-232-140-20030416 license ac98e04b23802b25ff26d48c352bda07)
          with SMTP id <20040415161813.OUKG24817.fe3@Inspiron-8200>;
          Thu, 15 Apr 2004 11:18:13 -0500
Message-Id: <2.2.32.20040415161755.00d0682c [at] pop [dot] louisiana.edu>
X-Sender: rbk5287 [at] pop [dot] louisiana.edu
X-Mailer: Windows Eudora Pro Version 2.2 (32)
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Date: Thu, 15 Apr 2004 11:17:55 -0500
To: Bartlomiej Jacek KUBICA <B.Kubica [at] elka [dot] pw.edu.pl>,
   reliable_computing [at] interval [dot] louisiana.edu
From: "R. Baker Kearfott" <rbk [at] louisiana [dot] edu>
Subject: More Re: bound constraints (fwd)
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

Bortolomiej,

I forgot to add that, in the COCOS benchmarking project (at least
in all problems in the TINY1 test set), the problems were considered, 
for the purposes of testing GlobSol, to be totally bound-constrained,
and each bound constraint was handled with the peeling process.  This
may have greatly increased the execution time of GlobSol for some of
the higher-dimensional problems, but additional tests would need to
be made to say for sure.

Best regards,

Baker

At 03:42 PM 4/15/2004 +0200, Bartlomiej Jacek KUBICA wrote:
>
>How do you do ?
>
>Thanks to Arnold Neumaier and Roger Baker Kearfott for clariffications.
>I will write a silly example to be more precise:
>
>The problem is:
>
>min x_1^3 + x_2^2
>
>subject to bound constraints:
>
>-1 <= x_1 <= 1
>-1 <= x_2 <= 1
>
>During the branch and bound process we split the box [-1, 1]*[-1, 1] and
>in one of the iterations we have to analyse the subbox:
>
>x_1 \in [-1, 0], x_2 \in [0, 0.5]
>
>This box is _not_ a reduced box (when some coordinates are fixed), but
>it's tangent to the bound constraint -1 <= x_1
>
>So the interval Newton method shoul seek for minimum of the following
>problem:
>
>min x_1^3 + x_2^2 + \lambda*(-x_1 - 1)
>
>s.t.
>
>\lambda >= 0
>
>Do I understand it correctly ?
>
>Will it be beneficial to increase the number of variables by adding the
>Lagrange multiplier \lambda ?
>
>With best regards
>	Bartlomiej Kubica
>
>

---------------------------------------------------------------
R. Baker Kearfott,    rbk [at] louisiana [dot] edu   (337) 482-5346 (fax)
(337) 482-5270 (work)                     (337) 993-1827 (home)
URL: http://interval.louisiana.edu/kearfott.html
Department of Mathematics, University of Louisiana at Lafayette
(Moom 217 Maxim D. Doucet Hall, 1403 Johnston Street)
Box 4-1010, Lafayette, LA 70504-1010, USA
---------------------------------------------------------------


From owner-reliable_computing [at] interval [dot] louisiana.edu Thu Apr 15 19:11:14 2004
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id i3G0BEm05772
	for reliable_computing-outgoing; Thu, 15 Apr 2004 19:11:14 -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.3) with ESMTP id i3G0B8C05768
	for <reliable_computing [at] interval [dot] louisiana.edu>; Thu, 15 Apr 2004 19:11:08 -0500 (CDT)
Received: from aragorn (aragorn [129.108.5.35])
	by cs.utep.edu (8.11.7/8.11.7) with SMTP id i3G0Amp26795;
	Thu, 15 Apr 2004 18:10:50 -0600 (MDT)
Message-Id: <200404160010.i3G0Amp26795 [at] cs [dot] utep.edu>
Date: Thu, 15 Apr 2004 18:10:47 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: PARA'04 hotel reservation and conference registration deadlines
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: 6etjsGRUfYRCPdpU3KvLxg==
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

Apologies for multiple copies. 

As you may remember, there is a large interval mini-symposium at this 
conference. 

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

Date: Thu, 15 Apr 2004 18:01:34 +0200 (METDST)
From: Jerzy Wasniewski <jw [at] imm [dot] dtu.dk>



  PARA'04
  WORKSHOP ON STATE-OF-THE-ART
  IN SCIENTIFIC COMPUTING
  June 20-23, 2004
  http://imm.dtu.dk/~jw/para04/

1. We remind you that a block of rooms has been reserved for
PARA'04 participants, at reduced rates, at each of the hotels
listed in

           http://www.imm.dtu.dk/~jw/para04/hotels/

for the period June 19-24, 2004. These rooms will be held only
until April 30.  For reservations made after this date the
reduced rates will not be in effect.

2. The conference fees will be increased for registration after
May 15, as shown at

           http://www.imm.dtu.dk/~jw/para04/fees/


A preliminary version of the PARA'04 programme can be seen at

           http://www.imm.dtu.dk/~jw/para04/programme/


On behalf of the PARA'04 Organizing Committee,

  Jerzy Wasniewski
  Email: jw [at] imm [dot] dtu.dk

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



From owner-reliable_computing [at] interval [dot] louisiana.edu Sat Apr 17 17:22:37 2004
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id i3HMMaW08563
	for reliable_computing-outgoing; Sat, 17 Apr 2004 17:22:36 -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.3) with ESMTP id i3HMMPC08546;
	Sat, 17 Apr 2004 17:22:25 -0500 (CDT)
Received: from aragorn (aragorn [129.108.5.35])
	by cs.utep.edu (8.11.7/8.11.7) with SMTP id i3HMMC317910;
	Sat, 17 Apr 2004 16:22:13 -0600 (MDT)
Message-Id: <200404172222.i3HMMC317910 [at] cs [dot] utep.edu>
Date: Sat, 17 Apr 2004 16:22:12 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: Re: nominations for the 2004 Prize for Applications of Interval Analysis
To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu
Cc: rc_editors [at] interval [dot] louisiana.edu, vladik [at] cs [dot] utep.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: gs91wDfYJnOrt6dhY8m0Kg==
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, 

Clarification: 

Please rest assured that the names of the nominees will be kept absolutely 
secret and they will only be accessible to the members of the prize committee 
which, for this 2004 prize, consists of the editorial board of the Reliable 
Computing journal. 

Vladik


From owner-reliable_computing [at] interval [dot] louisiana.edu Mon Apr 19 04:56:06 2004
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id i3J9u5D12292
	for reliable_computing-outgoing; Mon, 19 Apr 2004 04:56:05 -0500 (CDT)
Received: from mailbox.univie.ac.at (mailbox.univie.ac.at [131.130.1.27])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id i3J9tvC12288
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 19 Apr 2004 04:55:58 -0500 (CDT)
Received: from univie.ac.at (theseus.mat.univie.ac.at [131.130.16.23])
	by mailbox.univie.ac.at (8.12.10/8.12.10) with ESMTP id i3J9taiX1134726;
	Mon, 19 Apr 2004 11:55:42 +0200
Message-ID: <4083A218.2080505 [at] univie [dot] ac.at>
Date: Mon, 19 Apr 2004 11:55:36 +0200
From: Arnold Neumaier <Arnold.Neumaier [at] univie [dot] ac.at>
Organization: University of Vienna
User-Agent: Mozilla/5.0 (X11; U; Linux i686; en-US; rv:1.4.2) Gecko/20040308
X-Accept-Language: en, de
MIME-Version: 1.0
To: interval <reliable_computing [at] interval [dot] louisiana.edu>
Subject: [Fwd: Re: Help on interval arithmetics package for lisp]
Content-Type: multipart/mixed;
 boundary="------------090905020607060207040204"
X-DCC-ZID-Univie-Metrics: imap 4243; Body=0 Fuz1=0 Fuz2=0
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

This is a multi-part message in MIME format.
--------------090905020607060207040204
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Content-Transfer-Encoding: 7bit


--------------090905020607060207040204
Content-Type: message/rfc822;
 name="Re: Help on interval arithmetics package for lisp"
Content-Transfer-Encoding: 7bit
Content-Disposition: inline;
 filename="Re: Help on interval arithmetics package for lisp"

Path: usenet.univie.ac.at!aconews-feed.univie.ac.at!newsfeed.wu-wien.ac.at!newsfeeder1.noc.eunet-ag.at!news.eunet.at!newsfeed.vmunix.org!newsfeed.wirehub.nl!fr.ip.ndsoftware.net!proxad.net!freenix!sn-xit-02!sn-xit-06!sn-post-01!supernews.com!corp.supernews.com!YahooGroups.Com!RobertMaas
From: RobertMaas [at] YahooGroups [dot] Com
Newsgroups: sci.math.num-analysis,comp.lang.lisp
Subject: Re: Help on interval arithmetics package for lisp
Date: Sun, 18 Apr 2004 18:18:18 -0800
Organization: All alone here, wish I had a friend for sharing thoughts
Message-ID: <REM-2004apr18-003 [at] Yahoo [dot] Com>
References: <87llsq9b29.fsf [at] loki [dot] bibliotech.com>
X-Complaints-To: abuse [at] supernews [dot] com
Xref: usenet.univie.ac.at comp.lang.lisp:142179 sci.math.num-analysis:79981
MIME-Version: 1.0

> From: lagus [at] karhu [dot] Helsinki.FI (Krista Lagus)
> Date: 28 Jun 93 18:07:32
> I'd be grateful for pointers as to where I could find an
> interval-arithmetic package for lisp.

Nobody has responded to you yet. After all these years, is your
question still pending? By the way,I discovered your article just today
when doing a Google search. (Google didn't exist when you posted it!!)

--------------090905020607060207040204--


From owner-reliable_computing [at] interval [dot] louisiana.edu Mon Apr 19 12:44:29 2004
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id i3JHiSM12899
	for reliable_computing-outgoing; Mon, 19 Apr 2004 12:44:28 -0500 (CDT)
Received: from droog.sdf-eu.org (IDENT:root@sdf-eu.org [192.94.73.35])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id i3JHiJC12895
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 19 Apr 2004 12:44:20 -0500 (CDT)
Received: from sdf-eu.org (IDENT:logistic@localhost [127.0.0.1])
	by droog.sdf-eu.org (8.12.10/8.12.10) with ESMTP id i3JHhDli028202;
	Mon, 19 Apr 2004 17:43:13 GMT
Received: (from logistic@localhost)
	by sdf-eu.org (8.12.10/8.12.8/Submit) id i3JHhAn0028198;
	Mon, 19 Apr 2004 17:43:10 GMT
Date: Mon, 19 Apr 2004 17:43:10 +0000
From: "Janos G. Hajagos" <logistic@sdf-eu.org>
To: interval <reliable_computing [at] interval [dot] louisiana.edu>
Cc: Arnold Neumaier <Arnold.Neumaier [at] univie [dot] ac.at>
Subject: Re: [Fwd: Re: Help on interval arithmetics package for lisp]
Message-ID: <20040419174310.GB1234@sdf-eu.org>
References: <4083A218.2080505 [at] univie [dot] ac.at>
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Disposition: inline
In-Reply-To: <4083A218.2080505 [at] univie [dot] ac.at>
User-Agent: Mutt/1.4.2.1i
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

Arnold,

I have been playing around with building an interval library for lisp.
Far as I know, there is no well supported library for interval
arithmetic. However, Richard Fateman has an interval class for lisp
for rational endpoints. See:

http://www.cs.berkeley.edu/~fateman/mma1.6/intclass.lisp

There are some challenges in building an interval lisp library. The
first one is that the Ansi standard for Common Lisp does not specify a
standard interface for switching floating point rounding modes. CMU
Common Lisp has a function for setting and getting floating point
rounding modes. As for commercial distributions, like LispWorks and
Franz Lisp, I am unsure if they support the switching of rounding
modes directly.

Most lisp distributions provide capability to access foreign
functions. This would allow a C or Fortran library to be wrapped and
accessed from a lisp calling functions. This was done for the BLAS and
LAPACK libraries. See:

http://matlisp.sourceforge.net/

There might be some additional advantages of building an interval lisp
library besides just aiding the spread of interval arithmetic. The
first is that lisp makes it easy to manipulate algebraic
expressions. For a given expression the variables that repeat and are
uncertain could be identified and the appropriate techniques could be
applied to aid in the computation of optimal bounds. Of course, this
can be implemented in any language, but it is much easier to do this
in lisp. Other advantages in using lisp is that it provides an
interactive shell, macros for creating new control structures for
intervals, strong data structures, and functions like apply and mapcar
for functional programming.

FYI, Compiled lisp code is fast but not as fast as optimized Fortran
code. See:

http://home.comcast.net/~bc19191/blog/040308.html
http://www.cs.berkeley.edu/~fateman/papers/lispfloat.ps

-Janos Hajagos

On Mon, Apr 19, 2004 at 11:55:36AM +0200, Arnold Neumaier wrote:

> From: RobertMaas [at] YahooGroups [dot] Com
> Subject: Re: Help on interval arithmetics package for lisp
> Date: Sun, 18 Apr 2004 18:18:18 -0800
> 
> > From: lagus [at] karhu [dot] Helsinki.FI (Krista Lagus)
> > Date: 28 Jun 93 18:07:32
> > I'd be grateful for pointers as to where I could find an
> > interval-arithmetic package for lisp.
> 
> Nobody has responded to you yet. After all these years, is your
> question still pending? By the way,I discovered your article just today
> when doing a Google search. (Google didn't exist when you posted it!!)


-- 

Homepage: <http://creativelimits.net>

From owner-reliable_computing [at] interval [dot] louisiana.edu Mon Apr 19 14:46:29 2004
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id i3JJkSd13012
	for reliable_computing-outgoing; Mon, 19 Apr 2004 14:46:28 -0500 (CDT)
Received: from signals.gtrep.gatech.edu (signals.gtrep.gatech.edu [168.20.172.14])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id i3JJkMC13008
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 19 Apr 2004 14:46:23 -0500 (CDT)
Received: from rmuhannalptptoshiba (rmuhanna-lptp-toshiba.gtrep.gatech.edu [10.50.20.191])
	by signals.gtrep.gatech.edu (8.12.8/8.12.8) with SMTP id i3JJk8Un004269
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 19 Apr 2004 15:46:08 -0400
Message-ID: <006301c42646$f66ecfc0$bf14320a@rmuhannalptptoshiba>
From: "Rafi Muhanna" <rafi.muhanna [at] gtrep [dot] gatech.edu>
To: <reliable_computing [at] interval [dot] louisiana.edu>
Subject: Call for papers-Workshop on REliable Engineering Computing
Date: Mon, 19 Apr 2004 15:46:09 -0400
MIME-Version: 1.0
Content-Type: multipart/alternative;
	boundary="----=_NextPart_000_0060_01C42625.6F2DBB50"
X-Priority: 3
X-MSMail-Priority: Normal
X-Mailer: Microsoft Outlook Express 6.00.2800.1409
X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2800.1409
X-GTSAV-MailScanner-Information: Please contact the ISP for more information
X-GTSAV-MailScanner: Found to be clean
X-GTSAV-MailScanner-SpamScore: s
X-MailScanner-From: rafi.muhanna [at] gtrep [dot] gatech.edu
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

This is a multi-part message in MIME format.

------=_NextPart_000_0060_01C42625.6F2DBB50
Content-Type: text/plain;
	charset="iso-8859-1"
Content-Transfer-Encoding: quoted-printable

Dear Colleagues:



CALL FOR PAPERS

=20

NSF workshop on Reliable Engineering Computing
Georgia Institute of Technology
September 15-17, 2004 | Savannah, Georgia, USA

Across all branches of engineering, computational methods share the need =
for reliable results.  Reliability can be achieved only if all sources =
of errors, approximations, and uncertainty are accounted for.

This workshop is unique in combining computer science, mathematics, and =
engineering analysis and design to discuss the reliability of =
engineering computations, providing a common forum by which to continue =
cross-disciplinary advisements in the field.

=20

Participants are expected to submit papers that will be published in the =
workshop proceedings and also will be available online from the workshop =
web site.  After the workshop, selected papers will be published in a =
special issue(s) of Reliable Computing journal. The papers will go =
through the normal refereeing process.
=20

Workshop website: www.gtsav.gatech.edu/rec/recworkshop

=20

Topics include but not limited to:=20

-        Measurement of reliability of algorithms and computations;

-        Integration of various sources of errors in engineering =
calculations;=20

-        Integrating uncertainty into analysis and design.

=20

Deadlines:

May 15, 2004:     deadline for abstract submission

June 01, 2004:     notification of acceptance

August 01, 2004:  deadline for paper submission

=20

For more information, please contact Prof. Muhanna       =20

Email: rec [at] gtrep [dot] gatech.edu

Phone:  (912) 966-7931

Fax:      (912) 966-7928

=20

Honorary Co-Chairmen
Ramon E. Moore
Eldon R. Hansen

Chairman:
Rafi L. Muhanna, Georgia Institute of Technology

Co-Chairman:
Robert L. Mullen, Case Western Reserve University

Scientific Committee:
G=F6tz Alefeld, University of Karlsruhe, Germany
B. Ross Barmish, University of Wisconsin-Madison
Daniel Berleant, Iowa State University
David Bogle, University College London=20
Kyung Choi, The University of Iowa=20
George Corliss, Marquette University
William Edmonson, University of Hampton
Scott Ferson, Applied Biomathematics
Roger Ghanem, Johns Hopkins University
Raphael Haftka, University of Florida
Baker Kearfott, University of Louisiana at Lafayette
Vladik Kreinovich, University of Texas at El Paso
Zissimos Mourelatos, Oakland University
Arnold Neumaier, University of Vienna, Austria
Efstratios Nikolaidis, University of Toledo
Steve Wojtkiewicz, Sandia National Laboratories
Mark Stadtherr, University of Notre Dame
William Walster, Sun Microsystems

=20

Sponsors:

This workshop is being made possible through the assistance of the =
National Science Foundation, Sun Microsystems and the Georgia Institute =
of Technology.

Coordination of the event is being provided by the Center for Reliable =
Engineering Computing at Georgia Tech Savannah.

______________________________________________________

Rafi L. Muhanna
Director, Center for Reliable Engineering Computing (REC)
School of Civil & Environmental Engineering
Georgia Institute of Technology, Savannah
=20
210 Technology Circle
Savannah, GA 31407-3038
USA
=20
Email:         rafi.muhanna [at] gtrep [dot] gatech.edu
Phone:       (912) 966-7931=20
Fax:           (912) 966-7928

------=_NextPart_000_0060_01C42625.6F2DBB50
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 6.00.2800.1400" name=3DGENERATOR>
<STYLE></STYLE>
</HEAD>
<BODY bgColor=3D#ffffff>
<DIV>
<P class=3DMsoNormal style=3D"MARGIN: 0in 0in 0pt"><SPAN =
class=3Dtext><SPAN=20
style=3D"FONT-SIZE: 14pt; COLOR: #330033"><FONT size=3D3>Dear=20
Colleagues:</FONT></SPAN></SPAN></P>
<P class=3DMsoNormal style=3D"MARGIN: 0in 0in 0pt"><SPAN =
class=3Dtext><B><SPAN=20
style=3D"FONT-SIZE: 14pt; COLOR: #330033"></SPAN></B></SPAN>&nbsp;</P>
<P class=3DMsoNormal style=3D"MARGIN: 0in 0in 0pt"><SPAN =
class=3Dtext><B><SPAN=20
style=3D"FONT-SIZE: 14pt; COLOR: #330033">CALL FOR PAPERS<?xml:namespace =
prefix =3D=20
o ns =3D "urn:schemas-microsoft-com:office:office"=20
/><o:p></o:p></SPAN></B></SPAN></P>
<P class=3DMsoNormal style=3D"MARGIN: 0in 0in 0pt"><SPAN =
class=3Dtext><B><SPAN=20
style=3D"COLOR: #330033"><o:p>&nbsp;</o:p></SPAN></B></SPAN></P>
<P class=3DMsoNormal style=3D"MARGIN: 0in 0in 0pt"><SPAN =
class=3Dtext><B><SPAN=20
style=3D"FONT-SIZE: 14pt">NSF&nbsp;workshop on Reliable Engineering=20
Computing</SPAN></B></SPAN><B><SPAN style=3D"FONT-SIZE: =
14pt"><BR>Georgia=20
Institute of Technology<BR></SPAN></B><?xml:namespace prefix =3D st1 ns =
=3D=20
"urn:schemas-microsoft-com:office:smarttags" /><st1:date Month=3D"9" =
Day=3D"15"=20
Year=3D"2004"><SPAN class=3Dtext><B><SPAN style=3D"FONT-SIZE: =
14pt">September 15-17,=20
2004</SPAN></B></SPAN></st1:date><SPAN class=3Dtext><B><SPAN=20
style=3D"FONT-SIZE: 14pt"> | =
</SPAN></B></SPAN><st1:place><st1:City><SPAN=20
class=3Dtext><B><SPAN=20
style=3D"FONT-SIZE: 14pt">Savannah</SPAN></B></SPAN></st1:City><SPAN=20
class=3Dtext><B><SPAN style=3D"FONT-SIZE: 14pt">,=20
</SPAN></B></SPAN><st1:country-region><SPAN class=3Dtext><B><SPAN=20
style=3D"FONT-SIZE: =
14pt">Georgia</SPAN></B></SPAN></st1:country-region></st1:place><SPAN=20
class=3Dtext><B><SPAN style=3D"FONT-SIZE: 14pt">,=20
</SPAN></B></SPAN><st1:country-region><st1:place><SPAN =
class=3Dtext><B><SPAN=20
style=3D"FONT-SIZE: =
14pt">USA</SPAN></B></SPAN></st1:place></st1:country-region><B><SPAN=20
style=3D"FONT-SIZE: 14pt"><BR></SPAN></B><BR><SPAN class=3Dtext>Across =
all branches=20
of engineering, computational methods share the need for reliable =
results.&nbsp;=20
Reliability can be achieved only if all sources of errors, =
approximations, and=20
uncertainty are accounted for.</SPAN><BR><BR><SPAN class=3Dtext>This =
workshop is=20
unique in combining computer science, mathematics, and engineering =
analysis and=20
design to discuss the reliability of engineering computations, providing =
a=20
common forum by which to continue cross-disciplinary advisements in the=20
field.<o:p></o:p></SPAN></P>
<P class=3DMsoNormal style=3D"MARGIN: 0in 0in 0pt"><SPAN=20
class=3Dtext><o:p>&nbsp;</o:p></SPAN></P>
<P class=3DMsoNormal style=3D"MARGIN: 0in 0in 0pt"><SPAN =
class=3Dtext>Participants are=20
expected to submit papers that will be published in the workshop =
proceedings and=20
also will be available online from the workshop web site.<SPAN=20
style=3D"mso-spacerun: yes">&nbsp; </SPAN>After the workshop, =
</SPAN>selected=20
papers will be published in a special issue(s) of Reliable Computing =
journal.=20
The papers will go through the normal refereeing process.<BR><SPAN=20
style=3D"mso-spacerun: yes">&nbsp;</SPAN></P>
<P class=3DMsoNormal style=3D"MARGIN: 0in 0in 0pt">Workshop website: <A=20
href=3D"http://www.gtsav.gatech.edu/rec/recworkshop">www.gtsav.gatech.edu=
/rec/recworkshop</A></P>
<P class=3DMsoNormal style=3D"MARGIN: 0in 0in 0pt"><o:p>&nbsp;</o:p></P>
<P class=3DMsoNormal style=3D"MARGIN: 0in 0in 0pt"><B><SPAN=20
style=3D"FONT-SIZE: 14pt">Topics include but not limited to:=20
<o:p></o:p></SPAN></B></P>
<P class=3DMsoNormal=20
style=3D"MARGIN: 0in 0in 0pt 0.5in; TEXT-INDENT: -0.25in; mso-list: l0 =
level1 lfo1; tab-stops: list .5in"><SPAN=20
class=3Dhelv><SPAN=20
style=3D"FONT-FAMILY: Helvetica; mso-fareast-font-family: =
Helvetica"><SPAN=20
style=3D"mso-list: Ignore">-<SPAN=20
style=3D"FONT: 7pt 'Times New =
Roman'">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=20
</SPAN></SPAN></SPAN></SPAN><SPAN dir=3Dltr><SPAN =
class=3Dhelv>Measurement of=20
reliability of algorithms and computations;<o:p></o:p></SPAN></SPAN></P>
<P class=3DMsoNormal=20
style=3D"MARGIN: 0in 0in 0pt 0.5in; TEXT-INDENT: -0.25in; mso-list: l0 =
level1 lfo1; tab-stops: list .5in"><SPAN=20
class=3Dhelv><SPAN=20
style=3D"FONT-FAMILY: Helvetica; mso-fareast-font-family: =
Helvetica"><SPAN=20
style=3D"mso-list: Ignore">-<SPAN=20
style=3D"FONT: 7pt 'Times New =
Roman'">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=20
</SPAN></SPAN></SPAN></SPAN><SPAN dir=3Dltr><SPAN =
class=3Dhelv>Integration of=20
various sources of errors in engineering calculations;=20
<o:p></o:p></SPAN></SPAN></P>
<P class=3DMsoNormal=20
style=3D"MARGIN: 0in 0in 0pt 0.5in; TEXT-INDENT: -0.25in; mso-list: l0 =
level1 lfo1; tab-stops: list .5in"><SPAN=20
style=3D"FONT-FAMILY: Helvetica; mso-fareast-font-family: =
Helvetica"><SPAN=20
style=3D"mso-list: Ignore">-<SPAN=20
style=3D"FONT: 7pt 'Times New =
Roman'">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=20
</SPAN></SPAN></SPAN><SPAN dir=3Dltr><SPAN class=3Dhelv>Integrating =
uncertainty into=20
analysis and design.</SPAN></SPAN></P>
<P class=3DMsoNormal style=3D"MARGIN: 0in 0in 0pt"><o:p>&nbsp;</o:p></P>
<P class=3DMsoNormal style=3D"MARGIN: 0in 0in 0pt"><B><SPAN=20
style=3D"FONT-SIZE: 14pt">Deadlines:<o:p></o:p></SPAN></B></P>
<P class=3DMsoNormal style=3D"MARGIN: 0in 0in 0pt"><st1:date Month=3D"5" =
Day=3D"15"=20
Year=3D"2004">May 15, 2004</st1:date>:<SPAN=20
style=3D"mso-spacerun: yes">&nbsp;&nbsp;&nbsp;&nbsp; </SPAN>deadline for =
abstract=20
submission</P>
<P class=3DMsoNormal style=3D"MARGIN: 0in 0in 0pt"><st1:date Month=3D"6" =
Day=3D"1"=20
Year=3D"2004">June 01, 2004</st1:date>:<SPAN=20
style=3D"mso-spacerun: yes">&nbsp;&nbsp;&nbsp;&nbsp; </SPAN>notification =
of=20
acceptance</P>
<P class=3DMsoNormal style=3D"MARGIN: 0in 0in 0pt"><st1:date Month=3D"8" =
Day=3D"1"=20
Year=3D"2004">August 01, 2004</st1:date>:<SPAN style=3D"mso-spacerun: =
yes">&nbsp;=20
</SPAN>deadline for paper submission</P>
<P class=3DMsoNormal style=3D"MARGIN: 0in 0in 0pt"><o:p>&nbsp;</o:p></P>
<P class=3DMsoNormal style=3D"MARGIN: 0in 0in 0pt"><B>For more =
information, please=20
contact Prof. Muhanna<SPAN=20
style=3D"mso-tab-count: 1">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=20
</SPAN><o:p></o:p></B></P>
<P class=3DMsoNormal style=3D"MARGIN: 0in 0in 0pt 0.5in">Email:<SPAN=20
style=3D"mso-tab-count: 1"> </SPAN><A=20
href=3D"mailto:rec [at] gtrep [dot] gatech.edu">rec [at] gtrep [dot] gatech.edu</A></P>
<P class=3DMsoNormal style=3D"MARGIN: 0in 0in 0pt 0.5in">Phone:<SPAN=20
style=3D"mso-spacerun: yes">&nbsp; </SPAN>(912) 966-7931</P>
<P class=3DMsoNormal style=3D"MARGIN: 0in 0in 0pt 0.5in">Fax:<SPAN=20
style=3D"mso-tab-count: 1">&nbsp;&nbsp;&nbsp;&nbsp; </SPAN><SPAN=20
style=3D"mso-spacerun: yes">&nbsp;</SPAN>(912) 966-7928</P>
<P class=3DMsoNormal style=3D"MARGIN: 0in 0in 0pt"><o:p>&nbsp;</o:p></P>
<P class=3DMsoNormal style=3D"MARGIN: 0in 0in 0pt"><SPAN =
class=3Dtext1><B><SPAN=20
style=3D"FONT-SIZE: 14pt; COLOR: #330033">Honorary=20
Co-Chairmen</SPAN></B></SPAN><B><SPAN=20
style=3D"FONT-SIZE: 14pt; COLOR: #330033"><BR></SPAN></B><SPAN =
class=3Dtext1>Ramon=20
E. Moore</SPAN><BR><SPAN class=3Dtext1>Eldon R. =
Hansen</SPAN><BR><BR><SPAN=20
class=3Dtext1><B><SPAN=20
style=3D"FONT-SIZE: 14pt; COLOR: =
#330033">Chairman:</SPAN></B></SPAN><SPAN=20
style=3D"FONT-SIZE: 14pt"><BR></SPAN><SPAN class=3Dtext1><B><A=20
href=3D"mailto:rafi.muhanna [at] gtrep [dot] gatech.edu">Rafi L. Muhanna</A></B>, =
Georgia=20
Institute of Technology</SPAN><BR><B><SPAN=20
style=3D"COLOR: #330033"><BR></SPAN></B><SPAN class=3Dtext1><B><SPAN=20
style=3D"FONT-SIZE: 14pt; COLOR: =
#330033">Co-Chairman:</SPAN></B></SPAN><B><SPAN=20
style=3D"FONT-SIZE: 14pt; COLOR: #330033"><BR></SPAN><SPAN =
class=3Dtext1><A=20
href=3D"mailto:rlm [at] cwru [dot] edu">Robert L. Mullen</A></SPAN></B><SPAN =
class=3Dtext1>,=20
Case Western Reserve University</SPAN><BR><BR><SPAN =
class=3Dhelv><B><SPAN=20
style=3D"FONT-SIZE: 14pt; COLOR: #330033">Scientific=20
Committee:</SPAN></B></SPAN><B><SPAN=20
style=3D"FONT-SIZE: 14pt; COLOR: #330033"><BR></SPAN></B><SPAN =
class=3Dtext1>G=F6tz=20
Alefeld, University of Karlsruhe, Germany</SPAN><BR><SPAN =
class=3Dtext1>B. Ross=20
Barmish, University of Wisconsin-Madison</SPAN><BR><SPAN =
class=3Dtext1>Daniel=20
Berleant, Iowa State University</SPAN><BR><SPAN class=3Dtext1>David =
Bogle</SPAN>,=20
University College London<SPAN class=3Dtext1> </SPAN><BR><SPAN =
class=3Dtext1>Kyung=20
Choi, The University of Iowa </SPAN><BR><SPAN class=3Dtext1>George =
Corliss,=20
Marquette University</SPAN><BR><SPAN class=3Dtext1>William Edmonson, =
University of=20
Hampton</SPAN><BR><SPAN class=3Dtext1>Scott Ferson</SPAN><SPAN =
class=3Dhelv>,=20
Applied Biomathematics</SPAN><BR><SPAN class=3Dtext1>Roger Ghanem, Johns =
Hopkins=20
University</SPAN><BR><SPAN class=3Dtext1>Raphael Haftka, University of=20
Florida</SPAN><BR><SPAN class=3Dtext1>Baker Kearfott, University of =
Louisiana at=20
Lafayette</SPAN><BR><SPAN class=3Dtext1>Vladik Kreinovich, University of =
Texas at=20
El Paso</SPAN><BR><SPAN class=3Dtext1>Zissimos Mourelatos, Oakland=20
University</SPAN><BR><SPAN class=3Dtext1>Arnold Neumaier, University of =
Vienna,=20
Austria</SPAN><BR><SPAN class=3Dtext1>Efstratios Nikolaidis, University =
of=20
Toledo</SPAN><BR><SPAN class=3Dtext1>Steve Wojtkiewicz, Sandia National=20
Laboratories</SPAN><BR><SPAN class=3Dtext1>