From owner-reliable_computing [at] interval [dot] louisiana.edu Fri Nov 2 14:59:15 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id fA2KxFZ09623 for reliable_computing-outgoing; Fri, 2 Nov 2001 14:59:15 -0600 (CST) Received: from buffalo.ens-lyon.fr (buffalo.ens-lyon.fr [140.77.1.8]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id fA2Kx5o09618 for ; Fri, 2 Nov 2001 14:59:10 -0600 (CST) Received: from pastaga (pastaga [140.77.11.223]) by buffalo.ens-lyon.fr (8.11.6/8.11.2) with ESMTP id fA2KwpL24113; Fri, 2 Nov 2001 21:58:55 +0100 (MET) Date: Fri, 2 Nov 2001 21:58:51 +0100 (MET) From: Nathalie Revol X-Sender: nrevol@pastaga To: reliable_computing [at] interval [dot] louisiana.edu cc: Nathalie.Revol@ens-lyon.fr Subject: CFP: JCAM special issue on Linear Algebra and Arithmetic Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Following the conference ALA 2001 on Linear Algebra and Arithmetic: Numerical, Symbolic and Parallel Computations, held in Rabat, Morocco, in May 2001, the Journal of Computational and Applied Mathematics has accepted to publish a special issue on the same topics. Scientists interested in these and related topics are encouraged to submit a paper, even if they did not attend the conference. Please distribute the following call for papers and accept our apologies if you receive it more than once. ------------------------------------------------------ Journal of Computational and Applied Mathematics Special issue on Linear Algebra and Arithmetic: Numerical, Symbolic and Parallel Computations Guest editors: S. El Hajji, N. Revol and P. Van Dooren. TOPICS: computational linear algebra and arithmetic, with an emphasis on numerical, symbolic and parallel aspects. They include but are not restricted to the following list: linear algebra, matrices normal forms, sparse matrices, eigenvalues and eigenvectors problems, singular values problems, least squares problems, linear algebra and control, numerical stability, floating point arithmetic, interval arithmetic, computer algebra, parallel algorithms, applications. IMPORTANT DATES: - deadline for submission: 30 November 2001 - notification of acceptance or rejection: 31 January 2002 - final version: 28 February 2002 For more information, in particular on how to submit, please consult the CFP Web page: http://www.ens-lyon.fr/LIP/Arenaire/ALA2001/ALA-JCAM2001 --------------------------------------------------------------------------- Nathalie REVOL LIP - Projet INRIA Arenaire tel : (33) 4-72-72-86-42 Ecole Normale Superieure de Lyon Fax : (33) 4-72-72-80-80 69364 Lyon Cedex 07 Nathalie.Revol@ens-lyon.fr FRANCE http://www.ens-lyon.fr/~nrevol --------------------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] louisiana.edu Thu Nov 8 09:18:03 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id fA8FI2o25349 for reliable_computing-outgoing; Thu, 8 Nov 2001 09:18:02 -0600 (CST) Received: from lcyoung.math.wisc.edu (lcyoung.math.wisc.edu [144.92.166.90]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id fA8FHoo25344 for ; Thu, 8 Nov 2001 09:17:54 -0600 (CST) Received: from bing.math.wisc.edu (bing.math.wisc.edu [144.92.166.133]) by lcyoung.math.wisc.edu (8.11.4/8.11.4) with ESMTP id fA8FHkG11853; Thu, 8 Nov 2001 09:17:47 -0600 (CST) Received: from localhost (hans@localhost) by bing.math.wisc.edu (8.9.3+Sun/8.9.3) with ESMTP id JAA11108; Thu, 8 Nov 2001 09:17:43 -0600 (CST) X-Authentication-Warning: bing.math.wisc.edu: hans owned process doing -bs Date: Thu, 8 Nov 2001 09:17:43 -0600 (CST) From: Hans Schneider To: NETS -- at-net , "Hershkowitz, Danny -- Hershkowitz Daniel" , Danny Hershkowitz , E-LETTER , "na.digest" , ipnet-digest [at] math [dot] msu.edu, wim@bell-labs.com, hjt [at] eos [dot] ncsu.edu, vkm [at] eedsp [dot] gatech.edu, reliable_computing [at] interval [dot] louisiana.edu Subject: LAA vol 339 contents Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk ------------------------------------------------------------------------------ Hans Schneider hans [at] math [dot] wisc.edu. Department of Mathematics 608-262-1402 (Work) Van Vleck Hall 608-271-7252 (Home) 480 Lincoln Drive 608-263-8891 (Work FAX) University of Wisconsin-Madison 608-271-8477 (Home FAX) Madison WI 53706 USA http://www.math.wisc.edu/~hans (URL) ------------------------------------------------------------------------------ Dear Net Organizer: Please circulate the attached LAA contents over your net. Thanks hans *********************************************************************** ContentsDirect from Elsevier Science ====================================== Journal: Linear Algebra and its Applications ISSN : 0024-3795 Volume : 339 Issue : 1-3 Date : 15-Dec-2001 Please note: The access restrictions on articles/abstracts vary. Many journals have free access to abstracts, but in general access to full text PDFs is restricted to subscribers. Visit the journal at http://www.elsevier.nl/locate/jnlnr/07738 pp 1-2 Special issue on Discrete Tomography A. Del Lungo, P. Gronchi, G.T. Herman pp 3-21 X-rays characterizing some classes of discrete sets E. Barcucci, A. Del Lungo, M. Nivat, R. Pinzani http://www.elsevier.nl/PII/S0024379501004311 pp 23-35 Comparison of algorithms for reconstructing hv-convex discrete sets E. Balogh, A. Kuba, C. Devenyi, A.D. Lungo http://www.elsevier.nl/PII/S002437950100430X pp 37-57 Reconstruction of 4- and 8-connected convex discrete sets from row and column projections S. Brunetti, A. DelLungo, F. DelRistoro, A. Kuba, M. Nivat http://www.elsevier.nl/PII/S0024379501004359 pp 59-73 On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional X-rays S. Brunetti, A. Del Lungo, Y. Gerard http://www.elsevier.nl/PII/S0024379501004372 pp 75-89 Speeding up stochastic reconstructions of binary images from limited projection directions E. Vardi, G.T. Herman, T. Yung Kong http://www.elsevier.nl/PII/S0024379501004554 pp 91-109 A convergent composite mapping Fourier domain iterative algorithm for 3-D discrete tomography A.E. Yagle http://www.elsevier.nl/PII/S002437950100458X pp 111-124 Binary steering in discrete tomography reconstruction with sequential and simultaneous iterative algorithms Y. Censor http://www.elsevier.nl/PII/S0024379501004700 pp 125-145 Reconstruction of tomographic images using analog projections and the digital Radon transform I. Svalbe, D. van der Spek http://www.elsevier.nl/PII/S0024379501004876 pp 147-169 An algorithm for discrete tomography L. Hajdu, R. Tijdeman http://www.elsevier.nl/PII/S0024379501004839 pp 171-194 Reconstruction of discrete sets with absorption A. Kuba, M. Nivat http://www.elsevier.nl/PII/S0024379501004864 pp 195-204 Detection of flaws in construction columns using 3D reconstruction and manipulation J. Santos, L.C. Longoria, J.C. Palacios http://www.elsevier.nl/PII/S0024379501004840 pp 205-219 Two-view ''cylindrical decomposition'' of binary images V. Di Gesu, C. Valenti http://www.elsevier.nl/PII/S0024379501004852 pp 221 Author index http://www.elsevier.nl/PII/S0024379501005201 From owner-reliable_computing [at] interval [dot] louisiana.edu Fri Nov 9 08:45:18 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id fA9EjI427930 for reliable_computing-outgoing; Fri, 9 Nov 2001 08:45:18 -0600 (CST) Received: from yonge.cs.toronto.edu (root [at] yonge [dot] cs.toronto.edu [128.100.1.8]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with SMTP id fA9EjDo27925 for ; Fri, 9 Nov 2001 08:45:13 -0600 (CST) Received: from jane.cs.toronto.edu ([128.100.3.248]) by yonge.cs.toronto.edu with SMTP id <15142-9560>; Fri, 9 Nov 2001 09:45:05 -0500 Received: from qew.cs.toronto.edu by jane.cs.toronto.edu id <453150-15184>; Fri, 9 Nov 2001 09:45:01 -0500 From: Ken Jackson To: reliable_computing [at] interval [dot] louisiana.edu Subject: Workshops at the Fields Institute Cc: krj [at] cs [dot] toronto.edu Message-Id: <01Nov9.094501edt.453150-15184 [at] jane [dot] cs.toronto.edu> Date: Fri, 9 Nov 2001 09:44:52 -0500 Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk We are planning several events at the Fields Institute over the next several months that may interest readers of this newsgroup. These include: 1. Short Course and Lectures on Numerical Bifurcation and Center Manifold Analysis in Partial Differential Equations, Klaus Boehmer, November 19 - 28, 2001. 2. Workshop on Computational Biology, November 29 - December 2, 2001 3. Workshop on Computational Challenges in Dynamical Systems, December 3 - 7, 2001. 4. Short Course on PDE methods for path dependent options, Feb. 25 - 26, 2002. 5. Computational Methods and Applications in Finance Workshop, Feb. 27 - Mar. 1, 2002. 6. SIAM Conference on Optimization, May 19 - 22, 2002. Program-related event. 7. Validated Computing 2002, May 23 - 25, 2002. Program-related event. 8. Informal Working Group on Validated Methods for Optimization, May 26 - June 1, 2002 9. Symbolic Computational Algebra 2002, July 13 - 19, 2002. 10. Short Course on Numerical Solution of Advection-Diffusion-Reaction Equations, Jan Verwer, July 29 - August 2, 2002. 11. IMACS International Conference on Adaptive Methods for PDEs, August 6 - 9, 2002. 12. The 2002 Workshop on the Solution of Partial Differential Equations on the Sphere, August 12 - 15, 2002. For more information about these and other events at the Fields Institute, see our webpage http://www.fields.utoronto.ca./programs/scientific/01-02/numerical/ From owner-reliable_computing [at] interval [dot] louisiana.edu Mon Nov 12 13:13:46 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id fACJDkX06000 for reliable_computing-outgoing; Mon, 12 Nov 2001 13:13:46 -0600 (CST) Received: from mail1.comset.net (mail.comset.net [213.172.0.3]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id fACJDZo05995 for ; Mon, 12 Nov 2001 13:13:36 -0600 (CST) Received: from e0gumi46 (2-135.dialup.comset.net [213.172.2.135]) by mail1.comset.net (8.11.6/8.11.6/MAIL/1.0.2) with ESMTP id fACJ8Td06783 for ; Mon, 12 Nov 2001 22:08:35 +0300 (MSK) Message-ID: <00a801c16bad$fbfd99e0$8003acd5 [at] wplus [dot] net> From: "Vyacheslav Nesterov" To: "RC mailing list" Subject: Reliable Computing -- Special issue Date: Mon, 12 Nov 2001 22:10:24 +0300 MIME-Version: 1.0 Content-Type: multipart/alternative; boundary="----=_NextPart_000_00A5_01C16BC6.D4192980" X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 5.00.2615.200 X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2615.200 Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk This is a multi-part message in MIME format. ------=_NextPart_000_00A5_01C16BC6.D4192980 Content-Type: text/plain; charset="koi8-r" Content-Transfer-Encoding: quoted-printable Reliable Computing: Special Issue on the Linkages Between Interval Mathematics and Fuzzy Set Theory Guest editor: Weldon A. Lodwick Reliable Computing will devote a special issue to papers that address the interrelationship between interval mathematics and fuzzy set theory. The connection between interval mathematics and fuzzy set theory is evident in the extension principle, arithmetic, logic, and in the mathematics of uncertainty. Much of the research to date has been in the use of interval mathematics in fuzzy set theory, in particular fuzzy arithmetic and fuzzy interval analysis. This may be because intervals can be considered as a particular type of fuzzy set. The impact of fuzzy set theory on interval mathematics is not quite as evident. For example, it is clear that fuzzy logic, fuzzy control, fuzzy neural networks, and fuzzy cluster analysis, are four important areas of fuzzy set theory. The impact of interval analysis on these four areas is not as apparent. Can the development in these areas of fuzzy set theory inform research in interval mathematics? There are areas of interval mathematics and fuzzy set theory that have developed in parallel with little or no interchange of ideas. In particular the extension principle of Zadeh and the united extension of R.E. Moore as well as subsequent research in this area has largely been developed independently. Both are related to set-valued functions. Is there a useful underlying unifying mathematics? Secondly, dependencies and their effect on the resulting arithmetic has more recently been a part of the fuzzy set theory literature and approaches independently developed from what has been known in the interval analysis community almost since the beginnings of interval analysis research. Are there other areas of interval analysis research that would be useful for the fuzzy set theory community to know about? One of the paths of interval mathematics research has led to validation analysis. Is there a useful comparable counterpart for fuzzy set theory? Interval analysis is the way to model the uncertainty arising from computer computations. Thus, interval analysis shares mathematical uncertainty modeling with the field of fuzzy set theory. So, fundamentally, what are the common points between interval analysis and fuzzy set theory? In interval analysis, convergence of algorithms has been an area of research. Are there extensions of these approaches to fuzzy algorithms? In the area of interval analysis, much work has been done in validation methods for differential equations. A few research papers have appeared in this area in the fuzzy set theory setting. Are there areas of cross-fertilization? There are many research papers in the area of optimization in both interval analysis and fuzzy set theory. What is the interrelationship between interval and fuzzy optimization? Is there a fundamental mathematical foundation out of which both arise? The following lists a few areas of interest. It is indicative and not exhaustive. - Fuzzy and interval mathematical analysis - Comparative analysis of the interval and fuzzy logics - Upper and lower dependency bounds in interval and fuzzy mathematics - Dependency analysis in interval and fuzzy computations - Fuzzy and interval methods in classification (cluster) analysis - The use of fuzzy set theory and interval analysis methods in neural networks - Interval and fuzzy ordering methods - The use of interval analysis and fuzzy set theory in neural networks - The use of interval analysis and fuzzy set theory in surface modeling, interpolation and approximation - The application of interval analysis to fuzzy algorithms and vice versa - The methods and relationship between interval and fuzzy optimization - Fuzzy and interval logic controllers - Computer systems in support of fuzzy number data types and associated numerical algorithms akin to such interval analysis = computer systems as that of S.Rump, "INTLAB---Interval Laboratory" at: http://www.ti3.tu-harburg.de/~rump/intlab/index.html - Interval and fuzzy methods for differential equations - Convergence and complexity analysis of interval and fuzzy algorithms - One of the uses of interval analysis is in the validation of solutions under computational and data errors. Is there a comparable = use of fuzzy set and possibility theory in the validation of solutions = under uncertainty? In addition to new results in theoretical analysis, innovative applications, and computer implementations, we invite insightful surveys. Please send a copy of your manuscript (in electronic form preferably---LATEX, including the style files required, postscript or pdf format) to: Professor Weldon A. Lodwick Department of Mathematics---Campus Box 170 University of Colorado at Denver P.O. Box 173364 Denver, Colorado 80217--3364 weldon.lodwick [at] cudenver [dot] edu Telephone: +1 303 556-8462 Schedule: June 15, 2002: Deadline for submission of papers to the special issue. December 15, 2002: Notification about acceptance of papers. March 15, 2003: Revisions to accepted papers due. Manuscripts will be subjected to the usual reviewing process and should conform to the standards and formats as indicated in the "Information for Authors" section inside the back cover of Reliable Computing. Contributions should not exceed 32 pages. ------=_NextPart_000_00A5_01C16BC6.D4192980 Content-Type: text/html; charset="koi8-r" Content-Transfer-Encoding: quoted-printable
Reliable Computing:
Special = Issue on the=20 Linkages Between Interval
Mathematics and Fuzzy Set Theory
Guest = editor:=20 Weldon A. Lodwick
 
Reliable Computing will devote a = special=20 issue to
papers that address the interrelationship between interval=20 mathematics
and fuzzy set theory. The connection between interval = mathematics=20 and
fuzzy set theory is evident in the extension principle,=20 arithmetic,
logic, and in the mathematics of uncertainty. Much of the = research to
date has been in the use of interval mathematics in fuzzy = set=20 theory, in
particular fuzzy arithmetic and fuzzy interval analysis. = This may=20 be
because intervals can be considered as a particular type of fuzzy=20 set.
The impact of fuzzy set theory on interval mathematics is not = quite=20 as
evident. For example, it is clear that fuzzy logic, fuzzy control, = fuzzy
neural networks, and fuzzy cluster analysis, are four important = areas=20 of
fuzzy set theory. The impact of interval analysis on these four = areas=20 is
not as apparent. Can the development in these areas of fuzzy set=20 theory
inform research in interval mathematics?
 
There are areas of interval = mathematics and=20 fuzzy set theory that have
developed in parallel with little or no=20 interchange of ideas. In
particular the extension principle of Zadeh = and the=20 united extension of
R.E. Moore as well as subsequent research in this = area=20 has largely been
developed independently. Both are related to = set-valued=20 functions. Is
there a useful underlying unifying mathematics? = Secondly,=20 dependencies
and their effect on the resulting arithmetic has more = recently=20 been a
part of the fuzzy set theory literature and approaches=20 independently
developed from what has been known in the interval = analysis=20 community
almost since the beginnings of interval analysis research. = Are=20 there
other areas of interval analysis research that would be useful = for=20 the
fuzzy set theory community to know about?
 
One of the paths of interval = mathematics=20 research has led to validation
analysis. Is there a useful comparable = counterpart for fuzzy set theory?
Interval analysis is the way to = model the=20 uncertainty arising from
computer computations. Thus, interval = analysis=20 shares mathematical
uncertainty modeling with the field of fuzzy set = theory.=20 So,
fundamentally, what are the common points between interval = analysis=20 and
fuzzy set theory? In interval analysis, convergence of algorithms = has
been an area of research. Are there extensions of these = approaches=20 to
fuzzy algorithms? In the area of interval analysis, much work has=20 been
done in validation methods for differential equations. A few=20 research
papers have appeared in this area in the fuzzy set theory = setting.=20 Are
there areas of cross-fertilization? There are many research = papers=20 in
the area of optimization in both interval analysis and fuzzy set=20 theory.
What is the interrelationship between interval and fuzzy=20 optimization?
Is there a fundamental mathematical foundation out of = which=20 both arise?
 
The following lists a few areas = of=20 interest.  It is indicative and not
exhaustive.
 
- Fuzzy and interval mathematical = analysis
- Comparative analysis of the interval and fuzzy logics
- = Upper=20 and lower dependency bounds in interval and fuzzy
  = mathematics
-=20 Dependency analysis in interval and fuzzy computations
- Fuzzy and = interval=20 methods in classification (cluster) analysis
- The use of fuzzy set = theory=20 and interval analysis methods in
  neural networks
- Interval = and=20 fuzzy ordering methods
- The use of interval analysis and fuzzy set = theory in=20 neural
  networks
- The use of interval analysis and fuzzy = set theory=20 in surface
  modeling, interpolation and approximation
- The=20 application of interval analysis to fuzzy algorithms and vice
 =20 versa
- The methods and relationship between interval and = fuzzy
 =20 optimization
- Fuzzy and interval logic controllers
- Computer = systems in=20 support of fuzzy number data types and
  associated numerical = algorithms=20 akin to such interval analysis computer
  systems as that of = S.Rump,=20 "INTLAB---Interval Laboratory" at:
  http://www.= ti3.tu-harburg.de/~rump/intlab/index.html
-=20 Interval and fuzzy methods for differential equations
- Convergence = and=20 complexity analysis of interval and fuzzy algorithms
- One of the = uses of=20 interval analysis is in the validation of
  solutions under=20 computational and data errors. Is there a comparable use
  of = fuzzy set=20 and possibility theory in the validation of solutions under
 =20 uncertainty?
 
In addition to new results in = theoretical=20 analysis, innovative
applications, and computer implementations, we = invite=20 insightful
surveys. Please send a copy of your manuscript (in = electronic=20 form
preferably---LATEX, including the style files required, = postscript=20 or
pdf format) to:
 
Professor Weldon A. = Lodwick
Department of=20 Mathematics---Campus Box 170
University of Colorado at Denver
P.O. = Box=20 173364
Denver, Colorado 80217--3364
weldon.lodwick [at] cudenver [dot] edu
Telephone:=20 +1 303 556-8462
 
Schedule:
June 15, 2002: = Deadline for=20 submission of papers to the special issue.
December 15, 2002: = Notification=20 about acceptance of papers.
March 15, 2003: Revisions to accepted = papers=20 due.
 
Manuscripts will be subjected to = the usual=20 reviewing process
and should conform to the standards and formats as=20 indicated in the
"Information for Authors" section inside the back = cover=20 of
Reliable Computing. Contributions should not exceed 32 = pages.
 
 
 
 
------=_NextPart_000_00A5_01C16BC6.D4192980-- From owner-reliable_computing [at] interval [dot] louisiana.edu Tue Nov 13 04:43:16 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id fADAhGL07915 for reliable_computing-outgoing; Tue, 13 Nov 2001 04:43:16 -0600 (CST) Received: from isis.lip6.fr (IDENT:root [at] isis [dot] lip6.fr [132.227.60.2]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id fADAhBo07910 for ; Tue, 13 Nov 2001 04:43:11 -0600 (CST) Received: from lip6.fr (sinon.lip6.fr [132.227.61.9]) by isis.lip6.fr (8.12.0.Beta19/jtpda-5.3.2+victor) with ESMTP id fADAh9qS010636 for ; Tue, 13 Nov 2001 11:43:09 +0100 X-pt: isis.lip6.fr Message-ID: <3BF11597.3546F32B [at] lip6 [dot] fr> Date: Tue, 13 Nov 2001 13:44:07 +0100 From: Jean-Luc Lamotte Reply-To: Jean-Luc.Lamotte [at] lip6 [dot] fr X-Mailer: Mozilla 4.76 [en] (X11; U; Linux 2.4.2 i686) X-Accept-Language: French, fr, en MIME-Version: 1.0 To: "reliable_computing [at] interval [dot] louisiana.edu" Subject: visualization tool Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear members, I have a research project which consists in developing a visualization tool for numerical results obtained with interval arithmetic or stochastic arithmetic. The exact aim is to create a freeware tool box for different kinds of data (1D, 2D or 3D array, set of points, mesh ...) which shows in one picture the values and their numerical quality or the bounds of the interval or anything else. This tool box will be based on the OpenDX Visualization software of IBM which is free available. I am looking for any kind of numerical results obtained with interval arithmetic. So, if you have 5 minutes and if you agree to help me, send me some files with a small description of the data. Thank you for your help. Best regards Jean-Luc Lamotte -- ------------------------------------------------------------------------- Jean-Luc Lamotte Theme Algorithmique Numerique et Parallelisme Tel:+33 1 44 27 58 78 Laboratoire LIP6 Tel:+33 1 44 27 73 63 Universite Paris VI Tel:+33 1 44 27 71 34 4, place Jussieu Fax:+33 1 44 27 53 53 F-75252 PARIS CEDEX 05 FRANCE E-mail : Jean-Luc.Lamotte [at] lip6 [dot] fr -------------------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] louisiana.edu Tue Nov 13 10:29:36 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id fADGTaY08670 for reliable_computing-outgoing; Tue, 13 Nov 2001 10:29:36 -0600 (CST) Received: from Princeton.EDU (postoffice.Princeton.EDU [128.112.129.120]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id fADGTVo08665 for ; Tue, 13 Nov 2001 10:29:31 -0600 (CST) Received: from smtpserver1.Princeton.EDU (mail.Princeton.EDU [128.112.129.14]) by Princeton.EDU (8.9.3/8.9.3) with ESMTP id LAA27942 for ; Tue, 13 Nov 2001 11:29:28 -0500 (EST) Received: from princeton.edu (atom.Princeton.EDU [128.112.143.9]) by smtpserver1.Princeton.EDU (8.9.3/8.9.3) with ESMTP id LAA04237 for ; Tue, 13 Nov 2001 11:29:27 -0500 (EST) Message-ID: <3BF1584B.131804ED [at] princeton [dot] edu> Date: Tue, 13 Nov 2001 11:28:43 -0600 From: Aleksandar Donev Organization: Princeton Materials Institute, Princeton University X-Mailer: Mozilla 4.77 [en] (X11; U; Linux 2.4.2-2 i686) X-Accept-Language: en MIME-Version: 1.0 To: reliable_computing [at] interval [dot] louisiana.edu Subject: Fwd: Interval arithmetic in Fortran 200x Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Forwarded from comp.fortran-90 list: Hello, Does someone know what happened with proposals/ideas to add interval arithmetic support to Fortran? I have been looking at interval arithmetic-based global optimization codes/papers and read that someone was working on a proposal to add this to F200x, but that apparently did not work out? Thanks for any info, Aleksandar -- __________________________________ Aleksandar Donev Complex Materials Theory Group (http://cherrypit.princeton.edu/) Princeton Materials Institute & Program in Applied and Computational Mathematics @ Princeton University Address: 419 Bowen Hall, 70 Prospect Avenue Princeton University Princeton, NJ 08540-5211 E-mail: adonev [at] princeton [dot] edu WWW: http://atom.princeton.edu/donev Phone: (609) 258-2775 Fax: (609) 258-6878 __________________________________ From owner-reliable_computing [at] interval [dot] louisiana.edu Wed Nov 14 08:59:17 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id fAEExHE11307 for reliable_computing-outgoing; Wed, 14 Nov 2001 08:59:17 -0600 (CST) Received: from imf12bis.bellsouth.net (mail112.mail.bellsouth.net [205.152.58.52]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id fAEExCo11302 for ; Wed, 14 Nov 2001 08:59:12 -0600 (CST) Received: from u8174 ([65.81.241.89]) by imf12bis.bellsouth.net (InterMail vM.5.01.01.01 201-252-104) with SMTP id <20011114150014.HUZU1332.imf12bis.bellsouth.net@u8174>; Wed, 14 Nov 2001 10:00:14 -0500 Message-Id: <2.2.32.20011114145746.0098b308 [at] pop [dot] louisiana.edu> X-Sender: rbk5287 [at] pop [dot] louisiana.edu X-Mailer: Windows Eudora Pro Version 2.2 (32) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Wed, 14 Nov 2001 08:57:46 -0600 To: Aleksandar Donev , reliable_computing [at] interval [dot] louisiana.edu From: "R. Baker Kearfott" Subject: Re: Fwd: Interval arithmetic in Fortran 200x Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Aleksandar, An intrinsic interval data type failed to gain the Fortran standardization committee's acceptance in the current cycle of standardization. There were several reasons for this. These are my personal perceptions of these reasons: One reason was some fear on the part of some vendors who didn't have expertise in-house, and who couldn't gauge the potential demand for it; they were worried about expense-versus-benefit. Another reason was that the interval community itself was not sufficiently in agreement about certain details to answer skeptics strongly. However, Sun has implemented an intrinsic interval data type that is a part of the Fortran 95 compiler that Sun ships. This interval data type has evolved from the proposed standard for intrinsic data type that we put in front of the Fortran standardization committees, but the Sun implementation has various improvements. Also, Sun has supported theoretical developments for extended (infinite) interval arithmetic, and presently has a logically clear implementation (to be sharp in the near future). My own experience with the Sun implementation, including sharpness and speed, is favorable. I view acceptance of the Sun implementation as an avenue towards standardization. Regarding portable interval data types in Fortran, my students and I have implemented a derived interval data type which we have published as two ACM TOMS algorithms: Algorithm 737: INTLIB ..., ACM TOMS 20 (4), 1994 and Algorithm 763: INTERVAL_ARITHMETIC, A Fortran 90 module ..., ACM TOMS 22(4), 1996 The derived data type defined by this library and module provides a syntax that is, with some exceptions, consistent with Sun's implementation. However, the module only provides a small subset of what is done in Sun's intrinsic type, and it runs significantly more slowly, especially when many calls to certain standard functions such as sin and exp appear, and it does not provide optimal accuracy, as does Sun's. Finally, it does not provide a closed system with extended arithmetic. The advantage is that it is portable. I hope this helps. Sincerely, Baker At 11:28 AM 11/13/01 -0600, Aleksandar Donev wrote: >Forwarded from comp.fortran-90 list: > >Hello, > >Does someone know what happened with proposals/ideas to add interval >arithmetic support to Fortran? I have been looking at interval >arithmetic-based global optimization codes/papers and read that someone >was working on a proposal to add this to F200x, but that apparently did >not work out? > >Thanks for any info, >Aleksandar > >-- >__________________________________ --------------------------------------------------------------- R. Baker Kearfott, rbk [at] louisiana [dot] edu (337) 482-5346 (fax) (337) 482-5270 (work) (337) 981-9744 (home) URL: http://interval.louisiana.edu/kearfott.html Department of Mathematics, University of Louisiana at Lafayette Box 4-1010, Lafayette, LA 70504-1010, USA --------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] louisiana.edu Wed Nov 14 10:17:23 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id fAEGHN211547 for reliable_computing-outgoing; Wed, 14 Nov 2001 10:17:23 -0600 (CST) Received: from patan.sun.com (patan.Sun.COM [192.18.98.43]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id fAEGHIo11542 for ; Wed, 14 Nov 2001 10:17:18 -0600 (CST) Received: from engmail2.Eng.Sun.COM ([129.146.1.25]) by patan.sun.com (8.9.3+Sun/8.9.3) with ESMTP id JAA27813; Wed, 14 Nov 2001 09:16:53 -0700 (MST) From: Bill.Walster [at] Eng [dot] Sun.COM Received: from phys-mpkmaila (phys-mpkmaila.Eng.Sun.COM [129.146.18.131]) by engmail2.Eng.Sun.COM (8.9.3+Sun/8.9.3/ENSMAIL,v2.1p1) with ESMTP id IAA05862; Wed, 14 Nov 2001 08:17:10 -0800 (PST) Received: from mpkmail.Eng.Sun.COM (esun1as-be.Central.Sun.COM [129.147.34.142]) by mpkmail.eng.sun.com (iPlanet Messaging Server 5.2 (built Oct 28 2001)) with ESMTP id <0GMS005C0T80IO [at] mpkmail [dot] eng.sun.com>; Wed, 14 Nov 2001 08:17:02 -0800 (PST) Date: Wed, 14 Nov 2001 08:14:45 -0800 Subject: Re: Fwd: Interval arithmetic in Fortran 200x To: Aleksandar Donev , reliable_computing [at] interval [dot] louisiana.edu Cc: bill.walster [at] Eng [dot] Sun.COM Message-id: <0GMS005C1T86IO [at] mpkmail [dot] eng.sun.com> MIME-version: 1.0 X-Mailer: Sun NetMail 2.3 Content-type: text/plain; charset=US-ASCII Content-transfer-encoding: 7BIT Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Hi Aleksandar, You don't need to wait for intervals to become part of the standard. You can use them right now. See: www.sun.com/info/features/intervals.html and links therein. If you have any questions, don't hesitate to send me an email. Cheers, Bill "Aleksandar Donev" wrote: GWW>Date: Tue, 13 Nov 2001 11:28:43 -0600 GWW>Forwarded from comp.fortran-90 list: GWW> GWW>Hello, GWW> GWW>Does someone know what happened with proposals/ideas to add interval GWW>arithmetic support to Fortran? I have been looking at interval GWW>arithmetic-based global optimization codes/papers and read that someone GWW>was working on a proposal to add this to F200x, but that apparently did GWW>not work out? GWW> GWW>Thanks for any info, GWW>Aleksandar GWW> GWW>-- GWW>__________________________________ GWW>Aleksandar Donev GWW>Complex Materials Theory Group (http://cherrypit.princeton.edu/) GWW>Princeton Materials Institute & Program in Applied and Computational GWW>Mathematics GWW>@ Princeton University GWW>Address: GWW> 419 Bowen Hall, 70 Prospect Avenue GWW> Princeton University GWW> Princeton, NJ 08540-5211 GWW>E-mail: adonev [at] princeton [dot] edu GWW>WWW: http://atom.princeton.edu/donev GWW>Phone: (609) 258-2775 GWW>Fax: (609) 258-6878 GWW>__________________________________ GWW> GWW> GWW> From owner-reliable_computing [at] interval [dot] louisiana.edu Wed Nov 14 10:36:41 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id fAEGaff11709 for reliable_computing-outgoing; Wed, 14 Nov 2001 10:36:41 -0600 (CST) Received: from mercury.Sun.COM (mercury.Sun.COM [192.9.25.1]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id fAEGaao11704 for ; Wed, 14 Nov 2001 10:36:36 -0600 (CST) Received: from engmail1.Eng.Sun.COM ([129.146.1.13]) by mercury.Sun.COM (8.9.3+Sun/8.9.3) with ESMTP id IAA21404; Wed, 14 Nov 2001 08:36:25 -0800 (PST) From: Bill.Walster [at] Eng [dot] Sun.COM Received: from phys-mpkmaila (phys-mpkmaila.Eng.Sun.COM [129.146.18.131]) by engmail1.Eng.Sun.COM (8.9.3+Sun/8.9.3/ENSMAIL,v2.1p1) with ESMTP id IAA09933; Wed, 14 Nov 2001 08:36:24 -0800 (PST) Received: from mpkmail.Eng.Sun.COM (esun1as-be.Central.Sun.COM [129.147.34.142]) by mpkmail.eng.sun.com (iPlanet Messaging Server 5.2 (built Oct 28 2001)) with ESMTP id <0GMS005LJU42IO [at] mpkmail [dot] eng.sun.com>; Wed, 14 Nov 2001 08:36:16 -0800 (PST) Date: Wed, 14 Nov 2001 08:33:59 -0800 Subject: Re: Fwd: Interval arithmetic in Fortran 200x To: "R. Baker Kearfott" , reliable_computing [at] interval [dot] louisiana.edu, Aleksandar Donev Cc: bill.walster [at] Eng [dot] Sun.COM Message-id: <0GMS005LQU47IO [at] mpkmail [dot] eng.sun.com> MIME-version: 1.0 X-Mailer: Sun NetMail 2.3 Content-type: text/plain; charset=US-ASCII Content-transfer-encoding: 7BIT Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Thanks, Baker, for your complete and I believe accurate description of the standardization situation. Regarding portability, there are a number of options, including NAG for Fortran 95 and GNU for C and C++. I will be working to see what we at Sun can do to help move these forward. Expressions of support and/or interest in working on these projects will be greatly appreciated. Cheers, Bill "R. Baker Kearfott" wrote: GWW>Date: Wed, 14 Nov 2001 08:57:46 -0600 GWW>Aleksandar, GWW> GWW>An intrinsic interval data type failed to gain the Fortran standardization GWW>committee's acceptance in the current cycle of standardization. GWW>There were several reasons for this. GWW>These are my personal perceptions of these reasons: GWW>One reason was some fear on the part of some vendors who didn't have GWW>expertise in-house, and who couldn't gauge the potential demand for GWW>it; they were worried about expense-versus-benefit. Another reason GWW>was that the interval community itself was not sufficiently in agreement GWW>about certain details to answer skeptics strongly. GWW> GWW>However, Sun has implemented an intrinsic interval data type that GWW>is a part of the Fortran 95 compiler that Sun ships. This interval GWW>data type has evolved from the proposed standard for intrinsic data GWW>type that we put in front of the Fortran standardization committees, GWW>but the Sun implementation has various improvements. Also, Sun GWW>has supported theoretical developments for extended (infinite) GWW>interval arithmetic, and presently has a logically clear GWW>implementation (to be sharp in the near future). GWW> GWW>My own experience with the Sun implementation, including sharpness GWW>and speed, is favorable. I view acceptance of the Sun implementation GWW>as an avenue towards standardization. GWW> GWW>Regarding portable interval data types in Fortran, my students GWW>and I have implemented a derived interval data type which we GWW>have published as two ACM TOMS algorithms: GWW> GWW>Algorithm 737: INTLIB ..., ACM TOMS 20 (4), 1994 GWW> GWW>and GWW> GWW>Algorithm 763: INTERVAL_ARITHMETIC, A Fortran 90 module ..., GWW>ACM TOMS 22(4), 1996 GWW> GWW>The derived data type defined by this library and module provides GWW>a syntax that is, with some exceptions, consistent with Sun's GWW>implementation. However, the module only provides a small subset GWW>of what is done in Sun's intrinsic type, and it runs significantly GWW>more slowly, especially when many calls to certain standard GWW>functions such as sin and exp appear, and it does not provide GWW>optimal accuracy, as does Sun's. Finally, it does not provide GWW>a closed system with extended arithmetic. The advantage is that it is GWW>portable. GWW> GWW>I hope this helps. GWW> GWW>Sincerely, GWW> GWW>Baker GWW> GWW>At 11:28 AM 11/13/01 -0600, Aleksandar Donev wrote: GWW>>Forwarded from comp.fortran-90 list: GWW>> GWW>>Hello, GWW>> GWW>>Does someone know what happened with proposals/ideas to add interval GWW>>arithmetic support to Fortran? I have been looking at interval GWW>>arithmetic-based global optimization codes/papers and read that someone GWW>>was working on a proposal to add this to F200x, but that apparently did GWW>>not work out? GWW>> GWW>>Thanks for any info, GWW>>Aleksandar GWW>> GWW>>-- GWW>>__________________________________ GWW> GWW>--------------------------------------------------------------- GWW>R. Baker Kearfott, rbk [at] louisiana [dot] edu (337) 482-5346 (fax) GWW>(337) 482-5270 (work) (337) 981-9744 (home) GWW>URL: http://interval.louisiana.edu/kearfott.html GWW>Department of Mathematics, University of Louisiana at Lafayette GWW>Box 4-1010, Lafayette, LA 70504-1010, USA GWW>--------------------------------------------------------------- GWW> GWW> From owner-reliable_computing [at] interval [dot] louisiana.edu Wed Nov 14 20:20:15 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id fAF2KFY12689 for reliable_computing-outgoing; Wed, 14 Nov 2001 20:20:15 -0600 (CST) Received: from patan.sun.com (patan.Sun.COM [192.18.98.43]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id fAF2K9o12684 for ; Wed, 14 Nov 2001 20:20:10 -0600 (CST) Received: from engmail4.Eng.Sun.COM ([129.144.134.6]) by patan.sun.com (8.9.3+Sun/8.9.3) with ESMTP id TAA04290; Wed, 14 Nov 2001 19:19:42 -0700 (MST) From: Bill.Walster [at] Eng [dot] Sun.COM Received: from phys-mpkmaila (phys-mpkmaila.Eng.Sun.COM [129.146.18.131]) by engmail4.Eng.Sun.COM (8.9.3+Sun/8.9.3/ENSMAIL,v2.1p1) with ESMTP id SAA15480; Wed, 14 Nov 2001 18:19:40 -0800 (PST) Received: from mpkmail.Eng.Sun.COM (esun1as-be.Central.Sun.COM [129.147.34.142]) by mpkmail.eng.sun.com (iPlanet Messaging Server 5.2 (built Oct 28 2001)) with ESMTP id <0GMT00D80L4PWF [at] mpkmail [dot] eng.sun.com>; Wed, 14 Nov 2001 18:19:50 -0800 (PST) Date: Wed, 14 Nov 2001 18:17:33 -0800 Subject: Re: Fwd: Interval arithmetic in Fortran 200x To: reliable_computing [at] interval [dot] louisiana.edu, Aleksandar Donev Cc: bill.walster [at] Eng [dot] Sun.COM Message-id: <0GMT00D8GL4UWF [at] mpkmail [dot] eng.sun.com> MIME-version: 1.0 X-Mailer: Sun NetMail 2.3 Content-type: text/plain; charset=US-ASCII Content-transfer-encoding: 7BIT Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Sorry everybody, I left off "forte" from the alias. It should read: www.sun.com/forte/info/features/intervals.html Regrets, Bill wrote: GWW>Date: Wed, 14 Nov 2001 08:14:45 -0800 GWW> GWW>Hi Aleksandar, GWW> GWW>You don't need to wait for intervals to become part of the standard. You can GWW>use them right now. GWW> GWW>See: www.sun.com/info/features/intervals.html GWW> GWW>and links therein. GWW> GWW>If you have any questions, don't hesitate to send me an email. GWW> GWW>Cheers, GWW> GWW>Bill GWW> GWW>"Aleksandar Donev" wrote: GWW>GWW>Date: Tue, 13 Nov 2001 11:28:43 -0600 GWW>GWW>Forwarded from comp.fortran-90 list: GWW>GWW> GWW>GWW>Hello, GWW>GWW> GWW>GWW>Does someone know what happened with proposals/ideas to add interval GWW>GWW>arithmetic support to Fortran? I have been looking at interval GWW>GWW>arithmetic-based global optimization codes/papers and read that someone GWW>GWW>was working on a proposal to add this to F200x, but that apparently did GWW>GWW>not work out? GWW>GWW> GWW>GWW>Thanks for any info, GWW>GWW>Aleksandar GWW>GWW> GWW>GWW>-- GWW>GWW>__________________________________ GWW>GWW>Aleksandar Donev GWW>GWW>Complex Materials Theory Group (http://cherrypit.princeton.edu/) GWW>GWW>Princeton Materials Institute & Program in Applied and Computational GWW>GWW>Mathematics GWW>GWW>@ Princeton University GWW>GWW>Address: GWW>GWW> 419 Bowen Hall, 70 Prospect Avenue GWW>GWW> Princeton University GWW>GWW> Princeton, NJ 08540-5211 GWW>GWW>E-mail: adonev [at] princeton [dot] edu GWW>GWW>WWW: http://atom.princeton.edu/donev GWW>GWW>Phone: (609) 258-2775 GWW>GWW>Fax: (609) 258-6878 GWW>GWW>__________________________________ GWW>GWW> GWW>GWW> GWW>GWW> GWW> GWW> From owner-reliable_computing [at] interval [dot] louisiana.edu Wed Nov 14 23:34:05 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id fAF5Y5N13123 for reliable_computing-outgoing; Wed, 14 Nov 2001 23:34:05 -0600 (CST) Received: from mail.comset.net (mail.comset.net [213.172.0.3]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id fAF5Xxo13118 for ; Wed, 14 Nov 2001 23:33:59 -0600 (CST) Received: from e0gumi46 (9-100.dialup.comset.net [213.172.9.100]) by mail.comset.net (8.11.6/8.11.6/MAIL/1.0.2) with ESMTP id fAF5SxE26403 for ; Thu, 15 Nov 2001 08:29:00 +0300 (MSK) Message-ID: <003d01c16d97$032f3800$6409acd5 [at] wplus [dot] net> From: "Vyacheslav Nesterov" To: "RC mailing list" Subject: Reliable Computing, Volume 8, issue 1, 2002 Date: Thu, 15 Nov 2001 08:26:45 +0300 MIME-Version: 1.0 Content-Type: multipart/alternative; boundary="----=_NextPart_000_001D_01C16DAF.42FD85A0" X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 5.00.2615.200 X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2615.200 Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk This is a multi-part message in MIME format. ------=_NextPart_000_001D_01C16DAF.42FD85A0 Content-Type: text/plain; charset="koi8-r" Content-Transfer-Encoding: quoted-printable Reliable Computing=20 Volume 8, issue 1, 2002 Mathematical Research Two Ways to Extend the Cholesky Decomposition to Block Matrices with Interval Entries=20 Uwe Schaefer=20 1-20 Approximate Quantified Constraint Solving by Cylindrical Box Decomposition=20 Stefan Ratschan=20 21-42 Exact Minkowski Products of N Complex Disks=20 Rida T. Farouki, Helmut Pottmann=20 43-66 Verification of Invertibility of Complicated Functions=20 over Large Domains=20 Jens Hoefkens, Martin Berz 67-82 A New Subdivision Strategy for Range Computations=20 Paluri S. V. Nataraj, Suresh Mandir Sheela=20 83-92 Information Special Issue on the Linkages Between Interval=20 Mathematics and Fuzzy Set Theory 93-95 ------=_NextPart_000_001D_01C16DAF.42FD85A0 Content-Type: text/html; charset="koi8-r" Content-Transfer-Encoding: quoted-printable
          &nbs= p;    =20 Reliable Computing
     =      =20 Volume 8, issue 1, 2002
 
          = Mathematical=20 Research
 
Two Ways to Extend the Cholesky = Decomposition=20 to Block Matrices  with
Interval Entries
Uwe Schaefer=20
1-20
 
Approximate Quantified Constraint = Solving=20 by  Cylindrical Box
Decomposition
Stefan Ratschan=20
21-42
 
Exact Minkowski Products of N = Complex Disks=20
Rida  T.  Farouki, Helmut Pottmann
43-66
 
Verification of Invertibility of = Complicated=20 Functions
over Large Domains
Jens Hoefkens, Martin=20 Berz
67-82
 
A New Subdivision Strategy for = Range=20 Computations
Paluri S. V. Nataraj, Suresh Mandir Sheela=20
83-92
 
          &nbs= p;  =20 Information
 
Special Issue on the Linkages = Between=20 Interval
Mathematics and Fuzzy Set=20 Theory
93-95
------=_NextPart_000_001D_01C16DAF.42FD85A0-- From owner-reliable_computing [at] interval [dot] louisiana.edu Thu Nov 15 09:51:58 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id fAFFpvG14506 for reliable_computing-outgoing; Thu, 15 Nov 2001 09:51:57 -0600 (CST) Received: from marnier.ucs.louisiana.edu (root [at] marnier [dot] ucs.louisiana.edu [130.70.132.233]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id fAFFpqo14500 for ; Thu, 15 Nov 2001 09:51:52 -0600 (CST) Received: from liberty (liberty.louisiana.edu [130.70.46.171]) by marnier.ucs.louisiana.edu (8.11.3/8.11.3/ull-ucs-mx-host_1.6) with SMTP id fAFFpoT15908 for ; Thu, 15 Nov 2001 09:51:51 -0600 (CST) Message-Id: <2.2.32.20011115155400.01505988 [at] 130 [dot] 70.132.231> X-Sender: rbk5287 [at] 130 [dot] 70.132.231 X-Mailer: Windows Eudora Pro Version 2.2 (32) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Thu, 15 Nov 2001 09:54:00 -0600 To: reliable_computing [at] interval [dot] louisiana.edu From: "R. Baker Kearfott" Subject: Moore Prize for Applications of Interval Analysis Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk REQUEST FOR NOMINATIONS Moore Prize in Applications of Interval Analysis Description and Rationale ========================= The idea of arithmetic over sets to encompass finiteness, roundoff error, and uncertainty dates back to the first part of the twentieth century or earlier. By the late 1950's, with exponentially increasing use of digital electronic computers for mathematical computations, interval arithmetic was a concept whose time had come. With his 1962 dissertation "Interval Arithmetic and Automatic Error Analysis in Digital Computing" under George Forsythe, Prof. Ramon Moore was one of the first to publicize the underlying principles of interval arithmetic in their modern form. Prof. Moore subsequently dedicated his life to furthering the subject. This includes guidance of seven Ph.D. students, interaction with other prominent figures in the area such as Eldon Hansen, Louis Rall, and Bill Walster, and publication of the seminal work "Interval Analysis" (Prentice Hall, 1966) and its update "Methods and Applications of Interval Analysis" (SIAM, 1979). In addition, Prof. Moore published a related book "Computational Functional Analysis" (Horwood, 1985), and organized the conference with proceedings "Reliability in Computing" (Academic Press, 1988). This latter conference was a major catalyst for renewed interest in the subject. It is safe to say that these accomplishments of Professor Moore have made interval analysis what it is today. To continue and further this tradition, we dedicate to Prof. Moore a biennial prize for the best dissertation or paper in applications of interval analysis. Note: Note: By "applications" we intend primarily applications in engineering and the sciences that will bring further recognition to the power of interval computations. However, we do not wish to rule out significant and widely recognized "pure" applications. The editorial board of Reliable Computing will judge this. When and how to submit ====================== The first awarding will be at Validated Computing 2002; see http://interval.louisiana.edu/conferences/Validated_computing_2002/html_notice.html This first time only, dissertations and papers that have appeared during the previous five years (1996 to 2002) may be nominated. To nominate a paper or dissertation (including your work or any other work you deem appropriate), send either an electronic copy (Postscript, PDF, or portable LaTeX) or a URL (web address) where such an electronic copy can be downloaded to rbk [at] louisiana [dot] edu This should be done before February 15, 2002. (If electronic copies are not available, alternate means may be used.) This information is also available in HTML form at http://interval.louisiana.edu/Moore_prize.html Sincerely, R. Baker Kearfott --------------------------------------------------------------- R. Baker Kearfott, rbk [at] louisiana [dot] edu (337) 482-5346 (fax) (337) 482-5270 (work) (337) 981-9744 (home) URL: http://interval.louisiana.edu/kearfott.html Department of Mathematics, University of Louisiana at Lafayette Box 4-1010, Lafayette, LA 70504-1010, USA --------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] louisiana.edu Mon Nov 19 17:21:25 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id fAJNLOI00895 for reliable_computing-outgoing; Mon, 19 Nov 2001 17:21:24 -0600 (CST) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id fAJNLI500890 for ; Mon, 19 Nov 2001 17:21:19 -0600 (CST) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id fAJNLBI12354; Mon, 19 Nov 2001 16:21:11 -0700 (MST) Message-Id: <200111192321.fAJNLBI12354 [at] cs [dot] utep.edu> Date: Mon, 19 Nov 2001 16:21:11 -0700 (MST) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: FYI: informal group on validated computing To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: hskK0CyZNNs4wZPtX17xmQ== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk The latest (December) issue of Notices of the American Mathematical Society has the info (on p. 1349) about the May 27-June 1 2002 Inforaml Working Group on Validated Optimization organized by the Fields Institute in Toronto, Canada. From owner-reliable_computing [at] interval [dot] louisiana.edu Sat Nov 24 07:08:12 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id fAOD8C008136 for reliable_computing-outgoing; Sat, 24 Nov 2001 07:08:12 -0600 (CST) Received: from gyptis.univ-mrs.fr (gyptis.univ-mrs.fr [193.50.130.2]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id fAOD82C08131 for ; Sat, 24 Nov 2001 07:08:03 -0600 (CST) Received: from lim.univ-mrs.fr (ariane [193.50.130.124]) by gyptis.univ-mrs.fr (8.9.3+Sun/jtpda-5.3.3) with ESMTP id OAA12390 ; Sat, 24 Nov 2001 14:07:16 +0100 (MET) Message-ID: <3BFF9C00.3653C412 [at] lim [dot] univ-mrs.fr> Date: Sat, 24 Nov 2001 13:09:20 +0000 From: belaid benhamou X-Mailer: Mozilla 4.61 [en] (X11; I; Linux 2.2.13-7mdk i686) X-Accept-Language: en MIME-Version: 1.0 CC: clp [at] comp [dot] nus.edu.sg, reliable_computing [at] interval [dot] louisiana.edu, constraints-list [at] cwi [dot] nl, clp [at] cs [dot] cmu.edu, clp [at] iscs [dot] nus.sg, clp [at] cis [dot] ohio-state.edu, compulog-list [at] cwi [dot] nl, csp-list [at] cert [dot] fr, constraints [at] cirl [dot] uoregon.edu, cpworld [at] gmu [dot] edu, benhamou [at] lim [dot] univ-mrs.fr Subject: Re: CFP: CP'2001 Workshop onCooperative Solvers in Constraint Programming References: <3B409BF1.9FC59FDF [at] irin [dot] univ-nantes.fr> Content-Type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: 8bit Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk W e apologize for multiple copies of this call for papers **************************************************************************** * Second Call for Papers * * AISC'2002 * * Sixth International Conference on * * ARTIFICIAL INTELLIGENCE AND SYMBOLIC COMPUTATION * * Theory, Implementations and Applications * * * (In conjunction with CALCULEMUS'2002) * * * France, Marseille * * July 1th-5th, 2002 * **************************************************************************** Organized by: Universite de Provence, Universite de Mideterrannee, Faculte des sciences de Saint-Jerome, and the LSIS laboratory. ANNOUNCEMENT No. 1 More informations are available on the web site of the conference: http://www.cmi.univ-mrs.fr/aisc2002. ----------------------------------------------------------------------------- ABOUT THIS CONFERENCE SERIES ---------------------------- Conferences in this series are held every two years. The previous five took place in Karlsruhe (Germany), Cambridge (United Kingdom), Steyr (Austria), Plattsburgh (USA) and Madrid (Spain)-- the first three under the name "Artificial Intelligence and Symbolic Mathematical Computing (AISMC)". For the year 2002, the conference AISC will be held in Marseille (France) in conjunction with CALCULEMUS'2002 (The 10th Symposium on the Integration of symbolic Computation and Mechanized Reasoning). The aim of the conference is to make a forum for the exchange of ideas on artificial intelligence and symbolic computation. The purpoose of such discussion is to provide new tools and solutions by considering problem solving methods from AI and symbolic (mathematical) computation. Another goal is to make personal contacts among researchers from different fields related to AI and Symbolic Computation. The conference is concerned with all aspects of research (including theory, implementations and applications). ORGANIZERS OF AISC'2002 / CALCULEMUS'2002 ----------------------------------------- Both AISC'2002 and CALCULEMUS'2002 are organized by the three Universities of Marseille: L'universite de Provence (Aix-Marseille I), L'universite de la Miditerrannée (Aix-Marseille II), la Faculté des sciences de Saint-Jerome (Aix-Marseille III) and the LSIS laboratory. TOPICS ------ * AI and Symbolic Mathematical Computing * Computer Algebra Systems and Automated Theorem Provers * Integration of Logical Reasoning and Computer Algebra * Engineering, Industrial and Operations Research Applications * Foundations and Complexity of Symbolic Computation * Mathematical Modeling of Multi-Agent Systems * Programming Languages for Symbolic Computation * Symbolic Computations for Expert Systems and Machine Learning * Implementations of Symbolic Computation Systems * Logic and Symbolic Computing * Constraint Programming * Term Rewriting * Logic based Multi Agent Systems * Reasoning Papers on other topics with strong links to those descibed above will also be welcomed for consideration. The second and the third topics of the previous liste fit perfectly the scope of CALCULEMUS'2002. STEERING COMMITTEE ------------------ Jacques Calmet (Univ. Karlsruhe, Germany) John Campbell (University College London, England) Eugenio Roanes-Lozano (Univ. Complutense de Madrid, Spain) CHAIRS ------- Belaid Benhamou (Conference chair) Universite de Provence CMI, 39 rue F. Juliot-Curie 13453 Marseille Cedex 13, France email:Belaid.Benhamou [at] cmi [dot] univ-mrs.fr Laurent Henocque (Program chair) Universite de Mediterrannee ESIL, 163 Avenue de Luminy Marseille Cedex 09, France email:henocque [at] esil [dot] univ-mrs.fr PROGRAM COMMITTEE ----------------- Luigia C. Aiello (Univ. La Sapienza, Roma, Italy) Jose A. Alonso (Univ. de Sevilla, Spain) Michael Beeson (San Jose State Univ., USA) Belaid Benhamou (Universite de Provence, France) Greg Butler (Univ. Concordia, Montreal, Canada) Jim Cunningham (Imperial College London, UK) James Davenport (Univ. of Bath, England) Carl van Geem (LAAS-CNRS, Tolouse, France) Reiner Haehnle (Univ. Karlsruhe, Germany) Deepak Kapur (Univ. New Mexico, USA) Luis M. Laita (Univ. Politecnica de Madrid, Spain) Luis de Ledesma (Univ. Politecnica de Madrid, Spain) Eric Monfroy (Univ de Nantes, France) Jose Mira (UNED, Spain) Ewa Orlowska (Inst. Telecomunications, Warsaw, Poland) Jochen Pfalzgraf (Univ. Salzburg, Austria) Jan Plaza (Univ. Plattsburgh, USA) Zbigniew W. Ras (Univ. North Carolina, Charlotte, USA) Tomas Recio (Univ. de Santander, Spain) Peder Thusgaard Ruhoff (MDS, Proteomics, Denmark) Pierre Siegel (Universite de Provence, France) Andrzej Skowron (Warsaw Univ., Poland) John Slaney (ANU, Canberra, Australia) Viorica Sofronie-Stokkermans (Max Planck Institut, Germany) Karel Stokkermans (Univ. Salzburg, Austria) Carolyn Talcott (Stanford Univ., USA) Rich Thomason (Univ. of Pittsburgh, USA) Dongming Wang (Univ. Paris VI, France) LOCAL COMMITTEE --------------- Gilles Audemard (Univ. Univ de Provence, Aix-Marseille I) Belaid Benhamou (Univ. Univ de Provence, Aix-Marseille I) Philippe Jegou (Univ. de Saint Jerome, Aix-Marseille III) Laurent Henocques (Univ. de la Mediterrannée, Aix-Marseille II) Pierre Siegel (Univ. Univ de Provence,Aix-Marseille I) Eric Wurbel (Univ. du Var, Toulon) DEADLINES --------- * Deadline for submission: February 15, 2002 * Notification of acceptance: March 30, 2002 * Camera-ready papers due: April 19, 2002 PROCEEDINGS ----------- Papers submitted to the conference undergo a standard review process. Previous proceedings were printed by Springer-Verlag (in their volumes LNCS 737, 958, 1138, LNAI 1476 and LNAI 1930). This year's proceedings will also be published by Springer-Verlag and will be available at the conference. SUBMISSION REQUIREMENTS ----------------------- Theoretical and applied research papers on all topics within the scope of the conference are encouraged. Submitted papers (in English) must not exceed 12 pages in length. The title page should contain the title, author(s) with affiliation(s), e-mail address(es), a listing of keywords and abstract PLUS the topics from the list above to which the paper is related. The program committee will subject all submitted papers to peer review. Theoretical papers will be judged on their originality and contribution to their field and applied papers on the importance and originality of the application. Results must be unpublished. Electronic submission is strongly encouraged. Please send a postscript file (.PS ) by e-mail to both "aisc2002 [at] cmi [dot] univ-mrs.fr" and "henocque [at] esil [dot] univ-mrs.fr". If electronic submission is not possible, please send four hard copies to the address given at the end. SUBMISSION REQUIREMENTS FOR THE FINAL VERSION OF ACCEPTED PAPERS ---------------------------------------------------------------- (Observe that this section does not apply when submitting the papers; it REFERS only to the final version of ACCEPTED papers. Nevertheless papers can be submitted in final format, although for submission only the .PS should be sent) Accepted papers should be prepared in LaTeX and formatted in accordance to the instructions given for Springer-Verlag's LNAI series (the correspon- ding style files can be obtained from the web page http://www.springer.de/comp/lncs/authors.html and are the same for the LNCS and LNAI). Please remember to send, together with the .TEX, any non-standard files that are necessary to compile the LaTeX source code too. ADDRESSES (ORGANIZATION) ------------------------ e-mail: aisc2002 [at] cmi [dot] univ-mrs.fr web page: http://www.cmi.univ_mrs.fr/aisc2002 Surface mail: AISC 2002 Dr. Belaid Benhamou Universite de Provence, CMI, 39 rue F. Juliot-Curie 13453 Cedex 13 Phone number: (+33) 4 91 11 36 22 Fax number: (+33) 4 91 11 36 02 From owner-reliable_computing [at] interval [dot] louisiana.edu Sat Nov 24 07:40:22 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id fAODeMo08283 for reliable_computing-outgoing; Sat, 24 Nov 2001 07:40:22 -0600 (CST) Received: from gyptis.univ-mrs.fr (gyptis.univ-mrs.fr [193.50.130.2]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id fAODeIC08278 for ; Sat, 24 Nov 2001 07:40:18 -0600 (CST) Received: from lim.univ-mrs.fr (ariane [193.50.130.124]) by gyptis.univ-mrs.fr (8.9.3+Sun/jtpda-5.3.3) with ESMTP id OAA12694 ; Sat, 24 Nov 2001 14:39:22 +0100 (MET) Message-ID: <3BFFA386.E828196F [at] lim [dot] univ-mrs.fr> Date: Sat, 24 Nov 2001 13:41:26 +0000 From: belaid benhamou X-Mailer: Mozilla 4.61 [en] (X11; I; Linux 2.2.13-7mdk i686) X-Accept-Language: en MIME-Version: 1.0 To: Laurent.Granvilliers [at] irin [dot] univ-nantes.fr CC: clp [at] comp [dot] nus.edu.sg, reliable_computing [at] interval [dot] louisiana.edu, constraints-list [at] cwi [dot] nl, clp [at] cs [dot] cmu.edu, clp [at] iscs [dot] nus.sg, clp [at] cis [dot] ohio-state.edu, compulog-list [at] cwi [dot] nl, csp-list [at] cert [dot] fr, constraints [at] cirl [dot] uoregon.edu, cpworld [at] gmu [dot] edu, benhamou [at] lim [dot] univ-mrs.fr Subject: Re: CFP: CP'2001 Workshop onCooperative Solvers in Constraint Programming References: <3B409BF1.9FC59FDF [at] irin [dot] univ-nantes.fr> Content-Type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: 8bit Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk We apologize for multiple copies **************************************************************************** * Second Call for Papers * * AISC'2002 * * Sixth International Conference on * * ARTIFICIAL INTELLIGENCE AND SYMBOLIC COMPUTATION * * Theory, Implementations and Applications * * * (In conjunction with CALCULEMUS'2002) * * * France, Marseille * * July 1th-5th, 2002 * **************************************************************************** Organized by: Universite de Provence, Universite de Mideterrannee, Faculte des sciences de Saint-Jerome, and the LSIS laboratory. ANNOUNCEMENT No. 1 More informations are available on the web site of the conference: http://www.cmi.univ-mrs.fr/aisc2002. ----------------------------------------------------------------------------- ABOUT THIS CONFERENCE SERIES ---------------------------- Conferences in this series are held every two years. The previous five took place in Karlsruhe (Germany), Cambridge (United Kingdom), Steyr (Austria), Plattsburgh (USA) and Madrid (Spain)-- the first three under the name "Artificial Intelligence and Symbolic Mathematical Computing (AISMC)". For the year 2002, the conference AISC will be held in Marseille (France) in conjunction with CALCULEMUS'2002 (The 10th Symposium on the Integration of symbolic Computation and Mechanized Reasoning). The aim of the conference is to make a forum for the exchange of ideas on artificial intelligence and symbolic computation. The purpoose of such discussion is to provide new tools and solutions by considering problem solving methods from AI and symbolic (mathematical) computation. Another goal is to make personal contacts among researchers from different fields related to AI and Symbolic Computation. The conference is concerned with all aspects of research (including theory, implementations and applications). ORGANIZERS OF AISC'2002 / CALCULEMUS'2002 ----------------------------------------- Both AISC'2002 and CALCULEMUS'2002 are organized by the three Universities of Marseille: L'universite de Provence (Aix-Marseille I), L'universite de la Miditerrannée (Aix-Marseille II), la Faculté des sciences de Saint-Jerome (Aix-Marseille III) and the LSIS laboratory. TOPICS ------ * AI and Symbolic Mathematical Computing * Computer Algebra Systems and Automated Theorem Provers * Integration of Logical Reasoning and Computer Algebra * Engineering, Industrial and Operations Research Applications * Foundations and Complexity of Symbolic Computation * Mathematical Modeling of Multi-Agent Systems * Programming Languages for Symbolic Computation * Symbolic Computations for Expert Systems and Machine Learning * Implementations of Symbolic Computation Systems * Logic and Symbolic Computing * Constraint Programming * Term Rewriting * Logic based Multi Agent Systems * Reasoning Papers on other topics with strong links to those descibed above will also be welcomed for consideration. The second and the third topics of the previous liste fit perfectly the scope of CALCULEMUS'2002. STEERING COMMITTEE ------------------ Jacques Calmet (Univ. Karlsruhe, Germany) John Campbell (University College London, England) Eugenio Roanes-Lozano (Univ. Complutense de Madrid, Spain) CHAIRS ------- Belaid Benhamou (Conference chair) Universite de Provence CMI, 39 rue F. Juliot-Curie 13453 Marseille Cedex 13, France email:Belaid.Benhamou [at] cmi [dot] univ-mrs.fr Laurent Henocque (Program chair) Universite de Mediterrannee ESIL, 163 Avenue de Luminy Marseille Cedex 09, France email:henocque [at] esil [dot] univ-mrs.fr PROGRAM COMMITTEE ----------------- Luigia C. Aiello (Univ. La Sapienza, Roma, Italy) Jose A. Alonso (Univ. de Sevilla, Spain) Michael Beeson (San Jose State Univ., USA) Belaid Benhamou (Universite de Provence, France) Greg Butler (Univ. Concordia, Montreal, Canada) Jim Cunningham (Imperial College London, UK) James Davenport (Univ. of Bath, England) Carl van Geem (LAAS-CNRS, Tolouse, France) Reiner Haehnle (Univ. Karlsruhe, Germany) Deepak Kapur (Univ. New Mexico, USA) Luis M. Laita (Univ. Politecnica de Madrid, Spain) Luis de Ledesma (Univ. Politecnica de Madrid, Spain) Eric Monfroy (Univ de Nantes, France) Jose Mira (UNED, Spain) Ewa Orlowska (Inst. Telecomunications, Warsaw, Poland) Jochen Pfalzgraf (Univ. Salzburg, Austria) Jan Plaza (Univ. Plattsburgh, USA) Zbigniew W. Ras (Univ. North Carolina, Charlotte, USA) Tomas Recio (Univ. de Santander, Spain) Peder Thusgaard Ruhoff (MDS, Proteomics, Denmark) Pierre Siegel (Universite de Provence, France) Andrzej Skowron (Warsaw Univ., Poland) John Slaney (ANU, Canberra, Australia) Viorica Sofronie-Stokkermans (Max Planck Institut, Germany) Karel Stokkermans (Univ. Salzburg, Austria) Carolyn Talcott (Stanford Univ., USA) Rich Thomason (Univ. of Pittsburgh, USA) Dongming Wang (Univ. Paris VI, France) LOCAL COMMITTEE --------------- Gilles Audemard (Univ. Univ de Provence, Aix-Marseille I) Belaid Benhamou (Univ. Univ de Provence, Aix-Marseille I) Philippe Jegou (Univ. de Saint Jerome, Aix-Marseille III) Laurent Henocques (Univ. de la Mediterrannée, Aix-Marseille II) Pierre Siegel (Univ. Univ de Provence,Aix-Marseille I) Eric Wurbel (Univ. du Var, Toulon) From owner-reliable_computing [at] interval [dot] louisiana.edu Mon Nov 26 20:11:37 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id fAR2BbE14629 for reliable_computing-outgoing; Mon, 26 Nov 2001 20:11:37 -0600 (CST) Received: from bologna.vision.caltech.edu (bologna.vision.caltech.edu [131.215.134.19]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id fAR2B9C14623 for ; Mon, 26 Nov 2001 20:11:10 -0600 (CST) Received: from peking.vision.caltech.edu (peking [131.215.134.18]) by bologna.vision.caltech.edu (8.9.3/8.8.7) with ESMTP id SAA21037 for ; Mon, 26 Nov 2001 18:10:56 -0800 Received: (from arrigo@localhost) by peking.vision.caltech.edu (8.9.3+Sun/8.9.1) id SAA04386; Mon, 26 Nov 2001 18:10:32 -0800 (PST) X-Authentication-Warning: peking.vision.caltech.edu: arrigo set sender to arrigo [at] vision [dot] caltech.edu using -f From: Arrigo Benedetti MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-ID: <15362.62999.800968.26354 [at] gargle [dot] gargle.HOWL> Date: Mon, 26 Nov 2001 18:10:31 -0800 To: reliable_computing [at] interval [dot] louisiana.edu Subject: email address of E. Hansen X-Mailer: VM 6.92 under Emacs 20.4.1 Reply-To: arrigo [at] bologna [dot] vision.caltech.edu Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear all, I am looking for the email address of Dr. Eldon Hansen since I would like to let him know that I think I've found a few errors in some formulas in Chap. 9 of his book on global optimization. Thanks, -Arrigo -- Dr. Arrigo Benedetti e-mail: arrigo [at] vision [dot] caltech.edu Caltech, MS 136-93 phone: (626) 395-3129 Pasadena, CA 91125 fax: (626) 795-8649 From owner-reliable_computing [at] interval [dot] louisiana.edu Tue Nov 27 02:44:39 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id fAR8idU15442 for reliable_computing-outgoing; Tue, 27 Nov 2001 02:44:39 -0600 (CST) Received: from servus.gsf.de (servus.gsf.de [146.107.101.11]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id fAR8iXC15436 for ; Tue, 27 Nov 2001 02:44:34 -0600 (CST) Received: from gsf.de ([146.107.217.191] (may be forged)) by servus.gsf.de (8.8.6 (PHNE_17135)/8.8.6.++) with ESMTP id JAA02797 for ; Tue, 27 Nov 2001 09:47:30 +0100 (MET) Message-ID: <3C0352A3.C1232C29 [at] gsf [dot] de> Date: Tue, 27 Nov 2001 09:45:23 +0100 From: Axel Facius Organization: GSF - Inst. f. Bioinformatics X-Mailer: Mozilla 4.76 [en] (X11; U; Linux 2.2.18 i686) X-Accept-Language: en MIME-Version: 1.0 To: reliable_computing [at] interval [dot] louisiana.edu Subject: Re: email address of E. Hansen References: <15362.62999.800968.26354 [at] gargle [dot] gargle.HOWL> Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk > I am looking for the email address of Dr. Eldon Hansen since I would > like to let him know that I think I've found a few errors in > some formulas in Chap. 9 of his book on global optimization. Dear Arrigo, Eldons email address is eldonh [at] earthlink [dot] net. (see http://www.mscs.mu.edu/~globsol/people.html#Hansen) Sincerely, Axel Facius -- __o o__ `\<, ,>/' ___________()/ ()_____________() \()______________ Dr. Axel Facius - Proteomics - Institute for Bioinformatics GSF - Research Center for Environment and Health Ingolstaedter Landstr. 1 D-85764 Neuherberg, GERMANY __________________________________________________ http://mips.gsf.de mailto:a.facius [at] gsf [dot] de __________________________________________________ From owner-reliable_computing [at] interval [dot] louisiana.edu Fri Nov 30 11:21:53 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id fAUHLq001068 for reliable_computing-outgoing; Fri, 30 Nov 2001 11:21:52 -0600 (CST) Received: from mercury.Sun.COM (mercury.Sun.COM [192.9.25.1]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id fAUHLmC01063 for ; Fri, 30 Nov 2001 11:21:49 -0600 (CST) Received: from engmail3.Eng.Sun.COM ([129.144.170.5]) by mercury.Sun.COM (8.9.3+Sun/8.9.3) with ESMTP id JAA20738 for ; Fri, 30 Nov 2001 09:21:44 -0800 (PST) Received: from phys-mpkmaila (phys-mpkmaila.Eng.Sun.COM [129.146.18.131]) by engmail3.Eng.Sun.COM (8.9.3+Sun/8.9.3/ENSMAIL,v2.1p1) with ESMTP id JAA07936; Fri, 30 Nov 2001 09:20:53 -0800 (PST) Received: from gww (gww.Eng.Sun.COM [129.146.78.116]) by mpkmail.eng.sun.com (iPlanet Messaging Server 5.2 (built Oct 28 2001)) with SMTP id <0GNM00BFTIUTQR [at] mpkmail [dot] eng.sun.com>; Fri, 30 Nov 2001 09:20:53 -0800 (PST) Date: Fri, 30 Nov 2001 09:20:53 -0800 (PST) From: William Walster Subject: Forte Developer 7 Early Access! To: reliable_computing [at] interval [dot] louisiana.edu Cc: bill.walster [at] Eng [dot] Sun.COM Reply-to: William Walster Message-id: <0GNM00BFUIUTQR [at] mpkmail [dot] eng.sun.com> MIME-version: 1.0 X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4.2 SunOS 5.8 sun4u sparc Content-type: TEXT/plain; charset=us-ascii Content-transfer-encoding: 7BIT Content-MD5: iuE+TYWxi+fdwp27xwpFWQ== Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Greetings! The Forte Developer 7 Early Access website is now ready! We are very excited to have you test our early access product. The Forte Developer 7 Early Access features include: * A new user interface based on the open source NetBeans[tm] Tools Platform. * New product entitlement based on serial numbers. * Significant updates to our C, C++ and Fortran compilers. * New functionality for our Performance Analyzer. Check out the Features & Benefits page for more details. You can download the product at: http://access1.sun.com/fortedevprod/ Please read the Release Notes for up-to-date information and the Download Instructions at: http://access1.sun.com/fortedevprod/documentation/index.html Once you have downloaded and installed the software, please fill out the ONLINE! Installation Report at: http://access1.sun.com/fortedevprod/installsurvey.html As with any Early Access product there will be bugs. We appreciate any input you can provide us via the Customer Feedback Forms on the website, however, we cannot offer any support at this time. Your input will be evaluated and we will do our best to address any concerns. This is a public website so feel free to forward this to any of your customers that may be interested in testing the Forte Developer 7 Early Access Software. Thank you for your interest in our new Forte Developer 7 release! Best regards, Bill Walster G. William (Bill) Walster, Ph.D. Interval Technology Engineering Manager Sun Microsystems, Inc. 16 Network Circle, MS UMPK16-304 Menlo Park, CA 94025 (650) 786-9004 Direct (650) 786-9551 Fax bill.walster [at] eng [dot] sun.com