MIMEVersion: 1.0
To: issac2001 [at] zib [dot] de
Subject: ISSAC2001: ISSAC 2001  Call for Papers
CALL FOR PAPERS
International Symposium on Symbolic and Algebraic Computation
University of Western Ontario, Canada,
July 2225, 2001
http://www.orcca.on.ca/issac2001/
ISSAC is the yearly premier international symposium in Symbolic and
Algebraic Computation that provides an opportunity to learn of new
developments and to present original research results in all areas
of symbolic mathematical computation. ISSAC'2001 will be locally
hosted by the University of Western Ontario at London and the Ontario
Research Centre for Computer Algebra (ORCCA).
Important dates
Before January 15, 2001 Submission to the Program
Committee Chair deadline
March 12, 2001 Notification of acceptance
April 2, 2001 Camera ready copy received
Original research results and insightful analyses of current concerns
are solicited for submission. Papers will be reviewed by a program
committee and referees. Survey articles may be suitable for submission
if identified as such, they will be considered in a separate category
from the research papers. Proceedings will be distributed at the
symposium. Electronic submission is encouraged.
Program Committee Chair: Gilles.Villard@enslyon.fr
Conference Topics:
Topics of the meeting include, but are not limited to,
Algorithmic mathematics. Algebraic, symbolic and symbolicnumeric
algorithms. Simplification, function manipulation, equations,
summation, integration, ODE/PDE, linear algebra, number theory, group
and geometric computing.
Computer Science. Theoretical and practical problems in symbolic
computation. Systems, problem solving environments, user interfaces,
softwares, libraries, parallel/distributed computing and programming
languages for symbolic computation, concrete analysis, benchmarking,
complexity of computer algebra algorithms, automatic differentiation,
code generation, mathematical data structures and exchange protocols.
Applications. Problem treatments using algebraic, symbolic or
symbolicnumeric computation in an essential or a novel way.
Engineering, economics and finance, physical and biological sciences,
computer science, logic, mathematics, statistics, education.
Program Committee:
Chair: Gilles Villard, CNRS IMAG Grenoble,
Gilles.Villard@enslyon.fr
Proceedings Editor: Bernard Mourrain, INRIA Sophia Antipolis,
mourrain [at] sophia [dot] inria.fr
Submissions must not substantially duplicate work published
or submitted for publication elsewhere. Late submissions will
be rejected.
Best student author award.
This award will be given to the best student author. An author
is eligible if fulltime student at the time of submission, this
should be indicated.
Notification.
Authors will be sent notification of acceptance or rejection by
email on or before March 12, 2001. A final copy of each accepted
paper will be required by April 2, 2001. This is again a firm
deadline. An author of each accepted paper must attend the Conference
and present the paper, or make arrangements to have it presented.
Preparing final versions.
Formatting requirements will be based on the ACM Proceedings
Templates, for instance in LaTeX2e you should use the
acm_proc_articlesp.cls document class file to format your document.
 End Forwarded Message 
Exaltation_of_Larks_520_000
ContentType: TEXT/html; name="call_for_papers.html"; charset=usascii
ContentDescription: call_for_papers.html
ContentMD5: Hm7LuhDpLQHKo649X9AOBQ==
Gilles VILLARD, ISSAC 2001 Call for Papers
Call
for Papers  05/09/2000
ISSAC'2001
International Symposium on Symbolic and Algebraic
Computation
University of Western Ontario, Canada, July
2225, 2001
[home
page]
ISSAC is the yearly premier international symposium in Symbolic and
Algebraic Computation that provides an opportunity to learn of new developments
and to present original research results in all areas of symbolic mathematical
computation. ISSAC'2001 will be locally hosted by the University
of Western Ontario at London and the Ontario
Research Centre for Computer Algebra (ORCCA).
Important dates

Before January 15, 2001 
Submission to the Program Committee Chair deadline 
March 12, 2001 
Notification of acceptance 
April 2, 2001 
Camera ready copy received 
Original research results and insightful
analyses of current concerns are solicited for submission. Papers will
be reviewed by a program committee and referees. Survey articles may be
suitable for submission if identified as such, they will be considered
in a separate category from the research papers. Proceedings will be distributed
at the symposium. Electronic submission is encouraged, a description
of the procedure will appear on this site.
Program Committee Chair: Gilles.Villard@enslyon.fr

Conference Topics:
Topics of the meeting include, but are not limited to,
Algorithmic mathematics. Algebraic, symbolic and symbolicnumeric
algorithms. Simplification, function manipulation, equations, summation,
integration, ODE/PDE, linear algebra, number theory, group and geometric
computing.
Computer Science. Theoretical and practical problems in symbolic
computation. Systems, problem solving environments, user interfaces, softwares,
libraries, parallel/distributed computing and programming languages
for symbolic computation, concrete analysis, benchmarking, complexity of
computer algebra algorithms, automatic differentiation, code generation,
mathematical data structures and exchange protocols.
Applications. Problem treatments using algebraic, symbolic or
symbolicnumeric computation in an essential or a novel way. Engineering,
economics and finance, physical and biological sciences, computer science,
logic, mathematics, statistics, education.
Program Committee:
Chair: Gilles
Villard, CNRS IMAG Grenoble,
Gilles.Villard@enslyon.fr
Proceedings Editor: Bernard
Mourrain, INRIA Sophia Antipolis, mourrain [at] sophia [dot] inria.fr
Submissions must not substantially duplicate work published or submitted
for publication elsewhere. Late submissions will be rejected.
Best student author award. This award will be given to the best
student author. An author is eligible if fulltime student at the time
of submission, this should be indicated.
Notification. Authors will be sent notification of acceptance
or rejection by email on or before March 12, 2001. A final copy
of each accepted paper will be required by April 2, 2001. This is
again a firm deadline. An author of each accepted paper must attend the
Conference and present the paper, or make arrangements to have it presented.
Preparing final versions. Formatting requirements will be based
on the ACM
Proceedings Templates, for instance in LaTeX2e you should use the
acm_proc_articlesp.cls
document class file to format your document.
Exaltation_of_Larks_520_000
From ownerreliable_computing [at] interval [dot] usl.edu Sat Sep 9 21:24:51 2000
Received: (from root@localhost)
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) id VAA00964
for reliable_computingoutgoing; Sat, 9 Sep 2000 21:24:51 0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) with ESMTP id VAA00959
for ; Sat, 9 Sep 2000 21:24:46 0500 (CDT)
Received: from earth (earth [129.108.5.21])
by cs.utep.edu (8.10.1/8.10.1) with SMTP id e8A2OZk00491;
Sat, 9 Sep 2000 20:24:35 0600 (MDT)
MessageId: <200009100224.e8A2OZk00491 [at] cs [dot] utep.edu>
Date: Sat, 9 Sep 2000 20:24:34 0600 (MDT)
From: Vladik Kreinovich
ReplyTo: Vladik Kreinovich
Subject: axiomatizations of interval analysis
To: reliable_computing [at] interval [dot] louisiana.edu, scott [at] ramas [dot] com
Cc: vladik [at] cs [dot] utep.edu
MIMEVersion: 1.0
ContentType: TEXT/plain; charset=usascii
ContentMD5: tPMXLsp8T4GGjb2L7Z6c5A==
XMailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc
Sender: ownerreliable_computing [at] interval [dot] usl.edu
Precedence: bulk
Dear Scott,
Let me add, to my previous reply, a comment about the second part of your
question.
The three "axioms" which Rabinovich describes in his book "Measurement errors:
theory and practice" (on foundations of uncertainty in measurement theory) seem
very reasonable indeed from the viewpoint of measurement theory  one of the
major sources of applications for interval mathematics.
However, none of the existing axiomatizations of interval mathematics is
directly reflecting these three properties.
I think that a natural formalization of these properties would come if we
consider modal logic: Traditional axiomatization of real numbers is using the
traditional (first order) logic in which every statement is either true or
false. In modal logic, there are two additional connectives: "possible" and
"necessary", with the usual interpretation that there are several possible
models ("worlds");
* "possible A" means that A is true in one of the possible worlds;
* "necessarily A" means that A is true in all possible worlds, and
* simply "A" means that A is true in the actual world (we do not know which
of the possible worlds is the actual world).
In these terms, Rabinovich's idea is that when a measurement results in an
interval [a,b], this means that the (unknown) actual value X of the measured
quantity can possibly be equal to any value from this interval. In other words,
"possible (X=x) if and only if a<= x<=b"
If we thus interpret the intervals of possible values of several variables
X1,...,Xn, then, for an arbitrary algebraic function X=f(X_1,...,Xn), we get
exactly the same interval of possible values as interval computation.
This analogy is known: it was first orginally proposed by Gardenes (who went 
in his Modal Interval Analysis  much further than formalizing interval
computations). It is used in our book with Lakeyev, Rohn, and Kahl on
Computational Complexity and Feasibility of Data Processing and Interval
Computations (Appendix C) from the viewpoint of computational complexity of the
corresponding problems.
It may be a good idea to exploit this modal logic idea as a foundations for
interval mathematics. I am sending this message to the entire list so that we
may get some more references and ideas on this.
Maybe, this formalization will be as easy as selecting a piece of morer
sophisticated Gardenes's ideas. Maybe, we will need to think some more about
it.
And it may fit nicely with a more algebraic approach  since some of Markov's
papers actually formalize not just the usual interval computations, but also
its generalizations  some of it by operations which were proposed by
Gardenes's Modal Interval Analysis.
Vladik
**************************************************************************
On Thu, 7 Sep 2000, Scott Ferson wrote:
I think that Vladik Kreinovich may disapprove of
the following question, but I ask it out of curiosity.
Have there been axiomatizations of interval analysis?
It might be suggested that the axioms of arithmetic
(http://library.thinkquest.org/10030/2arithax.htm):
closure,
commutativity,
associativity,
identity element,
inverse element, and
distributivity,
for addition and multiplication could simply be
weakened so that inverse element becomes
subcancellation, and distributivity becomes
subdistributivity. Should such a weakened set be
considered the "axioms of interval analysis"? If so,
it would seem that fuzzy arithmetic (sensu Kauffman
and Gupta) must be a special case, because it
obeys them too. What distinguishes the essence
of the interval approach?
In 1993, Rabinovich offered three "axioms" for the
theory measurement error:
1) the true value exists,
2) the true value is constant, and
3) the true value cannot be found.
While these lack a certain mathematical character,
they do seem closer to the spirit of interval analysis.
Is this an inappropriate question?
Scott Ferson
Applied Biomathematics
6317514350, fax 3435
From ownerreliable_computing [at] interval [dot] usl.edu Sun Sep 10 08:42:28 2000
Received: (from root@localhost)
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) id IAA02562
for reliable_computingoutgoing; Sun, 10 Sep 2000 08:42:28 0500 (CDT)
Received: from iph.bio.bas.bg (IDENT:0@basbio.lines.bas.bg [195.96.252.58])
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) with ESMTP id IAA02557
for ; Sun, 10 Sep 2000 08:42:17 0500 (CDT)
Received: from biomath (biomath.bio.bas.bg [195.96.247.160])
by iph.bio.bas.bg (8.9.3/8.9.3) with ESMTP id QAA05352;
Sun, 10 Sep 2000 16:48:46 +0300
From: "Svetoslav Markov"
Organization: Institute of Mathematics, BAS
To: reliable_computing [at] interval [dot] usl.edu, Scott Ferson
Date: Sun, 10 Sep 2000 16:40:42 +0200
Subject: Re: axioms for interval analysis?
Replyto: smarkov [at] iph [dot] bio.bas.bg
CC: Vladik Kreinovich
MessageID: <39BBB98A.18207.4CE785@localhost>
Priority: normal
Inreplyto: <39B7DC16.1D366EA6 [at] ramas [dot] com>
Xmailer: Pegasus Mail for Win32 (v3.12c)
Sender: ownerreliable_computing [at] interval [dot] usl.edu
Precedence: bulk
Dear Dr Ferson,
You are right in your intuitive idea of axiomatization of interval arithmetic, as
one important step in this direction has been namely the weekening of the
distributive law leading to the concept of quasilinear space (Mayer,
Ratschek, Schroeder, Kracht, etc.). Another important step has been the
turnover of the semigroup systems into group systems (Ortolf, Kaucher,
Gardenes etc) and the isomorphic extension of inclusion (Kaucher) in the
same manner as nonnegative numbers are extended by negative ones.
I should like to mention (in connection to Vladik's answer) that, when working
in a group system we need an interpretation of inproper results (in the same
way we interprete negative results). Such an interpretation is offered by the
modal interval arithmetic proposed by Gardenes. There are other
interpretations as well.
The axiomatization of interval arithmetic has not been yet finished. Again, to
make it more precise, denote:
I(R) the set of (proper) interval on the real line
+ addition
* multiplication by scalar
X interval multiplication
\subseteq inclusion
<= preceeding
distance, norm etc.
Then the following systems have been axiomatized:
(I(R),+,*) quasilinear space (Mayer, Ratschek, etc)
(I, X, \subseteq) Ortolf, Kaucher, Gardenes
(I write "I" because this is a group structure including improper elements)
(I,+) is trivial system, but it should be mentioned
Let me note that quasilinear systems with group structure connect both lines
of investigations.
Still little is published about (I,+,X,\subseteq, <=).
There are many investigations related to distance, norm, etc.
Much remains to be done, but I think that we are very close to a full
axiomatization of interval arithmetic. This subject is closed to the one of
axiomatization of convex analysis (where an arithmetic of convex bodies is
needed).
It should be noted expressively that interval arithmetic has enriched the
algebra by the concept of quasilinear space. This is an important concept,
because it provides a better understanding of linear spaces. It is a pity that it
seems to be so little known within us.
The group system (I,X) is also very interesting as it has the symmetries
identity, negation, opposite and dual. I dare hope that this system will also
be studied soon in the textbooks of algebra.
S. Markov
>
> I think that Vladik Kreinovich may disapprove of
> the following question, but I ask it out of curiosity.
>
> Have there been axiomatizations of interval analysis?
>
> It might be suggested that the axioms of arithmetic
> (http://library.thinkquest.org/10030/2arithax.htm):
> closure,
> commutativity,
> associativity,
> identity element,
> inverse element, and
> distributivity,
> for addition and multiplication could simply be
> weakened so that inverse element becomes
> subcancellation, and distributivity becomes
> subdistributivity. Should such a weakened set be
> considered the "axioms of interval analysis"? If so,
> it would seem that fuzzy arithmetic (sensu Kauffman
> and Gupta) must be a special case, because it
> obeys them too. What distinguishes the essence
> of the interval approach?
>
> In 1993, Rabinovich offered three "axioms" for the
> theory measurement error:
> 1) the true value exists,
> 2) the true value is constant, and
> 3) the true value cannot be found.
> While these lack a certain mathematical character,
> they do seem closer to the spirit of interval analysis.
>
> Is this an inappropriate question?
>
> Scott Ferson
> Applied Biomathematics
> 6317514350, fax 3435
>
 +  +  +  +  +  +  +  +  +  +  +  +  +  +  +  +  +
