From owner-reliable_computing [at] interval [dot] louisiana.edu Sun Feb 2 10:47:28 2003 Received: (from daemon@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h12GlS403322 for reliable_computing-outgoing; Sun, 2 Feb 2003 10:47:28 -0600 (CST) Received: from imf17bis.bellsouth.net (mail317.mail.bellsouth.net [205.152.58.177]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id h12GlNt03318 for ; Sun, 2 Feb 2003 10:47:24 -0600 (CST) Received: from Inspiron-8200 ([65.83.166.61]) by imf17bis.bellsouth.net (InterMail vM.5.01.04.25 201-253-122-122-125-20020815) with SMTP id <20030202164916.NLQZ14897.imf17bis.bellsouth.net@Inspiron-8200> for ; Sun, 2 Feb 2003 11:49:16 -0500 Message-Id: <2.2.32.20030202164712.009b4ee8 [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: Sun, 02 Feb 2003 10:47:12 -0600 To: reliable_computing [at] interval [dot] louisiana.edu From: "R. Baker Kearfott" Subject: reliable_computing semi-annual list verification results Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear colleagues, Thank you for your cooperation in the recent semi-annual list verification procedures. I removed the following names from the list. If anyone knows of appropriate new email addresses for these people, and if these people still wish to remain on the list, please inform me. Best regards, R. Baker Kearfott ================================================================ Host unknown: ------------ bma [at] di [dot] ufpe.br mbc [at] di [dot] ufpe.br mac [at] di [dot] ufpe.br kwant [at] liceum6 [dot] 4pl joeb [at] candida [dot] matematik.su.se jragot [at] mailhost [dot] ensem.u-nancy.fr Arnaud.Gotlieb [at] detexis [dot] thomson-csf.com User unknown: ------------ santas [at] inf [dot] ethz.ch seader [at] cc [dot] utah.edu deb [at] comco [dot] com zqiu [at] csr [dot] uvic.ca tanaka [at] oishi [dot] info.waseda.ac.jp schumacher [at] fzi [dot] de eteica [at] ececs [dot] uc.edu aha2 [at] EECS [dot] Lehigh.EDU skerjean [at] irisa [dot] fr shouxiang [at] 263 [dot] net mlstone [at] concentric [dot] net Andrew.Lumsdaine.1 [at] nd [dot] edu katerina67 [at] hotmail [dot] com phhanh [at] isl [dot] s-t.au.ac.th stein@mpi-magdeburg.mpg kanzawa [at] oishi [dot] info.waseda.ac.jp Account disabled: ---------------- psong76 [at] 21cn [dot] com Could not deliver in specified time: ----------------------------------- acasares [at] puceuio [dot] puce.edu.ec benedett [at] dsi [dot] unimo.it ================================================================ --------------------------------------------------------------- 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 Sun Feb 2 10:53:39 2003 Received: (from daemon@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h12Grc303413 for reliable_computing-outgoing; Sun, 2 Feb 2003 10:53:38 -0600 (CST) Received: (from rbk5287@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h12GrZX03408 for reliable_computing [at] interval [dot] louisiana.edu; Sun, 2 Feb 2003 10:53:35 -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.3) with ESMTP id h123lvt02049 for ; Sat, 1 Feb 2003 21:47:57 -0600 (CST) Received: from ultra7.math.wisc.edu (ultra7.math.wisc.edu [144.92.166.188]) by lcyoung.math.wisc.edu (8.11.6/8.11.6) with ESMTP id h123jle26826; Sat, 1 Feb 2003 21:45:47 -0600 (CST) Date: Sat, 1 Feb 2003 21:45:46 -0600 (CST) From: Hans Schneider To: NETS -- at-net , E-LETTER , Pradeep Misra , Shaun Fallat , "na.digest" , ipnet-digest [at] math [dot] msu.edu, SIAGLA-DIGEST , wim@bell-labs.com, hjt [at] eos [dot] ncsu.edu, SMBnet [at] smb [dot] org, vkm [at] eedsp [dot] gatech.edu, reliable_computing [at] interval [dot] louisiana.edu Subject: LAA contenrts Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-MailScanner: Found to be clean Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear Net Organizer: Please circulate the attached LAA contents over your net. Thanks hans ********************************************************************* Hans Schneider Office: Home: Mathematics Department 910 S. Midvale Blvd. Van Vleck Hall Madison, WI 53711 USA University of Wisconsin 608-271-7252 480 Lincoln Drive Madison, WI 53706-1313 USA Email: hans [at] math [dot] wisc.edu Office Phone: 608-262-1402 WWW: http://www.math.wisc.edu/~hans Math Dept Phone: 608-263-3054 Math Dept Fax: 608-263-8891 ********************************************************************* * Linear Algebra and its Applications Volume 362, Pages 1-302 (15 March 2003) http://www.sciencedirect.com/science/issue/5653-2003-996379999-382236 =============================================================================== TABLE OF CONTENTS Chain addition cycles, Pages 1-10 Jody M. Lockhart and William P. Wardlaw On the limit products of a family of matrices, Pages 11-27 N. Guglielmi and M. Zennaro Five-diagonal matrices and zeros of orthogonal polynomials on the unit circle, Pages 29-56 M. J. Cantero, L. Moral and L. Velazquez Facial structures for unital positive linear maps in the two-dimensional matrix algebra, Pages 57-73 Seung-Hyeok Kye On trees with perfect matchings, Pages 75-85 Jason J. Molitierno and Michael Neumann Reducible pattern k-potent ray pattern matrices, Pages 87-99 Jeffrey Stuart Relationship of eigenvalues for USAOR iterative method applied to a class of p-cyclic matrices, Pages 101-108 Ruiming Li The Laplacian eigenvalues of mixed graphs, Pages 109-119 Xiao-Dong Zhang and Rong Luo The limit points of Laplacian spectra of graphs, Pages 121-128 Ji-Ming Guo The intersection of the similarity and conjunctivity equivalence classes, Pages 129-136 Mark A. Mills Moore-Penrose biorthogonal systems in Euclidean spaces, Pages 137-143 Miroslav Fiedler Additive rank-one preserving surjections on symmetric matrix spaces, Pages 145-151 Chong-guang Cao and Xian Zhang A companion matrix resultant for Bernstein polynomials, Pages 153-175 Joab R. Winkler Spectrally stable matrices, Pages 177-189 Terry Lenker and Sivaram Narayan On the construction of a Jacobi matrix from its mixed-type eigenpairs, Pages 191-200 Zhen-yun Peng, Xi-yan Hu and Lei Zhang Structure theorem for the rotation group over Q, Pages 201-209 Guoyang Liu and Lewis C. Robertson Perturbation analysis of the maximal solution of the matrix equation X+A*X-1A=P. II, Pages 211-228 Ji-gunag Sun and Shu-Fang Xu New perturbation results on pseudo-inverses of linear operators in Banach spaces, Pages 229-235 Jiu Ding Convergence theorems for parallel multisplitting two-stage iterative methods for mildly nonlinear systems, Pages 237-250 Zhong-Zhi Bai and Chuan-Long Wang Matrix representation of quaternions, Pages 251-255 Richard William Farebrother, Jurgen Gro[ss] and Sven-Oliver Troschke Enriched Krylov subspace methods for ill-posed problems, Pages 257-273 D. Calvetti, L. Reichel and A. Shuibi Matrix inequalities with applications to the theory of iterated kernels, Pages 275-286 William Banks, Asma Harcharras, Stefan Neuwirth and Eric Ricard A rank criterion for the order of a pole of a matrix function, Pages 287-292 Fei Zhou A note on the integer eigenvalues of the Laplacian matrix of a balanced binary tree, Pages 293-300 Oscar Rojo and Matilde Pena Author index, Pages 301-302 Editorial board, Pages ii-iii From owner-reliable_computing [at] interval [dot] louisiana.edu Sun Feb 2 15:30:55 2003 Received: (from daemon@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h12LUs704328 for reliable_computing-outgoing; Sun, 2 Feb 2003 15:30:54 -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.3) with ESMTP id h12LUot04324 for ; Sun, 2 Feb 2003 15:30:51 -0600 (CST) Received: from aragorn (aragorn [129.108.5.35]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id h12LUl919554 for ; Sun, 2 Feb 2003 14:30:47 -0700 (MST) Message-Id: <200302022130.h12LUl919554 [at] cs [dot] utep.edu> Date: Sun, 2 Feb 2003 14:30:46 -0700 (MST) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: FYI: a new book by Professor Kulisch To: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: 00++XjxrrR5mYgVHWPQzng== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk A new book "Advanced Arithmetic for the Digital Computer" by Professor U. W. Kulisch has just been published by Springer-Verlag, Wien. It is a relatively small book written for engineers that introduces them into computer arithmetic and interval computations. From owner-reliable_computing [at] interval [dot] louisiana.edu Sun Feb 2 18:06:27 2003 Received: (from daemon@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h1306R404572 for reliable_computing-outgoing; Sun, 2 Feb 2003 18:06:27 -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.3) with ESMTP id h1306Nt04568 for ; Sun, 2 Feb 2003 18:06:23 -0600 (CST) Received: from aragorn (aragorn [129.108.5.35]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id h1306J720385 for ; Sun, 2 Feb 2003 17:06:19 -0700 (MST) Message-Id: <200302030006.h1306J720385 [at] cs [dot] utep.edu> Date: Sun, 2 Feb 2003 17:06:18 -0700 (MST) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: from NA Digest To: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: rfxyvQiXdTOXNMviI0zT+Q== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Interval Analysis is explicitly mentioned. ************************************************* From: Theodore Simos Date: Thu, 30 Jan 2003 02:58:58 +0200 Subject: Conference in Cambridge on Numerical Analysis SECOND ANNOUNCEMENT AND CALL FOR ABSTRACTS/PAPERS International Conference on NUMERICAL ANALYSIS & COMPUTATIONAL MATHEMATICS (NACoM-2003) 23-24-25-26 May 2003, Anglia Polytechnic University (APU), Cambridge, UK http://www.apu.ac.uk/appsci/maths/NACoM-2003/ The primary objective of the NACoM-2003 Conference is to bring together leading members of the international Numerical & Computational Mathematics community and to attract original research papers of very high quality. Special Embedded Event: This first time the NACoM Conference will host the official launch of a new WILEY Journal named Applied Numerical Analysis & Computational Mathematics (ANACM) (Editor-in-Chief: T.E. Simos). The journal will provide colleagues with a new really efficient medium for refereed publications, where the time between a paper submission and its acceptance for publication is expected to be no more than 6 months. ANACM will be registered with the SCI without delay. You will also have the chance to meet in person members of the ANACM Editorial Board. MAIN TOPICS Numerical ODEs, Numerical PDEs (inc. BVPs), Scientific Computing and Algorithms, Stochastic Differential Equations, Approximation, Numerical Linear Algebra, Numerical Integral Equations, Error Analysis and Interval Analysis, Difference Equations and Recurrence Relations, Numerical problems in Dynamical Systems, Applications to the Sciences (Computational Physics, Computational Statistics, Computational Chemistry, Computational Engineering etc), Differential Algebraic Equations, Numerical methods in Fourier analysis GENERAL CHAIR & ORGANISER Dr Georgios Psihoyios, Anglia Polytechnic University, Cambridge, UK VICE-CHAIRS Prof. Theodore Simos, University of Peloponnisos, Greece Boz Kempski, Anglia Polytechnic University, Cambridge, UK SCIENTIFIC COMMITTEE Prof. J.R. Cash (Imperial College, London, UK), Prof. R. Cools (Katholieke Universiteit Leuven, Belgium), Prof. A. Cuyt (University of Antwerp, Belgium), Prof. B. Fischer (Medical University of Luebeck, Germany), Prof. R.W. Freund (Bell Laboratories, USA), Prof. I. Gladwell (Southern Methodist University, USA), Prof. B. Hendrickson (Sandia National Laboratories, USA), Prof. M. Hochbruck (University of Duesseldorf, Germany), Dr W.F. Mitchell (National Institute of Standards & Technology, USA), Prof. G. Vanden Berghe (University of Gent, Belgium), Prof. G.A. Watson (University of Dundee, Scotland, UK). PLENARY SPEAKERS Prof. J.R. Cash, Imperial College, London, UK. Prof. A. Cuyt, University of Antwerp, Belgium. Prof. B. Fischer, Medical University of Luebeck, Germany Prof. M. Hochbruck, University of Duesseldorf, Germany. Dr W.F. Mitchell, National Institute of Standards & Technology, USA. Prof. G. Vanden Berghe, University of Gent, Belgium. Prof. G.A. Watson, University of Dundee, Scotland, UK SECOND CALL FOR ABSTRACTS/PAPERS Submission of original papers is invited for the NACoM-2003 Conference. For full details and procedures please visit the NACoM-2003 website. PUBLICATIONS The Conference will provide its registered participants with the opportunity for TWO distinct refereed hard-copy publications + TWO corresponding electronic publications. CALL FOR MINISYMPOSIA/PARALLEL-SESSIONS (also see website) DEADLINES Submission of Abstract (on or before): February 28, 2003 Early Registration ends: March 10, 2003 Abstracts refereed selection by: March 20, 2003 From owner-reliable_computing [at] interval [dot] louisiana.edu Sun Feb 2 18:07:00 2003 Received: (from daemon@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h1306xh04610 for reliable_computing-outgoing; Sun, 2 Feb 2003 18:06:59 -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.3) with ESMTP id h1306ot04602 for ; Sun, 2 Feb 2003 18:06:51 -0600 (CST) Received: from aragorn (aragorn [129.108.5.35]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id h1306kV20391 for ; Sun, 2 Feb 2003 17:06:47 -0700 (MST) Message-Id: <200302030006.h1306kV20391 [at] cs [dot] utep.edu> Date: Sun, 2 Feb 2003 17:06:46 -0700 (MST) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: from NA Digest To: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: BCmWtdz+O77x9Z8VzyXceQ== 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 From: Christophe Jermann Date: Mon, 27 Jan 2003 10:08:39 +0100 Subject: Workshop in Switzerland on Global Constrained Optimization Call for Papers COCOS 2003 Second International Workshop on Global Constrained Optimization and Constraint Satisfaction November 2003 Switzerland http://liawww.epfl.ch/cocos03 More information provided on the web site. Best regards, C.Jermann From owner-reliable_computing [at] interval [dot] louisiana.edu Sun Feb 2 18:15:34 2003 Received: (from daemon@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h130FXG04758 for reliable_computing-outgoing; Sun, 2 Feb 2003 18:15:34 -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.3) with ESMTP id h130FSt04753 for ; Sun, 2 Feb 2003 18:15:29 -0600 (CST) Received: from aragorn (aragorn [129.108.5.35]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id h130FPY20466 for ; Sun, 2 Feb 2003 17:15:25 -0700 (MST) Message-Id: <200302030015.h130FPY20466 [at] cs [dot] utep.edu> Date: Sun, 2 Feb 2003 17:15:24 -0700 (MST) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: from the webpage To: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: IqcxkpJMf1L+GY1B7gmiaQ== 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 Cocos'03 Global Constrained Optimization and Constraint Satisfaction 18-21 November 2003 http://liawww.epfl.ch/cocos03/ Call for Papers Objectives - Topics - Submission - Reviewing - Publication - Dates ------------------------------------------------------------- OBJECTIVES Continuous constraints are a natural way to represent many practical problems and the knowledge they involve. Such constraints may be simple or complex, linear or non-linear and may, or may not, involve transcendental functions. They are widely used to express, for example, chemical or mechanical models, process descriptions, building codes or cost restrictions. Many industrial problems involving continuous constraints can be modeled as continuous constraint satisfaction and optimization problems (CSOPs). In practice, such models are often large in size and non-linear. As the preceding workshop, this workshop focuses on complete solving techniques for continuous CSOPs that provide all solutions with full rigor. Less rigorous solution techniques are not excluded, since they may be part of complete relevant techniques. Complete solution techniques guarantee that all the constraints - e.g. security or tolerance criteria - are satisfied and the global optima identified. Completeness would thus benefit directly the quality and reliability of decisions or analyses based on the provided solutions. This has obvious implications in many industrial and economic areas. None of the existing approaches for solving non-linear CSOPs is fully satisfactory in practice. Non-linear programming techniques are routinely used and can solve large-scale non-linear problems. However, they are complete only in the convex case and if round off errors are controlled. In contrast, constraint programming solvers preserve completeness, but suffer from poor scalability. The respective strengths of mathematical and constraint programming appear however to be highly complementary and a number of recent development showed that there is a lot to be gained by merging the different inference techniques they provide and by combining their specific advantages. The goal of this workshop is to bring together communities from global optimization, mathematical programming and constraint programming, giving the opportunity to promote presentation and discussion of ongoing work on solving techniques for continuous CSOPs. The workshop aims to encourage cross-fertilization between the various approaches, including the study of adapted cooperation strategies between mathematical and constraint programming, and of new representations and abstractions for which they can efficiently interact. TOPICS Relevant topics include, but are by no means restricted to the following: * Solution techniques for global optimization problems * Integration of constraint programming with non-linear programming techniques * Linear and nonlinear convex enclosures of nonlinear programs * Semidefinite programming techniques for global optimization * Improved consistency techniques for continuous constraints * Combination of symbolic methods with mathematical and constraint programming techniques * Solution techniques for under-constrained systems * Adaptation of sparse matrix techniques to the non-linear case * Representation and exploitation of monotonicity and convexity properties * Abstractions based on convex decomposition * Partial boundary representation based on critical points and topological abstractions SUBMISSION The final deadline for submissions is August 20th. Submissions are expected in the form of extended abstracts. An extended abstract must be at least 2 pages. It must be written in English and formatted using the standard LNCS/LNAI format (see instructions at http://www.springer.de/comp/lncs/authors.html). The title page should include the name, address and e-mail address for each author as well as a list of keywords. Submissions have to be sent in postscript or PDF format to cocos03 [at] epfl [dot] ch. A contact author should be specified in the submission mail. REVIEWING PROCESS Submissions will be judged on significance, originality, quality and clarity. Each paper will be cross-reviewed by at least two referees. Authors will receive feedback in the form of reviewers' comments. The accepted submissions will be presented during the workshop. PUBLICATION The organizers plan to publish a selection of full papers in an appropriate book series or a special issue of a journal. After the workshop, authors of selected extended abstracts will be invited to submit a full paper with their contribution for this formal publication. Submitted full papers will then be formally reviewed before publication. IMPORTANT DATES * 20th Aug 2003 - Submission deadline * 20th Sep 2003 - Notification of acceptance * 30th Oct 2003 - Pre-registration ends * 30th Oct 2003 - Final camera-ready copies * 18-21 Nov 2003 - Workshop ------------------------------------------------------------------------ From owner-reliable_computing [at] interval [dot] louisiana.edu Sun Feb 2 18:22:51 2003 Received: (from daemon@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h130MpM04893 for reliable_computing-outgoing; Sun, 2 Feb 2003 18:22:51 -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.3) with ESMTP id h130Mkt04889 for ; Sun, 2 Feb 2003 18:22:46 -0600 (CST) Received: from aragorn (aragorn [129.108.5.35]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id h130Mgt20536; Sun, 2 Feb 2003 17:22:42 -0700 (MST) Message-Id: <200302030022.h130Mgt20536 [at] cs [dot] utep.edu> Date: Sun, 2 Feb 2003 17:22:41 -0700 (MST) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: corrected version To: reliable_computing [at] interval [dot] louisiana.edu, vladik [at] cs [dot] utep.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: xujeH8rK58RqTjJgRPR3qQ== 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 I apologize, "save to frame" did not save program committee, so I am resending the corrected version. Vladik http://liawww.epfl.ch/cocos03/ 2nd International Workshop on Global Constrained Optimization and Constraint Satisfaction (Cocos'03) Switzerland 18-21 November 2003 Programme committee Frederic BENHAMOU, Universite de Nantes, France Christian BLIEK, ILOG, France Boi FALTINGS, Ecole Polytechnique Federale de Lausanne, Switzerland Arnold NEUMAIER, University of Vienna, Austria Peter SPELLUCCI, Darmstadt University, Germany Pascal VAN HENTENRYCK, Brown University, USA Luis N. VICENTE, University of Coimbra, Portugal Organization/Contact Christophe JERMANN & Djamila SAM-HAROUD Artificial Intelligence Lab. Ecole Polytechnique Federale de Lausanne IN (Ecublens), CH-1015 Lausanne (Switzerland) Phone: +41 21 693 52 09 Fax: +41 21 693 52 25 Call for Papers Objectives - Topics - Submission - Reviewing - Publication - Dates ------------------------------------------------------------- OBJECTIVES Continuous constraints are a natural way to represent many practical problems and the knowledge they involve. Such constraints may be simple or complex, linear or non-linear and may, or may not, involve transcendental functions. They are widely used to express, for example, chemical or mechanical models, process descriptions, building codes or cost restrictions. Many industrial problems involving continuous constraints can be modeled as continuous constraint satisfaction and optimization problems (CSOPs). In practice, such models are often large in size and non-linear. As the preceding workshop, this workshop focuses on complete solving techniques for continuous CSOPs that provide all solutions with full rigor. Less rigorous solution techniques are not excluded, since they may be part of complete relevant techniques. Complete solution techniques guarantee that all the constraints - e.g. security or tolerance criteria - are satisfied and the global optima identified. Completeness would thus benefit directly the quality and reliability of decisions or analyses based on the provided solutions. This has obvious implications in many industrial and economic areas. None of the existing approaches for solving non-linear CSOPs is fully satisfactory in practice. Non-linear programming techniques are routinely used and can solve large-scale non-linear problems. However, they are complete only in the convex case and if round off errors are controlled. In contrast, constraint programming solvers preserve completeness, but suffer from poor scalability. The respective strengths of mathematical and constraint programming appear however to be highly complementary and a number of recent development showed that there is a lot to be gained by merging the different inference techniques they provide and by combining their specific advantages. The goal of this workshop is to bring together communities from global optimization, mathematical programming and constraint programming, giving the opportunity to promote presentation and discussion of ongoing work on solving techniques for continuous CSOPs. The workshop aims to encourage cross-fertilization between the various approaches, including the study of adapted cooperation strategies between mathematical and constraint programming, and of new representations and abstractions for which they can efficiently interact. TOPICS Relevant topics include, but are by no means restricted to the following: * Solution techniques for global optimization problems * Integration of constraint programming with non-linear programming techniques * Linear and nonlinear convex enclosures of nonlinear programs * Semidefinite programming techniques for global optimization * Improved consistency techniques for continuous constraints * Combination of symbolic methods with mathematical and constraint programming techniques * Solution techniques for under-constrained systems * Adaptation of sparse matrix techniques to the non-linear case * Representation and exploitation of monotonicity and convexity properties * Abstractions based on convex decomposition * Partial boundary representation based on critical points and topological abstractions SUBMISSION The final deadline for submissions is August 20th. Submissions are expected in the form of extended abstracts. An extended abstract must be at least 2 pages. It must be written in English and formatted using the standard LNCS/LNAI format (see instructions at http://www.springer.de/comp/lncs/authors.html). The title page should include the name, address and e-mail address for each author as well as a list of keywords. Submissions have to be sent in postscript or PDF format to cocos03 [at] epfl [dot] ch. A contact author should be specified in the submission mail. REVIEWING PROCESS Submissions will be judged on significance, originality, quality and clarity. Each paper will be cross-reviewed by at least two referees. Authors will receive feedback in the form of reviewers' comments. The accepted submissions will be presented during the workshop. PUBLICATION The organizers plan to publish a selection of full papers in an appropriate book series or a special issue of a journal. After the workshop, authors of selected extended abstracts will be invited to submit a full paper with their contribution for this formal publication. Submitted full papers will then be formally reviewed before publication. IMPORTANT DATES * 20th Aug 2003 - Submission deadline * 20th Sep 2003 - Notification of acceptance * 30th Oct 2003 - Pre-registration ends * 30th Oct 2003 - Final camera-ready copies * 18-21 Nov 2003 - Workshop ------------------------------------------------------------------------ From owner-reliable_computing [at] interval [dot] louisiana.edu Mon Feb 3 07:01:54 2003 Received: (from daemon@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h13D1sa05945 for reliable_computing-outgoing; Mon, 3 Feb 2003 07:01:54 -0600 (CST) Received: (from rbk5287@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h13D1of05940 for reliable_computing [at] interval [dot] louisiana.edu; Mon, 3 Feb 2003 07:01:50 -0600 (CST) Received: from duck.doc.ic.ac.uk (IDENT:exim [at] duck [dot] doc.ic.ac.uk [146.169.1.46]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id h12Jxot04159 for ; Sun, 2 Feb 2003 13:59:51 -0600 (CST) Received: from dabar.doc.ic.ac.uk ([146.169.4.183] helo=doc.ic.ac.uk) by duck.doc.ic.ac.uk with esmtp (Exim 3.16 #7) id 18fQH7-0007Lo-00; Sun, 02 Feb 2003 19:59:33 +0000 Message-ID: <3E3D78A5.8050600 [at] doc [dot] ic.ac.uk> Date: Sun, 02 Feb 2003 19:59:33 +0000 From: Abbas Edalat Organization: Imperial College User-Agent: Mozilla/5.0 (X11; U; Linux i686; en-US; rv:1.2.1) Gecko/20021130 X-Accept-Language: en-us, en MIME-Version: 1.0 To: "'comprox [at] doc [dot] ic.ac.uk'" , cca-list@fernuni-hagen.de, reliable_computing [at] interval [dot] louisiana.edu Subject: solution of differential equations Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear Colleagues, The following paper: Domain-theoretic Solution of Differential Equations (Scalar Fields) A. Edalat, M. Krznaric and A. Lieutier is now available from: http://www.doc.ic.ac.uk/~ae/papers/scalar.ps The abstract is included below. We appreciate any feedback. Best regards, Abbas Edalat ------------------------------ Abstract: We provide an algorithmic formalization of ordinary differential equations in the framework of domain theory. Given a Scott continuous, interval-valued and time-dependent scalar field and a Scott continuous initial function consistent with the scalar field, the domain-theoretic analogue of the classical Picard operator, whose fix-points give the solutions of the differential equation, acts on the domain of continuously differentiable functions by successively updating the information about the solution and the information about its derivative. We present a linear and a quadratic algorithm respectively for updating the function information and the derivative information on the basis elements of the domain. In the generic case of a classical initial value problem with a continuous scalar field, which is Lipschitz in the space component, this provides a novel technique for computing the unique solution of the differential equation up to any desired accuracy, such that at each stage of computation one obtains two continuous piecewise linear maps which bound the solution from below and above, thus giving the precise error. When the scalar field is continuous and computable but not Lipschitz, it is known that no computable classical solution may exist. We show that in this case the interval-valued domain-theoretic solution is computable and contains all classical solutions. This framework also allows us to compute an interval-valued solution to a differential equation when the initial value and/or the scalar field are interval-valued, i.e. imprecise. From owner-reliable_computing [at] interval [dot] louisiana.edu Mon Feb 3 21:00:26 2003 Received: (from daemon@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h1430Pv07266 for reliable_computing-outgoing; Mon, 3 Feb 2003 21:00:25 -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.3) with ESMTP id h1430Lt07262 for ; Mon, 3 Feb 2003 21:00:21 -0600 (CST) Received: from aragorn (aragorn [129.108.5.35]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id h1430Ev01492 for ; Mon, 3 Feb 2003 20:00:16 -0700 (MST) Message-Id: <200302040300.h1430Ev01492 [at] cs [dot] utep.edu> Date: Mon, 3 Feb 2003 20:00:12 -0700 (MST) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: review of Neumaier's book To: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: fQ/PY9yC14+FjPKAI+C2Bg== 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 Just FYI: A very positive review of the latest book by Arnold Neumaier appeared in Vol. 44, No. 3, 2002 of SIAM Review, pp. 492-493, by Nicholas J. Higham. A support from mainstream numerical math folks is an important step towards widening the circle of numerical folks who are aware of interval and validated techniques. From owner-reliable_computing [at] interval [dot] louisiana.edu Tue Feb 4 17:47:24 2003 Received: (from daemon@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h14NlO208448 for reliable_computing-outgoing; Tue, 4 Feb 2003 17:47:24 -0600 (CST) Received: from kathmandu.sun.com (kathmandu.sun.com [192.18.98.36]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id h14NlIt08444 for ; Tue, 4 Feb 2003 17:47:19 -0600 (CST) Received: from heliopolis.eng.sun.com ([152.70.28.21]) by kathmandu.sun.com (8.9.3+Sun/8.9.3) with ESMTP id QAA11283 for ; Tue, 4 Feb 2003 16:47:17 -0700 (MST) Received: from sun.com (sml-mtv29-dhcp-33-189 [152.70.33.189]) by heliopolis.eng.sun.com (8.9.3+Sun/8.9.3/ENSMAIL,v2.1p1) with ESMTP id PAA03298; Tue, 4 Feb 2003 15:47:17 -0800 (PST) Message-ID: <3E404F76.B5EF8F5E [at] sun [dot] com> Date: Tue, 04 Feb 2003 15:40:38 -0800 From: Bill Walster X-Mailer: Mozilla 4.79 [en] (Win98; U) X-Accept-Language: en MIME-Version: 1.0 To: reliable_computing [at] interval [dot] louisiana.edu Subject: [Fwd: [Fwd: Interval Applicability Survey]] Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear fellow intervalers. I need some help. I have been asked to estimate the current and future applicability of computing with intervals in the following market segments: Electronic Design Nuclear Applications Mechanical Design Radar Cross-Section Crash Simulation Fluid Dynamics Weather, Climate Modeling Signal/Image Processing Cryptography Life Sciences Financial Modeling Petroleum I have learned that it is not helpful to say that intervals apply to everything. People want to understand where intervals do *not* apply and why. For example, is it that some problems are inherently discrete? Or is it that existing solvers and processors lack required capabilities? For the sake of calibrating estimates, let's say that we consider what is possible today with existing hardware and software, compared to what will be possible in 2007 on a hypothetical system consisting of 100,000 processors, each of which can deliver 4 billion interval operations per second (4 GIOPS). Assume that commercial quality (ILOG, Nag or IMSL) interval solver libraries exist for performing basic interval functions, such as: linear programming; solving nonlinear systems of equations; global nonlinear optimization; and modeling bounded physical systems, etc. Specific questions: 1. What fraction of the existing real applications in the above market segments that you are familiar with *can* be done with existing interval hardware and software tools? Note: I am not interested in the size of the existing interval markets. I am rather interested in how applicable our existing tools are *if* they are used. 2. Same question, but in 2007 with the assumed HW and SW described, above. 3. What problems that you are familiar with cannot now be solved using current interval software and hardware? Why? 4. What problems that you are familiar with do you believe will still be outside the "interval domain" in 2007 under the HW and SW described, above? 5. In your particular substantive area of expertise, and matching as closely as possible one of the above market segments, please send pointers or references to the best current interval applications that demonstrate computing with intervals will be important. Please feel free to comment regarding anything you think will help to characterize the current and future applicability of computing with intervals. Thanks in advance for your help making these estimates. Best regards, Bill From owner-reliable_computing [at] interval [dot] louisiana.edu Thu Feb 6 10:16:30 2003 Received: (from daemon@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h16GGTe00483 for reliable_computing-outgoing; Thu, 6 Feb 2003 10:16:29 -0600 (CST) Received: from smtp2.rz.tu-harburg.de (smtp2.rz.tu-harburg.de [134.28.205.13]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id h16GGMG00479 for ; Thu, 6 Feb 2003 10:16:23 -0600 (CST) Received: from flunder01.rz.tu-harburg.de (flunder01.rz.tu-harburg.de [134.28.202.138]) by smtp2.rz.tu-harburg.de (8.12.3/8.12.3) with ESMTP id h16GGKRV024889 for ; Thu, 6 Feb 2003 17:16:21 +0100 Received: from omega.ti3.tu-harburg.de (omega.ti3.tu-harburg.de [134.28.20.55]) by flunder01.rz.tu-harburg.de (8.12.6/8.12.6) with ESMTP id h16GGCHj005704 for ; Thu, 6 Feb 2003 17:16:13 +0100 Received: from proton (unknown [134.28.20.111]) by omega.ti3.tu-harburg.de (Postfix on SuSE eMail Server 2.0) with SMTP id ADF8510223 for ; Thu, 6 Feb 2003 17:20:10 +0100 (CET) Message-ID: <054401c2cdfb$191e80b0$6f141c86@proton> From: "Siegfried M. Rump" To: References: <200302040300.h1430Ev01492 [at] cs [dot] utep.edu> Subject: Singularity of interval matrices Date: Thu, 6 Feb 2003 17:16:26 +0100 MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 6.00.2800.1106 X-MIMEOLE: Produced By Microsoft MimeOLE V6.00.2800.1106 X-Virus-Scanned: by AMaViS - amavis-milter (http://www.amavis.org/) Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear Colleagues, it may be of interest that in my recent paper Optimal Scaling for p-norms and componentwise distance to singularity, IMA Journal of Numerical Analysis (2003), 23, 1-9, a criterion is given for regularity of an interval matrix which is provably always better or of the same quality as strong regularity. It is based on a convex optimization problem of the p-norm of a certain matrix. Therefore, optimization is numerically not difficult, but the computational effort is higher than testing for strong regularity and therefore the criterion possibly more of theoretical interest. Nevertheless, especially in view of the well-known NP-hardness result, it seems interesting that there *are* other (and better) sufficient conditions superior to strong regularity. Best regards from sunny Hamburg Siegfried M. Rump ================================================= Prof. Dr. Siegfried M. Rump Inst. f. Computer Science III Technical University Hamburg-Harburg Schwarzenbergstr. 95 21071 Hamburg Germany Phone +49 40 42878 3027 Fax +49 40 42878 2489 From owner-reliable_computing [at] interval [dot] louisiana.edu Sat Feb 8 13:45:25 2003 Received: (from daemon@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h18JjOR01926 for reliable_computing-outgoing; Sat, 8 Feb 2003 13:45: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.3) with ESMTP id h18JjIm01922 for ; Sat, 8 Feb 2003 13:45:18 -0600 (CST) Received: from aragorn (aragorn [129.108.5.35]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id h18Jivm16652 for ; Sat, 8 Feb 2003 12:44:57 -0700 (MST) Message-Id: <200302081944.h18Jivm16652 [at] cs [dot] utep.edu> Date: Sat, 8 Feb 2003 12:44:56 -0700 (MST) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: ISSAC 2003, SATELLITE WORKSHOPS To: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: ZafmUwD6bj+Ynznwcwx2LA== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk ------------- Begin Forwarded Message ------------- From: issac2003 [at] drexel [dot] edu Date: Sat, 8 Feb 2003 14:35:15 -0500 (EST) ============================================================================ Call for ISSAC-2003 Satellite Workshop Proposals COSTS REDUCED to $600! August 7, 2003 Drexel University Philadelphia, Pennsylvania, USA http://knave3.mcs.drexel.edu/~issac2003/index.html On August 7, right after the conference ISSAC-2003 (August 3 -- 6), several satellite workshops will be organized. We solicit proposals for the satellite workshops. The local organization of ISSAC 2003 kindly agreed to provide the following for each satellite workshop: * a room * an overhead projector * a data projector * audio equipments (podium, wireless clip-on microphone, speakers) * a technician's presence throughout the meeting * a coffee break * registration processing for some nominal fee (about $600 for 50 persons meeting). The details should be negotiated with the local organization. If you are interested in utilizing the facility, submit a workshop proposal following the guideline given below. About three proposals will be selected from the submissions by the general chair of ISSAC 2003 with the consultation with the steering committee. Finance ------- * The infrastructural cost (about $600 for 50 persons meeting) should be raised by the organizer. * The workshop should be free for all ISSAC'03 participants. * The workshop is part of ISSAC'2003. Participants should register with the ISSAC'2003 conference. Although we encourage everyone to attend the complete ISSAC + workshop, a reduced fee (US$65) may be available for those attending the workshop only. (This reduced fee could be used for paying toward $600 mentioned above). Important dates --------------- Deadline for submission of proposals : Feb 15, 2003 Notification of acceptance : Feb 20, 2003 Workshop : Aug 7, 2003 Submission Guideline -------------------- Submit it by email to hong [at] math [dot] ncsu.edu Hoon Hong General Chair of ISSAC 2003 Proposal Format --------------- Title of the workshop : Proposer: First Name : Middle Initial : Last Name : Email address : Affiliation : Telephone number : Expected # of attendee: Topics to be covered : Rationale for meeting : (about 10 lines) ------------- End Forwarded Message ------------- From owner-reliable_computing [at] interval [dot] louisiana.edu Thu Feb 13 07:03:17 2003 Received: (from daemon@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h1DD3GS07494 for reliable_computing-outgoing; Thu, 13 Feb 2003 07:03:16 -0600 (CST) Received: (from rbk5287@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h1DD3CM07489 for reliable_computing [at] interval [dot] louisiana.edu; Thu, 13 Feb 2003 07:03:12 -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.3) with ESMTP id h18Hium01839 for ; Sat, 8 Feb 2003 11:44:57 -0600 (CST) Received: from ultra10.math.wisc.edu (ultra10.math.wisc.edu [144.92.166.180]) by lcyoung.math.wisc.edu (8.11.6/8.11.6) with ESMTP id h18Hf3e10757; Sat, 8 Feb 2003 11:41:03 -0600 (CST) Date: Sat, 8 Feb 2003 11:41:02 -0600 (CST) From: Hans Schneider To: NETS -- at-net , E-LETTER , Pradeep Misra , Shaun Fallat , "na.digest" , ipnet-digest [at] math [dot] msu.edu, SIAGLA-DIGEST , wim@bell-labs.com, hjt [at] eos [dot] ncsu.edu, SMBnet [at] smb [dot] org, vkm [at] eedsp [dot] gatech.edu, reliable_computing [at] interval [dot] louisiana.edu Subject: LAA contents Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-MailScanner: Found to be clean Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear Net Organizer: Please circulate the attached LAA contents over your net. Thanks hans ********************************************************************* Hans Schneider Office: Home: Mathematics Department 910 S. Midvale Blvd. Van Vleck Hall Madison, WI 53711 USA University of Wisconsin 608-271-7252 480 Lincoln Drive Madison, WI 53706-1313 USA Email: hans [at] math [dot] wisc.edu Office Phone: 608-262-1402 WWW: http://www.math.wisc.edu/~hans Math Dept Phone: 608-263-3054 Math Dept Fax: 608-263-8891 ********************************************************************* * Linear Algebra and its Applications Volume 363, Pages 1-334 (1 April 2003) http://www.sciencedirect.com/science/issue/5653-2003-996369999-385547 Special Issue on Nonnegative matrices, M-matrices and their generalizations, on the occasion of the workshop held at Oberwolfach, November 26 - December 2, 2000. Special Eitors: Daniel Hershkowitz, Judith J. McDonald, Reinhard Nabben TABLE OF CONTENTS Special Issue on Nonnegative matrices, M-matrices and their generalizations, Page 1 Daniel Hershkowitz, Judith J. McDonald, Reinhard Nabben Perron eigenvector of the Tsetlin matrix, Pages 3-16 R. B. Bapat The maximal cp-rank of rank k completely positive matrices, Pages 17-33 F. Barioli and A. Berman Minimal representations of inverted Sylvester and Lyapunov operators, Pages 35-41 Tobias Damm Newton's method for concave operators with resolvent positive derivatives in ordered Banach spaces, Pages 43-64 T. Damm and D. Hinrichsen Conditions for strict inequality in comparisons of spectral radii of splittings of different matrices, Pages 65-80 Ludwig Elsner,AndreasFrommer, Reinhard Nabben, Hans Schneider and Daniel B. Szyld On the spectra of close-to-Schwarz matrices, Pages 81-88 Ludwig Elsner and Daniel Hershkowitz On spectra of expansion graphs and matrix polynomials, Pages 89-101 K. -H. Forster and B. Nagy Intervals of almost totally positive matrices, Pages 103-108 Jurgen Garloff On the roots of certain polynomials arising from the analysis of the Nelder-Mead simplex method, Pages 109-124 Lixing Han, Michael Neumann and Jianhong Xu Generalized M-matrices and ordered Banach algebras, Pages 125-131 Gerd Herzog On the class of Dk-symmetrizable matrices, Pages 133-145 Sawomir Jenek, Tomasz Szulc and Frank Uhlig On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph, Pages 147-159 Charles R. Johnson, Antonio Leal Duarte, Carlos M. Saiago, Brian D. Sutton and Andrew J. Witt CP rank of completely positive matrices of order 5, Pages 161-176 Raphael Loewy and Bit-Shun Tam Convergence theory of some classes of iterative aggregation/disaggregation methods for computing stationary probability vectors of stochastic matrices, Pages 177-200 Ivo Marek and Petr Mayer On the fixed points of the interval function [f]([x])=[A][x]+[b], Pages 201-216 Gunter Mayer and Ingo Warnke The peripheral spectrum of a nonnegative matrix, Pages 217-235 Judith J. McDonald On P-matrices, Pages 237-250 Siegfried M. Rump Perron-Frobenius theory for complex matrices, Pages 251-273 Siegfried M. Rump Exponents of nonnegative matrix pairs, Pages 275-293 Bryan L. Shader and Saib Suwilo Linear equations over cones and Collatz-Wielandt numbers, Pages 295-332 Bit-Shun Tam and Hans Schneider Author index, Pages 333-334 List of editors, Pages ii-iii From owner-reliable_computing [at] interval [dot] louisiana.edu Thu Feb 13 09:23:36 2003 Received: (from daemon@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h1DFNa907741 for reliable_computing-outgoing; Thu, 13 Feb 2003 09:23:36 -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.3) with ESMTP id h1DFNVm07737 for ; Thu, 13 Feb 2003 09:23:31 -0600 (CST) Received: from aragorn (aragorn [129.108.5.35]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id h1DFNSq29227; Thu, 13 Feb 2003 08:23:28 -0700 (MST) Message-Id: <200302131523.h1DFNSq29227 [at] cs [dot] utep.edu> Date: Thu, 13 Feb 2003 08:23:28 -0700 (MST) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: my personal webpage has moved To: reliable_computing [at] interval [dot] louisiana.edu Cc: vladik [at] cs [dot] utep.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: IGMDvTXZ1G/oCvqasgZWuQ== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear Friends, I used to keep (and update) my personal webpage at the old location in addition to the new one. I have just learned that there seems to have been a big change in our deparment's website, so at present, only my new webpage is functioning, its location is http://www.cs.utep.edu/vladik I apologize for the inconvenience; it is especially embarrassing to me because Google points to my old location If you happen to run across a link pointing to my old (non-existing) webpage please let me know. Thanks a lot. Vladik From owner-reliable_computing [at] interval [dot] louisiana.edu Fri Feb 21 07:54:56 2003 Received: (from daemon@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h1LDst616860 for reliable_computing-outgoing; Fri, 21 Feb 2003 07:54:55 -0600 (CST) Received: from mailbox.univie.ac.at (mailbox.univie.ac.at [131.130.1.27]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id h1LDslJ16856 for ; Fri, 21 Feb 2003 07:54:48 -0600 (CST) Received: from univie.ac.at (edoras.mat.univie.ac.at [131.130.16.104]) by mailbox.univie.ac.at (8.12.2/8.12.2) with ESMTP id h1LDsTfx318768; Fri, 21 Feb 2003 14:54:34 +0100 Message-ID: <3E562F96.DC289C7E [at] univie [dot] ac.at> Date: Fri, 21 Feb 2003 14:54:30 +0100 From: Arnold Neumaier Organization: University of Vienna X-Mailer: Mozilla 4.79 [en] (X11; U; Linux 2.4.18-18.7.x i686) X-Accept-Language: en, de MIME-Version: 1.0 To: interval Subject: Kahan on probabilistic error estimates Content-Type: text/plain; charset=iso-8859-15 Content-Transfer-Encoding: 7bit X-DCC-ZID-Univie-Metrics: mx2 4242; Body=2 Fuz1=2 Fuz2=2 Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk I just stumbled (via a posting by Jonathan Thornburg on sci.math.num-analysis) upon a talk by Kahan that I didn't know before. It might be of interest for this list: http://www.cs.berkeley.edu/~wkahan/improber.ps http://www.cs.berkeley.edu/~wkahan/improber.pdf p. 25 mentions intervals; the rest is about the danger of probabilistic error estimates by simulated rounding errors (which often works well but sometimes is very misleading). Arnold Neumaier From owner-reliable_computing [at] interval [dot] louisiana.edu Fri Feb 21 17:23:46 2003 Received: (from daemon@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h1LNNjr00422 for reliable_computing-outgoing; Fri, 21 Feb 2003 17:23:45 -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.3) with ESMTP id h1LNNeW00418 for ; Fri, 21 Feb 2003 17:23:40 -0600 (CST) Received: from aragorn (aragorn [129.108.5.35]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id h1LNNMB12472; Fri, 21 Feb 2003 16:23:22 -0700 (MST) Message-Id: <200302212323.h1LNNMB12472 [at] cs [dot] utep.edu> Date: Fri, 21 Feb 2003 16:23:22 -0700 (MST) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: Re: Kahan on probabilistic error estimates To: reliable_computing [at] interval [dot] louisiana.edu, Arnold.Neumaier [at] univie [dot] ac.at MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: KgL05mS7oP0PnWBGl5jJQQ== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear Arnold, Thanks for sending this link. This paper was mentioned at SCAN'2002 in Paris several times, in particular, in the plenary talk by Professor Vignes, and (if I remember correctly) in a talk by Rene Alt. They both mentioned that they have used Kahan's examples to improve their system, and that their new system is much better in this sense. It may be too early for SCAN'02 proceedings to appear, but maybe posting a draft of some of these papers is a good idea. Vladik > Date: Fri, 21 Feb 2003 14:54:30 +0100 > From: Arnold Neumaier > X-Accept-Language: en, de > MIME-Version: 1.0 > To: interval > Subject: Kahan on probabilistic error estimates > Content-Transfer-Encoding: 7bit > X-DCC-ZID-Univie-Metrics: mx2 4242; Body=2 Fuz1=2 Fuz2=2 > > > I just stumbled (via a posting by Jonathan Thornburg on > sci.math.num-analysis) upon a talk by Kahan that I didn't know > before. It might be of interest for this list: > > http://www.cs.berkeley.edu/~wkahan/improber.ps > http://www.cs.berkeley.edu/~wkahan/improber.pdf > > p. 25 mentions intervals; the rest is about the danger of > probabilistic error estimates by simulated rounding errors > (which often works well but sometimes is very misleading). > > Arnold Neumaier From owner-reliable_computing [at] interval [dot] louisiana.edu Sat Feb 22 17:48:17 2003 Received: (from daemon@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h1MNmH301629 for reliable_computing-outgoing; Sat, 22 Feb 2003 17:48:17 -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.3) with ESMTP id h1MNmBW01625 for ; Sat, 22 Feb 2003 17:48:12 -0600 (CST) Received: from heliopolis.eng.sun.com ([152.70.28.21]) by patan.sun.com (8.9.3+Sun/8.9.3) with ESMTP id QAA00775; Sat, 22 Feb 2003 16:47:54 -0700 (MST) Received: from sun.com (vpn-129-150-16-148.SFBay.Sun.COM [129.150.16.148]) by heliopolis.eng.sun.com (8.9.3+Sun/8.9.3/ENSMAIL,v2.1p1) with ESMTP id PAA17402; Sat, 22 Feb 2003 15:47:49 -0800 (PST) Message-ID: <3E580A73.3702DFE9 [at] sun [dot] com> Date: Sat, 22 Feb 2003 15:40:35 -0800 From: Bill Walster X-Mailer: Mozilla 4.79 [en] (Win98; U) X-Accept-Language: en,ru MIME-Version: 1.0 To: Grigorii Litvinov CC: reliable_computing [at] interval [dot] louisiana.edu Subject: Re: [Fwd: [Fwd: Interval Applicability Survey]] References: <3E404F76.B5EF8F5E [at] sun [dot] com> <003601c2da9e$9c506e80$d70985c3@default> Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Thanks Grigorii. I will send questions that might not be of general interest to you "off line". I appreciate you taking the time to respond. I'm sure your information will be most helpful. Best regards, Bill Grigorii Litvinov wrote: > Dear Bill, > > To examine some problems in smooth numerical analysis > which are not good for standard interval methods see my > paper in Central European Journal of Mathematics, 2003, #1 > (this is an electronic journal); see also http://arXiv.org > math.NA/0207183 > > To examine some (nonsmooth) optimization problems which are > very good for special interval methods see our paper in Reliable > Computing, 7,#5 (2001), 353 - 377; see also http://arXiv.org > math.NA/0101080 > In this paper idempotent interval linear algebra is developed > and exact interval estimations are given. This method is very > good for parallelization and implementations for many processor > supercomputers. Sorry for a delay (I was out of my Moscow > e-system). > > With all the best wishes, > Grigori Litvinov > ----- Original Message ----- > From: Bill Walster > To: > Sent: Wednesday, February 05, 2003 2:40 AM > Subject: [Fwd: [Fwd: Interval Applicability Survey]] > > > > > > > Dear fellow intervalers. > > > > I need some help. I have been asked to estimate the current and future > > applicability of computing with intervals in the following market > > segments: > > > > Electronic Design > > Nuclear Applications > > Mechanical Design > > Radar Cross-Section > > Crash Simulation > > Fluid Dynamics > > Weather, Climate Modeling > > Signal/Image Processing > > Cryptography > > Life Sciences > > Financial Modeling > > Petroleum > > > > I have learned that it is not helpful to say that intervals apply to > > everything. People want to understand where intervals do *not* apply > > and why. For example, is it that some problems are inherently > > discrete? Or is it that existing solvers and processors lack required > > capabilities? > > > > For the sake of calibrating estimates, let's say that we consider what > > is > > possible today with existing hardware and software, compared to what > > will be possible in 2007 on a hypothetical system consisting of 100,000 > > processors, each of which can deliver 4 billion interval operations per > > second (4 GIOPS). > > > > Assume that commercial quality (ILOG, Nag or IMSL) interval solver > > libraries exist for performing basic interval functions, such as: > > > > linear programming; > > solving nonlinear systems of equations; > > global nonlinear optimization; and > > modeling bounded physical systems, etc. > > > > Specific questions: > > > > 1. What fraction of the existing real applications in the above > > market segments that you are familiar with *can* be done with existing > > interval hardware and software tools? Note: I am not interested in the > > size of the existing interval markets. I am rather interested in how > > applicable our existing tools are *if* they are used. > > > > 2. Same question, but in 2007 with the assumed HW and SW described, > > above. > > > > 3. What problems that you are familiar with cannot now be solved > > using current interval software and hardware? Why? > > > > 4. What problems that you are familiar with do you believe will > > still be outside the "interval domain" in 2007 under the HW and SW > > described, above? > > > > 5. In your particular substantive area of expertise, and matching as > > closely as possible one of the above market segments, please send > > pointers or references to the best current interval applications that > > demonstrate computing with intervals will be important. > > > > Please feel free to comment regarding anything you think will help to > > characterize the current and future applicability of computing with > > intervals. > > > > Thanks in advance for your help making these estimates. > > > > Best regards, > > > > Bill > > From owner-reliable_computing [at] interval [dot] louisiana.edu Mon Feb 24 07:25:43 2003 Received: (from daemon@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h1ODPg803910 for reliable_computing-outgoing; Mon, 24 Feb 2003 07:25:42 -0600 (CST) Received: (from rbk5287@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h1ODPdX03905 for reliable_computing [at] interval [dot] louisiana.edu; Mon, 24 Feb 2003 07:25:39 -0600 (CST) Received: from ritchie.cas.mcmaster.ca (ritchie.cas.McMaster.CA [130.113.68.10]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id h1L3fYJ16230 for ; Thu, 20 Feb 2003 21:41:35 -0600 (CST) Received: from kula.cas.mcmaster.ca (kula.cas.McMaster.CA [130.113.68.86]) by ritchie.cas.mcmaster.ca (8.11.6+Sun/8.11.6) with ESMTP id h1L3fCQ21981 for ; Thu, 20 Feb 2003 22:41:12 -0500 (EST) Received: from localhost (ned@localhost) by kula.cas.mcmaster.ca (8.11.6+Sun/8.11.6) with ESMTP id h1L3eSv13991 for ; Thu, 20 Feb 2003 22:40:28 -0500 (EST) Date: Thu, 20 Feb 2003 22:40:28 -0500 (EST) From: Ned Nedialkov To: reliable_computing [at] interval [dot] louisiana.edu Subject: Southern Ontario Numerical Analysis Day Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk The 21st Southern Ontario Numerical Analysis Day (SONAD) will take place at McMaster University, Hamilton, Canada, on May 2, 2003. The program includes plenary lectures by o Michael Overton, Courant Institute of Mathematical Sciences, and o Tony Chan, UCLA, 20-minute contributed talks, and a poster session. If you would like to present your work, please send an abstract, preferably in LaTex format, to Ned Nedialkov at nedialk [at] mcmaster [dot] ca by April 4th. The final program will be announced in the beginning of April. There is no registration fee for this event. However, to facilitate catering and to help us prepare a list of participants, we encourage participants to register in advance at the Web site of SONAD at www.cas.mcmaster.ca/~oplab/SONAD Organizing Committee: Ned Nedialkov (nedialk [at] mcmaster [dot] ca) Tamas Terlaky (terlaky [at] mcmaster [dot] ca) Jiming Peng (pengj [at] mcmaster [dot] ca) From owner-reliable_computing [at] interval [dot] louisiana.edu Mon Feb 24 07:25:55 2003 Received: (from daemon@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h1ODPsh03930 for reliable_computing-outgoing; Mon, 24 Feb 2003 07:25:54 -0600 (CST) Received: (from rbk5287@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h1ODPpQ03925 for reliable_computing [at] interval [dot] louisiana.edu; Mon, 24 Feb 2003 07:25:51 -0600 (CST) Received: from demos.su (mx.demos.su [194.87.0.32]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id h1MHEgW01460 for ; Sat, 22 Feb 2003 11:14:43 -0600 (CST) Received: from [194.87.0.7] (HELO dune3.demos.su) by demos.su (CommuniGate Pro SMTP 4.0.6/D) with ESMTP-TLS id 62289611; Sat, 22 Feb 2003 20:14:39 +0300 Received: from default (215.9.133.195.dynamic.dialup.ru [195.133.9.215]) by dune3.demos.su (8.12.6/8.12.5) with SMTP id h1MHDATx026180; Sat, 22 Feb 2003 20:13:16 +0300 (MSK) (envelope-from islc [at] dol [dot] ru) Message-ID: <003601c2da9e$9c506e80$d70985c3@default> From: "Grigorii Litvinov" To: "Bill Walster" , References: <3E404F76.B5EF8F5E [at] sun [dot] com> Subject: Re: [Fwd: [Fwd: Interval Applicability Survey]] Date: Sat, 22 Feb 2003 21:02:01 +0300 Organization: home MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 5.00.2417.2000 X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2314.1300 Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear Bill, To examine some problems in smooth numerical analysis which are not good for standard interval methods see my paper in Central European Journal of Mathematics, 2003, #1 (this is an electronic journal); see also http://arXiv.org math.NA/0207183 To examine some (nonsmooth) optimization problems which are very good for special interval methods see our paper in Reliable Computing, 7,#5 (2001), 353 - 377; see also http://arXiv.org math.NA/0101080 In this paper idempotent interval linear algebra is developed and exact interval estimations are given. This method is very good for parallelization and implementations for many processor supercomputers. Sorry for a delay (I was out of my Moscow e-system). With all the best wishes, Grigori Litvinov ----- Original Message ----- From: Bill Walster To: Sent: Wednesday, February 05, 2003 2:40 AM Subject: [Fwd: [Fwd: Interval Applicability Survey]] > > > Dear fellow intervalers. > > I need some help. I have been asked to estimate the current and future > applicability of computing with intervals in the following market > segments: > > Electronic Design > Nuclear Applications > Mechanical Design > Radar Cross-Section > Crash Simulation > Fluid Dynamics > Weather, Climate Modeling > Signal/Image Processing > Cryptography > Life Sciences > Financial Modeling > Petroleum > > I have learned that it is not helpful to say that intervals apply to > everything. People want to understand where intervals do *not* apply > and why. For example, is it that some problems are inherently > discrete? Or is it that existing solvers and processors lack required > capabilities? > > For the sake of calibrating estimates, let's say that we consider what > is > possible today with existing hardware and software, compared to what > will be possible in 2007 on a hypothetical system consisting of 100,000 > processors, each of which can deliver 4 billion interval operations per > second (4 GIOPS). > > Assume that commercial quality (ILOG, Nag or IMSL) interval solver > libraries exist for performing basic interval functions, such as: > > linear programming; > solving nonlinear systems of equations; > global nonlinear optimization; and > modeling bounded physical systems, etc. > > Specific questions: > > 1. What fraction of the existing real applications in the above > market segments that you are familiar with *can* be done with existing > interval hardware and software tools? Note: I am not interested in the > size of the existing interval markets. I am rather interested in how > applicable our existing tools are *if* they are used. > > 2. Same question, but in 2007 with the assumed HW and SW described, > above. > > 3. What problems that you are familiar with cannot now be solved > using current interval software and hardware? Why? > > 4. What problems that you are familiar with do you believe will > still be outside the "interval domain" in 2007 under the HW and SW > described, above? > > 5. In your particular substantive area of expertise, and matching as > closely as possible one of the above market segments, please send > pointers or references to the best current interval applications that > demonstrate computing with intervals will be important. > > Please feel free to comment regarding anything you think will help to > characterize the current and future applicability of computing with > intervals. > > Thanks in advance for your help making these estimates. > > Best regards, > > Bill > From owner-reliable_computing [at] interval [dot] louisiana.edu Mon Feb 24 13:06:14 2003 Received: (from daemon@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h1OJ6DM04405 for reliable_computing-outgoing; Mon, 24 Feb 2003 13:06:13 -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.3) with ESMTP id h1OJ68W04401 for ; Mon, 24 Feb 2003 13:06:08 -0600 (CST) Received: from aragorn (aragorn [129.108.5.35]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id h1OJ62E29815; Mon, 24 Feb 2003 12:06:02 -0700 (MST) Message-Id: <200302241906.h1OJ62E29815 [at] cs [dot] utep.edu> Date: Mon, 24 Feb 2003 12:06:02 -0700 (MST) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: reminder To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu Cc: wlodwick [at] math [dot] cudenver.edu, vladik [at] cs [dot] utep.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: WxdSxbrsYnqQuaCqEFbh2g== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear Friends, As we have mentioned earlier, Weldon Lodwick and myself are organizing a special sesison on the joint use of probabilistic, interval, and fuzzy uncertainty at the 22nd Annual Conference of the North American Fuzzy Information Processing Society NAFIPS'2003 - the main US-based fuzzy conference. The deadline is approaching fast: it is February 28. By this dats, please send an abstract via the webpage. Full papers for the IEEE published proceedings (if abstract is accepted) are due later. Since the abstract submission form does not include the information about the special session, please send this abstract by email to me and to Weldon so that we will inform the organizers which papers are intended for our session, and the accepted papers will get together. As an attachment, we send pieces of the original call for papers. Vladik ************************************************************************* FUZZ in CHICAGO July 24-26, 2003 The program will feature plenary sessions by invited speakers, focused special topic sessions, and general papers. Relevant topics may include but are not limited to: Fuzzy systems / sets/ mathematics / control / databases / theory Soft computing / neural and fuzzy neural networks / genetic algorithms Learning systems / data mining / robotics /image processing / pattern recognition Applications of soft computing / case studies of successful applications of fuzzy systems Plenary sessions: Plenary talk by Lotfi Zadeh, Ph.D., Professor of EECS, University of California at Berkeley Plenary talk "Fuzzy Logic and the Brain Code" by Dr. Thomas H. Jobe, Professor of Psychiatry, University of Illinois, College of Medicine, Chicago Plenary talk "Models of Causation" by Jordi Cat, Ph.D., Assistant Professor of History and Philosophy of Science, Indiana University Conference Site: The conference will be held at the Double Tree Guest Suites Hotel in Downtown Chicago. The hotel is across the street from the Hancock Building, two blocks East of Michigan Avenue, two blocks West of Lake Michigan, and two blocks from the Oak Street Beach. Downtown Chicago has numerous sites to visit including the Sears Tower, Navy pear, Grant Park, the Chicago Art Institute, Field Museum of Natural History (with Sue, the world's largest and most complete tyrannosaurus rex skeleton), Museum of Science and Industry, and Wrigley Field. Find more ideas for your visit to Chicago at the Chicago Convention and Tourism Bureau site (http://www.choosechicago.com). General Papers: Papers will be reviewed by the Program Committee on the basis of an abstract that briefly describes 1) the problems or issues addressed by the paper, 2) the approach employed, and 3) a summary of the results. Abstracts of no more than 750 words (and no more than 2 pages) must be received by February 28, 2003. Include the title, author's name(s), affiliation(s) and keywords on the top of the first page. Please indicate the corresponding author with an email address. Electronic submissions are strongly preferred. detailed submission instructions will be made available on the conference website (http://cs.hiram.edu/nafips2003). If electronic submission is impossible, please send 3 copies of your abstract to prof. Ellen Walker, Computer Science Dept., Hiram College, P.O. Box 67, Hiram OH 44234, USA. Important Dates: Special Topic Session proposals due: January 6, 2003 General Papers Abstracts due: February 28, 2003 Author notification: April 29, 2003 Camera-ready copy and registration due: May 29, 2003 Organizers: Cathy Helgason, General Chair Ellen Walker, Program Chair helgason [at] uic [dot] edu walkerel [at] hiram [dot] edu International Program Committee: H. R. Berenji (USA), M. Berthold (USA), Z. Z. Bien (South Korea), P. Bonissone (USA), G. Bordogna (Italy), B. Bouchon-Meunier (France), V. Cross (USA), R. N. Dave (USA), J. Dickerson (USA), D. Dubois (France), M. A. Egan (USA), A. Esobgue (USA), D. Filev (USA), T. Fukuda (Japan), P. Gader (USA), K. Goebel (USA), F. Gomide (Brazil), W. Gruver (Canada), M. M. Gupta (Canada), L. Hall (USA), K. Hirota (Japan), C. F. Huang (China), A. Kandel (USA), J. Keller (USA), E. Kerre (Belgium), G. J. Klir (USA), L. T. Koczy (Hungary), D. Kraft (USA), R. Kruse (Germany), L. I. Kuncheva (United Kingdom), J. Lee (Taiwan), Z. Q. Liu (Australia), E. H. Mamdani (UK), M. Mizumoto (Japan), N. R. Pal (India), G. Pasi (Italy), W. Pedrycz (Canada), F. E. Petry (USA), H. Prade (France), D. A. Ralescu (USA), E. H. Ruspini (USA), M. Smith (USA), T. Sudkamp (USA), I. B. Turksen (Canada), P. Wang (USA), T. Whalen (USA), R. R. Yager (USA), T. Yamakawa (Japan), H. Zimmermann (Germany) ) From owner-reliable_computing [at] interval [dot] louisiana.edu Wed Feb 26 17:07:58 2003 Received: (from daemon@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h1QN7wF06763 for reliable_computing-outgoing; Wed, 26 Feb 2003 17:07:58 -0600 (CST) Received: from kathmandu.sun.com (kathmandu.sun.com [192.18.98.36]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id h1QN7pW06759 for ; Wed, 26 Feb 2003 17:07:51 -0600 (CST) Received: from heliopolis.eng.sun.com ([152.70.28.21]) by kathmandu.sun.com (8.9.3+Sun/8.9.3) with ESMTP id QAA17943; Wed, 26 Feb 2003 16:07:23 -0700 (MST) Received: from sun.com (sml-mtv29-dhcp-33-163 [152.70.33.163]) by heliopolis.eng.sun.com (8.9.3+Sun/8.9.3/ENSMAIL,v2.1p1) with ESMTP id PAA04581; Wed, 26 Feb 2003 15:07:22 -0800 (PST) Message-ID: <3E5D46F0.C4BC98E1 [at] sun [dot] com> Date: Wed, 26 Feb 2003 15:00:00 -0800 From: Bill Walster X-Mailer: Mozilla 4.79 [en] (Win98; U) X-Accept-Language: en,ru MIME-Version: 1.0 To: "reliable_computing [at] interval [dot] louisiana.edu" , "interval [at] cs [dot] utep.edu" Subject: 'set' inequalities Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Question: Does anybody know of an application for the 'set' relational operations, besides set equality and set inequality. For example, [a,b] is set less than [c,d] if a < c and b < d. Thanks in advance, Bill From owner-reliable_computing [at] interval [dot] louisiana.edu Wed Feb 26 17:43:18 2003 Received: (from daemon@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h1QNhI206898 for reliable_computing-outgoing; Wed, 26 Feb 2003 17:43:18 -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.3) with ESMTP id h1QNhDW06894 for ; Wed, 26 Feb 2003 17:43:13 -0600 (CST) Received: from aragorn (aragorn [129.108.5.35]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id h1QNh6r01440; Wed, 26 Feb 2003 16:43:06 -0700 (MST) Message-Id: <200302262343.h1QNh6r01440 [at] cs [dot] utep.edu> Date: Wed, 26 Feb 2003 16:43:04 -0700 (MST) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: Re: 'set' inequalities To: bill.walster [at] sun [dot] com Cc: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: GqYPQgoTBCsETQ8G6ecDQA== 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 > I am curious about their > utility value, if any. Apparently there is at least some, because > you remember seeing an application. I will start looking as soon as I finish preparing for a class :-( > The 'set' version of strict inequality was in my email. A long > time ago, I heard these relations referred to as 'set' relations, > which seemed to make some sense. Do you remember where you heard that? was it in some paper? 1) One possible motivation that I remember (Ithink it comes from Luce and Raifa Games and Deicions but maybe from some later book) is as follows: suppose we have decision making, we compare two alternatives A and B. For each alternatives, we have an interval of possible values of income. If these intervals intersect, how can we compare them? * we can use an optimistic approach, by taking the largest possible value of the interval as a numerical evaluation of the corresponding alternative; this means comparing the largest possible values; * we can use a pessimistic approach, by comparing the pessimistic (smallest) possible values; * we can also select a value alpha, and take, as a value of each alternative, a combination alpha *max +(1-alpha)* min (Hurwicz optimism-pessimism criterion). If for all such cases, A is better than B, then it makes sense to prefer A. This "for all alpha" is equivalent to simply comparing lower and upper bounds, i.e., to what you call set relation. 2) Another use is in the analysis of reasoning about time intervals, so-called Allen's interval algebra. Allen (he has a book and many papers and mentioned in AI textbooks) has this relation as one of the possible ones, and it is often a good description of what experts assume about the two events described by the corresponding intervals. Vladik From owner-reliable_computing [at] interval [dot] louisiana.edu Thu Feb 27 02:05:54 2003 Received: (from daemon@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h1R85sD07359 for reliable_computing-outgoing; Thu, 27 Feb 2003 02:05:54 -0600 (CST) Received: from zeus.polsl.gliwice.pl (pownuk [at] zeus [dot] polsl.gliwice.pl [157.158.1.3]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id h1R85lW07355 for ; Thu, 27 Feb 2003 02:05:47 -0600 (CST) Received: from localhost (pownuk@localhost) by zeus.polsl.gliwice.pl (8.9.3 (PHNE_25183)/8.9.3) with ESMTP id JAA20238 for ; Thu, 27 Feb 2003 09:05:33 +0100 (MET) Date: Thu, 27 Feb 2003 09:05:33 +0100 (MET) From: Andrzej Pownuk To: reliable_computing [at] interval [dot] louisiana.edu Subject: RE: 'set' inequalities Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear Bill, As far as I know you can apply set inequality and set equality in each mathematical model with interval or fuzzy parameters. (i.e. uncertain parameters). Some examples are in the following papers: http://zeus.polsl.gliwice.pl/~pownuk/IntervalEquations.htm http://zeus.polsl.gliwice.pl/~pownuk/fuzzyPDE.htm We can replace crisp parameters with the set valued parameters. In other words we can apply set equality and set inequality almost everywhere. Regards, Andrzej Pownuk http://zeus.polsl.gliwice.pl/~pownuk/ > > > Question: Does anybody know of an application for > the 'set' relational operations, besides set equality and > set inequality. For example, [a,b] is set less than [c,d] > if a < c and b < d. > > Thanks in advance, > > Bill > From owner-reliable_computing [at] interval [dot] louisiana.edu Thu Feb 27 07:06:11 2003 Received: (from daemon@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h1RD6BJ07923 for reliable_computing-outgoing; Thu, 27 Feb 2003 07:06:11 -0600 (CST) Received: from zmit1.ippt.gov.pl (zmit1.ippt.gov.pl [148.81.53.8]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id h1RD64W07919 for ; Thu, 27 Feb 2003 07:06:05 -0600 (CST) Received: (from zkulpa@localhost) by zmit1.ippt.gov.pl (8.8.5/8.7.3-zmit) id OAA01792; Thu, 27 Feb 2003 14:05:45 +0100 (MET) Date: Thu, 27 Feb 2003 14:05:45 +0100 (MET) From: Zenon Kulpa Message-Id: <200302271305.OAA01792 [at] zmit1 [dot] ippt.gov.pl> To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu Subject: Re: 'set' inequalities Cc: zkulpa [at] zmit1 [dot] ippt.gov.pl Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk > From owner-reliable_computing [at] interval [dot] louisiana.edu Thu Feb 27 00:48:41 20> From: Bill Walster > > Question: Does anybody know of an application for > the 'set' relational operations, besides set equality and > set inequality. For example, [a,b] is set less than [c,d] > if a < c and b < d. > There is a whole branch in AI and some other fields concerning reasoning with time intervals that uses various relations between intervals. Started by work of Allen: J.F. Allen (1983) Maintaining knowledge about temporal relations. \emph{Comm. ACM}, 26(11): 832--843. it was later pursued by many authors. I have also published some papers on diagrammatic representations of these relations and diagrammatic reasoning with them: Z. Kulpa (1997) Diagrammatic representation of interval space in proving theorems about interval relations. \emph{Reliable Computing}, 3: 209--217. Z. Kulpa (1997) Diagrammatic representation for a space of intervals. \emph{Machine Graphics \& Vision}, 6(1): 5--24. Z. Kulpa, T.L. Le (2000) Characterization of convex and pointisable interval relations by diagrammatic methods. \emph{Machine Graphics \& Vision}, 9: 221--231. -- Zenon Kulpa From owner-reliable_computing [at] interval [dot] louisiana.edu Thu Feb 27 13:34:02 2003 Received: (from daemon@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h1RJY1w08426 for reliable_computing-outgoing; Thu, 27 Feb 2003 13:34:01 -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.3) with ESMTP id h1RJXuW08422 for ; Thu, 27 Feb 2003 13:33:57 -0600 (CST) Received: from aragorn (aragorn [129.108.5.35]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id h1RJXZ709083 for ; Thu, 27 Feb 2003 12:33:35 -0700 (MST) Message-Id: <200302271933.h1RJXZ709083 [at] cs [dot] utep.edu> Date: Thu, 27 Feb 2003 12:33:35 -0700 (MST) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: ISSAC 2003, CALL FOR POSTERS To: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: hJkcyVHZTwF6RZ168KduDg== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk ------------- Begin Forwarded Message ------------- From: issac2003 [at] drexel [dot] edu Date: Thu, 27 Feb 2003 12:53:20 -0500 (EST) X-Authentication-Warning: queen.mcs.drexel.edu: issac2003 set sender to issac2003 [at] drexel [dot] edu using -r To: vladik [at] cs [dot] utep.edu Subject: ISSAC 2003, CALL FOR POSTERS CALL FOR POSTERS ====================================================================== ISSAC 2003 International Symposium on Symbolic and Algebraic Computation Drexel University, Philadelphia, PA, USA, August 3-6, 2003 http://www.drexel.edu/issac2003/ ====================================================================== ISSAC is the yearly premier international symposium in Symbolic and Algebraic Computation. It provides an opportunity to learn of new developments and to present original research results in all areas of symbolic mathematical computation. Planned activities include invited presentations, research and survey papers, poster sessions, tutorial courses, vendor exhibits and software demonstrations. ISSAC'2003 will be held at Drexel University in Philadelphia, Pennsylvania, USA, from August 3 to 6, 2003. Important Dates --------------- - Deadline for Submissions of Abstracts: April 21, 2003 - Notification of Acceptance/Rejection: May 21, 2003 - Camera-ready copy due: June 16, 2003 Poster Program Committee ------------------------ Olga Caprotti (Chair) RISC-Linz (Research Institute for Symbolic Computation) Johannes Kepler University, Linz, Austria Willem De Graaf Mathematical Institute University of Utrecht, Utrecht, The Netherlands Lihong Zhi Mathematics Mechanization Research Center Institute of Systems Science Academy of Mathematics and System Sciences Academia Sinica, Beijing, P.R. China Poster Sessions --------------- The abstracts of all accepted posters will appear in the SIGSAM Bulletin. Moreover, the abstracts will be distributed at the conference. The Poster Sessions are an ideal venue for presenting recent research results or ongoing research projects that might not yet be complete, but whose preliminary results are already interesting nonetheless. Posters describing computer algebra systems and applications are also especially welcome. To encourage poster submissions of good quality, a best poster prize, consisting of a certificate, will be awarded. Posters will be judged based on content and presentation. Conference Topics ----------------- Topics of the meeting include, but are not limited to : - Algorithmic mathematics. Algebraic, symbolic and symbolic-numeric algorithms. Simplification, function manipulation, equations, summation, integration, ODE/PDE, linear algebra, number theory, group and geometric computing. - Computer Science. Theoretical and practical problems in symbolic computation. Systems, problem solving environments, user interfaces, software, libraries, parallel/distributed computing and programming languages for symbolic computation, concrete analysis, benchmarking, theoretical and practical complexity of computer algebra algorithms, automatic differentiation, code generation, mathematical data structures and exchange protocols. - Applications. Problem treatments using algebraic, symbolic or symbolic-numeric computation in an essential or a novel way. Engineering, economics and finance, physical and biological sciences, computer science, logic, mathematics, statistics, education. Submission Guidelines --------------------- Authors are invited to submit electronically an abstract of no more than 900 words to the poster committee chair describing the contents of the poster. Plain TeX or LaTeX is preferred, but plain text is also acceptable. - Previous ISSAC Poster Sessions 2001 2002: http://www.lifl.fr/ISSAC2002 2001: http://www.mast.queensu.ca/~bigatti/ISSACposters/ - How to prepare a poster http://www.siam.org/siamnews/general/poster.htm (Technical details are a bit obsolete.) ------------- End Forwarded Message ------------- From owner-reliable_computing [at] interval [dot] louisiana.edu Thu Feb 27 16:25:27 2003 Received: (from daemon@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h1RMPQw08568 for reliable_computing-outgoing; Thu, 27 Feb 2003 16:25:26 -0600 (CST) Received: from nwkea-mail-2.sun.com (nwkea-mail-2.sun.com [192.18.42.14]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id h1RMPIW08564 for ; Thu, 27 Feb 2003 16:25:18 -0600 (CST) Received: from heliopolis.eng.sun.com ([152.70.1.39]) by nwkea-mail-2.sun.com (8.9.3+Sun/8.9.3) with ESMTP id OAA25393; Thu, 27 Feb 2003 14:24:59 -0800 (PST) Received: from sun.com (sml-mtv29-dhcp-33-163 [152.70.33.163]) by heliopolis.eng.sun.com (8.9.3+Sun/8.9.3/ENSMAIL,v2.1p1) with ESMTP id OAA28295; Thu, 27 Feb 2003 14:25:00 -0800 (PST) Message-ID: <3E5E8E7F.75F79EE1 [at] sun [dot] com> Date: Thu, 27 Feb 2003 14:17:35 -0800 From: Bill Walster X-Mailer: Mozilla 4.79 [en] (Win98; U) X-Accept-Language: en,ru MIME-Version: 1.0 To: "reliable_computing [at] interval [dot] louisiana.edu" , "interval [at] cs [dot] utep.edu" Subject: Next Interval SIG Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Fellow Intervalers, If you have ideas for presentations or discussion topics at the next interval SIG, please send them to me. If you would like to make a presentation to the HPC Consortium about something of more general interest than just interval folks, please send a title and short abstract. Thanks in advance. Best regards to all, Bill ======================================================= SAVE THE DATE... Our Scientific & Engineering Team (www.sun.com/edu/hpc) and the Sun HPC Consortium Steering Committee (www.hpcconsortium.org) are pleased to announce the High Performance Computing Consortium Meeting 2003 meeting in Heidelberg, Germany. WHEN: June 21 - Special Interest Group Meetings June 22, 23 - Main Program (Prior to the ISC2003 conference in Heidelberg, http://www.isc2003.org/) WHERE: Crowne Plaza Heidelberg Kurfurstenanlage 1 Heidelberg, 69115 Germany HOW MUCH: $199 US Conference fee REGISTRATION: Registration will be on-line in the spring. HOUSING: We have a block of rooms at the Crowne Plaza which will be reservable through the registration site. We had an absolutely outstanding meetings last year in Glasgow, Scotland, and in Baltimore, MD, USA. We are now planning the agenda for Heidelberg. We will be holding sessions of the Special Interest Groups (SIGs) on Saturday, June 21, and then have two days of talks on Sunday and Monday. If you have suggestions or comments please email us at hpcconsortium-info [at] sun [dot] com More agenda details will follow soon. NEW: Sign up for the HPC Consortium e-mail list! Aachen University has taken the lead to help build the community. Only members of the list can post to the list. To sign up go to: http://MailMan.RWTH-Aachen.DE/mailman/listinfo/sunhpc/ Also visit our HPC Consortium Web sites: http://www.sun.com/edu/hpc/consortium.html http://www.hpcconsortium.org Send inquires to: hpcconsortium-info [at] sun [dot] com ABOUT THE CONSORTIUM The Sun Global Education and Research High Performance Computing Consortium (SHPCC) is an independent, volunteer-organized, international group of member organizations that own or use Sun computer systems with emphasis on high-performance, technical computing, and visualization. SHPCC's mission is to provide the high performance computing community with leadership and provide a forum for information exchange to enable the development and effective use of Sun computational tools in achieving the business and research objectives of member organizations. Participants represent a broad range of computing applications and environments. The meeting format is designed to give participants the opportunity to present HPC developments, discuss applications and needs with their peers, and to hear and provide feedback on Sun's engineering plans. Meetings are held biannually. The last European meeting (July 2002) was held in Glasgow, Scotland and included over 100 customers and business partners and Sun computing specialists from the US, Europe, Asia and Australia. Check out the agenda and presentations at: http://www.sun.com/edu/hpc/consortium.html Thank you for your interest in working with Sun to better serve the scientific and computing communities. Please email inquiries to hpcconsortium-info [at] sun [dot] com. ===================================================== From owner-reliable_computing [at] interval [dot] louisiana.edu Thu Feb 27 17:05:14 2003 Received: (from daemon@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) id h1RN5Do08691 for reliable_computing-outgoing; Thu, 27 Feb 2003 17:05:13 -0600 (CST) Received: from pheriche.sun.com (pheriche.sun.com [192.18.98.34]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.3) with ESMTP id h1RN57W08687 for ; Thu, 27 Feb 2003 17:05:08 -0600 (CST) Received: from heliopolis.eng.sun.com ([152.70.1.39]) by pheriche.sun.com (8.9.3+Sun/8.9.3) with ESMTP id QAA21354; Thu, 27 Feb 2003 16:05:01 -0700 (MST) Received: from sun.com (sml-mtv29-dhcp-33-163 [152.70.33.163]) by heliopolis.eng.sun.com (8.9.3+Sun/8.9.3/ENSMAIL,v2.1p1) with ESMTP id PAA01842; Thu, 27 Feb 2003 15:05:02 -0800 (PST) Message-ID: <3E5E97E0.B38250B3 [at] sun [dot] com> Date: Thu, 27 Feb 2003 14:57:36 -0800 From: Bill Walster X-Mailer: Mozilla 4.79 [en] (Win98; U) X-Accept-Language: en,ru MIME-Version: 1.0 To: "reliable_computing [at] interval [dot] louisiana.edu" , "interval [at] cs [dot] utep.edu" Subject: [Fwd: [oon-list] would like oo code to solve simple pde problem] Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Sorry to bother, but perhaps somebody has an interval contribution to make. If so, please respond directly to Brad. Thanks, Bill -------- Original Message -------- Subject: [oon-list] would like oo code to solve simple pde problem Date: Thu, 27 Feb 2003 16:05:24 -0500 (EST) From: Brad Lucier To: oon-list [at] oonumerics [dot] org CC: Brad Lucier I'm teaching my numerical pde course again, which has an OO Scheme code for solving elliptic and parabolic pdes in some simple cases, see http://www.math.purdue.edu/~lucier/615/software I've written a few micro-benchmarks for sparse matrix-vector multiplication, and the Scheme code performs well compared to C code. What I'd like to find is an OO C++ code to solve a simple problem like $$ \gathered -\Delta u+u=x^2-y^2\quad\text{on $\Omega=[0,1]^2$,} \\ \frac{\partial u}{\partial n}=g\quad\text{on $\partial\Omega$,} \endgathered $$ (in amstex or amslatex notation) where $g$ is chosen so that the solution is $u=x^2-y^2$, i.e., the right hand side. I'd like to solve it on a 128 by 128 uniform grid with one set of diagonals, with piecewise linear finite elements. I've looked at Randy Bank's code, which is not OO, and which seems to have a steep learning curve to solve such a simple problem. Really, I'd like to compare the speed of C++ versus OO Scheme code, and I don't know how easy it will be to do an apples-to-apples comparison, but I'd like to try. BTW, a recent issue of the French Journal "Mathematical Modelling and Numerical Analysis" (or "Modelisation mathematique et analyse numerique", modulo a few accents, I think) was devoted to OO packages for numerical methods. (Or, just packages for numerical methods, and all the papers just happened to do OO C++.) Brad Lucier _______________________________________________ oon-list mailing list oon-list [at] oonumerics [dot] org http://www.oonumerics.org/mailman/listinfo.cgi/oon-list