From owner-reliable_computing Thu Oct 2 07:43:25 1997
Received: by interval.usl.edu id AA02482
(5.65c/IDA-1.4.4 for reliable_computing-outgoing); Thu, 2 Oct 1997 10:44:20 -0500
Received: from pilot18.cl.msu.edu by interval.usl.edu with SMTP id AA02476
(5.65c/IDA-1.4.4 for ); Thu, 2 Oct 1997 10:44:12 -0500
Received: from chopin.nscl.msu.edu (chopin.nscl.msu.edu [35.8.33.83])
by pilot18.cl.msu.edu (8.7.5/MSU-2.10)
id LAA112110; Thu, 2 Oct 1997 11:43:35 -0400
Received: by chopin.nscl.msu.edu with Microsoft Mail
id <01BCCF28.6BCD7640 [at] chopin [dot] nscl.msu.edu>; Thu, 2 Oct 1997 11:43:37 -0400
Message-Id: <01BCCF28.6BCD7640 [at] chopin [dot] nscl.msu.edu>
From: Martin Berz
To: "'meyerhog [at] bc [dot] edu'" ,
"'stolfi [at] dcc [dot] unicamp.br'"
Cc: "'reliable_computing [at] interval [dot] usl.edu'"
Subject: RE: question on interval arithmetic
Date: Thu, 2 Oct 1997 11:43:25 -0400
Encoding: 76 TEXT
Sender: owner-reliable_computing
Precedence: bulk
> 1.) Taylor Series: We replaced each of our functions (defined on a
> small 3-complex-dimensional region) by its first-order Taylor series
> approximation with remainder term (on the region). At this point let
us
> ignore round-off error. Our method for rigorously handling the
> remainder term is to prove "combination formulas" for simple
functions
> (+, -,*, /, sq.rt.). That is, given a Taylor series approximation
with
> remainder term for two functions f and g (defined on the same
region),
> we can use our combination formulas to get a Taylor series
approximation
> with remainder term for f+g, f-g, f*g, and so on. These combination
> formulas give us enough power to build up all the functions that we
> need.
>
Indeed this seems to be very related to Hansen's "Generalized Interval
Arithmetic" and "Affine Arithmetic" and can provide sharpness levels that
decrease quadratically. We have recently used extensions to very high or
ders and many variables; through a combination of moving round-off control
to the remainder, techniques for polynomial bounding, and tricks for
intrinsic functions, the resulting increase in sharpness of the resulting
bounds can be quite dramatic. Since the bulk of the functional dependencies
is always kept in the Taylor polynomial, often blow-up can be controlled
remarkably well. In many variables, an additional advantage materializes as
the complexity increases much more modestly than in conventional interval
approaches since the number of Taylor coefficients of order n in v
variables only grows as (n+v)!/(n! v!).
The method is described in the next issue of Reliable Computing
author = "M. Berz and G. Hoffst{\"a}tter",
title = "Computation and Application of {T}aylor Polynomials with
Interval Remainder Bounds",
journal = "Reliable Computing",
volume = "4",
pages = "1-16"
year = "1998"}
and also in
author = "K. Makino and M. Berz",
title = "Remainder Differential Algebras and their Applications",
journal = "in: Computational Differentiation: Techniques, Applications,
and Tools, M. Berz, C. Bischof, G. Corliss, A. Griewank
(Eds.)",
volume = "SIAM",
address = "Philadelphia",
year = "1996"}
The methods have been applied to some rather nasty six dimensional
optimization problems from dynamical systems theory which were untractable
with conventional verified global optimizers because of blow-up:
author = "M. Berz and G. Hoffst{\"a}tter",
title = "Exact bounds of the long term stability
of weakly nonlinear systems
applied to the design of large storage rings",
journal = "Interval Computations",
volume = "2",
pages = "68-89",
year = "1994"}
Recently we have been able to use them beneficially to generate a family of
verified high-order integrators (publications forthcoming); operating at
time-step orders of typically between five and fifteen, the suppression of
blow-up leads to a rather far-reaching control of the so-called wrapping
effect.
Martin Berz
From owner-reliable_computing Fri Oct 3 16:06:37 1997
Received: by interval.usl.edu id AA03191
(5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 3 Oct 1997 07:08:36 -0500
Received: from hera.cwi.nl ([192.16.191.1]) by interval.usl.edu with SMTP id AA03185
(5.65c/IDA-1.4.4 for ); Fri, 3 Oct 1997 07:08:26 -0500
Received: from spits.cwi.nl (spits.cwi.nl [192.16.196.142]) by hera.cwi.nl with ESMTP
id OAA29303 for ; Fri, 3 Oct 1997 14:06:39 +0200 (MET DST)
Received: from localhost by spits.cwi.nl with ESMTP
id OAA14843; Fri, 3 Oct 1997 14:06:38 +0200 (MET DST)
Message-Id:
X-Mailer: exmh version 1.6.9 8/22/96
To: reliable_computing [at] interval [dot] usl.edu
Subject: interval constraints for animation
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Date: Fri, 03 Oct 1997 14:06:37 +0200
From: Zs`ofia Ruttkay
Sender: owner-reliable_computing
Precedence: bulk
Dear Colleagues,
Do you know of applications of interval arithmetics/constraints for animation?
Thanks for your help,
Zsofi Ruttkay
============================================================================
Dr. Zsofia Ruttkay tel:31-20-592 4144
CWI - Centrum voor Wiskunde en Informatica fax:31-20-592 4199
Kruislaan 413 POBox 94079 e-mail: zsofi [at] cwi [dot] nl
1090 GB Amsterdam url: http://www.cwi.nl/~zsofi/
From owner-reliable_computing Fri Oct 3 02:13:16 1997
Received: by interval.usl.edu id AA03551
(5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 3 Oct 1997 09:41:04 -0500
Received: from cs.utep.edu by interval.usl.edu with SMTP id AA03545
(5.65c/IDA-1.4.4 for ); Fri, 3 Oct 1997 09:40:27 -0500
Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1)
id AA00515; Fri, 3 Oct 97 08:13:16 MDT
Date: Fri, 3 Oct 97 08:13:16 MDT
From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich)
Message-Id: <9710031413.AA00515 [at] cs [dot] utep.edu>
To: reliable_computing [at] interval [dot] usl.edu, Zsofia.Ruttkay [at] cwi [dot] nl
Subject: Re: interval constraints for animation
Sender: owner-reliable_computing
Precedence: bulk
> Dear Colleagues,
>
> Do you know of applications of interval arithmetics/constraints for animation?
>
> Thanks for your help,
>
> Zsofi Ruttkay
@INPROCEEDINGS{i:Snyder93a,
ANNOTE = "*USA,computer graphics,animation",
AUTHOR = "John M. Snyder and Adam R. Woodbury",
TITLE = "Interval methods for multi-point collision between
time-dependent curved surfaces",
PAGES = "321-334",
BOOKTITLE = "20th Annual SIGGRAPH Computer Graphics Proceedings",
PUBLISHER = "ACM SIGGRAPH",
ADDRESS = "Anaheim, CA",
MONTH = "1.-6.~" # aug,
YEAR = 1993
}
@InProceedings{duff92a,
author = "Tom Duff",
title = "Interval arithmetic and recursive subdivision for
implicit functions and constructive solid geometry",
pages = "131--138",
journal = "Computer Graphics (SIGGRAPH '92 Proceedings)",
volume = "26",
number = "2",
year = "1992",
month = jul,
editor = "Edwin E. Catmull",
conference = "held in Chicago, Illinois; 26-31 July 1992",
keywords = "antialiasing, compositing, computer-aided animation,
recursive subdivision, image synthesis, dynamic
simulation, collision detection",
annote = "",
}
@InCollection{muller-1988-time,
author = "H. M{\"u}ller",
title = "Time coherence in computer animation by ray tracing",
booktitle = "Computational Geometry and its Applications",
series = "Lecture Notes in Computer Science",
volume = "333",
publisher = "Springer-Verlag",
year = "1988",
pages = "187--201",
keywords = "design of algorithms, computer graphics, rays,
interval trees",
oldlabel = "geom-2116",
}
@PhdThesis{MIT/LCS/TR-61,
author = "R. M. Baeker",
title = "{INTERACTIVE} {COMPUTER}-{MEDIATED} {ANIMATION}",
school = "MIT Laboratory for Computer Science",
type = "Ph.{D}. Thesis",
number = "MIT/LCS/TR-61",
pages = "350",
month = jun,
year = "1969",
price = "USD 30.00",
keywords = "computer animation, computer graphics, interactive
graphics",
abstract = "The use of interactive computer graphics in the
construction of animated visual displays is
investigated. In interactive computer-mediated
animation, movies are formed from direct console
commands, algorithms, free-hand sketches, and real-time
actions (such as mimicking a movement or rhythm with a
stylus or a push-button). The resulting movies can be
immediately viewed and altered. In picture-driven
animation, the animator may sketch and refine (1)
static images to be used as components of individual
frames of the movie, and (2) static and dynamic images
that represent movements and rhythm. These latter
pictures drive algorithms to generate dynamic displays.
Since each such picture determines critical parameters
of a sequence of frames, a single sketch or action
controls the dynamic behavior of an entire interval of
the movie. The dissertation also outlines the design of
a multi-purpose, open-ended, interactive Animation and
Picture Processing Language. APPL is a conversational
language which accepts free-hand sketches, real-time
actions, and actions and algorithms that control
interactive dynamic displays.",
}
These were specifically marked as animation-related, so I found them
easily, but there are many papers in which interval methods are used in
computer graphics, and I bet some of them talk about animation as
well.
Vladik
From owner-reliable_computing Fri Oct 3 06:55:25 1997
Received: by interval.usl.edu id AA03769
(5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 3 Oct 1997 09:55:40 -0500
Received: from pilot21.cl.msu.edu by interval.usl.edu with SMTP id AA03762
(5.65c/IDA-1.4.4 for ); Fri, 3 Oct 1997 09:55:37 -0500
Received: from chopin.nscl.msu.edu (chopin.nscl.msu.edu [35.8.33.83])
by pilot21.cl.msu.edu (8.7.5/MSU-2.10)
id KAA83750; Fri, 3 Oct 1997 10:55:34 -0400
Received: by chopin.nscl.msu.edu with Microsoft Mail
id <01BCCFEA.DC276F00 [at] chopin [dot] nscl.msu.edu>; Fri, 3 Oct 1997 10:55:28 -0400
Message-Id: <01BCCFEA.DC276F00 [at] chopin [dot] nscl.msu.edu>
From: Martin Berz
To: "'Reliable Computing'"
Subject: Book on Computational Differentiation
Date: Fri, 3 Oct 1997 10:55:25 -0400
Encoding: 14 TEXT
Sender: owner-reliable_computing
Precedence: bulk
Dear Colleagues in Reliable Computing,
I would like to bring to your attention the following book
Computational Differentiation: Techniques, Applications, and Tools
M. Berz, C. Bischof, G. Corliss and A. Griewank (Eds.)
SIAM, ISBN 0-89871-385-4
List Price $65.00 / SIAM Member Price $52.00 / Order Code PR89
http://www.siam.org/catalog/mcc07/berz.htm
Its goal is to give a comprehensive overview about the state of the art in
computational differentiation. It is based on selected papers from the SIAM
Workshop on Computational Differentiation in Santa Fe in February of 1996,
and also contains special introductory and reference chapters.
From owner-reliable_computing Tue Oct 7 19:01:24 1997
Received: by interval.usl.edu id AA06512
(5.65c/IDA-1.4.4 for reliable_computing-outgoing); Tue, 7 Oct 1997 13:58:54 -0500
Received: from mailimailo.univ-rennes1.fr by interval.usl.edu with SMTP id AA06501
(5.65c/IDA-1.4.4 for ); Tue, 7 Oct 1997 13:53:55 -0500
From: Marie-Francoise.Coste-Roy@univ-rennes1.fr
Received: from [129.20.24.243] (maths-mac-243.univ-rennes1.fr [129.20.24.243])
by mailimailo.univ-rennes1.fr (8.8.5/jtpda-5.2) with SMTP id RAA16478
; Tue, 7 Oct 1997 17:39:42 +0200 (MET DST)
Message-Id: <199710071539.RAA16478 [at] mailimailo [dot] univ-rennes1.fr>
X-Sender: costeroy [at] mailhost [dot] univ-rennes1.fr
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Date: Tue, 7 Oct 1997 18:01:24 +0100
To: distribution:; (see end of body)
Sender: owner-reliable_computing
Precedence: bulk
-konstanz.de,
kuechlin [at] informatik [dot] uni-tuebingen.de, gah [at] math [dot] umd.edu,
Laurent.Granvilliers [at] lifo [dot] univ-orleans.fr,
tolani [at] gradient [dot] cis.upenn.edu, jfinat [at] cpd [dot] uva.es,
J-M.Deshouillers@u-bordeaux2.fr, jvaniseg [at] ano [dot] univ-lille1.fr,
TangSimon [at] cuhk [dot] edu.hk, jadoming [at] gugu [dot] usal.es, real [at] obelix [dot] cica.es,
eroanes [at] fi [dot] upm.es, ajimenez [at] obelix [dot] cica.es, calderon [at] mizar [dot] us.es,
castro [at] algebra [dot] us.es, ibermejo [at] ull [dot] es, alsina [at] ma3 [dot] upc.es,
pgimenez [at] cpd [dot] uva.es, mtcastano [at] alcala [dot] es, frincon [at] sobrino [dot] eui.upm.es,
ccpzaalj [at] si [dot] ehu.es, villar [at] cica [dot] es, juan [at] siur [dot] unirioja.es,
metodo8 [at] zmat [dot] usc.es, llave [at] tere [dot] upc.es, jjortega [at] titan [dot] inf-cr.uclm.es,
montes [at] ma2 [dot] upc.es, freire [at] finisterrae [dot] dc.fi.udc.es,
lalamban [at] siur [dot] unirioja.es, elias [at] cerber [dot] mat.ub.es,
Gerlinde.Poechhacker [at] risc [dot] uni-linz.ac.at, reduce-forum [at] rand [dot] org,
reliable_computing [at] interval [dot] usl.edu, events [at] maplesoft [dot] com,
symbolicnet [at] mcs [dot] kent.edu, maple_group [at] daisy [dot] waterloo.edu,
jaa [at] maths [dot] bath.ac.uk, Acquistf [at] dm [dot] unipi.it, Palmeida [at] dma [dot] ulpgc.es,
calonso [at] aicvax [dot] aic.uniovi.es, Amoroso [at] dm [dot] unipi.it,
Anai [at] iias [dot] flab.fujitsu.co.jp, fbarkats [at] math [dot] unice.fr,
Becker [at] emmy [dot] mathematik.uni-dortmund.de, Carlos [at] src [dot] umd.edu,
ibermejo [at] ull [dot] es, bigatti [at] dima [dot] unige.it, Emilio [at] algebra [dot] us.es,
Broglia [at] dm [dot] unipi.it, \ bronstein [at] inf [dot] ethz.ch, cap [at] dima [dot] unige.it,
cardinal [at] cict [dot] fr, Carra [at] mathct [dot] cineca.it, castro [at] algebra [dot] us.es,
lceballos [at] ccucvx [dot] unican.es, Chardin [at] polytechnique [dot] fr, Dedieu [at] cict [dot] fr,
alidick [at] mate [dot] dm.uba.edu.ar, donati [at] math [dot] unice.fr,
Dubhashi@mpi-sb.mpg.de, Duursma [at] iml [dot] univ-mrs.fr, Dduval [at] cict [dot] fr,
evf10 [at] uk [dot] ac.cam.phx, ralff [at] mathematik [dot] su.se, galligo [at] math [dot] unice.fr,
pgimenez [at] puccini [dot] ujf-grenoble.fr, Giusti [at] ariana [dot] polytechnique.fr,
tgomez [at] marie [dot] polytechnique.fr, g_lopez [at] ccucvx [dot] unican.es,
gvega [at] ccucvx [dot] unican.es, Graebe [at] informatik [dot] uni-leipzig.d400.de,
gutierrez [at] ccucvx [dot] unican.es, heintz [at] ccucvx [dot] unican.es,
itenberg@univ-rennes1.fr, Kalkbrenner [at] math [dot] ethz.ch,
Kreuzer [at] vax1 [dot] rz.uni-regensburg.d400.de, krick [at] mate [dot] dm.uba.edu.ar,
Lickteig [at] leon [dot] cs.uni-bonn.de, zenon [at] athena [dot] di.uoa.gr,
Littelmann [at] urz [dot] unibas.ch, Hl [at] grenet [dot] fr, bartolo [at] sungt1 [dot] mat.ucm.es,
jma [at] ariana [dot] polytechnique.fr, Marinari [at] dima [dot] unige.it,
Marshall [at] snoopy [dot] usask.ca, martin [at] math [dot] tu-cottbus.de,
mmg [at] maths [dot] bath.ac.uk, Jean-Pierre.Merlet [at] sophia [dot] inria.fr,
moeller [at] numerik [dot] fernuni-hagen.de, pepe [at] upna [dot] es, montes [at] ma2 [dot] upc.es,
theomora [at] dima [dot] unige.it, Mourrain [at] sophia [dot] inria.fr, Niesi [at] dima [dot] unige.it,
Michael [at] emmy [dot] mathematik.uni-dortmund.de, Castro [at] algebra [dot] us.es,
thomas [at] mathematik [dot] uni-kl.de, olazabal [at] ccucvx [dot] unican.es,
doshea [at] mhc [dot] mtholyoke.edu, pardo [at] ccucvx [dot] unican.es,
Apark [at] eecs [dot] berkeley.edu, Franz.Pauer [at] uibk [dot] ac.at, paul [at] cs [dot] cornell.edu,
Petitjea [at] loria [dot] fr, Piras [at] vaxca1 [dot] unica.it, Pilar [at] algebra [dot] us.es,
Pottier [at] sophia [dot] inria.fr, recio [at] ccucvx [dot] unican.es, rioboo [at] litp [dot] ibp.fr,
robbiano [at] dima [dot] unige.it, costeroy@univ-rennes1.fr,
ruiz_velasco [at] ccucvx [dot] unican.es, Sander [at] emmy [dot] mathematik.uni-dortmund.de,
santos [at] ccucvx [dot] unican.es, hannes [at] mathematik [dot] uni-kl.de,
schmid [at] emmy [dot] mathematik.uni-dortmund.de, sem [at] dma [dot] epfl.ch,
siebert [at] mathematik [dot] hu-berlin.de, saugata [at] dopey [dot] cs.nyu.edu,
nstolfi [at] math [dot] unice.fr, Aviva [at] math [dot] univ-paris13.fr,
trujillo [at] ccucvx [dot] unican.es vaneff [at] phys [dot] uva.nl,
susivaz [at] bosque [dot] sdi.uam.es, pvelez [at] sungt1 [dot] mat.ucm.es, ibermejo [at] ull [dot] es,
Warou [at] emmy [dot] univ-rennes1.fr, thorsten [at] emmy [dot] mathematik.uni-dortmund.de,
Yak [at] cict [dot] fr, yger [at] ceremab [dot] u-bordeaux.fr, singer [at] unity [dot] ncsu.edu,
shub [at] watson [dot] ibm.com, de [at] msri [dot] org, a.iserles [at] damtp [dot] cam.ac.uk
From: Marie-Francoise.Coste-Roy@univ-rennes1.fr
Subject: Mega 98, first anouncement
Sorry for multiple mail if any
Marie-Francoise Roy,
\def\ce#1{\centerline{#1}}
\font\granbc=cmbx10 scaled \magstep5
\font\granbu=cmbx10 scaled \magstep1
\font\granbd=cmbx10 scaled \magstep2
\font\granu=cmr10 scaled \magstep1
\nopagenumbers
\hoffset=-1.2cm
\hsize=18.3cm
\vsize=25cm
\ce{{\granbd First Announcement and Call for Papers}}
\bigskip
\ce{\granbc MEGA 98}
\bigskip\medskip
\ce {\granbu The Fifth International Symposium on}
\smallskip
\ce{\granbu Effective Methods in Algebraic Geometry}
\smallskip
\ce{\granbu Universit\'e de Rennes, Saint Malo (France ), June 22--27, 1998}
\bigskip\bigskip
\ce{\granbu Conference Topics}
\medskip
{\narrower\smallskip\noindent Effective Methods and Theoretical and Practical
Complexity Issues
in:
Commutative Algebra, Geometry, Real Geometry, Algebraic
Number Theory, Algebraic Geometry and
related fields: Algebraic Analysis of Differential
Equations, Differential Geometry, Associative Algebras, Group Theory,
Algebraic Groups and Lie Algebras,
Algebraic and Differential Topology,
as well as applications of these fields.\smallskip}
\bigskip\bigskip
\ce {\granbu Conference Committee}
\medskip
{\narrower\smallskip\noindent
A.M.~Cohen (Eindhoven),
J.H.~Davenport (Bath),
A.~Galligo (Nice),
D.~Yu.~Grigoriev (University Park / Saint Petersburg),
J.~Heintz (Santander/Buenos Aires),
D.~Lazard (Paris),
T.~Mora (Genova),
M.~Pohst (Berlin),
M.~van der Put (Groningen),
T.~Recio (Santander),
M.--F.~Roy (Rennes, chairwoman),
B.~Sturmfels (Berkeley/Kyoto),
C.~Traverso (Pisa). \smallskip}
\bigskip
\ce{\granbu Submissions}
\medskip
\noindent
Authors can submit papers by sending
five printed copies of the full paper,
including an
abstract on a single (separate) page.
An electronic form of the abstract also should be sent to
{\tt
mega98@univ-rennes1.fr}; this is
not necessary if the author has no e-mail address.
If moreover the authors can provide \TeX sources (plain \TeX, \LaTeX,
\AmSTeX), or a .dvi, or a postscript version, please send it to
mega98@univ-rennes1.fr. This might speed the refereeing.
Submissions must be sent {\bf before February
16, 1998}, to {\bf M.-F. Roy} (IRMAR Campus de Beaulieu 35042 Rennes cedex
France). Late submissions will
risk rejection without consideration.
\item - {\bf English} is the only official language
of the Symposium.
\item - Submission of essentially the
same paper elsewhere is not allowed.
\item - Submissions will be refereed
both for presentation at the Symposium and for inclusion in a volume
of
accepted papers to be published after the Symposium.
\smallskip\noindent
Accepted papers will be published as a special issue of the {\it Journal of
Pure and
Applied Algebra\/}. Authors will be notified about acceptance or
rejection of their submissions by the middle of {\bf May, 1998}. Details about
submittance of final versions of accepted papers will be given later.
\bigskip
\ce{\granbu Logistics}
\medskip
\noindent The Symposium will be held at Saint Malo, near Rennes, France.
Further information about
registration, lodging and travelling will be found in the
final announcement. For general information on the
Symposium, please send mail to contact {\tt
mega98@univ-rennes1.fr}.
>From october 1997, information about Mega 98 will be found in
{\tt http://www.maths.univ-rennes1.fr/\~{}mega98/}.
\bigskip\bigskip
\end
%%% overflow headers %%%
To: ja [at] vand [dot] physto.se, apel [at] informatik [dot] uni-leipzig.dbp.de,
joeb [at] candida [dot] matematik.su.se, rjb [at] maths [dot] bath.ac.uk,
ferro [at] mathct [dot] cineca.it, ian [at] spirit [dot] nada.kth.se, marc [at] cwi [dot] nl,
jag [at] wfw [dot] wtb.tue.nl, mcd [at] maths [dot] bath.ac.uk, feng [at] spirit [dot] nada.kth.se,
krister [at] isy [dot] liu.se, inge [at] nada [dot] kth.se,
hagel [at] informatik [dot] uni-tuebingen.de, havas [at] cs [dot] uq.oz.au, heck [at] can [dot] nl,
hietarin [at] utu [dot] fi, wilmers@tu-harburg.dbp.de, olli@uni-paderborn.de,
lassner [at] informatik [dot] uni-leipzig.dbp.de, ahml [at] sci [dot] kun.nl, bertl [at] can [dot] nl,
mathieu [at] supercrypt [dot] cs.uni-sb.de, monagan [at] inf [dot] ethz.ch, mago [at] lut [dot] ac.uk,
w.oevel [at] lut [dot] ac.uk, rimey [at] hutcs [dot] cs.hut.fi, roelofs [at] math [dot] utwente.nl,
roth [at] cs [dot] uni-sb.de, joachim [at] math [dot] uni-sb.de, schoepf [at] sc [dot] zib-berlin.de,
schrufer [at] gmdzi [dot] gmd.de, schupi [at] math9 [dot] uni-bielefeld.de, fcano [at] cpd [dot] uva.es,
aroca [at] cpd [dot] uva.es, campillo [at] cpd [dot] uva.es, tena [at] cpd [dot] uva.es,
jahermida [at] cpd [dot] uva.es, jmdominguez [at] cpd [dot] uva.es, jfinat [at] cpd [dot] uva.es,
jguemes [at] cpd [dot] uva.es, anunez [at] cpd [dot] uva.es, sanchezgiral [at] cpd [dot] uva.es,
fdelgado [at] cpd [dot] uva.es, aquiros [at] emduam11 [dot] bitnet, euro [at] cica [dot] es,
piedra [at] cica [dot] es, macarro [at] cica [dot] es, asevilla [at] ugr [dot] es, riscos [at] cica [dot] es,
miro [at] cc [dot] unizar.es, eaznar [at] ugr [dot] es, illovet [at] alcala [dot] es,
graa36 [at] udcf [dot] gla.ac.uk, wolfram [at] math [dot] fu-berlin.de, ahml [at] sci [dot] kun.nl,
mm [at] qmw [dot] ac.uk, rubio [at] cc [dot] unizar.es, salvy [at] inria [dot] inria.fr,
sendrier [at] loki [dot] inria.fr, sergerar [at] imag [dot] fr, shih [at] poly [dot] polytechnique.fr,
stolo [at] mistral [dot] imag.fr, avb [at] posso [dot] ibp.fr, vallee [at] geocub [dot] greco-prog.fr,
lvallier [at] blizzard [dot] imag.fr, zimmerma [at] inria [dot] inria.fr,
aweil [at] poly [dot] polytechnique.fr, neubuese [at] samson [dot] math.rwth-aachen.de,
benno@uni-paderborn.de, waldemar@uni-paderborn.de,
ghgonnet [at] daisy [dot] waterloo.edu, gastel [at] can [dot] nl,
kogeddes [at] watmum [dot] uwaterloo.ca, bmt [at] watson [dot] ibm.com,
smwatt [at] watson [dot] ibm.com, cfw2 [at] rabbit [dot] INS.CWRU.Edu,
chandru [at] ecn [dot] purdue.edu, vasconce [at] math [dot] rutgers.edu,
kollar [at] math [dot] utah.edu, EISENBUD [at] binah [dot] cc.brandeis.edu,
caviness [at] udel [dot] edu, kapur [at] albanycs [dot] albany.edu,
loustaunau [at] portal [dot] gmu.edu, lomonaco [at] algol [dot] cs.umbc.edu,
jjohnson [at] mcs [dot] drexel.edu, dab [at] entwood [dot] math.columbia.edu,
ufn [at] maths [dot] lth.se, Markus.Wiegelmann [at] Math [dot] RWTH-Aachen.DE,
gcn [at] sma [dot] usna.navy.MIL, malaschonok@math-iu.tambov.su, jupe [at] wmrel [dot] co.uk,
cipu [at] ictp [dot] trieste.it, pfister [at] hubinf [dot] informatik.hu-berlin.de,
hgrass [at] hubinf [dot] informatik.hu-berlin.de,
algebra [at] hubinf [dot] informatik.hu-berlin.de, pohl [at] mathematik [dot] uni-kl.de,
hannes [at] mathematik [dot] uni-kl.de, thomas [at] mathematik [dot] uni-kl.de,
wneumann [at] vnet [dot] ibm.com, stobbe [at] mathematik [dot] uni-kl.de,
mueller [at] mathematik [dot] uni-kl.de, decker [at] math [dot] uni-sb.de,
michael [at] mathematik [dot] uni-kl.de, altmann [at] hubinf [dot] informatik.hu-berlin.de,
klein [at] mathematik [dot] uni-kl.de, gerik [at] mathematik [dot] uni-kl.de,
ctcw [at] uxb [dot] liv.ac.uk, siersma [at] math [dot] ruu.nl,
sabbah [at] orphee [dot] polytechnique.fr, MATADP [at] galadriel [dot] mi.aau.dk,
teissier [at] dmi [dot] ens.fr, eurosing [at] aurora [dot] unice.fr,
mond [at] maths [dot] warwick.ac.uk, jpb [at] cirm4 [dot] univ-mrs.fr,
ragnar [at] banks [dot] scar.utoronto.ca, christop [at] smaug [dot] uio.no,
pla_kbh@pki-nbg.philips.de, jwbruce [at] uxb [dot] liv.ac.uk, tdejong [at] sci [dot] kun.nl,
maisonob [at] aurora [dot] unice.fr, wirthm [at] mathematik [dot] uni-kl.de,
popescu [at] cfgauss [dot] uni-math.gwdg.de, miles [at] maths [dot] warwick.ac.uk,
gs [at] statlab [dot] uni-heidelberg.de, caprasse [at] vm1 [dot] ulg.ac.be, brian [at] nag [dot] co.uk,
greuel%mathematik.uni-kl.de.larsl [at] nada [dot] kth.se, laksov [at] nada [dot] kth.se,
gmat2sap [at] auadec [dot] aua.ariadne-t.gr, jfc [at] cs [dot] berkeley.edu,
pierre.verlinden [at] cs [dot] kuleuven.ac.be,
Aleksej.Uteschew [at] risc [dot] uni-linz.ac.at, edneral [at] theory [dot] npi.msu.su,
kovacs [at] cs [dot] tu-berlin.de, Luc.Tancredi [at] sophia [dot] inria.fr,
vdhoeven [at] lix [dot] polytechnique.fr, gerdt [at] jinr [dot] dubna.su,
vlad [at] d105 [dot] icyb.kiev.ua, afleg [at] iias [dot] spb.su, mtsendra [at] alcala [dot] es,
calonso [at] trasgu [dot] aic.uniovi.es, vicki [at] mathcs [dot] emory.edu,
crimmer [at] liverpool [dot] ac.uk, Maurice.Rojas@univ-rennes1.fr, dduval [at] cict [dot] fr,
vasiliev [at] ita [dot] spb.su, garloff [at] mail [dot] fh
%%% end overflow headers %%%
From owner-reliable_computing Tue Oct 7 09:55:25 1997
Received: by interval.usl.edu id AA06843
(5.65c/IDA-1.4.4 for reliable_computing-outgoing); Tue, 7 Oct 1997 14:55:27 -0500
Received: by interval.usl.edu id AA06833
(5.65c/IDA-1.4.4 for reliable_computing); Tue, 7 Oct 1997 14:55:25 -0500
Date: Tue, 7 Oct 1997 14:55:25 -0500
From: "Kearfott R. Baker"
Message-Id: <199710071955.AA06833 [at] interval [dot] usl.edu>
To: reliable_computing
Subject: Research Position in Computational Logic Available
Sender: owner-reliable_computing
Precedence: bulk
----- Begin Included Message -----
From: Thom Fruehwirth
Date: Tue, 7 Oct 97 10:09:03 +0100
To: Thom Fruehwirth
Subject: Research Position in Computational Logic Available
Cc: lp-internet [at] doc [dot] ic.ac.uk, eapls [at] mailbase [dot] ac.uk, clpr-users [at] iscs [dot] nus.sg,
ccl [at] dfki [dot] uni-sb.de, atp_alias [at] cs [dot] jcu.edu.au,
flp_ws_maillist [at] issan [dot] informatik.uni-dortmund.de,
alp-list [at] intellektik [dot] informatik.th-darmstadt.de, cclp.x [at] parc [dot] xerox.com,
clean-list [at] cs [dot] kun.nl, rewriting [at] loria [dot] fr, compunode [at] ecrc [dot] de,
quintus-users [at] quintus [dot] com, sicstus-users [at] sics [dot] se, life-users [at] cs [dot] sfu.ca,
clp [at] cis [dot] ohio-state.edu, flprog [at] informatik [dot] uni-muenchen.de,
lprolog [at] central [dot] cis.upenn.edu, gulp [at] di [dot] unipi.it,
g-ganzinger@mpi-sb.mpg.de, haskell [at] dcs [dot] gla.ac.uk,
fg121 [at] bach [dot] informatik.uni-ulm.de, idss [at] socs [dot] uts.edu.au,
igpl [at] doc [dot] ic.ac.uk, ikbs [at] caad [dot] ed.ac.uk, jicslp96 [at] informatik [dot] uni-bonn.de,
kr94 [at] mail2 [dot] ai.univie.ac.at, lics-email [at] cs [dot] indiana.edu,
lics [at] research [dot] bell-labs.com, linear [at] cs [dot] stanford.edu,
logic [at] theory [dot] lcs.mit.edu, lppnmr [at] cs [dot] engr.uky.edu, mlnet [at] swi [dot] psy.uva.nl,
mrg [at] itc [dot] it, nl-kr [at] cs [dot] rpi.edu, parforce [at] ecrc [dot] de,
prolia [at] tlxf [dot] geomail.org, prolog-pe [at] bach [dot] ces.cwru.edu,
prolog-vendors [at] sics [dot] se, prolog [at] mch [dot] sni.de, prolog [at] sunbim [dot] be,
reliable_computing [at] interval [dot] usl.edu, semantics-list [at] newton [dot] cam.ac.uk,
sgaico [at] cui [dot] unige.ch, skeletons [at] dcs [dot] ed.ac.uk,
theorem-provers [at] ai [dot] mit.edu, theory-a [at] vm1 [dot] nodak.edu,
theorynt [at] ndsuvm1 [dot] intellektik.informatik.th-darmstadt.de,
types [at] dcs [dot] glasgow.ac.uk, fg214 [at] informatik [dot] uni-kiel.d400.de
References: <199706251137.NAA05086 [at] phaethon [dot] pst.informatik.uni-muenchen.de>
Research Position in Computational Logic Available
(EC Training and Mobility of Researchers, Framework 4)
As part of our commitment to highly competitive research and
development in constraint reasoning and programming, applications are
invited for research positions at post-doctorate and also
post-graduate level in the field of Computational Logic at the
department of Computer Science, with an emphasis on (concurrent)
constraint (logic) programming, program analysis, synthesis and
transformation of constraint programs or agent based computing
utilizing constraint reasoning.
Researchers would be funded by the European Community under Marie
Curie Fellowships provided by the Training and Mobility of Researchers
(TMR) scheme of the Framework 4 programme for a maximum of 36 months
(post-grad) or 24 months (post-doc). Applicants must be nationals of
the European Union (except Germany), or an associated state (Iceland,
Israel, Lichtenstein, Norway, Switzerland), normally not older than
35.
More information about TMR Activity 3 Marie Curie Research Training
Grants you find at http://www.cordis.lu/tmr/src/grants1.htm which has
the following links:
Frequently Asked Questions http://www.cordis.lu/tmr/src/quest&an.htm
Information Package ftp://ftp.cordis.lu/pub/tmr/docs/rtg_971.doc
Application Form ftp://ftp.cordis.lu/pub/tmr/docs/rtg_971.doc
Evaluation Guide ftp://ftp.cordis.lu/pub/tmr/docs/tmr-eval.doc
More information on our activities in constraint reasoning and
programming you find at
http://www.pst.informatik.uni-muenchen.de/personen/fruehwir/cwg.html
Our department of computer science is located right at the "English
Garden", the huge gardens and woods along the river Isar passing right
through the city center. Wealthy Munich is Germanys High-Tech-capital
and largest academic city. Its surroundings feature pleasant lakes and
the Alps.
EMAIL YOUR APPLICATION (uuencoded compressed postscript file(s),
including a detailed CV, list of publications, references, sample
papers and project proposal or statement of research interests) to
Dr. Thom Fruehwirth .
The deadline for applications is November 6, 1997. Decisions will be
emailed by End of November. If you are selected, the deadline for
applications to reach the European Union is December 15, 1997.
Decisions are expected in May 1998. If accepted, starting date is
between June and December 1998.
Dr. Thom Fruehwirth
LMU (Ludwig-Maximilians-University Munich)
Department of Computer Science
Oettingenstr. 67, D-80538 Munich, Germany
Phone: +(49) 89 2178-2181, Fax: +(49) 89 2178-2175
----- End Included Message -----
From owner-reliable_computing Thu Oct 9 21:18:04 1997
Received: by interval.usl.edu id AA08184
(5.65c/IDA-1.4.4 for reliable_computing-outgoing); Thu, 9 Oct 1997 13:19:12 -0500
Received: from zmit1.ippt.gov.pl by interval.usl.edu with SMTP id AA08178
(5.65c/IDA-1.4.4 for ); Thu, 9 Oct 1997 13:19:07 -0500
Received: (from zkulpa@localhost) by zmit1.ippt.gov.pl (8.8.5/8.7.3-zmit) id UAA01948; Thu, 9 Oct 1997 20:18:04 +0100 (MET)
Date: Thu, 9 Oct 1997 20:18:04 +0100 (MET)
From: Zenon Kulpa
Message-Id: <199710091918.UAA01948 [at] zmit1 [dot] ippt.gov.pl>
To: reliable_computing [at] interval [dot] usl.edu
Subject: Singular Value Decomposition for interval matrices
Cc: zkulpa [at] zmit1 [dot] ippt.gov.pl
Sender: owner-reliable_computing
Precedence: bulk
I would like to know if there are any works on
a technique(s) similar to Singular Value Decomposition,
but applied to interval matrices, as well as works on
analysis and properties of linear interval systems of equations
with singular or near-singular matrices?
Works concerning only testing of singularity
of interval matrices are of less interest to me,
unless the testing method or its derivation addresses
significantly the issues described in the previous paragraph.
I would be grateful for any references
to papers, books, or WWW sites treating about
these matters.
Regards,
-- Zenon Kulpa
From owner-reliable_computing Fri Oct 10 12:52:32 1997
Received: by interval.usl.edu id AA08669
(5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 10 Oct 1997 03:53:54 -0500
Received: from mpi-sb.mpg.de (james1.mpi-sb.mpg.de) by interval.usl.edu with SMTP id AA08663
(5.65c/IDA-1.4.4 for ); Fri, 10 Oct 1997 03:53:48 -0500
Received: from twinpeaks.mpi-sb.mpg.de (twinpeaks.mpi-sb.mpg.de [139.19.3.9])
by mpi-sb.mpg.de (8.8.7/8.8.7) with ESMTP id KAA01043
for ; Fri, 10 Oct 1997 10:52:30 +0200 (MET DST)
Received: (from podelski@localhost)
by twinpeaks.mpi-sb.mpg.de (8.8.7/8.8.7) id KAA07404
for reliable_computing [at] interval [dot] usl.edu; Fri, 10 Oct 1997 10:52:32 +0200 (MET DST)
Date: Fri, 10 Oct 1997 10:52:32 +0200 (MET DST)
Message-Id: <199710100852.KAA07404 [at] twinpeaks [dot] mpi-sb.mpg.de>
From: Andreas Podelski
Subject: Third and Final Call for Participation - CP97
Apparently-To:
Sender: owner-reliable_computing
Precedence: bulk
CP97 will be an important event. Until today, we have received 160
registrations.
We apologize for multiple copies. Up-to-date information can be
found at the CP97 web site http://www.mpi-sb.mpg.de/conferences/CP97/.
CALL FOR PARTICIPATION
Third International Conference on Principles and Practice of
Constraint Programming (CP97)
Schloss Hagenberg, Austria, October 29 - November 1, 1997
Invited Speakers
Steven Minton: ``Configurable Solvers: Tailoring General Methods to
Specific Applications''
Pascal Van Hentenryck: ``A Modeling Language for Constraint Programming''
Tutorial Speakers
Yves Caseau: ``Complex scheduling problems that require complex resources
and travel''
Laurent Michel and Jean-Francois Puget: ``Interval methods for non linear
constraints''
Leszek Pacholski and Andreas Podelski: ``Set Constraints''
Workshops on October 27-28, preceding the Conference
FTP97 International Workshop on First-Order Theorem Proving
http://www.logic.tuwien.ac.at/FTP97/
COTIC 97 Concurrent Constraint Programming for Time Critical Applications
http://www.di.unipi.it/~gabbri/COTIC97.html
Annual workshop of the CompulogNet, area "Constraint Programming", joint
with the second meeting of the ERCIM working group on Constraints
http://pauillac.inria.fr/~codognet/cp97.html
CP97 Workshops on November 1, the last day of the Conference
Constraints and Bioinformatics/Biocomputing
http://www.soi.city.ac.uk/~drg/cp97-workshop.html
Constraint Reasoning on the Internet
http://www.pst.informatik.uni-muenchen.de/personen/fruehwir/wcicp97.html
The Theory and Practice of Dynamic Constraint Satisfaction
http://www-icparc.doc.ic.ac.uk/~hhe/dcsp_workshop.html
Industrial Constraint-directed Scheduling
http://www.ie.utoronto.ca/EIL/profiles/andrewd/cfp.html
Set Constraints and Constraint-based Program Analysis
http://www.mpi-sb.mpg.de/conferences/CP97/sets.html
Scope of the Conference
Constraints have emerged as the basis of a representational and
computational paradigm that draws from many disciplines and can
be brought to bear on many problem domains. The conference is
concerned with all aspects of computing with constraints including:
algorithms, applications, environments, languages, models, systems.
Conference Venue
CP97 will take place at Schloss Hagenberg, a medieval, renovated
castle close to Linz, Austria, known as the site of the Research
Institute for Symbolic Computation (RISC).
Registration and Local Arrangements
For registration, please fill out the registration form and the
hotel reservation form appended below, and send it by fax or email
to the address given there. The hotel reserved for conference
participants is the comfortable "Steigenberger MAXX" Hotel, located
quietly next to the Danube river in Linz. For particular questions
about local arrangements, please contact the CP97 Local
Arrangements Chair Betina Curtis, bcurtis [at] risc [dot] uni-linz.ac.at.
Papers
The proceedings will be published as Springer LNCS 1330; they
will be available at the conference.
Selected papers will appear in a special issue of the CONSTRAINTS
journal devoted to the conference.
Official Sponsors: Compulog, Ilog, Prologia, DFKI, MPI, RISC
Conference Organization
Conference Chair:
Bruno Buchberger (RISC)
Bruno.Buchberger [at] risc [dot] uni-linz.ac.at
Program Chair:
Gert Smolka (DFKI and Universitaet des Saarlandes)
smolka [at] ps [dot] uni-sb.de
Program Committee:
Franz Baader (RWTH Aachen)
Frederic Benhamou (University of Orleans)
Alex Brodsky (George Mason University)
Yves Caseau (Bouygues)
Hoon Hong (RISC)
John Hooker (CMU)
Joxan Jaffar (National University of Singapore)
Claude Kirchner (INRIA Lorraine and CRIN)
Michael Maher (Griffith University)
Kim Marriott (Monash University)
Dave McAllester (AT&T Research)
Ken McAloon (Brooklyn College)
Bernhard Nebel (University of Freiburg)
Tobias Nipkow (TU Muenchen)
Martin Odersky (TU Karlsruhe and University of South Australia)
Catuscia Palamidessi (University of Genova)
Andreas Podelski (Max-Planck-Institut fuer Informatik)
Jean-Francois Puget (ILOG)
Francesca Rossi (University of Pisa)
Thomas Schiex (INRA)
Bart Selman (AT&T Research)
Gert Smolka (DFKI and Universitaet des Saarlandes)
Peter J. Stuckey (University of Melbourne)
Edward Tsang (University of Essex)
Peter van Beek (University of Alberta)
Mark Wallace (ICL/Imperial College)
Publicity and Workshop Chair:
Andreas Podelski (Max-Planck-Institut fuer Informatik)
podelski@mpi-sb.mpg.de
Organizing Committee:
Alan Borning (University of Washington)
Alain Colmerauer (University of Marseille)
Eugene Freuder (University of New Hampshire)
Jean-Pierre Jouannaud (University of Paris Sud)
Jean-Louis Lassez (New Mexico Tech)
Ugo Montanari (University of Pisa)
Anil Nerode (Cornell University)
Vijay Saraswat (AT&T Research)
Pascal Van Hentenryck (Brown University)
Ralph Wachter (Office of Naval Research)
----------------------------------------------------------------------
Registration Form
Third International Conference on Principles and Practice of
CONSTRAINT PROGRAMMING (CP 97)
RISC, Castle of Hagenberg, Austria
October 29 - November 1, 1997
Personal Data:
Family Name:
First Name:
Affiliation:
Mailing Address:
Country:
e-mail:
Phone:
Fax:
Conference Registration fees:
Registration and payment Registration and payment
received by Sept. 19, 1997 received after Sept. 19, 1997
Regular* USD 420 USD 460
Students** USD 200 USD 240
Accompanying
Person *** USD 230 USD 270
Additional banquet ticket: USD 50 USD 50
For lunches etc.: o Vegetarian o Regular food
Payment:
Please choose one of the following. All payments must be made in US $.
o I have remitted the above total fee on . . . . . . . . . . .(Date)
to the account "CP97", No. 26203, Raiffeisenbank Hagenberg, BLZ: 34151,
A-4232 Hagenberg, Austria (Europe).
I add a copy of the transfer form to confirm the remittance.
o I add a bank cheque for the above total fee payable to the account
"CP97" No. 26203, Raiffeisenbank Hagenberg, BLZ: 34151,
A-4232 Hagenberg, Austria (Europe).
o I agree to remit above total fee by credit card
o American Express o Mastercard o VISA
Card Number:
Card holder's name:
Expiration Date:
Date: Authorized Signature:
Date
Signature
* Fee for regular participant includes: proceedings, refreshment breaks,
lunches (hors d'oeuvre, main meal, dessert, drink), conference
banquet, shuttle bus from conference hotel to the conference site and
back, shuttle bus to the restaurant for the conference dinner, guided
walk in the hilly area of the "Muehlviertel".
** Fee for students includes: proceedings, refreshment breaks,
lunches (hors d'oeuvre, main meal, dessert, drink), shuttle bus
from conference hotel to the conference site and back, guided walk
in the hilly area of the "Muehlviertel".
*** Fee for accompanying person includes: all conference sessions,
refreshment breaks, lunches (hors d'oeuvre, main meal, dessert,
drink), conference banquet, shuttle bus from conference hotel to
the conference site and back, shuttle bus to the restaurant for
the conference dinner, guided walk in the hilly area of the
"Muehlviertel".
Social programme for accompanying persons and guests (excursion to
Salzburg or Vienna) is planned. Please contact the conference office
(bcurtis [at] risc [dot] uni-linz.ac.at).
Please send the completed form by e-mail or fax or surface mail to:
Betina Curtis, RISC - Research Institute for Symbolic Computation
Schloss Hagenberg, A-4232 Hagenberg
Fax: +43(7236)323130
Tel.:+43(7236)323121
E-mail: bcurtis [at] risc [dot] uni-linz.ac.at
----------------------------------------------------------------------
Hotel Reservation Form
Third International Conference on Principles and Practice of
Constraint Programming (CP 97)
RISC, Castle of Hagenberg, Austria
October 29 - November 1, 1997
Name:
Affiliation
Address:
e-mail:
Phone:
Fax:
Accompanying Person(s):
Family Name: First Name:
I reserve as follows:
Arrival Date: Departure Date:
o single room ATS 890,- = about US $ 75,- per day/person
o double room ATS 550,- = about US $ 47,- per day/person
Included in the price:
Breakfast buffet, health club, shuttle service airport - hotel -
airport.
There is a small contingent of student rooms available. These
accommodations are secluded
and scattered over the region. If you want to reserve this
room-category, please contact the
local organizer Betina Curtis, e-mail: bcurtis [at] risc [dot] uni-linz.ac.at).
o I arrive by plane and need a shuttle service to the hotel:
Arrival time:
Flight from:
Flight number:
Please send the completed form by e-mail or fax or surface mail to:
Betina Curtis, RISC - Research Institute for Symbolic Computation
Schloss Hagenberg, A-4232 Hagenberg
Fax: +43(7236)323130
Tel.:+43(7236)323121
E-mail: bcurtis [at] risc [dot] uni-linz.ac.at
From owner-reliable_computing Fri Oct 10 19:08:00 1997
Received: by interval.usl.edu id AA09217
(5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 10 Oct 1997 10:18:46 -0500
Received: from animal.cs.chalmers.se by interval.usl.edu with SMTP id AA09211
(5.65c/IDA-1.4.4 for ); Fri, 10 Oct 1997 10:16:28 -0500
Received: from cs.chalmers.se (bengt [at] muppet0 [dot] cs.chalmers.se [129.16.226.11])
by animal.cs.chalmers.se (8.8.5/8.8.5) with ESMTP id RAA18068;
Fri, 10 Oct 1997 17:08:01 +0200 (MET DST)
Message-Id: <343E44D0.69615760 [at] cs [dot] chalmers.se>
Date: Fri, 10 Oct 1997 17:08:00 +0200
From: Bengt Nordstr|m
Organization: Dept. of CS, Chalmers, Sweden
X-Mailer: Mozilla 4.03 [en] (X11; I; SunOS 5.5.1 sun4m)
Mime-Version: 1.0
To: lics-email [at] cs [dot] indiana.edu, lics [at] research [dot] bell-labs.com,
logic [at] theory [dot] lcs.mit.edu,
theorynt [at] ndsuvm1 [dot] intellektik.informatik.th-darmstadt.de,
types [at] dcs [dot] gla.ac.uk, proof-sci [at] cs [dot] chalmers.se, proglog [at] cs [dot] chalmers.se
Cc: flprog [at] informatik [dot] uni-muenchen.de, haskell [at] dcs [dot] gla.ac.uk,
prolia [at] tlxf [dot] geomail.org, reliable_computing [at] interval [dot] usl.edu,
semantics-list [at] newton [dot] cam.ac.uk, skeletons [at] dcs [dot] ed.ac.uk,
theory-a [at] vm1 [dot] nodak.edu
Subject: Post Doc Position in Computing at Chalmers University, Goteborg, Sweden
References: <199706251137.NAA05086 [at] phaethon [dot] pst.informatik.uni-muenchen.de> <199710071353.IAA27032 [at] shovelnose [dot] cs.indiana.edu>
Content-Type: text/plain; charset=iso-8859-1
Content-Transfer-Encoding: quoted-printable
X-Mime-Autoconverted: from 8bit to quoted-printable by animal.cs.chalmers.se id RAA18068
Sender: owner-reliable_computing
Precedence: bulk
Postdoctoral position in Computer Science at Chalmers=20
-----------------------------------------------------
There is a vacant research position at Chalmers in Computer Science for
a period of four years starting in the beginning of next year. The
position is open for a young researcher with a Ph D.=20
The Computing Science department at Chalmers consists of around 30
researchers/teachers and 25 graduate students. The major research groups
work with Programming Logic, Functional programming , Algorithms and
Discrete
Optimization, Distributed Systems, Cognition Technology and Concurrency.
We welcome applicants from all fields of Computer Science.=20
A general (incomplete) description of the department can also be found
at http://www.cs.chalmers.se/=20
As a postdoctoral, you devote your most time to research but you will
also in participate in supervision of research students and
undergraduate teaching.=20
Further information can be obtained from Christer Carlsson,(Tel:
+46-31-772 1038, Email: carlsson [at] cs [dot] chalmers.se) and Bengt Nordstr=F6m,
Tel: +46-31-772 1033, Email: bengt [at] cs [dot] chalmers.se)=20
To apply, send us a CV, covering your research and your teaching
experience, and any other relevant experience, and giving the names of
referees. Send three packets, each containing a copy of your CV, and of
the research papers and other documents you wish to include. The last
date for applications to arrive is 31 October 1997. Applications should
be sent to Personalavdelningen,
Chalmers, 412 96 G=F6teborg, Sweden and be marked Ref.No. 88/97.
From owner-reliable_computing Sat Oct 11 16:55:21 1997
Received: by interval.usl.edu id AA10006
(5.65c/IDA-1.4.4 for reliable_computing-outgoing); Sat, 11 Oct 1997 18:58:42 -0500
Received: from zmit1.ippt.gov.pl by interval.usl.edu with SMTP id AA10000
(5.65c/IDA-1.4.4 for ); Sat, 11 Oct 1997 18:58:21 -0500
Received: (from zkulpa@localhost) by zmit1.ippt.gov.pl (8.8.5/8.7.3-zmit) id PAA03489; Sat, 11 Oct 1997 15:55:21 +0100 (MET)
Date: Sat, 11 Oct 1997 15:55:21 +0100 (MET)
From: Zenon Kulpa
Message-Id: <199710111455.PAA03489 [at] zmit1 [dot] ippt.gov.pl>
To: reliable_computing [at] interval [dot] usl.edu
Subject: Relations between solution sets of linear interval systems
Cc: zkulpa [at] zmit1 [dot] ippt.gov.pl
Sender: owner-reliable_computing
Precedence: bulk
> From zkulpa Thu Oct 9 20:18:23 1997
> Date: Thu, 9 Oct 1997 20:18:04 +0100 (MET)
I am becoming notorious with my questions about
various possibly exotic interval problems...
Here goes the next one:
Given two linear interval systems of equations with
matrices (A', b') and (A", b"), are there any works/results
concerning investigation of relations between their solution sets?
Namely, questions like these:
- do Sigma(A', b') and Sigma(A", b") have an empty/nonempty intersection?
- is Sigma(A', b') a subset of Sigma(A", b") ?
- given (A', b') how to find (A", b") of the same dimensionality,
and possibly of some given type/class,
such that Sigma(A', b') is included in Sigma(A", b")?
[it may be considered a kind of generalization
of the problem of finding interval enclosures of Sigma(A', b')].
- what about minimal inclusion?
[i.e., find (A", b") of the given type with smallest solution set
including Sigma(A', b'): now it is a generalization
of the problem of finding the interval hull of Sigma(A', b')].
The first seems rather easy - combine them into a single
(rectangular) system and test if it has any solutions.
The second can be attempted in a similar manner -
one has to test if the set of solutions of the combined
system is the same as that of one of the original systems.
But how to test easily if two given interval systems have
the same set of solutions without actually solving them?
I have found little work on solving rectangular interval systems,
and in none of them the above questions were addressed.
I would be grateful for any references
to papers, books, or WWW sites treating about
these matters.
Regards,
-- Zenon Kulpa
From owner-reliable_computing Mon Oct 13 12:53:40 1997
Received: by interval.usl.edu id AA10677
(5.65c/IDA-1.4.4 for reliable_computing-outgoing); Mon, 13 Oct 1997 03:55:40 -0500
Received: from Pap.UniVie.AC.AT (apap4.pap.univie.ac.at) by interval.usl.edu with SMTP id AA10671
(5.65c/IDA-1.4.4 for ); Mon, 13 Oct 1997 03:55:33 -0500
Received: from homer.cma.univie.ac.at by Pap.UniVie.AC.AT (PMDF V5.0-4 #10670)
id <01IOR7O77QF48WX6EG [at] Pap [dot] UniVie.AC.AT>; Mon, 13 Oct 1997 10:54:08 +0100 (MET)
Received: by homer.cma.univie.ac.at (5.65v3.2/1.1.10.5/19Mar97-1148AM)
id AA09602; Mon, 13 Oct 1997 10:53:40 +0200
Date: Mon, 13 Oct 1997 10:53:40 +0200
From: Arnold Neumaier
Subject: Re: Singular Value Decomposition for interval matrices
To: reliable_computing [at] interval [dot] usl.edu, zkulpa [at] zmit1 [dot] ippt.gov.pl
Message-Id: <9710130853.AA09602 [at] homer [dot] cma.univie.ac.at>
Content-Transfer-Encoding: 7BIT
Sender: owner-reliable_computing
Precedence: bulk
A. Deif, Sensitivity analysis in linear systems,
Springer, Berlin, Heidelberg (1986)
A. S. Deif, Singular Values of an Interval Matrix,
LAA 151 (1991), 125-...
are a book and a paper on singular value enclosures.
Arnold Neumaier
From owner-reliable_computing Mon Oct 13 07:53:00 1997
Received: by interval.usl.edu id AA00321
(5.65c/IDA-1.4.4 for reliable_computing-outgoing); Mon, 13 Oct 1997 14:59:49 -0500
Received: from cs.utep.edu by interval.usl.edu with SMTP id AA00306
(5.65c/IDA-1.4.4 for ); Mon, 13 Oct 1997 14:53:40 -0500
Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1)
id AA21914; Mon, 13 Oct 97 13:53:00 MDT
Date: Mon, 13 Oct 97 13:53:00 MDT
From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich)
Message-Id: <9710131953.AA21914 [at] cs [dot] utep.edu>
To: reliable_computing [at] interval [dot] usl.edu
Subject: conference of possible interest
Sender: owner-reliable_computing
Precedence: bulk
Robust and H-infinity (interval-related) controller design is one of
the major topics of this conference, so this CFP may be of interest to
the interval community, especially to those who are interested in
control applications.
----- Begin Included Message -----
From Eitan.Altman [at] sophia [dot] inria.fr Mon Oct 13 12:14:30 1997
ANNOUNCEMENT AND CALL FOR PAPERS
8th INTERNATIONAL SYMPOSIUM
ON
DYNAMIC GAMES AND APPLICATIONS
http://www.inria.fr/miaou/CONF-isdg.html
Organized by
THE INTERNATIONAL SOCIETY OF DYNAMIC GAMES
http://www.hut.fi/HUT/Systems.Analysis/isdg/
July 5-8, 1998
Chateau Vaalsbroek
Maastricht
the Netherlands
Sponsored by
IEEE-CSS IFAC and INRIA
&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&
The Eighth International Symposium on Dynamic Games and Applications, a
three day conference, will be held for the first time in the Netherlands,
July 6-8, 1998.
Participants will have an opportunity to hear state-of-the-art presentations
on a wide range of game-theoretic models, both theory and applications. The
conference will be preceded by a one-day tutorial on July 5.
CONFERENCE
**********
The three day technical program will consist of plenary sessions, invited
sessions, and presentations of contributed papers. The topics include, but
are not limited to the following:
* H-Infinity control and robust controller designs
* Repeated games
* Stochastic games
* Learning and adaptive games
* Evolutionary games
* Cooperative equilibria
* Dynamic bargaining
* Pursuit-Evasion games
* Search, encounter and inspection games
* Networking games in telecommunications and transportation
* Dynamic games in economics
* Dynamic games in management
* Environment, energy and resource management
* Games in finance and marketing
* Numerical methods and computer implementation of game models
PLENARY LECTURES
****************
Plenary lectures will cover different areas of dynamic games. They will
focus on the state of the art of several areas of dynamic games, and will
be delivered by
* Professor R. AUMANN from the Hebrew university of Jerusalem (IL)
* Professor A. LAZAR from Columbia University (US)
* Professor M. MASCHLER from the Hebrew university of Jerusalem (IL)
TUTORIAL
********
The topic of the tutorial is LEARNING IN GAMES. It will be delivered by
Professor E. LEHRER from Tel-Aviv University (IL) and Professor R. VOHRA
from Ohio State University (US).
International Program Committee
*******************************
Chair-Persons: E. Altman (FR), O. Pourtallier (FR)
T. Basar (US), P. Bernhard (FR), M. Breton (CA),
A. De Palma (FR), M. Falcone (IT), J. Filar (AU), S. Gal (IL),
R. Hamalainen (FI), A. Haurie (CH),
A. Lazar (US), A. Melikyan (RU), K. Mizukami (JP),
M. Petit (IT), L. Petrosian (RU), J. Shinar (IL),
D. Schmeidler (IL).
PUBLICATIONS
************
All accepted papers will be included in a volume of preprints to be made
available to registered participants at the beginning of the conference.
Authors will also have the opportunity to submit their papers for
publication in a refereed special volume of the ANNALS OF THE ISDG
(Birkhauser publisher).
Deadlines
*********
The schedule for submission of papers and invited sessions is
JANUARY 2, 1998: Submission of extended abstract
and invited sessions
MARCH 1, 1998: Notification of acceptance
MAY 1, 1998 : Full paper
SUBMISSIONS
***********
Submissions should preferably be made by E-mail by sending a
Latex file to
ephie.deriche [at] sophia [dot] inria.fr
It is also possible to send an ascii file.
Another possibility is to send hard copies (in which case four
copies would be needed) to :
Ephie Deriche -
ISDG Conference- Submission
INRIA, BP 93
06902 Sophia Antipolis Cedex - FRANCE
Papers
------
Each paper submission should contain
* the title of the paper
* the author(s')'s name(s) with a clear indication
of the corresponding author;
* the authors' complete details :
-affiliation (with URL address if any)
-complete address (including fax number)
-E-mail address
- home page URL address if any
* a list of keywords
* a detailed extended summary supported by relevant references
Invited sessions
----------------
The Program Committee is soliciting proposals for invited sessions.
Cohesive sessions focusing on new or emerging topics are particularly
encouraged.
Proposals for invited sessions should contain
* the name(s) of the session organizer(s) and for all of them the above
personal details
* a clear statement of the topic of the session
* for each paper of the invited sessions, the same information needed as
for paper submission above.
Note that the initial paper may be a tutorial or survey which can be
allotted twice the usual time for presentation.
Local Organizing Committee
**************************
Chairman: K. Vrieze (NL)
F. Thuijsman (NL), M. Verheij (NL)
E-mail: dynamic [at] math [dot] unimaas.nl
Tel: +31-43-3883494
Fax: +31-43-3211889
Registration Fees
*****************
Conference paid before april 1, 1998 250 USD
paid after april 1, 1998 350 USD
Tutorial ........................ 50 USD
Symposium Location
******************
All the sessions, the conference dinner and the tutorial will be held at the
Chateau Vaalsbroek, near Maastricht, the Netherlands.
Although other hotels are available nearby, it is strongly recommended that
participants stay at Chateau Vaalsbroek.
A limited number of rooms has been reserved for the duration of the conference
at a reduced rate, including breakfasts, lunches and dinners.
1 day and night 100 USD
2 days and nights 180 USD
3 250 USD
4 300 USD
Accompanying persons will be charged 50 USD per night (incl. breakfast), and
25 USD per dinner. An additional night outside the conference time will be
charged 100 USD.
Participants from developing countries may apply for a reduced hotel rate.
For more detailed information about accomodation contact the local organizing
committee.
Inline Registration
*******************
An inline registration will be made available at the address:
http://137.120.176.157/math/events/isdg/
&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&
----- End Included Message -----
From owner-reliable_computing Tue Oct 14 10:59:54 1997
Received: by interval.usl.edu id AA00775
(5.65c/IDA-1.4.4 for reliable_computing-outgoing); Mon, 13 Oct 1997 22:00:16 -0500
Received: from falcon.glas.apc.org by interval.usl.edu with SMTP id AA00769
(5.65c/IDA-1.4.4 for ); Mon, 13 Oct 1997 22:00:05 -0500
Received: from camel.glasnet.ru(src addr [193.124.5.52]) (25465 bytes) by falcon.glas.apc.org
via sendmail with P\:esmtp/R:inet_hosts/T:inet_zone_smtp
(sender: )
id
for ; Tue, 14 Oct 1997 07:00:22 +0400 (WSU DST)
(Smail-3.2.0.96 1997-Jun-2 #4 built DST-Jun-13)
Received: from localhost (24933 bytes) by camel.glasnet.ru
via send-mail with P:stdio/R:smart_host/T:smtp
(sender: ) (ident using unix)
id
for ; Tue, 14 Oct 1997 06:59:54 +0400 (WSU DST)
(Smail-3.2.0.96 1997-Jun-2 #11 built DST-Aug-25)
Message-Id:
Date: Tue, 14 Oct 1997 06:59:54 +0400 (WSU DST)
From: intcom [at] glas [dot] apc.org ( )
To: reliable_computing [at] interval [dot] usl.edu
Subject: Information about the journal `Reliable Computing' (repeated)
Sender: owner-reliable_computing
Precedence: bulk
January 6, 1997
Dear colleagues,
On behalf of the managing group of the journal RELIABLE COMPUTING,
I would like to inform you about changes that should take place in 1997.
First of all, the journal will change its owner. Beginning the
issue 1/97 (vol. 3) the journal will be published, printed, and
distributed by Kluwer Academic Publishers - a brand-name Dutch
publishing house. This fact has various consequences for our authors and
subscribers.
1) Basing on the prestige of the journal and the publishing house,
we hope to extend the circle of authors, scientific fields, and
geographic regions. To achieve this purpose more effectively, we have
invited several well-known experts to the editorial board. Thus, the
following persons will be new members of the editorial board in 1997:
A. Cuyt, Belgium;
J. Garloff, Germany;
G. Mayer, Germany;
J. Rokne, Canada;
G. W. Walster, USA;
E. Walter, France.
All former members will continue their membership. The Editor-in-
Chief also will keep his position. The journal will keep the former
official representatives in the Western Hemisphere and Europe, too. All
materials will be published exclusively in English.
2) The periodicity of the journal still is the same: 4 issues per
year. However, the price of an annual subscription will be changed: the
new price for institutions is NLG 420 (USD 250), for individuals - NLG
190 (USD 125). For details please contact services [at] wkap [dot] nl.
3) The former managing group won't distribute NEW issues of the
journal, but only the managing group will distribute BACK issues and
supplements of the journal (including the journal under its old name
INTERVAL COMPUTATIONS).
4) Now ALL back issues are available: you can order even the issue
1/91 (made in a copier and bound). All back supplements are also
available. Prices for back issues and supplements WILL NOT BE CHANGED.
As in the past, prices for individuals are half the prices for
organizations. For either organizations or individuals who wish to order
the full set of back issues (1991-1996), we are offering a 15% discount.
5) As before, current information about the journal will be
distributed by the mailing list reliable_computing (contact Prof.
R. Baker Kearfott: rbk [at] usl [dot] edu). Additionally, some information
(including the contents of all issues) will be placed at
http://www.wkap.nl. Non-official home pages under supervision of Prof.
Vladik Kreinovich are also available: http://cs.utep.edu/interval-
comp/rcjournal.html.
6) ATTENTION AUTHORS: some changes have been made in requirements
for manuscript preparation. For details please contact the Editor-in-
Chief. DO NOT SEND YOUR MANUSCRIPTS TO KLUWER ACADEMIC PUBLISHERS!
Below you can find a letter from the Editor-in-Chief, a brief
description of the journal, as well as terms and prices for back and new
issues. Please distribute this information to all persons who may be
interested in it.
Please accept our apologies if you receive multiple copies of this
message.
Sincerely yours,
Alexander G. Yakovlev,
Managing Editor
=======================================================================
Dear colleagues,
Because of changes in the distribution of the journal, it is likely
that many specialists have become attracted to our periodical for the
first time. That is why I consider it appropriate to briefly outline
here the history of the journal as well as to characterize the field of
mathematics to which it is devoted.
The idea of founding a new journal first came to a group of (then
Soviet) Russian scientists who had worked in the field of numerical
computations using the approaches of interval mathematics in 1990. It
had been observed that, despite computational mathematicians' growing
interest in interval methods, there was no specialized periodical to
treat interval problems and implementing interval methods on computers.
To fill the gap, a new journal named INTERVAL COMPUTATIONS was founded
in Russia in 1991, and published by the Institute of New Technologies
(Moscow - St.Petersburg), later renamed Institute of New Technologies in
Education. In 1991, two issues of the new journal were published, and
since then, new issues have appeared four times a year. The journal has
published both original papers as well as surveys, information about new
software, conference announcements, reviews of new books, etc. Attention
has always been paid to applied and interdisciplinary research. The
majority of the journal's first readers were researchers from the ex-
USSR, and a considerable portion of the material was published in
Russian without an English translation. In time, however, the journal
became internationally known and began to attract the interest of the
scientific community worldwide. The Editorial Board, consisting of the
original group of scientists, was expanded by inviting well-known
scientists from the countries where interval computations research was
being conducted on a major scale. The journal thus spread its
distribution all over the world, with its subscribers representing more
than 30 countries.
From its inception, our journal kept the tradition of preparing
special issues devoted either to the publication of proceedings of
relevant conferences or to certain limited topics within the coverage of
the journal. Thus, from 1991 to 1994, we have published the proceedings
of the following conferences:
* International Conference on Interval and Stochastic Methods in
Science and Engineering (Interval'92), Moscow, Russia, September
22-25, 1992;
* International Conference on Numerical Analysis with Automatic
Result Verification, Lafayette, Louisiana, USA, February 25 -
March 1, 1993;
* IMACS/GAMM International Symposium on Scientific Computing,
Computer Arithmetic and Validated Numerics (SCAN-93), Vienna,
Austria, September 26-29, 1993.
In addition, we have prepared a special issue on Parallel
Algorithms for Interval Computations. As a separate supplement, a
Bibliography of Works on Interval Computations Published in Russian was
also published.
By the end of 1994, it was observed that the subject coverage of
published materials began to outgrow the journal's official coverage.
Indeed, the interval approach is one of the most important, but far from
the only way to get reliable results in mathematical calculations. It is
certain that establishing a correct link between "continuous" objects
that are treated in most branches of mathematics and finitely
representable objects that are used by computers is the foundation of
ascertaining the reliability of mathematical computations. There is no
exaggeration in saying that it was the interval approach that first
allowed proper construction of this link. It is obvious, then, that
interval mathematics has played a determining role in attaining
reliability of numerical algorithms. However, other purely mathematical
and computational means are also employed in this task. Questions of
correctly stating a computational problem, the combined use of numerical
calculations and symbolic computations, issues of developing software
and hardware specifically aimed at effective implementation of reliable
computations, etc. also belong to the realm of reliable computing.
Since 1995, our journal has changed its title to RELIABLE COMPUTING
and simultaneously expanded its Editorial Board again, reflecting our
wish to change the primary subject of the journal from one of the main
_means_ of achieving reliability in mathematical computations to the
ultimate _goal_ that is, obtaining results with guaranteed properties by
using various methods, including interval ones.
Time has shown that we made a good choice. Subject coverage of
submitted articles has continued to expand, and mutual enrichment with
adjacent branches of mathematics has become more intense. As a result,
the journal has become of interest to a wider circle of readers.
We have kept the tradition of publishing special issues of the
journal. Thus, we have prepared two issues with the best papers written
by university students (made independently or in co-authorship with
their professors), a new special issue on Parallel Algorithms for
Interval Computations, and the proceedings of the following conferences:
* International Conference on Interval and Computer-Algebraic
Methods in Science an Engineering (Interval'94), St.Petersburg,
Russia, March 7-10, 1994;
* IMACS/GAMM International Symposium on Scientific Computing,
Computer Arithmetic and Validated Numerics (SCAN-95), September
26-29, Wuppertal, Germany.
As a supplement, a volume of abstracts of the International
Workshop on Applications of Interval Computations, El Paso, Texas, USA,
February 23-25, 1995, was published.
The increased international recognition of the journal was the
reason that, in 1996, Kluwer Academic Publishers, a Dutch scientific
publishing house, offered to take the journal under its auspices. Both
former publisher and the Editorial Board agreed, and after nearly a year
of preparation the journal was transferred to Kluwer Academic
Publishers. I am sure that the new distribution facilities that the
journal has obtained after the change will promote further growth of our
readership and the scientific level of the periodical. In 1997 we will
publish four issues with approximately 100 pages in each. The first and
second issues of this year will contain current publications. The third
issue will probably present the proceedings of the International
Conference on Interval Methods and Computer Aided Proofs in Science and
Engineering (Interval'96), held on September 30 to October 2, 1996, in
Wuerzburg, Germany, organized by the Faculty of Mathematics and Computer
Science of Wuerzburg University in collaboration with the Editorial
Board of our journal. The special issue with the Proceedings is likely
to be of larger volume than usual. Professor J. Wolff von Gudenberg
agreed to be the invited editor of the issue.
The fourth issue in 1997 is planned to be the next student special
issue edited by Professor G. Mayer (Rostock University, Germany) and
Professor V. Kreinovich (University of Texas at El Paso, USA).
To conclude, let me express my hope that the latest changes in the
journal's status will be approved by the international community of our
authors and readers. The Editorial Board will be pleased to receive any
comments and suggestions.
V. M. Nesterov,
Editor-in-Chief
=======================================================================
Kluwer Academic Publishers
*****************************************
* *
* R E L I A B L E C O M P U T I N G *
* *
*****************************************
An International Journal devoted to
Reliable Mathematical Computations
based on Finite Representations and
Guaranteed Accuracy
ISSN 1385-3139
A refereed international journal RELIABLE COMPUTING (before 1995
named INTERVAL COMPUTATIONS) is the only periodical in the world devoted
specifically to various aspects of reliable mathematical computations
based on finite representations of mathematical objects, and giving a
guaranteed accuracy of computed results. It is managed by an
international editorial board from Belgium, Bulgaria, Canada, Germany,
France, Japan, Russia, and the United States. The journal is distributed
in approximately 30 countries throughout the world. It includes various
items in the fields of theoretical research, computer tools,
applications, interdisciplinary research, and other relevant areas in
the field of mathematical computations with the use of a computer. The
following subjects are within the focus of the journal: numerical,
symbolic and combined algorithms for solving computational problems, the
interval approach, computer architectures for mathematical computations,
contemporary languages for description of mathematical processes,
methods of localization of solutions, teaching of reliable computational
methods at universites, etc. RELIABLE COMPUTING also publishes
proceedings of international conferences, such as INTERVAL'XX, SCAN'XX,
etc.
The Editorial Board of "Reliable Computing" includes:
G. ALEFELD Karlsruhe, Germany
A. CUYT Antwerp, Belgium
B. S. DOBRONETS Krasnoyarsk, Russia
J. GARLOFF Konstanz, Germany
R. B. KEARFOTT Lafayette, LA, USA - official representative in
the Western Hemisphere
V. KREINOVICH El Paso, TX, USA
S. M. MARKOV Sofia, Bulgaria
G. MAYER Rostock, Germany
E. A. MUSAYEV West Des Moines, IA, USA
M. T. NAKAO Fukuoka, Japan
V. M. NESTEROV St. Petersburg, Russia - Editor-in-Chief
H. RATSCHEK Dusseldorf, Germany
J. ROKNE Calgary, Canada
S. M. RUMP Hamburg, Germany
A. L. SEMENOV Moscow, Russia
S. P. SHARY Novosibirsk, Russia
G. W. WALSTER Mountain View, CA, USA
E. WALTER Gif-sur-Yvette, France
J. WOLFF VON
GUDENBERG Wuerzburg, Germany - official representative in
Europe
A. G. YAKOVLEV Moscow, Russia - Managing Editor
V. S. ZYUZIN Saratov, Russia
The address of the Editorial Board:
Box 52
St.Petersburg
195256, Russia
Dr. Vyacheslav M. Nesterov
Phone: +7-812-534-4120
Fax: +7-812-233-0968
E-mail: nest [at] into [dot] nit.spb.su (preferable), intcom [at] glasnet [dot] ru
The journal includes:
o original papers
o surveys and tutorials
o reports on new computer tools
o bibliographies
o reviews of new books
o letters to the editor
o information about scientific meetings
o advertisements of software and hardware products
All issues of INTERVAL COMPUTATIONS and RELIABLE COMPUTING as well
as supplements published before 1997 are available for purchase by
journal's regional representatives (their addresses see below). To
subscribe the journal for 1997, contact please to Kluwer Academic
Publishers (details see below).
Published supplements:
1) SUPPLEMENTUM 1, consisting of a "Bibliography of Works on
Interval Computations Published in Russian", with a subject index, is
now available. It includes almost all sensible references in the field
(547 items in the current version) in English translation.
2) COLLECTION OF ABSTRACTS OF THE INTERNATIONAL CONFERENCE ON
INTERVAL AND COMPUTER-ALGEBRAIC METHODS IN SCIENCE AND ENGINEERING
(INTERVAL'94), which was held in St.Petersburg, Russia, March 7-10,
1994. Abstracts are in English, two pages average, including postal and
e-mail addresses of the authors (total 226 p.).
3) COLLECTION OF PEER-REFEREED AND EDITED EXTENDED ABSTRACTS OF THE
INTERNATIONAL WORKSHOP ON APPLICATIONS OF INTERVAL COMPUTATIONS,
(APIC'95), which was held in El Paso, Texas, February 23-35, 1995.
Abstracts are in English, including authors' addresses (total 244 p.).
4) COLLECTION OF EXTENDED ABSTRACTS OF THE INTERNATIONAL CONFERENCE
ON INTERVAL METHODS AND COMPUTER AIDED PROOFS IN SCIENCE AND ENGINEERING
(Interval'96), September 30 - October 2, 1996, Wuerzburg, Germany.
Abstracts are in English, including authors' addresses (total 140 p.).
INFORMATION FOR AUTHORS is available by a request to the Editor-in-
Chief (nest [at] into [dot] nit.spb.su).
INFORMATION ABOUT ORDERING BACK ISSUES AND SUPPLEMENTS
You can order any set of back issues (1/91, 2/91, 1/92-4/92, ... ,
1/96-4/96; the total number of back issues is 22) and supplements. Also
we offer a 15% discount for the complete set of all published issues and
supplements.
Regular prices for individuals are as follows (postage included):
Western Hemisphere Europe and other regions
Per issue US$ 15.00 DM 21.00
Supplementum 1 US$ 10.00 DM 14.00
The collection US$ 15.00 DM 21.00
of Interval'94
abstracts
The collection US$ 15.00 DM 21.00
of APIC'95
abstracts
The collection US$ 15.00 DM 21.00
of Interval'94
abstracts
ATTENTION: FOR INSTITUTIONS (UNIVERSITIES, LIBRARIES, COMPANIES,
ETC.), ALL INDICATED PRICES SHOULD BE DOUBLED.
If you wish to purchase back issues of RELIABLE COMPUTING and/or
receive the supplements, please send this order form, along with a check
for the appropriate amount (or use a bank transfer), to one of our
official representatives:
In the Western Hemisphere In Europe, Asia and Africa
Dr. R. Baker Kearfott Prof. Dr. J. Wolff von Gudenberg
Department of Mathematics Lehrstuhl f. Informatik II
Univ. of Southwestern Louisiana Universitaet Wuerzburg
U.S.L. Box 4-1010 Lafayette Am Hubland
LA 70504-1010 Wuerzburg D-97074
USA Germany
Office: (318) 231-5270 Phone: +49-931-888-5517
Home: (318) 981-9744 Fax: +49-931-888-4602
E-mail: rbk [at] usl [dot] edu E-mail: wolff [at] informatik [dot] uni-
wuerzburg.de
Please make a check to Instructions for bank transfer:
the "University of holder: J. Wolff v. Gudenberg
Southwestern Louisiana" number: 560219826
bank: Kreissparkasse Wuerzburg
bank code: 790 501 30
----------------------------------------------------------------------
"RELIABLE COMPUTING" ORDER FORM
(for individuals only)
Name: ________________________________________________________________
Organization: ________________________________________________________
Address: _____________________________________________________________
______________________________________________________________________
State: _______________________________ Zip: __________________________
Tel.: ___________________________ (optional)
Fax: ____________________________ (optional)
E-mail: __________________________________________ (highly desirable!)
Please check:
[ ] I wish to purchase the following back issues of the journal
RELIABLE COMPUTING:
__________________________________________________________________
The sum of _________________ paid for the enumerated issues
(cheque/money order enclosed).
[ ] Send me additionally Supplementum 1 (Bibliography of Works
on Interval Computations Published In Russian). Sum of
$10/14 DM paid (cheque/money order enclosed).
[ ] Send me additionally the collection of INTERVAL'94
abstracts. Sum of $15/21 DM paid (cheque/money order
enclosed).
[ ] Send me additionally the collection of APIC'95
abstracts. Sum of $15/21 DM paid (cheque/money order
enclosed).
[ ] Send me additionally the collection of INTERVAL'96
abstracts. Sum of $15/21 DM paid (cheque/money order
enclosed).
[ ] I wish to purchase the complete set of all back issues and
supplements for a 15% discount. Sum of $327/458 DM paid
(cheque/money order enclosed)
The total sum is _________________.
Date: ______________________ Signature: ______________________
----------------------------------------------------------------------
"RELIABLE COMPUTING" ORDER FORM
(for institutions only)
Name (for contacts): _________________________________________________
Organization: ________________________________________________________
Address: _____________________________________________________________
______________________________________________________________________
State: _______________________________ Zip: __________________________
Tel.: ___________________________ (optional)
Fax: ____________________________ (optional)
E-mail: __________________________________________ (highly desirable!)
Please check:
[ ] We wish to purchase the following back issues of the journal
RELIABLE COMPUTING:
__________________________________________________________________
The sum of _________________ paid for the enumerated issues
(cheque/money order enclosed).
[ ] Send us additionally Supplementum 1 (Bibliography of Works
on Interval Computations Published in Russian). Sum of
$20/28 DM paid (cheque/money order enclosed).
[ ] Send us additionally the collection of INTERVAL'94
abstracts. Sum of $30/42 DM paid (cheque/money order
enclosed).
[ ] Send us additionally the collection of APIC'95
abstracts. Sum of $30/42 DM paid (cheque/money order
enclosed).
[ ] Send us additionally the collection of INTERVAL'96
abstracts. Sum of $30/42 DM paid (cheque/money order
enclosed).
[ ] We wish to purchase the complete set of all back issues and
supplements for a 15% discount. Sum of $654/916 DM paid
(cheque/money order enclosed)
The total sum is _________________.
Date: _______________________ Signature: _____________________
=======================================================================
SUBSCRIPTION ORDER FORM
Journal Title: Reliable Computing
1997, Volume 3 (4 issues)
ISSN: 1385-3139
Subscription rate: NLG 420,- / US$ 250,-
Individual rate: NLG 190,- / US$ 125,-
Ref: KAPIS
( ) Payment enclosed to the amount of ___________________________
( ) Please send invoice
( ) Please charge my credit card account:
Card no.: |_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_| Expiry date: ______________
() Access () American Express () Mastercard
() Diners Club () Eurocard () Visa
Name of Card holder: ___________________________________________________
Delivery address:
Title: ______________________________ Initials: _______________M/F______
First name: ____________________ Surname: ______________________________
Organization: __________________________________________________________
Department: ____________________________________________________________
Address: _______________________________________________________________
Postal Code: ________________ City: ____________________________________
Country: ______________________________Telephone: ______________________
Email: _________________________________________________________________
Date: _____________________ Signature: _________________________________
Our European VAT registration number is: |_|_|_|_|_|_|_|_|_|_|_|_|_|_|
To be sent to:
For customers in Mexico, USA, Rest of the world:
Canada and Latin America:
Kluwer Academic Publishers Kluwer Academic Publishers Group
Order Department Journals Department
P.O. Box 358 P.O. Box 322
Accord Station 3300 AH Dordrecht
Hingham, MA 02018-0358 The Netherlands
U.S.A.
Tel : 617 871 6600 Tel : +31 78 6392392
Fax : 617 871 6528 Fax : +31 78 6546474
Email : kluwer [at] wkap [dot] com Email : services [at] wkap [dot] nl
Payment will be accepted in any convertible currency. Please check
the rate of exchange with your bank. Prices are subject to change
without notice. All prices are exclusive of Value Added Tax (VAT).
Customers in the Netherlands please add 6% VAT. Customers from other
countries in the European Community:
* please fill in the VAT number of your institute/company in the
appropriate space on the order form: or
* please add 6% VAT to the total order amount (customers from the U.K.
are not charged VAT).
From owner-reliable_computing Tue Oct 14 11:03:11 1997
Received: by interval.usl.edu id AA00835
(5.65c/IDA-1.4.4 for reliable_computing-outgoing); Mon, 13 Oct 1997 22:03:28 -0500
Received: from falcon.glas.apc.org by interval.usl.edu with SMTP id AA00829
(5.65c/IDA-1.4.4 for ); Mon, 13 Oct 1997 22:03:15 -0500
Received: from camel.glasnet.ru(src addr [193.124.5.52]) (52703 bytes) by falcon.glas.apc.org
via sendmail with P\:esmtp/R:inet_hosts/T:inet_zone_smtp
(sender: )
id
for ; Tue, 14 Oct 1997 07:03:37 +0400 (WSU DST)
(Smail-3.2.0.96 1997-Jun-2 #4 built DST-Jun-13)
Received: from localhost (52171 bytes) by camel.glasnet.ru
via send-mail with P:stdio/R:smart_host/T:smtp
(sender: ) (ident using unix)
id
for ; Tue, 14 Oct 1997 07:03:11 +0400 (WSU DST)
(Smail-3.2.0.96 1997-Jun-2 #11 built DST-Aug-25)
Message-Id:
Date: Tue, 14 Oct 1997 07:03:11 +0400 (WSU DST)
From: intcom [at] glas [dot] apc.org ( )
To: reliable_computing [at] interval [dot] usl.edu
Subject: `Reliable Computing': contents of all published issues
Sender: owner-reliable_computing
Precedence: bulk
====================================================================
=== To get issues of 1991-1996 please contact to Editor-in-Chief ===
====================================================================
Interval Computations. - 1991. - N 1. - 117 p.
CONTENTS
>From the Editor (in Russian) 2
>From the Editor 6
A. G. Yakovlev
Interval computations - subject of research
and useful tool (in Russian) 10
A. G. Yakovlev
Interval computations - subject of research
and useful tool 27
J. Herzberger, D. Bethke
On two algorithms for bounding
the inverses of an interval matrix 44
B. S. Dobronets, V. I. Senashov
On interval extension of
some classes of functions (in Russian) 54
R. B. Kearfott, Chenyi Hu, Manuel Novoa III
A review of preconditioners for the interval
Gauss-Seidel method 59
E. A. Musaev
Narrowing of intervals by partial derivatives 86
S. P. Shary
On compatibility of linear tolerance problem
(in Russian) 92
B. V. Paluh, B. V. Vasilyov, V. L. Perov
Application of interval mathematics for solving
technical diagnostics tasks of non-stop manufacture
in chemical industry (in Russian) 99
SHORT COMMUNICATIONS
V. S. Zjuzin Review of the book: H. Bauch, K.-U. Jahn,
D. Oelschlaegel, H. Suesse, V. Wiebigke "Interval
Mathematics (Theory and Application)"
(H. Bauch, K.-U. Jahn, D. Oelschlaegel, H. Suesse, V. Wiebigke
Intervallmathematik (Teorie und Anwendungen). - Leipzig,
BSB B. G. Teubner Verlagsgesellschaft, 1987, 260 S.
(Mathematisch-Naturwissenschaftliche Bibliothek,
Band 72)) (in Russian) 105
E. A. Musaev
Interval Methods for Numerical Computation
West Germany, Oberwolfach, 3 - 10. 3 1990
(Information on international meeting) (in Russian) 108
S. P. Shary
7-th All-Union Workshop in Interval
Mathematics (Information) (in Russian) 111
Requirements for manuscript preparation (in Russian) 113
Requirements for manuscript preparation 114
Contents 115
====================================================================
Interval computations. - 1991. - N 2. - 134 p.
CONTENTS
>From the Editor 2
>From the Editor (in Russian) 4
MATHEMATICAL RESEARCHES
S. Shary
Optimal solution of interval linear
algebraic systems. I 7
V. Kreinovich, A. Bernat, E. Villa, Y. Mariscal
Parallel Computers. Estimate errors caused by
imprecise data 31
COMPUTER MEANS
R. Hammer, M. Neaga, D. Ratz, D. Shiryaev
PASCAL-XSC: A new language for scientific
computing (in Russian) 47
ADVERTISEMENT
The full translation into Russian of ANSI/IEEE
standards on computer arithmetic (in Russian) 82
Program package ASIAS 83
Program package ASIAS (in Russian) 84
REVIEWS AND ABSTRACTS
P. S. Pankov
Review of the new monograph:
Dobronets B. S., Shaydurov V. V. Two-sided
numerical methods 85
MEETINGS
Actual problems of applied mathematics. All-Union
conference. Saratov, May 20-22, 1991. A brief
report (A. V. Zakharov) 87
Actual problems of applied mathematics. All-Union
conference. Saratov, May 20-22, 1991. A brief
report (A. V. Zakharov, in Russian) 91
A. Davidenkoff
Advanced seminar on programming languages for
scientific/engineering computation, Leningrad,
June 3-6, 1991. A summarizing report 96
Interval subject on the SCAN-1991 symposium.
Information (J. Herzberger) 107
Resolution of 8th All-Union Workshop on interval
mathematics. Bishkek, October 1-3, 1991 108
Preliminary announcement, call for papers and further
information for a conference on numerical analysis
with automatic result verification. Lafayette,
Louisiana, February 25 - March 1, 1993 110
BIBLIOGRAPHY
Bibliography of Soviet works on interval
computations. Part 1 115
REQUIREMENTS FOR MANUSCRIPT PREPARATION 123
REQUIREMENTS FOR MANUSCRIPT PREPARATION (in Russian) 125
ADDRESSES OF EDITORIAL BOARD MEMBERS 127
CONTENTS 132
====================================================================
Interval computations. - 1992. - N 1. - 121 p.
CONTENTS
>From the Editor 2
>From the Editor (in Russian) 4
Mathematical researches
B. S. Dobronets
On some two-sided methods for solving systems
of ordinary differential equations 6
S. M. Rump
Inclusion of the solution for
large linear systems with M-matrix 22
Applications and studies of related disciplines
A. I. Orlov
Interval statistics 44
Computer means
E. A. Musaev
Wave computations. A technique for optimal
quasi-concurrent self-validation 53
A. G. Yakovlev
Classification approach to programming
of localizational (interval) computations 61
* * *
Special issue 85
Computer implementation
G. D. Pankova
Programming support and algorithmic language for validating
computations on ES (IBM 360/370) series computer (in Russian) 86
Reviews and abstracts
A review of the book:
A. Neumaier, Interval Methods for Systems of Equations
(G. Alefeld) 96
List of abstracts from
Referativnyi Zhurnal "Matematika" for 1991 98
Meetings
Interval Mathematics and Its Applications. Workshop 100
Bibliography
Bibliography of Soviet works on interval
computations. Part II 104
Requirements for manuscript preparation 112
Requirements for manuscript preparation (in Russian) 114
Addresses of editorial board members 116
Contents 119
====================================================================
Interval Computations. - 1992. - N 2. - 125 p.
CONTENTS
>From the Editor 2
>From the Editor (in Russian) 4
Mathematical researches
A. F. Filippov
Ellipsoidal estimates for a solution of a system of
differential equations 6
S. P. Shary
A new class of algorithms for optimal solution of
interval linear systems 18
P. S. Pankov
Proof of finite-dimensional inequalities by means of
interval analysis 30
V. S. Zyuzin
On metrization of interval sets I(R), I(R^n) 39
Applications and studies of related disciplines
V. Kreinovich, A. Bernat, O. Kosheleva, A. Finkelstein
Interval estimates for closure-phase and
closure-amplitude in radio astronomy 51
Computer means
A. Davidenkoff
ACRITH-XSC: A programming language
for scientific/engineering computation 72
Learning
G. G. Menshikov
The teaching experience of interval computations
at the Department of applied mathematics and control
processes of St. -Petersburg University 83
Meetings
International conference ``INTERVAL-92'' 86
Mathematical modelling and scientific computation.
International conference.
Sozopol, Bulgaria, September 14-17, 1993 99
Reviews and abstracts
List of abstracts from
Referativnyi Zhurnal "Matematika" for 1991 105
Bibliography
Bibliography of Soviet works on interval
computations. Part III 107
Requirements for manuscript preparation 116
Requirements for manuscript preparation (in Russian) 118
Addresses of editorial board members 120
Contents 123
====================================================================
Interval Computations. - 1992. - N 3. - 126 p.
(Special Issue: Proceedings of the International Conference on
Interval and Stochastic Methods in Science and Engineering
"Interval'92", Moscow, September 22-25, 1992. - Vol. 1)
CONTENTS
>From the editor 2
>From the editor (in Russian) 4
>From the invited editor 6
>From the invited editor (in Russian) 7
A. Akunova, T. A. Akunov and A. V. Ushakov
Construction of a comparison system
for multivariate control processes
with interval state matrix 8
A. B. Babichev, O. B. Kadyrova, T. P. Kashevarova, A. L. Semenov
UniCalc as a tool for solving problems
with inaccurate and sub-definite data 13
F. Blomquist
Interval inclusions for Dawson's integral 17
A. F. Bochkov and L. A. Yakovleva
Algorithm for experimental zero-order optimization for plant
with bounded amplitude errors 27
A. F. Bochkov and N. V. Zung
Identification of nonlinear dynamic objects
using interval experimental data 31
D. M. Claudio, M. H. Escardo, and B. R. T. Franciosi
An order-theoretical approach to interval analysis 38
A. I. Demchenko, B. V. Peltsverger, O. V. Khavronin
Syntesis of transport networks structures
under conditions of uncertain
initial information 46
B. S. Dobronets
Interval methods based on
a posteriori estimates 50
I. V. Dugarova
An algorithm of interval matrix
asymptotic stability testing 56
O. B. Ermakov
Two-sided method for solving system of ordinary
differential equations with automatic determination
of guaranteed estimates 63
T. V. Evtushenko
Optimization problems for static plants
under uncertainty conditions 70
A. F. Filippov
Ellipsoidal error estimates
for Adams method 75
N. M. Glazunov
On interval extensions of computer algebra systems 80
T. Henriksen and K. Madsen
Parallel algorithms for global optimization 88
B. Kearfott, M. Dawande, K. Du and C. Hu
INTLIB: A portable Fortran-77 elementary function library 96
N. A. Khlebalin
Interval automatic systems --- theory, computer-aided
design and applications 106
A. V. Korlyukov
A new application of interval mathematics 116
International conference on interval and computer-algebraic
methods in science and engineering (INTERVAL'94) 122
Contents 126
====================================================================
Interval Computations. - 1992. - N 4. - 133 p.
(Special Issue: Proceedings of the International Conference
on Interval and Stochastic Methods in Science and Engineering
"Interval'92", Moscow, September 22-25, 1992. - Vol. 2)
CONTENTS
V. N. Krishchuk, N. M. Vasilega and G. L. Kozina
Interval operations and functions
library for FORTRAN 77 programming
system and its practice using 2
V. G. Krymsky
Algorithmic aims of reliability provision
for large-scale dynamic systems
with interval parameters 9
G. L. Litvinov
Error auto-correction
in rational approximation 14
S. M. Markov
On the presentation of ranges
of monotone functions
using interval arithmetic 19
G. G. Menshikov
Interval co-integration of differential
equations connected
by a substitution of the variable 32
E. A. Musaev
An approach to reliable computations
with THE minimal representation 37
A. S. Narin'yani
Ne-factors and natural pragmatics:
what do the intervals represent 42
V. M. Nesterov
Estimating a range of values
of functions using extended
interval arithmetics 48
P. S. Pankov and B. D. Bayachorova
Using interval methods in cluster analysis and
verified representation of connected sets 54
P. S. Senio and P. S. Vengersky
Solving systems of special form nonlinear
equations by means of some modifications of Runge
type interval iterative method 59
S. P. Shary
On controlled solution set
of interval algebraic systems 66
D. Shiriaev
PASCAL--XSC. A portable programming system
for scientific computations 76
S. J. Simoff
Interval approximate reasoning
for expert systems 83
N. V. Skybytsky and T. Yuping
Control of the linear dynamic plant with
intervally given parameters from the guarantee
condition of the required accuracy of the solution 88
E. M. Smagina
General problem of the asymptotic steady-output
tracking for plant with interval parameters 94
I. G. Ten
Synthesis of optimal control under interval
uncertainty in models 100
A. P. Voshchinin
Some questions of application of interval
mathematics in parameter estimation and decision
making 107
J. Wolff von Gudenberg
Programming language support for scientific
computation 116
V. S. Zyuzin
The extension of the Frechet derivative concept in
the interval-segment analysis 127
Contents 133
====================================================================
Interval Computations. - 1993. - N 1. - 124 p.
CONTENTS
>From the Editor 2
>From the Editor (in Russian) 4
Mathematical researches
Vladik Kreinovich, Anatoly V. Lakeyev and Sergey I. Noskov
Optimal solution of interval
linear systems is intractable (NP-hard) 6
R. Baker Kearfott and Xiaofa Shi
A preconditioner selection heuristic
for efficient iteration with decomposition
of arithmetic expressions for nonlinear
algebraic aystems 15
Ljiljana D. Petkovic and Miroslav Trajkovic
On some optimal inclusion
approximations by discs 34
V. A. Perepelitsa and G. L. Kozina
Interval discrete models
and multiobjectivity
complexity estimates 51
Yilmaz Akyildiz and Mohammad I. Al-Suwaiyel
No Pathologies for interval Newton's method 60
Advertisement
International conference ``INTERVAL'94'' 73
Reviews and abstracts
N. A. Khlebalin
Review of the Book 78
N. A. Khlebalin
Review of the Book (in Russian) 83
Meetings
International Congress on Computer Systems and
Applied Mathematica (CSAM-93) 88
International Congress on Computer Systems and
Applied Mathematica (CSAM-93) (in Russian) 91
Report on the IMACS-GAMM International Workshop on
Validated Computation 94
Mathematical modelling and scientific computation.
International conference. Sozopol, Bulgaria,
September 14-17, 1993 95
Mathematical modelling and scientific computation.
International conference. Sozopol, Bulgaria,
September 14-17, 1993 (in Russian) 97
International Symposium on Scientific Computing,
Computer Arithmetic and Validated Numerics "SCAN-93" 99
Announcing special student issue of the International
Journal Interval Computations 102
Bibliography
Bibliography of Soviet works on interval
computations. Part III 103
Requirements for manuscript preparation 116
Requirements for manuscript preparation (in Russian) 117
Addresses of editorial board members 118
Contents 120
====================================================================
Interval Computations. - 1993. - N 2. - 210 p.
(Special Issue: Proceedings of the International Conference on
Numerical Analysis with Automatic Result Verification. Lafayette,
Louisiana, USA, Feb. 25 - March 1, 1993. - Vol. 1)
CONTENTS
>From the Editor 2
>From the Editor (in Russian) 3
Foreword by Prof. R. B. Kearfott 4
Fernando L. Alvarado and Zian Wang
Direct Sparse Interval Hull Computations for Thin Non-M-Matrices 5
A. B. Babichev, O. B. Kadyrova, T. P. Kashevarova,
A. S. Leshchenko, and A. L. Semenov
UniCalc, a Novel Approach to Solving Systems of Algebraic
Equations 29
Daniel Berleant
Automatically Verified Reasoning with Both
Intervals and Probability Density Functions 48
Ole Caprani, Brian Godthaab, and Kaj Madsen
Use of a Real-Valued Local Minimum in Parallel Interval
Global Optimization 71
Iliano Cervesato, Angelo Montanari, Alessandro Provetti
On the Non-monotonic Behaviour of Event Calculus
for Deriving Maximal Time Intervals 83
Amanda E. Connell and Robert M. Corless
An Experimental Interval Arithmetic Package in Maple 120
Jeffrey S. Ely
The VPI Software Package for Variable Precision
Interval Arithmetic 135
J. Garloff
The Bernstein Algorithm 154
Gregory D. Hager
Solving Large Systems of Nonlinear Constraints with
Application to Data Modeling 169
Meetings
Applications of Interval Computations: International
Workshop 201
Requirements for manuscript preparation 205
Requirements for manuscript preparation (in Russian) 206
Addresses of the editorial board members 207
Contents 209
====================================================================
Interval Computations. - 1993. - N 3. - 208 p.
(Special Issue: Proceedings of the International Conference on
Numerical Analysis with Automatic Result Verification. Lafayette,
Louisiana, USA, Feb. 25 - March 1, 1993. - Vol. 2)
CONTENTS
E. R. Hansen
Computing Zeros of Functions Using Generalized
Interval Arithmetic 3
C. Hu, R. B. Kearfott, and A. Awad
On Bounding the Range of Some Elementary Functions
in FORTRAN-77 29
R. Van Iwaarden
Automatic Differentiation Applied to Unconstrained
Nonlinear Optimization with Result Verification 41
L. Jaulin and E. Walter
Guaranteed Nonlinear Parameter Estimation via
Interval Computations 61
J. B. Keiper
Interval Arithmetic in Mathematica 76
L. J. Kohout and I. Stabile
Interval-Valued Inference in Medical Knowledge-Based
System CLINAID 88
C. Falco Korn and Ch. Ullrich
Verified Solution of Linear Systems Based on Common
Software Libraries 116
B. P. Kristinsdottir, Z. B. Zabinsky, T. Csendes,
and M. E. Tuttle
Methodologies for Tolerance Intervals 133
A. Leclerc
Parallel Interval Global Optimization and
Its Implementation in C++ 148
S. M. Markov
Some Interpolation Problems Involving Interval Data 164
M. Nakamura, R. Mines, and V. Kreinovich
Guaranteed Intervals for Kolmogorov's Theorem (and Their
Possible Relation to Neural Networks) 183
Advertisement
Journal of Symbolic Computations: Special Issue on
Validated Numerical Methods and Computer Algebra 200
Requirements for manuscript preparation 202
Requirements for manuscript preparation (in Russian) 203
Addresses of the editorial board members 204
Contents 206
====================================================================
Interval Computations. - 1993. - N 4. - 220 p.
(Special Issue: Proceedings of the International Conference on
Numerical Analysis with Automatic Result Verification. Lafayette,
Louisiana, USA, Feb. 25 - March 1, 1993. - Vol. 3)
CONTENTS
V. M. Nesterov
How To Use Monotonicity-Type Information To Get Better
Estimates of the Range of Real-Valued Functions 3
J. Rohn
Cheap and Tight Bounds: The Recent Result by
E. Hansen Can Be Made More Efficient 13
M. J. Schaefer
Precise Zeros of Analytic Functions Using
Interval Arithmetic 22
C. A. Schnepper and M. A. Stadtherr
Application of a Parallel Interval Newton/Generalized
Bisection Algorithm to Equation-Based Chemical Process
Flowsheeting 40
M. J. Schulte and E. E. Swartzlander, Jr.
Parallel Hardware Designs for Correctly Rounded
Elementary Functions 65
L. Simcik and P. Linz
Boundary-Based Interval Newton's Method 89
O. Sirisaengtaksin and V. Kreinovich
Neural Networks That Are Not Sensitive To The
Imprecision of Hardware Neurons 100
U. Storck
Verified Calculation of the Nodes and Weights
for Gaussian Quadrature Formulas 114
I. B. Turksen
Interval Valued Fuzzy Sets and Fuzzy Connectives 125
V. M. Veliov
Computation of Integrals of Uncertain Vector Functions 143
E. Villa, A. Bernat, and V. Kreinovich
Estimating Errors of Indirect Measurement on Realistic
Parallel Machines: Routings on 2-D and 3-D Meshes
That are Nearly Optimal 154
K. Villaverde and V. Kreinovich
A Linear-Time Algorithm That Locates Local Extrema of a
Function of One Variable From Interval Measurement Results 176
A. G. Yakovlev
Multiaspectness and Localization 195
Meetings
J. Wolff von Gudenberg
International Conference INTERVAL'94 210
Advertisement 212
Requirements for manuscript preparation 214
Requirements for manuscript preparation (in Russian) 215
Addresses of the editorial board members 216
Contents 218
====================================================================
Interval Computations. - 1994. - N 1. - 116 p.
CONTENTS
>From the Editor 2
>From the Editor (in Russian) 3
Mathematical Research
G. Alefeld and G. Mayer
A Computer Aided Existence and Uniqueness Proof
for an Inverse Matrix Eigenvalue Problem 4
W. J. Luther and W. Otten
Verified Inclusion for Eigenvalues of Hill's Equation 28
G. L. Kozina and V. A. Perepelitsa
Interval Spanning Trees Problem:
Solvability and Computational Complexity 42
H. Schwandt
Suboptimal Enclosures for the Interval Buneman Algorithm
for Arbitrary Block Dimension 51
O. B. Ermakov
Solving Systems of Ordinary Differential Equations Using
Adams' Interpolation Method with Guaranteed Accuracy 90
Teaching
G. G. Menshikov
On Different Definitions of Interval Extension:
Problems of Teaching 96
Amendment 99
Bibliography
Bibliography of Soviet Works on Interval Computations.
Part V 100
Requirements for manuscript preparation 110
Requirements for manuscript preparation (in Russian) 111
Addresses of the editorial board members 112
Contents 114
====================================================================
Interval Computations. - 1994. - N 2. - 132 p.
CONTENTS
>From the Editor 2
>From the Editor (in Russian) 4
Mathematical Research
S. P. Shary
Solving the Tolerance Problem
for Interval Linear Systems 6
N. S. Dimitrova and S. M. Markov
On Validated Newton Type Method
for Nonlinear Equations 27
V. A. Podchukayev and I. M. Svetlov
An Analytical Method of Constructing
Hurwitz Interval Polynomials 52
Applications and Studies of Related Disciplines
M. Berz and G. Hoffstaetter
Exact Bounds on the Long Term Stability
of Weakly Nonlinear Systems Applied to the
Design of Large Storage Rings 68
V. Kreinovich, T. Swenson, and A. Elentukh
Interval Approach to Testing Software 90
Meetings
1st All-Russian Conference on Countinuous Logic
and Its Applications 110
1st All-Russian Conference on Countinuous Logic
and Its Applications (in Russian) 110
Bibliography
Bibliography of Soviet Works on Interval Computations.
Part VI 116
Requirements for manuscript preparation 127
Requirements for manuscript preparation (in Russian) 128
Addresses of the editorial board members 129
Contents 131
====================================================================
Interval Computations. - 1994. - N 3. - 128 p.
CONTENTS
Foreword by the Invited Editors of the Special Issue 2
Foreword by the Invited Editors of the Special Issue (in Russian) 4
V. Kreinovich and A. Bernat
Parallel Algorithms for Interval Computations:
An Introduction 6
E. Lyager
Finding Local Extremal Points by Using Parallel
Interval Methods 63
K. Madsen and O. Toft
A Parallel Method for Linear Interval Equations 81
M. Plum
Enclosures for Solutions of Parameter-Dependent
Nonlinear Elliptic Boundary Value Problems:
Theory and Implementation on a Parallel Computer 106
Requirements for manuscript preparation 122
Requirements for manuscript preparation (in Russian) 123
Addresses of the editorial board members 124
Contents 126
====================================================================
Interval Computations. - 1994. - N 4. - 128 p.
CONTENTS
Foreword by Prof. H. Stetter 2
Foreword by Prof. H. Stetter (in Russian) 3
S. Christiansen
Interval Methods and Condition Numbers
of Linear Algebraic Systems 4
M. Daumas and D. W. Matula
Rounding of Floating Point Intervals 28
M. Daumas, Ch. Mazenc, and J.-M. Muller
Towards a User Transparent Interval Arithmetic 46
M. T. Nakao
Numerical Verifications of Solutions
for Nonlinear Hyperbolic Equations 64
W. Luther and W. Otten
Computation of Standard Interval Functions
in Multiple-Precision Interval Arithmetic 78
E. D. Popova
Extended Interval Arithmetic
in IEEE Floating-Point Environment 100
Addresses of the editorial board members 130
Contents 132
====================================================================
Reliable Computing. - 1995. - N 1 (1). - 103 p.
CONTENTS
Preface 3
Preface (in Russian) 5
Mathematical research
Formulas for the width of interval products
Helmut Ratschek and Jon G. Rokne 9
Inner estimation of the united solution set of interval linear
algebraic system
Ludmila Kupriyanova 15
Why intervals? A simple limit theorem that is similar to limit
theorems from statistics
Vladik Kreinovich 33
A combined method for enclosing all solutions of nonlinear systems
of polynomial equations
Christine Jager and Dietmar Ratz 41
Parallel Algorithms for Interval Computations
An informal introduction to a high level language with applications
to interval mathematics
Daniel E. Cooke 65
A parallel interval method implementation for global optimization
using dynamic load balancing
Jerry Eriksson and Per Lindstrom 77
Meetings
Interval sessions at NAFIPS/IFIS/NASA'94
Vladik Kreinovich and Hung T. Nguyen 93
Addresses of the Editorial Board Members 99
Information for Authors 101
Contents 103
====================================================================
Reliable Computing. - 1995. - 1 (2) - 102 p.
(Special Issue: Parallel Algorithms for Interval Computations)
CONTENTS
Preface (in Russian) 107
>From the Editor 108
Parallel interval-based reasoning in medical knowledge-based
system CLINAID
Ladislav J. Kohout, Isabel Stabile, Hasan
Kalantar, Maria F. San-Andres, and John Anderson 109
Applications of interval computations to earthquake-resistant
engineering: How to compute derivatives of interval functions
fast
Vladik Kreinovich, David Nemir, and Efren Gutierrez 141
A reliable linear algebra library for transputer networks
Christian P. Ullrich and Roman Reith 173
Parallel accurate linear algebra subroutines
Jurgen Wolff von Gudenberg 189
Addresses of the Editorial Board Members 201
Information for Authors 203
Contents 205
====================================================================
Reliable Computing. - 1995. - 1 (3) - 162 p.
(Special Student Issue)
CONTENTS
Editors' Introduction 209
Mathematical research
Application of interval Newton's method to chemical engineering
problems
Gopalan V. Balaji and J. D. Seader 215
Ockham's razor in interval identification
Bo H. Friesen and Vladik Kreinovich 225
An automatic and guaranteed determination of the number of roots
of an analytic function interior to a simple closed curve in the
complex plane
Jonathan Herlocker and Jeffrey Ely 239
A general iterative sparse linear solver and its parallelization
for interval Newton methods
Chenyi Hu, Anna Frolov, R. Baker Kearfott, and Qing Yang 251
Optimizing INTBIS on the CRAY Y-MP
Chenyi Hu, Joe Sheldon, R. Baker Kearfott, and Qing Yang 265
Study on sampling techniques with CMMs
Thomas J. McLean and David H. Xu 275
A new characterization of the set of all intervals, based on the
necessity to check consistency easily
Driss Misane and Vladik Kreinovich 285
Interpolation that leads to the narrowest intervals and its
application to expert systems and intelligent control
Hung T. Nguyen, Vladik Kreinovich, Bob Lea, and Dana Tolbert 299
A parallel complex zero finder
Mark J. Schaefer and Tilmann Bubeck 317
A software interface and hardware design for variable-precision
interval arithmetic
Michael J. Schulte and Earl E. Swartzlander, Jr. 325
A bright side of NP-hardness of interval computations: interval
heuristics applied to NP-problems
Bonnie Traylor and Vladik Kreinovich 343
Information
Special Issue 361
1994 Lotfi A. Zadeh Best Paper Award in the field of fuzzy logic 362
Addresses of the Editorial Board Members 363
Information for Authors 365
Contents 367
====================================================================
Reliable Computing. - 1995. - 1 (4) - 72 p.
CONTENTS
Preface 371
Mathematical research
Matrix computation of subresultant polynomial remainder
sequences in integral domains
Alkiviadis G. Akritas, Evgenia K. Akritas, and Genadii I.
Malaschonok 375
Numerical methods using defects
Boris S. Dobronets 383
An estimate of the absolute value and width of the solution of
a linear system of equations with tridiagonal interval matrix by
the interval sweep method A. N. Ostylovsky 393
Verification methods for inclusion disks
Ljiljana D. Petkovic and Miroslav Trajkovic 403
Design of a parallel linear algebra library for verified
computation
J. Wolff von Gudenberg 411
Computation of the stability radius of a Schur polynomial: an
orthogonal projection approach
Q.-H. Wu and M. Mansour 421
Meetings
International conference on interval methods and computer aided
proofs in science and engineering INTERVAL'96 431
II Workshop on Interval Arithmetic 433
IMACS-GAMM International Symposium on Numerical Methods and
Error Bounds
S. Shary 434
Addresses of the Editorial Board Members 436
Information for Authors 438
Amendments 439
Contents 440
====================================================================
Reliable Computing. - 1996. - N 2 (1). - 92 p.
CONTENTS
Mathematical research
Algebraic approach to the interval linear static identification,
tolerance, and control problems, or One more application of
Kaucher arithmetic
Sergey P. Shary 3
Bounds of high quality for first kind Volterra integral equations
Hans-Juergen Dobner 35
Variable-precision, interval arithmetic coprocessors
Michael J. Schulte and Earl E. Swartzlander, Jr. 47
Letters to the Editor
Maximum entropy and interval computations (September notes on
summer impressions)
Vladik Kreinovich 63
Information
Best student paper award
Vladik Kreinovich and Guenter Mayer 81
Call for Papers: Student Issues of Reliable Computing 81
Call for Papers: Special Issue of Reliable Computing on
Applications to Geosciences 82
Meetings
SCAN'95: International Symposium on Scientific Computing,
Computer Arithmetic and Validated Numerics
Andreas Frommer 84
SONIC'95: Student Mini-Symposium on Interval Computations
Vladik Kreinovich 86
Interval talks at the first El Paso Shell Oil Symposium
Vladik Kreinovich 88
Addresses of the Editorial Board members 89
Information for authors 91
Contents 92
====================================================================
Reliable Computing. - 1996. - N 2 (2). - 114 p.
CONTENTS
Preface 95
Mechanising the theory of intervals using OBJ3
Marcilia A. Campos, Augusto C. A. Sampaio, and Alexandre H. F.
Brainer 97
Errors in vector processing and the library libavi.a
Tiaraju A. Diverio, Ursula A. Fernandes, and Dalcidio
M. Claudio 103
Chebyshev acceleration techniques for large complex non
Hermitian eigenvalue problems
Vincent Heuveline and Miloud Sadkane 111
Interval methods that are guaranteed to underestimate (and the
resulting new justification of Kaucher arithmetic)
Vladik Kreinovich, Vyacheslav M. Nesterov, and Nina A. Zheludeva 119
On the computational complexity of the solution of linear
systems with moduli
Anatoly V. Lakeyev 125
Software for high radix on-line arithmetic
Thomas Lynch and Michael J. Schulte 133
Self-correcting polynomial programs
Guevara Noubir and Henri J. Nussbaumer 139
Reducing division latency with reciprocal caches
Stuart F. Oberman and Michael J. Flynn 147
Interval approach challenges Monte Carlo simulation
Janne Pesonen and Eero Hyvonen 155
Interval operations involving NaNs
Evgenija D. Popova 161
Enclosing solutions of overdetermined systems of linear interval
equations
Jiri Rohn 167
Numerical solutions of Burgers' equation with a large Reynolds
number
Masaaki Sugihara and Seiji Fujino 173
Rank of convex combinations of matrices
Tomasz Szulc 181
Locating, characterizing and computing the stationary points of
a function
Michael N. Vrahatis and Evangelia C. Triantafyllou 187
Reviews
Applications of Reliable Scientific Computing 195
Addresses of the Editorial Board members 204
Information for authors 206
Contents 207
====================================================================
Reliable Computing. - 1996. - N 2 (3). - 108 p.
CONTENTS
Preface 211
Robust algorithms that locate local extrema of a function of one
variable from interval measurement results: A remark
Christoph Eick and Karen Villaverde 213
Fast error estimates for indirect measurements: applications to
pavement engineering
Carlos Ferregut, Soheil Nazarian, Krishnamohan Vennalaganti,
Ching-Chuan Chang, and Vladik Kreinovich 219
Newton's constant of gravitation and verified numerical
quadrature
Oliver Holzmann, Bruno Lang, and Holger Schutt 229
Two adaptive Gauss-Legendre type algorithms for the verified
computation of definite integrals
Walter Kraemer and Stefan Wedner 241
A quadratic-time algorithm for smoothing interval functions
Vladik Kreinovich and Karen Villaverde 255
Optimal interval enclosures for fractionally-linear functions,
and their application to intelligent control
Robert N. Lea, Vladik Kreinovich, Raul Trejo 265
If we measure a number, we get an interval. What if we measure a
function or an operator?
Joe Lorkowski and Vladik Kreinovich 287
New slope methods for sharper interval functions and a note on
Fischer's acceleration method
Joao B. Oliveira 299
Ordering events: Intervals are sufficient, more general sets are
usually not necessary
Alessandro Provetti 321
Reviews
Applications of Reliable Scientific Computing 329
Addresses of the Editorial Board members 332
Information for authors 334
Contents 335
====================================================================
Reliable Computing. - 1996. - N 2 (4). - 70 p.
CONTENTS
Preface 339
Mathematical research
Linear interval equations: Computing enclosures with bounded
relative or absolute overestimation is NP-hard
Vladik Kreinovich and Anatoly V. Lakeyev 341
On the speed of convergence of the total step iterative method
for a class of interval linear algebraic systems
Marina A. Lyashko 351
Improving the efficiency index in enclosing a root of an
equation
Yixun Shi 357
Applications
Some examples using the interval data type in the relational
database model
John W. Starner 373
* * *
Paul Erd\"os, 1913-1996 383
Letters to the Editor
Double bubble minimizes: Interval computations help in solving
a long-standing geometric problem
Vladik Kreinovich 387
Information
Reliable Computing in 1997 389
Peter Fishburn receives von Neumann prize 390
Best student paper award
Vladik Kreinovich and G\"unter Mayer 390
Meetings
WAI'96: II Workshop on Computer Arithmetic, Interval and
Symbolic Computations
Marcilia A. Campos 391
Interval'96: International Conference on Interval Methods and
Computer Aided Proofs in Science and Engineering
J. Wolff von Gudenberg 392
Interval Talks at FUZZ-IEEE'96
Erich Peter Klement and Vladik Kreinovich 394
Addresses of the Editorial Board members 402
Information for authors 404
Contents 405
====================================================================
=== To get issues of 1991-1996 please contact to Editor-in-Chief ===
====================================================================
====================================================================
To get issues of 1997- please contact to Kluwer Academic Publishers
====================================================================
====================================================================
Reliable Computing. - 1997. - Vol. 3, N 1. - Pp. 1-102.
CONTENTS
Foreword
1 - 4
Mathematical research
Inclusion of Zeros of Nowhere Differentiable n-Dimensional Functions
Siegfried M. Rump
5 - 16
Sharpness in Interval Computations
Eldon R. Hansen
17 - 29
An Interval Algorithm for Bounding the Ranges
of Real-Valued Functions of One Real Variable
Michael A. Wolfe
31 - 50
NP-Hard Classes of Linear Algebraic Systems with Uncertainties
Anatoly V. Lakeyev
Vladik Kreinovich
51 - 81
Use of Interval Slopes for the Irrational Part of Factorable Functions
Lubomir V. Kolev
83 - 93
Letters to the Editor
>From Numerical Intervals to Set Intervals
(Interval-Related Results Presented at the First International
Workshop on Applications and Theory of Random Sets)
Hung T. Nguyen
Vladik Kreinovich
95 - 102
====================================================================
Reliable Computing. - 1997. - Vol. 3, N 2. - Pp. 103-194.
CONTENTS
Mathematical research
Algebraic Approach in the ``Outer Problem'' for Interval Linear
Equations
Sergey P. Shary
103 - 135
Numerical Verifications of Solutions for
Nonlinear Parabolic Equations in One-Space Dimensional Case
Teruya Minamoto
Mitsuhiro T. Nakao
137 - 147
Is Solar System Stable? A Remark
Vladik Kreinovich
Andrew Bernat
149 - 154
Computing the Value of a Boolean Expression with Interval
Inputs is NP-Hard
Leticia S. Chee
155 - 172
Sign-Stable Solutions of Column-Vague Linear Equation Systems
Josef Nedoma
173 - 180
Reviews: Applications of Reliable Scientific Computing
181 - 187
Information on New Textbooks
188 - 190
Letters to the Editor
Interval-Related Talks at the 1996 International Workshop on
Control Mechanisms for Complex Systems
191 - 193
====================================================================
Reliable Computing. - 1997. - Vol. 3, N 4 (Special issue:
Proceedings of the International Conference on Interval Methods in
Science and Engineering INTERVAL'96, September 30 - October 2, 1996,
Wuerzburg, Germany). - Pp. 195-347.
CONTENTS
Slope Methods of Higher Order for the Inclusion
of Complex Roots of Polynomials
Ljiljana D. Petkovic, Slobodan Trickovic, and
Miodrag S. Petkovic 349 - 362
On Overestimations Produced by the Interval
Gaussian Algorithm (Dedicated to
Prof. Dr. Gerhard Heindl on the occasion
of his 60th birthday)
Jiri Rohn 363 - 368
Interval and Twin Arithmetics
Vyacheslav M. Nesterov 369 - 380
Finding Global Minima of Maximum Functions
by Using Exclusion Functions
without Derivatives
Ferenc Kalovics and Gabriella Meszaros 381 - 399
A New Approach to the Modal Regulator
Synthesis for Interval Plant with Scalar Input
Yelena M. Smagina 401 - 410
Error Reduction of the Taylor Centered Form
by Half and an Inner Estimation of the Range
Volker Stahl 411 - 420
How to Compute Interval Inclusions of
Geodetic Coordinates from
Interval Inclusions of Cartesian Coordinates
Gerhard Heindl 421 - 435
On a Theoretical Justification of the
Choice of Epsilon-Inflation in PASCAL-XSC
Vladik Kreinovich, Scott Starks,
and Guenter Mayer 437 - 445
Reviews:
Applications of Reliable Scientific Computing 447 - 452
Interval and Complexity Workshops Back-to-Back
with 1997 ACM Symposium on
Theory of Computing (STOC'97)
Luc Longpre and Martin Berz 453 - 457
Interval-Related Talks at NASA URC Conference
Monica Nogueira 459 - 460
Reliable Computing
Special Issue on Reliable Geometric Computations
Co-editors: H. Ratschek and J. Rokne 461 - 462
Best Paper Award to Zdzislaw Pawlak 463
Patrick Suppes is 75 464
From owner-reliable_computing Tue Oct 14 08:29:30 1997
Received: by interval.usl.edu id AA01708
(5.65c/IDA-1.4.4 for reliable_computing-outgoing); Tue, 14 Oct 1997 07:32:53 -0500
Received: from relay.cs.ruu.nl (infix.cs.ruu.nl) by interval.usl.edu with SMTP id AA01702
(5.65c/IDA-1.4.4 for ); Tue, 14 Oct 1997 07:32:38 -0500
Received: from ysaye.cs.ruu.nl (frankb [at] ysaye [dot] cs.ruu.nl [131.211.80.244])
by relay.cs.ruu.nl (8.8.5/8.8.5/UU-CS) with ESMTP id OAA12970;
Tue, 14 Oct 1997 14:30:06 +0200 (METDST)
Received: (frankb@localhost) by ysaye.cs.ruu.nl (8.6.12/8.6.12/ehk) id OAA18284; Tue, 14 Oct 1997 14:29:34 +0200
From: "Frank de Boer"
Message-Id: <9710141429.ZM18282 [at] ysaye [dot] cs.ruu.nl>
Date: Tue, 14 Oct 1997 14:29:30 -0600
X-Mailer: Z-Mail (3.2.1 6apr95 MediaMail)
To: frankb [at] cs [dot] ruu.nl
Subject: Call for Participation
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Sender: owner-reliable_computing
Precedence: bulk
The CP97 Workshop
CONCURRENT CONSTRAINT PROGRAMMING FOR TIME-CRITICAL APPLICATIONS
(COTIC)
***************************CALL FOR
PARTICIPATION*******************************
Scope of the workshop:
~~~~~~~~~~~~~~~~~~~~~
Many applications in, for example, robotics, worldwide information
networks, decision support systems, distributed multimedia computing
and deductive temporal databases have time-critical aspects.
Programming concepts related to time have been mainly developed in the
context of imperative programming. However, recently several
extensions of declarative languages, and in particular of constraint
languages, have been proposed in order to deal with the difficulties
of time-critical applications. In fact, some of these difficulties can
be better resolved within a framework which facilitates the transition
from specifications to programs, supports rapid prototyping, allows
simple methodologies for program correctness and admits simple
concurrent extensions.
The aim of this workshop is to discuss any aspect of
time-critical computations within the paradigm of (concurrent) logic
and constraint programming including: Language design, implementation,
hybrid systems, temporal deductive databases, semantic models,
specification, verification and analysis methods, constraint domains
and solvers for temporal reasoning, temporal aspects of internet and
multimedia computing, applications.
The workshop is organized in conjunction with the
Third International Conference on Principles and Practice
of
Constraint Programming
(CP97, Schloss Hagenberg, Austria, October 29 - November 1, 1997: see
http://www.mpi-sb.mpg.de/conferences/CP97/cp97CFP.html).
The workshop is supported by the ESPRIT Working Group COTIC
(concurrent constraint programming for time critical applications: see
http://www.cs.ruu.nl/people/frankb/www.dvi) and will be held together
with the first meeting of the Working Group.
Below you will find the program of the COTIC workshop.
Further information on registration and hotel reservation can be found
at the CP97 WWW page (http://www.mpi-sb.mpg.de/conferences/CP97).
Looking forward seeing you at COTIC,
Frank de Boer and Maurizio Gabbrielli (organizers)
***************************The COTIC Program***********************************
Monday 27 October
Session I
14.00 -- 15.00: V. Saraswat (invited talk): Title to be announced.
15.00 -- 15.30: F.S. de Boer, M. Gabbrielli and M.C. Meo.
Modelling real-time in concurrent constraint programming.
15.30 -- 16.00: Break.
Session II
16.00 -- 16.30: K.R. Apt.
The Essence of Constraint Propagation.
16.30 -- 17.00: A. Maggiolo-Schettini.
Developing timed specifications by retiming techniques.
17.00 -- 17.30: A. King.
Analysis of constraint logic programs with dynamic scheduling.
Tuesday 28 October
Session III
09.00 -- 10.00: T. Arts (Ericsson): Erlang and its applications.
10.00 -- 10.30: L. Monteiro. A synchronous TAO.
10.30 -- 11.00: Break.
Session IV
11.00 -- 11.30: Lubos Brim, David Gilbert, Jean-Marie Jacquet
and Mojmir Kretinsky.
Temporal Synchronous Concurrent Constraint Programming.
11.30 -- 12.00: A. Merceron and G. Michele Pinna.
Refinement and Modular Verification.
12.00 -- 14.00: Lunch.
Session V
14.00 -- 14.30: Alessandra Di Pierro and Herbert Wiklicky.
Probabilistic constraint programming.
14.30 -- 15.00: M. Fromherz and J. Conley.
Issues in Reactive Constraint Solving.
15.00 -- 15.30: Break.
Session VI
15.30 -- 16.00 T. Sjoland.
SICS's perspective on timed concurrent constraint programming.
16.00 -- 16.30: E. de Jong (Holland Signaal).
Time-critical applications at Signaal.
16.30 -- 17.00: S. Etalle. To be announced.
From owner-reliable_computing Wed Oct 15 15:15:01 1997
Received: by interval.usl.edu id AA02405
(5.65c/IDA-1.4.4 for reliable_computing-outgoing); Wed, 15 Oct 1997 06:15:12 -0500
Received: from animal.cs.chalmers.se by interval.usl.edu with SMTP id AA02399
(5.65c/IDA-1.4.4 for ); Wed, 15 Oct 1997 06:15:06 -0500
Received: (from johanj@localhost)
by animal.cs.chalmers.se (8.8.5/8.8.5) id NAA25480
for reliable_computing [at] interval [dot] usl.edu; Wed, 15 Oct 1997 13:15:01 +0200 (MET DST)
Date: Wed, 15 Oct 1997 13:15:01 +0200 (MET DST)
From: Johan Jeuring
Message-Id: <199710151115.NAA25480 [at] animal [dot] cs.chalmers.se>
To: reliable_computing [at] interval [dot] usl.edu
Subject: 2nd cfp MPC'98: Mathematics of Program Construction
Mime-Version: 1.0
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: quoted-printable
Sender: owner-reliable_computing
Precedence: bulk
MPC '98
Fourth International Conference on=20
MATHEMATICS OF PROGRAM CONSTRUCTION
-----------------------------------
http://www.md.chalmers.se/Conf/MPC98/
=20
June 15 - 17, 1998
Marstrand, Sweden
Post-conference workshops:=20
* Workshop on Generic Programming, WGP'98
http://www.cse.ogi.edu/PacSoft/conf/wgp/
* International Workshop on Constructive Methods for=20
Parallel Programming, CMPP'98
http://brahms.fmi.uni-passau.de/cl/cmpp98/index.html
* Formal Techniques for Hardware and Hardware-like=20
Systems, FTH'98
http://www.cs.chalmers.se/~ms/FTH98/
CALL FOR PAPERS
The general theme of this series of conferences is the use of crisp,
clear mathematics in the discovery and design of algorithms and in the
development of corresponding software or hardware. The conference
theme reflects the growing interest in formal, mathematically based
methods for the construction of software and hardware. The goal of the
MPC conferences is to report on and significantly advance the state of
the art in this area. Previous conferences were held in 1989 at
Twente, The Netherlands, organised by the Rijksuniversiteit Groningen, in
1992 at Oxford, United Kingdom, and in 1995 at Kloster Irsee, Germany,
organised by Augsburg University.
SUBMISSION
=20
Full papers should be submitted in Postscript format by e-mail to
reach Johan Jeuring by December 15, 1997. The details of the
submission procedure can be found at
http://www.md.chalmers.se/Conf/MPC98/how_to_submit.html=20
Although there is no page limit, submissions should strive for
brevity. Simultaneous submission to the conference and a
post-conference workshop is allowed.
TOPICS
The emphasis is on the combination of c o n c i s e n e s s and=20
p r e c i s i o n in c a l c u l a t i o n a l t e c h n i q u e s=20
for program construction. We solicit high quality papers on original
research, typically in one of the following areas:
- formal specification of sequential and concurrent programs;
- constructing implementations to meet specifications;
in particular,
- program transformation;
- program analysis;
- program verification;
- convincing case studies.
While this list is not exclusive it is intended to show the focus of the
conference.
We expect to publish the proceedings as a Springer LNCS, ready at
the conference.
VENUE
Marstrand is a small island on the beautiful westcoast of Sweden, 40
km from G=F6teborg. The charming old houses, the fortress, the walking
paths, and the absence of cars make this island a very pleasant
resort. There are direct flights to G=F6teborg Landvetter from most
European main cities, and busses from G=F6teborg to Marstrand.
PROGRAMME COMMITTEE=20
Ralph-Johan Back Finland =20
Roland Backhouse The Netherlands =20
Richard Bird UK =20
Eerke Boiten UK =20
Dave Carrington Australia =20
Robin Cockett Canada =20
David Gries USA =20
Lindsay Groves New Zealand=20
Wim Hesselink The Netherlands=20
Zhenjiang Hu Japan=20
Barry Jay Australia=20
Johan Jeuring Sweden (Chair)=20
Dick Kieburtz USA =20
Christian Lengauer Germany =20
Lambert Meertens The Netherlands =20
Sigurd Meldal Norway =20
Bernhard M=F6ller Germany
Chris Okasaki USA=20
Jose Oliveira Portugal
Ross Paterson UK =20
Mary Sheeran Sweden =20
Doug Smith USA =20
LOCAL ORGANISATION
MPC '98 is organised by the Computing Science department of Chalmers
University of Technology and University of G=F6teborg. The organisation
committee consists of the following people:
Patrik Jansson
Johan Jeuring
Marie Larsson
Mary Sheeran
IMPORTANT DATES
Submission December 15, 1997
Notification February 9, 1998
Final version due March 30, 1998
POST-CONFERENCE WORKSHOPS
The following one-day workshops are being organised in conjunction with=20
MPC '98 and will take place after the main conference.
* International Workshop on Generic Programming.=20
http://www.cse.ogi.edu/PacSoft/conf/wgp/
* International Workshop on Constructive Methods for=20
Parallel Programming, CMPP'98:
http://brahms.fmi.uni-passau.de/cl/cmpp98/index.html
* Formal Techniques for Hardware and Hardware-like Systems, FTH'98:
http://www.cs.chalmers.se/~ms/FTH98/
CORRESPONDENCE
Johan Jeuring (MPC '98)
Department of Computing Science
Chalmers University of Technology
S-412 96 G=F6teborg
Sweden
E-mail: mpc98 [at] cs [dot] chalmers.se
Fax: +46 31 165655
From owner-reliable_computing Thu Oct 16 18:13:59 1997
Received: by interval.usl.edu id AA03384
(5.65c/IDA-1.4.4 for reliable_computing-outgoing); Thu, 16 Oct 1997 09:16:27 -0500
Received: from rztsun.rz.tu-harburg.de by interval.usl.edu with SMTP id AA03378
(5.65c/IDA-1.4.4 for ); Thu, 16 Oct 1997 09:16:20 -0500
Message-Id: <34462127.446B@tu-harburg.de>
Date: Thu, 16 Oct 1997 16:13:59 +0200
From: Jens Zemke
Organization: TU Hamburg-Harburg
X-Mailer: Mozilla 2.01 (X11; I; AIX 1)
Mime-Version: 1.0
To: reliable_computing [at] interval [dot] usl.edu
Subject: Does a modified CG for IA * ix = ib exist?
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Sender: owner-reliable_computing
Precedence: bulk
I wonder if anyone could tell me if there is a modified version of the
CG-Algorithm of Hestenes and Stiefel (or some other iterative method)
which is useful in solving large (sparse) Interval Linear Systems like
given: IA * ix = ib , IA \in IR^(n,n), ib in IR^n
wanted: ix \subset IR^n with ib \subset IA * ix.
The aim is to compute less than all n search directions but to have
still an enclosure of the solution set.
If anyone on this list knows about recent developments in this direction
(IA symmetric, IA M-matrix, IA SPD ...), I would be very thankful for a
short mail including a list of articles and authors (if known).
If there is a known proof that there can't be any iterative method like
CG for this class of problems, I would be also be very happy to know
about.
--
email: zemke@tu-harburg.de
url: http://www.tu-harburg.de/~matjz
From owner-reliable_computing Fri Oct 17 10:44:50 1997
Received: by interval.usl.edu id AA04105
(5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 17 Oct 1997 01:45:37 -0500
Received: from Pap.UniVie.AC.AT (apap4.pap.univie.ac.at) by interval.usl.edu with SMTP id AA04099
(5.65c/IDA-1.4.4 for ); Fri, 17 Oct 1997 01:45:33 -0500
Received: from homer.cma.univie.ac.at by Pap.UniVie.AC.AT (PMDF V5.0-4 #10670)
id <01IOWOCJ28PC8WXYMB [at] Pap [dot] UniVie.AC.AT>; Fri, 17 Oct 1997 08:45:00 +0100 (MET)
Received: by homer.cma.univie.ac.at (5.65v3.2/1.1.10.5/19Mar97-1148AM)
id AA15256; Fri, 17 Oct 1997 08:44:50 +0200
Date: Fri, 17 Oct 1997 08:44:50 +0200
From: Arnold Neumaier
Subject: Re: Does a modified CG for IA * ix = ib exist?
To: reliable_computing [at] interval [dot] usl.edu, zemke@tu-harburg.de
Cc: neum [at] homer [dot] cma.univie.ac.at
Message-Id: <9710170644.AA15256 [at] homer [dot] cma.univie.ac.at>
Content-Transfer-Encoding: 7BIT
Sender: owner-reliable_computing
Precedence: bulk
Jens Zemke asked,
>>
if there is a modified version of the
CG-Algorithm of Hestenes and Stiefel (or some other iterative method)
which is useful in solving large (sparse) Interval Linear Systems.
<<
Nothing has been done so far on this, and it is very unlikely that
there will ever be a useful interval version of CG. Indeed, CG is
already numerically unstable in floating-point arithmetic, which
means that considerable cancellation takes place, and this means
exponential explosion of bounds in an interval version. The usual remedy
to use aposteriori estimates is of no help here because one needs
some way to estimate the size of the entries of the inverse matrix.
Arnold Neumaier
From owner-reliable_computing Fri Oct 17 09:02:00 1997
Received: by interval.usl.edu id AA04417
(5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 17 Oct 1997 03:02:26 -0500
Received: from red.nag.co.uk by interval.usl.edu with SMTP id AA04411
(5.65c/IDA-1.4.4 for ); Fri, 17 Oct 1997 03:02:23 -0500
Received: from nldi7.nag.co.uk by red.nag.co.uk via SMTP (920330.SGI/920502.SGI)
for reliable_computing [at] interval [dot] usl.edu id AA24554; Fri, 17 Oct 97 09:02:11 +0100
Received: by nldi7 (920330.SGI/920502.SGI)
for @red.nag.co.uk:reliable_computing [at] interval [dot] usl.edu id AA02728; Fri, 17 Oct 97 09:02:02 +0100
From: vince [at] nag [dot] co.uk (K Vince Fernando)
Message-Id: <9710170802.AA02728@nldi7>
Subject: eigenvalues and SVD
To: reliable_computing [at] interval [dot] usl.edu
Date: Fri, 17 Oct 1997 09:02:00 +0000 (BST)
Mime-Version: 1.0
Content-Type: text/plain; charset=US-ASCII
Content-Transfer-Encoding: 7bit
Content-Length: 302
Sender: owner-reliable_computing
Precedence: bulk
I am thinking of computing eigenvalues and singular values
of matrices as intervals. These are ordinary matrices and not
interval matrices. In particular, my work is directed towards
tridiagonal and bidiagonal matrices. Please let me know if any
work has been done in this direction.
Vince Fernando
From owner-reliable_computing Sat Oct 18 10:02:14 1997
Received: by interval.usl.edu id AA05229
(5.65c/IDA-1.4.4 for reliable_computing-outgoing); Sat, 18 Oct 1997 17:02:20 -0500
Received: from cs.utep.edu by interval.usl.edu with SMTP id AA05223
(5.65c/IDA-1.4.4 for ); Sat, 18 Oct 1997 17:02:17 -0500
Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1)
id AA22157; Sat, 18 Oct 97 16:02:14 MDT
Date: Sat, 18 Oct 97 16:02:14 MDT
From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich)
Message-Id: <9710182202.AA22157 [at] cs [dot] utep.edu>
To: reliable_computing [at] interval [dot] usl.edu
Subject: interval computations and stability of matter
Sender: owner-reliable_computing
Precedence: bulk
Dear Friends,
The latest (November 1997) issue of the Notices of the American
Mathematical Society contains an interesting survey artcle by M. Loss
"The stability of matter interacting with fields". Among other
important papers this survey cites several papers by C. Fefferman and
R. de la Llave about the non-relativistic and relativistic stability of
matter.
The survey describes the physical problem itself and the results, but
not the techniques used in the proofs. For people from this
community it may be interesting to know that these papers actively use
interval computations and similar techniques in their proofs.
Cited papers are written in the 80s. Researchers interested in a more
recent survey and in the detailed exposition of how exactly interval
computations are used may want to look into the corresponding chapter
C. L. fefferman and L..A. Seco "Interval arithmetic in quantum
mechanics" of the 1996 Kluwer book "Applications of Interval
Computations" (editors R. B. Kearfott et al).
Vladik
From owner-reliable_computing Sun Oct 19 03:57:45 1997
Received: by interval.usl.edu id AA05757
(5.65c/IDA-1.4.4 for reliable_computing-outgoing); Sun, 19 Oct 1997 08:59:35 -0500
Received: from bp.ucs.usl.edu by interval.usl.edu with SMTP id AA05751
(5.65c/IDA-1.4.4 for ); Sun, 19 Oct 1997 08:59:32 -0500
Received: from rbk5287.usl.edu (liberty.usl.edu) (liberty.usl.edu [130.70.46.171]) by bp.ucs.usl.edu with SMTP id AA04938
(5.65c/IDA-1.4.4 for ); Sun, 19 Oct 1997 08:59:31 -0500
Message-Id: <2.2.32.19971019135745.0072932c [at] pop [dot] usl.edu>
X-Sender: rbk5287 [at] pop [dot] usl.edu
X-Mailer: Windows Eudora Pro Version 2.2 (32)
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Date: Sun, 19 Oct 1997 08:57:45 -0500
To: reliable_computing [at] interval [dot] usl.edu
From: "R. Baker Kearfott"
Subject: Re: interval computations and stability of matter
Sender: owner-reliable_computing
Precedence: bulk
At 04:02 PM 10/18/97 MDT, Vladik Kreinovich wrote:
>Dear Friends,
>
.
.
.
>Cited papers are written in the 80s. Researchers interested in a more
>recent survey and in the detailed exposition of how exactly interval
>computations are used may want to look into the corresponding chapter
>C. L. fefferman and L..A. Seco "Interval arithmetic in quantum
>mechanics" of the 1996 Kluwer book "Applications of Interval
>Computations" (editors R. B. Kearfott et al).
^^ and V. Kreinovich :-)
Happy reading,
Baker
---------------------------------------------------------------
R. Baker Kearfott, rbk [at] usl [dot] edu (318) 482-5346 (fax)
(318) 482-5270 (work) (318) 981-9744 (home)
URL: http://interval.usl.edu/kearfott.html
Department of Mathematics, University of Southwestern Louisiana
USL Box 4-1010, Lafayette, LA 70504-1010, USA
---------------------------------------------------------------
From owner-reliable_computing Fri Oct 24 07:05:38 1997
Received: by interval.usl.edu id AA08562
(5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 24 Oct 1997 14:06:00 -0500
Received: from cs.utep.edu by interval.usl.edu with SMTP id AA08556
(5.65c/IDA-1.4.4 for ); Fri, 24 Oct 1997 14:05:54 -0500
Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1)
id AA23634; Fri, 24 Oct 97 13:05:38 MDT
Date: Fri, 24 Oct 97 13:05:38 MDT
From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich)
Message-Id: <9710241905.AA23634 [at] cs [dot] utep.edu>
To: reliable_computing [at] interval [dot] usl.edu, interval [at] cs [dot] utep.edu
Subject: a new book of interest to interval researchers
Sender: owner-reliable_computing
Precedence: bulk
Natke, H. Guenther / Ben-Haim, Yakov (eds.)
Uncertainty: Models and Measures
Proceedings of the International Workshop held in
Lambrecht, July 22-24, 1996
Series: Mathematical Research
98.- DM / 715.- vS / 89.- sFr
1997. 276 pages.
ISBN 3-05-501740-4 Akademie Verlag, Berlin
Uncertainty influences the individual as well as society;
so it is important to enhance our understanding of
uncertainty. First of all, do we all agree on a unique
definition of uncertainty in the natural and technological
worlds? Secondly, how can we model uncertainty? Is it
purely a state of mind, the lack of complete knowledge, or
is it a phenomenon in its own right? What heuristic and
mathematical models are available? What types of questions
about uncertainty can be formulated? What questions can be
realistically answered? Do scholars in diverse fields
agree on these issues? These and other questions are
addressed by 20 scholars from mechanical, civil,
electrical, material, aerospace and ocean engineering,
from applied mathematics, economics, industrial
engineering and operations research, control theory,
geodesy, systems science, and philosophy.
With contributions by:
E. Altus (Haifa, Israel), G. Anger (Berlin, Germany), Y.
Ben-Haim (Haifa, Israel), I. Elishakoff (Boca Raton FL,
USA), G. Feichtinger (Vienna, Austria), O. Gottlieb
(Haifa, Israel), V.L. Kharitonov (Lindavista, Mexico),
G.J. Klir (Binghamton NY, USA), U. Kulisch (Karlsruhe,
Germany), R.C.R. Menezes (Porto Alegre, Brasil), H. Moritz
(Graz, Austria), H.G. Natke (Hannover, Germany), S.
Nikolaidis (Blacksburg VA, USA), E. Reithmeier (Hannover,
Germany), G.I. Schueller (Innsbruck, Austria), E. Stein
(Hannover, Germany), P. Suppes (Stanford CA, USA), J.T.P.
Yao (College Station TX, USA), E. Zeheb (Haifa, Israel),
H.-J. Zimmermann (Aachen, Germany).
The book can be ordered from the publisher:
WILEY-VCH
P.O. Box 10 11 61
D-69451 Weinheim
Germany
Phone +49 6201 606 427
Fax +49 6201 606 184
e-mail sales-books@wiley-vch.de
URL http://www.vchgroup.de/books/tis/eng/3-05-501740-4.html
The information about this book and other books of interest to the
interval community can be found on the interval computations website
http://cs.utep.edu/interval-comp/main.html
click on Books.
From owner-reliable_computing Fri Oct 24 14:38:52 1997
Received: by interval.usl.edu id AA08942
(5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 24 Oct 1997 21:39:06 -0500
Received: from cs.utep.edu by interval.usl.edu with SMTP id AA08936
(5.65c/IDA-1.4.4 for ); Fri, 24 Oct 1997 21:39:02 -0500
Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1)
id AA25622; Fri, 24 Oct 97 20:38:52 MDT
Date: Fri, 24 Oct 97 20:38:52 MDT
From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich)
Message-Id: <9710250238.AA25622 [at] cs [dot] utep.edu>
To: reliable_computing [at] interval [dot] usl.edu
Subject: guaranteed computations are needed for foundations of chemistry
Cc: scerri [at] bradley [dot] edu
Sender: owner-reliable_computing
Precedence: bulk
Dear Friends,
The last issue of "American Scientist" contains an article by Eric R.
Scerri "The Periodic Table and the Electron" (Vol. 85, pp. 546--553),
in which he (convincingly) argues that:
* although in principle, equations of quantum mechanics can describe
all chemical properties (or at least such is the common belief),
* in practice, derivation of
* the values of measurable chemical quantities
* from the Schroedinger equations of quantum mechanics
is only possible for the simplest situations.
For atoms more complicated than Lithium, and for realistic molecules, only semi-heuristic methods are applicable.
Even such a fundamental thing as
* in what order electron orbits are filled
(the order that describes the fundamental properties of the
elements in the perodic table),
* requires quite a few heuristic principles to explain.
(Numerical quantities are even more difficult to explain).
In several articles oriented towards chemist audience, Scerri
specifically explains what is lacking in the existing heuristic
computations:
* some of these method provide an upper bound for the
measurable physical quantities,
* but, to the best of his knowldge, none of the existing
methods provides a guaranteed interval, i.e., an interval that
is guaranteed to contain the desired value.
See, e.g.,
* his article in Education in Chemistry, July 1993, p. 112 (in which he
cites, e.g.,
* F. Weinhold, Adv. Quant, Chem., 1972, Vol. 6, p. 229, and
* S. Wilson, Electron Correlation in Molecules, Oxford, Pergamon Press,
1984.
* his letters in "Chemistry in Britain"
* April 1992, Vol. 28, pp. 326-327;
* November 1992, Vol. 28, p. 986.
>From the emerging discussion (Vol. 28, p. 709) the reader gets an
impression that the search for guaranteed bounds is abandoned in
current quantum chemistry.
This mailing list, specifically orinted towards computations with guaranteed results, seems to me an appropriate venue to ask the two related questions:
* first, does anyone know about guaranteed computations in (foundations of)
quantum chemistry?
There have been guaranteed computations actively used in proving
stability of matter, so maybe similar methods have been used here?
* second, if no such results exist, maybe we can view it as a challenge
and help provide them by using :
* our tools,
* our techniques, and
* our expertise?
I am sending a copy of this message to Dr. Scerri. Judging by his
publications, he will be interested in relevant replies.
Vladik
From owner-reliable_computing Sat Oct 25 04:15:30 1997
Received: by interval.usl.edu id AA09463
(5.65c/IDA-1.4.4 for reliable_computing-outgoing); Sat, 25 Oct 1997 11:15:44 -0500
Received: from cs.utep.edu by interval.usl.edu with SMTP id AA09457
(5.65c/IDA-1.4.4 for ); Sat, 25 Oct 1997 11:15:39 -0500
Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1)
id AA27367; Sat, 25 Oct 97 10:15:30 MDT
Date: Sat, 25 Oct 97 10:15:30 MDT
From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich)
Message-Id: <9710251615.AA27367 [at] cs [dot] utep.edu>
To: reliable_computing [at] interval [dot] usl.edu
Subject: guaranteed computations in quantum chemistry
Cc: scerri [at] bradley [dot] edu
Sender: owner-reliable_computing
Precedence: bulk
Dear Friends,
Oops. I apologize.
I should have looked more attentively into the Kluwer 1996 volume
"Applications of Interval Computations" (that I myself co-edited :-():
there is a
chapter there by C. L. Fefferman and L. Seco "Interval arithmetic in
quantum mechanics" which has exactly what I was asking about. This is a
survey chapter, which also has references to other papers (there are
quite a few), the first one being:
Luis A. Seco, "Computer assisted lower bounds for atomic energies",
[in Computer Aided Proofs in Analysis, edited by Kenneth R. Meyer
and Dieter S. Schmidt], Springer-Verlag, 1991, pp.241-251.
Thanks to Ramon E. Moore and Luis Seco for pointing this out.
I hope at least one good thing will result from this confusion: more people
in the area of foundations of chemistry will become aware of this
important work. I think it is important
because, judging by the 1993 discussion in a chemical
journal that I mentioned in my previous email,
many people in that area are unaware of Seco's work (my guess is this is
happening because most of the publications of Seco and Feferman are in
mathematical and physical journals, and chemists probably read mainly
journals with the word Chemistry in their title, like J. of Quantum
Chemistry).
I am sending a copy of the survey chapter to Dr. Scerri by snail mail, so
that he may look into this chapter and into the relevant references,
and hopefully, use these papers in his later publications and
discussions.
Vladik
From owner-reliable_computing Sat Oct 25 07:37:23 1997
Received: by interval.usl.edu id AA09795
(5.65c/IDA-1.4.4 for reliable_computing-outgoing); Sat, 25 Oct 1997 14:37:33 -0500
Received: from csc-sun.math.utah.edu by interval.usl.edu with SMTP id AA09789
(5.65c/IDA-1.4.4 for ); Sat, 25 Oct 1997 14:37:29 -0500
Received: from plot79.math.utah.edu (beebe [at] plot79 [dot] math.utah.edu [128.110.198.3])
by csc-sun.math.utah.edu (8.8.5/8.8.5) with ESMTP id NAA22854;
Sat, 25 Oct 1997 13:37:24 -0600 (MDT)
From: "Nelson H. F. Beebe"
Received: (from beebe@localhost)
by plot79.math.utah.edu (8.8.5/8.8.5) id NAA11923;
Sat, 25 Oct 1997 13:37:23 -0600 (MDT)
Date: Sat, 25 Oct 1997 13:37:23 -0600 (MDT)
To: vladik [at] cs [dot] utep.edu, reliable_computing [at] interval [dot] usl.edu
Cc: beebe [at] math [dot] utah.edu
X-Us-Mail: "Center for Scientific Computing, 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 581 4148
X-Url: http://www.math.utah.edu/~beebe
Subject: Re: Bounds in quantum chemistry
Message-Id:
Sender: owner-reliable_computing
Precedence: bulk
As a former quantum chemist (who has not worked in the field for that
past 15 years), perhaps I can address your question
>> does anyone know about guaranteed computations in (foundations of)
>> quantum chemistry?
The answer is yes. The Rayleigh-Ritz variational principle guarantees
(in exact computation) an upper bound to the solution of the
Schr{\"o}dinger equation. This is used extensively in a method known
as configuration interaction (CI), which essentially expands the wave
function in an (infinite) series. The series is then truncated to a
manageable length, scalar products are taken to convert the partial
differential equation to a generalized eigenvalue problem ($HC = SCE$,
equivalent to $Ax = \lambda Bx$ in numerical analysis, where $S$ (== $B$) is
positive definite (again in exact computation)), and $H$ and $S$ are
Hermitian (and therefore, symmetric when real). The variational
principle guarantees that as more terms in the series are taken, the
eigenvalues converge from above to the exact eigenvalues.
In practice, there are several approximations involved that have
errors much more severe than those likely to be addressed by interval
arithmetic.
The most serious of these is the computation of the 1-, 2-, 3-, and
4-center two-electron integrals, which are essentially
$$
\int \int A(\tau_1) B(\tau_2) (1/r_{12}) C(\tau_1) D(\tau_2) d \tau_1 d \tau_2
$$
where
$$
\tau_1 == dx_1 dy_1 dz_1
$$
and $r_{12}$ is the distance between particles 1 and 2.
The functions A, B, C, and D are situated on 1 to 4 different centers,
and each is itself a short (typically 3 to 9 term) expansion in powers
of coordinates and exponentials of the form $\exp(-\alpha_k r)$
(Slater-type orbitals) or $\exp(-\beta_k r^2)$ (Gaussian-type
orbitals). $\alpha_k$ and $\beta_k$ are numerical parameters
experimentally determined from computations on atoms and small
molecules; their values are in practice not optimized for larger
molecules, both because of the computational complexity of doing so,
and because of the problem of maintaining balanced accuracy as
molecular geometry is varied.
Slater-type orbitals are most desirable, because they have the correct
hydrogenic behavior as $r \rightarrow 0$, and $r \rightarrow \infty$,
($r$ is the radial coordinate in spherical coordinates), but the
multicenter integrals are difficult to evaluate accurately.
Gaussian-type orbitals reduce the integral problem to at worst 2
centers, since the product of two Gaussians is itself a Gaussian
situated between them, but have incorrect limiting behavior. Some of
the integrals can be evaluated analytically, but most require at least
a one-dimensional numerical quadrature.
The parameter complexity of the CI method goes like $N^4$ for the
integral problem ($N$ is the number of atomic basis functions), $M^3$
for the eigenvalue problem (where, potentially, $M$ approaches $N!$),
and $N^5$ for the transformation of the integrals to a different basis
set (though that can often be reduced, because the matrices involved
are rather sparse, though usually devoid of the patterns that
researchers in dense methods for sparse matrices often assume). By
the early 1990s, computations with $N = \bigO(1000)$ and $M =
\bigO(10^9)$ had been carried out. One of them, with $M = 10^9$ was
carried out by Jack Simons and Poul J{\o}rgensen at the University of
Utah. It took 42 days of CPU time on an IBM 3090-600ES vector
machine, and each iterative solution of the eigenvalue problem for the
lowest dozen or so eigenvalues took one week of wall clock time.
When the computation was finally terminated, it agreed to about 12
decimal places with a pilot calculation taking $M = 25 \times 10^6$
terms of the wavefunction expansion (numbers from memory, so they may
be a little off).
There was considerable interest in the 1950s and 1960s in generating
lower bounds to the Schr{\"o}dinger equation, and there are signicant
papers by Charles Reid in the International Journal of Quantum
Chemistry in the late 1960s that summarize the state of the problem.
Essentially, it was found to be computationally infeasible (at that
time) to compute lower bounds. As far as I know, Charles Reid (who
was on my Ph.D. committee), retired in the early 1980s.
I'm unaware of any further attempts on the lower bounds problem before
the early 1980s, but since then, I have left the field, and do not
follow the literature, other than to record publications in IJQC in a
bibliography, ftp://ftp.math.utah.edu/pub/tex/bib/index.html#ijqc.
Perhaps there are people on this list with more recent experience who
could comment.
As larger atoms are incorporated, relativistic effects become
significant. Unfortunately, the Dirac equation applies to only a
single particle, and there is no generalization of the Schr{\"o}dinger
equation to correctly handle relativistic effects with two or more
particles. Instead, perturbation theory methods are applied to
estimate the relativistic effects; unfortunately, these are devoid of
both upper and lower bounds guarantees, as are all diagrammatic
summations that have filled many journal pages.
Thus, I'm sceptical whether interval arithmetic would be helpful in
solving these issues. The high powers of N and M in the computational
complexity mean that quantum chemists will always be able to exhaust
any computing resource they can acquire, if they use CI-type methods.
There is one area, however, where the interval arithmetic might
perhaps have some applicability. Stable solution of $HC = SCE$ to get
real (as opposed to complex) eigenvalues requires that $S$ be positive
definite, but sometimes, this is not numerically so, and I have
personally been involved in computations that had to be abandoned
because we could not solve that eigenvalue problem satisfactorially as
$S$ became numerically singular. Physical insight says that the
solution should be extractable, but no method I know of works. For a
time, it looked like the $QZ$ algorithm of Moler, Stewart, and Kaufman
might be suitable, but in practice, we found that it produced
non-negligible imaginary parts of eigenvalues that must lie on the
real axis, and we could find no way to eliminate them.
----------------------------------------------------------------------------
- Nelson H. F. Beebe Tel: +1 801 581 5254 -
- Center for Scientific Computing FAX: +1 801 581 4148 -
- University of Utah Internet e-mail: beebe [at] math [dot] utah.edu -
- Department of Mathematics, 105 JWB beebe [at] acm [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 Sun Oct 26 15:33:56 1997
Received: by interval.usl.edu id AA10428
(5.65c/IDA-1.4.4 for reliable_computing-outgoing); Sun, 26 Oct 1997 21:33:58 -0600
Received: by interval.usl.edu id AA10418
(5.65c/IDA-1.4.4 for reliable_computing); Sun, 26 Oct 1997 21:33:56 -0600
Date: Sun, 26 Oct 1997 21:33:56 -0600
From: "Kearfott R. Baker"
Message-Id: <199710270333.AA10418 [at] interval [dot] usl.edu>
To: reliable_computing
Subject: Forwarded: position in computational logic available
Sender: owner-reliable_computing
Precedence: bulk
From owner-reliable_computing Sun Oct 26 08:34:39 1997
Subject: BOUNCE reliable_computing [at] interval [dot] usl.edu: Header field too long (>1024)
Received: by NeXT.Mailer (1.148)
From: Thom Fruehwirth
Date: Sun, 26 Oct 97 15:32:43 +0100
To: Thom Fruehwirth
Subject: 2nd Call: Research Position in Computational Logic Available
Cc: lp-internet [at] doc [dot] ic.ac.uk, eapls [at] mailbase [dot] ac.uk, clpr-users [at] iscs [dot] nus.sg,
ccl [at] dfki [dot] uni-sb.de, atp_alias [at] cs [dot] jcu.edu.au,
flp_ws_maillist [at] issan [dot] informatik.uni-dortmund.de,
alp-list [at] intellektik [dot] informatik.th-darmstadt.de, cclp.x [at] parc [dot] xerox.com,
clean-list [at] cs [dot] kun.nl, rewriting [at] loria [dot] fr, compunode [at] ecrc [dot] de,
quintus-users [at] quintus [dot] com, sicstus-users [at] sics [dot] se, life-users [at] cs [dot] sfu.ca,
clp [at] cis [dot] ohio-state.edu, flprog [at] informatik [dot] uni-muenchen.de,
lprolog [at] central [dot] cis.upenn.edu, gulp [at] di [dot] unipi.it,
g-ganzinger@mpi-sb.mpg.de, haskell [at] dcs [dot] gla.ac.uk,
fg121 [at] bach [dot] informatik.uni-ulm.de, idss [at] socs [dot] uts.edu.au,
igpl [at] doc [dot] ic.ac.uk, ikbs [at] caad [dot] ed.ac.uk, jicslp96 [at] informatik [dot] uni-bonn.de,
kr94 [at] mail2 [dot] ai.univie.ac.at, lics-email [at] cs [dot] indiana.edu,
lics [at] research [dot] bell-labs.com, linear [at] cs [dot] stanford.edu,
logic [at] theory [dot] lcs.mit.edu, lppnmr [at] cs [dot] engr.uky.edu, mlnet [at] swi [dot] psy.uva.nl,
mrg [at] itc [dot] it, nl-kr [at] cs [dot] rpi.edu, parforce [at] ecrc [dot] de,
prolia [at] tlxf [dot] geomail.org, prolog-pe [at] bach [dot] ces.cwru.edu,
prolog-vendors [at] sics [dot] se, prolog [at] mch [dot] sni.de, prolog [at] sunbim [dot] be,
reliable_computing [at] interval [dot] usl.edu, semantics-list [at] newton [dot] cam.ac.uk,
sgaico [at] cui [dot] unige.ch, skeletons [at] dcs [dot] ed.ac.uk,
theorem-provers [at] ai [dot] mit.edu, theory-a [at] vm1 [dot] nodak.edu,
theorynt [at] ndsuvm1 [dot] intellektik.informatik.th-darmstadt.de,
types [at] dcs [dot] glasgow.ac.uk, fg214 [at] informatik [dot] uni-kiel.d400.de
[2nd Call. Sorry for mutliple copies.]
Research Position in Computational Logic Available
(EC Training and Mobility of Researchers, Framework 4)
As part of our commitment to highly competitive research and
development in constraint reasoning and programming, applications are
invited for research positions at post-doctorate and also
post-graduate level in the field of Computational Logic at the
department of Computer Science, with an emphasis on (concurrent)
constraint (logic) programming, program analysis, synthesis and
transformation of constraint programs or agent based computing
utilizing constraint reasoning.
Researchers would be funded by the European Community under Marie
Curie Fellowships provided by the Training and Mobility of Researchers
(TMR) scheme of the Framework 4 programme for a maximum of 36 months
(post-grad) or 24 months (post-doc). Applicants must be nationals of
the European Union (except Germany), or an associated state (Iceland,
Israel, Lichtenstein, Norway, Switzerland), normally not older than
35.
More information about TMR Activity 3 Marie Curie Research Training
Grants you find at http://www.cordis.lu/tmr/src/grants1.htm which has
the following links:
Frequently Asked Questions http://www.cordis.lu/tmr/src/quest&an.htm
Information Package ftp://ftp.cordis.lu/pub/tmr/docs/rtg_971.doc
Application Form ftp://ftp.cordis.lu/pub/tmr/docs/rtg_971.doc
Evaluation Guide ftp://ftp.cordis.lu/pub/tmr/docs/tmr-eval.doc
More information on our activities in constraint reasoning and
programming you find at
http://www.pst.informatik.uni-muenchen.de/personen/fruehwir/cwg.html
Our department of computer science is located right at the "English
Garden", the huge gardens and woods along the river Isar passing right
through the city center. Wealthy Munich is Germanys High-Tech-capital
and largest academic city. Its surroundings feature pleasant lakes and
the Alps.
EMAIL YOUR APPLICATION (uuencoded compressed postscript file(s),
including a detailed CV, list of publications, references, sample
papers and project proposal or statement of research interests) to
Dr. Thom Fruehwirth .
The deadline for applications is November 6, 1997. Decisions will be
emailed by End of November. If you are selected, the deadline for
applications to reach the European Union is December 15, 1997.
Decisions are expected in May 1998. If accepted, starting date is
between June and December 1998.
Dr. Thom Fruehwirth
LMU (Ludwig-Maximilians-University Munich)
Department of Computer Science
Oettingenstr. 67, D-80538 Munich, Germany
Phone: +(49) 89 2178-2181, Fax: +(49) 89 2178-2175
From owner-reliable_computing Sun Oct 26 10:24:50 1997
Received: by interval.usl.edu id AA11095
(5.65c/IDA-1.4.4 for reliable_computing-outgoing); Mon, 27 Oct 1997 16:35:46 -0600
Received: from campus.cem.itesm.mx by interval.usl.edu with SMTP id AA11089
(5.65c/IDA-1.4.4 for ); Mon, 27 Oct 1997 16:35:39 -0600
Received: from dicisi06 by campus.cem.itesm.mx (SMI-8.6/SMI-SVR4)
id QAA03905; Mon, 27 Oct 1997 16:34:05 -0600
Message-Id: <3453C332.41C6 [at] campus [dot] cem.itesm.mx>
Date: Sun, 26 Oct 1997 16:24:50 -0600
From: Raul Trejo
Organization: ITESM-CEM
X-Mailer: Mozilla 2.0 (X11; I; AIX 1)
Mime-Version: 1.0
To: Reliable Computing list
Subject: CFP: MEXICON'98 (changes)
Content-Type: text/plain; charset=iso-8859-1
Content-Transfer-Encoding: 8bit
Sender: owner-reliable_computing
Precedence: bulk
Dear colleagues:
Apologies for multiple copies. Please distribute.
This is the CFP for the workshop MEXICON'98 about Interval
Computations on Expert Systems. Please note
that the location of the congress has moved.
Best regards
Raul
------------------------------------------------------------------
MEXICON '98
Mexican Expert Systems Interval Conference:
WORKSHOP ON INTERVAL COMPUTATIONS AND ITS
APPLICATIONS TO REASONING UNDER UNCERTAINTY
KNOWLEDGE REPRESENTATION AND CONTROL THEORY
Mexico City, Mexico -- March 16-20, 1998
in conjunction with the 4th World Congress on Expert Systems
March 16-20, 1998
Interval computations deal with the fact that data used in numerical
computations is often not
precise due to limitations of measuring devices or sensors, and also due
to internal computer
representation of such data. The main problem of interval computations
is to estimate the
inaccuracy of the result given the inaccuracy of the input data. Experts
systems are usually
developed by representing in a computer system the knowledge that a
number of expert
possesses about a given subject. This knowledge representation is an
estimate: the degree of
belief that an expert has about the subject, thus this is a problem that
can be solved using interval
computations.
This workshop aims to bring together researchers devoted to interval
methods and interested in
the areas of intelligent control and knowledge representation.
We invite you to submit a research paper, position paper or work in
progress.
TOPICS include but are not limited to:
reasoning under uncertainty
fuzzy control
knowledge representation
validation
algorithms
computer tools
IMPORTANT DATES:
Papers Submission Deadline:
October 31, 1997
Notification of acceptance:
December 31, 1997
Workshop:
March 16-20, 1998
ORGANIZATION
Program Chairs
Goetz Alefeld (Karlsruhe, Germany)
Vladik Kreinovich (El Paso, Texas, USA)
Organizing Chair
Raul A. Trejo
Information Systems, Tecnologico de Monterrey
rtrejo [at] campus [dot] cem.itesm.mx
Ph: (52-5) 326-5530, 326-5536
Fax: (52-5) 326-5531
Scientific Committee
G. Alefeld (Karlsruhe, Germany),
F. Benhamou (Nantes, France),
G. F. Corliss ( Milwaukee, WI, USA),
J. W. Gudenberg (Wuerzburg)
V. Kreinovich (El Paso, Texas, USA),
R. Monroy (Edinburgh and Mexico City, Mexico),
C. Rodrmguez (Mexico City, Mexico)
J. Vazquez (Mexico City, Mexico)
GENERAL INFORMATION
The conference will be hosted by the Tecnologico de Monterrey, Mexico
City Campus. The campus is part of the
26 campuses that form the Tecnologico de Monterrey system, and one of
two campuses located at Mexico City.
Mexico City campus is located at the south of the city. Accomodation is
available at several hotels located near
campus. Most interesting visiting places are located at a reasonable
distance from campus or nearby hotels.
Enquiries about the working conference arrangements should be directed
to the organizing chairman.
For more information see the Official Congress Web page located at URL
http://www-cia.mty.itesm.mx/wces98/index.html
Preregistration is suggested for the authors.
SUBMISSIONS:
Authors are invited to submit an extended abstract (up to 4 pages) by
e-mail in LaTeX or PostScript format to
workshop [at] campus [dot] cem.itesm.mx
-----------------------------------------------------------------------
--
--------------------------------------------------------------------
Raul Antonio Trejo Ramirez rtrejo [at] campus [dot] cem.itesm.mx
Information Systems Department ITESM-CEM
http://www-lce.cem.itesm.mx/~rtrejo/
Long live Peter Parker, the one and only Spider-man...
--------------------------------------------------------------------
From owner-reliable_computing Wed Oct 29 03:08:54 1997
Received: by interval.usl.edu id AA12490
(5.65c/IDA-1.4.4 for reliable_computing-outgoing); Wed, 29 Oct 1997 11:09:08 -0600
Received: from cs.utep.edu by interval.usl.edu with SMTP id AA12484
(5.65c/IDA-1.4.4 for ); Wed, 29 Oct 1997 11:09:00 -0600
Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1)
id AA01352; Wed, 29 Oct 97 10:08:54 MST
Date: Wed, 29 Oct 97 10:08:54 MST
From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich)
Message-Id: <9710291708.AA01352 [at] cs [dot] utep.edu>
To: reliable_computing [at] interval [dot] usl.edu, interval [at] cs [dot] utep.edu
Subject: Reliable Computing: contents of the nearest issue
Sender: owner-reliable_computing
Precedence: bulk
Contents of
Reliable Computing, 1998, Vol. 4, No. 1 (special student issue)
Foreword
1-2
General numerical methods
Ralf Hungerb"uhler and J"urgen Garloff
Bounds for the Range of a Bivariate Polynomial over a Triangle
3-13
Huang Zhenyu
An Interval Entropy Penalty Method for Nonlinear Global Optimization
15-25
Chenyi Hu, Angelina Cardenas, Stephanie Hoogendoorn, Pedro Sepulveda Jr.
An Interval Polynomial Interpolation Problem and Its Lagrange
Solution
27-38
Maria Beltran, Gilbert Castillo, Vladik Kreinovich
Algorithms That Still Produce a Solution (Maybe Not Optimal)
Even When Interrupted: Shary's Idea Justified
39-53
Applications
David Morales, Tran Cao Son
Interval Methods in Robot Navigation
55-61
Zhihui Huey Hu
Reliable Optimal Production Control with Cobb-Douglas Model
63-69
Generalizations of interval computations
Daniel Berleant, Hang Cheng
A Software Tool for Automatically Verified Operations on Intervals
and Probability Distributions
71-82
Martin Berz, Georg Hoffst"atter
Computation and Application of Taylor Polynomials with Interval
Remainder Bounds
83-97
Short communications
Clifton Davis
A New Application of Local Minima of Interval Functions:
Interval-Valued Fuzzy Control
99-101
Graciela Gonzalez
Intervals Help to Design an Imaging System
103-104
Letters to the editor
Misha Koshelev, Luc Longpr'e
A Brief Description of Gell-Mann's Lecture and How Intervals May
Help to Describe Complexity in the Real World
105-107
Alexander Levichev, Olga Kosheleva
Intervals in Space-Time: A. D. Alexandrov is 85
109-112
Information
Reliable Computing
Special Issue on Applications to Control, Signals, and Systems
113-114
The complete table of contents of all the issues is placed at
http://cs.utep.edu/interval-comp/main.html, click on Journals;
for more information about the journal, see
http://www.wkap.nl/journalhome.htm/1385-3139
on Kluwer's website.