Svetoslav Markov
Section "Biomathematics", Inst. of phone: +35929793704, +3592707460,
Mathematics and Computer Sci., fax: +35929713649,
Bulgarian Academy of Sciences, email: smarkov [at] iph [dot] bio.bas.bg
"Acad. G. Bonchev" st., block 8,
BG1113 Sofia, BULGARIA
home address: 11 Mizia, 1124 Sofia, tel. +3592444651
 +  +  +  +  +  +  +  +  +  +  +  +  +  +  +  +  +
From ownerreliable_computing [at] interval [dot] usl.edu Sun Sep 10 19:00:42 2000
Received: (from root@localhost)
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) id TAA03253
for reliable_computingoutgoing; Sun, 10 Sep 2000 19:00:42 0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) with ESMTP id TAA03248
for ; Sun, 10 Sep 2000 19:00:38 0500 (CDT)
Received: from earth (earth [129.108.5.21])
by cs.utep.edu (8.10.1/8.10.1) with SMTP id e8B00T402993;
Sun, 10 Sep 2000 18:00:29 0600 (MDT)
MessageId: <200009110000.e8B00T402993 [at] cs [dot] utep.edu>
Date: Sun, 10 Sep 2000 18:00:29 0600 (MDT)
From: Vladik Kreinovich
ReplyTo: Vladik Kreinovich
Subject: Thiland conference: deadline extended, interval papers sought
To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu
Cc: pratit@st.au.ac.th
MIMEVersion: 1.0
ContentType: TEXT/plain; charset=usascii
ContentMD5: Sf+zm76XjWWf8nJj3Ucw9w==
XMailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc
Sender: ownerreliable_computing [at] interval [dot] usl.edu
Precedence: bulk
September 10, 2000
Dear Friends,
On December 1315, 2000, the first international conference on intelligent
technologies will be held in Thailand. The official deadline for
submission was September 4. Quite a few researchers have already asked for
an extension, since they have been out of town for Summer and need
time to finish their papers.
Professor Hung T. Nguyen, the conference's Organizing CoChair,
has recently returned from Bangkok, where he discussed this problem
with the local organizers. With the commitment of referees, it looks
like it is possible to referee a paper and publish it before the
conference if the paper is submitted before October 1.
So, if you are interested in submitting a paper, then the special
new deadline is
October 1, 2000
Please refer to this email when submitting your paper.
(Cameraready copies of the final versions of accepted papers are currently
scheduled to go to the publisher on November 1, so no further deadline
extension seems possible.)
Also, if anyone is interested in organizing an invited session with 45
papers, so that this organizer will take care of the refereeing
process, please contact me and Dr. Pratit Santiprabhob, the General
Chair of the conference (email pratit@st.au.ac.th), as soon as
possible. We will set up the deadlines for the refereed papers
and, if necessary, help with the refereeing.
If you are also interested in serving as a referee, please also let us
know.
The conference will be covering a wide range of different topics.
In particular, since Professor Santiprabhob is a former student of
Ladislav Kohout, one of the pioneers in interval methods in knowledge
representation, we would like to greatly encourage submissions in
this area. If someone is interested in organizing a special invited
session in this topic it will be great.
Professor Santiprabhob also
asked us to assure potential authors that the local organizers will do
their best to make the trip not only scientifically interesting, but
also pleasurable. During his recent visit, Hung T. Nguyen was very much
impressed by the organization, by the amazing campus and the beautiful
country.
Vladik

CALL FOR PAPERS
INTERNATIONAL CONFERENCE ON INTELLIGENT TECHNOLOGIES  BANGKOK
DECEMBER 1315, 2000

