From owner-reliable_computing [at] interval [dot] usl.edu Tue May 1 08:01:50 2001 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) id IAA00487 for reliable_computing-outgoing; Tue, 1 May 2001 08:01:49 -0500 (CDT) Received: from zcars0m9.nortelnetworks.com (h157s242a129n47.user.nortelnetworks.com [47.129.242.157]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) with SMTP id IAA00482 for ; Tue, 1 May 2001 08:01:44 -0500 (CDT) Received: from zcars04e.nortelnetworks.com by zcars0m9.nortelnetworks.com (SMI-8.6/SMI-SVR4) id JAA18975; Tue, 1 May 2001 09:01:10 -0400 Received: from zcard015.ca.nortel.com (actually zcard015) by zcars04e.nortelnetworks.com; Tue, 1 May 2001 09:00:53 -0400 Received: by zcard015.ca.nortel.com with Internet Mail Service (5.5.2653.19) id ; Tue, 1 May 2001 09:00:54 -0400 Message-ID: <03E3E0690542D211A1490000F80836F405B51666 [at] zcard00f [dot] ca.nortel.com> From: "Bill Older" To: "R. Baker Kearfott" , reliable_computing [at] interval [dot] louisiana.edu Subject: RE: opportunity ? Date: Tue, 1 May 2001 09:00:51 -0400 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.5.2653.19) Content-Type: multipart/alternative; boundary="----_=_NextPart_001_01C0D23E.C01F5CA0" X-Orig: Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk This message is in MIME format. Since your mail reader does not understand this format, some or all of this message may not be legible. ------_=_NextPart_001_01C0D23E.C01F5CA0 Content-Type: text/plain; charset="iso-8859-1" Since the problem only affected (apparently) the least significant bits of double precision floats (and was also timing and pattern sensitive), I believe that it is likely to have gone unnoticed ( as it presumably did) by ordinary floating point users. Although there was a rumor (which I cannot verify) that something may have been noticed by people doing work on fractals. The logical form may also be significant: a mathematical problem is a well-posed optimization which a priori has a solution, the program says it doesn't, therefore the hardware is broken ( a gross simplification, to be sure, but essentially correct). This is not a situation I have run into many times before, at least not in cases of such complexity, which itself says something about standard practices, does it not? -----Original Message----- From: R. Baker Kearfott [mailto:rbk [at] louisiana [dot] edu] Sent: Monday, April 30, 2001 2:50 PM To: Older, Bill [CAR:KCA1:EXCH]; reliable_computing [at] interval [dot] louisiana.edu Subject: RE: opportunity ? The way I read your description of your debugging process, I understand that the hardware error would not have been discovered if you had not been working with intervals. By the way, in the mid 1990's, two of our Ph.D. students trained in interval analysis got positions at Motorola :-) Best regards, Baker At 02:31 PM 4/30/01 -0400, Bill Older wrote: > >Debugging Stories: > >I am not sure whether this would be considered relevant to the original >discussion >or not, but perhaps it ought to be. > >In the early 90's I was working on an interval based "logical arithmetic" >( interval constraints) implemented in BNR Prolog. The implementation at >that time >was on 68K Macs. The "relational interval arithmetic" operations were >written in >68K assembler to access the Motorola math coprocessor interface based on >IEEE 784 >( actually quite a nice interface to work with for this purpose). > >On top of all the real constraint stuff I had written some application >programs >to do non-linear constrained ( >=) optimizations based on Lagrangians. I >had a set of >modest sized non-linear optimizations which I used as test cases. These had >been >tested previously on a Mac in which the FPU was emulated in s/w. > >When I got a Mac upgrade to a new & faster machine with a real FPU I was >anxious >to run some benchmarks (understandably). Much to my surprise one of the >test cases >now gave a different answer-- "NO". As this was a well-posed optimization >problem this was >not really an acceptable answer. > >I originally suspected some problem in the high level software, either the >prolog >application or the constraint set up code. But dumping the actual constraint >network showed the same structure as in the previous machine. I then >modified the test program to >non-deterministically subset the constraints until it found a minimal >failing subproblem. >I then tried several hand-crafted versions of this minimal problem written >in various ways; >eventually I got down to a single expression which failed when it should not >have. > >When I single-stepped through this expression ( one contraint operation at a >time), >it worked however, but would fail at full speed. So I began to suspect a >h/w problem. >I trapped the code at the first failing operation, and examined the values >of the >intervals in memory and in the fpu registers and discovered a slight >difference in one variable - the least significant bit of the mantissa ( in >the fpu's internal 96 bit fp representation)was not the same. > >After much fiddling about it appeared that depending on the contents of the >fpu registers, >the last few bits of the float value might not get latched properly during >transfer to the >fpu register because of relative timing issues. > >This information along with the relevant test cases etc was passed along to >Motorola ( and getting through to some one who understood was a VERY long >process) and a couple of months >later I got some new fpu chips that worked properly. (At least for this >suite of problems!) > >I figure this story has just got to have some sort of a moral, but have >never been able to figure out just what it is! > > > > > > > > >-----Original Message----- >From: George Corliss [mailto:George.Corliss [at] Marquette [dot] edu] >Sent: Monday, April 30, 2001 6:56 AM >To: reliable_computing [at] interval [dot] louisiana.edu >Cc: Dr. George Corliss >Subject: Re: opportunity ? > > >Perhaps marginally relevant: > >Another possible contribution of interval techniques is >to debugging. > >1. Some 15 years ago, Louis Rall and I developed a package >for numerical quadrature using interval arithmetic. Among >our test problems were several integrals of the general form > Integral_a^b asin (sin (x)) - x dx >whose answers (on suitable intervals) are ZERO. I think >we uncovered some 30 errors in our code (ok, I should be >a more careful programmer) where the program returned >"validated enclosures" of the form [-2, -1] * 10^{-17}. >In floating point arithmetic, -2*10^{-17} and -1*10^{-17} >are pretty good approximations to double precision zero. >However, as an interval, they do not enclose zero, disclosing >a coding error. > >Without intervals, those errors would have gone undetected. > >2. At about the same time, I worked with a scientist at Amoco >doing oil reservoir simulation, specifically studying the >propagation of a crack in the rock as water is pumped into >a well. His program crashed with SQRT( negative ) after some >118 seemingly well behaved time steps. He could find no >error. We used an interval version of a subalgorithm to >discover that the way he was formulating an initial guess >for a Newton iteration was not sufficiently accurate as the >crack became sufficiently long. Once he identified the >cause of the SQRT( negative ) crash, he could easily >fix it by using a more accurate Newton iteration >initialization. The eventual program had no interval >methods. We only used the interval techniques for debugging. > >Without intervals, this reasonably bright guy had been >unable to locate his error in several months of study. > > >Take home: Interval techniques can sometimes render otherwise >hidden error obvious. > >Dr. George F. Corliss >Dept. Math, Stat, Comp Sci >Marquette University >P.O. Box 1881 >Milwaukee, WI 53201-1881 USA >George.Corliss [at] Marquette [dot] edu >Office: 414-288-6599; Dept: 288-7573; Fax: 288-5472 > > > > > >RE: opportunity ? > > >
> >

Debugging Stories: >

> >

I am not sure whether this would be considered relevant to the original discussion >
or not, but perhaps it ought to be. >

> >

In the early 90's I was working on an interval based "logical arithmetic" >
( interval constraints) implemented in BNR Prolog. The implementation at that time >
was on 68K Macs.  The "relational interval arithmetic" operations were written in >
68K assembler to access the Motorola math coprocessor interface based on IEEE 784 >
( actually quite a nice interface to work with for this purpose).  >

> >

On top of all the real constraint stuff I had written some application programs >
to do non-linear constrained ( >=) optimizations based on Lagrangians.  I had a set of >
modest sized non-linear optimizations which I used as test cases. These had been >
tested previously on a Mac in which the FPU was emulated in s/w. >

> >

When I got a Mac upgrade to a new & faster machine with a real FPU I was anxious >
to run some benchmarks (understandably).  Much to my surprise one of the test cases >
now gave a different answer-- "NO".   As this was a well-posed optimization problem this was >
not really an acceptable answer. >

> >

I originally suspected some problem in the high level software, either the prolog >
application or the constraint set up code. But dumping the actual constraint network showed the same structure as in the previous machine.  I then modified the test program to

> >

non-deterministically subset the constraints until it found a minimal failing subproblem. >
I then tried several hand-crafted versions of this minimal problem written in various ways; >
eventually I got down to a single expression which failed when it should not have. >

> >

When I single-stepped through this expression ( one contraint operation at a time), >
it worked however, but would fail at full speed.  So I began to suspect a h/w problem. >
I trapped the code at the first failing operation, and examined the values of the >
intervals in memory and in the fpu registers and discovered a slight difference in one variable - the least significant bit of the mantissa ( in the fpu's internal 96 bit fp representation)was not the same. 

> >

After much fiddling about it appeared that depending on the contents of the fpu registers, >
the last few bits of the float value might not get latched properly during transfer to the >
fpu register because of relative timing issues.  >

> >

This information along with the relevant test cases etc was passed along to Motorola ( and getting through to some one who understood was a VERY long process) and a couple of months

> >

later I got some new fpu chips that worked properly. (At least for this suite of problems!) >

> >

I figure this story has just got to have some sort of a moral, but have never been able to figure out just what it is! >

>
>
>
> >

  >

>
>
> >

-----Original Message----- >
From: George Corliss [mailto:George.Corliss [at] Marquette [dot] e du] >
Sent: Monday, April 30, 2001 6:56 AM >
To: reliable_computing [at] interval [dot] louisiana.edu >
Cc: Dr. George Corliss >
Subject: Re: opportunity ? >

>
> >

Perhaps marginally relevant: >

> >

Another possible contribution of interval techniques is >
to debugging. >

> >

1.  Some 15 years ago, Louis Rall and I developed a package >
for numerical quadrature using interval arithmetic.  Among >
our test problems were several integrals of the general form >
   Integral_a^b  asin (sin (x)) - x  dx >
whose answers (on suitable intervals) are ZERO.  I think >
we uncovered some 30 errors in our code (ok, I should be >
a more careful programmer) where the program returned >
"validated enclosures" of the form [-2, -1] * 10^{-17}. >
In floating point arithmetic, -2*10^{-17} and -1*10^{-17} >
are pretty good approximations to double precision zero. >
However, as an interval, they do not enclose zero, disclosing >
a coding error.  >

> >

Without intervals, those errors would have gone undetected. >

> >

2.  At about the same time, I worked with a scientist at Amoco >
doing oil reservoir simulation, specifically studying the >
propagation of a crack in the rock as water is pumped into >
a well.  His program crashed with SQRT( negative ) after some >
118 seemingly well behaved time steps.  He could find no >
error.  We used an interval version of a subalgorithm to >
discover that the way he was formulating an initial guess >
for a Newton iteration was not sufficiently accurate as the >
crack became sufficiently long.  Once he identified the >
cause of the SQRT( negative ) crash, he could easily >
fix it by using a more accurate Newton iteration >
initialization.  The eventual program had no interval >
methods.  We only used the interval techniques for debugging. >

> >

Without intervals, this reasonably bright guy had been >
unable to locate his error in several months of study. >

>
> >

Take home: Interval techniques can sometimes render otherwise >
hidden error obvious. >

> >

Dr. George F. Corliss >
Dept. Math, Stat, Comp Sci >
Marquette University >
P.O. Box 1881 >
Milwaukee, WI  53201-1881  USA >
George.Corliss [at] Marquette [dot] edu >
Office: 414-288-6599;  Dept: 288-7573; Fax: 288-5472 >

> > > --------------------------------------------------------------- R. Baker Kearfott, rbk [at] louisiana [dot] edu (337) 482-5346 (fax) (337) 482-5270 (work) (337) 981-9744 (home) URL: http://interval.louisiana.edu/kearfott.html Department of Mathematics, University of Louisiana at Lafayette Box 4-1010, Lafayette, LA 70504-1010, USA --------------------------------------------------------------- ------_=_NextPart_001_01C0D23E.C01F5CA0 Content-Type: text/html; charset="iso-8859-1" RE: opportunity ?

Since the problem only affected (apparently) the least significant bits
of double precision floats (and was also timing and pattern sensitive), I
believe that it is likely to have gone unnoticed ( as it presumably did)
by ordinary floating point users.  Although there was a rumor (which I cannot
verify) that something may have been noticed by people doing work on fractals.

The logical form may also be significant: a mathematical problem is a well-posed
optimization which a priori has a solution, the program says it doesn't, therefore the
hardware is broken  ( a gross simplification, to be sure, but essentially correct).
This is not a situation I have run into many times before, at least not in cases of
such complexity, which itself says something about standard practices, does it not?

-----Original Message-----
From: R. Baker Kearfott [mailto:rbk [at] louisiana [dot] edu]
Sent: Monday, April 30, 2001 2:50 PM
To: Older, Bill [CAR:KCA1:EXCH];
reliable_computing [at] interval [dot] louisiana.edu
Subject: RE: opportunity ?


The way I read your description of your debugging process, I understand
that the hardware error would not have been discovered if you had not
been working with intervals.

By the way, in the mid 1990's, two of our Ph.D. students trained
in interval analysis got positions at Motorola :-)

