From owner-reliable_computing [at] interval [dot] louisiana.edu Mon May  5 06:56:43 2003
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h45BuhQ24119
	for reliable_computing-outgoing; Mon, 5 May 2003 06:56:43 -0500 (CDT)
Received: (from rbk5287@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h45Bue324114
	for reliable_computing [at] interval [dot] louisiana.edu; Mon, 5 May 2003 06:56:40 -0500 (CDT)
Received: from mail.your.biglobe.net (mdsv0117.ht.necidc.net [202.225.207.146])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with SMTP id h44CLmM22997
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sun, 4 May 2003 07:21:49 -0500 (CDT)
Received: (biglobe-qmail 1926 invoked by uid 0); 4 May 2003 21:21:24 +0900
Received: from esu1 by biglobe-qmail with SMTP; 4 May 2003 21:21:24 +0900
Message-ID: <001901c31237$af7f90a0$0c01610a@esu1>
From: "Shin'ichi OISHI" <oishi [at] waseda [dot] jp>
To: <reliable_computing [at] interval [dot] louisiana.edu>,
   <reliable_computing [at] interval [dot] usl.edu>
References: <2.2.32.20030409121714.009e76c8 [at] pop [dot] louisiana.edu>
Subject: How to change the rounding modes on Mac Power Book G4
Date: Sun, 4 May 2003 21:21:27 +0900
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.1106
X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2800.1106
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

Dear Colleagues:

I would like to know how to change the rounding mode 
of doubles of IEEE754 on Mac Power Book G4.
Os is Mac OS X.2.5 with developer tools.  
I am programming using C-language with gcc compiler 
on this OS.

Sincerely yours,
Shin'ichi OISHI 
Professor
Waseda University,
Tokyo, Japan


From owner-reliable_computing [at] interval [dot] louisiana.edu Mon May  5 07:36:12 2003
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h45CaBK24313
	for reliable_computing-outgoing; Mon, 5 May 2003 07:36:11 -0500 (CDT)
Received: from keen.esi.ac.at (keen.esi.ac.at [193.170.117.2])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id h45Ca6M24309
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 5 May 2003 07:36:07 -0500 (CDT)
Received: from keen.esi.ac.at (localhost [127.0.0.1])
	by keen.esi.ac.at (8.12.8/8.12.8) with ESMTP id h45Ca2rY001158;
	Mon, 5 May 2003 14:36:02 +0200
Received: (from herman@localhost)
	by keen.esi.ac.at (8.12.8/8.12.8/Submit) id h45CZxFS001156;
	Mon, 5 May 2003 14:35:59 +0200
Date: Mon, 5 May 2003 14:35:59 +0200
From: Hermann Schichl <herman [at] esi [dot] ac.at>
To: "Shin'ichi OISHI" <oishi [at] waseda [dot] jp>
Cc: reliable_computing [at] interval [dot] louisiana.edu,
   reliable_computing [at] interval [dot] usl.edu
Subject: Re: How to change the rounding modes on Mac Power Book G4
Message-ID: <20030505123559.GA987 [at] keen [dot] esi.ac.at>
References: <2.2.32.20030409121714.009e76c8 [at] pop [dot] louisiana.edu> <001901c31237$af7f90a0$0c01610a@esu1>
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Disposition: inline
In-Reply-To: <001901c31237$af7f90a0$0c01610a@esu1>
User-Agent: Mutt/1.4.1i
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

Dear Prof. Oishi!

On Sun, May 04, 2003 at 09:21:27PM +0900, Shin'ichi OISHI wrote:
> Dear Colleagues:
> 
> I would like to know how to change the rounding mode 
> of doubles of IEEE754 on Mac Power Book G4.
> Os is Mac OS X.2.5 with developer tools.  
> I am programming using C-language with gcc compiler 
> on this OS.
>
If you are using a fairly new version of the GCC compiler and
compatible libraries, which support ISO C 99 standard, then there
is a header
   fenv.h
which you should include. Then the proper function is
   int fesetround (int __rounding_direction)
where __rounding_direction is one of
   FE_TONEAREST
   FE_UPWARD
   FE_DOWNWARD
   FE_TOWARDZERO

and
   int fegetround (void)
returns the current rounding mode.

This header also contains the functions needed for handling
FP exceptions and FP environments and the like:
   int feclearexcept (int __excepts)
   int fegetexcept (fexcept_t *__flagp, int __excepts)
   int feraiseexcept (int __excepts)
   int fesetexcept (__const fexcept_t *__flagp, int __excepts)
   int fetestexcept (int __excepts)
   int fegetenv (fenv_t *__envp)
   int feholdexcept (fenv_t *__envp)
   int fesetenv (__const fenv_t *__envp)
   int feupdateenv (__const fenv_t *__envp)

This should work on Mac OS X as well, since the Apple Developers page
lists these functions as available for Mac OS X.

Best regards,
Hermann Schichl
> 
> Sincerely yours,
> Shin'ichi OISHI 
> Professor
> Waseda University,
> Tokyo, Japan

From owner-reliable_computing [at] interval [dot] louisiana.edu Mon May  5 07:51:42 2003
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h45Cpgs24432
	for reliable_computing-outgoing; Mon, 5 May 2003 07:51:42 -0500 (CDT)
Received: from hera.cs.brandeis.edu (IDENT:root [at] hera [dot] cs.brandeis.edu [129.64.3.192])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id h45CpbM24428
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 5 May 2003 07:51:37 -0500 (CDT)
Received: (from dkw@localhost)
	by hera.cs.brandeis.edu (8.9.3/8.9.3) id IAA00920;
	Mon, 5 May 2003 08:51:29 -0400
Date: Mon, 5 May 2003 08:51:29 -0400
From: David Wittenberg <dkw [at] cs [dot] brandeis.edu>
To: "Shin'ichi OISHI" <oishi [at] waseda [dot] jp>
Cc: reliable_computing [at] interval [dot] louisiana.edu,
   reliable_computing [at] interval [dot] usl.edu
Subject: Re: How to change the rounding modes on Mac Power Book G4
Message-ID: <20030505085129.A895 [at] cs [dot] brandeis.edu>
References: <2.2.32.20030409121714.009e76c8 [at] pop [dot] louisiana.edu> <001901c31237$af7f90a0$0c01610a@esu1>
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Disposition: inline
User-Agent: Mutt/1.2.5.1i
In-Reply-To: <001901c31237$af7f90a0$0c01610a@esu1>; from oishi [at] waseda [dot] jp on Sun, May 04, 2003 at 09:21:27PM +0900
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

On Sun, May 04, 2003 at 09:21:27PM +0900, Shin'ichi OISHI wrote:
> Dear Colleagues:
> 
> I would like to know how to change the rounding mode 
> of doubles of IEEE754 on Mac Power Book G4.
> Os is Mac OS X.2.5 with developer tools.  
> I am programming using C-language with gcc compiler 
> on this OS.

Here is the code we use in CLIP.  It includes a few comments from when
I was figuring out what does what.  It defines macros rounddn  to
round down, roundpu to round up, and roundnr to round to nearest.


/* ppc bits for rounding modes 

FPSCR Bit settings - RN field  (bits 30, 31)

RN       Mode
00	 round to nearest  (in case of tie, pick even)
01	 round toward 0
10	 round toward + infinity
11	 round toward - infinity 


To set the rounding direction, use the mtfsfi instruction. It has the form 

      mtfsfi    DST, n 

      where DST is a 4-bit FPSCR field and n is an integer value to be 
        copied into DST. Here are some examples.

      mtfsfi   7,0   # set rounding direction to to-nearest
      mtfsfi   7,1   # set rounding direction to toward-zero
      mtfsfi   7,2   # set rounding direction to upward
      mtfsfi   7,3   # set rounding direction to downward

 */


#ifdef __ppc__
/*  set rounding to round toward - infinity*/
#define rounddn  __asm__ ("mtfsfi 7,3") ;

/*  set rounding to round toward +infinity*/
#define roundup   __asm__ ("mtfsfi 7,2") ;

/* set rounding to round toward nearest  */
#define roundnr  __asm__ ("mtfsfi 7,0") ;

#endif  /* def ppc */



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

From owner-reliable_computing [at] interval [dot] louisiana.edu Mon May  5 08:25:19 2003
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h45DPIL24591
	for reliable_computing-outgoing; Mon, 5 May 2003 08:25:18 -0500 (CDT)
Received: from hera.cs.brandeis.edu (IDENT:root [at] hera [dot] cs.brandeis.edu [129.64.3.192])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id h45DPBM24587
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 5 May 2003 08:25:11 -0500 (CDT)
Received: (from dkw@localhost)
	by hera.cs.brandeis.edu (8.9.3/8.9.3) id JAA00982;
	Mon, 5 May 2003 09:24:57 -0400
Date: Mon, 5 May 2003 09:24:57 -0400
From: David Wittenberg <dkw [at] cs [dot] brandeis.edu>
To: Hermann Schichl <herman [at] esi [dot] ac.at>
Cc: "Shin'ichi OISHI" <oishi [at] waseda [dot] jp>,
   reliable_computing [at] interval [dot] louisiana.edu,
   reliable_computing [at] interval [dot] usl.edu
Subject: Re: How to change the rounding modes on Mac Power Book G4
Message-ID: <20030505092457.B895 [at] cs [dot] brandeis.edu>
References: <2.2.32.20030409121714.009e76c8 [at] pop [dot] louisiana.edu> <001901c31237$af7f90a0$0c01610a@esu1> <20030505123559.GA987 [at] keen [dot] esi.ac.at>
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Disposition: inline
User-Agent: Mutt/1.2.5.1i
In-Reply-To: <20030505123559.GA987 [at] keen [dot] esi.ac.at>; from herman [at] esi [dot] ac.at on Mon, May 05, 2003 at 02:35:59PM +0200
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

On Mon, May 05, 2003 at 02:35:59PM +0200, Hermann Schichl wrote:
> Dear Prof. Oishi!
> >
> If you are using a fairly new version of the GCC compiler and
> compatible libraries, which support ISO C 99 standard, then there
> is a header
>    fenv.h
> which you should include. Then the proper function is
>    int fesetround (int __rounding_direction)
> where __rounding_direction is one of
>    FE_TONEAREST
>    FE_UPWARD
>    FE_DOWNWARD
>    FE_TOWARDZERO
> 
> and
>    int fegetround (void)
> returns the current rounding mode.

There was a bug in GCC optimization, where the optimizer would move
arithmetic operations across changes in rounding mode, causing the
obvious errors.  Do you know if this bug has been fixed?

We compile with -O0 (that's capital "Oh" followed by digit "zero") to
avoid this problem.

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

From owner-reliable_computing [at] interval [dot] louisiana.edu Mon May  5 09:46:04 2003
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h45Ek3U24806
	for reliable_computing-outgoing; Mon, 5 May 2003 09:46:03 -0500 (CDT)
Received: from mail.your.biglobe.net (mdsv0117.ht.necidc.net [202.225.207.146])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with SMTP id h45EjvM24802
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 5 May 2003 09:45:57 -0500 (CDT)
Received: (biglobe-qmail 21054 invoked by uid 0); 5 May 2003 23:45:49 +0900
Received: from waseda.jp by biglobe-qmail with SMTP; 5 May 2003 23:45:49 +0900
Date: Mon, 5 May 2003 23:46:00 +0900
Subject: Re: How to change the rounding modes on Mac Power Book G4
Content-Type: text/plain; charset=US-ASCII; format=flowed
Mime-Version: 1.0 (Apple Message framework v552)
Cc: reliable_computing [at] interval [dot] louisiana.edu
To: Hermann Schichl <herman [at] esi [dot] ac.at>
From: "Shin'ichi OISHI" <oishi [at] waseda [dot] jp>
In-Reply-To: <20030505123559.GA987 [at] keen [dot] esi.ac.at>
Message-Id: <49B9006A-7F08-11D7-87E7-000393D4DC48 [at] waseda [dot] jp>
Content-Transfer-Encoding: 7bit
X-Mailer: Apple Mail (2.552)
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

Dear Prof. Schichl;

I know now the following works on my Mac.
Thank you very much for your valuable informations.

Best regards,
Shin'ichi OISHI

On 2003.5.5, at 09:35, Hermann Schichl wrote:

> Dear Prof. Oishi!
>
> On Sun, May 04, 2003 at 09:21:27PM +0900, Shin'ichi OISHI wrote:
>> Dear Colleagues:
>>
>> I would like to know how to change the rounding mode
>> of doubles of IEEE754 anon Mac Power Book G4.
>> Os is Mac OS X.2.5 with developer tools.
>> I am programming using C-language with gcc compiler
>> on this OS.
>>
> If you are using a fairly new version of the GCC compiler and
> compatible libraries, which support ISO C 99 standard, then there
> is a header
>    fenv.h
> which you should include. Then the proper function is
>    int fesetround (int __rounding_direction)
> where __rounding_direction is one of
>    FE_TONEAREST
>    FE_UPWARD
>    FE_DOWNWARD
>    FE_TOWARDZERO
>
> and
>    int fegetround (void)
> returns the current rounding mode.
>
> This header also contains the functions needed for handling
> FP exceptions and FP environments and the like:
>    int feclearexcept (int __excepts)
>    int fegetexcept (fexcept_t *__flagp, int __excepts)
>    int feraiseexcept (int __excepts)
>    int fesetexcept (__const fexcept_t *__flagp, int __excepts)
>    int fetestexcept (int __excepts)
>    int fegetenv (fenv_t *__envp)
>    int feholdexcept (fenv_t *__envp)
>    int fesetenv (__const fenv_t *__envp)
>    int feupdateenv (__const fenv_t *__envp)
>
> This should work on Mac OS X as well, since the Apple Developers page
> lists these functions as available for Mac OS X.
>
> Best regards,
> Hermann Schichl
>>
>> Sincerely yours,
>> Shin'ichi OISHI
>> Professor
>> Waseda University,
>> Tokyo, Japan
>


From owner-reliable_computing [at] interval [dot] louisiana.edu Mon May  5 09:59:56 2003
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h45ExuC24920
	for reliable_computing-outgoing; Mon, 5 May 2003 09:59:56 -0500 (CDT)
Received: from mail.your.biglobe.net (mdsv0020.ht.necidc.net [202.225.207.135])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with SMTP id h45ExnM24914
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 5 May 2003 09:59:49 -0500 (CDT)
Received: (biglobe-qmail 28486 invoked by uid 0); 5 May 2003 23:59:41 +0900
Received: from waseda.jp by biglobe-qmail with SMTP; 5 May 2003 23:59:41 +0900
Date: Mon, 5 May 2003 23:59:52 +0900
Subject: Re: How to change the rounding modes on Mac Power Book G4
Content-Type: text/plain; charset=US-ASCII; format=flowed
Mime-Version: 1.0 (Apple Message framework v552)
Cc: reliable_computing [at] interval [dot] louisiana.edu
To: David Wittenberg <dkw [at] cs [dot] brandeis.edu>
From: "Shin'ichi OISHI" <oishi [at] waseda [dot] jp>
In-Reply-To: <20030505085129.A895 [at] cs [dot] brandeis.edu>
Message-Id: <399D23F2-7F0A-11D7-87E7-000393D4DC48 [at] waseda [dot] jp>
Content-Transfer-Encoding: 7bit
X-Mailer: Apple Mail (2.552)
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

Dear Prof. Wittenberg;

Thank you very much for you valuable informations.
I have tried the following and I confirmed that it works on my Mac.

Thank you very much also for your information about gcc optimization.

Sincerely yours,
Shin'ichi OISHI

On 2003.5.5, at 09:51, David Wittenberg wrote:

> On Sun, May 04, 2003 at 09:21:27PM +0900, Shin'ichi OISHI wrote:
>> Dear Colleagues:
>>
>> I would like to know how to change the rounding mode
>> of doubles of IEEE754 on Mac Power Book G4.
>> Os is Mac OS X.2.5 with developer tools.
>> I am programming using C-language with gcc compiler
>> on this OS.
>
> Here is the code we use in CLIP.  It includes a few comments from when
> I was figuring out what does what.  It defines macros rounddn  to
> round down, roundpu to round up, and roundnr to round to nearest.
>
>
> /* ppc bits for rounding modes
>
> FPSCR Bit settings - RN field  (bits 30, 31)
>
> RN       Mode
> 00	 round to nearest  (in case of tie, pick even)
> 01	 round toward 0
> 10	 round toward + infinity
> 11	 round toward - infinity
>
>
> To set the rounding direction, use the mtfsfi instruction. It has the 
> form
>
>       mtfsfi    DST, n
>
>       where DST is a 4-bit FPSCR field and n is an integer value to be
>         copied into DST. Here are some examples.
>
>       mtfsfi   7,0   # set rounding direction to to-nearest
>       mtfsfi   7,1   # set rounding direction to toward-zero
>       mtfsfi   7,2   # set rounding direction to upward
>       mtfsfi   7,3   # set rounding direction to downward
>
>  */
>
>
> #ifdef __ppc__
> /*  set rounding to round toward - infinity*/
> #define rounddn  __asm__ ("mtfsfi 7,3") ;
>
> /*  set rounding to round toward +infinity*/
> #define roundup   __asm__ ("mtfsfi 7,2") ;
>
> /* set rounding to round toward nearest  */
> #define roundnr  __asm__ ("mtfsfi 7,0") ;
>
> #endif  /* def ppc */
>
>
>
> -- 
> --David Wittenberg
> dkw [at] cs [dot] brandeis.edu
>


From owner-reliable_computing [at] interval [dot] louisiana.edu Mon May  5 12:08:26 2003
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h45H8Pw25167
	for reliable_computing-outgoing; Mon, 5 May 2003 12:08:25 -0500 (CDT)
Received: from hera.cs.brandeis.edu (IDENT:root [at] hera [dot] cs.brandeis.edu [129.64.3.192])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id h45H8KM25163
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 5 May 2003 12:08:21 -0500 (CDT)
Received: (from dkw@localhost)
	by hera.cs.brandeis.edu (8.9.3/8.9.3) id NAA01303
	for reliable_computing [at] interval [dot] louisiana.edu; Mon, 5 May 2003 13:08:14 -0400
Date: Mon, 5 May 2003 13:08:14 -0400
From: David Wittenberg <dkw [at] cs [dot] brandeis.edu>
To: reliable_computing [at] interval [dot] louisiana.edu
Subject: gcc optimizing over rounding mode changes
Message-ID: <20030505130814.G895 [at] cs [dot] brandeis.edu>
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Disposition: inline
User-Agent: Mutt/1.2.5.1i
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

Earlier today I mentioned that gcc might optimize over rounding mode
changes.  I just tested gcc 3.1 on Mac OS X, and found that it does
optimize incorrectly.

With the following code, I get the correct behaviour with no
optimization, and the wrong behaviour with gcc -O1 (or -O2)

    #include <math.h>
    #include <fenv.h>

    #define rounddn fesetround(FE_DOWNWARD);
    #define roundup fesetround(FE_UPWARD);

    void main()
    {
	 double x,y,z;

      rounddn;
      x = 1.0;
      y = 10.0;
     printf(" rounding down 1/10 is %30.20g \n", z);

      roundup;
      z = x/y;
      printf(" rounding up 1/10 is %30.20g \n", z);
    }

     dkw% gcc test_c_set_round.c

     dkw% a.out
     rounding down 1/10 is        0.099999999999999991673 
     rounding up 1/10 is         0.10000000000000000555 



     dkw% gcc -O1 test_c_set_round.c

     dkw% a.out
     rounding down 1/10 is        0.099999999999999991673 
     rounding up 1/10 is        0.099999999999999991673 




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

From owner-reliable_computing [at] interval [dot] louisiana.edu Mon May  5 16:29:19 2003
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h45LTJS25386
	for reliable_computing-outgoing; Mon, 5 May 2003 16:29:19 -0500 (CDT)
Received: from keen.esi.ac.at (keen.esi.ac.at [193.170.117.2])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id h45LTEM25382
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 5 May 2003 16:29:14 -0500 (CDT)
Received: from keen.esi.ac.at (localhost [127.0.0.1])
	by keen.esi.ac.at (8.12.8/8.12.8) with ESMTP id h45LTArY005695;
	Mon, 5 May 2003 23:29:10 +0200
Received: (from herman@localhost)
	by keen.esi.ac.at (8.12.8/8.12.8/Submit) id h45LT821005693;
	Mon, 5 May 2003 23:29:08 +0200
Date: Mon, 5 May 2003 23:29:07 +0200
From: Hermann Schichl <herman [at] esi [dot] ac.at>
To: David Wittenberg <dkw [at] cs [dot] brandeis.edu>
Cc: reliable_computing [at] interval [dot] louisiana.edu,
   reliable_computing [at] interval [dot] usl.edu
Subject: Re: How to change the rounding modes on Mac Power Book G4
Message-ID: <20030505212907.GA5643 [at] keen [dot] esi.ac.at>
References: <2.2.32.20030409121714.009e76c8 [at] pop [dot] louisiana.edu> <001901c31237$af7f90a0$0c01610a@esu1> <20030505123559.GA987 [at] keen [dot] esi.ac.at> <20030505092457.B895 [at] cs [dot] brandeis.edu>
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Disposition: inline
In-Reply-To: <20030505092457.B895 [at] cs [dot] brandeis.edu>
User-Agent: Mutt/1.4.1i
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

On Mon, May 05, 2003 at 09:24:57AM -0400, David Wittenberg wrote:
> On Mon, May 05, 2003 at 02:35:59PM +0200, Hermann Schichl wrote:
> > Dear Prof. Oishi!
> > >
> > If you are using a fairly new version of the GCC compiler and
> > compatible libraries, which support ISO C 99 standard, then there
> > is a header
> >    fenv.h
> > which you should include. Then the proper function is
> >    int fesetround (int __rounding_direction)
> > where __rounding_direction is one of
> >    FE_TONEAREST
> >    FE_UPWARD
> >    FE_DOWNWARD
> >    FE_TOWARDZERO
> > 
> > and
> >    int fegetround (void)
> > returns the current rounding mode.
> 
> There was a bug in GCC optimization, where the optimizer would move
> arithmetic operations across changes in rounding mode, causing the
> obvious errors.  Do you know if this bug has been fixed?
> 
> We compile with -O0 (that's capital "Oh" followed by digit "zero") to
> avoid this problem.
>
As far as I know, this bug was in GCC 2.96 (or before) and should have
been fixed in gcc 3. Anyway, there was a workaround - as far as I remember
correctly - that
  #pragma STDC FENV_ACCESS ON
had to be set. By C99 standard this was required. I honestly don't
know, if this pragma is still required.

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

From owner-reliable_computing [at] interval [dot] louisiana.edu Mon May  5 16:53:30 2003
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h45LrTv25501
	for reliable_computing-outgoing; Mon, 5 May 2003 16:53:29 -0500 (CDT)
Received: from keen.esi.ac.at (keen.esi.ac.at [193.170.117.2])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id h45LrNM25497
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 5 May 2003 16:53:23 -0500 (CDT)
Received: from keen.esi.ac.at (localhost [127.0.0.1])
	by keen.esi.ac.at (8.12.8/8.12.8) with ESMTP id h45LrLrY005763;
	Mon, 5 May 2003 23:53:21 +0200
Received: (from herman@localhost)
	by keen.esi.ac.at (8.12.8/8.12.8/Submit) id h45LrL0c005761;
	Mon, 5 May 2003 23:53:21 +0200
Date: Mon, 5 May 2003 23:53:21 +0200
From: Hermann Schichl <herman [at] esi [dot] ac.at>
To: David Wittenberg <dkw [at] cs [dot] brandeis.edu>
Cc: reliable_computing [at] interval [dot] louisiana.edu
Subject: Re: gcc optimizing over rounding mode changes
Message-ID: <20030505215321.GB5643 [at] keen [dot] esi.ac.at>
References: <20030505130814.G895 [at] cs [dot] brandeis.edu>
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Disposition: inline
In-Reply-To: <20030505130814.G895 [at] cs [dot] brandeis.edu>
User-Agent: Mutt/1.4.1i
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

I have just tried that #pragma thing I have mentioned (after
checking the C99 standard). Still gcc does NOT optimize correctly,
so it is best if you put all functions using switched rounding
into separate C files and TURN OFF optimization for them.

On the GCC page, the pragmas are listed as unimplemented.

Best regards,
Hermann Schichl

On Mon, May 05, 2003 at 01:08:14PM -0400, David Wittenberg wrote:
> Earlier today I mentioned that gcc might optimize over rounding mode
> changes.  I just tested gcc 3.1 on Mac OS X, and found that it does
> optimize incorrectly.
> 
> With the following code, I get the correct behaviour with no
> optimization, and the wrong behaviour with gcc -O1 (or -O2)
> 
>     #include <math.h>
>     #include <fenv.h>
> 
>     #define rounddn fesetround(FE_DOWNWARD);
>     #define roundup fesetround(FE_UPWARD);
> 
>     void main()
>     {
> 	 double x,y,z;
> 
>       rounddn;
>       x = 1.0;
>       y = 10.0;
>      printf(" rounding down 1/10 is %30.20g \n", z);
> 
>       roundup;
>       z = x/y;
>       printf(" rounding up 1/10 is %30.20g \n", z);
>     }
> 
>      dkw% gcc test_c_set_round.c
> 
>      dkw% a.out
>      rounding down 1/10 is        0.099999999999999991673 
>      rounding up 1/10 is         0.10000000000000000555 
> 
> 
> 
>      dkw% gcc -O1 test_c_set_round.c
> 
>      dkw% a.out
>      rounding down 1/10 is        0.099999999999999991673 
>      rounding up 1/10 is        0.099999999999999991673 
> 
> 
> 
> 
> -- 
> --David Wittenberg
> dkw [at] cs [dot] brandeis.edu

From owner-reliable_computing [at] interval [dot] louisiana.edu Mon May  5 19:02:17 2003
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h4602G825718
	for reliable_computing-outgoing; Mon, 5 May 2003 19:02:16 -0500 (CDT)
Received: from sunshine.math.utah.edu (IDENT:12VU7JNnFTZWF7+11+F5MRwFg7SXLMYZ [at] sunshine [dot] math.utah.edu [128.110.198.2])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id h4602CM25714
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 5 May 2003 19:02:12 -0500 (CDT)
Received: from suncore.math.utah.edu (IDENT:pbjgCWMvHtnwcn581gRIjuNi+gPH4duf [at] suncore [dot] math.utah.edu [128.110.198.5])
	by sunshine.math.utah.edu (8.9.3p2/8.9.3) with ESMTP id SAA03582;
	Mon, 5 May 2003 18:02:03 -0600 (MDT)
Received: (from beebe@localhost)
	by suncore.math.utah.edu (8.9.3p2/8.9.3) id SAA13825;
	Mon, 5 May 2003 18:02:03 -0600 (MDT)
Date: Mon, 5 May 2003 18:02:03 -0600 (MDT)
From: "Nelson H. F. Beebe" <beebe [at] math [dot] utah.edu>
To: reliable_computing [at] interval [dot] louisiana.edu
Cc: beebe [at] math [dot] utah.edu, David Wittenberg <dkw [at] cs [dot] brandeis.edu>,
   Hermann Schichl <herman [at] esi [dot] ac.at>
X-US-Mail: "Center for Scientific Computing, Department of Mathematics, 110
        LCB, University of Utah, 155 S 1400 E RM 233, Salt Lake City, UT
        84112-0090, USA"
X-Telephone: +1 801 581 5254
X-FAX: +1 801 585 1640, +1 801 581 4148
X-URL: http://www.math.utah.edu/~beebe
Subject: Rounding control support by current C compilers
Message-ID: <CMM.0.92.0.1052179322.beebe [at] suncore [dot] math.utah.edu>
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

Correspondence on this list earlier today suggested use of
fesetround() and fesetround() for rounding control in C code.

This note is to point out the current limitations of that approach.
First, the feature is part of C99, but not C89.  Second, it is only
guaranteed to be available if __STDC_IEC_559__ is defined.  Third,
whether optimization thwarts its use is controlled by the FENV_ACCESS
pragma.

Compilers on several systems offer rounding control, but only through
vendor-specific interfaces, or compile-time options.  Here, I'm only
concerned with standardized control.

Of the more than 30 C compilers that I have access to on about 16
different flavors of Unix, only two, Intel's icc (IA-32) and ecc
(IA-64), claim to conform to the ISO C99 Standard (Programming
languages -- C, ISO/IEC 9899:1999(E)).  gcc-3.x is close, and so is
Sun Forte 7 cc, but neither yet have complete support.

On Sun Solaris 7, 8, and 9 (Forte 6 and 7 compiler releases), the
revised test program shown below can be linked and run like this:

	% cc -D__STDC_IEC_559__ round.c -R/opt/SUNWspro/lib \
		-L/opt/SUNWspro/lib  -lm9x && ./a.out

With optimization levels -g, -xO0, and -xO1, output is correct; with
higher levels, (-xO2, -xO3), both results are identical.  This
suggests that the pragma is not obeyed.  There is no mention of
FENV_ACCESS in the manual pages in the /opt/SUNWspro/man tree.  Nor is
there any mention of that symbol in the compiler binaries.

With gcc-3.2.3 on GNU/Linux on Intel IA-32, gcc-3.2.2 on GNU/Linux on
PowerPC, and gcc-3.2.3 on Mac OSX X PowerPC, the program compiles, and
produces correct output with -g or -O0, not with -O1, -O2, or -O3:

	% gcc -O0 round.c -lm && ./a.out
	rounding down 1/10 is        0.099999999999999991673    0x3fb9999999999999
	rounding up   1/10 is         0.10000000000000000555    0x3fb999999999999a

	% gcc -O1 round.c -lm && ./a.out
	rounding down 1/10 is        0.099999999999999991673    0x3fb999999999999a
	rounding up   1/10 is        0.099999999999999991673    0x3fb999999999999a

Despite a claim to the contrary in an earlier posting, I cannot find a
statement in the gcc-3.x manual about whether the pragma is supported
or not.

A grep search of the entire gcc-3.2.3 source code (released
23-Apr-2003) shows no source code mention of FENV_ACCESS at all, and
only a brief statement in file ./gcc/doc/extend.texi that is formatted
in ./gcc/doc/gcc.info-10, and says nothing useful:

>>   * `The default state for the `FENV_ACCESS' pragma (7.6.1).'

With the Intel icc and ecc compilers, I get the same correct behavior
as for gcc with -g and -O0, and incorrect output with -O1, -O2, -O3,
and -O4.  The Intel C++ Compiler User's Guide C99 manual (compiler
Version 7.1 Build 20030424Z) says on p. 64:

>> ...
>> These features are not supported:
>> 	#pragma STDC FP_CONTRACT
>> 	#pragma STDC FENV_ACCESS
>> 	#pragma STDC CX_LIMITED_RANGE
>> 	long double (128-bit representations)
>> ...

I conclude that it is premature to expect to use this C99 feature
reliably, or portably.  Indeed, personal experience going back to the
mid-1960s with Fortran, Pascal, C, and C++ compilers shows that it
usually takes 5 years or more for most compiler vendors to reach the
level of an ANSI/ISO programming language standard.  With C99, 4 years
and 5 months have already elapsed.

Here is the revised test program:

% cat round.c
#include <stdio.h>
#include <stdlib.h>
#include <math.h>

#if defined(__STDC_IEC_559__)
#pragma STDC FENV_ACCESS ON
#include <fenv.h>
#define rounddn fesetround(FE_DOWNWARD);
#define roundup fesetround(FE_UPWARD);
#else
#define rounddn
#define roundup
#endif

int
main(void)
{
    double x,
        y,
        z;
    union
    {
	double f;
	long long i;
    } D;

    x = 1.0;
    y = 10.0;

    rounddn;
    z = x / y;
    D.f = z;
    (void)printf("rounding down 1/10 is %30.20g\t0x%016llx\n", z, D.i);

    roundup;
    z = x / y;
    D.f = z;
    (void)printf("rounding up   1/10 is %30.20g\t0x%016llx\n", z, D.i);

    return (EXIT_SUCCESS);
}

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

From owner-reliable_computing [at] interval [dot] louisiana.edu Tue May  6 00:40:00 2003
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h465dwn26059
	for reliable_computing-outgoing; Tue, 6 May 2003 00:39:58 -0500 (CDT)
Received: from keen.esi.ac.at (keen.esi.ac.at [193.170.117.2])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id h465dqM26055
	for <reliable_computing [at] interval [dot] louisiana.edu>; Tue, 6 May 2003 00:39:52 -0500 (CDT)
Received: from keen.esi.ac.at (localhost [127.0.0.1])
	by keen.esi.ac.at (8.12.8/8.12.8) with ESMTP id h465dnrY008749;
	Tue, 6 May 2003 07:39:49 +0200
Received: (from herman@localhost)
	by keen.esi.ac.at (8.12.8/8.12.8/Submit) id h465dmvk008747;
	Tue, 6 May 2003 07:39:48 +0200
Date: Tue, 6 May 2003 07:39:48 +0200
From: Hermann Schichl <herman [at] esi [dot] ac.at>
To: "Nelson H. F. Beebe" <beebe [at] math [dot] utah.edu>
Cc: reliable_computing [at] interval [dot] louisiana.edu,
   David Wittenberg <dkw [at] cs [dot] brandeis.edu>, Hermann Schichl <herman [at] esi [dot] ac.at>
Subject: Re: Rounding control support by current C compilers
Message-ID: <20030506053948.GA8735 [at] keen [dot] esi.ac.at>
References: <CMM.0.92.0.1052179322.beebe [at] suncore [dot] math.utah.edu>
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Disposition: inline
In-Reply-To: <CMM.0.92.0.1052179322.beebe [at] suncore [dot] math.utah.edu>
User-Agent: Mutt/1.4.1i
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

On Mon, May 05, 2003 at 06:02:03PM -0600, Nelson H. F. Beebe wrote:
> 
> Despite a claim to the contrary in an earlier posting, I cannot find a
> statement in the gcc-3.x manual about whether the pragma is supported
> or not.
>
As I have posted, the gcc 3.2.3 does not support the pragma.
It is on GNUs web page.

  http://gcc.gnu.org/gcc-3.1/c99status.html

Furthermore, adding the pragma and compiling with -Wunknown-pragmas
makes gcc more verbose, telling that it ignores the FENV_ACCESS pragma.

Hermann Schichl

From owner-reliable_computing [at] interval [dot] louisiana.edu Tue May  6 18:20:45 2003
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h46NKiY27107
	for reliable_computing-outgoing; Tue, 6 May 2003 18:20:44 -0500 (CDT)
Received: from mail.your.biglobe.net (mdsv0021.ht.necidc.net [202.225.207.136])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with SMTP id h46NKbM27103
	for <reliable_computing [at] interval [dot] louisiana.edu>; Tue, 6 May 2003 18:20:38 -0500 (CDT)
Received: (biglobe-qmail 20932 invoked by uid 0); 7 May 2003 08:20:09 +0900
Received: from waseda.jp by biglobe-qmail with SMTP; 7 May 2003 08:20:09 +0900
Date: Wed, 7 May 2003 08:20:21 +0900
Subject: Re: gcc optimizing over rounding mode changes
Content-Type: text/plain; charset=US-ASCII; format=flowed
Mime-Version: 1.0 (Apple Message framework v552)
Cc: reliable_computing [at] interval [dot] louisiana.edu
To: David Wittenberg <dkw [at] cs [dot] brandeis.edu>
From: "Shin'ichi OISHI" <oishi [at] waseda [dot] jp>
In-Reply-To: <20030505130814.G895 [at] cs [dot] brandeis.edu>
Message-Id: <4ED2AEFA-8019-11D7-B0D4-000393D4DC48 [at] waseda [dot] jp>
Content-Transfer-Encoding: 7bit
X-Mailer: Apple Mail (2.552)
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

Dear Dr. Wittenberg;

On 2003.5.6, at 02:08, David Wittenberg wrote:

> Earlier today I mentioned that gcc might optimize over rounding mode
> changes.  I just tested gcc 3.1 on Mac OS X, and found that it does
> optimize incorrectly.
>
> With the following code, I get the correct behaviour with no
> optimization, and the wrong behaviour with gcc -O1 (or -O2)
>
>     #include <math.h>
>     #include <fenv.h>
>
>     #define rounddn fesetround(FE_DOWNWARD);
>     #define roundup fesetround(FE_UPWARD);
>
>     void main()
>     {
> 	 double x,y,z;
>
>       rounddn;
>       x = 1.0;
>       y = 10.0;
>      printf(" rounding down 1/10 is %30.20g \n", z);
>
>       roundup;
>       z = x/y;
>       printf(" rounding up 1/10 is %30.20g \n", z);
>     }
>
>      dkw% gcc test_c_set_round.c
>
>      dkw% a.out
>      rounding down 1/10 is        0.099999999999999991673
>      rounding up 1/10 is         0.10000000000000000555
>
>
>
>      dkw% gcc -O1 test_c_set_round.c
>
>      dkw% a.out
>      rounding down 1/10 is        0.099999999999999991673
>      rounding up 1/10 is        0.099999999999999991673
>
> -- 
> --David Wittenberg
> dkw [at] cs [dot] brandeis.edu
>
>
I have confirmed this.  Thank you very much.   Probably as you know in 
such case, I use "volatile"
like

#include <math.h>
#include <fenv.h>

#define rounddn fesetround(FE_DOWNWARD);
#define roundup fesetround(FE_UPWARD);

int main()
{
    volatile double x,y,z;

    rounddn;
    x = 1.0;
    y = 10.0;
    z = x/y;
    printf(" rounding down 1/10 is %30.20g \n", z);

    roundup;
    z = x/y;
    printf(" rounding up 1/10 is %30.20g \n", z);
    return 0;
}
~
Then, even under the optimization option, we can get a correct result.

Sincerely yours,
Shin'ichi OISHI


From owner-reliable_computing [at] interval [dot] louisiana.edu Wed May  7 09:39:41 2003
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h47EdfP28035
	for reliable_computing-outgoing; Wed, 7 May 2003 09:39:41 -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 h47EdZM28031
	for <reliable_computing [at] interval [dot] louisiana.edu>; Wed, 7 May 2003 09:39:35 -0500 (CDT)
Received: from aragorn (aragorn [129.108.5.35])
	by cs.utep.edu (8.11.7/8.11.3) with SMTP id h47EdR026583
	for <reliable_computing [at] interval [dot] louisiana.edu>; Wed, 7 May 2003 08:39:27 -0600 (MDT)
Message-Id: <200305071439.h47EdR026583 [at] cs [dot] utep.edu>
Date: Wed, 7 May 2003 08:39:26 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: Fwd: FOURTH WORKSHOP ON THE DOE ADVANCED COMPUTATIONAL SOFTWARE COLLECTION
To: reliable_computing [at] interval [dot] louisiana.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: y7nu9WzGgl0UBByfkRJBkw==
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


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

X-Envelope-To: vladik [at] cs [dot] utep.edu
X-Authentication-Warning: mail.ncsa.uiuc.edu: majordomo set sender to 
owner-msi-hpcc [at] ncsa [dot] uiuc.edu using -f
X-Envelope-From: mclean [at] ncsa [dot] uiuc.edu
X-Sender: mclean [at] pop [dot] ncsa.uiuc.edu (Unverified)
Date: Wed, 07 May 2003 08:50:30 -0500
To: aNMSI [at] LISTSERV [dot] ANMSI.ORG, msi-hpcc [at] ncsa [dot] uiuc.edu
From: mclean [at] ncsa [dot] uiuc.edu
Subject: Fwd: FOURTH WORKSHOP ON THE DOE ADVANCED COMPUTATIONAL SOFTWARE 
COLLECTION
Mime-Version: 1.0
X-MD5SUM: 31a503074c8e8b423cf01bce1d1cb309


FYI!




>>FOURTH WORKSHOP ON THE DOE ADVANCED COMPUTATIONAL SOFTWARE COLLECTION
>>Robust and High Performance Tools for Scientific Computing
>>
>>Lawrence Berkeley National Laboratory
>>August 5-8, 2003
>>
>>The DOE Advanced CompuTational Software Collection (ACTS Collection,
>>http://acts.nersc.gov) comprises a set of tools mainly developed at the
>>Department of Energy's (DOE) laboratories. These
>>software tools aim to simplify the solution of common and important
>>computational problems and have substantially benefited a wide range of
>>scientific and industrial applications. These benefits are
>>accounted not only for running efficiently in high performing computing
>>environments but also realizing computation that would not have been
>>possible otherwise. Despite these successes, there is still
>>a need for a greater infrastructure to reach out academia and industry
>>through a dissemination and instruction on the state-of-the-art tools
>>for high performance computing environments and
>>simultaneously provide an umbrella for tool developers to receive the
>>feedback from these communities. This workshop is part of an approach to
>>build such an infrastructure.
>>
>>The four-day workshop will present an introduction to the ACTS
>>Collection for application scientists whose research demand includes
>>either large amounts of computation, a large volume of
>>data manipulation, the use of robust numerical algorithms, or
>>combinations of these.  The workshop will include a range of tutorials
>>on the tools (currently available in the collection and some
>>deliverables from the DOE SciDAC ISICs), discussion sessions aimed to
>>solve specific computational needs by the participants, and hands-on
>>practices using the NERSC's state-of-the-art computers.
>>We are planning to organize parallel sessions and group the tutorials by
>>
>>topics, as follows:
>>
>>        Direct and Iterative Methods for the solution of linear and
>>non-linear systems of equations
>>        PDE's and Multi-level Methods
>>        Numerical Optimization
>>        Structured and Unstructured meshes (Generation, Manipulation and
>>Computation)
>>        Development of High Performance Computing applications
>>        Performance monitoring and tuning
>>        Grid computing
>>
>>DOE will fully sponsor a limited number of graduate students and
>>postdoctoral fellows to participate in this event. This support includes
>>round-trip transportation to and from Berkeley, local
>>transportation, lodging, meals and workshop materials. Proposals from
>>other research scientists are also encouraged.
>>
>>The deadline for applications is June 9, 2003 and they should be
>>submitted using the application on-line form:
>>http://acts.nersc.gov/events/Workshop2003/application.html.
>>
>>Students and postdoctoral
>>fellows should submit an abstract describing the nature of their
>>work, future plans and/or current needs for computation. A letter of
>>recommendation from the applicant's supervisor also needs to be provided
>>using the recommendation on-line form:
>>http://acts.nersc.gov/events/Workshop2003/recommendation.html
>>  The recommendation letter must also arrive no later than June 9, 2003.
>>Other applicants must submit a letter outlining their current work and future
>>plans and needs for computational resources with a list of
>>publications . For more information on the workshop, please contact Tony
>>
>>Drummond at (510) 486-7624 or Osni Marques at (510) 486-5290.
>>
>>Important Dates:
>>
>>        Proposal submission deadline:   June 9, 2003
>>        Proposal review completed and invitations sent:  June 20, 2003
>>        Attendee confirmation of participation deadline:  June 30, 2003
>>--
>>------------------------------------------------------------
>>Tony Drummond
>>LBNL - MS 50F 1650             Phone: (510) 486-7624
>>One Cyclotron Rd                  FAX: (510) 486-5812
>>Berkeley, CA 94720             E-mail: LADrummond [at] lbl [dot] gov

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



From owner-reliable_computing [at] interval [dot] louisiana.edu Thu May  8 07:23:31 2003
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h48CNUw29209
	for reliable_computing-outgoing; Thu, 8 May 2003 07:23:30 -0500 (CDT)
Received: (from rbk5287@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h48CNQN29204
	for reliable_computing [at] interval [dot] louisiana.edu; Thu, 8 May 2003 07:23:26 -0500 (CDT)
Received: from liasun13.epfl.ch (liasun13.epfl.ch [128.178.155.37])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id h47FwkM28194
	for <reliable_computing [at] interval [dot] louisiana.edu>; Wed, 7 May 2003 10:58:46 -0500 (CDT)
Received: from lia.di.epfl.ch (jermann [at] liasun23 [dot] epfl.ch [128.178.155.62])
	by liasun13.epfl.ch (8.8.X/EPFL-8.1a) with ESMTP id RAA20125
	for <reliable_computing [at] interval [dot] louisiana.edu>; Wed, 7 May 2003 17:39:57 +0200 (MET DST)
Message-ID: <3EB92D2D.DEB7469B [at] lia [dot] di.epfl.ch>
Date: Wed, 07 May 2003 17:58:37 +0200
From: Christophe Jermann <jermann [at] lia [dot] di.epfl.ch>
Organization: EPFL, LIA
X-Mailer: Mozilla 4.76 [en] (X11; U; SunOS 5.8 sun4u)
X-Accept-Language: fr-FR, fr-CH, en
MIME-Version: 1.0
To: reliable_computing [at] interval [dot] louisiana.edu
Subject: [CFP] COCOS'03: second international workshop on Global Constrained 
 Optimization and Constraint Satisfaction
Content-Type: text/plain; charset=iso-8859-1
Content-Transfer-Encoding: 8bit
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

(Apologies if you receive multiple copies of this message.)

===========================================================
                    2nd Call for Papers

                        COCOS 2003
              Second International Workshop on
Global Constrained Optimization and Constraint Satisfaction


                      Olympic Museum
                   Lausanne, Switzerland
                 November 18th-21st, 2003

              http://liawww.epfl.ch/cocos03
===========================================================

IMPORTANT DATES 
---------------
* 20th Aug 2003 - Submission deadline 
* 20th Sep 2003 - Notification of acceptance 
* 30th Oct 2003 - Pre-registration ends 
* 30th Oct 2003 - Final camera-ready copies 

OBJECTIVES 
----------
    Continuous constraints are a natural way to represent 
many practical problems and the knowledge they involve.
Such constraints may be simple or complex, linear or 
non-linear and may, or may not, involve transcendental
functions. They are widely used to express, for example, 
chemical or mechanical models, process descriptions,
building codes or cost restrictions. Many industrial 
problems involving continuous constraints can be modeled 
as continuous constraint satisfaction and optimization 
problems (CSOPs). In practice, such models are often large 
in size and non-linear. 

    As the preceding workshop, this workshop focuses on 
complete solving techniques for continuous CSOPs that
provide all solutions with full rigor. Less rigorous solution 
techniques are not excluded, since they may be part of
complete relevant techniques. Complete solution techniques 
guarantee that all the constraints - e.g. security or
tolerance criteria - are satisfied and the global optima 
identified. Completeness would thus benefit directly the 
quality and reliability of decisions or analyses based on 
the provided solutions. This has obvious implications in 
many industrial and economic areas. 

    None of the existing approaches for solving non-linear 
CSOPs is fully satisfactory in practice. Non-linear
programming techniques are routinely used and can solve 
large-scale non-linear problems. However, they are
complete only in the convex case and if round off errors 
are controlled. In contrast, constraint programming solvers
preserve completeness, but suffer from poor scalability. 

    The respective strengths of mathematical and constraint 
programming appear however to be highly complementary and a 
number of recent developments showed that there is a lot to 
be gained by merging the different inference techniques they 
provide and by combining their specific advantages. 

    The goal of this workshop is to bring together communities 
from global optimization, mathematical programming and 
constraint programming, giving the opportunity to promote 
presentation and discussion of ongoing work on solving 
techniques for continuous CSOPs. The workshop aims at 
encouraging cross-fertilization between the various
approaches, including the study of adapted cooperation 
strategies between mathematical and constraint programming, 
and of new representations and abstractions for which they 
can efficiently interact. 

TOPICS 
------
Relevant topics include, but are by no means restricted 
to the following: 

* Solution techniques for global optimization problems 
* Integration of constraint programming with non-linear 
  programming techniques 
* Linear and nonlinear convex enclosures of nonlinear programs 
* Semidefinite programming techniques for global optimization 
* Improved consistency techniques for continuous constraints 
* Combination of symbolic methods with mathematical and 
  constraint programming techniques 
* Solution techniques for under-constrained systems 
* Adaptation of sparse matrix techniques to the non-linear case 
* Representation and exploitation of monotonicity and 
  convexity properties 
* Abstractions based on convex decomposition 
* Partial boundary representation based on critical points 
  and topological abstractions 

INVITED SPEAKERS
----------------
* Pr. John Hooker, Carnegie Mellon University
* Pr. Jean-Pierre Merlet, Coprin Team, INRIA: "Usual and unusual
applications of interval analysis"
* Pr. Jorge Moré, Mathematics and Computer Science Division, Argonne
National Laboratory

SUBMISSION 
----------
    The final deadline for submissions is August 20th. Submissions 
are expected in the form of extended abstracts. 

    An extended abstract must be at least 2 pages. It must be 
written in English and formatted using the standard LNCS/LNAI 
format (see instructions at
http://www.springer.de/comp/lncs/authors.html).
The title page should include the name, address and e-mail 
address for each author as well as a list of keywords. 

    Submissions have to be sent in postscript or PDF format 
to cocos03 [at] epfl [dot] ch. A contact author should be specified in
the submission mail.

REVIEWING PROCESS 
-----------------
    Submissions will be judged on significance, originality, 
quality and clarity. Each paper will be cross-reviewed by at
least two referees. Authors will receive feedback in the form 
of reviewers' comments. The accepted submissions will be 
presented during the workshop. 

PUBLICATION 
-----------
The organizers plan to publish a selection of full papers in 
an appropriate book series or a special issue of a journal.
After the workshop, authors of selected extended abstracts will 
be invited to submit a full paper with their contribution for 
this formal publication. Submitted full papers will then be 
formally reviewed before publication. 

LOCATION & ACCOMODATION
-----------------------
The workshop will take place at the Olympic Museum of Lausanne,
main city of the French speaking Canton of Vaud in Switzerland, 
from the 18th to the 21st of November 2003.

A number of hotel rooms will be pre-reserved for your convenience.

REGISTRATION
------------
The registration will be opened beginning of summer. Regular 
registration fee will be around 380 CHF, while student fee will
be approximately 190 CHF. The fees will include all workshop 
material, access to conference rooms, breaks and lunches

One author of each accepted submission must attend the workshop 
to present his contribution.

PROGRAMME COMMITTEE
-------------------
Frédéric Benhamou, Université de Nantes, France 
Christian Bliek, ILOG, France 
Boi Faltings, Ecole Polytechnique Fédérale de Lausanne, Switzerland 
Arnold Neumaier, University of Vienna, Austria 
Peter Spellucci, Darmstadt University, Germany 
Pascal Van Hentenryck, Brown University, USA 
Luis N. Vicente, University of Coimbra, Portugal 

ORGANIZATION & CONTACT
----------------------
Christophe Jermann & Djamila Sam-Haroud 

Artificial Intelligence Laboratory 
Institute of Core Computing Science 
School of Computer and Communication Sciences 
Swiss Federal Institute of Technology 
IN (Ecublens), CH-1015 Lausanne (Switzerland) 
Emails: Christophe.Jermann [at] epfl [dot] ch
        Jamila.Sam [at] epfl [dot] ch
WWW: http://liawww.epfl.ch/~jermann
     http://liawww.epfl.ch/~haroud
Phone: +41 21 693 52 09 
Fax:   +41 21 693 52 25

From owner-reliable_computing [at] interval [dot] louisiana.edu Thu May  8 07:23:47 2003
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h48CNlk29234
	for reliable_computing-outgoing; Thu, 8 May 2003 07:23:47 -0500 (CDT)
Received: (from rbk5287@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h48CNgA29225
	for reliable_computing [at] interval [dot] louisiana.edu; Thu, 8 May 2003 07:23:42 -0500 (CDT)
Received: from liasun13.epfl.ch (liasun13.epfl.ch [128.178.155.37])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id h47GRHM28239
	for <reliable_computing [at] interval [dot] louisiana.edu>; Wed, 7 May 2003 11:27:17 -0500 (CDT)
Received: from lia.di.epfl.ch (jermann [at] liasun23 [dot] epfl.ch [128.178.155.62])
	by liasun13.epfl.ch (8.8.X/EPFL-8.1a) with ESMTP id SAA20485
	for <reliable_computing [at] interval [dot] louisiana.edu>; Wed, 7 May 2003 18:08:10 +0200 (MET DST)
Message-ID: <3EB933DF.2A8F7017 [at] lia [dot] di.epfl.ch>
Date: Wed, 07 May 2003 18:27:11 +0200
From: Christophe Jermann <jermann [at] lia [dot] di.epfl.ch>
Organization: EPFL, LIA
X-Mailer: Mozilla 4.76 [en] (X11; U; SunOS 5.8 sun4u)
X-Accept-Language: fr-FR, fr-CH, en
MIME-Version: 1.0
To: reliable_computing [at] interval [dot] louisiana.edu
Subject: [CFP] IntCP2003: 1st international workshop on Interval Analysis and 
 Constraint Propagation for Applications
Content-Type: text/plain; charset=iso-8859-1
Content-Transfer-Encoding: 8bit
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

(we apologize for possible multiple reception of this call)
=================================================================
                        CALL FOR PAPERS

                      IntCP 2003 workshop
  Interval Analysis and Constraint Propagation for Applications

                      Actons Hotel, Kinsale,
                      County Cork,  Ireland
                       29th September 2003

                  Held in conjunction with the
          Ninth International Conference on Principles 
         and Practice of Constraint Programming (CP 2003) 
=================================================================

* Important Dates:
------------------
01 Jul 2003 - Submission deadline
31 Jul 2003 - Notification of acceptance
15 Aug 2003 - Final camera-ready copies
29 Sep 2003 - Workshop day

* Description and goals:
------------------------
Many practical problems involve numerical constraints as an essential 
component. While constraint propagation solvers have proven particularly 
efficient in solving challenging instances of numerical problems with 
nonlinear constraints, they do not yet have enough appeal in many 
practical problem areas.

The goal of this workshop is to bring together researchers and
practitioners working on constraint propagation and interval analysis,
giving the opportunity to promote presentation and discussion on ongoing
work on techniques for real-world requirements.

For example, many practical problems often have a continuum of solutions
which express a spectrum of equally relevant choices, as the possible 
moving areas of a mobile robot, the collision regions between objects in 
mechanical assembly, or different alternatives of shapes for the
components 
of a kinematic chain. These alternatives need to be identified using
complete 
solving techniques. Completeness means the ability to find all solutions
if 
any, or else to prove that there are no solutions to the problem.  

Constraint propagation solvers, although complete, provide enclosures
that 
are either prohibitively verbose or poorly informative. In contrast, a 
number of interval analysis approaches have been developed, notably in
the 
area of robust control, estimation, and robotics, which can
significantly 
enhance the capabilities of interval-based solvers. They consist in
covering the spectrum of solutions using a reduced number of subsets
of R. Usually, these subsets are chosen with known and simple properties 
(interval boxes, polytopes, ellipsoids,...). 

Other questions that are often relevant in applications include, but are 
by no means restricted to:
- uncertainty that can, for example, be modeled, by logical quantifiers,
- specific problem structure, for example in the case of discrete time, 
  continuous state systems,
- mixture of discrete and continuous problem variables, 
- inequality constraints, 
- problems with a huge number of discrete solutions.

We seek contributions that address such questions, and present relevant 
software tools, algorithms, theoretical results, or applications of
dedicated 
techniques to real-world problems.

* Workshop format:
------------------
This is a half-day workshop, with open attendance. Its aim is to provide 
a forum where researchers currently working in this area can discuss
their 
most recent ideas and developments and think together about the most
promising 
new directions. We particularly encourage the presentation of work that
bridge 
the gap between theory and practice.

* Submissions:
--------------
People wishing to give a talk should submit an extended abstract of at
least
2 pages. Submissions must be formatted using LNCS packages (see CP
formatting 
instructions). The title page should include the name, address,
telephone 
number and electronic mailing address for each author. Please, email all 
submissions in postscript or pdf format to intcp03 [at] epfl [dot] ch by July 1st, 
2003, specifying the name of the contact author in the message.

* Reviewing process:
--------------------
Submissions will be reviewed by at least one committee member, and will
be 
selected on the basis of their contribution to the topic of the
workshop. 
Authors will receive feedback in the form of reviewers' comments. 

* Accomodation/Registration:
----------------------------
Accomodation is provided by the hosting conference CP 2003. All workshop 
attendees must pay the CP 2003 regular registration fee in addition 
to the workshop fee. At least one author of each accepted submission
must 
attend the workshop.

* Committee:
------------
- Frédéric Goualard, Computer Science Research Institute (IRIN), 
  University of Nantes, France
- Luc Jaulin, Laboratoire d'Ingénierie des Systèmes Automatisés (LISA), 
  University of Angers, France
- Christophe Jermann, Artificial Intelligence Laboratory (LIA), 
  Swiss Federal Institute of Technology (EPFL), Switzerland
- Stefan Ratschan, Max-Planck-Institut für Informatik, 
  Saarbrücken, Germany
- Djamila Sam-Haroud, Artificial Intelligence Laboratory (LIA), 
  Swiss Federal Institute of Technology (EPFL), Switzerland

* Contacts:
-----------
Send questions about the conference to intcp03 [at] epfl [dot] ch

From owner-reliable_computing [at] interval [dot] louisiana.edu Wed May 14 09:38:15 2003
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h4EEcEk06802
	for reliable_computing-outgoing; Wed, 14 May 2003 09:38: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 h4EEc8M06798
	for <reliable_computing [at] interval [dot] louisiana.edu>; Wed, 14 May 2003 09:38:08 -0500 (CDT)
Received: from aragorn (aragorn [129.108.5.35])
	by cs.utep.edu (8.11.7/8.11.3) with SMTP id h4EEbqR19391;
	Wed, 14 May 2003 08:37:52 -0600 (MDT)
Message-Id: <200305141437.h4EEbqR19391 [at] cs [dot] utep.edu>
Date: Wed, 14 May 2003 08:37:51 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: Call for Participation - ISIPTA '03
To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=ISO-8859-1
Content-MD5: xu6BIS95vMMUjKPuktRZew==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc 
Content-Transfer-Encoding: 8bit
X-MIME-Autoconverted: from QUOTED-PRINTABLE to 8bit by interval.louisiana.edu id h4EEc9M06799
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk


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

Date: Wed, 14 May 2003 07:24:20 UT
From: "ISIPTA '03" <smc [at] decsai [dot] ugr.es>


Your help with circulating this announcement locally is much appreciated.
Apologies for multiple postings.

+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

                                  ISIPTA '03
3rd International Symposium on Imprecise Probabilities and Their Applications
                            Call for Participation

                              July 14-17, 2003
                            Lugano, Switzerland
                       http://www.sipta.org/~isipta03

+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

The ISIPTA meetings are one of the primary international forums to present and 
discuss
new results on the theory and applications of imprecise probabilities. 
Imprecise
probability has a wide scope, being a generic term for the many mathematical or
statistical models which measure chance or uncertainty without sharp numerical
probabilities. These models include belief functions, Choquet capacities, 
comparative
probability orderings, convex sets of probability measures, fuzzy measures,
interval-valued probabilities, possibility measures, plausibility measures, and 
upper
and lower expectations or previsions. Imprecise probability models are needed 
in
inference problems where the relevant information is scarce, vague or 
conflicting,
and in decision problems where preferences may also be incomplete.

Location
--------
ISIPTA '03 will be held at the University of Lugano, Switzerland, in the days
14-17 July 2003.
(http://www.sipta.org/~isipta03/venue.html)

Invited tutorials (14 July 2003)
--------------------------------
The tutorials will provide a gentle introduction to a wide range of important 
subject
matters in imprecise probability, from foundational questions to models with 
potential
for great impact on the application side.

1. Prof. Gert de Cooman, Ghent University, Belgium: A gentle introduction to 
imprecise
   probability models and their behavioral interpretation.
2. Dr. Jean-Marc Bernard, Universitè Paris 5 & CNRS, France: Imprecise 
Dirichlet model
   for multinomial data.
3. Prof. Charles F. Manski, Northwestern University, USA: Partial 
identification of
   probability distributions.
4. Prof. Fabio G. Cozman, University of Sao Paulo, Brazil: Graphical models and
   imprecise probabilities.
5. Prof. Sujoy Mukerji, Oxford University, UK: Imprecise probabilities and 
ambiguity
   aversion in economic modeling.
(http://www.sipta.org/~isipta03/tutorials.html)

Invited talks and contributions
-------------------------------
- Prof. Terrence L. Fine, Cornell University, USA (banquet speaker): Theories 
of
  probability: some questions about foundations.
- Prof. Irving J. Good, Virginia Tech., USA: title will be available soon.
- Prof. Patrick Suppes, Stanford University, USA: Application of nonmonotonic 
upper
  probabilities to quantum entanglement.
(http://www.sipta.org/~isipta03/invited.html)

The papers
----------
The 44 papers accepted for publication in the ISIPTA '03 proceedings have gone 
through
a careful reviewing and selection process to the extent of doing proceedings 
meeting
the highest standards.
(http://www.sipta.org/~isipta03/accepted.html).

Registration
------------
- Early registration by 31 May 2003: 600 (300) CHF for regular (student) 
registration.
- Late registration by 30 June 2003: 700 (400) CHF for regular (student) 
registration.
(1 CHF ~ 0.763 $.)
The registration fee includes the five tutorials on July the 14th, the 
technical
sessions, the invited lectures, coffee breaks, lunches, evening tour, symposium
banquet, and a copy of the proceedings.
(http://www.sipta.org/~isipta03/register.html)

Program board
-------------
Jean-Marc Bernard (Université Paris 5, France)
Teddy Seidenfeld (Carnegie Mellon University, USA)
Marco Zaffalon (IDSIA, Switzerland)

Questions
---------
If you have any questions about the symposium, please contact the Organising 
Committee,
at the following address:

Marco Zaffalon
IDSIA
Galleria 2
CH-6928 Manno
Switzerland

phone  +41 91 610 8665
fax    +41 91 610 8661
e-mail zaffalon [at] idsia [dot] ch

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



From owner-reliable_computing [at] interval [dot] louisiana.edu Thu May 15 16:01:35 2003
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h4FL1ZF08753
	for reliable_computing-outgoing; Thu, 15 May 2003 16:01:35 -0500 (CDT)
Received: from company.mail (pool-68-161-137-64.ny325.east.verizon.net [68.161.137.64])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id h4FL1OI08749
	for <reliable_computing [at] interval [dot] louisiana.edu>; Thu, 15 May 2003 16:01:29 -0500 (CDT)
Received: from ramas.com [192.0.0.24] by company.mail [127.0.0.1]
	with SMTP (MDaemon.v3.1.0.R)
	for <reliable_computing [at] interval [dot] louisiana.edu>; Thu, 15 May 2003 16:55:00 -0400
Message-ID: <3EC3FE93.6BFDD609 [at] ramas [dot] com>
Date: Thu, 15 May 2003 16:54:43 -0400
From: Scott Ferson <scott [at] ramas [dot] com>
Organization: Applied Biomathematics
X-Mailer: Mozilla 4.73 [en] (Win98; U)
X-Accept-Language: en
MIME-Version: 1.0
To: reliable_computing [at] interval [dot] louisiana.edu
Subject: tutorial workshop on imprecise probabilities
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
X-MDaemon-Deliver-To: reliable_computing [at] interval [dot] louisiana.edu
X-Return-Path: scott [at] ramas [dot] com
X-MDRcpt-To: reliable_computing [at] interval [dot] louisiana.edu
X-MDRemoteIP: 192.0.0.24
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk


As a part of next month's World Congress on Risk in Brussels,
there will be a day-long tutorial workshop on using imprecise
probabilities in risk analysis on 22 June 2003 (Sunday).

This tutorial will introduce interval-valued probability and
imprecisely specified probability distributions and will review
their uses in risk analysis. It will address the approaches of
interval probabilities, probability bounds analysis, Dempster-
Shafer theory, robust Bayes methods, and the general theory
of imprecise probabilities.

See the website http://www.ramas.com/ipbrussels.htm for
more details.  (The registration fee increases after 10 June).

Regards,

Scott Ferson <scott [at] ramas [dot] com>
Applied Biomathematics
100 North Country Road
Setauket, New York 11733
631-751-4350, fax -3435







From owner-reliable_computing [at] interval [dot] louisiana.edu Wed May 21 09:38:29 2003
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h4LEcS015779
	for reliable_computing-outgoing; Wed, 21 May 2003 09:38:28 -0500 (CDT)
Received: (from rbk5287@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h4LEcPp15774
	for reliable_computing [at] interval [dot] louisiana.edu; Wed, 21 May 2003 09:38:25 -0500 (CDT)
Received: from web14204.mail.yahoo.com (web14204.mail.yahoo.com [216.136.172.146])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with SMTP id h4JLGdI13634
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 19 May 2003 16:16:40 -0500 (CDT)
Message-ID: <20030519211638.39198.qmail [at] web14204 [dot] mail.yahoo.com>
Received: from [213.158.4.16] by web14204.mail.yahoo.com via HTTP; Mon, 19 May 2003 14:16:38 PDT
Date: Mon, 19 May 2003 14:16:38 -0700 (PDT)
From: Slava Nesterov <slavanest [at] yahoo [dot] com>
Subject: Reliable Computing, Issue 4, Vol.9, 2003
To: reliable_computing [at] interval [dot] louisiana.edu
MIME-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

              Reliable Computing
            Volume 9, issue 4, 2003
 
            Mathematical Research
 
Worst-Case Simulation of Discrete Linear 
Time-Invariant Interval
Dynamic Systems
Vicenc Puig, Jordi Saludes, Joseba Quevedo
251-290
 
Optimal Bicentered Form
Youkang Fang
291-302
 
Asymptotic Stability of Interval Time-Delay Systems
Svetlana P. Sokolova, Ruslan S. Ivlev
303-313
 

__________________________________
Do you Yahoo!?
The New Yahoo! Search - Faster. Easier. Bingo.
http://search.yahoo.com

From owner-reliable_computing [at] interval [dot] louisiana.edu Fri May 23 15:37:35 2003
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h4NKbZx18206
	for reliable_computing-outgoing; Fri, 23 May 2003 15:37:35 -0500 (CDT)
Received: from ccsmta1.resource.rmcs.cranfield.ac.uk (ccsmta1.resource.rmcs.cranfield.ac.uk [193.63.243.9])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id h4NKbSI18202
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 23 May 2003 15:37:29 -0500 (CDT)
Message-ID: <55360F67A4EAD611B38F00B0D0D1AC6B2426BA [at] uxstaff [dot] staff.rmcs.cranfield.ac.uk>
From: Ashokaraj Mr IA <I.A.Ashokaraj [at] rmcs [dot] cranfield.ac.uk>
To: "'reliable_computing [at] interval [dot] louisiana.edu'"
	 <reliable_computing [at] interval [dot] louisiana.edu>
Subject: INTLAB & ACSYSTEME Interval tool box!
Date: Fri, 23 May 2003 21:32:19 +0100
MIME-Version: 1.0
X-Mailer: Internet Mail Service (5.5.2653.19)
Content-Type: text/plain;
	charset="iso-8859-1"
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk


Hi All!
       Some time back i tried the MATLAB Interval tool box by ACSYSTEME in
france about which a mail was posted in this group! So just wondering has
anybody else tried it and if so any known issues about it, i mean advantages
or disadvantages about the toolbox when compared to INTLAB toolbox or any
review any where about the toolbox? 

Regards,
Ashokaraj. 

From owner-reliable_computing [at] interval [dot] louisiana.edu Fri May 23 17:47:52 2003
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h4NMlpA18408
	for reliable_computing-outgoing; Fri, 23 May 2003 17:47:51 -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 h4NMlkI18404
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 23 May 2003 17:47:46 -0500 (CDT)
Received: from aragorn (aragorn [129.108.5.35])
	by cs.utep.edu (8.11.7/8.11.3) with SMTP id h4NMlLs13408;
	Fri, 23 May 2003 16:47:21 -0600 (MDT)
Message-Id: <200305232247.h4NMlLs13408 [at] cs [dot] utep.edu>
Date: Fri, 23 May 2003 16:47:22 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: RE: FSS SI on Interfaces between Fuzzy Set Theory and Interval An alys is
To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu
Cc: E.Bomers [at] elsevier [dot] nl, vladik [at] cs [dot] utep.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: xeVcCkGaF4ch6ujs8ArhdA==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

Dear Friends, 

This is just to let you all know that the special interval issue of Fuzzy Sets 
and Systems is now freely available online. 

Thanks to Elsevier for their help! 

Vladik

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

From: "Bomers, Edith (ELS)" <E.Bomers [at] elsevier [dot] nl>

Re: Fuzzy Sets and
Systems special issue on "Interfaces between Fuzzy Set Theory and Interval
Analysis" to the interval analysis. 

I am pleased to inform you that we have now put this special issue "in
the spotlight" on ComputerScienceWeb (CSW) at www.compsciweb.com. 

With kindest regards,
Edith Bomers

P.S. It may take until June for Elsevier to make the special issue freely
available online. However, with approximately 1700 institutes having access
to Fuzzy Sets and Systems online, I expect that most subscribers to the
interval analysis e-mail list will have access to the special issue without
any problem. 


Edith Bomers
Senior Publishing Editor 
Mathematics & Computer Science
ELSEVIER
Sara Burgerhartstraat 25
1055 KV  Amsterdam
The Netherlands
Phone: + 31  20 485 3362
Fax: + 31 20 485 2616
E-mail: e.bomers [at] elsevier [dot] com

http://www.mathematicsweb.org
http://www.computerscienceweb.com

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



From owner-reliable_computing [at] interval [dot] louisiana.edu Fri May 23 21:39:12 2003
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h4O2dCo18709
	for reliable_computing-outgoing; Fri, 23 May 2003 21:39:12 -0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id h4O2d6I18705
	for <reliable_computing [at] interval [dot] louisiana.edu>; Fri, 23 May 2003 21:39:06 -0500 (CDT)
Received: from aragorn (aragorn [129.108.5.35])
	by cs.utep.edu (8.11.7/8.11.3) with SMTP id h4O2cnU14497;
	Fri, 23 May 2003 20:38:49 -0600 (MDT)
Message-Id: <200305240238.h4O2cnU14497 [at] cs [dot] utep.edu>
Date: Fri, 23 May 2003 20:38:49 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: RE: FSS SI on Interfaces between Fuzzy Set Theory and Interval An alys is
To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu,
   vladik [at] cs [dot] utep.edu
Cc: E.Bomers [at] elsevier [dot] nl, vladik [at] cs [dot] utep.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: EqhgZoA3QO54UlF7AtJKTw==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc 
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

P.S. A link to this special issue has been added to the Journals of Interest to 
Interval Researchers part of the interval computations website 
http://www.cs.utep.edu/interval-comp


From owner-reliable_computing [at] interval [dot] louisiana.edu Sat May 24 10:44:40 2003
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h4OFid619604
	for reliable_computing-outgoing; Sat, 24 May 2003 10:44:39 -0500 (CDT)
Received: from nwkea-mail-2.sun.com (nwkea-mail-2.sun.com [192.18.42.14])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id h4OFiVI19600
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sat, 24 May 2003 10:44:32 -0500 (CDT)
Received: from heliopolis.eng.sun.com ([152.70.8.30])
	by nwkea-mail-2.sun.com (8.12.9/8.12.9) with ESMTP id h4OFiFLv005033;
	Sat, 24 May 2003 08:44:16 -0700 (PDT)
Received: from sun.com (vpn-129-150-16-174.SFBay.Sun.COM [129.150.16.174])
	by heliopolis.eng.sun.com (8.11.6+Sun/8.11.6/ENSMAIL,v2.1p1) with ESMTP id h4OFhdG17669;
	Sat, 24 May 2003 08:43:39 -0700 (PDT)
Message-ID: <3ECF9093.81D3CC2 [at] sun [dot] com>
Date: Sat, 24 May 2003 08:32:35 -0700
From: Bill Walster <bill.walster [at] sun [dot] com>
X-Mailer: Mozilla 4.79 [en] (Win98; U)
X-Accept-Language: en,ru
MIME-Version: 1.0
To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
CC: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu,
   E.Bomers [at] elsevier [dot] nl
Subject: Re: FSS SI on Interfaces between Fuzzy Set Theory and Interval An alys 
 is
References: <200305240238.h4O2cnU14497 [at] cs [dot] utep.edu>
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk



Thanks, Vladik, for all your efforts on this special issue and
in getting the word out about it.

Cheers,

Bill


Vladik Kreinovich wrote:

> P.S. A link to this special issue has been added to the Journals of Interest to
> Interval Researchers part of the interval computations website
> http://www.cs.utep.edu/interval-comp


From owner-reliable_computing [at] interval [dot] louisiana.edu Thu May 29 09:25:14 2003
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h4TEPEH25415
	for reliable_computing-outgoing; Thu, 29 May 2003 09:25: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 h4TEP5I25411
	for <reliable_computing [at] interval [dot] louisiana.edu>; Thu, 29 May 2003 09:25:06 -0500 (CDT)
Received: from aragorn (aragorn [129.108.5.35])
	by cs.utep.edu (8.11.7/8.11.3) with SMTP id h4TEOAx17073;
	Thu, 29 May 2003 08:24:10 -0600 (MDT)
Message-Id: <200305291424.h4TEOAx17073 [at] cs [dot] utep.edu>
Date: Thu, 29 May 2003 08:24:09 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: Re: FSS SI on Interfaces between Fuzzy Set Theory and Interval An alys  is
To: bill.walster [at] sun [dot] com
Cc: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu,
   E.Bomers [at] elsevier [dot] nl
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: 6K8Znv/NWoFTajsgp8WSlg==
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 issue was edited by Weldon Lodwick, so he gets all the kudos! 

> Date: Sat, 24 May 2003 08:32:35 -0700
> From: Bill Walster <bill.walster [at] sun [dot] com>
> X-Accept-Language: en,ru
> MIME-Version: 1.0
> To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
> CC: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu, 
E.Bomers [at] elsevier [dot] nl
> Subject: Re: FSS SI on Interfaces between Fuzzy Set Theory and Interval An 
alys  is
> Content-Transfer-Encoding: 7bit
> 
> 
> 
> Thanks, Vladik, for all your efforts on this special issue and
> in getting the word out about it.
> 
> Cheers,
> 
> Bill
> 
> 
> Vladik Kreinovich wrote:
> 
> > P.S. A link to this special issue has been added to the Journals of 
Interest to
> > Interval Researchers part of the interval computations website
> > http://www.cs.utep.edu/interval-comp


From owner-reliable_computing [at] interval [dot] louisiana.edu Thu May 29 10:54:41 2003
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h4TFseG25645
	for reliable_computing-outgoing; Thu, 29 May 2003 10:54:40 -0500 (CDT)
Received: (from rbk5287@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h4TFsbU25640
	for reliable_computing [at] interval [dot] louisiana.edu; Thu, 29 May 2003 10:54:37 -0500 (CDT)
Received: from oak.FernUni-Hagen.de (oak.fernuni-hagen.de [132.176.114.41])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id h4QEUUI22013
	for <reliable_computing [at] interval [dot] louisiana.edu>; Mon, 26 May 2003 09:30:31 -0500 (CDT)
Received: from amavis by oak.FernUni-Hagen.de with scanned-ok (Exim 4.04)
	id 19KIzC-0005sd-00
	for reliable_computing [at] interval [dot] louisiana.edu; Mon, 26 May 2003 16:30:02 +0200
Received: from banach.fernuni-hagen.de ([132.176.86.25])
	by oak.FernUni-Hagen.de with esmtp (Exim 4.04)
	id 19KIz4-0005rs-00
	for reliable_computing [at] interval [dot] louisiana.edu; Mon, 26 May 2003 16:29:54 +0200
Received: from localhost (localhost [127.0.0.1])
	by banach.fernuni-hagen.de (8.12.8+Sun/8.12.9) with SMTP id h4QETrgw008570;
	Mon, 26 May 2003 16:29:53 +0200 (CEST)
Message-Id: <200305261429.h4QETrgw008570 [at] banach [dot] fernuni-hagen.de>
Date: Mon, 26 May 2003 16:29:53 +0200 (CEST)
From: Vasco Brattka <Vasco.Brattka@FernUni-Hagen.de>
Reply-To: Vasco Brattka <Vasco.Brattka@FernUni-Hagen.de>
Subject: CCA 2003 - Third Announcement and Call for Papers
To: reliable_computing [at] interval [dot] louisiana.edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: JgWAGHYq4XKQCooc/mU98Q==
X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.5 SunOS 5.9 sun4u sparc 
X-Virus-Scanned: by AMaViS perl-11
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

________________________________________________________________________________

   C  C  A
   2 0 0 3

   International Conference on
   Computability and Complexity in Analysis 

   August 28-30, 2003, University of Cincinnati, USA
________________________________________________________________________________


   Third Announcement and Call for Papers


   Invited Speakers

   Douglas Bridges          (Christchurch, New Zealand)
   Rod Downey               (Wellington, New Zealand)
   Peter Hertling           (Hagen, Germany)
   Iraj Kalantari           (Western Illinois, USA)
   Vladik Kreinovich        (Univ. of Texas, USA)
   Boris Kushner            (Pittsburgh, USA)
   Jack Lutz                (Iowa State, USA)
   Klaus Weihrauch          (Hagen, Germany)


   Scientific Program Committee

   Vasco Brattka            (Hagen, Germany)
   Douglas Cenzer           (Univ. of Florida, USA)
   Rod Downey               (Wellington, New Zealand)
   Martin Escardo           (Birmingham, UK)
   Ker-I Ko                 (Stony Brook, USA)
   Norbert Mueller          (Trier, Germany)
   Marian Pour-El           (Minnesota, USA)
   Dieter Schmidt           (Cincinnati, USA)
   Matthias Schroeder       (Hagen, Germany)
   Viggo Stoltenberg-Hansen (Uppsala, Sweden)
   Klaus Weihrauch, chair   (Hagen, Germany)
   Mariko Yasugi            (Kyoto Sangyo, Japan)
   Jeffery Zucker           (McMaster, Canada)
 

   Local Organizing Committee

   Kenneth Meyer            (Cincinnati, USA)
   Dieter Schmidt           (Cincinnati, USA)
   Bingyu Zhang             (Cincinnati, USA)
   Ning Zhong, chair        (Cincinnati, USA)


   Submissions

   Authors are invited to submit PostScript versions of papers to

   cca@fernuni-hagen.de


   Deadlines

   Submission deadline:   June  2, 2003
   Notification:          June 30, 2003
   Camera-ready versions: July 14, 2003
 

   Registration

   Registration and application for financial support is possible 
   via the conference webpage (see below).
   The deadline for applying for financial support is May 1, 2003.


   Information

   For further information please contact
 
   Vasco Brattka (Vasco.Brattka@FernUni-Hagen.de) or
   Ning Zhong    (Ning.Zhong [at] uc [dot] edu)


   Webpage

   http://www.informatik.fernuni-hagen.de/cca/cca2003/


   Funding Opportunities 

   The conference is partially supported by the 
   Taft Memorial Foundation of the University of Cincinnati;
   the Institute for Mathematics and Applications (IMA); 
   the Ohio Board of Regents; 
   the Clermont College, 
   the Department of Electrical and Computer Engineering and Computer Science, 
   and the Department of Mathematical Sciences 
   of the University of Cincinnati. 
   Limited funds are available to conference participants - in particular, 
   to young researchers and Ph.D. students.  
   The conference is also sponsored by 
   the Association for Symbolic Logic (ASL).
   Financial support from ASL may be available for student members of ASL
   (see the conference webpage for a link). 


   Scope

   The conference is concerned with the theory of computability and complexity 
   over real-valued data.

   Computability theory and complexity theory are two central areas of research 
   in mathematical logic and theoretical computer science. Computability theory 
   is the study of the limitations and abilities of computers in principle. 
   Computational complexity theory provides a framework for understanding the 
   cost of solving computational problems, as measured by the requirement for 
   resources such as time and space. The classical approach in these areas is 
   to consider algorithms as operating on finite strings of symbols from a 
   finite alphabet. Such strings may represent various discrete objects such as 
   integers or algebraic expressions, but cannot represent a general real or 
   complex number, unless it is rounded.

   The classical theory of computation does not deal adequately with 
   computations that operate on real-valued data. Most computational problems 
   in the physical sciences and engineering are of this type, such as the 
   complexity of network flow problems and of dynamical and hybrid systems. 
   To study these types of problem, alternative models over real-valued data 
   and other continuous structures have been developed in recent years. 
   Unlike the well established classical theory of computation over discrete 
   structures, the theory of computation over continuous data is still in 
   its infancy.

   Scientists working in the area of computation on real-valued data come 
   from different fields, such as theoretical computer science, domain theory, 
   logic, constructive mathematics, computer arithmetic, numerical mathematics,
   analysis, etc. The conference provides a unique opportunity for people from
   such diverse areas to meet and exchange ideas and knowledge.

   The topics of interest include foundational work on various models and 
   approaches for describing computability and complexity over the
   real numbers;  complexity-theoretic investigations, both foundational and
   with respect to concrete problems; and new implementations
   of exact real arithmetic, as well as further developments of already existing
   software packages. We hope to gain new insights into
   computability-theoretic aspects of various computational questions from
   physics and from other fields involving computations over the real
   numbers. This will require the extension of existing
   computability notions to more general classes of objects. 


   Proceedings 

   It is planned to publish a special issue of Mathematical Logic Quarterly
   dedicated to the conference.

________________________________________________________________________________




From owner-reliable_computing [at] interval [dot] louisiana.edu Thu May 29 10:57:44 2003
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h4TFvhT25738
	for reliable_computing-outgoing; Thu, 29 May 2003 10:57:43 -0500 (CDT)
Received: (from rbk5287@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h4TFved25733
	for reliable_computing [at] interval [dot] louisiana.edu; Thu, 29 May 2003 10:57:40 -0500 (CDT)
Received: from sciences.univ-angers.fr (sciences.univ-angers.fr [193.49.146.182])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id h4RER9I23158
	for <reliable_computing [at] interval [dot] louisiana.edu>; Tue, 27 May 2003 09:27:09 -0500 (CDT)
Received: from jaulin (pbastion.univ-angers.fr [193.49.146.252])
	by sciences.univ-angers.fr (8.9.3/8.9.3) with SMTP id QAA17261
	for <reliable_computing [at] interval [dot] louisiana.edu>; Tue, 27 May 2003 16:26:59 +0200 (CEST)
Message-ID: <00e101c3245e$90eeca00$1c3d13ac@uang>
From: "luc jaulin" <jaulin@univ-angers.fr>
To: "interval" <reliable_computing [at] interval [dot] louisiana.edu>
Subject: interval matrices >=0 
Date: Tue, 27 May 2003 16:45:06 +0200
MIME-Version: 1.0
Content-Type: multipart/alternative;
	boundary="----=_NextPart_000_00DE_01C3246F.54347680"
X-Priority: 3
X-MSMail-Priority: Normal
X-Mailer: Microsoft Outlook Express 6.00.2600.0000
X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2600.0000
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

This is a multi-part message in MIME format.

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

Dear collegues,


I am interested by the following problem.

<< Consider a square interval matrix [A].
Denote by S the set of all A in [A] such that A is positive =
semi-definite=20
(i.e., A is symmetric and all its eigen values are >=3D0).
Find the smallest interval matrix [B] which contains S.  >>

This problem is important for control applications or for global =
optimization
(to build a non-convexity contractor, for instance).

With Didier Henrion, we have found (but maybe it was already known)=20
that this problem is convex (because S is convex) and could be
solved efficiently by polynomial algorithms using an LMI=20
(linear matrix inequality) approach.

My questions :=20

1)  Could you please give me some references (if exist) on this problem =
and=20
 its possible applications,
2)  Could I find somewhere an LMI solver which provides validated =
results.

Thank you very much for your answers.

Regards,

Luc=20


-------------------------------------------------------------------------=
---------------------------------
Luc Jaulin
LISA, ISTIA, 62 avenue Notre Dame du Lac 49 000 Angers.=20
T=E9l: 02 41 73 52 31 (=E0 l'UFR sciences)  ou 02.41.22.65.78 (au LISA)
http://www.istia.univ-angers.fr/~jaulin
-------------------------------------------------------------------------=
---------------------------------


------=_NextPart_000_00DE_01C3246F.54347680
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.2600.0" name=3DGENERATOR>
<STYLE></STYLE>
</HEAD>
<BODY bgColor=3D#ffffff><FONT face=3DArial size=3D2>
<DIV>Dear collegues,</DIV>
<DIV>&nbsp;</DIV>
<DIV><BR>I am interested by the following problem.</DIV>
<DIV>&nbsp;</DIV>
<DIV>&lt;&lt; Consider a square interval matrix [A].<BR>Denote by S the =
set of=20
all A in [A] such that A is positive semi-definite <BR>(i.e., A is =
symmetric and=20
all its eigen values are &gt;=3D0).<BR>Find the smallest interval matrix =
[B] which=20
contains S.&nbsp; &gt;&gt;</DIV>
<DIV>&nbsp;</DIV>
<DIV>This problem is important for control applications or for global=20
optimization<BR>(to build a non-convexity contractor, for =
instance).</DIV>
<DIV>&nbsp;</DIV>
<DIV>With Didier Henrion, we have found (but maybe it was already known) =

<BR>that this problem is convex (because S is convex) and could =
be<BR>solved=20
efficiently by polynomial algorithms using an LMI <BR>(linear matrix =
inequality)=20
approach.</DIV>
<DIV>&nbsp;</DIV>
<DIV>My questions : </DIV>
<DIV>&nbsp;</DIV>
<DIV>1) &nbsp;Could you please give me some references (if exist) on =
this=20
problem and <BR>&nbsp;its possible applications,<BR>2) &nbsp;Could I =
find=20
somewhere an LMI solver which provides validated results.</DIV>
<DIV>&nbsp;</DIV>
<DIV>Thank you very much for your answers.</DIV>
<DIV>&nbsp;</DIV>
<DIV>Regards,</DIV>
<DIV>&nbsp;</DIV>
<DIV>Luc </DIV>
<DIV>&nbsp;</DIV>
<DIV><BR>----------------------------------------------------------------=
------------------------------------------<BR>Luc=20
Jaulin<BR>LISA, ISTIA, 62 avenue Notre Dame du Lac 49 000 Angers. =
<BR>T=E9l: 02 41=20
73 52 31 (=E0 l'UFR sciences)&nbsp; ou 02.41.22.65.78 (au LISA)<BR><A=20
href=3D"http://www.istia.univ-angers.fr/~jaulin">http://www.istia.univ-an=
gers.fr/~jaulin</A><BR>--------------------------------------------------=
--------------------------------------------------------<BR></DIV></FONT>=
</BODY></HTML>

------=_NextPart_000_00DE_01C3246F.54347680--


From owner-reliable_computing [at] interval [dot] louisiana.edu Thu May 29 11:35:05 2003
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h4TGZ4025984
	for reliable_computing-outgoing; Thu, 29 May 2003 11:35:04 -0500 (CDT)
Received: (from rbk5287@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h4TGZ0D25979
	for reliable_computing [at] interval [dot] louisiana.edu; Thu, 29 May 2003 11:35:00 -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 h4RLrgI23343
	for <reliable_computing [at] interval [dot] louisiana.edu>; Tue, 27 May 2003 16:53:43 -0500 (CDT)
Received: from ultra1.math.wisc.edu (ultra1.math.wisc.edu [144.92.166.161])
	by lcyoung.math.wisc.edu (8.11.6p2/8.11.6) with ESMTP id h4RLpVc16023;
	Tue, 27 May 2003 16:51:33 -0500 (CDT)
Date: Tue, 27 May 2003 16:51:30 -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,
   SIAGLA-DIGEST <owner-siagla-digest [at] turing [dot] siam.org>, wim@bell-labs.com,
   hjt [at] eos [dot] ncsu.edu, SMBnet [at] smb [dot] org, vkm [at] eedsp [dot] gatech.edu,
   reliable_computing [at] interval [dot] louisiana.edu
cc: "LAA/MB editors -- Dellnitz. Michael" <dellnitz@uni-paderborn.de>,
   Steve Kirkland <kirkland [at] MATH [dot] UREGINA.CA>,
   Miki Neumann <neumann [at] math [dot] uconn.edu>,
   Christof Schuette <schuette [at] math [dot] fu-berlin.de>,
   Peggy Conklin <pconklin [at] math [dot] wisc.edu>
Subject: special LAA issue
Message-ID: <Pine.GSO.4.10.10305271648130.24668-100000 [at] ultra1 [dot] math.wisc.edu>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
X-MailScanner: Found to be clean
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

                LINEAR ALGEBRA AND ITS APPLICATIONS
         Special issue on Matrices and Mathematical Biology

                    Second call for papers
          Submission deadline extended to 30 November 2003

In the last decade the field of mathematical biology has expanded very
rapidly. Biological research furnishes both data on and insight into the
workings of biological systems. However, qualitative and quantitative
modelling and simulation are still far from allowing current knowledge to
be organized into a well-understood structure. Further, the diversity
present in mathematical biology, coupled with the absence of a single
unifying approach, has inspired the formation of entirely new scientific
disciplines such as bioinformatics.

Theoretical research activity in mathematical biology is 
naturally of an interdisciplinary character. It involves 
mathematical and statistical investigations, sometimes in 
combination with techniques originating from the computational 
sciences. In many of these approaches, linear algebra is key to 
solving the mathematical problems which arise. For instance, in 
some population models, the asymptotic rate of increase of the 
population turns out to be the spectral radius of a certain 
matrix associated with the population, while the other 
eigenvalues also yield information on the evolution of the 
population's structure. Conversely, problems in mathematical 
biology can enrich linear algebra. For example, in attempting to 
measure the influence of a single matrix entry on a simple 
eigenvalue, linear algebraists frequently employ the derivative 
of that eigenvalue with respect to the entry. However, some 
biologists have proposed the use of the elasticity, or a 
logarithmic derivative, of an eigenvalue with respect to a matrix 
entry in order to measure the effect on that eigenvalue of 
perturbing a matrix entry. Thus linear algebraists are challenged 
to deepen  and develop the understanding of the ways in which the 
effects of changes in the ecological conditions on the 
populations can be measured  through further theoretical 
investigations.

A recent book by Caswell on matrix population models makes extensive use
of linear algebraic techniques. Quoting from the introduction to that
book: "Matrix population models -- carefully constructed, correctly
analyzed, and properly interpreted - provide a theoretical basis for
population models... A goal of this book is to raise the bar of what
constitutes rigorous analysis in population models.... The work of the
population biologist is too important to settle for less." But Caswell's
call for careful mathematical construction and analysis applies to areas
beyond the subject of population models; clearly a rigorous approach would
benefit all areas of interaction between biology and mathematics.

The Special Issue of LAA dedicated to Matrices and Mathematical Biology is
intended to both foster and accelerate cross fertilization between those
working primarily in linear algebra and those working primarily in
mathematical biology. The editors hope that such an issue of LAA will be
of benefit to both fields.

This special issue will be open for all submissions containing new and
meaningful results that advance interaction between linear algebra and
mathematical biology. The editors welcome submissions in which linear
algebraic methods play an important role for novel approaches to problems
arising in mathematical biology, or in which investigations in
mathematical biology motivate new tools and problems in linear algebra.
Survey papers which discuss specific areas involving the interaction
between biology and linear algebra, particularly where such interaction
has been successful, are also very welcome.

Areas and topics of interest for the special issue include, but are not
limited to:

       metabolistic pathways
       statistical data analysis
       linear algebra problems in graph partitioning
       matrix population models
       model discrimination in biokinetics
       linear algebra problems in network analysis and synchronization
       subspace oriented eigenvalue problems
       aggregation/disaggregation or related techniques
       hidden Markov models
       epidemic models
       modelling phylogenetic trees



All papers submitted must meet the publication standards of Linear Algebra
and its Applications and will be refereed in the usual way. They should be
submitted to one of the special editors of this issue listed below by 30
November 2003.


Michael Dellnitz
Department of Mathematics and Computer Science
University of Paderborn
D-33095 Paderborn 
Germany
dellnitz [at] upb [dot] de


Steve Kirkland
Department of Mathematics and Statistics
University of Regina
Regina, Saskatchewan 
Canada
S4S 0A2
kirkland [at] math [dot] uregina.ca


Michael Neumann                             
Department of Mathematics
University of Connecticut                   
Storrs, Connecticut O6269-3OO9
USA
neumann [at] math [dot] uconn.edu

Christof Schuette
Department of Mathematics & Computer Science         
Numerical Mathematics/Scientific Computing
Free University Berlin                 
Arnimallee 2-6                            
D-14195 Berlin                            
Germany      
schuette [at] math [dot] fu-berlin.de




From owner-reliable_computing [at] interval [dot] louisiana.edu Thu May 29 11:38:25 2003
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h4TGcOV26115
	for reliable_computing-outgoing; Thu, 29 May 2003 11:38:24 -0500 (CDT)
Received: (from rbk5287@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h4TGcLJ26110
	for reliable_computing [at] interval [dot] louisiana.edu; Thu, 29 May 2003 11:38:21 -0500 (CDT)
Received: from supertimor.sciences.univ-nantes.fr (supertimor.sciences.univ-nantes.fr [193.52.109.8])
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id h4SEngI24261
	for <reliable_computing [at] interval [dot] louisiana.edu>; Wed, 28 May 2003 09:49:42 -0500 (CDT)
Received: from localhost (supertimor [127.0.0.1])
	by supertimor.sciences.univ-nantes.fr (Postfix) with ESMTP id 17E3E5F75D
	for <reliable_computing [at] interval [dot] louisiana.edu>; Wed, 28 May 2003 16:49:39 +0200 (CEST)
Received: from supertimor.sciences.univ-nantes.fr ([127.0.0.1]) by localhost (supertimor [127.0.0.1]) (amavisd-new) with ESMTP id 21723-01 for <reliable_computing [at] interval [dot] louisiana.edu>; Wed, 28 May 2003 16:49:37 -0000 (CEST)
Received: from narech.irin.sciences.univ-nantes.fr (narech.irin.sciences.univ-nantes.fr [193.52.99.2])
	by supertimor.sciences.univ-nantes.fr (Postfix) with ESMTP id 733E05F758
	for <reliable_computing [at] interval [dot] louisiana.edu>; Wed, 28 May 2003 16:49:37 +0200 (CEST)
Received: from localhost (localhost [127.0.0.1])
	by narech.irin.sciences.univ-nantes.fr (Postfix) with ESMTP
	id 92FEC48044; Wed, 28 May 2003 16:49:38 +0200 (CEST)
Received: from irin.univ-nantes.fr (erebus [193.52.99.69])
	by narech.irin.sciences.univ-nantes.fr (Postfix) with ESMTP
	id A138A48048; Wed, 28 May 2003 16:49:37 +0200 (CEST)
Message-ID: <3ED4D949.90509 [at] irin [dot] univ-nantes.fr>
Date: Wed, 28 May 2003 17:44:09 +0200
From: Laurent Granvilliers <granvilliers [at] irin [dot] univ-nantes.fr>
User-Agent: Mozilla/5.0 (X11; U; Linux i686; en-US; rv:0.9.2.1) Gecko/20010901
X-Accept-Language: en-us
MIME-Version: 1.0
To: reliable_computing [at] interval [dot] louisiana.edu
Subject: CFP: COSOLV'2003
Content-Type: text/plain; charset=ISO-8859-15; format=flowed
Content-Transfer-Encoding: 7bit
X-Virus-Scanned: by AMaViS snapshot-20010714
X-Virus-Scanned: by amavisd-new amavisd-new-20020630
X-Razor-id: bc22760599a37abaf7f0bc0ebdefa323f5d932ba
Sender: owner-reliable_computing [at] interval [dot] louisiana.edu
Precedence: bulk

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

COSOLV'2003
Third Workshop on Cooperative Solvers in Constraint Programming

A CP'2003 workshop
Kinsale, Co. Cork, Ireland
September 29th, 2003

http://www.sciences.univ-nantes.fr/irin/cosolv2003/


OVERVIEW
--------
Solver cooperation is now well-known as a concept for improving
efficiency and performance of constraint solvers. Generic solvers are
generally far too inefficient for solving numerous real-life
problems. However, a large part of these problems can often be handled
by specific and efficient solvers. The goal of cooperation is to
share and exchange data between solvers in order to tackle new types
of problems, to improve the representation of solutions, and/or to
speed-up computation. However, three major problems arise when dealing
with cooperation of solvers: theoretical issues, communication, and
strategies.

This workshop addresses all aspects (theory, specific cooperations,
systems and applications) of cooperative solving processes. Topics of
interest include (but are not limited to):

- Theory, Languages
    * Models for cooperation and strategies, e.g., coordination,
      multi-agent, parallel, distributed, concurrent frameworks
    * Cooperation/strategy languages, and platforms

- Specific Classes of Cooperation
    * Integration of constraint programming and mathematical
      programming techniques such as integer programming,
      relaxations and heuristics
    * Local-global view of problems (constraint programming
      and local search)
    * Symbolic-numeric algorithms

- Systems, Applications
    * Interoperability issues and architecture for inter solvers
      communication
    * Problems/Applications solved by cooperation


SUBMISSION
----------
To submit send an email containing four consecutive ASCII paragraphs
with title, authors, emails, abstract and WWW link directly to
compressed PS or PDF file, to Laurent Granvilliers
(granvilliers [at] irin [dot] univ-nantes.fr) AND Eric Monfroy
(monfroy [at] irin [dot] univ-nantes.fr).

Papers are between 5 and 15 pages in length following the LNCS format.

The submission deadline is July 3, 2003.

Accepted papers will be available electronically from the web-page and
in hard-copy proceedings available at the workshop.


ATTENDANCE DETAILS
------------------
This will be a one-day workshop, with open attendance. At least one
author of each accepted submission must attend the workshop. All
workshop attendees must pay the CP workshop registration fee.


IMPORTANT DATES
---------------
Email submission: July 3rd
Notification:     July 17th
Final versions:   July 25th
Workshop:         September 29th


WORKSHOP ORGANIZERS
-------------------
Laurent Granvilliers
University of Nantes
granvilliers [at] irin [dot] univ-nantes.fr

Eric Monfroy
University of Nantes
monfroy [at] irin [dot] univ-nantes.fr


PROGRAM COMMITTEE
-----------------
Carlos Castro, UTFSM, Valparaiso, Chile
Hani El Sakkout, Parc Technologies Limited, UK
Markus Fromherz, Palo Alto Research Center, USA
Thom Fruehwirth, University of Ulm, Germany
Christophe Ringeissen, LORIA Nancy, France
Frederic Saubion, University of Angers, France
Alexander Semenov, Institute of System Informatics, Novosibirsk, Russia


From owner-reliable_computing [at] interval [dot] louisiana.edu Sat May 31 20:41:56 2003
Received: (from daemon@localhost)
	by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h511ft300802
	for reliable_computing-outgoing; Sat, 31 May 2003 20:41:55 -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 h511fpA00798
	for <reliable_computing [at] interval [dot] louisiana.edu>; Sat, 31 May 2003 20:41:51 -0500 (CDT)
Received: from aragorn (aragorn [129.108.5.35])
	by cs.utep.edu (8.11.7/8.11.3) with SMTP id h511fdw05546;
	Sat, 31 May 2003 19:41:39 -0600 (MDT)
Message-Id: <200306010141.h511fdw05546 [at] cs [dot] utep.edu>
Date: Sat, 31 May 2003 19:41:38 -0600 (MDT)
From: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Reply-To: Vladik Kreinovich <vladik [at] cs [dot] utep.edu>
Subject: interval mini-symposium 
To: reliable_computing [at] interval [dot] louisiana.edu
Cc: jchandra [at] seas [dot] gwu.edu, ralo [at] uh [dot] edu
MIME-Version: 1.0
Content-Type: TEXT/plain; charset=us-ascii
Content-MD5: 5i2Bcs0UJ5H/y+t3Ek2/jw==
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,

On February 26-28, 2004, a Workshop on Threat Assessment: 
A Data-Centric Approach will be held in Houston, Texas

This workshop will be co-chaired by Dr. Jagdish Chandra from George
Washington University (email jchandra [at] seas [dot] gwu.edu) 
and Dr. Richard Alo from the University of Houston-Downtown
(email ralo [at] uh [dot] edu) 

The main scientific objectives of this workshop are:
* to analyze how different data mining and data processing 
  approaches can be used in problems related to combating 
  terrorism and to national security in general
* to analyze how techniques developed for national security 
  can be used in other application areas

The organizers of this workshop want to have a representation of
different directions in data processing. Ideally, for each direction,
there should be a mini-symposium, with one (longer) introductory talk
and several talks about possible and actual applications of the
corresponding techniques to threat assessment. 

In particular, since data related to the main objectives of this
workshop has high uncertainty, often with no information about
probabilities, the organizers are interested in having a session on
interval techniques.

If you are interested in participating in this interval
mini-symposium, please send me an email ASAP (you may want to 
cc to the workshop co-chairs). If possible, send us the title of 
your presentation; approximate title is OK. 

We plan to apply for a grant to cover some expenses of organizing this 
workshop, and having a well-planned workshop increases the possibility 
of getting funded. The deadline for the corresponding request for
proposals is July 17, so we need to have this information ASAP. 

This is a preliminary request, a detailed call for papers will 
appear later. 

Thanks a lot.

Yours

Vladik

vladik [at] cs [dot] utep.edu