The International Conference on Intelligent Technologies (InTech'2000) is
the first international conference on intelligent technologies to be held in
Bangkok, Thailand. The conference especially focuses on topics in Artificial
Intelligence, Soft Computing and related fields. The aims of InTech'2000 are
to:
* bring together researchers and practitioner in order to exchange
their ideas and discuss issues occurred when implementing intelligent
technologies in realworld environment
* provide a forum for discussion of new research areas, results, and
issues.
* encourage national researches in this technology
Selected, extended, revised and refereed papers from the Conference will
be published in:
* Special Issue on Intelligent Technologies in the International Journal
of Intelligent Systems (Ron Yager, EditorinChief, John Wiley
publishers, USA); and
* A special issue of the International Journal of Uncertainty, Fuzziness
and KnowledgeBased Systems (Bernadette BouchonMeunier, EditorinChief)
For more information, see the website http://www.st.au.ac.th/~Intech2000/
From ownerreliable_computing [at] interval [dot] usl.edu Sun Sep 10 19:22:33 2000
Received: (from root@localhost)
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) id TAA03566
for reliable_computingoutgoing; Sun, 10 Sep 2000 19:22:33 0500 (CDT)
Received: from corinna.its.utas.edu.au (corinna.its.utas.edu.au [131.217.10.51])
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) with ESMTP id TAA03561
for ; Sun, 10 Sep 2000 19:22:19 0500 (CDT)
Received: from [131.217.124.71] (colyvan.phil.utas.edu.au [131.217.124.71])
by corinna.its.utas.edu.au (8.9.3/8.9.3) with ESMTP id LAA25379
for ; Mon, 11 Sep 2000 11:21:57 +1100 (EST)
MimeVersion: 1.0
XSender: mcolyvan [at] postoffice [dot] utas.edu.au
MessageId:
InReplyTo: <20000910235827.26791.qmail [at] web901 [dot] mail.yahoo.com>
References: <20000910235827.26791.qmail [at] web901 [dot] mail.yahoo.com>
Date: Mon, 11 Sep 2000 11:26:26 +1100
To: reliable_computing [at] interval [dot] louisiana.edu
From: Mark Colyvan
Subject: Re: axiomatizations of interval analysis
ContentType: text/plain; charset="usascii" ; format="flowed"
Sender: ownerreliable_computing [at] interval [dot] usl.edu
Precedence: bulk
>Dear Scott,
>
>Let me add, to my previous reply, a comment about the second part of your
>question.
>
>The three "axioms" which Rabinovich describes in his book "Measurement errors:
>theory and practice" (on foundations of uncertainty in measurement
>theory) seem
>very reasonable indeed from the viewpoint of measurement theory  one of the
>major sources of applications for interval mathematics.
>
>However, none of the existing axiomatizations of interval mathematics is
>directly reflecting these three properties.
>
>I think that a natural formalization of these properties would come if we
>consider modal logic: Traditional axiomatization of real numbers is using the
>traditional (first order) logic in which every statement is either true or
>false. In modal logic, there are two additional connectives: "possible" and
>"necessary", with the usual interpretation that there are several possible
>models ("worlds");
>* "possible A" means that A is true in one of the possible worlds;
>* "necessarily A" means that A is true in all possible worlds, and
>* simply "A" means that A is true in the actual world (we do not know which
> of the possible worlds is the actual world).
>In these terms, Rabinovich's idea is that when a measurement results in an
>interval [a,b], this means that the (unknown) actual value X of the measured
>quantity can possibly be equal to any value from this interval. In
>other words,
>"possible (X=x) if and only if a<= x<=b"
>If we thus interpret the intervals of possible values of several variables
>X1,...,Xn, then, for an arbitrary algebraic function X=f(X_1,...,Xn), we get
>exactly the same interval of possible values as interval computation.
>
>This analogy is known: it was first orginally proposed by Gardenes (who went 
>in his Modal Interval Analysis  much further than formalizing interval
>computations). It is used in our book with Lakeyev, Rohn, and Kahl on
>Computational Complexity and Feasibility of Data Processing and Interval
>Computations (Appendix C) from the viewpoint of computational
>complexity of the
>corresponding problems.
>
>It may be a good idea to exploit this modal logic idea as a foundations for
>interval mathematics. I am sending this message to the entire list so that we
>may get some more references and ideas on this.
>
>Maybe, this formalization will be as easy as selecting a piece of morer
>sophisticated Gardenes's ideas. Maybe, we will need to think some more about
>it.
>
>And it may fit nicely with a more algebraic approach  since some of Markov's
>papers actually formalize not just the usual interval computations, but also
>its generalizations  some of it by operations which were proposed by
>Gardenes's Modal Interval Analysis.
>
>Vladik
Dear Vladik and Scott,
It should be pointed out that Vladik's above presentation of modal
logic is in fact S5 modal logic (since he does not mention the
allimportant accessibility relation on the worlds). S5 is just one
of many modal logics (see G.E. Hughes and M.J. Cresswell, *A New
Introduction to Modal Logic* (London: Routledge, 1996)). Moreover,
it is well known that S5 has some quite undesirable features if
interpreted as an epistemic logic. I do not know the Gardenes stuff
on modal logic for interval analysis but you may be interested in
Jaakko Hintikka's *Knowledge and Belief: An Introduction to the Logic
of the Two Notions* (Ithaca: Cornell, 1962). This is the standard
source for (modal) epistemic logic. Hintikka recommends the weaker
S4 as the appropriate modal system for epistemic applications.
I hope this is helpful.
Mark Colyvan.
______________________________________________________
Mark Colyvan
School of Philosophy
University of Tasmania
GPO Box 25241
Hobart, Tasmania, 7001
Australia
Phone: +61 3 6226 1776
Fax: +61 3 6226 7847
Email: Mark.Colyvan [at] utas [dot] edu.au
http://www.utas.edu.au/docs/humsoc/philosophy/Mark_Colyvan.html
______________________________________________________
From ownerreliable_computing [at] interval [dot] usl.edu Sun Sep 10 19:38:42 2000
Received: (from root@localhost)
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) id TAA03906
for reliable_computingoutgoing; Sun, 10 Sep 2000 19:38:42 0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) with ESMTP id TAA03901
for ; Sun, 10 Sep 2000 19:38:38 0500 (CDT)
Received: from earth (earth [129.108.5.21])
by cs.utep.edu (8.10.1/8.10.1) with SMTP id e8B0cQD03160;
Sun, 10 Sep 2000 18:38:26 0600 (MDT)
MessageId: <200009110038.e8B0cQD03160 [at] cs [dot] utep.edu>
Date: Sun, 10 Sep 2000 18:38:26 0600 (MDT)
From: Vladik Kreinovich
ReplyTo: Vladik Kreinovich
Subject: Re: axiomatizations of interval analysis
To: reliable_computing [at] interval [dot] louisiana.edu, Mark.Colyvan [at] utas [dot] edu.au
MIMEVersion: 1.0
ContentType: TEXT/plain; charset=usascii
ContentMD5: 41BlzbMwH/MMhkzdThLcUA==
XMailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc
Sender: ownerreliable_computing [at] interval [dot] usl.edu
Precedence: bulk
Dear Mark,
Thanks a lot for the useful comment.
> It should be pointed out that Vladik's above presentation of modal
> logic is in fact S5 modal logic (since he does not mention the
> allimportant accessibility relation on the worlds).
This is absolutely correct. In the general Kripkestyle semantics of model
logic, "possible A" is interpreted as true in a given world w is A is true is
some world which is accesible from w.
In the context of interval uncertainty, when the only information we have about
a physical quantity x is that it belongs to the interval [a,b], it is naturakl
to interpret possible worlds as possible values of the variable x. Similarly,
if we have several quantities x1,...,xn with interval uncertainty, possible
worlds can be identified with possible values of these variables withing given
intervals.
In this context, it seems natural to assume that any two values are accessible
from each other, so the modal logic is indeed S5.
> S5 is just one
> of many modal logics (see G.E. Hughes and M.J. Cresswell, *A New
> Introduction to Modal Logic* (London: Routledge, 1996)). Moreover,
> it is well known that S5 has some quite undesirable features if
> interpreted as an epistemic logic. I do not know the Gardenes stuff
> on modal logic for interval analysis but you may be interested in
> Jaakko Hintikka's *Knowledge and Belief: An Introduction to the Logic
> of the Two Notions* (Ithaca: Cornell, 1962). This is the standard
> source for (modal) epistemic logic. Hintikka recommends the weaker
> S4 as the appropriate modal system for epistemic applications.
I am familiar with this research, and, although I do not think it necessary to
use S4 for intervals, but you make a good point that if we want to go beyond
that and start treating more general uncertainty, we may have to use S4 or
maybe even some other version of modal logic.
Thanks again. Vladik
I hope this is helpful.
Mark Colyvan.
From ownerreliable_computing [at] interval [dot] usl.edu Mon Sep 11 21:30:14 2000
Received: (from root@localhost)
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) id VAA06857
for reliable_computingoutgoing; Mon, 11 Sep 2000 21:30:14 0500 (CDT)
Received: from mail1.sjtu.edu.cn ([202.38.97.230])
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) with ESMTP id VAA06852
for ; Mon, 11 Sep 2000 21:30:06 0500 (CDT)
Received: from yahoo.com ([202.120.8.134]) by mail1.sjtu.edu.cn
(Netscape Messaging Server 4.15) with ESMTP id G0R5WP00.T1B for
; Tue, 12 Sep 2000 10:36:25 +0800
MessageID: <39BD9650.2BB80F92 [at] yahoo [dot] com>
Date: Tue, 12 Sep 2000 10:34:57 +0800
From: zmm80899
XMailer: Mozilla 4.6 [en] (Win95; I)
XAcceptLanguage: en
MIMEVersion: 1.0
To: reliable_computing [at] interval [dot] usl.edu
Subject: ask
ContentType: text/plain; charset=usascii
ContentTransferEncoding: 7bit
Sender: ownerreliable_computing [at] interval [dot] usl.edu
Precedence: bulk
Dear sir,
I am interested in computation methods and hope to get the answer for
the following question.
If the initial value in a interval is relatively large, how to divide
them to get better approximating effect?
For example, we wish to get the solution of the following equation:
x'(t)=Ax , with initial value x0=[a, b]
The interval is large, but how to divide it? Is there some criteria to
deal with the problem?
Your sincerely,
Zhang, Miaomiao