Best regards,

Baker

At 02:31 PM 4/30/01 -0400, Bill Older wrote:
>
>Debugging Stories:
>
>I am not sure whether this would be considered relevant to the original
>discussion
>or not, but perhaps it ought to be.
>
>In the early 90's I was working on an interval based "logical arithmetic"
>( interval constraints) implemented in BNR Prolog. The implementation at
>that time
>was on 68K Macs.  The "relational interval arithmetic" operations were
>written in
>68K assembler to access the Motorola math coprocessor interface based on
>IEEE 784
>( actually quite a nice interface to work with for this purpose). 
>
>On top of all the real constraint stuff I had written some application
>programs
>to do non-linear constrained ( >=) optimizations based on Lagrangians.  I
>had a set of
>modest sized non-linear optimizations which I used as test cases. These had
>been
>tested previously on a Mac in which the FPU was emulated in s/w.
>
>When I got a Mac upgrade to a new & faster machine with a real FPU I was
>anxious
>to run some benchmarks (understandably).  Much to my surprise one of the
>test cases
>now gave a different answer-- "NO".   As this was a well-posed optimization
>problem this was
>not really an acceptable answer.
>
>I originally suspected some problem in the high level software, either the
>prolog
>application or the constraint set up code. But dumping the actual constraint
>network showed the same structure as in the previous machine.  I then
>modified the test program to
>non-deterministically subset the constraints until it found a minimal
>failing subproblem.
>I then tried several hand-crafted versions of this minimal problem written
>in various ways;
>eventually I got down to a single expression which failed when it should not
>have.
>
>When I single-stepped through this expression ( one contraint operation at a
>time),
>it worked however, but would fail at full speed.  So I began to suspect a
>h/w problem.
>I trapped the code at the first failing operation, and examined the values
>of the
>intervals in memory and in the fpu registers and discovered a slight
>difference in one variable - the least significant bit of the mantissa ( in
>the fpu's internal 96 bit fp representation)was not the same. 
>
>After much fiddling about it appeared that depending on the contents of the
>fpu registers,
>the last few bits of the float value might not get latched properly during
>transfer to the
>fpu register because of relative timing issues. 
>
>This information along with the relevant test cases etc was passed along to
>Motorola ( and getting through to some one who understood was a VERY long
>process) and a couple of months
>later I got some new fpu chips that worked properly. (At least for this
>suite of problems!)
>
>I figure this story has just got to have some sort of a moral, but have
>never been able to figure out just what it is!
>
>
>
>
>
>
>
>
>-----Original Message-----
>From: George Corliss [mailto:George.Corliss [at] Marquette [dot] edu]
>Sent: Monday, April 30, 2001 6:56 AM
>To: reliable_computing [at] interval [dot] louisiana.edu
>Cc: Dr. George Corliss
>Subject: Re: opportunity ?
>
>
>Perhaps marginally relevant:
>
>Another possible contribution of interval techniques is
>to debugging.
>
>1.  Some 15 years ago, Louis Rall and I developed a package
>for numerical quadrature using interval arithmetic.  Among
>our test problems were several integrals of the general form
>   Integral_a^b  asin (sin (x)) - x  dx
>whose answers (on suitable intervals) are ZERO.  I think
>we uncovered some 30 errors in our code (ok, I should be
>a more careful programmer) where the program returned
>"validated enclosures" of the form [-2, -1] * 10^{-17}.
>In floating point arithmetic, -2*10^{-17} and -1*10^{-17}
>are pretty good approximations to double precision zero.
>However, as an interval, they do not enclose zero, disclosing
>a coding error. 
>
>Without intervals, those errors would have gone undetected.
>
>2.  At about the same time, I worked with a scientist at Amoco
>doing oil reservoir simulation, specifically studying the
>propagation of a crack in the rock as water is pumped into
>a well.  His program crashed with SQRT( negative ) after some
>118 seemingly well behaved time steps.  He could find no
>error.  We used an interval version of a subalgorithm to
>discover that the way he was formulating an initial guess
>for a Newton iteration was not sufficiently accurate as the
>crack became sufficiently long.  Once he identified the
>cause of the SQRT( negative ) crash, he could easily
>fix it by using a more accurate Newton iteration
>initialization.  The eventual program had no interval
>methods.  We only used the interval techniques for debugging.
>
>Without intervals, this reasonably bright guy had been
>unable to locate his error in several months of study.
>
>
>Take home: Interval techniques can sometimes render otherwise
>hidden error obvious.
>
>Dr. George F. Corliss
>Dept. Math, Stat, Comp Sci
>Marquette University
>P.O. Box 1881
>Milwaukee, WI  53201-1881  USA
>George.Corliss [at] Marquette [dot] edu
>Office: 414-288-6599;  Dept: 288-7573; Fax: 288-5472
><!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
><HTML>
><HEAD>
><META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=iso-8859-1">
><META NAME="Generator" CONTENT="MS Exchange Server version 5.5.2654.59">
><TITLE>RE: opportunity ?</TITLE>
></HEAD>
><BODY>
><BR>
>
><P><FONT SIZE=2>Debugging Stories:</FONT>
></P>
>
><P><FONT SIZE=2>I am not sure whether this would be considered relevant to the original discussion</FONT>
><BR><FONT SIZE=2>or not, but perhaps it ought to be.</FONT>
></P>
>
><P><FONT SIZE=2>In the early 90's I was working on an interval based &quot;logical arithmetic&quot;</FONT>
><BR><FONT SIZE=2>( interval constraints) implemented in BNR Prolog. The implementation at that time</FONT>
><BR><FONT SIZE=2>was on 68K Macs.&nbsp; The &quot;relational interval arithmetic&quot; operations were written in</FONT>

><BR><FONT SIZE=2>68K assembler to access the Motorola math coprocessor interface based on IEEE 784</FONT>
><BR><FONT SIZE=2>( actually quite a nice interface to work with for this purpose).&nbsp; </FONT>
></P>
>
><P><FONT SIZE=2>On top of all the real constraint stuff I had written some application programs</FONT>
><BR><FONT SIZE=2>to do non-linear constrained ( &gt;=) optimizations based on Lagrangians.&nbsp; I had a set of</FONT>
><BR><FONT SIZE=2>modest sized non-linear optimizations which I used as test cases. These had been</FONT>
><BR><FONT SIZE=2>tested previously on a Mac in which the FPU was emulated in s/w.</FONT>
></P>
>
><P><FONT SIZE=2>When I got a Mac upgrade to a new &amp; faster machine with a real FPU I was anxious</FONT>
><BR><FONT SIZE=2>to run some benchmarks (understandably).&nbsp; Much to my surprise one of the test cases</FONT>
><BR><FONT SIZE=2>now gave a different answer-- &quot;NO&quot;.&nbsp;&nbsp; As this was a well-posed optimization problem this was</FONT>

><BR><FONT SIZE=2>not really an acceptable answer.</FONT>
></P>
>
><P><FONT SIZE=2>I originally suspected some problem in the high level software, either the prolog</FONT>
><BR><FONT SIZE=2>application or the constraint set up code. But dumping the actual constraint network showed the same structure as in the previous machine.&nbsp; I then modified the test program to</FONT></P>

>
><P><FONT SIZE=2>non-deterministically subset the constraints until it found a minimal failing subproblem.</FONT>
><BR><FONT SIZE=2>I then tried several hand-crafted versions of this minimal problem written in various ways;</FONT>
><BR><FONT SIZE=2>eventually I got down to a single expression which failed when it should not have.</FONT>
></P>
>
><P><FONT SIZE=2>When I single-stepped through this expression ( one contraint operation at a time),</FONT>
><BR><FONT SIZE=2>it worked however, but would fail at full speed.&nbsp; So I began to suspect a h/w problem.</FONT>
><BR><FONT SIZE=2>I trapped the code at the first failing operation, and examined the values of the </FONT>
><BR><FONT SIZE=2>intervals in memory and in the fpu registers and discovered a slight difference in one variable - the least significant bit of the mantissa ( in the fpu's internal 96 bit fp representation)was not the same.&nbsp; </FONT></P>

>
><P><FONT SIZE=2>After much fiddling about it appeared that depending on the contents of the fpu registers,</FONT>
><BR><FONT SIZE=2>the last few bits of the float value might not get latched properly during transfer to the</FONT>
><BR><FONT SIZE=2>fpu register because of relative timing issues.&nbsp; </FONT>
></P>
>
><P><FONT SIZE=2>This information along with the relevant test cases etc was passed along to Motorola ( and getting through to some one who understood was a VERY long process) and a couple of months</FONT></P>

>
><P><FONT SIZE=2>later I got some new fpu chips that worked properly. (At least for this suite of problems!)</FONT>
></P>
>
><P><FONT SIZE=2>I figure this story has just got to have some sort of a moral, but have never been able to figure out just what it is!</FONT>

></P>
><BR>
><BR>
><BR>
>
><P><FONT SIZE=2>&nbsp;</FONT>
></P>
><BR>
><BR>
>
><P><FONT SIZE=2>-----Original Message-----</FONT>
><BR><FONT SIZE=2>From: George Corliss [<A HREF="mailto:George.Corliss [at] Marquette [dot] edu">mailto:George.Corliss [at] Marquette [dot] edu</A>]</FONT>

><BR><FONT SIZE=2>Sent: Monday, April 30, 2001 6:56 AM</FONT>
><BR><FONT SIZE=2>To: reliable_computing [at] interval [dot] louisiana.edu</FONT>
><BR><FONT SIZE=2>Cc: Dr. George Corliss</FONT>
><BR><FONT SIZE=2>Subject: Re: opportunity ?</FONT>
></P>
><BR>
>
><P><FONT SIZE=2>Perhaps marginally relevant:</FONT>
></P>
>
><P><FONT SIZE=2>Another possible contribution of interval techniques is</FONT>
><BR><FONT SIZE=2>to debugging.</FONT>
></P>
>
><P><FONT SIZE=2>1.&nbsp; Some 15 years ago, Louis Rall and I developed a package</FONT>
><BR><FONT SIZE=2>for numerical quadrature using interval arithmetic.&nbsp; Among</FONT>
><BR><FONT SIZE=2>our test problems were several integrals of the general form</FONT>
><BR><FONT SIZE=2>&nbsp;&nbsp; Integral_a^b&nbsp; asin (sin (x)) - x&nbsp; dx</FONT>
><BR><FONT SIZE=2>whose answers (on suitable intervals) are ZERO.&nbsp; I think</FONT>
><BR><FONT SIZE=2>we uncovered some 30 errors in our code (ok, I should be</FONT>
><BR><FONT SIZE=2>a more careful programmer) where the program returned</FONT>
><BR><FONT SIZE=2>&quot;validated enclosures&quot; of the form [-2, -1] * 10^{-17}.</FONT>
><BR><FONT SIZE=2>In floating point arithmetic, -2*10^{-17} and -1*10^{-17}</FONT>
><BR><FONT SIZE=2>are pretty good approximations to double precision zero.</FONT>
><BR><FONT SIZE=2>However, as an interval, they do not enclose zero, disclosing</FONT>
><BR><FONT SIZE=2>a coding error.&nbsp; </FONT>
></P>
>
><P><FONT SIZE=2>Without intervals, those errors would have gone undetected.</FONT>
></P>
>
><P><FONT SIZE=2>2.&nbsp; At about the same time, I worked with a scientist at Amoco</FONT>
><BR><FONT SIZE=2>doing oil reservoir simulation, specifically studying the</FONT>
><BR><FONT SIZE=2>propagation of a crack in the rock as water is pumped into</FONT>
><BR><FONT SIZE=2>a well.&nbsp; His program crashed with SQRT( negative ) after some </FONT>
><BR><FONT SIZE=2>118 seemingly well behaved time steps.&nbsp; He could find no </FONT>
><BR><FONT SIZE=2>error.&nbsp; We used an interval version of a subalgorithm to </FONT>
><BR><FONT SIZE=2>discover that the way he was formulating an initial guess </FONT>
><BR><FONT SIZE=2>for a Newton iteration was not sufficiently accurate as the</FONT>
><BR><FONT SIZE=2>crack became sufficiently long.&nbsp; Once he identified the</FONT>
><BR><FONT SIZE=2>cause of the SQRT( negative ) crash, he could easily</FONT>
><BR><FONT SIZE=2>fix it by using a more accurate Newton iteration </FONT>
><BR><FONT SIZE=2>initialization.&nbsp; The eventual program had no interval</FONT>
><BR><FONT SIZE=2>methods.&nbsp; We only used the interval techniques for debugging.</FONT>
></P>
>
><P><FONT SIZE=2>Without intervals, this reasonably bright guy had been </FONT>
><BR><FONT SIZE=2>unable to locate his error in several months of study.</FONT>
></P>
><BR>
>
><P><FONT SIZE=2>Take home: Interval techniques can sometimes render otherwise</FONT>
><BR><FONT SIZE=2>hidden error obvious.</FONT>
></P>
>
><P><FONT SIZE=2>Dr. George F. Corliss</FONT>
><BR><FONT SIZE=2>Dept. Math, Stat, Comp Sci</FONT>
><BR><FONT SIZE=2>Marquette University</FONT>
><BR><FONT SIZE=2>P.O. Box 1881</FONT>
><BR><FONT SIZE=2>Milwaukee, WI&nbsp; 53201-1881&nbsp; USA</FONT>
><BR><FONT SIZE=2>George.Corliss [at] Marquette [dot] edu</FONT>
><BR><FONT SIZE=2>Office: 414-288-6599;&nbsp; Dept: 288-7573; Fax: 288-5472</FONT>
></P>
>
></BODY>
></HTML>
---------------------------------------------------------------
R. Baker Kearfott,    rbk [at] louisiana [dot] edu   (337) 482-5346 (fax)
(337) 482-5270 (work)                     (337) 981-9744 (home)
URL: http://interval.louisiana.edu/kearfott.html
Department of Mathematics, University of Louisiana at Lafayette
Box 4-1010, Lafayette, LA 70504-1010, USA
---------------------------------------------------------------

------_=_NextPart_001_01C0D23E.C01F5CA0-- From owner-reliable_computing [at] interval [dot] usl.edu Tue May 1 09:00:09 2001 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) id JAA00869 for reliable_computing-outgoing; Tue, 1 May 2001 09:00:09 -0500 (CDT) Received: from forelli.math.wisc.edu (forelli.math.wisc.edu [144.92.166.70]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) with ESMTP id JAA00864 for ; Tue, 1 May 2001 09:00:05 -0500 (CDT) Received: (from rall@localhost) by forelli.math.wisc.edu (8.9.3+Sun/8.9.3) id JAA17739 for reliable_computing [at] interval [dot] louisiana.edu; Tue, 1 May 2001 09:00:05 -0500 (CDT) Date: Tue, 1 May 2001 09:00:05 -0500 (CDT) Message-Id: <200105011400.JAA17739 [at] forelli [dot] math.wisc.edu> From: rall [at] math [dot] wisc.edu To: reliable_computing [at] interval [dot] louisiana.edu Subject: debugging story Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk I found a hardware error in the UW's CDC 1604 in 1963 using "home made" interval arithmetic to find lower and upper bounds for the Chandrasekhar-Ambartsumian integral equation of radiative transfer. I was unaware of Moore's general formulation of interval arithmetic at the time and was fortunate to deal with monotone functions only. Louis Rall From owner-reliable_computing [at] interval [dot] usl.edu Thu May 3 11:18:45 2001 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) id LAA00393 for reliable_computing-outgoing; Thu, 3 May 2001 11:18:45 -0500 (CDT) Received: from narech.irin.univ-nantes.fr (IDENT:root [at] narech [dot] irin.sciences.univ-nantes.fr [193.52.99.2]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) with ESMTP id LAA00386 for ; Thu, 3 May 2001 11:18:29 -0500 (CDT) Received: from irin.univ-nantes.fr (IDENT:granvil@erebus [193.52.99.69]) by narech.irin.univ-nantes.fr (8.9.3/jtpda-5.3.2) with ESMTP id LAA00985 ; Thu, 3 May 2001 11:46:57 +0200 Message-ID: <3AF12967.55734323 [at] irin [dot] univ-nantes.fr> Date: Thu, 03 May 2001 11:48:23 +0200 From: Laurent Granvilliers Organization: IRIN - =?iso-8859-1?Q?Universit=E9?= de Nantes X-Mailer: Mozilla 4.75 [fr] (X11; U; Linux 2.2.17-21mdk i686) X-Accept-Language: en MIME-Version: 1.0 To: clp [at] comp [dot] nus.edu.sg, concurrency [at] cwi [dot] nl, constraints-list [at] cwi [dot] nl, distributed-ai [at] mailbase [dot] ac.uk, eclipse_users [at] ecrc [dot] de, frocos [at] loria [dot] fr, reliable_computing [at] interval [dot] louisiana.edu Subject: 2nd CFP: PPAM'2001: special session on constraint solving References: <3A753969.86564032 [at] irin [dot] univ-nantes.fr> Content-Type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: 8bit Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Apologies if you receive this more than once. ----------------------------------------------------------------------- Second Call for Papers SPECIAL SESSION on Parallel/Distributed/Cooperative Constraint Solving International Conference on Parallel Processing and Applied Mathematics Naleczow, Poland, September 9-12, 2001 Conference home page: http://www.k2.pcz.czest.pl/~roman/ppam2001 ----------------------------------------------------------------------- In the recent past, much attention has been paid to the problem of finding a solution to a set of constraints, where constraints are distributed among a set of agents/processors, and solvers cooperate in parallel or concurrently. The main issues to be tackled are efficiency, termination, correctness, etc. of the overall solver. However, up to now, frameworks and algorithms have been developed mostly in separate communities: numerical analysis, computer algebra, constraint programming, parallelism, etc. The aim of this session is to bring together specialists from diverse areas of mathematics and computer science, and to build synergy between these communities. Topics of interest include (but are not limited to): - distributed CSP - parallel search - parallel iteration/constraint propagation - models of cooperative solvers - concurrent algorithms - coordination-based problem solving Submission and Proceedings ----------------------------------------------------------------------- The submission of a paper to a special session should be clearly identified. All accepted papers will be published in the PPAM'2001 proceedings (volume of LNCS). Please consult the conference home page for more details, or contact the organizers. Important Dates ----------------------------------------------------------------------- Submission of Papers: May 15, 2001 Notification of Acceptance: July 01, 2001 Camera-Ready Papers: October 31, 2001 Organizers ----------------------------------------------------------------------- Laurent Granvilliers (granvilliers [at] irin [dot] univ-nantes.fr) Eric Monfroy (monfroy [at] irin [dot] univ-nantes.fr) 2, rue de la Houssinière - B.P. 92208 F-44322 Nantes Cedex 3 - France phone: +33 2 51 12 58 51 / fax: +33 2 51 12 58 12 From owner-reliable_computing [at] interval [dot] usl.edu Thu May 3 11:48:21 2001 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) id LAA00708 for reliable_computing-outgoing; Thu, 3 May 2001 11:48:21 -0500 (CDT) Received: from marnier.ucs.louisiana.edu (root@[130.70.40.2]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) with ESMTP id LAA00703 for ; Thu, 3 May 2001 11:48:17 -0500 (CDT) Received: from liberty (liberty.louisiana.edu [130.70.46.171]) by marnier.ucs.louisiana.edu (8.9.1/8.9.1/ucs-mx-host_1.3-virus) with SMTP id LAA05149 for ; Thu, 3 May 2001 11:48:16 -0500 (CDT) Message-Id: <2.2.32.20010503165021.012cc27c [at] 130 [dot] 70.132.231> X-Sender: rbk5287 [at] 130 [dot] 70.132.231 X-Mailer: Windows Eudora Pro Version 2.2 (32) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Thu, 03 May 2001 11:50:21 -0500 To: reliable_computing [at] interval [dot] louisiana.edu From: "R. Baker Kearfott" Subject: interval.louisiana.edu is back online Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Colleagues, My machine interval.louisiana.edu has been offline for approximately 18 hours, because of damage to ethernet equipment caused by a thunderstorm. If you have had trouble accessing the web site, or if mail to this list has bounced, that is why. The service is back up, and it's a clear day, so you shouldn't have more trouble for a while :-) Best regards, Baker P.S. I did put the machine on an uninterruptible power supply, but the problem was with the network. This is an example of too much electricity, rather than not enough :-) Nonetheless, it shouldn't be too shocking :-) --------------------------------------------------------------- R. Baker Kearfott, rbk [at] louisiana [dot] edu (337) 482-5346 (fax) (337) 482-5270 (work) (337) 981-9744 (home) URL: http://interval.louisiana.edu/kearfott.html Department of Mathematics, University of Louisiana at Lafayette Box 4-1010, Lafayette, LA 70504-1010, USA --------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] usl.edu Mon May 7 16:53:03 2001 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) id QAA03551 for reliable_computing-outgoing; Mon, 7 May 2001 16:53:03 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) with ESMTP id QAA03546 for ; Mon, 7 May 2001 16:52:59 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id f47LqtJ05278 for ; Mon, 7 May 2001 15:52:55 -0600 (MDT) Message-Id: <200105072152.f47LqtJ05278 [at] cs [dot] utep.edu> Date: Mon, 7 May 2001 15:52:55 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: A new book on interval computations To: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: bF5TiFfxLsPl1gZGhAGA5w== 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 A new book on interval computations: Luc Jaulin, Michel Keiffer, Olivier Didrit, and Eric Walter, "Applied Interval Analysis", Springer-Verlag, 2001, ISBN 1-85233-219-0 >From the cover: "This books is about guaranteed numerical methods based on interval analysis for approximating sets, and about the application of these methods to vast classes of engineering problems. Guaranteed means here that inner and outer approximations of the sets of interest are obtained, which can be made as precise as desired, at the cost of increasing the computational effort. It thus becomes possible to achieve tasks still thought by many to be out of reach of numerical methods, such as finding all solutions of sets of non-linear equations and inequality or all global optimizers of possibly multi-modal criteria. The basic methodology is explained as simply as possible, in a concrete and readily applicable way, with a large number of figures and illustrative examples. Some of the techniques reported appear in the book format for the first time. The ability of the approach advocated here to solve non-trivial engineering problems is demonstrated through examples drawn from the fields of parameter and state estimation, robust control and robotics. Enough detail is provided to allow readers with other applications in mind to grasp their significance. An in-depth treatment of implementation issues facilitates the understanding and use of freely-available software that makes interval computation about as easy as computation with floating-point numbers. The reader is even given the basic information needed to build her or his own C++ interval library. C++ code implementing the main ideas of the book can be downloaded from Springer's web site." This book is highly recommended by such renown researchers as Ramon Moore, Bill Walster, and Eldon Hansen. From owner-reliable_computing [at] interval [dot] usl.edu Tue May 8 10:22:41 2001 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) id KAA00540 for reliable_computing-outgoing; Tue, 8 May 2001 10:22:41 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) with ESMTP id KAA00535 for ; Tue, 8 May 2001 10:22:36 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id f48FMXv10745 for ; Tue, 8 May 2001 09:22:33 -0600 (MDT) Message-Id: <200105081522.f48FMXv10745 [at] cs [dot] utep.edu> Date: Tue, 8 May 2001 09:22:32 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: ISIPTA '01: Call for Participation To: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: IhX3C54Jk0+72dcLyU0M+Q== 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 ------------- Date: Tue, 08 May 2001 10:04:08 +0200 From: Gert de Cooman Your help with circulating this announcement locally would be very much appreciated. We apologise if you receive multiple copies of this message. If you haven't received this mail through some electronic mailing list, this means that you have expressed some interest in the previous ISIPTA symposium, or that we received your address from one of our colleagues who thought this message might be of interest to you. If you do not want to receive further information about ISIPTA '01, please send a short message saying so to smc [at] decsai [dot] ugr.es. If you have sent us such a message before, and keep receiving our mails, it's possible that you are a member of a mailing list to which our message is cross-posted. ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ ISIPTA '01 THE SECOND INTERNATIONAL SYMPOSIUM ON IMPRECISE PROBABILITIES AND THEIR APPLICATIONS Cornell University Ithaca, NY, USA 26 - 29 June 2001 CALL FOR PARTICIPATION ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ The Second International Symposium on Imprecise Probabilities and Their Applications (ISIPTA '01), will be held at the Robert Purcell Community Center of Cornell University, Ithaca, NY, USA, from 26 till 29 June 2001. Symposium web site ------------------ All information relating to the symposium is published on the symposium web site: http://ippserv.rug.ac.be/~isipta01 The papers ---------- A total of 47 papers will be presented at ISIPTA '01, on a wide range of topics, and in various fields of scientific endeavour: algorithms for computing inferences, ambiguity aversion and Ellsberg's paradox, belief change, civil engineering, classification and pattern recognition, coherence, combination of uncertainties, conditioning, credal networks, decision-making, economic and financial models, elicitation of models, foundations of probability, hierarchical models, independence and irrelevance, mathematical models for uncertainty, probabilistic logic, reliability, statistical inference, and summary measures of uncertainty. All the papers published in these proceedings have gone through a careful reviewing and selection process. Our aim throughout has been to produce a symposium and proceedings meeting the highest standards. A list of accepted papers can be found at http://ippserv.rug.ac.be/~isipta01/accepted.html. Electronic proceedings can be consulted at http://ippserv.rug.ac.be/~isipta01/proceedings/index.html The sessions ------------ In order to promote discussion and interaction between participants, ISIPTA '01 offers what we believe to be a novel conference format. The 47 accepted papers are each provided with a morning poster session, as well as a 20 minute plenary discussion later that same day where (i) authors have the opportunity to give a brief overview of their research interests and an explanation of how the conference paper fits into that research agenda; and (ii) participants and authors can engage in public discussion about the issues addressed in the paper. There will be no invited speakers and no parallel sessions. Detailed program information can be found at http://ippserv.rug.ac.be/~isipta01/program.html What is imprecise probability? ------------------------------ Imprecise probability is a generic term for the many mathematical models which measure chance or uncertainty without sharp numerical probabilities. These models include belief functions, Choquet capacities, comparative probability orderings, convex sets of probability measures, fuzzy measures, interval-valued probabilities, possibility measures, plausibility measures, and upper and lower expectations or previsions. Such models are needed in inference problems where the relevant information is scarce, vague or conflicting, and in decision problems where preferences may also be incomplete. See the IPP web site for introductory articles about imprecise probabilities, an extensive bibliography, and a collection of survey articles on special types of imprecise probability models. Symposium language ------------------ The working language of the symposium will be English. No simultaneous translation in other languages will be available. Registration ------------ Detailed registration information can be found at http://ippserv.rug.ac.be/~isipta01/register.html Accommodation ------------- We have made reservations for a limited number of Townhouse Apartments close to the conference facilities. As soon as we run out of these, you'll have to look for proper accommodation (further away from where the conference will be held). So, if you intend to attend the conference, it is in your own interest to register as soon as possible, and make reservations for accommodation. See our accommodation page for more information: http://ippserv.rug.ac.be/~isipta01/accommodation.html Important dates ---------------- Early registration deadline 31 May 2001 Symposium: 26 - 29 June 2001 Questions --------- If you have any questions about the symposium, please contact the Organising Committee, at the following address: Terrence Fine Director Center for Applied Mathematics Rhodes Hall 612 Cornell University Ithaca NY 14853 USA Tel: +1-607-255-4336/3643 E-mail: tlfine [at] cam [dot] cornell.edu ------------- End Forwarded Message ------------- From owner-reliable_computing [at] interval [dot] usl.edu Wed May 9 08:57:20 2001 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) id IAA02119 for reliable_computing-outgoing; Wed, 9 May 2001 08:57:20 -0500 (CDT) Received: from mailhost.uni-koblenz.de (mailhost.uni-koblenz.de [141.26.64.1]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) with ESMTP id IAA02114 for ; Wed, 9 May 2001 08:57:15 -0500 (CDT) Received: from nostromo.uni-koblenz.de (root [at] nostromo [dot] uni-koblenz.de [141.26.66.122]) by mailhost.uni-koblenz.de (8.9.3/8.9.3) with ESMTP id PAA16105; Wed, 9 May 2001 15:55:51 +0200 (MET DST) Received: (from peter@localhost) by nostromo.uni-koblenz.de (8.9.3/8.9.1) id PAA21075; Wed, 9 May 2001 15:55:48 +0200 MIME-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Message-ID: <15097.19556.272827.493917 [at] nostromo [dot] uni-koblenz.de> Date: Wed, 9 May 2001 15:55:48 +0200 To: Ijcar Publicity Chair Subject: IJCAR 2001: 2nd Call for Participation From: Ijcar Publicity Chair X-Mailer: VM 6.90 under 21.1 (patch 14) "Cuyahoga Valley" XEmacs Lucid Content-Transfer-Encoding: 8bit X-MIME-Autoconverted: from quoted-printable to 8bit by interval.usl.edu id IAA02115 Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk ------------------------------------------------------------ IJCAR 2001 The International Joint Conference on Automated Reasoning June 18 - 23, 2001 Siena, Italy http://www.dii.unisi.it/~ijcar/ ------------------------------------------------------------ CALL FOR PARTICIPATION EARLY REGISTRATION DEADLINE IS TUESDAY, MAY 15 Contents: 1) About IJCAR 2) Technical Programme 3) Timetable 4) Registration 1) About IJCAR ---------------- The International Joint Conference on Automated Reasoning (IJCAR) is the fusion of three major conferences in Automated Reasoning: - CADE (The International Conference on Automated Deduction), - TABLEAUX (The International Conference on Automated Reasoning with Analytic Tableaux and Related Methods), and - FTP (The International Workshop on First-Order Theorem Proving). These three events will join for the first time at the IJCAR conference in Siena in June 2001. Conference chair: Fabio Massacci, Univ. di Siena, Italy Email: ijcar-cch [at] dii [dot] unisi.it Programme Co-chairs: Rajeev Goré, ARP-ANU, Australia, Alexander Leitsch, TU-Wien, Austria, Tobias Nipkow, TU-München, Germany Email: ijcar-pch [at] dii [dot] unisi.it 2) Technical Programme ------------------------ THE IJCAR WEB PAGE CONTAINS A DETAILLED SCHEDULE The technical programme consists of - invited talks by Neil Jones, DIKU, University of Copenhagen, Denmark, Larry Paulson, University of Cambridge, England, Helmut Schwichtenberg, Ludwig-Maximilians-Universität München, Germany, Andrei Voronkov, University of Manchester, United Kingdom, and Doron Zeilberger, Temple University, Philadelphia, USA, - presumable 37 presentations of research papers from the areas Description, Modal and Temporal Logics, Saturation Based Theorem Proving and Applications, Logic Programming and Nonmonotonic Reasoning, Propositional Satisfiability and Quantified Boolean Logic, Logical Frameworks, Higher-Order Logic, Interactive Theorem Proving, Data Structures and Semantic Guidance, Equational Theorem Proving and Term Rewriting, Tableau, Sequent and Natural Deduction Calculi and Proof Theory, Automata, Specification, Verification and Logics of Programs, Nonclassical Logics, - presumable 19 presentations of system descriptions, as well as demonstrations of systems, - presumable 21 presentations of short papers - 9 workshops, titled W1: Future directions in Automated Reasoning, W2: Precise Modelling and Deduction for OO-Software Development, W3: Verification, W4: Unification (UNIF-2001), W6: Strategies in Automated Deduction (STRATEGIES 2001), W7: Mechanized Reasoning about Languages with Variable Bindings (MERLIN 2001), W8: Theory and Application of Quantified Boolean Formulas, W9: Proof Transformations, Proof Presentations and Complexity of Proofs (PTP-01), W10: Issues in the Design and Experimental Evaluation of Systems for Modal and Temporal Logics - 4 tutorials: T1: Computational mathematics: opportunities and challenges for computational logic, by Ursula Martin (St Andrews), Tom Kelsey (St Andrews), James Davenport (Bath), T2: Clausal Temporal Resolution, by Clare Dixon (Liverpool), Michael Fisher (Liverpool), T3: Constraint Handling Rules, by Thom Fruehwirth (Munich), T4: Description Logics: Basics, Inference Algorithms, and Applications, by Ian Horrocks (Manchester), Ulrike Sattler (Aachen), - CASC (Automated Theorem Provers System Competition). Furthermore, connected to IJCAR are the workshops Calculemus-2001 and ICoS-3 (Inference in Computational Semantics). For further information please visit the IJCAR web page or contact the IJCAR publicity chair ( ijcar-publicity [at] dii [dot] unisi.it ) 3) Timetable ------------ Monday, June 18 : IJCAR Workshops (W1, W2, W4, W6, W7, W8) ICoS-3 Tuesday, June 19 : IJCAR Workshops (W3, W4, W9, W10) IJCAR Tutorials (Morning: T1, T2, Afternoon: T3, T4) ICoS-3 Wednesday, June 20 : IJCAR Main Conference Thursday, June 21 : IJCAR Main Conference, CASC, Conference Banquet, Calculemus-2001 Friday, June 22 : IJCAR Main Conference Calculemus-2001 Saturday, June 23 : IJCAR Main Conference, Excursions (not yet determined) 4) Registration --------------- IJCAR Conference and Workshops registration and hotel registration is open now. EARLY REGISTRATION AT REDUCED RATES WILL BE ACCEPTED UNTIL TUESDAY 15 MAY 2001. REGISTRATIONS WILL BE ACCEPTED UNTIL JUNE 11 2001. After this date, registration must be made ON THE CONFERENCE SITE at the registration desk. Further information, including registration forms, is available from the IJCAR web page. For questions please contact the IJCAR conference chair ( ijcar-cch [at] dii [dot] unisi.it ) or the IJCAR publicity chair ( ijcar-publicity [at] dii [dot] unisi.it ) -- Peter Baumgartner peter@uni-koblenz.de Tel. +49 261 287-2777 http://www.uni-koblenz.de/~peter/ From owner-reliable_computing [at] interval [dot] usl.edu Wed May 9 20:56:26 2001 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) id UAA00720 for reliable_computing-outgoing; Wed, 9 May 2001 20:56:26 -0500 (CDT) Received: from bologna.vision.caltech.edu (IDENT:root [at] bologna [dot] vision.caltech.edu [131.215.134.19]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) with ESMTP id UAA00715 for ; Wed, 9 May 2001 20:56:21 -0500 (CDT) Received: from modena.vision.caltech.edu (modena [131.215.134.17]) by bologna.vision.caltech.edu (8.9.3/8.8.7) with ESMTP id SAA06152 for ; Wed, 9 May 2001 18:56:19 -0700 Received: (from arrigo@localhost) by modena.vision.caltech.edu (8.9.3+Sun/8.9.3) id SAA04263; Wed, 9 May 2001 18:58:25 -0700 (PDT) X-Authentication-Warning: modena.vision.caltech.edu: arrigo set sender to arrigo [at] vision [dot] caltech.edu using -f From: Arrigo Benedetti MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-ID: <15097.62913.165739.322871 [at] gargle [dot] gargle.HOWL> Date: Wed, 9 May 2001 18:58:25 -0700 To: reliable_computing [at] interval [dot] louisiana.edu Subject: bounds on singular values of A X-Mailer: VM 6.90 under Emacs 20.4.1 Reply-To: arrigo [at] bologna [dot] vision.caltech.edu Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear interval researchers, I am looking for an interval algorithm able to find tight bounds on the singular values of a matrix. Even though the matrices that I am working with are 3x3 with rank 2, the closed form expressions for the two nonzero singular values are horrendous. Any pointers? Thanks, -Arrigo -- Dr. Arrigo Benedetti e-mail: arrigo [at] vision [dot] caltech.edu Caltech, MS 136-93 phone: (626) 395-3129 Pasadena, CA 91125 fax: (626) 795-8649 From owner-reliable_computing [at] interval [dot] usl.edu Wed May 9 21:16:27 2001 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) id VAA01024 for reliable_computing-outgoing; Wed, 9 May 2001 21:16:26 -0500 (CDT) Received: from solon.mat.univie.ac.at (solon.mat.univie.ac.at [131.130.145.131]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) with ESMTP id VAA01019 for ; Wed, 9 May 2001 21:16:22 -0500 (CDT) Received: (from neum@localhost) by solon.mat.univie.ac.at (8.9.3/8.9.3) id EAA23503; Thu, 10 May 2001 04:16:17 +0200 (MET DST) Date: Thu, 10 May 2001 04:16:17 +0200 (MET DST) From: Arnold Neumaier Message-Id: <200105100216.EAA23503 [at] solon [dot] mat.univie.ac.at> To: arrigo [at] bologna [dot] vision.caltech.edu, reliable_computing [at] interval [dot] louisiana.edu Subject: Re: bounds on singular values of A Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk >>I am looking for an interval algorithm able to find tight bounds on the singular values of a matrix.<< Deif A., Sensitivity Analysis in Linear Systems, Springer-Verlag, New York, 1986. Also work by Jiri Rohn. Arnold Neumaier From owner-reliable_computing [at] interval [dot] usl.edu Thu May 10 02:23:06 2001 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) id CAA01591 for reliable_computing-outgoing; Thu, 10 May 2001 02:23:06 -0500 (CDT) Received: from bologna.vision.caltech.edu (IDENT:root [at] bologna [dot] vision.caltech.edu [131.215.134.19]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) with ESMTP id CAA01586 for ; Thu, 10 May 2001 02:23:03 -0500 (CDT) Received: from modena.vision.caltech.edu (modena [131.215.134.17]) by bologna.vision.caltech.edu (8.9.3/8.8.7) with ESMTP id AAA12395; Thu, 10 May 2001 00:22:57 -0700 Received: (from arrigo@localhost) by modena.vision.caltech.edu (8.9.3+Sun/8.9.3) id AAA04384; Thu, 10 May 2001 00:25:02 -0700 (PDT) X-Authentication-Warning: modena.vision.caltech.edu: arrigo set sender to arrigo [at] vision [dot] caltech.edu using -f To: reliable_computing [at] interval [dot] louisiana.edu CC: neum [at] cma [dot] univie.ac.at Subject: Re: bounds on singular values of A References: <15097.62913.165739.322871 [at] gargle [dot] gargle.HOWL> From: Arrigo Benedetti Date: 10 May 2001 00:25:01 -0700 In-Reply-To: Arrigo Benedetti's message of "Wed, 9 May 2001 18:58:25 -0700" Message-ID: Lines: 17 User-Agent: Gnus/5.0807 (Gnus v5.8.7) Emacs/20.4 MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Arrigo Benedetti writes: > Dear interval researchers, > > I am looking for an interval algorithm able to find tight bounds on > the singular values of a matrix. Even though the matrices that I am > working with are 3x3 with rank 2, the closed form expressions for the > two nonzero singular values are horrendous. > > Any pointers? > Let me add a clarification: I am interested in the case of interval matrices. -Arrigo From owner-reliable_computing [at] interval [dot] usl.edu Thu May 10 03:22:59 2001 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) id DAA01922 for reliable_computing-outgoing; Thu, 10 May 2001 03:22:59 -0500 (CDT) Received: from rztsun.rz.tu-harburg.de (rztsun.rz.tu-harburg.de [134.28.200.14]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) with ESMTP id DAA01917 for ; Thu, 10 May 2001 03:22:55 -0500 (CDT) Received: from auriga (auriga.ti3.tu-harburg.de [134.28.20.118]) by rztsun.rz.tu-harburg.de (8.9.0/8.8.8) with SMTP id KAA08967; Thu, 10 May 2001 10:22:49 +0200 (MET DST) Message-ID: <104a01c0d929$13e00970$76141c86 [at] ti3 [dot] tuharburg.de> From: "Siegfried M. Rump" To: "Arrigo Benedetti" Cc: "reliable_computing" References: <15097.62913.165739.322871 [at] gargle [dot] gargle.HOWL> Subject: Re: bounds on singular values of A Date: Thu, 10 May 2001 10:13:21 +0200 Organization: TU Hamburg-Harburg MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 5.50.4133.2400 X-MimeOLE: Produced By Microsoft MimeOLE V5.50.4133.2400 Content-Transfer-Encoding: 8bit X-MIME-Autoconverted: from quoted-printable to 8bit by interval.usl.edu id DAA01918 Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Try Oishi's paper in the latest special issue on 'self-validating methods' in LAA. Best S.M. Rump ----- Original Message ----- From: "Arrigo Benedetti" To: Cc: Sent: Thursday, May 10, 2001 9:25 AM Subject: Re: bounds on singular values of A > Arrigo Benedetti writes: > > > Dear interval researchers, > > > > I am looking for an interval algorithm able to find tight bounds on > > the singular values of a matrix. Even though the matrices that I am > > working with are 3x3 with rank 2, the closed form expressions for the > > two nonzero singular values are horrendous. > > > > Any pointers? > > > > Let me add a clarification: I am interested in the case of interval > matrices. > > -Arrigo > From owner-reliable_computing [at] interval [dot] usl.edu Thu May 10 06:39:24 2001 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) id GAA00353 for reliable_computing-outgoing; Thu, 10 May 2001 06:39:23 -0500 (CDT) Received: from sunshine.math.utah.edu (IDENT:BAf1jjFG3xltYwGVsENrrxuILF3mh3wk [at] sunshine [dot] math.utah.edu [128.110.198.2]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) with ESMTP id GAA00348 for ; Thu, 10 May 2001 06:39:18 -0500 (CDT) Received: from suncore.math.utah.edu (IDENT:LTArwvG93p6nL0qbPAK9C5DaXJTNH/Kg [at] suncore0 [dot] math.utah.edu [128.110.198.5]) by sunshine.math.utah.edu (8.9.3/8.9.3) with ESMTP id FAA02195; Thu, 10 May 2001 05:39:15 -0600 (MDT) Received: (from beebe@localhost) by suncore.math.utah.edu (8.9.3/8.9.3) id FAA29361; Thu, 10 May 2001 05:39:14 -0600 (MDT) Date: Thu, 10 May 2001 05:39:14 -0600 (MDT) From: "Nelson H. F. Beebe" To: "reliable_computing" , "Arrigo Benedetti" Cc: beebe [at] math [dot] utah.edu X-US-Mail: "Center for Scientific Computing, Department of Mathematics, 322 INSCC, University of Utah, 155 S 1400 E RM 233, Salt Lake City, UT 84112-0090, USA" X-Telephone: +1 801 581 5254 X-FAX: +1 801 585 1640, +1 801 581 4148 X-URL: http://www.math.utah.edu/~beebe Subject: Re: bounds on singular values of A Message-ID: Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk S.M. Rump writes on Thu, 10 May 2001 09:43:42 +0100: >> Try Oishi's paper in the latest special issue >> on 'self-validating methods' in LAA. This may be the paper referred to: @Article{Oishi:2001:FEM, author = "Shin'ichi Oishi", title = "Fast enclosure of matrix eigenvalues and singular values via rounding mode controlled computation", journal = j-LINEAR-ALGEBRA-APPL, volume = "324", number = "1--3", pages = "133--146", day = "15", month = feb, year = "2001", CODEN = "LAAPAW", ISSN = "0024-3795", bibdate = "Mon Mar 19 19:03:24 MST 2001", bibsource = "http://www.elsevier.com/locate/laa", URL = "http://www.elsevier.nl/gej-ng/10/30/19/144/24/32/abstract.html; http://www.elsevier.nl/gej-ng/10/30/19/144/24/32/article.pdf", acknowledgement = ack-nhfb, } ------------------------------------------------------------------------------- - Nelson H. F. Beebe Tel: +1 801 581 5254 - - Center for Scientific Computing FAX: +1 801 585 1640, +1 801 581 4148 - - University of Utah Internet e-mail: beebe [at] math [dot] utah.edu - - Department of Mathematics, 322 INSCC beebe [at] acm [dot] org beebe [at] computer [dot] org - - 155 S 1400 E RM 233 beebe [at] ieee [dot] org - - Salt Lake City, UT 84112-0090, USA URL: http://www.math.utah.edu/~beebe - ------------------------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] usl.edu Thu May 10 09:49:58 2001 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) id JAA00869 for reliable_computing-outgoing; Thu, 10 May 2001 09:49:58 -0500 (CDT) Received: from maebashi-it.ac.jp (zhong01.maebashi-it.ac.jp [202.236.152.193]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) with ESMTP id JAA00864 for ; Thu, 10 May 2001 09:49:53 -0500 (CDT) Received: (from zhong@localhost) by maebashi-it.ac.jp (8.9.1/8.9.1) id AAA16477 for reliable_computing [at] interval [dot] usl.edu; Fri, 11 May 2001 00:03:37 +0900 (JST) (envelope-from zhong) Date: Fri, 11 May 2001 00:03:37 +0900 (JST) From: Ning Zhong Message-Id: <200105101503.AAA16477@maebashi-it.ac.jp> To: reliable_computing [at] interval [dot] usl.edu Subject: IEEE Data Mining 2001: Call for Papers Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk ---------------------------------------------------------------------- ICDM '01: The 2001 IEEE International Conference on Data Mining Sponsored by the IEEE Computer Society ---------------------------------------------------------------------- Doubletree Hotel, San Jose, California, USA November 29 - December 2, 2001 Home Page: http://kais.mines.edu/~xwu/icdm/icdm-01.html INVITED SPEAKERS: Jerome H. Friedman, Stanford University, USA Jim Gray (The 1999 Turing Award Winner), Microsoft Research, USA Pat Langley, Daimler-Benz Research & Technology Center, USA Benjamin W. Wah (IEEE Computer Society President), UIUC, USA CORPORATE SPONSORS: Blue Martini Software, San Mateo, California; Insightful Corporation, Seattle, Washington; NARAX Inc., Golden, Colorado; Springer-Verlag, New York, New York; StatSoft Inc., Tulsa, Oklahoma Call for Papers *************** The 2001 IEEE International Conference on Data Mining (ICDM '01) provides a forum for the sharing of original research results and practical development experiences among researchers and application developers from different data mining related areas such as machine learning, automated scientific discovery, statistics, pattern recognition, knowledge acquisition, soft computing, databases and data warehousing, data visualization, and knowledge-based systems. The conference seeks solutions to challenging problems facing the development of data mining systems, and shapes future directions of research by promoting high quality, novel and daring research findings. As an important part of the conference, the workshops program will focus on new research challenges and initiatives. Topics of Interest ================== Topics related to the design, analysis and implementation of data mining theory, systems and applications are of interest. These include, but are not limited to the following areas: - Foundations and principles of data mining - Data mining algorithms and methods in traditional areas (such as classification, clustering, probabilistic modeling, and association analysis), and in new areas - Data and knowledge representation for data mining - Modeling of structured, textual, temporal, spatial, multimedia and Web data to support data mining - Complexity, efficiency, and scalability issues in data mining - Data pre-processing, data reduction, feature selection and feature transformation - Statistics and probability in large-scale data mining - Soft computing (including neural networks, fuzzy logic, evolutionary computation, and rough sets) and uncertainty management for data mining - Integration of data warehousing, OLAP and data mining - Man-machine interaction in data mining and visual data mining - Artificial intelligence contributions to data mining - High performance and distributed data mining - Machine learning, pattern recognition and automated scientific discovery - Quality assessment and interestingness metrics of data mining results - Process centric data mining and models of data mining process - Security and social impact of data mining - Emerging data mining applications, such as electronic commerce, Web mining and intelligent learning database systems Conference Publications and ICDM Best Paper Awards ================================================== High quality papers in all data mining areas are solicited. Papers exploring new directions will receive a careful and supportive review. All submitted papers should be limited to a maximum of 6,000 words (approximately 20 A4 pages), and will be reviewed on the basis of technical quality, relevance to data mining, originality, significance, and clarity. Accepted papers will be published in the conference proceedings by the IEEE Computer Society Press. A selected number of ICDM '01 accepted papers will be expanded and revised for possible inclusion in the Knowledge and Information Systems journal (http://kais.mines.edu/~kais/) by Springer-Verlag. ICDM Best Paper Awards will be conferred on the authors of the best papers at the conference. Important Dates =============== June 15, 2001 Paper submissions. July 31, 2001 Acceptance notices. August 31, 2001 Final camera-readies. Nov 29 - Dec 2, 2001 Conference. All paper submissions will be handled electronically. Detailed instructions are provided on the conference home page at http://kais.mines.edu/~xwu/icdm/icdm-01.html. Conference Chair: ================= Xindong Wu, Colorado School of Mines, USA (xindong [at] computer [dot] org) Program Committee Chairs: ========================= Nick Cercone, University of Waterloo, Canada (ncercone [at] math [dot] uwaterloo.ca) T.Y. Lin, San Jose State University, USA (tylin [at] mathcs [dot] sjsu.edu) ICDM '01 Workshops Chair: ========================= Johannes Gehrke, Cornell University, USA (johannes [at] cs [dot] cornell.edu) ICDM '01 Tutorials Chair: ========================= Chris Clifton, MITRE, USA (clifton [at] mitre [dot] org) ICDM '01 Panels Chair: ====================== Ramamohanarao Kotagiri, University of Melbourne, Australia (rao [at] cs [dot] mu.oz.au) ICDM '01 Publicity Chair: ========================= Ning Zhong, Maebashi Institute of Technology, Japan (zhong@maebashi-it.ac.jp) ICDM '01 Local Arrangements Chair: ================================== Xiaohua (Tony) Hu, Blue Martini Software Inc., USA (tonyhu [at] bluemartini [dot] com) ICDM Steering Committee ======================= Max Bramer, University of Portsmouth, UK Nick Cercone, University of Waterloo, Canada Ramamohanarao Kotagiri, University of Melbourne, Australia Katharina Morik, University of Dortmund, Germany Xindong Wu, Chair (Colorado School of Mines, USA) Philip S. Yu, IBM T.J. Watson Research Center, USA Ning Zhong, Maebashi Institute of Technology, Japan Jan M. Zytkow, University of North Carolina, Charlotte, USA Further Information =================== Dr. Xindong Wu Dept. of Mathematical and Computer Sciences, Colorado School of Mines, 1500 Illinois Street, Golden, Colorado 80401, USA. Telephone: +1-303-273-3874 Facsimile: +1-303-273-3875 E-mail: xindong [at] computer [dot] org From owner-reliable_computing [at] interval [dot] usl.edu Fri May 11 07:16:30 2001 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) id HAA00395 for reliable_computing-outgoing; Fri, 11 May 2001 07:16:30 -0500 (CDT) Received: from alfik.ms.mff.cuni.cz (alfik.ms.mff.cuni.cz [195.113.19.71]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) with ESMTP id HAA00389 for ; Fri, 11 May 2001 07:16:17 -0500 (CDT) Received: from barbora.ms.mff.cuni.cz [195.113.19.218] by alfik.ms.mff.cuni.cz (8.9.3/2.1/20001023.1441) with ESMTP id OAA25185; Fri, 11 May 2001 14:13:22 +0200 (MET DST) Received: from BARBORA/SpoolDir by Barbora.ms.mff.cuni.cz (Mercury 1.40); 11 May 101 14:20:16 +0100 Received: from SpoolDir by BARBORA (Mercury 1.40); 11 May 101 14:20:13 +0100 Received: from j (195.113.18.85) by Barbora.ms.mff.cuni.cz (Mercury 1.40); 11 May 101 14:20:08 +0100 Reply-To: From: "Jiri Rohn" To: Subject: VIRUS WARNING Date: Fri, 11 May 2001 14:12:04 +0200 Message-ID: <001901c0da13$97f00fe0$551271c3 [at] rohn [dot] ms.mff.cuni.cz> MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-2" Content-Transfer-Encoding: 7bit X-Priority: 3 (Normal) X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook CWS, Build 9.0.2416 (9.0.2910.0) X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2314.1300 Importance: Normal Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear colleagues, I have been just informed that a virus called HOMEPAGE.HTML.VBS is being sent out of my address as an attachment. PLEASE DO NOT OPEN THIS ATTACHMENT. A quick preliminary consultation with our experts indicated that it is probably not destructive (containing only links to several porno pages), but one never knows.... I APOLOGIZE Jiri Rohn From owner-reliable_computing [at] interval [dot] usl.edu Tue May 15 05:30:24 2001 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) id FAA01721 for reliable_computing-outgoing; Tue, 15 May 2001 05:30:24 -0500 (CDT) Received: from minster.cs.york.ac.uk (minster.cs.york.ac.uk [144.32.40.2]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) with ESMTP id FAA01716 for ; Tue, 15 May 2001 05:30:19 -0500 (CDT) Received: from wood by minster.cs.york.ac.uk with local-rmail (Exim 3.16 #1) id 14zc5H-0006jf-00 for reliable_computing [at] interval [dot] usl.edu; Tue, 15 May 2001 11:29:43 +0100 To: reliable_computing [at] interval [dot] usl.edu Subject: CFP - Coordination 2002 Date: Tue, 15 May 2001 11:29:41 +0100 From: Alan Wood Message-Id: Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk ============================================================================= C O O R D I N A T I O N 2 0 0 2 York 8-11 April 2002 ============================================================================= Fifth International Conference on Coordination Models and Languages ============================= C a l l f o r P a p e r s ============================= We invite your paper submissions to the fifth in the series of Coordination conferences, which will be held in York (UK) on the 8-11 April 2002. Full details are available at: http://www-users.cs.york.ac.uk/~wood/Coord02/Coordination2002.html or by email from: wood [at] cs [dot] york.ac.uk Important dates: ---------------- Full Paper Submissions: 9 Nov. 2001 Notification of acceptances: 14 Jan. 2002 Camera-ready version: 1 Feb. 2002 Programme Topics ---------------- Topics of interest include the following (see the Conference web site for more details): o Applications of Coordination o Theoretical models and foundations for Coordination o Specification, refinement, and analysis of software architectures o Coordination, architectural, and interface definition languages o Architecture/coordination based specification and analysis o Agent-oriented languages o Dynamic software architectures o Scalability o Fault tolerance o Tools and environments for the development of coordinated applications o Security and Quality of Service issues in coordination o Programming the web o Industrial relevance of Coordination and software architectures Contacts -------- Programme Chairs: Farhad Arbab CWI, Amsterdam, The Netherlands farhad [at] cwi [dot] nl http://www.cwi.nl/~farhad Carolyn Talcott Stanford University, California, USA clt [at] cs [dot] stanford.edu http://www-formal.stanford.edu/clt/ Local Organiser: Alan Wood University of York, UK wood [at] cs [dot] york.ac.uk Apologies --------- Sorry if you receive multiple copies of this CFP. From owner-reliable_computing [at] interval [dot] usl.edu Tue May 15 13:56:29 2001 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) id NAA00806 for reliable_computing-outgoing; Tue, 15 May 2001 13:56:28 -0500 (CDT) Received: from bologna.vision.caltech.edu (IDENT:root [at] bologna [dot] vision.caltech.edu [131.215.134.19]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) with ESMTP id NAA00801 for ; Tue, 15 May 2001 13:56:24 -0500 (CDT) Received: from modena.vision.caltech.edu (modena [131.215.134.17]) by bologna.vision.caltech.edu (8.9.3/8.8.7) with ESMTP id LAA21576 for ; Tue, 15 May 2001 11:56:22 -0700 Received: from localhost (arrigo@localhost) by modena.vision.caltech.edu (8.9.3+Sun/8.9.3) with ESMTP id LAA18780 for ; Tue, 15 May 2001 11:58:29 -0700 (PDT) X-Authentication-Warning: modena.vision.caltech.edu: arrigo owned process doing -bs Date: Tue, 15 May 2001 11:58:28 -0700 (PDT) From: Arrigo Benedetti X-Sender: arrigo@modena To: reliable_computing [at] interval [dot] louisiana.edu Subject: copy of paper by J. Rohn Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear all, I have a very hard time locating a copy of this paper by J. Rohn: J. Rohn, "Eigenvalues of a symmetric interval matrix", Freiburger Interval- Berichte (FIB), 87 (1), 67-72 (1987). If anyone has a copy available I would be very grateful to him if he could fax me a copy at the number below. Best, -Arrigo -- Dr. Arrigo Benedetti e-mail: arrigo [at] vision [dot] caltech.edu Caltech, MS 136-93 phone: (626) 395-3129 Pasadena, CA 91125 fax: (626) 795-8649 From owner-reliable_computing [at] interval [dot] usl.edu Tue May 15 18:47:25 2001 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) id SAA01317 for reliable_computing-outgoing; Tue, 15 May 2001 18:47:25 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) with ESMTP id SAA01312 for ; Tue, 15 May 2001 18:47:20 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id f4FNlGg16916; Tue, 15 May 2001 17:47:16 -0600 (MDT) Message-Id: <200105152347.f4FNlGg16916 [at] cs [dot] utep.edu> Date: Tue, 15 May 2001 17:47:15 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: Re: copy of paper by J. Rohn To: reliable_computing [at] interval [dot] louisiana.edu, arrigo [at] bologna [dot] vision.caltech.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: iZ5wL6A5mjXzBTIU2t9r8w== 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 Arrigo, I have looked into No. 1 1987 issue of FIB, Rohn's paper is not on these pages. Please check your reference. Vladik > X-Authentication-Warning: modena.vision.caltech.edu: arrigo owned process doing -bs > Date: Tue, 15 May 2001 11:58:28 -0700 (PDT) > From: Arrigo Benedetti > X-Sender: arrigo@modena > To: reliable_computing [at] interval [dot] louisiana.edu > Subject: copy of paper by J. Rohn > MIME-Version: 1.0 > > Dear all, > > I have a very hard time locating a copy of this paper by J. Rohn: > > J. Rohn, "Eigenvalues of a symmetric interval matrix", Freiburger > Interval- Berichte (FIB), 87 (1), 67-72 (1987). > > If anyone has a copy available I would be very grateful to him if > he could fax me a copy at the number below. > > Best, > -Arrigo > -- > Dr. Arrigo Benedetti e-mail: arrigo [at] vision [dot] caltech.edu > Caltech, MS 136-93 phone: (626) 395-3129 > Pasadena, CA 91125 fax: (626) 795-8649 From owner-reliable_computing [at] interval [dot] usl.edu Tue May 15 21:00:48 2001 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) id VAA01760 for reliable_computing-outgoing; Tue, 15 May 2001 21:00:47 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) with ESMTP id VAA01755 for ; Tue, 15 May 2001 21:00:44 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id f4G20Gx17450; Tue, 15 May 2001 20:00:16 -0600 (MDT) Message-Id: <200105160200.f4G20Gx17450 [at] cs [dot] utep.edu> Date: Tue, 15 May 2001 20:00:15 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: Re: computation of form factors To: rokne [at] cpsc [dot] ucalgary.ca Cc: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: BWfHvXGafg91gUvQ6s2kUw== 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 Thanks a lot. Vladik > Date: Tue, 15 May 2001 19:13:16 -0600 > From: Jon Rokne > To: vladik [at] cs [dot] utep.edu > Subject: computation of form factors > Mime-Version: 1.0 > > > Vladik, > > The paper is in issue 10. > I faxed a copy to Benedetti > > Jon > > > > Dear Arrigo, > > I have looked into No. 1 1987 issue of FIB, Rohn's paper is not on these pages. > Please check your reference. > > Vladik > From owner-reliable_computing [at] interval [dot] usl.edu Thu May 17 19:23:54 2001 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) id TAA00543 for reliable_computing-outgoing; Thu, 17 May 2001 19:23:54 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) with ESMTP id TAA00538 for ; Thu, 17 May 2001 19:23:50 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id f4I0NlL09888 for ; Thu, 17 May 2001 18:23:47 -0600 (MDT) Message-Id: <200105180023.f4I0NlL09888 [at] cs [dot] utep.edu> Date: Thu, 17 May 2001 18:23:46 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: examples where non-interval computations are misleading To: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: XBHu9iRcFPe/mHWu08Yj1Q== 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 A nice collection of such examples was recently published by Christopher Essex, Matt Davison, and Christian Schulzky from the U. of Western Ontario. Their paper "Numerical Monsters" is published in ACM SIGSAM Bulletin, 2000, Vol. 34, No. 4, pp. 16-32. From owner-reliable_computing [at] interval [dot] usl.edu Fri May 18 13:15:55 2001 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) id NAA00649 for reliable_computing-outgoing; Fri, 18 May 2001 13:15:54 -0500 (CDT) Received: from gauss.Mines.EDU (gauss.Mines.EDU [138.67.22.33]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) with ESMTP id NAA00644 for ; Fri, 18 May 2001 13:15:50 -0500 (CDT) Received: (from xwu@localhost) by gauss.Mines.EDU (8.9.3/8.9.3) id MAA26921 for reliable_computing [at] interval [dot] usl.edu; Fri, 18 May 2001 12:14:24 -0600 (MDT) From: Xindong Wu Message-Id: <200105181814.MAA26921 [at] gauss [dot] Mines.EDU> Subject: Knowledge and Information Systems: Vol 3 No 3, August 2001 To: reliable_computing [at] interval [dot] usl.edu Date: Fri, 18 May 2001 12:14:24 -0600 (MDT) X-Mailer: ELM [version 2.5 PL2] MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Knowledge and Information Systems: An International Journal ----------------------------------------------------------- ISSN: 0219-1377 (printed version) ISSN: 0219-3116 (electronic version) by Springer-Verlag Home Page: http://kais.mines.edu/~kais/home.html ================================================ Volume 3, Number 3, August 2001 ------------------------------- Regular Papers - Dimensionality Reduction for Fast Similarity Search in Large Time Series Databases by Eamonn Keogh, Kaushik Chakrabarti, Michael Pazzani, and Sharad Mehrotra - Temporal Defeasible Reasoning by Juan C. Augusto and Guillermo R. Simari - Efficient Graph-Based Algorithms for Discovering and Maintaining Association Rules in Large Databases by Guanling Lee, K.L. Lee and Arbee L.P. Chen - Generalized Affinity-Based Association Rule Mining for Multimedia Database Queries by Mei-Ling Shyu, Shu-Ching Chen, and R.L. Kashyap - Discovering Text Databases with Neural Nets by Yong S. Choi Short Papers - SAFE: An Efficient Feature Extraction Technique by U. Maulik, S. Bandyopadhyay and J.C. Trinder From owner-reliable_computing [at] interval [dot] usl.edu Fri May 18 18:09:15 2001 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) id SAA01191 for reliable_computing-outgoing; Fri, 18 May 2001 18:09:14 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) with ESMTP id SAA01186 for ; Fri, 18 May 2001 18:09:10 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id f4IN97m17942; Fri, 18 May 2001 17:09:07 -0600 (MDT) Message-Id: <200105182309.f4IN97m17942 [at] cs [dot] utep.edu> Date: Fri, 18 May 2001 17:09:07 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: interval website: new volunteer To: reliable_computing [at] interval [dot] louisiana.edu Cc: berleant [at] iastate [dot] edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: rT9i1X0UuDoaUxhC/sVRXw== 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, A new enthusiastic volunteer has joined me in maintianing the interval website http://www.cs.uetp.edu/interval-comp: Dan Berleant. His email is berleant [at] istate [dot] edu. Now that we have more volunteers we will hopefully be more pro-active and not only reactive in maintaining the website. If your own webpage (or if someone else's interval-related webpage) is not on the Personalia part, if some books or software is missing, if any other minor or major change is needed, please let me and Dan know ASAP. We will try our best to bring the site up to date. Dan and I will also looked into the pages and see what needed updating. Eventually, when the cleaning will stop being such an urgent issue, Dan will branch into designing a separate webpage on his own area of interval research, an area which goes beyond what is normally known as interval computations. Namely, interval methods work well when we know the intervals for the input data and have no additional information about the probabilities. However, in many real-life situations, we have a partial information about the probabilities. Most of these cases are not covered by traditional statsitical methods, and only the cases when we know intervals for probabilities, are normally covered by imprecise probability researchers and their webpages. We need to start expanding in this important direction. Dan has already started making some pages on that. If you have some information related to this area, please send your links and info to Dan. Vladik P.S. I want to use this opportunity to thank those who help me in maintaining the website by their advise and references, and aplogize for often being late with corrections. I am especially thankful to Robert Joan-Arinyo for maintaining a European mirror site. There has been a glitch in the mirroring, but now it seems to be working OK. The mirror site is updated every Saturday. P.P.S. Our server may be up and down these days, so please be patient. From owner-reliable_computing [at] interval [dot] usl.edu Mon May 21 08:44:30 2001 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) id IAA05195 for reliable_computing-outgoing; Mon, 21 May 2001 08:44:30 -0500 (CDT) Received: from mailhub.iastate.edu (mailhub.iastate.edu [129.186.1.102]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.1) with ESMTP id IAA05190 for ; Mon, 21 May 2001 08:44:26 -0500 (CDT) Received: from mx.eng.iastate.edu (mx.eng.iastate.edu [129.186.23.116]) by mailhub.iastate.edu (8.9.3/8.9.3) with ESMTP id IAA14212; Mon, 21 May 2001 08:44:24 -0500 Received: by mx.eng.iastate.edu with Internet Mail Service (5.5.2653.19) id ; Mon, 21 May 2001 08:44:23 -0500 Message-ID: <873F9637C545D311A5C500902771C859015DC4D5 [at] mx [dot] eng.iastate.edu> From: "Berleant, D." To: "'Vladik Kreinovich'" , reliable_computing [at] interval [dot] louisiana.edu Cc: "Berleant, D." Subject: RE: interval website: new volunteer Date: Mon, 21 May 2001 08:44:19 -0500 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 Dear Members of the Interval Community, If you have suggestions for changes or additions to the interval community Web site, please advise me and/or Vladik. I'm at: berleant [at] iastate [dot] edu ("iastate" for Iowa State). Vladik is at: vladik [at] cs [dot] utep.edu. Best Regards, D. Berleant -----Original Message----- From: Vladik Kreinovich [mailto:vladik [at] cs [dot] utep.edu] Sent: Friday, May 18, 2001 6:09 PM To: reliable_computing [at] interval [dot] louisiana.edu Cc: berleant [at] iastate [dot] edu Subject: interval website: new volunteer Dear Friends, A new enthusiastic volunteer has joined me in maintianing the interval website http://www.cs.uetp.edu/interval-comp: Dan Berleant. His email is berleant [at] istate [dot] edu. Now that we have more volunteers we will hopefully be more pro-active and not only reactive in maintaining the website. If your own webpage (or if someone else's interval-related webpage) is not on the Personalia part, if some books or software is missing, if any other minor or major change is needed, please let me and Dan know ASAP. We will try our best to bring the site up to date. Dan and I will also looked into the pages and see what needed updating. Eventually, when the cleaning will stop being such an urgent issue, Dan will branch into designing a separate webpage on his own area of interval research, an area which goes beyond what is normally known as interval computations. Namely, interval methods work well when we know the intervals for the input data and have no additional information about the probabilities. However, in many real-life situations, we have a partial information about the probabilities. Most of these cases are not covered by traditional statsitical methods, and only the cases when we know intervals for probabilities, are normally covered by imprecise probability researchers and their webpages. We need to start expanding in this important direction. Dan has already started making some pages on that. If you have some information related to this area, please send your links and info to Dan. Vladik P.S. I want to use this opportunity to thank those who help me in maintaining the website by their advise and references, and aplogize for often being late with corrections. I am especially thankful to Robert Joan-Arinyo for maintaining a European mirror site. There has been a glitch in the mirroring, but now it seems to be working OK. The mirror site is updated every Saturday. P.P.S. Our server may be up and down these days, so please be patient. From owner-reliable_computing [at] interval [dot] louisiana.edu Thu May 24 18:48:47 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f4ONmlQ00565 for reliable_computing-outgoing; Thu, 24 May 2001 18:48:47 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f4ONmgt00560 for ; Thu, 24 May 2001 18:48:43 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id f4ONmcl06072; Thu, 24 May 2001 17:48:38 -0600 (MDT) Message-Id: <200105242348.f4ONmcl06072 [at] cs [dot] utep.edu> Date: Thu, 24 May 2001 17:48:38 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: please mark the dates To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: 3Hs91GFK8p2rtH6pWE122Q== 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 *** please reserve the dates; detailed information will follow *** Validated Computing 2002 SIAM Workshop Toronto, Canada, May 23-25, 2002 (including a special session honoring Ray Moore) Immediately following the Seventh SIAM Conference on Optimization (May 20-23, 2002) To be followed by a Fields Institute working group on optimization organized by Ken Jackson Description and rationale (preliminary version) ------------------------ Reliable computing is essential. There is no feasible alternative. Modern societies rely more and more on computer systems. Usually, our systems appear to work successfully, but there are sometimes serious, and often minor, errors. Ever increasing reliance on computer systems brings ever increasing need for reliability. Validated computing is one essential technology to achieve increased software reliability. Validated computing uses controlled rounding of computer arithmetic to guarantee that hypotheses of suitable mathematical theorems are (or are not) satisfied. Mathematical rigor in the computer arithmetic, in algorithm design, and in program execution allow us to guarantee that the stated problem has (or does not have) a solution in an enclosing interval we compute. If the enclosure is narrow, we are certain that we know the answer reliably and accurately. If the enclosing interval is wide, we have a clear warning that our uncertainty is large, and a closer study is demanded. Intervals capture uncertainly in modeling and problem formulation, in model parameter estimation, in algorithm truncation, in operation round off, and in model interpretation. The techniques of validated computing have proven their merits in many scientific and engineering applications including medical diagnosis and treatment, financial simulation, mechanical design, oil reservoir simulation, aeronautics, high energy particle accelerators, environmental engineering, chemical process simulation and control, computer graphics for motion picture special effects, astrophysics, and many more. They help answer questions from, "How much irrigation water does a desert golf course return effectively unused to its bordering stream?" to "Will a near earth asteroid hit the earth, possibly ending life as we know it?". The techniques of validated computing rest on solid and interesting theoretical studies in mathematics and computer science. Contributions from fields including real, complex and functional analysis, semigroups, probability, statistics, fuzzy logic, automatic differentiation, computer hardware, operating systems, compiler construction, parallel processing, and software engineering are all essential. From owner-reliable_computing [at] interval [dot] louisiana.edu Thu May 24 20:16:06 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f4P1G6Z00747 for reliable_computing-outgoing; Thu, 24 May 2001 20:16:06 -0500 (CDT) Received: from imf07bis.bellsouth.net (mail207.mail.bellsouth.net [205.152.58.147]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f4P1G2t00742 for ; Thu, 24 May 2001 20:16:02 -0500 (CDT) Received: from u8174 ([65.81.240.123]) by imf07bis.bellsouth.net (InterMail vM.5.01.01.01 201-252-104) with SMTP id <20010525011645.CDCZ15738.imf07bis.bellsouth.net@u8174> for ; Thu, 24 May 2001 21:16:45 -0400 Message-Id: <2.2.32.20010525011158.0075a174 [at] 130 [dot] 70.132.231> X-Sender: rbk5287 [at] 130 [dot] 70.132.231 X-Mailer: Windows Eudora Pro Version 2.2 (32) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Thu, 24 May 2001 20:11:58 -0500 To: reliable_computing [at] interval [dot] louisiana.edu From: "R. Baker Kearfott" Subject: System upgrade on "interval.louisiana.edu" Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Colleagues, Sorry for so many "administrative" messages. I think we've finally gotten things fairly straight, though. interval.louisiana.edu underwent an operating system upgrade yesterday and today. Things should be working now. Please report any problems you have with the mailing lists, with the FTP server, or with the web server. Best regards, Baker P.S. Don't forget that "interval.usl.edu" will no longer work, starting July 1. Please change all such references to "interval.louisiana.edu" in your mailing lists and URL links. --------------------------------------------------------------- R. Baker Kearfott, rbk [at] louisiana [dot] edu (337) 482-5346 (fax) (337) 482-5270 (work) (337) 981-9744 (home) URL: http://interval.louisiana.edu/kearfott.html Department of Mathematics, University of Louisiana at Lafayette Box 4-1010, Lafayette, LA 70504-1010, USA --------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] louisiana.edu Sat May 26 10:26:53 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f4QFQq900429 for reliable_computing-outgoing; Sat, 26 May 2001 10:26:52 -0500 (CDT) Received: from mail.maktoob.net (IDENT:mirapoint@[195.172.126.101]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f4QFQk200424 for ; Sat, 26 May 2001 10:26:47 -0500 (CDT) Received: from webmail (uk2.maktoob.com [212.100.224.146]) by mail.maktoob.net (Mirapoint) with SMTP id AFA85110; Sat, 26 May 2001 15:26:35 GMT Date: Sat, 26 May 2001 15:26:35 GMT Message-Id: <200105261526.AFA85110 [at] mail [dot] maktoob.net> From: mahahass [at] maktoob [dot] com (Maha Hassanein) To: arrigo [at] bologna [dot] vision.caltech.edu Cc: reliable_computing [at] interval [dot] louisiana.edu Subject: Re: bounds on singular values of A Comment: Maktoob By BOC X-Mailer: Maktoob 1.0 [Mozilla/4.0 (compatible; MSIE 5.0; Windows 98; DigExt)] MIME-Version: 1.0 Content-Type: text/plain; charset=windows-1256 Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk ----- Original Message ----- >I am looking for an interval algorithm able to find tight bounds on >the singular values of a matrix. Even though the matrices that I am >working with are 3x3 with rank 2, the closed form expressions for the >two nonzero singular values are horrendous. > >Any pointers? > >Thanks, >-Arrigo Deif , A Singular values of an interval matrix, Linear Algebra Applications, vol 151, p. 125-133, 1991. Maha Amin _________________________________________________________ Send Your favorite Arabic Card from Maktoob Cards, http://cards.maktoob.com From owner-reliable_computing [at] interval [dot] louisiana.edu Tue May 29 09:23:02 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f4TEN2L02029 for reliable_computing-outgoing; Tue, 29 May 2001 09:23:02 -0500 (CDT) Received: from ns.unisa.it (ns.unisa.it [193.205.160.3]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f4TEMuZ02024 for ; Tue, 29 May 2001 09:22:56 -0500 (CDT) Received: from spanish.ieee.org (pc2.diiie.unisa.it [193.205.164.124]) by ns.unisa.it (8.10.0/8.10.0) with ESMTP id f4TEMjg21156 for ; Tue, 29 May 2001 16:22:49 +0200 (MET DST) Message-Id: <5.0.0.25.0.20010529161611.009f30b0 [at] mail [dot] unisa.it> X-Sender: gspagnuo [at] mail [dot] unisa.it X-Mailer: QUALCOMM Windows Eudora Version 5.0 Date: Tue, 29 May 2001 16:18:43 +0200 To: reliable_computing [at] interval [dot] louisiana.edu From: "G.Spagnuolo" Subject: interval arithmetic & PDE's Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii"; format=flowed Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear researchers, in literature I have not found applications of IA to partial differential equations. Have you some reference? Thanks in advance. Best Regards. G.Spagnuolo -- Dr. Giovanni Spagnuolo, Ph.D. Assistant Professor University of Salerno Dipartimento di Ingegneria dell'Informazione ed Ingegneria Elettrica D.I.I.I.E. Via Ponte Don Melillo 84084 Fisciano - Salerno - Italy phone: +39 089 964258 fax: +39 089 964218 e-mail: spanish [at] ieee [dot] org "You can tell whether a man is clever by his answers. You can tell whether a man is wise by his questions." Naguib Mahfouz From owner-reliable_computing [at] interval [dot] louisiana.edu Wed May 30 09:26:08 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f4UEQ8Q03003 for reliable_computing-outgoing; Wed, 30 May 2001 09:26:08 -0500 (CDT) Received: from kleene.math.wisc.edu (kleene.math.wisc.edu [144.92.166.90]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f4UEPxZ02998 for ; Wed, 30 May 2001 09:26:00 -0500 (CDT) Received: from bing.math.wisc.edu (bing.math.wisc.edu [144.92.166.133]) by kleene.math.wisc.edu (8.11.3/8.11.3) with ESMTP id f4UEMAc04488; Wed, 30 May 2001 09:22:10 -0500 (CDT) Date: Wed, 30 May 2001 09:22:07 -0500 (CDT) From: Hans Schneider To: NETS -- at-net , "Hershkowitz, Danny -- Hershkowitz Daniel" , Danny Hershkowitz , E-LETTER , "na.digest" , ipnet-digest [at] math [dot] msu.edu, wim@bell-labs.com, hjt [at] eos [dot] ncsu.edu, vkm [at] eedsp [dot] gatech.edu, reliable_computing [at] interval [dot] louisiana.edu Subject: LAA contents Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear Net Organizer: Please circulate the attached LAA contents over your net. Thanks hans ------------------------------------------------------------------------------ Hans Schneider hans [at] math [dot] wisc.edu. Department of Mathematics 608-262-1402 (Work) Van Vleck Hall 608-271-7252 (Home) 480 Lincoln Drive 608-263-8891 (Work FAX) University of Wisconsin-Madison 608-271-8477 (Home FAX) Madison WI 53706 USA http://www.math.wisc.edu/~hans (URL) ------------------------------------------------------------------------------ ContentsDirect from Elsevier Science ====================================== Journal: Linear Algebra and its Applications ISSN : 0024-3795 Volume : 331 Issue : 1-3 Date : 01-Jul-2001 Please note: The access restrictions on articles/abstracts vary. Many journals have free access to abstracts, but in general access to full text PDFs is restricted to subscribers. Visit the journal at http://www.elsevier.nl/locate/jnlnr/07738 pp 1-9 An interpolation approach to Hardy-Littlewood inequalities for norms of operators on sequence spaces B. Osikiewicz, A. Tonge http://www.elsevier.nl/PII/S0024379500001841 pp 11-20 On the spectrum and pseudoinverse of a special bordered matrix J. Ding, W.C. Pye http://www.elsevier.nl/PII/S0024379501002610 pp 21-30 Consimilarity of quaternion matrices and complex matrices H. Liping http://www.elsevier.nl/PII/S002437950100266X pp 31-41 The product of two quadratic matrices F. Bunger, F. Knuppel, K. Nielsen http://www.elsevier.nl/PII/S0024379501002774 pp 43-59 Hyperspheres and hyperplanes fitted seamlessly by algebraic constrained total least-squares Y. Nievergelt http://www.elsevier.nl/PII/S0024379501002634 pp 61-74 Numerical ranges of composition operators V. Matache http://www.elsevier.nl/PII/S0024379501002622 pp 75-87 Linear preservers for matrix inequalities and partial orderings A. Guterman http://www.elsevier.nl/PII/S0024379501002804 pp 89-100 An order preserving inequality via Furuta inequality, II C. Yang http://www.elsevier.nl/PII/S0024379501002816 pp 101-112 On G-invariant norms T.-Y. Tam, W.C. Hill http://www.elsevier.nl/PII/S0024379501002701 pp 113-130 Principal majorization ideals and optimization G. Dahl http://www.elsevier.nl/PII/S0024379501002683 pp 131-144 Comparison results for parallel multisplitting methods with applications to AOR methods W. Li, W. Sun http://www.elsevier.nl/PII/S0024379501002762 pp 145-153 Automorphisms of certain forms of higher degree over ordered fields A. Chlebowicz, A. Sladek, M. Wolowiec-Musial http://www.elsevier.nl/PII/S0024379501002725 pp 155-164 A matrix algorithm towards solving the moment problem of Sobolev type F. Marcellan, F. Hugon Szafraniec http://www.elsevier.nl/PII/S0024379501002713 pp 165-179 Polynomial Bezoutian matrix with respect to a general basis Z.H. Yang http://www.elsevier.nl/PII/S0024379501002828 pp 181-192 Extension of an approximate orthogonalization algorithm to arbitrary rectangular matrices C. Popa http://www.elsevier.nl/PII/S0024379501002865 pp 193-202 Totally positive matrices and totally positive hypergraphs G. Kubicki, J. Lehel, M.x. Morayne http://www.elsevier.nl/PII/S002437950100252X pp 203-209 On Pappus' configuration in non-commutative projective geometry G. Donati http://www.elsevier.nl/PII/S0024379501002877 pp 211 Author index http://www.elsevier.nl/PII/S0024379501003597 w From owner-reliable_computing [at] interval [dot] louisiana.edu Wed May 30 12:00:34 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f4UH0Ym03140 for reliable_computing-outgoing; Wed, 30 May 2001 12:00:34 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f4UH0TZ03135 for ; Wed, 30 May 2001 12:00:30 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id f4UH0Ew18160 for ; Wed, 30 May 2001 11:00:14 -0600 (MDT) Message-Id: <200105301700.f4UH0Ew18160 [at] cs [dot] utep.edu> Date: Wed, 30 May 2001 11:00:13 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: tenure-track position in El Paso To: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: 7pgMitu1glnuhnLICi9zgw== 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, Hiring is usually a seasonal thing, but our Department has just negotiated an agreement to have a continuous hiring process, so our positions (see ad below) are open for application at any time. Please notice that we are specifically searching for researchers in interval computations. All the contact info and web address are given in the web. I will be glad to answer any questions. Vladik Computer Science Department at The University of Texas at El Paso ----------------------------------------------------------- Tenure-Track Faculty ----------------------------------------------------------- UTEP's Department of Computer Science invites applications for at least two tenure-track faculty positions at all ranks to begin in Fall, 2001. We value excellence in research and education, our environment of collegiality, faculty collaboration across a wide range of interests, and involvement with students outside the classroom. We favor collaborative methods in both teaching and research. We seek colleagues who share these values, have a strong committment to both education and research, can collaborate with other faculty, can build a strong research program, and enjoy working in a culturally diverse community. The Department is part of UTEP's College of Engineering and offers BS and MS degrees in computer science and, with the Department of Electrical and Computer Engineering, a Ph.D. degree in Computer Engineering. We have an internationally distinguished record of research and our teaching program is a nationally recognized model of excellence. UTEP has an enrollment of 15,000 students and is located close to where the Rocky Mountains meet the Rio Grande. Our campus echoes the beauty of the surrounding high desert. El Paso, a highly livable, bi-cultural community of 700,000 people, is a major meeting point between the United States and Latin America and offers good, affordable housing. We are particularly interested in applications in the areas of theory, interval or soft computing, architecture, software engineering, and human-computer interaction, and will consider outstanding applications in other areas of computer science. Candidates must hold a Ph.D. in Computer Science or a closely related field. Send a curriculum vitae, a list of publications, a statement of teaching and research interests, and at least four professional references to Faculty Recruiting Committee, UTEP, Department of Computer Science, El Paso, TX, 79968-0518. Information about the department is available at http://www.cs.utep.edu. Send e-mail inquiries to recruiting [at] cs [dot] utep.edu. The University of Texas at El Paso does not discriminate on the basis of race, color, national origin, sex, religion, age, sexual orientation, or disability in employment or the provision of services.