Miaomiao Zhang
Department of Automation
Jiaotong University A9803022
Shanghai, P.R.China
200030
email:zmm80899 [at] yahoo [dot] com
zmm80899 [at] 21cn [dot] com
Tel: 02162933212(o) 02162934071(h)
Fax: 02162933212
From ownerreliable_computing [at] interval [dot] usl.edu Tue Sep 12 09:17:05 2000
Received: (from root@localhost)
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) id JAA08445
for reliable_computingoutgoing; Tue, 12 Sep 2000 09:17:04 0500 (CDT)
Received: from mail1.sjtu.edu.cn ([202.38.97.230])
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) with ESMTP id JAA08427
for ; Tue, 12 Sep 2000 09:16:55 0500 (CDT)
Received: from yahoo.com ([202.120.8.134]) by mail1.sjtu.edu.cn
(Netscape Messaging Server 4.15) with ESMTP id G0S2MP03.41W for
; Tue, 12 Sep 2000 22:23:13 +0800
MessageID: <39BE3BFB.E022B6BB [at] yahoo [dot] com>
Date: Tue, 12 Sep 2000 22:21:47 +0800
From: zmm80899
XMailer: Mozilla 4.6 [en] (Win95; I)
XAcceptLanguage: en
MIMEVersion: 1.0
To: reliable_computing [at] interval [dot] usl.edu
Subject: ask
ContentType: text/plain; charset=usascii
ContentTransferEncoding: 7bit
Sender: ownerreliable_computing [at] interval [dot] usl.edu
Precedence: bulk
Dear sir,
I have another question.
By interval computation, we can get the discrete solution of the
continuous dynamic. But how to get the continuous smooth solution? That
is, if time t lies in some interval (t1,t2), by what method can all
the discrete approximating rectangle achieved by interval computaion in
this period are connected smoothly?
Thank you very much!
Zhang, Miaomiao
From ownerreliable_computing [at] interval [dot] usl.edu Tue Sep 12 09:44:01 2000
Received: (from root@localhost)
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) id JAA08737
for reliable_computingoutgoing; Tue, 12 Sep 2000 09:44:00 0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) with ESMTP id JAA08732
for ; Tue, 12 Sep 2000 09:43:56 0500 (CDT)
Received: from earth (earth [129.108.5.21])
by cs.utep.edu (8.10.1/8.10.1) with SMTP id e8CEhQs17018;
Tue, 12 Sep 2000 08:43:26 0600 (MDT)
MessageId: <200009121443.e8CEhQs17018 [at] cs [dot] utep.edu>
Date: Tue, 12 Sep 2000 08:43:25 0600 (MDT)
From: Vladik Kreinovich
ReplyTo: Vladik Kreinovich
Subject: Re: ask
To: reliable_computing [at] interval [dot] usl.edu, zmm80899 [at] yahoo [dot] com
MIMEVersion: 1.0
ContentType: TEXT/plain; charset=usascii
ContentMD5: 2QmKd1MjFKlgGFAFEVJxNg==
XMailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc
Sender: ownerreliable_computing [at] interval [dot] usl.edu
Precedence: bulk
Dear Dr. Zhang,
I may have misunderstood your question, but here is my reaction:
Interval computation can lead to different enclosures for the solution. We may
get a sequence of boxes which contains the unknown smooth function; this
sequence of boxes, by itself, has only one relation to smoothness: that it
contains a smooth function which is the solution to the original equation.
There are other methods: e.g., Martin Berz and his group combine interval
computations with Taylor series techniques, so you get a solution, crudely
speaking, in terms of smooth Taylor seriestype polynomial. In this case,
smoothness is implicit.
If you are interested in this, you can check Dr. Berz's homepage (it can
accessed from the Personial part of the interval computations website
http://www.cs.utep.edu/intervalcomp).
If I misunderstood you I apologize.
Vladik
P.S. From your addressing "Dear Sir" it is not clear to me that you aware of
it, so just in case: you are posting your messages to the interval computations
mailing list. Your questions are definitely appropriate for this list, so you
have not made a mistake by posting, I am just letting you know in case you are
under th impression that you are mailing to a single person.
himself (you can find his coordinates
> Date: Tue, 12 Sep 2000 22:21:47 +0800
> From: zmm80899
> XAcceptLanguage: en
> MIMEVersion: 1.0
> To: reliable_computing [at] interval [dot] usl.edu
> Subject: ask
> ContentTransferEncoding: 7bit
>
> Dear sir,
>
> I have another question.
>
> By interval computation, we can get the discrete solution of the
> continuous dynamic. But how to get the continuous smooth solution? That
> is, if time t lies in some interval (t1,t2), by what method can all
> the discrete approximating rectangle achieved by interval computaion in
> this period are connected smoothly?
>
> Thank you very much!
>
> Zhang, Miaomiao
>
>
>
From ownerreliable_computing [at] interval [dot] usl.edu Tue Sep 12 10:18:43 2000
Received: (from root@localhost)
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) id KAA09078
for reliable_computingoutgoing; Tue, 12 Sep 2000 10:18:43 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/intervalmathmajordomo1.0) with ESMTP id KAA09073
for ; Tue, 12 Sep 2000 10:18:38 0500 (CDT)
Received: (from neum@localhost)
by solon.mat.univie.ac.at (8.9.3/8.9.3) id RAA08421;
Tue, 12 Sep 2000 17:18:05 +0200 (MET DST)
Date: Tue, 12 Sep 2000 17:18:05 +0200 (MET DST)
From: Arnold Neumaier
MessageId: <200009121518.RAA08421 [at] solon [dot] mat.univie.ac.at>
To: reliable_computing [at] interval [dot] usl.edu, zmm80899 [at] yahoo [dot] com
Subject: Re: ask
Cc: neum [at] cma [dot] univie.ac.at
Sender: ownerreliable_computing [at] interval [dot] usl.edu
Precedence: bulk
>>By interval computation, we can get the discrete solution of the
continuous dynamic. But how to get the continuous smooth solution? That
is, if time t lies in some interval (t1,t2), by what method can all
the discrete approximating rectangle achieved by interval computaion in
this period are connected smoothly?<<
Lohner's method provides both boxes enclosing the solution at some
points determined adaptively, and a parameterized expression for
linearly transformed boxes containing the solution curve between the
points used for constructing the enclosure.
Arnold Neumaier
From ownerreliable_computing [at] interval [dot] usl.edu Wed Sep 13 05:41:47 2000
Received: (from root@localhost)
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) id FAA11428
for reliable_computingoutgoing; Wed, 13 Sep 2000 05:41:47 0500 (CDT)
Received: from narech.irin.univnantes.fr (IDENT:root [at] narech [dot] irin.sciences.univnantes.fr [193.52.99.2])
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) with ESMTP id FAA11423
for ; Wed, 13 Sep 2000 05:41:42 0500 (CDT)
Received: from irin.univnantes.fr (red [193.52.99.179])
by narech.irin.univnantes.fr (8.9.3/jtpda5.3.2) with ESMTP id MAA03518
; Wed, 13 Sep 2000 12:41:37 +0200
MessageID: <39BF59C2.E65DD43D [at] irin [dot] univnantes.fr>
Date: Wed, 13 Sep 2000 12:41:07 +0200
From: Evgueni Petrov
Organization: IRIN
XMailer: Mozilla 4.72 [en] (X11; U; Linux 2.2.145.0 i586)
XAcceptLanguage: en
MIMEVersion: 1.0
To: reliable_computing [at] interval [dot] usl.edu
Subject: list
References: <200009121443.e8CEhQs17018 [at] cs [dot] utep.edu>
ContentType: text/plain; charset=koi8r
ContentTransferEncoding: 8bit
XMIMEAutoconverted: from base64 to 8bit by interval.usl.edu id FAA11424
Sender: ownerreliable_computing [at] interval [dot] usl.edu
Precedence: bulk
list
From ownerreliable_computing [at] interval [dot] usl.edu Wed Sep 13 09:31:32 2000
Received: (from root@localhost)
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) id JAA11958
for reliable_computingoutgoing; Wed, 13 Sep 2000 09:31:32 0500 (CDT)
Received: from SPM1.springer.de (root [at] spm1 [dot] springer.de [192.129.25.2])
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) with ESMTP id JAA11953
for ; Wed, 13 Sep 2000 09:31:23 0500 (CDT)
Received: from HDMSX01.pip.springer.de (hdmsx01.pip.springer.de [172.20.10.62])
by SPM1.springer.de (8.9.3/8.9.1) with ESMTP id QAA26380
for ; Wed, 13 Sep 2000 16:31:20 +0200 (METDST)
Received: by hdmsx01.pip.springer.de with Internet Mail Service (5.5.2650.21)
id ; Wed, 13 Sep 2000 16:33:00 +0200
MessageID:
From: "Tickner, Sally"
To: "'reliable_computing [at] interval [dot] usl.edu'"
Subject: Newsgroup Enquiry
Date: Wed, 13 Sep 2000 16:26:53 +0200
MIMEVersion: 1.0
XMailer: Internet Mail Service (5.5.2650.21)
ContentType: text/plain
Sender: ownerreliable_computing [at] interval [dot] usl.edu
Precedence: bulk
September 12th 2000
Dear General Secretary/Newsgroup Administrator,
RE: Reliable Computing
I would like to introduce myself to you, and indeed Springer's
reliability engineering publications...
I am Sally Tickner, the Senior Marketing Manager in the UK office of
SpringerVerlag. As part of a global initiative I would like to promote a
forthcoming Handbook of Reliability Engineering and related titles.
At this stage, I would like to know how many online subscribers you
have to reliablecomputing [at] interval [dot] usl.edu?
Could you help us to reach your members in any of the following
ways:
* Do you have a mailing list of your members?
Would you supply labels?
* Do you send your members a regular newsletter?
Would you consider inserting some of our leaflets into your member
mailings?
* Do you organise or attend regular events?
Could we promote our titles at such an event?
* Do you take advertisements and/or inserts?
* Do you have a website or newsgroup where we could set up
links and/or announcements?
We would need to negotiate a cost for all of the above suggestions
and I look forward to hearing any other ideas you or your colleagues may
have too.
Needless to say, I am happy to offer your members a special
discounted rate on books and/or a FREE sample copy of the journal.
Looking forward to hearing from you. Thank you in advance.
Yours sincerely,
Sally Tickner
Email: sally [at] svl [dot] co.uk
Sally Tickner, Sr. Marketing Manager, SpringerVerlag London Ltd,
Sweetapple House, Catteshall Road, Godalming, Surrey, GU7 3DJ, UK
Tel: 01483 414113 Fax: 01483 415151 Email: sally [at] svl [dot] co.uk
www.springer.co.uk www.springer.de
From ownerreliable_computing [at] interval [dot] usl.edu Wed Sep 13 16:11:51 2000
Received: (from root@localhost)
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) id QAA12803
for reliable_computingoutgoing; Wed, 13 Sep 2000 16:11:51 0500 (CDT)
Received: from marnier.ucs.usl.edu (root@[130.70.40.2])
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) with ESMTP id QAA12798
for ; Wed, 13 Sep 2000 16:11:46 0500 (CDT)
Received: from liberty (liberty.usl.edu [130.70.46.171])
by marnier.ucs.usl.edu (8.9.1/8.9.1/ucsmxhost_1.4) with SMTP id QAA20376;
Wed, 13 Sep 2000 16:11:41 0500 (CDT)
MessageId: <2.2.32.20000913211211.012dc124 [at] pop [dot] usl.edu>
XSender: rbk5287 [at] pop [dot] usl.edu
XMailer: Windows Eudora Pro Version 2.2 (32)
MimeVersion: 1.0
ContentType: text/plain; charset="usascii"
Date: Wed, 13 Sep 2000 16:12:11 0500
To: "Tickner, Sally"
From: "R. Baker Kearfott"
Subject: Re: Newsgroup Enquiry
Cc: reliable_computing [at] interval [dot] louisiana.edu
Sender: ownerreliable_computing [at] interval [dot] usl.edu
Precedence: bulk
Sally,
We do have a mailing list; in fact your original message went to the
entire mailing list. (The list is presently unmoderated, but we've
had little reason to change that  it's been ontopic and amiable.)
I can't readily supply mailing labels, although you are welcome
to post information to the reliable_computing [at] interval [dot] louisiana.edu
mailing list, if it is relevant to reliable_computing. It sounds
like the Reliability Engineering publications are, at least
tangentially so.
The reliable_computing mailing list has people constantly
subscribing and unsubscribing, but the total number of persons has
remained almost constant at about 425 for the past five years.
The most regular event we attend is the set of "SCAN" conferences.
The upcoming one, SCAN2000 will be September 1922 in Karlsruhe,
Germany; you can see a description at
http://www.scan2000.de/
One focal web site of interest to us is maintained by
Vladik Kreinovich, vladik [at] cs [dot] utep.edu
The URL for this web site is
http://www.cs.utep.edu/intervalcomp/main.html
Free sample copies of the journal and reduced rates could
be wellreceived, if the contents are related to topics of
interest to members. You can definitely send me a free copy :)
You may also want to post to reliable_computing [at] interval [dot] louisiana.edu
a URL of a web page where people can explore the titles offered.
I, for one, would like to see more about what "Reliability Engineering"
means at Springer.
Best regards,
R. Baker Kearfott
At 04:26 PM 9/13/00 +0200, you wrote:
>
> September 12th 2000
>
> Dear General Secretary/Newsgroup Administrator,
>
> RE: Reliable Computing
>
> I would like to introduce myself to you, and indeed Springer's
>reliability engineering publications...
>
> I am Sally Tickner, the Senior Marketing Manager in the UK office of
>SpringerVerlag. As part of a global initiative I would like to promote a
>forthcoming Handbook of Reliability Engineering and related titles.
>
> At this stage, I would like to know how many online subscribers you
>have to reliablecomputing [at] interval [dot] usl.edu?
> Could you help us to reach your members in any of the following
>ways:
>
> * Do you have a mailing list of your members?
> Would you supply labels?
>
> * Do you send your members a regular newsletter?
> Would you consider inserting some of our leaflets into your member
>mailings?
>
> * Do you organise or attend regular events?
> Could we promote our titles at such an event?
>
> * Do you take advertisements and/or inserts?
>
> * Do you have a website or newsgroup where we could set up
>links and/or announcements?
>
> We would need to negotiate a cost for all of the above suggestions
>and I look forward to hearing any other ideas you or your colleagues may
>have too.
>
> Needless to say, I am happy to offer your members a special
>discounted rate on books and/or a FREE sample copy of the journal.
>
> Looking forward to hearing from you. Thank you in advance.
>
> Yours sincerely,
> Sally Tickner
> Email: sally [at] svl [dot] co.uk
>
>
>Sally Tickner, Sr. Marketing Manager, SpringerVerlag London Ltd,
>Sweetapple House, Catteshall Road, Godalming, Surrey, GU7 3DJ, UK
>Tel: 01483 414113 Fax: 01483 415151 Email: sally [at] svl [dot] co.uk
>www.springer.co.uk www.springer.de
>
>

R. Baker Kearfott, rbk [at] louisiana [dot] edu (337) 4825346 (fax)
(337) 4825270 (work) (337) 9819744 (home)
URL: http://interval.louisiana.edu/kearfott.html
Department of Mathematics, University of Louisiana at Lafayette
Box 41010, Lafayette, LA 705041010, USA

From ownerreliable_computing [at] interval [dot] usl.edu Sat Sep 16 15:17:17 2000
Received: (from root@localhost)
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) id PAA03143
for reliable_computingoutgoing; Sat, 16 Sep 2000 15:17:16 0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) with ESMTP id PAA03137
for ; Sat, 16 Sep 2000 15:17:07 0500 (CDT)
Received: from earth (earth [129.108.5.21])
by cs.utep.edu (8.10.1/8.10.1) with SMTP id e8GKGvV21436
for ; Sat, 16 Sep 2000 14:16:57 0600 (MDT)
MessageId: <200009162016.e8GKGvV21436 [at] cs [dot] utep.edu>
Date: Sat, 16 Sep 2000 14:16:56 0600 (MDT)
From: Vladik Kreinovich
ReplyTo: Vladik Kreinovich
Subject: a book of interest to interval community
To: reliable_computing [at] interval [dot] louisiana.edu
MIMEVersion: 1.0
ContentType: TEXT/plain; charset=usascii
ContentMD5: 2xQV81zFCUaw3CzRW4od0w==
XMailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc
Sender: ownerreliable_computing [at] interval [dot] usl.edu
Precedence: bulk
A new book
System Reliability Under Incomplete Information, by S. V. Gurov
and L. V. Utkin, Lubavich Publ., St. Petersburg, Russia, 1999 (in Russian).
deals with the interval methods in system reliability (in the more traditional
engineering sense of this word). Interested researchers may want to contact Dr.
Utkin at lvu [at] utkin [dot] usr.etu.spb.ru
Vladik
From ownerreliable_computing [at] interval [dot] usl.edu Tue Sep 19 12:25:06 2000
Received: (from root@localhost)
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) id MAA08771
for reliable_computingoutgoing; Tue, 19 Sep 2000 12:25:05 0500 (CDT)
Received: from cosmos.imag.fr (cosmos.imag.fr [147.171.130.1])
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) with ESMTP id MAA08766
for ; Tue, 19 Sep 2000 12:25:01 0500 (CDT)
Received: (from echahed@localhost)
by cosmos.imag.fr (8.9.3/8.8.6) id SAA06355;
Tue, 19 Sep 2000 18:46:35 +0200 (MET DST)
Date: Tue, 19 Sep 2000 18:46:35 +0200 (MET DST)
From: Rachid Echahed
MessageId: <1000919184635.ZM6353 [at] cosmos [dot] imag.fr>
XMailer: ZMail (5.0.0 30July97)
To: Rachid.Echahed [at] imag [dot] fr
Subject: ETAPS2002: Call for Affiliated Workshops
MIMEVersion: 1.0
ContentType: text/plain; charset=usascii
ContentTransferEncoding: 8bit
Sender: ownerreliable_computing [at] interval [dot] usl.edu
Precedence: bulk
(Apologies if you receive multiple copies of this announcement)

Call for Affiliated Workshops
ETAPS 2002
April 2002, Grenoble, France
http://wwwetaps.imag.fr

ETAPS, the European Joint Conferences on Theory and Practice of
Software is a major international forum for academic and industrial
researchers working on topics relating to Software Science. After
ETAPS'98 in Lisbon, ETAPS'99 in Amsterdam, ETAPS 2000 in Berlin and
ETAPS 2001 in Genova, ETAPS 2002 will take place in Grenoble during
April 2002 (the precise dates will be communicated later).
ETAPS is a confederation of five main conferences: the International
Conference on Compiler Construction (CC), the European Symposium On
Programming (ESOP), Fundamental Approaches to Software Engineering
(FASE), Foundations of Software Science and Computation Structures
(FOSSACS) and Tools and Algorithms for the Construction and Analysis
of Systems (TACAS).
Workshops affiliated to ETAPS 2002 will be held before, after or
partly in parallel with the main conferences. Researchers and
practitioners wishing to organize a workshop affiliated to ETAPS 2002
are invited to submit, by electronic mail in ASCII or Postscript
format, proposals for workshops to the ETAPS 2002 Workshop Chair, by
December 1st, 2000. Such a proposal should be no longer than two pages
and should describe the topic of the workshop, the names and contact
information of the organizers, the estimated dates for paper
submissions, notification of acceptance and final versions (before
Ferbruary 15, 2002), the expected number of participants and duration,
the preferred period (pre or postETAPS) and any other relevant
information (e.g., invited speakers, panels, publication policy, demo
sessions etc.).
The proposals will be evaluated by the ETAPS 2002 organizing committee
on the basis of their assessed benefit for prospective participants to
ETAPS 2002. Acceptance decisions will be made by December 15,
2000. The titles and brief information related to accepted workshop
proposals will be included in the conference program and advertised in
the call for participation. Workshop organizers will be responsible
for producing a Call for papers, Web site, reviewing and making
acceptance decisions on submitted papers and scheduling workshop
activities in consultation with the local organizers.
Any further information needed for preparing a workshop proposal can
be obtained by contacting the ETAPS 2002 Workshop Chair:
Rachid Echahed, Rachid.Echahed [at] imag [dot] fr
Important dates :
December 1, 2000 : Workshop proposals
December 15, 2000 : Notification of acceptance
ETAPS 2002 Web site:
http://wwwetaps.imag.fr/

From ownerreliable_computing [at] interval [dot] usl.edu Wed Sep 20 08:16:43 2000
Received: (from root@localhost)
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) id IAA11093
for reliable_computingoutgoing; Wed, 20 Sep 2000 08:16:43 0500 (CDT)
Received: from mail.unisannio.it (mail.unisannio.it [193.206.108.2])
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) with ESMTP id IAA11088
for ; Wed, 20 Sep 2000 08:16:20 0500 (CDT)
Received: (from icsm2001@localhost)
by mail.unisannio.it (8.9.3/8.8.7) id PAA07957
for reliable_computing [at] interval [dot] usl.edu; Wed, 20 Sep 2000 15:16:04 +0200
Date: Wed, 20 Sep 2000 15:16:04 +0200
From: ICSM2001 (Canfora)
MessageId: <200009201316.PAA07957 [at] mail [dot] unisannio.it>
To: reliable_computing [at] interval [dot] usl.edu
Subject: CFPs: IEEE Int. Conf. on Software Maint., Florence, Italy
Sender: ownerreliable_computing [at] interval [dot] usl.edu
Precedence: bulk
Dear Colleague
I hope that this CFPs could be useful for your work.
Please forward the following to anybody who you think may be interested.
Apologies if you have already seen this.
If you would like to be removed from our list please send an email to
icsm2001 [at] unisannio [dot] it with REMOVE in the subject.
ICSM2001
Technical Committee
_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=
CALLFORPAPERS
IEEE International Conference on Software Maintenance 2001
FLORENCE, ITALY, 59 November 2001,
http://www.dsi.unifi.it/icsm2001
Theme: Systems and Software Evolution in the era of the Internet
_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=
ICSM is the major international conference in the field of software and
systems maintenance, evolution, and management.
In the era of the Internet, businesses and endusers have invested in new
technologies and small and large software organizations around the world
are looking for Internet related solutions to evolve and maintain their
new Internet software products.
Internet technologies are strongly impacting system architectures and
business processes and rules. In some cases businesses and endusers
have been overwhelmed trying to keep up with software development and
evolution processes and practices. In addition to novel solutions to
enable the lifecycle of new webbased software systems, huge investments
are necessary to migrate aginglegacy applications to webenabled
contemporary systems.
ICSM 2001 will address these major changes in the software landscape and
their impact on maintenance and evolution. The focus of the conference
will be to explore the new challenges that the Internet, as a driver for
business changes, poses for software maintenance, and the new opportunities
it opens as infrastructure and enabling technology.
The purpose of the conference is to promote discussion and interaction
between researchers and practitioners. We are particularly interested in
exchanging concepts, prototypes, research ideas, and other results which
could contribute to the academic arena and also benefit business and the
industrial community. ICSM 2001 will be participatory, with working
collaborative sessions and presentations of industry projects. ICSM 2001
will bring together researchers, practitioners, developers and users
of tools, technology transfer experts, and project managers.
The Conference will be held in conjunction with WESS, the Workshop on
Empirical Studies of Software.
Topics of interest include but are not restricted to the following
aspects of maintenance and evolution:
 Methods and theories Processes and strategies
 Organizational frameworks Life cycle and process control
 Design for maintenance Tools and environments
 Internet and distributed systems Multimedia systems
 User interface evolution Commercial offtheshelf (COTS)
 Third party maintenance Freeware and open source applications
 Program comprehension Software and system visualization
 Knowledge based systems Formal methods
 Impact of new software practices Empirical studies
 Software reusability Programming languages
 Source code analysis and manipulation Testing and regression testing
 Models and methods for error prediction Measurement of software
 Maintenance and/or productivity metrics Preventive maintenance
 Personnel aspects of maintenance Reengineering and reverse engineering
 Version and configuration management Legal aspects and standards
 Management and organization Remote, telework, and cooperative applications
RESEARCH PAPERS
Research papers should describe original and significant work in the
research and practice of software maintenance. Research case studies,
empirical research, and experiments are particularly welcome. Papers should be 2000  5000 words in length, in English. Submit them
in PDF or PostScript via email to icsm2001 [at] unisannio [dot] it by 15 January 2001.
A prize of the Journal of Software Maintenance will be assigned at the
Best submitted Paper.
INDUSTRIAL APPLICATIONS
We welcome proposals for presentations of Industrial Applications.
These can be experience reports from real projects, industrial practices
and models, or tool demonstrations. Submit proposals for Industrial Application
presentations via email to icsm2001.industry [at] unisannio [dot] it by 12 March 2001.
Industrial Applications proposals will be reviewed by a dedicated
subcommittee of the program committee and a 1 page summary of accepted
proposals will be included in the conference proceedings.
TUTORIALS
Tutorials should present software maintenance and evolution topics of
interest to practitioners. Tutorials may be fullday or halfday in length.
Submit tutorial proposals via email to
icsm2001.tutorial [at] unisannio [dot] it by 12 February 2001.
IMPORTANT DATES
Research Paper submission 15 January 2001, notification of acceptance 1 June 2001
Industrial Application submission 12 March 2001
Tutorial submission 12 February 2001

General chair:
Paolo Nesi, University of Florence, Italy, nesi [at] dsi [dot] unifi.it
Financial chair:
Vaclav Rajlich, Wayne State University, USA, vtr [at] cs [dot] wayne.edu
Program cochairs:
Gerardo Canfora, University of Sannio, Italy, gerardo.canfora [at] unisannio [dot] it
Anneliese von Mayrhauser, Colorado State University, USA, avm [at] CS [dot] ColoState.EDU
Tutorials cochairs:
Lionel C. Briand, Carleton University, briand [at] sce [dot] carleton.ca
Alessandro Fantechi, University of Florence, Italy, Fantechi [at] dsi [dot] unifi.it
Industrial Applications cochairs:
Panagiotis K. Linos, Tennessee Technological University, USA, linos [at] tntech [dot] edu
Harry Sneed, Software Engineering Service GmbH, Germany, Harry.Sneed@tonline.de
Chris Verhoef, University of Amsterdam, NL, x [at] wins [dot] uva.nl
Publicity cochairs:
Nicholas Zvegintzov (General Cochair), Software Management Network, USA,
zvegint [at] attglobal [dot] net
Malcolm Munro (Cochair for Europe), University of Durham, UK,
malcolm.munro [at] durham [dot] ac.uk
William ChengChung Chu (Cochair for East), TungHai University, Taiwan,
chu [at] cis [dot] thu.edu.tw
Local Arrangements cochairs:
Fabrizio Fioravanti, University of Florence, Italy, fioravan [at] dsi [dot] unifi.it
Pierfrancesco Bellini (Industrial Applications, and Demos),
University of Florence, Italy, bellini [at] hpcn [dot] dsi.unifi.it
WEB Master:
Marius Bogdan Spinu, University of Florence, Italy, spinu [at] hpcn [dot] dsi.unifi.it

From ownerreliable_computing [at] interval [dot] usl.edu Sat Sep 23 09:28:44 2000
Received: (from root@localhost)
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) id JAA18378
for reliable_computingoutgoing; Sat, 23 Sep 2000 09:28:44 0500 (CDT)
Received: from marnier.ucs.usl.edu (root@[130.70.40.2])
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) with ESMTP id JAA18373
for ; Sat, 23 Sep 2000 09:28:40 0500 (CDT)
Received: from u8174 (rbk5287 [at] goedel [dot] usl.edu [130.70.49.203])
by marnier.ucs.usl.edu (8.9.1/8.9.1/ucsmxhost_1.4) with SMTP id JAA29718
for ; Sat, 23 Sep 2000 09:28:38 0500 (CDT)
MessageId: <2.2.32.20000923143012.006e6c70 [at] pop [dot] usl.edu>
XSender: rbk5287 [at] pop [dot] usl.edu
XMailer: Windows Eudora Pro Version 2.2 (32)
MimeVersion: 1.0
ContentType: text/plain; charset="usascii"
Date: Sat, 23 Sep 2000 09:30:12 0500
To: reliable_computing [at] interval [dot] louisiana.edu
From: "R. Baker Kearfott"
Subject: SCAN 2000 ?
Sender: ownerreliable_computing [at] interval [dot] usl.edu
Precedence: bulk
Colleagues,
I am regretful that it was impractical for me to attend
SCAN 2000. If someone who did attend has the inclination, could
they please post a summary (formal or informal) of the highpoints
and happenings of the meeting to this mailing list, for me and
persons like me?
Best regards,
Baker

R. Baker Kearfott, rbk [at] louisiana [dot] edu (337) 4825346 (fax)
(337) 4825270 (work) (337) 9819744 (home)
URL: http://interval.louisiana.edu/kearfott.html
Department of Mathematics, University of Louisiana at Lafayette
Box 41010, Lafayette, LA 705041010, USA

From ownerreliable_computing [at] interval [dot] usl.edu Sun Sep 24 20:02:34 2000
Received: (from root@localhost)
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) id UAA20943
for reliable_computingoutgoing; Sun, 24 Sep 2000 20:02:34 0500 (CDT)
Received: from marnier.ucs.usl.edu (root@[130.70.40.2])
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) with ESMTP id UAA20938
for ; Sun, 24 Sep 2000 20:02:29 0500 (CDT)
Received: from u8174 (rbk5287 [at] goedel [dot] usl.edu [130.70.49.203])
by marnier.ucs.usl.edu (8.9.1/8.9.1/ucsmxhost_1.4) with SMTP id UAA08066
for ; Sun, 24 Sep 2000 20:02:25 0500 (CDT)
MessageId: <2.2.32.20000925010400.0076bffc [at] pop [dot] usl.edu>
XSender: rbk5287 [at] pop [dot] usl.edu
XMailer: Windows Eudora Pro Version 2.2 (32)
MimeVersion: 1.0
ContentType: text/plain; charset="usascii"
Date: Sun, 24 Sep 2000 20:04:00 0500
To: reliable_computing [at] interval [dot] louisiana.edu
From: "R. Baker Kearfott"
Subject: RE: GlobSol  circuit analysis with wide intervals
Sender: ownerreliable_computing [at] interval [dot] usl.edu
Precedence: bulk
Colleagues,
I thought many of you would be interested in the following. Also,
we would welcome any additional contributions or ideas you would have.
Best regards,
Baker
>ReturnPath:
>From: gsaxena [at] informatica [dot] com
>To: rbk [at] louisiana [dot] edu
>Subject: RE: GlobSol  interval math application
>Date: Sun, 24 Sep 2000 16:29:42 0700
>
>Hi Baker,
>
>By all means, please do post this discussion on
>reliable_computing [at] interval [dot] louisiana.edu mailing list. I will try to join
>this list as well. I am curious if anyone else has come up with unique
>solutions to the simple circuit analysis problem posed below.
>
>Thank you for your thorough answer. In order to better understand the
>techniques chosen to solve this problem, I will research the interval theory
>from your publication "Rigorous Global Search  Continuous Problems,"
>Kluwer, 1996.
>
>Gautam
>
>Original Message
>From: R. Baker Kearfott [mailto:rbk [at] louisiana [dot] edu]
>Sent: Saturday, September 23, 2000 2:35 PM
>To: gsaxena [at] informatica [dot] com
>Subject: RE: GlobSol  interval math application
>
>
>Gautam,
>
>Now I think I understand the problem. In the original equations,
>both "I" and "V" occur in both equations, so, without initial bounds
>on them, you cannot get narrower intervals by constraint propagation.
>Your symbolic manipulation puts things in a form where you can
>first solver for "I" in terms of known quantities, then solve for
>"V".
>
>GlobSol uses a combination of constraint propagation, interval Newton
>methods, and subdivision. The basic methods are described in my
>book "Rigorous Global Search  Continuous Problems," Kluwer, 1996,
>although there have been many improvements to the actual software
>since then.
>
>The main issue in using such general software to solve problems of
>that type is the nontrivialwidth intervals in the constants. I have
>addressed that in the paper "On Stopping Criteria in Verified
>Nonlinear Systems or Optimization Algorithms, accepted for
>publication in the "ACM Transactions on Mathematical Software." (A
>preprint is available from my web site.)
>
>Using the distribution version of GlobSol with default configuration,
>I have tried the small problem; It gave 52 small boxes, the union of
>which contains the solution. Using the subdivision method described in
>the aforementioned paper, and subdividing "R" into five subintervals,
>I obtained ten interval vectors containing the solution set, and
>I obtained, for interval hull:
>
> The interval hull of the boxes with verified feasible points:
> [ 0.8529D+01, 0.8529D+01 ] [ 0.3023D+01, 0.3023D+01 ]
> The interval hull of the objective values corresponding
> to the boxes with verified feasible points:
> [ 0.0000D+00, 0.1878D+02 ]
>
>My initial intervals (needed by GlobSol) were [10^6,10^6] in both
>variables, and it executed in less than two seconds.
>
>I note that the "exact" positive parts of the answers are
>
> V = [5.6568542494923796,8.4852813742385714]
> I = [2.0,3.0]
>
>(I obtained this by using your reformulated equations and the
>interval data type in Sun's f95 compiler.)
>
>You see that the upper bounds are not far from what GlobSol with
>the constant subdivision modification gave.
>When I restrict the variables to be positive, thus including only
>one branch of the square root and eliminating the symmetry in the
>direction of the voltage and current, GlobSol with the constant subdivision
>modification gives five boxes in 0.2 seconds, and gives an answer of
>
> The interval hull of the boxes with verified feasible points:
> [ 0.5302D+01, 0.9107D+01 ] [ 0.1834D+01, 0.3150D+01 ]
> The interval hull of the objective values corresponding
> to the boxes with verified feasible points:
> [ 0.0000D+00, 0.3560D+02 ]
>
>With 20 subdivisions, it gives 20 boxes, in 0.44 CPU seconds, with
>an answer of
>
> The interval hull of the boxes with verified feasible points:
> [ 0.5118D+01, 0.9285D+01 ] [ 0.1798D+01, 0.3263D+01 ]
> The interval hull of the objective values corresponding
> to the boxes with verified feasible points:
> [ 0.0000D+00, 0.3377D+02 ]
> Ratio of width of phi to width of varied constant:
> 0.1689D+02
>
>(It appears both constants need to be subdivided to make this more
>accurate.)
>
>
>I'm presently working on alternate ideas to make GlobSol more effective
>on this kind of problem.
>
>Best regards,
>
>Baker
>
>P.S. May I post this to the reliable_computing [at] interval [dot] louisiana.edu
> mailing list? I think there may be general interest in it there.
>
>At 03:12 PM 9/22/00 0700, you wrote:
>>Hi Baker,
>>
>>Let's say that R and P are known:
>>
>>eg R=[2,4]
>> P=[16,18]
>> I=[INF,+INF]
>> V=[INF,+INF]
>>
>>that is, R and P are known intervals, and I and V are initially completely
>>unknown.
>>
>>and the equations are, as before:
>>
>>P = V * I  equation 1 > Power = Voltage * Current
>>V = I *R  equation 2 > Voltage = Current * Resistance
>>
>>Can Globsol correctly determine the intervals for all 4 variables? Do you
>>have a paper on your website describing how it solves for this system of 2
>>equations? (One solution we were exploring at McGill was using an
>algebraic
>>engine which would generate the two needed equations: P=I^2*R and P=V^2/R
>in
>>order to resolve the relationship between P and R. This solution did not
>>scale for a system of many equations)
>>
>>Regards,
>>
>>Gautam
>>
>>Original Message
>>From: R. Baker Kearfott [mailto:rbk [at] louisiana [dot] edu]
>>Sent: Friday, September 22, 2000 4:11 PM
>>To: gsaxena [at] informatica [dot] com
>>Subject: Re: GlobSol  interval math application
>>
>>
>>Gautam,
>>
>>I'm not sure I understand your simple example. Which quantities are
>>you considering to be known, and which are unknown?
>>
>>Baker
>>
>>At 09:49 AM 9/22/00 0700, you wrote:
>>>Hi Dr. Kearfott,
>>>
>>>While researching interval mathematic tools, I came across your product,
>>>GlobSol. I have a simple "yes/no" question which I was unable to answer
>>>easily from reviewing website information regarding GlobSol:
>>>
>>>Can GlobSol solve a set of algebraic equations accurately given interval
>>>definitions of the various variables?
>>>
>>>The simplest example from electrical circuits analysis would be:
>>>
>>>P=V*I;
>>>V=I*R;
>>>
>>>where P, V, I, R are all defined as intervals. As you undoubtedly know,
>>>even this simplest of equations gives incorrect results if you simply
>apply
>>>basic interval math. One solution is to generate the equations P=I^2*R
>and
>>>P=V^2/R and to then solve using standard interval math techniques. How
>>does
>>>GlobSol solve this equation?
>>>
>>>Gautam Saxena
>>>(I am a recent graduate of Computer Engineering, BEng 2000, McGill
>>>University; one component of my thesis was to work on interval math based
>>>algebraic solvers)
>>>
>>>
>>

R. Baker Kearfott, rbk [at] louisiana [dot] edu (337) 4825346 (fax)
(337) 4825270 (work) (337) 9819744 (home)
URL: http://interval.louisiana.edu/kearfott.html
Department of Mathematics, University of Louisiana at Lafayette
Box 41010, Lafayette, LA 705041010, USA

From ownerreliable_computing [at] interval [dot] usl.edu Mon Sep 25 11:27:49 2000
Received: (from root@localhost)
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) id LAA22855
for reliable_computingoutgoing; Mon, 25 Sep 2000 11:27:49 0500 (CDT)
Received: from bologna.vision.caltech.edu (bologna.vision.caltech.edu [131.215.163.1])
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) with ESMTP id LAA22850
for ; Mon, 25 Sep 2000 11:27:30 0500 (CDT)
Received: from modena.vision.caltech.edu (modena.vision.caltech.edu [131.215.163.56])
by bologna.vision.caltech.edu (8.9.3/8.9.3) with ESMTP id JAA26485
for ; Mon, 25 Sep 2000 09:23:29 0700 (PDT)
Received: (from arrigo@localhost)
by modena.vision.caltech.edu (8.9.3+Sun/8.9.1) id JAA13454;
Mon, 25 Sep 2000 09:27:29 0700 (PDT)
XAuthenticationWarning: modena.vision.caltech.edu: arrigo set sender to arrigo [at] vision [dot] caltech.edu using f
To: reliable_computing [at] interval [dot] louisiana.edu
Subject: Re: GlobSol  circuit analysis with wide intervals
References: <2.2.32.20000925010400.0076bffc [at] pop [dot] usl.edu>
From: Arrigo Benedetti
Date: 25 Sep 2000 09:27:29 0700
InReplyTo: "R. Baker Kearfott"'s message of "Sun, 24 Sep 2000 20:04:00 0500"
MessageID:
Lines: 37
UserAgent: Gnus/5.0807 (Gnus v5.8.7) Emacs/20.4
MIMEVersion: 1.0
ContentType: text/plain; charset=usascii
Sender: ownerreliable_computing [at] interval [dot] usl.edu
Precedence: bulk
"R. Baker Kearfott" writes:
> Colleagues,
>
> I thought many of you would be interested in the following. Also,
> we would welcome any additional contributions or ideas you would have.
>
> Best regards,
>
> Baker
>
Lubomir Kolev has written an extensive monograph on the applications
of interval techniques to circuit analysis:
@book{kolev,
author="L. V. Kolev",
title="{Interval Methods for Circuit Analysis}",
publisher="{World Scientific}",
year="1993"}
A review paper on the solution of the DC operating point problem by
interval analysis by myself et al. is due to be published soon on
Analog Integrated Circuits and Signal Processing, Kluwer:
A. Benedetti N. Guglielmi, L. Kolev, K. Mladenov, ``Finding Multiple
Operating Points of Nonlinear Circuits by Interval Analysis: a Review
and Recent Results'', to appear on Analog Integrated Circuits and
Signal Processing, Kluwer.
Cheers,
Arrigo Benedetti

Dr. Arrigo Benedetti email: arrigo [at] vision [dot] caltech.edu
Caltech, MS 13693 phone: (626) 3953129
Pasadena, CA 91125 fax: (626) 7958649
From ownerreliable_computing [at] interval [dot] usl.edu Fri Sep 29 07:39:49 2000
Received: (from root@localhost)
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) id HAA01456
for reliable_computingoutgoing; Fri, 29 Sep 2000 07:39:49 0500 (CDT)
Received: from postmarq.mu.edu (ldap.mu.edu [134.48.1.9])
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) with ESMTP id HAA01451
for ; Fri, 29 Sep 2000 07:39:44 0500 (CDT)
Received: from mscs.mu.edu ([134.48.24.1]) by postmarq.mu.edu
(Netscape Messaging Server 4.15) with ESMTP id G1NF0R00.KRD for
; Fri, 29 Sep 2000
07:36:27 0500
MessageID: <39D48D10.61CF9A4E [at] mscs [dot] mu.edu>
Date: Fri, 29 Sep 2000 07:37:36 0500
From: George Corliss
ReplyTo: georgec [at] mscs [dot] mu.edu
Organization: Marquette University
XMailer: Mozilla 4.7 [en] (Win98; U)
XAcceptLanguage: en
MIMEVersion: 1.0
To: reliable_computing [at] interval [dot] louisiana.edu
Subject: Rohn at Scan 2000
ContentType: text/plain; charset=usascii
ContentTransferEncoding: 7bit
Sender: ownerreliable_computing [at] interval [dot] usl.edu
Precedence: bulk
Baker had requested a report on
Scan 2000
GAMM  IMACS International Symposium on Scientific
Computing, Computer Arithmetic, and Validated Numerics
Interval 2000
International Conference on Interval Methods in Science
and Engineering
held jointly in Karlsruhe, September 1822, 2000
I am not willing to undertake a complete report, but I
would like to say something about the talk given there
by Professor Juri Rohn. Professor Rohn writes:
"As you remember, the talk was concerned with necessary and
sufficient conditions and exact bounds. But computable
sufficient conditions and inexact bounds are what is
looked for in practice."
Corliss's review: This is one of the most beautiful
conference talks I have heard in years. Professor Rohn
took a complex, often subtle, area of study: complexity
issues in the solution of linear systems. He presented
it in a systematic manner. This talk is well work
reading for EVERY researcher interested in interval
analysis.
A Postscript file containing his slides is available at
http://www.mscs.mu.edu/~georgec/Corliss/rohn_slides.html
I was impressed by the emerging maturity of our discipline.
There were many talks discussing a wide variety of serious
applications, and there were very few talks pointing out
that you could implement intervals by overloaded operators.
Personally, I was very impressed by Rudolf Lohner's talk
on the ubiquity of the wrapping effect, especially since
he showed the solution to a problem I have worked on for
at least 10 years, how to use preconditioning to tighten
Taylor series enclosures computed by recurrences for the
divide and similar Taylor operators.
A special thanks goes to Professor Kulisch and all who
worked so hard to make this a pleasant and worthwhile
conference.
Scan 2002 will be in Paris, hosted by Rene Alt.
Watch for an announcement of MooreFest: Interval 2001,
tentatively to be held next Fall in Denver Colorado in
honor of Ray Moore's retirement last summer from Ohio
State University.

Dr. George F. Corliss
Dept. Math, Stat, Comp Sci
Marquette University
P.O. Box 1881
Milwaukee, WI 532011881 USA
georgec [at] mscs [dot] mu.edu; George.Corliss [at] Marquette [dot] edu
http://www.mscs.mu.edu/~georgec/
Office: 4142886599; Dept: 2887573; Fax: 2885472
From ownerreliable_computing [at] interval [dot] usl.edu Fri Sep 29 09:13:45 2000
Received: (from root@localhost)
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) id JAA01858
for reliable_computingoutgoing; Fri, 29 Sep 2000 09:13:45 0500 (CDT)
Received: from marnier.ucs.usl.edu (root@[130.70.40.2])
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) with ESMTP id JAA01853
for ; Fri, 29 Sep 2000 09:13:42 0500 (CDT)
Received: from liberty (liberty.usl.edu [130.70.46.171])
by marnier.ucs.usl.edu (8.9.1/8.9.1/ucsmxhost_1.4) with SMTP id JAA19696
for ; Fri, 29 Sep 2000 09:13:40 0500 (CDT)
MessageId: <2.2.32.20000929141452.012e9038 [at] pop [dot] usl.edu>
XSender: rbk5287 [at] pop [dot] usl.edu
XMailer: Windows Eudora Pro Version 2.2 (32)
MimeVersion: 1.0
ContentType: text/plain; charset="usascii"
Date: Fri, 29 Sep 2000 09:14:52 0500
To: reliable_computing [at] interval [dot] louisiana.edu
From: "R. Baker Kearfott"
Subject: Re: Report of Scan 2000
Sender: ownerreliable_computing [at] interval [dot] usl.edu
Precedence: bulk
George,
Thank you. This was what I had in mind.
I'd like to encourage others with other items to add to
also post them to reliable@computing [at] interval [dot] louisiana.edu
Best regards,
Baker
At 07:37 AM 9/29/00 0500, George Corliss wrote:
>Baker had requested a report on
>
>Scan 2000
>GAMM  IMACS International Symposium on Scientific
>Computing, Computer Arithmetic, and Validated Numerics
>
>Interval 2000
>International Conference on Interval Methods in Science
>and Engineering
>
>held jointly in Karlsruhe, September 1822, 2000
>
>I am not willing to undertake a complete report, but I
>would like to say something about the talk given there
>by Professor Juri Rohn. Professor Rohn writes:
>"As you remember, the talk was concerned with necessary and
>sufficient conditions and exact bounds. But computable
>sufficient conditions and inexact bounds are what is
>looked for in practice."
>
.
.
.

R. Baker Kearfott, rbk [at] louisiana [dot] edu (337) 4825346 (fax)
(337) 4825270 (work) (337) 9819744 (home)
URL: http://interval.louisiana.edu/kearfott.html
Department of Mathematics, University of Louisiana at Lafayette
Box 41010, Lafayette, LA 705041010, USA

From ownerreliable_computing [at] interval [dot] usl.edu Fri Sep 29 09:33:27 2000
Received: (from root@localhost)
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) id JAA02213
for reliable_computingoutgoing; Fri, 29 Sep 2000 09:33:27 0500 (CDT)
Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3])
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) with ESMTP id JAA02208
for ; Fri, 29 Sep 2000 09:33:24 0500 (CDT)
Received: from earth (earth [129.108.5.21])
by cs.utep.edu (8.10.1/8.10.1) with SMTP id e8TEXJY09869;
Fri, 29 Sep 2000 08:33:19 0600 (MDT)
MessageId: <200009291433.e8TEXJY09869 [at] cs [dot] utep.edu>
Date: Fri, 29 Sep 2000 08:33:17 0600 (MDT)
From: Vladik Kreinovich
ReplyTo: Vladik Kreinovich
Subject: Re: Report of Scan 2000
To: reliable_computing [at] interval [dot] louisiana.edu, rbk [at] louisiana [dot] edu
MIMEVersion: 1.0
ContentType: TEXT/plain; charset=usascii
ContentMD5: Ql5rTU7dB6mCq8Pe6eZZvQ==
XMailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc
Sender: ownerreliable_computing [at] interval [dot] usl.edu
Precedence: bulk
Minor correction: email is reliable_computing [at] interval [dot] louisiana.edu
> XSender: rbk5287 [at] pop [dot] usl.edu
> MimeVersion: 1.0
> Date: Fri, 29 Sep 2000 09:14:52 0500
> To: reliable_computing [at] interval [dot] louisiana.edu
> From: "R. Baker Kearfott"
> Subject: Re: Report of Scan 2000
>
> George,
>
> Thank you. This was what I had in mind.
>
> I'd like to encourage others with other items to add to
> also post them to reliable@computing [at] interval [dot] louisiana.edu
>
> Best regards,
>
> Baker
>
> At 07:37 AM 9/29/00 0500, George Corliss wrote:
> >Baker had requested a report on
> >
> >Scan 2000
> >GAMM  IMACS International Symposium on Scientific
> >Computing, Computer Arithmetic, and Validated Numerics
> >
> >Interval 2000
> >International Conference on Interval Methods in Science
> >and Engineering
> >
> >held jointly in Karlsruhe, September 1822, 2000
> >
> >I am not willing to undertake a complete report, but I
> >would like to say something about the talk given there
> >by Professor Juri Rohn. Professor Rohn writes:
> >"As you remember, the talk was concerned with necessary and
> >sufficient conditions and exact bounds. But computable
> >sufficient conditions and inexact bounds are what is
> >looked for in practice."
> >
> .
> .
> .
>
> 
> R. Baker Kearfott, rbk [at] louisiana [dot] edu (337) 4825346 (fax)
> (337) 4825270 (work) (337) 9819744 (home)
> URL: http://interval.louisiana.edu/kearfott.html
> Department of Mathematics, University of Louisiana at Lafayette
> Box 41010, Lafayette, LA 705041010, USA
> 
From ownerreliable_computing [at] interval [dot] usl.edu Fri Sep 29 11:02:24 2000
Received: (from root@localhost)
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) id LAA02795
for reliable_computingoutgoing; Fri, 29 Sep 2000 11:02:24 0500 (CDT)
Received: from disi.unige.it (mailhost.disi.unige.it [130.251.61.19])
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) with ESMTP id LAA02790
for ; Fri, 29 Sep 2000 11:02:13 0500 (CDT)
Received: from [130.251.61.155] (reggio [130.251.61.155])
by disi.unige.it (8.8.8/8.8.8) with ESMTP id RAA00413;
Fri, 29 Sep 2000 17:26:41 +0200 (MET DST)
MimeVersion: 1.0
MessageId:
Date: Fri, 29 Sep 2000 17:25:06 +0100
To: wadt2001 [at] disi [dot] unige.it
From: WADT 2001
Subject: WADT/CoFI 2001: Call for abstracts
ContentType: text/plain; charset="usascii" ; format="flowed"
Sender: ownerreliable_computing [at] interval [dot] usl.edu
Precedence: bulk
WADT/CoFI 2001
15th International Workshop on Algebraic Development Techniques
joint with
General Workshop of the CoFI WG & CASL Tutorial
Genova, Italy
13 April 2001
http://www.disi.unige.it/wadt2001/
Aims and Scope
==============
The algebraic approach to system specification and development, born
as a formal method for abstract data types, encompasses today the
formal design of integrated hardware and software systems, new
specification frameworks and programming paradigms (such as
objectoriented, logic and higherorder functional programming) and a
wide range of application areas (including information systems,
concurrent and distributed systems).
The topics of the workshop include, but are not limited to:
 algebraic specification
 other approaches to formal specification
 specification languages and methods
 term rewriting and proof systems
 specification development systems (concepts, tools, etc.)
The workshop will provide an opportunity to present recent and ongoing
work, to meet colleagues, and to discuss new ideas and future trends.
The workshop will start with a full day tutorial on CoFI, the Common
Framework Initiative for algebraic specification and development of
software, see http://www.brics.dk/Projects/CoFI. This tutorial will
also be available to people who do not wish to participate in the rest
of the workshop. Besides the tutorial, there will be CoFI Task Group
meetings and presentation on related topics during the workshop.
The workshop will be a satellite event of the European Joint Conferences
on Theory and Practice of Software (ETAPS2001).
Special deals will be available for participants wishing to attend
WADT/CoFI 2001 together with other events of ETAPS.
More information on ETAPS is available at
http://www.disi.unige.it/etaps2001/
Submissions
===========
The scientific programme of the workshop will include up to about 30
presentations of recent results and ongoing research. The presentations
will be selected according to originality, significance, and general
interest, on the basis of submitted abstracts. The selection committee
consists of the WADT Steering Committee together with the local organizers
(listed below).
The abstracts must be in pdf (or standard postscript) format, up to two
pages long in the style for publication in Lecture Notes in Computer
Science (see http://www.springer.de/comp/lncs/authors.html), and should
be sent by email to wadt2001 [at] disi [dot] unige.it.
The deadline for submission of abstracts is
10 January, 2001.
Abstracts that substantially depart from the required format, style or
length may be rejected without consideration.
The final versions of the selected abstracts (due by 26 February) will be
made available on the workshop web page, and included in a handout for
the workshop participants.
After the workshop, selected authors will be invited to submit full
papers for the refereed proceedings, which is expected to be published
as a volume of Springer Lecture Notes in Computer Science
(http://www.springer.de/comp/lncs/).
Location
========
WADT/CoFI 2001 will be held in Genova.
Information are also be available on the web at the page
http://www.disi.unige.it/wadt2001/
**********************************************************************
************************** Important Dates ***************************
**********************************************************************
* Deadline for abstracts: 10 January, 2001 *
* Notification sent to authors: 26 January, 2001 *
* Final abstract due: 26 February, 2001 *
* Workshop dates: 13 April, 2001 *
**********************************************************************
WADT Steering Committee
=======================
Michel Bidoit (Cachan, France)
HansJoerg Kreowski (Bremen, Germany)
Peter Mosses, chair (Aarhus, Denmark)
Fernando Orejas (Barcelona, Spain)
Francesco ParisiPresicce (Rome, Italy)
Donald Sannella (Edinburgh, Scotland)
Andrzej Tarlecki (Warsaw, Poland)
Sponsors
========
The workshop is organized by IFIP WG1.3 (Foundations of System
Specification) jointly with CoFI WG.
Local Organizers
================
Maura Cerioli Gianna Reggio
DISI
Universita' degli Studi di Genova
Genova  Italy
Email: wadt2001 [at] disi [dot] unige.it

From ownerreliable_computing [at] interval [dot] usl.edu Fri Sep 29 15:43:08 2000
Received: (from root@localhost)
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) id PAA03421
for reliable_computingoutgoing; Fri, 29 Sep 2000 15:43:08 0500 (CDT)
Received: from lukla.Sun.COM (lukla.Sun.COM [192.18.98.31])
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) with ESMTP id PAA03416
for ; Fri, 29 Sep 2000 15:43:03 0500 (CDT)
Received: from engmail3.Eng.Sun.COM ([129.144.170.5])
by lukla.Sun.COM (8.9.3+Sun/8.9.3) with ESMTP id OAA24119
for ; Fri, 29 Sep 2000 14:43:01 0600 (MDT)
Received: from physmpkmaila (physmpkmaila.Eng.Sun.COM [129.146.1.131])
by engmail3.Eng.Sun.COM (8.9.3+Sun/8.9.3/ENSMAIL,v1.7) with ESMTP id NAA13689;
Fri, 29 Sep 2000 13:42:59 0700 (PDT)
Received: from gww (gww.Eng.Sun.COM [129.146.78.116])
by mpkmail.eng.sun.com (iPlanet Messaging Server 5.0 (built Sep 6 2000))
with SMTP id <0G1O003S61JNDG [at] mpkmail [dot] eng.sun.com>; Fri,
29 Sep 2000 13:42:59 0700 (PDT)
Date: Fri, 29 Sep 2000 13:43:07 0700 (PDT)
From: William Walster
Subject: Re: Rohn at Scan 2000
To: reliable_computing [at] interval [dot] louisiana.edu
Cc: bill.walster [at] eng [dot] sun.com
Replyto: William Walster
Messageid: <0G1O003S71JNDG [at] mpkmail [dot] eng.sun.com>
MIMEversion: 1.0
XMailer: dtmail 1.3.0 @(#)CDE Version 1.4.2 SunOS 5.8 sun4u sparc
Contenttype: TEXT/plain; charset=usascii
Contenttransferencoding: 7BIT
ContentMD5: CkC20OwaSZJTb2mHBhGqiA==
Sender: ownerreliable_computing [at] interval [dot] usl.edu
Precedence: bulk
Baker had requested a report on
Scan 2000
GAMM  IMACS International Symposium on Scientific
Computing, Computer Arithmetic, and Validated Numerics
Interval 2000
International Conference on Interval Methods in Science
and Engineering
held jointly in Karlsruhe, September 1822, 2000
I attended as many of the talks on applications as possible. I was
impressed with their number and variety. We need to do whatever is
required to develop as many of these and other application opportunities
into real interval "Success Stories" and commercial products.
Regards to all,
Bill Walster
G. William (Bill) Walster, Ph.D.
Interval Technology Engineering Manager
Sun Microsystems, Inc.
16 Network Circle, MS UMPK16304
Menlo Park, CA 94025
(650) 7869004 Direct
(650) 7869551 Fax
(800) 7598888 Pager PIN 1712423
bill.walster [at] eng [dot] sun.com
From ownerreliable_computing [at] interval [dot] usl.edu Sat Sep 30 19:34:19 2000
Received: (from root@localhost)
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) id TAA04987
for reliable_computingoutgoing; Sat, 30 Sep 2000 19:34:18 0500 (CDT)
Received: from kleene.math.wisc.edu (kleene.math.wisc.edu [144.92.166.90])
by interval.usl.edu (8.9.1/8.9.1/intervalmathmajordomo1.0) with ESMTP id TAA04982
for ; Sat, 30 Sep 2000 19:33:39 0500 (CDT)
Received: from bing.math.wisc.edu (bing.math.wisc.edu [144.92.166.133])
by kleene.math.wisc.edu (8.9.3/8.9.3) with SMTP id TAA26131;
Sat, 30 Sep 2000 19:23:00 0500 (CDT)
Date: Sat, 30 Sep 2000 19:22:43 0500 (CDT)
From: Hans Schneider
To: NETS  atnet ,
"Hershkowitz, Danny  Hershkowitz Daniel" ,
Danny Hershkowitz ,
ELETTER ,
"na.digest" , ipnetdigest [at] math [dot] msu.edu,
wim@belllabs.com, hjt [at] eos [dot] ncsu.edu, vkm [at] eedsp [dot] gatech.edu,
reliable_computing [at] interval [dot] louisiana.edu
Subject: LAA contents
MessageID:
MIMEVersion: 1.0
ContentType: TEXT/PLAIN; charset=USASCII
Sender: ownerreliable_computing [at] interval [dot] usl.edu
Precedence: bulk

Hans Schneider hans [at] math [dot] wisc.edu.
Department of Mathematics 6082621402 (Work)
Van Vleck Hall 6082717252 (Home)
480 Lincoln Drive 6082638891 (Work FAX)
University of WisconsinMadison 6082718477 (Home FAX)
Madison WI 53706 USA http://www.math.wisc.edu/~hans (URL)

Dear Net Organizer:
Please circulate the attached LAA contents over your net.
Thanks
hans
**************************
ContentsDirect from Elsevier Science
=====================================
Journal: Linear Algebra and its Applications
ISSN : 00243795
Volume : 318
Issue : 13
Date : 15Oct2000
NOTE:
ContentsDirect, which is automatically generated, lists the first author
of each paper and the corresponding author (if different).
Please note that only subscribers can access full text and abstracts
through the provided URLs.
Visit the journal at http://www.elsevier.nl/locate/jnlnr/07738
pp 121
Description of the subMarkov kernel associated to generalized
ultrametric matrices. An algorithmic approach
C. Dellacherie, S. Martnez, J. San Martn
http://www.elsevier.nl/PII/S0024379500001932
pp 2333
A characterization of convex cones of matrices with constant regular
inertia
N. Cohen, I. Lewkowicz
http://www.elsevier.nl/PII/S0024379500001269
pp 3544
MoorePenrose inverse of set inclusion matrices
R.B. Bapat
http://www.elsevier.nl/PII/S0024379500001233
pp 4552
The algebraic properties of the generalized Pascal functional
matrices associated with the exponential families
X. Zhao, T. Wang
http://www.elsevier.nl/PII/S0024379500001324
pp 5377
The equivalence structure of descriptor representations of systems
with possibly inconsistent initial conditions
U. Baser, J.M. Schumacher
http://www.elsevier.nl/PII/S0024379500001579
pp 7986
On two questions about quaternion matrices
L. Huang
http://www.elsevier.nl/PII/S0024379500001543
pp 87107
Complementary inequalities to inequalities of Jensen and Ando based
on the MondPecaric method
J. Micic, J. Pecaric, Y. Seo
http://www.elsevier.nl/PII/S0024379500001609
pp 109116
Cartesian decompositions and Schatten norms
R. Bhatia, F. Kittaneh
http://www.elsevier.nl/PII/S0024379500002068
pp 117126
Single elements of matrix incidence algebras
W.E. Longstaff, O. Panaia
http://www.elsevier.nl/PII/S0024379500001658
pp 127144
Partial realization for singular systems in standard form
S. Feldmann, G. Heinig
http://www.elsevier.nl/PII/S0024379500001646
pp 145172
Symmetric failures in symmetric control systems
R. Tanaka, K. Murota
http://www.elsevier.nl/PII/S0024379500001610
pp 173179
A note on affine toric varieties
E. Reyes, R.H. Villarreal, L. Zarate
http://www.elsevier.nl/PII/S002437950000166X
pp 181193
Weak crossed products and a generalisation of a result of Sarason
M.R. Alaimia
http://www.elsevier.nl/PII/S0024379500001695
pp 195208
Systems of linear congruences with individual moduli
D.C. Torney, J. Wang
http://www.elsevier.nl/PII/S0024379500001737
pp 209225
Solution of infinite linear systems by automatic adaptive iterations
P. Favati, G. Lotti, O. Menchi, F. Romani
http://www.elsevier.nl/PII/S0024379500001774
pp 227
Index
