From owner-reliable_computing [at] interval [dot] usl.edu Tue Feb 1 03:57:18 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id DAA01434 for reliable_computing-outgoing; Tue, 1 Feb 2000 03:57:18 -0600 (CST) Received: from trueno.cs.tu-berlin.de (root [at] trueno [dot] cs.tu-berlin.de [130.149.17.160]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id DAA01429 for ; Tue, 1 Feb 2000 03:57:15 -0600 (CST) Received: from iks.cs.tu-berlin.de (iks [at] freno [dot] cs.tu-berlin.de [130.149.17.167]) by trueno.cs.tu-berlin.de (8.9.3/8.9.1) with ESMTP id KAA04740; Tue, 1 Feb 2000 10:51:50 +0100 (MET) Received: from mail.cs.tu-berlin.de (root [at] mail [dot] cs.tu-berlin.de [130.149.17.13]) by iks.cs.tu-berlin.de (8.9.3/8.8.8) with ESMTP id KAA07577 for ; Tue, 1 Feb 2000 10:50:58 +0100 (MET) Received: from hydrus.cc.uniud.it (hydrus.cc.uniud.it [158.110.1.2]) by mail.cs.tu-berlin.de (8.9.3/8.9.1) with ESMTP id KAA00786 for ; Tue, 1 Feb 2000 10:49:11 +0100 (MET) Received: from [158.110.144.38] by HYDRUS.CC.UNIUD.IT (PMDF V5.2-32 #41629) with SMTP id <01JLE2LJ5WZC0019K0 [at] HYDRUS [dot] CC.UNIUD.IT> for cfpart-l [at] iks [dot] cs.tu-berlin.de; Tue, 1 Feb 2000 10:49:09 MET-DST Date: Tue, 01 Feb 2000 10:49:09 +0200 (MET-DST) Date-warning: Date header was inserted by HYDRUS.CC.UNIUD.IT From: dlrca [at] HYDRUS [dot] CC.UNIUD.IT (Della Riccia Giacomo) Subject: Re: categories: ETAPS 2000 - Call for Participation X-Sender: dlrca [at] 158 [dot] 110.1.2 To: cfpart-l [at] iks [dot] cs.tu-berlin.de, doris [at] cs [dot] tu-berlin.de Message-id: MIME-version: 1.0 Content-type: text/plain; charset=iso-8859-1 Content-transfer-encoding: 8BIT Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk > >To:maxk [at] maths [dot] usyd.edu.au (Max Kelly) >From:dlrca [at] hydrus [dot] cc.uniud.it (Della Riccia Giacomo) >Subject:Re: categories: ETAPS 2000 - Call for Participation > >>Would you please remove me from your mailing lists? Thanks - Max Kelly. > >Would you please remove me from your mailing lists? Thanks >G. Della Riccia > > Prof. Giacomo DELLA RICCIA Dipartimento di Matematica e Informatica Università di Udine Via delle Scienze, 206 33100-Udine (Italy) ---> Tel. (Direct Line): (+39) (0432) 55 8419 ---> Fax: (+39) (0432) 55 8499 e-mail: dlrca [at] uniud [dot] it (Please be aware that as of June 19, 1998 domestic and international dialing should include full area code (0432 in my case) From owner-reliable_computing [at] interval [dot] usl.edu Tue Feb 1 09:42:56 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id JAA02846 for reliable_computing-outgoing; Tue, 1 Feb 2000 09:42:56 -0600 (CST) Received: from sol.cc.u-szeged.hu (csendes@[160.114.8.24]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id JAA02841 for ; Tue, 1 Feb 2000 09:42:52 -0600 (CST) Received: by sol.cc.u-szeged.hu (8.9.3+Sun/SMI-SVR4) id QAA16119; Tue, 1 Feb 2000 16:41:47 +0100 (MET) From: csendes [at] sol [dot] cc.u-szeged.hu (Csendes Tibor) Message-Id: <200002011541.QAA16119 [at] sol [dot] cc.u-szeged.hu> Subject: SCAN98 proceedings To: reliable_computing [at] interval [dot] usl.edu Date: Tue, 1 Feb 2000 16:41:45 +0100 (MET) X-Mailer: ELM [version 2.5 PL2] MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear Colleagues, it is my pleasure to announce that the proceedings volume of SCAN98 is out of print (less than one and a half years later than the meeting). Enclosed please find some information about the book. Yours, Tibor Csendes -- Dr. Tibor Csendes, associate professor Tel.: +36 62 544 305 Jozsef Attila University, Dept. of Applied Informatics Fax: +36 62 420 292 H-6701 Szeged, P.O. Box 652, Hungary E-mail: csendes [at] inf [dot] u-szeged.hu WWW: http://www.inf.u-szeged.hu/~csendes/ "Sic Itur ad ACTA" ;-) Developments in Reliable Computing edited by Tibor Csendes Jozsef Attila University, Szeged, Hungary The volume contains 30 articles presented at SCAN-98, Budapest, Hungary. These papers cover all aspects of validation techniques in scientific computing, ranging from hardware requirements, elementary operations, high accuracy function evaluations and interval arithmetic to advanced validating techniques and applications in various fields of practical interest. Audience: This book is of interest to researchers and graduate students whose work involves validation techniques in scientific computing. Kluwer Academic Publishers, Dordrecht Hardbound, ISBN 0-7923-6057-5 November 1999, 400+XII pp. NLG 290.00 / USD 154.00 / GBP 96.00 Contents and Contributors Preface. G.F. Corliss, R.B. Kearfott: Rigorous Global Search: Industrial Applications. A. Facius: Influences of Rounding Errors in Solving Large Sparse Linear Systems. J. Hormigo, J. Villalba, E.L. Zapata: A Hardware Approach to Interval Arithmetic for Sine and Cosine Functions. W. Kuehn: Towards an Optimal Control of the Wrapping Effect. A.V. Lakeyev: On Existence and Uniqueness of Solutions of Linear Algebraic Equations in Kaucher's Interval Arithmetic. B. Lang: A Comparison of Subdivision Strategies for Verified Multi- Dimensional Gaussian Quadrature. S.M. Rump: INTLAB - INTerval LABoratory. W. Luther, W. Otten: Verified Calculation of the Solution of Algebraic Riccati Equation. M. Lerch: Expression Concepts in Scientific Computing. R. Sagula, T. Diverio, J. Netto: Performance Evaluation Technique STU and libavi Library. M. Schulte, V. Zelov, G.W. Walster, D. Chiriaev: Single-Number Interval I/O. K. Musch, G. Schumacher: Interval Analysis for Embedded Systems. Y. Lebbah, O. Lhomme: Prediction by Extrapolation for Interval Tightening Methods. S. Markov, K. Okumura: The Contribution of T. Sunaga to Interval Analysis and Reliable Computing. E. Hubert, W. Barth: Surface-to-Surface Intersection with Complete and Guaranteed Results. V. Lefevre: An Algorithm that Computes a Lower Bound on the Distance Between a Segment and Z^2. H. Collavizza, F. Delobel, M. Rueher: Comparing Partial Consistencies. N.S. Dimitrova, S.M. Markov: Verified Computation of Fast Decreasing Polynomials. E. Dyllong, W. Luther, W. Otten: An Accurate Distance-Calculation Algorithm for Convex Polyhedra. A. Frommer, A. Weinberg: Verified Error Bounds for Linear Systems through the Lanczos Process. G. Heindl: A Representation of the Interval Hull of a Tolerance Polyhedron Describing Inclusions of Function Values and Slopes. J.-M. Muller: A Few Results on Table-Based Methods. N.S. Nedialkov, K.R. Jackson: An Interval Hermite-Obreschkoff Method for Computing Rigorous Bounds on the Solution of an Initial Value Problem for an Ordinary Differential Equation. M.J. Schulte, V. Zelov, A. Akkas, J.C. Burley: The Interval-Enhanced GNU Fortran Compiler. S.P. Shary: Outer Estimation of Generalized Solution Sets to Interval Linear Systems. A. Strzebonski: A Real Polynomial Decision Algorithm Using Arbitrary- Precision Floating Point Arithmetic. A Numerical Verification Method of Solutions for the Navier-Stokes Equations; Y. Watanabe, N. Yamamoto, M.T. Nakao. B. Kolodziejczak, T. Szulc: Convex Sets of Full Rank Matrices. M. Lerch, J.W. von Gudenberg: Multiaspect Interval Types. R. Dunay, I. Kollar: MATLAB-Based Analysis of Roundoff Noise. G.F. Corliss: SCAN-98 Collected Bibliography. From owner-reliable_computing [at] interval [dot] usl.edu Tue Feb 1 13:55:09 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id NAA03549 for reliable_computing-outgoing; Tue, 1 Feb 2000 13:55:09 -0600 (CST) Received: from e3.ny.us.ibm.com (e3.ny.us.ibm.com [32.97.182.103]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id NAA03542 for ; Tue, 1 Feb 2000 13:54:49 -0600 (CST) From: banavar [at] us [dot] ibm.com Received: from northrelay02.pok.ibm.com (northrelay02.pok.ibm.com [9.117.200.22]) by e3.ny.us.ibm.com (8.9.3/8.9.3) with ESMTP id OAA191694; Tue, 1 Feb 2000 14:52:58 -0500 Received: from D51MTA03.pok.ibm.com (d51mta03.pok.ibm.com [9.117.200.31]) by northrelay02.pok.ibm.com (8.8.8m2/NCO v2.06) with SMTP id OAA96120; Tue, 1 Feb 2000 14:52:13 -0500 Received: by D51MTA03.pok.ibm.com(Lotus SMTP MTA v4.6.5 (863.2 5-20-1999)) id 85256878.006D0E0F ; Tue, 1 Feb 2000 14:51:10 -0500 X-Lotus-FromDomain: IBMUS To: MW2K_Publicity [at] us [dot] ibm.com Message-ID: <85256878.006D0D96.00 [at] D51MTA03 [dot] pok.ibm.com> Date: Tue, 1 Feb 2000 14:51:12 -0500 Subject: It's time to register for Middleware 2000 Mime-Version: 1.0 Content-type: text/plain; charset=us-ascii Content-Disposition: inline Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Please forward this call to your community. Sorry if you received multiple copies. =============================================================== CALL FOR PARTICIPATION Middleware 2000 The International Conference on Distributed Systems Platforms and Open Distributed Processing April 4 - 8, 2000 Hudson Valley (near New York City) USA http://www.research.ibm.com/Middleware2000 The advance program is available on our web site. We invite you to register now to join us for this premier conference in April. Sponsored by IFIP TC6 WG6.1 and ACM Supported by Agilent Technologies and IBM CONFERENCE BACKGROUND --------------------- Middleware 2000 will be the premier conference on distributed systems platforms and open distributed processing in the opening year of the new millenium. The conference is a synthesis of the major conferences and workshops in this area into a single international event. Middleware 2000 follows in the footsteps of the extremely successful, inaugural Middleware '98 Conference held in the Lake District of the UK in September, 1998. The focus of Middleware 2000 is on the design, implementation, deployment and evaluation of distributed systems platforms and architectures for future networked environments. Of particular interest is the application of both new and existing architectures and platforms (such as RM-ODP, CORBA, RMI and DCOM) in environments which may include public and private networks, overlayed wired and wireless technologies, IPv6 and IP multicast, multimedia and real-time information and an increasing volume of WWW and Java traffic. SOME CONFERENCE HIGHLIGHTS -------------------------- Middleware 2000 is a single-track conference consisting of seven paper sessions, two keynote addresses, and a work-in-progress session. There will also be posters presented during breaks. 1) The seven paper sessions are on Messaging, Caching, Reflection, Indirection, Quality of Service, Transactions and Workflow, and Composition. The details of the paper program is at: http://www.research.ibm.com/Middleware2000/Program/program.html 2) We are offering four tutorials by leading practitioners: April 4 AM Tutorials: T1. "Scalability Issues in CORBA-based Systems" Steve Vinoski, IONA Technologies T2. "Designing with Patterns" John Vlissides, IBM TJ Watson Research Center April 4 PM Tutorials: T3. "Middleware for Programmable Networks" Andrew Campbell, Columbia University T4. "Applying Patterns for Concurrent and Distributed Components" Frank Buschman, Siemens ZT More information on the tutorials is at: http://www.research.ibm.com/Middleware2000/Tutorials/tutorials.html 3. We are organizing a workshop on Reflective Middleware (RM2000) that will be co-located with Middleware 2000. Information on the RM2000 workshop can be found at: http://www.comp.lancs.ac.uk/computing/RM2000/ 4. We will have two keynote addresses by visionaries in the field of middleware: Ken Birman, Professor at Cornell University, and Jim Waldo of Sun Microsystems. 5. We will have a work-in-progress paper session and multiple poster sessions. Information on the WiP papers and posters will be available at: http://www.research.ibm.com/Middleware2000 LOCATION AND ACTIVITIES ----------------------- The conference will be held at the beautiful Hudson River Valley. The IBM Palisades Conference Center is a state-of-the-art meeting center on 106 acres of land, just north of New York City. Check out the URL. http://www.research.ibm.com/Middleware2000/Location/location.html There will be social events as part of this year's conference, including a Welcome Reception where participants can meet the organizing team and other participants in an informal setting, as well as other socials. We will also be providing conference luncheons to all attendees on all three days of the conference. Lunch will also be provided to people attending the workshop on Fri/Sat and to those attending the tutorials on Tuesday. Information on these activities will be available on the conference web page. REGISTRATION ------------ Don't delay and register today for Middleware 2000. It is THE conference to attend. With a great location, on a naturally rich Hudson Valley near culturally rich Manhattan, you can't ask for anything more. We look forward to seeing you there. -------------------------------------------------------------------- Important URL for registration: http://www.regmaster.com/midd2000.html Important Dates for registration: On or before March 2, 2000 : Discount on registration fees After March 2, 2000 or onsite : Regular registration fees ---------------------------------------------------------------------- -------- Guruduth Banavar Publicity Chair, Middleware 2000 Conference From owner-reliable_computing [at] interval [dot] usl.edu Thu Feb 3 10:22:43 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA00398 for reliable_computing-outgoing; Thu, 3 Feb 2000 10:22:43 -0600 (CST) Received: from skiff.cs.vu.nl (skiff.cs.vu.nl [192.31.231.56]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id IAA02612 for ; Thu, 3 Feb 2000 08:13:57 -0600 (CST) Received: by skiff.cs.vu.nl (Smail #64) id m12GMzd-000TgaC; Thu, 3 Feb 2000 15:12 +0100 Message-Id: Subject: CL2000: deadline postponed to February 21st To: reliable_computing [at] interval [dot] usl.edu Date: Thu, 3 Feb 2000 15:12:20 +0100 (MET) From: "Raamsdonk van F" X-Mailer: ELM [version 2.5 PL2] MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk *** apologies for multiple copies *** First International Conference on Computational Logic, CL2000 Imperial College, London, UK 24th to 28th July, 2000 http://www.doc.ic.ac.uk/cl2000/ Due largely to the difficulties caused by related conferences having submission dates at about the same time, the submission deadline for CL2000 is postponed to Monday 21st February, 2000. If you wish to take advantage of this extension, you are asked to email the Chair of the Stream to which you intend to submit the title, author(s), abstract, and keywords for your paper *as soon as possible*. Highlights of the conference include 8 invited speakers, 12 tutorials, and a strong workshop programme held in-line with the conference. Collocating with CL2000 are DOOD2000, LOPSTR2000, and ILP2000. Full details about the conference, including the email addresses of the Stream Chairs, are given at the above URL. From owner-reliable_computing [at] interval [dot] usl.edu Sat Feb 5 10:20:19 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA04353 for reliable_computing-outgoing; Sat, 5 Feb 2000 10:20:19 -0600 (CST) Received: from kleene.math.wisc.edu (kleene.math.wisc.edu [144.92.166.90]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA04348 for ; Sat, 5 Feb 2000 10:20:11 -0600 (CST) Received: from forelli.math.wisc.edu (forelli.math.wisc.edu [144.92.166.70]) by kleene.math.wisc.edu (8.9.3/8.9.3) with SMTP id KAA19230; Sat, 5 Feb 2000 10:13:45 -0600 (CST) Date: Sat, 5 Feb 2000 10:34:06 -0600 (CST) From: Hans Schneider To: NETS -- at-net , "Hershkowitz, Danny -- Hershkowitz Daniel" , Danny Hershkowitz , E-LETTER , "na.digest" , ipnet-digest [at] math [dot] msu.edu, wim@bell-labs.com, hjt [at] eos [dot] ncsu.edu, vkm [at] eedsp [dot] gatech.edu, reliable_computing [at] interval [dot] louisiana.edu Subject: LAA announcement Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear Net Organizer: Please circulate the attached LAA announcement over your net. Thanks hans --- Linear Algebra and its Applications Special Issue on INFINITE SYSTEMS OF LINEAR EQUATIONS FINITELY SPECIFIED Second Announcement One of the traditional hunting grounds of linear algebra is the area of finite systems of linear equations, as described by a matrix equation $Ax = b$. Here $A$ is a known matrix, $b$ a known vector of finite dimensions, and $x$ is an unknown vector of finite dimensions, which is to be determined such that the equation is either satisfied, or, if that is not possible, approximately satisfied. Many techniques are known for finding solutions or approximate solutions, depending on the properties of the given data and the approximation technique choosen. If the system of equations is not finite, i.e. $A$ is not a matrix but an operator, and $b$ and $x$ are of infinite dimension, then algebraic and numerical techniques can still be used provided the given data are finitely specified. Operators with such a property are often called 'structured operators', and it turns out that one can solve such infinite equations in an exact or approximate sense using finite methods and algorithms. The conjunction of linear algebra and inversion theory for finitely specified infinite operators brings interesting connections to the forefront: algebraic equivalents of inner-outer factorizations e.g., or the algebraic significance of Kalman filtering. Structured matrices can be of many types, e.g. systems with finite displacement ranks or time-varying systems with state spaces of finite dimensions and whose limiting behaviour is known, e.g. as a time invariant system. A non-limiting list of topics of interest in this area is (assuming $A$ is an infinite but finitely described operator of some kind): - inversion methods - decomposition methods for the operator A - quadratic approximation methods - complexity reduction - equivalencies - canonical forms - transform techniques. Examples of operator structure: - systems with low displacement rank - finitely described time-varying systems - finitely described almost-periodic systems - differentials of non-linear systems. Interested authors are kindly invited to submit full papers with significant contributions to this area to any of the three guest editors listed below before June 1st, 2000. Patrick Dewilde DIMES, Delft University of Technology POB 5031, 2600GA Delft, the Netherlands. Fax: +31 15 262 3271 email: dewilde [at] DIMES [dot] tudelft.nl Vadim Olshevsky Department of Mathematics and Computer Science Georgia State University University Plaza Atlanta, GA 30303, USA Fax: +1 404 651 2246 email: volshevsky [at] cs [dot] gsu.edu Ali Sayed Rm 44-123A Engr. IV Bldg Dept. of Electrical Engineering University of California Los Angeles, CA 90095-1594, USA Fax: +1 310 206 8495 email: sayed [at] biruni [dot] icsl.ucla.edu ------------------------------------------------------------------------------ Hans Schneider hans [at] math [dot] wisc.edu. Department of Mathematics 608-262-1402 (Work) Van Vleck Hall 608-271-7252 (Home) 480 Lincoln Drive 608-263-8891 (Work FAX) University of Wisconsin-Madison 608-271-8477 (Home FAX) Madison WI 53706 USA http://www.math.wisc.edu/~hans (URL) ------------------------------------------------------------------------------ From owner-reliable_computing [at] interval [dot] usl.edu Sun Feb 6 11:51:50 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id LAA06451 for reliable_computing-outgoing; Sun, 6 Feb 2000 11:51:50 -0600 (CST) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id LAA06446 for ; Sun, 6 Feb 2000 11:51:47 -0600 (CST) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.9.3+Sun/8.9.1) with SMTP id KAA10334 for ; Sun, 6 Feb 2000 10:51:44 -0700 (MST) Message-Id: <200002061751.KAA10334 [at] cs [dot] utep.edu> Date: Sun, 6 Feb 2000 10:51:44 -0700 (MST) From: vladik Reply-To: vladik Subject: ECCAD'2000 Call for Participation To: reliable_computing [at] interval [dot] usl.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: X977x5tc+feA195mdNyZkg== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Apologies for multiple copies ------------- Begin Forwarded Message ------------- From: Mark Giesbrecht MIME-Version: 1.0 Content-Transfer-Encoding: 7bit Date: Sat, 5 Feb 2000 17:40:44 -0500 (EST) To: mwg [at] scl [dot] csd.uwo.ca Subject: ECCAD'2000 Call for Participation ------------------------------------------------------------------------------- EAST COAST COMPUTER ALGEBRA DAY 2000 Joint meeting with Southern Ontario Numerical Analysis Day 2000 and the 70th Birthday Celebration for Professor Hans J. Stetter ANNOUNCEMENT AND CALL FOR PARTICIPATION ------------------------------------------------------------------------------- The 7th East Coast Computer Algebra Day (ECCAD'2000) will be held on Saturday, May 13, 2000. It will be hosted at the Ontario Research Centre for Computer Algebra The University of Western Ontario London, Ontario, Canada. This meeting will be immediately preceded by the Southern Ontario Numerical Analysis Day (SONAD'2000) on May 12, 2000, at the same location. You can register and get more information by looking at our World Wide Web site at http://orcca.on.ca/events. Alternatively, send e-mail to one of the organizers listed below, and registration information will be sent to you. There is no registration fee for either conference, and limited travel support may be available on request. ORGANIZERS * Mark Giesbrecht http://www.csd.uwo.ca/~mwg (General Chair, ECCAD'2000) * George Labahn http://daisy.uwaterloo.ca/~glabahn (Program Chair, ECCAD'2000) * Rob Corless http://www.apmaths.uwo.ca/~rcorless (General Chair, SONAD'2000) TIME AND LOCATION Saturday, May 13, 2000, 8:30am Middlesex Theatre, Middlesex College University of Western Ontario London, Ontario, Canada Reception in The Grad Club Lounge (Middlesex College) on Friday, May 12, 6:00pm-8:00pm. THEMES * Algebraic Algorithms * Hybrid Symbolic-Numeric Computation * Computer Algebra Systems and Generic Programming * Mathematical Communication * Complexity of Algebraic Problems INVITED PRESENTATIONS * Joachim von zur Gathen, University of Paderborn, Germany * Michael Monagan, Simon Fraser University, Canada * Hans J. Stetter, Technical University of Vienna, Austria POSTER SESSIONS In keeping with tradition, there will be two poster sessions offering an opportunity to present timely research in an informal environment. If you wish to submit a poster, please send a title and abstract to George Labahn at glabahn [at] daisy [dot] uwaterloo.ca by April 28, 2000. SONAD has a similar philosophy, except that the format is short talks, not posters. See the SONAD announcement for details of that day's speakers. Even if you are not planning to give a poster, please mark the dates on your calendar as you are encouraged to participate. CONFERENCE DINNER IN CELEBRATION OF THE 70th BIRTHDAY OF PROFESSOR HANS J. STETTER Professor Stetter has been a founding contributor to many of the themes of these Days; his work on initial-value problems in the 70's, on interval methods in the 80's, and current work on hybrid symbolic-numeric computation is of lasting value. In celebration of his 70th birthday, we are pleased to ask you to join us for the Conference Dinner in Professor Stetter's honour at the Great Hall, University of Western Ontario, at 7:00pm on Saturday, May 13. Tickets for the dinner are $40CDN ($20CDN for students) and registration for the dinner must be made by Friday, May 5. ------------- End Forwarded Message ------------- From owner-reliable_computing [at] interval [dot] usl.edu Sun Feb 6 14:30:43 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id OAA06873 for reliable_computing-outgoing; Sun, 6 Feb 2000 14:30:43 -0600 (CST) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id OAA06868 for ; Sun, 6 Feb 2000 14:30:39 -0600 (CST) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.9.3+Sun/8.9.1) with SMTP id NAA10551 for ; Sun, 6 Feb 2000 13:30:37 -0700 (MST) Message-Id: <200002062030.NAA10551 [at] cs [dot] utep.edu> Date: Sun, 6 Feb 2000 13:30:37 -0700 (MST) From: vladik Reply-To: vladik Subject: Re: ECCAD'2000 Call for Participation To: reliable_computing [at] interval [dot] usl.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: ttgFTGGvlH0IIouVtltvfA== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk ------------- Begin Forwarded Message ------------- From: "Rob Corless" To: "vladik" Cc: "Rob Corless" Subject: Re: ECCAD'2000 Call for Participation Date: Sun, 6 Feb 2000 15:23:10 -0500 MIME-Version: 1.0 Content-Transfer-Encoding: 7bit X-Priority: 3 X-MSMail-Priority: Normal X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2314.1300 Dear Vladik: Thanks for forwarding the ECCAD announcement on. You may also wish to forward the following brief "delta" note about Southern Ontario Numerical Analysis Day (SONAD), which is to be held the day before ECCAD (at the same location). Note also that one of the themes of SONAD is interval computation, and that interval people may very well be interested in attending the 70th birthday celebration for Professor Hans Stetter. Best regards, and I hope you can attend, Rob Corless ------------------------------------------------------------------------- SOUTHERN ONTARIO NUMERICAL ANALYSIS DAY 2000 joint meeting with East Coast Computer Algebra Day 2000 and the 70th Birthday Celebration for Professor Hans J. Stetter ANNOUNCEMENT AND CALL FOR PARTICIPATION ---------------------------------------------------------------------------- More information: www.orcca.on.ca/events TIME AND LOCATION Friday, May 12, 2000, 8:30am Middlesex Theatre, Middlesex College University of Western Ontario London, Ontario, Canada Reception in The Grad Club Lounge (Middlesex College) on Friday, May 12, 6:00pm-8:00pm. THEMES * Initial-Value Problems for ODE and DAE * Interval Mathematics * Hybrid Symbolic-Numeric Computation INVITED PRESENTATIONS * Gilles Villard, LMC-IMAG / Equipe Calcul Formel, Grenoble, France. * Grant Stephenson, Honeywell Hi-Spec, London, Canada * Lawrence F. Shampine, Southern Methodist University, Texas. CONFERENCE DINNER IN CELEBRATION OF THE 70th BIRTHDAY OF PROFESSOR HANS J. STETTER Professor Stetter has been a founding contributor to many of the themes of these Days; his work on initial-value problems in the 70's, on interval methods in the 80's, and current work on hybrid symbolic-numeric computation is of lasting value. In celebration of his 70th birthday, we are pleased to ask you to join us for a dinner in Professor Stetter's honour at the Great Hall, University of Western Ontario, at 7:00pm on Saturday, May 13 (after ECCAD). Tickets for the dinner are $40CDN ($20CDN for students) and registration for the dinner must be made by Friday, May 5. ------------- End Forwarded Message ------------- From owner-reliable_computing [at] interval [dot] usl.edu Sun Feb 6 20:09:39 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id UAA07403 for reliable_computing-outgoing; Sun, 6 Feb 2000 20:09:38 -0600 (CST) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id UAA07398 for ; Sun, 6 Feb 2000 20:09:35 -0600 (CST) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.9.3+Sun/8.9.1) with SMTP id TAA11123 for ; Sun, 6 Feb 2000 19:09:32 -0700 (MST) Message-Id: <200002070209.TAA11123 [at] cs [dot] utep.edu> Date: Sun, 6 Feb 2000 19:09:33 -0700 (MST) From: vladik Reply-To: vladik Subject: attention US and Canadian researchers: from NA Digest To: reliable_computing [at] interval [dot] usl.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: h+j2sMAfbM+hQwDahCwLbQ== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk From: Endre Suli Date: Mon, 31 Jan 2000 22:21:35 +0000 (GMT) Subject: Search of Venue for the FoCM 2002 Conference Search of venue for the FoCM 2002 Conference Following the very successful second international conference on the Foundations of Computational Mathematics (FoCM) at Oxford University in July 1999 which attracted 320 participants and a high-powered cast of foremost world authorities from all branches of mathematics, the Executive Committee of FoCM is now investigating possible venues and calling for proposals for the next FoCM conference in Summer 2002. Although the Committee is open-minded as to the geographic location, there is a definite body of opinion to the effect that this is North America's turn (after Brazil and the UK). If you contemplate the idea of organising the next FoCM conference, please drop an e-mail to Endre.Suli [at] comlab [dot] ox.ac.uk as soon as possible to explore this further. Formal applications (up to 2 pages long) should be sent to him by 31 March, 2000, including details about lecture room facilities, quality and cost of local accommodation and subsistence, convenience of travel to the region, and potential sources of funding. The FoCM Executive Committee expects to announce the venue and the likely time of the next FoCM conference in April 2000. The aim of FoCM as an organisation is to explore and foster the interactions and establish a common agenda between computational mathematics, pure mathematics and computer science through conferences, workshops and series of publications which include the new Springer-Verlag journal ``Foundations of Computational Mathematics'', edited by Mike Shub, and the new Cambridge University Press monograph series ``Library of Computational Mathematics'' published under the FoCM imprint. Further details are available from the official FoCM website: http://www.focm.net/ From owner-reliable_computing [at] interval [dot] usl.edu Fri Feb 11 10:39:38 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA19043 for reliable_computing-outgoing; Fri, 11 Feb 2000 10:39:38 -0600 (CST) Received: from stuio1.puce.edu.ec ([192.188.55.6]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA19038 for ; Fri, 11 Feb 2000 10:39:19 -0600 (CST) Received: by STUIO1 with Internet Mail Service (5.5.2448.0) id ; Fri, 11 Feb 2000 11:37:26 -0500 Message-ID: <41264836724AD21199AF0060083CA6AD0F8BBA@PUCEUIO> From: CASARES MALDONADO ALEJANDRO To: "'reliable_computing [at] interval [dot] usl.edu'" Subject: Conform to IEEE 754 Date: Fri, 11 Feb 2000 11:37:30 -0500 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.5.2448.0) Content-Type: text/plain; charset="iso-8859-1" Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear members: Could you tell me approximately how many (in percentage) actual computers conform themselves to the IEEE 754 floating point representation norm? Is there some known kind of machines - ad es., supercomputers, which do not adhere to that standard? Regards, Alejandro Casares From owner-reliable_computing [at] interval [dot] usl.edu Fri Feb 11 13:08:43 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id NAA19591 for reliable_computing-outgoing; Fri, 11 Feb 2000 13:08:43 -0600 (CST) Received: from s63.ucs.usl.edu (root [at] s63 [dot] ucs.usl.edu [130.70.118.63]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id NAA19586 for ; Fri, 11 Feb 2000 13:08:40 -0600 (CST) Received: from s63.ucs.usl.edu (rbk5287 [at] s63 [dot] ucs.usl.edu [130.70.118.63]) by s63.ucs.usl.edu (8.9.1/8.9.1/ucs-client_1.3) with SMTP id NAA00507; Fri, 11 Feb 2000 13:08:32 -0600 (CST) Message-Id: <200002111908.NAA00507 [at] s63 [dot] ucs.usl.edu> Date: Fri, 11 Feb 2000 13:08:32 -0600 (CST) From: Kearfott Ralph B Reply-To: Kearfott Ralph B Subject: Re: Conform to IEEE 754 To: reliable_computing [at] interval [dot] usl.edu, ACASARES [at] puceuio [dot] puce.edu.ec MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: 204V3lReP4wNSNq20oNxSA== X-Mailer: dtmail 1.2.1 CDE Version 1.2.1 SunOS 5.6 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Alejandro, Intel-based machines except for flawed pentiums :-) have circuitry for conforming to the standard. All Sun machines have such circuitry, and, for the most part, Unix-based workstations do. Some notorious older machines that do not conform are older Cray mainframes and IBM mainframes. However, the IBM mainframes, although having hexadecimal arithmetic, have an arithmetic that in many respects satisfies the spirit of IEEE. The older Cray mainframes have particularly bad arithmetic in the sense of IEEE. When you look at every attribute specified in IEEE, it becomes somewhat more complicated. In particular, IEEE specifies the accuracy of binary-to-decimal and decimal-to-binary conversions. Such conversions occur, for example, when formatting a floating point number for printing. Because of this, conformance to the standard is tied to the compiler. A number of compilers do not have good binary to decimal conversion, in the sense of IEEE. In other words, on those compilers, "what you get is not what you see." (Incidentally, the Fortran 2000 standard will have a function that queries whether the processor conforms to IEEE. It also will have functions to access IEEE operations, such as setting the roundoff mode.) Best regards, R. Baker Kearfott > From: CASARES MALDONADO ALEJANDRO > To: "'reliable_computing [at] interval [dot] usl.edu'" > Subject: Conform to IEEE 754 > Date: Fri, 11 Feb 2000 11:37:30 -0500 > MIME-Version: 1.0 > > Dear members: > > Could you tell me approximately how many (in percentage) actual computers > conform themselves to the IEEE 754 floating point representation norm? > > Is there some known kind of machines - ad es., supercomputers, which do not > adhere to that standard? > > Regards, > > Alejandro Casares --------------------------------------------------------------- R. Baker Kearfott, rbk [at] louisiana [dot] edu (337) 482-5346 (fax) (337) 482-5270 (work) (337) 981-9744 (home) URL: http://interval.louisiana.edu/kearfott.html Department of Mathematics, University of Louisiana at Lafayette Box 4-1010, Lafayette, LA 70504-1010, USA --------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] usl.edu Fri Feb 11 13:51:20 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id NAA20012 for reliable_computing-outgoing; Fri, 11 Feb 2000 13:51:20 -0600 (CST) Received: from csc-sun.math.utah.edu (root@csc-sun.math.utah.edu [128.110.198.2]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id NAA20007 for ; Fri, 11 Feb 2000 13:51:16 -0600 (CST) Received: from suncore.math.utah.edu (suncore0.math.utah.edu [128.110.198.5]) by csc-sun.math.utah.edu (8.9.3/8.9.3) with ESMTP id MAA28439; Fri, 11 Feb 2000 12:51:08 -0700 (MST) Received: (from beebe@localhost) by suncore.math.utah.edu (8.9.3/8.9.3) id MAA23361; Fri, 11 Feb 2000 12:51:06 -0700 (MST) Date: Fri, 11 Feb 2000 12:51:06 -0700 (MST) From: "Nelson H. F. Beebe" To: CASARES MALDONADO ALEJANDRO , reliable_computing [at] interval [dot] usl.edu Cc: beebe [at] math [dot] utah.edu X-US-Mail: "Center for Scientific Computing, Department of Mathematics, 322 INSCC, University of Utah, 155 S 1400 E RM 233, Salt Lake City, UT 84112-0090, USA" X-Telephone: +1 801 581 5254 X-FAX: +1 801 585 1640, +1 801 581 4148 X-URL: http://www.math.utah.edu/~beebe Subject: Re: Conform to IEEE 754 Message-ID: Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Alejandro Casares asks on Fri, 11 Feb 2000 11:37:30 -0500 >> Could you tell me approximately how many (in percentage) actual computers >> conform themselves to the IEEE 754 floating point representation norm? >> >> Is there some known kind of machines - ad es., supercomputers, which do not >> adhere to that standard? Because of the large installed base of Intel x86 processors, the answer is: almost 100%, if you simply count CPUs with floating-point hardware. The major floating-point architectures on today's market are: IEEE 754: Intel x86, and all RISC systems (IBM Power and PowerPC, Compaq/DEC Alpha, HP PA-RISC, Motorola 68xxx and 88xxx, SGI (MIPS) R-xxxx, Sun SPARC, and others); VAX: Compaq/DEC IBM S/390: IBM (however, in 1998, IBM added an IEEE 754 option to S/390; see below) Cray: X-MP, Y-MP, C-90; other Cray models have been based on Alpha and SPARC processors with IEEE-754 arithmetic. However, there are many issues of how strict IEEE 754 compliance is. Some vendors implement the standard entirely in hardware (IBM and Intel), others in a combination of hardware and software (all non-IBM RISC systems), and at least one entirely in software (Apple SANE (Standard Apple Numeric Environment) on older Macintoshes). Compaq/DEC Alpha by default does not adhere to IEEE 754 requirements: overflow and invalid operands (NaNs) terminate the job. Compiler options can be given to choose IEEE 754 conformance, but there is then a significant run-time penalty because of the need to insert trap barrier instructions that flush the instruction pipeline, so that trapping instructions can be precisely identified, and the exception handled in software. The latest Alpha chip, the 21264, provides full hardware support for IEEE 754 (see \cite{Kessler:1999:AM} below). Rounding mode control, which is essential for efficient interval arithmetic implementation, is absent from some systems (and from the Java programming language, which otherwise requires IEEE 754 arithmetic). On all systems with partial software implementations, there can be a severe performance hit to handle underflows (gradual or flush-to-zero), overflows, and invalid operands. Benchmarkers must be aware of these issues. Several vendors now follow IBM's lead from the 1990 Power architecture in offering multiply-add instructions that offer higher performance, and higher accuracy: a*b + c is computed by evaluating a*b exactly (i.e., to 2N bits), then the addition of c is made, also to 2N bits, and finally, the result is rounded to N bits. This has been shown to be exceedingly useful in careful numerical analysis, and serendipitously, provides a 2x flops rate improvement. However, it means that there will be even larger differences in accuracy between platforms. Most compilers on such systems provide a flag to suppress the use of such instructions. Intel, alone of all the vendors cited above, does its arithmetic with the IEEE-recommended 80-bit temporary real format. Rounding to 64-bit and 32-bit values happens only in register-to-memory transfers (and consequently, suffers a severe performance penalty (10x to 100x) for a round-trip to and from memory if 64-bit rounding is needed). The AMD K-7 (an Intel x86 compliant system) uses 80-bit temporary real format, but does much of its internal work with even longer precision (see \cite{Oberman:1999:FPD} below), in order to produce correctly-rounded results. Several RISC architectures do all arithmetic in 64-bit mode, converting to and from 32-bit values during memory transfers as needed. The Java language forbids use of longer intermediate precision (including multiply-add instructions), a decision that raised so much debate that the language designers are reexamining Java's floating-point specification. These precision differences in intermediate values contribute further to accuracy differences between platforms. The waters are even more muddied by the introduced of `multimedia instruction sets' from most of the cited vendors in recent processor offerings. Some of these have 32-bit floating-point in the IEEE-754 format, but without gradual underflow, NaN, and infinity. Because these instructions can do 2 to 8 flops in parallel, compilers will begin to use them for performance reasons, but then there will be even more variance from IEEE 754 requirements. The IEEE 754 standard requires correct rounding, in one of four modes (to nearest, +infinity, -infinity, and zero), yet not all vendors strictly conform. At least one (Compaq/DEC Alpha) normally provides only a compile-time choice of rounding mode; you have to specify an additional compiler option to get dynamic rounding (presumably because there is a performance hit for doing so). The Intel/HP IA-64 architecture (codenamed Merced) is reported (\cite{Story:1999:NAI}: see below) to produce results for the transcendental function primitives (not part of the IEEE 754 standard) which are accurate to less that 0.6 ulp (compared to Intel Pentium, which reaches only 1 ulp); the paper goes on to note ``Since these functions do not always yield a correctly-rounded value, invoking them twice under two directed rounding modes does not always produce an interval that includes the true mathematical value.'' That point should be of considerable importance to readers of this list, since the evolutionary path for the 250M+ Intel x86-based desktops world wide is to IA-64, and interval arithmetic deserves to have increasing importance in scientific computation. For more information on the current state of floating-point arithmetic, see papers from the ARITH conference series, many of which are recorded in http://www.math.utah.edu/pub/tex/bib/index-table-f.html#fparith The two Swartzlander reprint volumes there contain many historically important papers. The IBM S/390 paper from the 1999 ARITH-14 meeting is: @InProceedings{Schwarz:1999:GFP, author = "E. M. Schwarz and R. M. Smith and C. A. Krygowski", title = "The {S/390 G5} Floating Point Unit Supporting Hex and Binary Architectures", crossref = "Koren:1999:ISC", pages = "258--265", year = "1999", bibdate = "Mon Feb 7 07:28:26 MST 2000", URL = "http://euler.ecs.umass.edu/paper/final/paper-112.ps; http://euler.ecs.umass.edu/paper/final/paper-112.pdf", acknowledgement = ack-nhfb, keywords = "computer arithmetic; ARITH; IEEE", } @InProceedings{Oberman:1999:FPD, author = "S. F. Oberman", title = "Floating Point Division and Square Root Algorithms and Implementation in the {AMD-K7[TM]} Microprocessor", crossref = "Koren:1999:ISC", pages = "106--115", year = "1999", bibdate = "Mon Feb 7 07:28:26 MST 2000", URL = "http://euler.ecs.umass.edu/paper/final/paper-139.ps; http://euler.ecs.umass.edu/paper/final/paper-139.pdf", acknowledgement = ack-nhfb, keywords = "computer arithmetic; ARITH; IEEE", } @InProceedings{Story:1999:NAI, author = "S. Story and P. T. P. Tang", title = "New Algorithms for Improved Transcendental Functions on {IA-64}", crossref = "Koren:1999:ISC", pages = "4--11", year = "1999", bibdate = "Mon Feb 7 07:28:26 MST 2000", URL = "http://euler.ecs.umass.edu/paper/final/paper-118.ps; http://euler.ecs.umass.edu/paper/final/paper-118.pdf", acknowledgement = ack-nhfb, keywords = "computer arithmetic; ARITH; IEEE", } @Proceedings{Koren:1999:ISC, editor = "Israel Koren and Peter Kornerup", booktitle = "14th IEEE Symposium on Computer Arithmetic: proceedings: April 14--16, 1999, Adelaide, Australia", title = "14th {IEEE} Symposium on Computer Arithmetic: proceedings: April 14--16, 1999, Adelaide, Australia", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "xi + 274", year = "1999", ISBN = "0-7803-5609-8, 0-7695-0116-8, 0-7695-0118-4", ISSN = "1063-6889", LCCN = "QA76.6 .S887 1999", bibdate = "Mon Feb 7 07:28:26 MST 2000", note = "IEEE Computer Society Order Number PR00116. IEEE Order Plan Catalog Number 99CB36336.", URL = "http://computer.org/conferen/home/arith/; http://www.ecs.umass.edu/ece/arith14/program.html", acknowledgement = ack-nhfb, annote = "Also known as ARITH-14.", source = "Computer arithmetic", sponsor = "IEEE.", } @Article{Kessler:1999:AM, author = "R. E. Kessler", title = "The {Alpha 21264} Microprocessor", journal = j-IEEE-MICRO, volume = "19", number = "2", pages = "24--36", month = mar # "\slash " # apr, year = "1999", CODEN = "IEMIDZ", ISSN = "0272-1732", bibsource = "http://www.computer.org/micro/mi1999/", URL = "http://www.computer.org/micro/mi1999/m2024abs.htm; http://dlib.computer.org/mi/books/mi1999/pdf/m2024.pdf", acknowledgement = ack-nhfb, bibdate = "Fri Apr 2 09:14:32 MST 1999", } ------------------------------------------------------------------------------- - Nelson H. F. Beebe Tel: +1 801 581 5254 - - Center for Scientific Computing FAX: +1 801 585 1640, +1 801 581 4148 - - University of Utah Internet e-mail: beebe [at] math [dot] utah.edu - - Department of Mathematics, 322 INSCC beebe [at] acm [dot] org - - 155 S 1400 E RM 233 beebe [at] ieee [dot] org - - Salt Lake City, UT 84112-0090, USA URL: http://www.math.utah.edu/~beebe - ------------------------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] usl.edu Sun Feb 13 22:04:12 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id WAA02367 for reliable_computing-outgoing; Sun, 13 Feb 2000 22:04:12 -0600 (CST) Received: from kleene.math.wisc.edu (kleene.math.wisc.edu [144.92.166.90]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id WAA02362 for ; Sun, 13 Feb 2000 22:03:56 -0600 (CST) Received: from bing.math.wisc.edu (bing.math.wisc.edu [144.92.166.133]) by kleene.math.wisc.edu (8.9.3/8.9.3) with SMTP id VAA21004; Sun, 13 Feb 2000 21:49:16 -0600 (CST) Date: Sun, 13 Feb 2000 21:41:09 -0600 (CST) From: Hans Schneider To: NETS -- at-net , "Hershkowitz, Danny -- Hershkowitz Daniel" , Danny Hershkowitz , E-LETTER , "na.digest" , ipnet-digest [at] math [dot] msu.edu, wim@bell-labs.com, hjt [at] eos [dot] ncsu.edu, vkm [at] eedsp [dot] gatech.edu, reliable_computing [at] interval [dot] louisiana.edu Subject: LAA contents Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk ------------------------------------------------------------------------------ Hans Schneider hans [at] math [dot] wisc.edu. Department of Mathematics 608-262-1402 (Work) Van Vleck Hall 608-271-7252 (Home) 480 Lincoln Drive 608-263-8891 (Work FAX) University of Wisconsin-Madison 608-271-8477 (Home FAX) Madison WI 53706 USA http://www.math.wisc.edu/~hans (URL) ------------------------------------------------------------------------------ Dear Net Organizer: Please circulate the attached LAA contents over your net. Thanks hans --- ContentsDirect from Elsevier Science ===================================== URL: http://www.elsevier.nl/locate/jnlnr/07738 Journal: Linear Algebra and Its Applications ISSN : 0024-3795 Volume : 306 Issue : 1-3 Date : 22-Feb-2000 pp 1-13 Equivalence constants for matrix norms: a problem of Goldberg A Tonge pp 15-24 Classes of Schur D-stable matrices R Fleming pp 25-31 A representation theorem for algebras with commuting involutions M Cabrera pp 33-44 Sparsity of orthogonal matrices with restrictions GS Cheon, BL Shader pp 45-57 On sums of three square-zero matrices K Takahashi, PEIYUAN Wu pp 59-86 The Nevanlinna-Pick interpolation problems and power moment problems for matrix-valued functions III: The infinitely many data case GONGNING Chen pp 87-102 Generalized totally positive matrices M Fiedler pp 103-121 On almost regular tournament matrices C Eschenbach, JR Weaver pp 123-130 Dual graphs and knot invariants M Lien, W Watkins pp 131-143 Decomposing a matrix into circulant and diagonal factors M Schmid, R Steinwandt pp 145-154 Centrogonal matrices O Krafft pp 155-163 Spectral clustering properties of block multilevel Hankel matrices D Fasino pp 165-182 On condensed forms for partially commuting matrices YUA Alpin, L Elsner pp 183-188 A tree whose complement is not eigensharp VL Watts pp 189-202 Growth in Gaussian elimination for weighing matrices, W(n,n-1) CHRISTOS Koukouvinos pp 203-209 Semidefiniteness without real symmetry CR Johnson, RB Reams pp 211-211 Author index ------- NOTE: ContentsDirect, which is automatically generated, lists the first author of each paper and the corresponding author (if different). From owner-reliable_computing [at] interval [dot] usl.edu Mon Feb 14 00:18:37 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id AAA02793 for reliable_computing-outgoing; Mon, 14 Feb 2000 00:18:36 -0600 (CST) Received: from e3.ny.us.ibm.com (e3.ny.us.ibm.com [32.97.182.103]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id AAA02788 for ; Mon, 14 Feb 2000 00:18:33 -0600 (CST) From: banavar [at] us [dot] ibm.com Received: from northrelay02.pok.ibm.com (northrelay02.pok.ibm.com [9.117.200.22]) by e3.ny.us.ibm.com (8.9.3/8.9.3) with ESMTP id BAA131084; Mon, 14 Feb 2000 01:15:45 -0500 Received: from D51MTA03.pok.ibm.com (d51mta03.pok.ibm.com [9.117.200.31]) by northrelay02.pok.ibm.com (8.8.8m2/NCO v2.06) with SMTP id BAA75378; Mon, 14 Feb 2000 01:04:50 -0500 Received: by D51MTA03.pok.ibm.com(Lotus SMTP MTA v4.6.5 (863.2 5-20-1999)) id 85256885.00214FED ; Mon, 14 Feb 2000 01:03:51 -0500 X-Lotus-FromDomain: IBMUS To: MW2K_Publicity [at] us [dot] ibm.com Message-ID: <85256885.00214DC7.00 [at] D51MTA03 [dot] pok.ibm.com> Date: Mon, 14 Feb 2000 00:35:49 -0500 Subject: It's time to register for Middleware 2000! Mime-Version: 1.0 Content-type: text/plain; charset=us-ascii Content-Disposition: inline Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear Colleague, Please note that the deadline for early registration is March 2, 2000. I urge you to not delay and register now for this premier conference. Please also help circulate this call for participation. Thanks. Guruduth Banavar =============================================================== CALL FOR PARTICIPATION Middleware 2000 The International Conference on Distributed Systems Platforms and Open Distributed Processing April 4 - 8, 2000 Hudson Valley (near New York City) USA http://www.research.ibm.com/Middleware2000 The advance program is available on our web site. We invite you to register now to join us for this premier conference in April. Sponsored by IFIP TC6 WG6.1 and ACM Supported by Agilent Technologies and IBM CONFERENCE BACKGROUND --------------------- Middleware 2000 will be the premier conference on distributed systems platforms and open distributed processing in the opening year of the new millenium. The conference is a synthesis of the major conferences and workshops in this area into a single international event. Middleware 2000 follows in the footsteps of the extremely successful, inaugural Middleware '98 Conference held in the Lake District of the UK in September, 1998. The focus of Middleware 2000 is on the design, implementation, deployment and evaluation of distributed systems platforms and architectures for future networked environments. Of particular interest is the application of both new and existing architectures and platforms (such as RM-ODP, CORBA, RMI and DCOM) in environments which may include public and private networks, overlayed wired and wireless technologies, IPv6 and IP multicast, multimedia and real-time information and an increasing volume of WWW and Java traffic. SOME CONFERENCE HIGHLIGHTS -------------------------- Middleware 2000 is a single-track conference consisting of seven paper sessions, two keynote addresses, and a work-in-progress session. There will also be posters presented during breaks. 1) The seven paper sessions are on Messaging, Caching, Reflection, Indirection, Quality of Service, Transactions and Workflow, and Composition. The details of the paper program is at: http://www.research.ibm.com/Middleware2000/Program/program.html 2) We are offering four tutorials by leading practitioners: April 4 AM Tutorials: T1. "Scalability Issues in CORBA-based Systems" Steve Vinoski, IONA Technologies T2. "Designing with Patterns" John Vlissides, IBM TJ Watson Research Center April 4 PM Tutorials: T3. "Middleware for Programmable Networks" Andrew Campbell, Columbia University T4. "Applying Patterns for Concurrent and Distributed Components" Frank Buschman, Siemens ZT More information on the tutorials is at: http://www.research.ibm.com/Middleware2000/Tutorials/tutorials.html 3. We are organizing a workshop on Reflective Middleware (RM2000) that will be co-located with Middleware 2000. Information on the RM2000 workshop can be found at: http://www.comp.lancs.ac.uk/computing/RM2000/ 4. We will have two keynote addresses by visionaries in the field of middleware: Ken Birman, Professor at Cornell University, and Jim Waldo of Sun Microsystems. 5. We will have a work-in-progress paper session and multiple poster sessions. Information on the WiP papers and posters will be available at: http://www.research.ibm.com/Middleware2000 LOCATION AND ACTIVITIES ----------------------- The conference will be held at the beautiful Hudson River Valley. The IBM Palisades Conference Center is a state-of-the-art meeting center on 106 acres of land, just north of New York City. Check out the URL. http://www.research.ibm.com/Middleware2000/Location/location.html There will be social events as part of this year's conference, including a Welcome Reception where participants can meet the organizing team and other participants in an informal setting. We will also be providing luncheons and dinner to all attendees on all three days of the conference. Lunch will also be provided to people attending the workshop and to those attending the tutorials. Information on these activities will be available on the conference web page. REGISTRATION ------------ Don't delay and register today for Middleware 2000. It is THE conference to attend. With a great location, on a naturally rich Hudson Valley near culturally rich Manhattan, you can't ask for anything more. We look forward to seeing you there. -------------------------------------------------------------------- Important URL for registration: http://www.regmaster.com/midd2000.html Important Dates for registration: On or before March 2, 2000 : Discount on registration fees After March 2, 2000 or onsite : Regular registration fees ---------------------------------------------------------------------- -------- Guruduth Banavar Publicity Chair, Middleware 2000 Conference From owner-reliable_computing [at] interval [dot] usl.edu Mon Feb 14 02:40:17 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id CAA03253 for reliable_computing-outgoing; Mon, 14 Feb 2000 02:40:17 -0600 (CST) Received: from buffalo.ens-lyon.fr (buffalo.ens-lyon.fr [140.77.1.8]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id CAA03248 for ; Mon, 14 Feb 2000 02:40:13 -0600 (CST) Received: from boukha.ens-lyon.fr (boukha [140.77.11.36]) by buffalo.ens-lyon.fr (8.9.1a/8.9.1) with ESMTP id JAA04450 for ; Mon, 14 Feb 2000 09:40:02 +0100 (MET) Received: (from daumas@localhost) by boukha.ens-lyon.fr (8.9.1a/8.9.1) id JAA20595; Mon, 14 Feb 2000 09:40:01 +0100 (MET) To: reliable_computing [at] interval [dot] usl.edu Subject: Re: Conform to IEEE 754 References: X-Url: http://www.ens-lyon.fr/~daumas Reply-to: Marc.Daumas@ens-lyon.fr From: Marc Daumas Date: 14 Feb 2000 09:40:00 +0100 In-Reply-To: "Nelson H. F. Beebe"'s message of "Fri, 11 Feb 2000 12:51:06 -0700 (MST)" Message-ID: Lines: 26 User-Agent: Gnus/5.070097 (Pterodactyl Gnus v0.97) XEmacs/20.4 (Emerald) MIME-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: 8bit Content-Transfer-Encoding: 8bit Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk - "Nelson H. F. Beebe" a écrit / wrote: > On all systems with partial software implementations, there can be a > severe performance hit to handle underflows (gradual or > flush-to-zero), overflows, and invalid operands. Benchmarkers must be > aware of these issues. It is interesting to know that some systems / applications are shipped with denorm un-activated as this is the case in a network of DEC Alpha 21164 clusters operating at the University of Lyon, France. This situation is difficult to understand since the user assumes that the machine IS IEEE compliant. You can read the result of a Paranoia test on this machine at http://www.ens-lyon.fr/~daumas/SoftArith/moby More traces of UCB tests on other (IEEE compliant) systems / machines are available at http://www.ens-lyon.fr/~daumas/SoftArith/index.html.fr -- Marc Daumas - Charge de recherches au CNRS (LIP - ENS de Lyon) mailto:Marc.Daumas@ENS-Lyon.Fr - http://www.ens-lyon.fr/~daumas ENS de Lyon - 46, allee d'Italie - 69364 Lyon Cedex 07 - FRANCE Phone: (+33) 4 72 72 83 52 - Fax: (+33) 4 72 72 80 80 From owner-reliable_computing [at] interval [dot] usl.edu Tue Feb 15 06:19:41 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id GAA06444 for reliable_computing-outgoing; Tue, 15 Feb 2000 06:19:40 -0600 (CST) Received: from mscs.mu.edu (studsys.mscs.mu.edu [134.48.4.15]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with SMTP id GAA06439 for ; Tue, 15 Feb 2000 06:19:36 -0600 (CST) Received: (qmail 8583 invoked from network); 15 Feb 2000 12:17:16 -0000 Received: from ppp101.csd.mu.edu (HELO mscs.mu.edu) (134.48.24.1) by studsys.mscs.mu.edu with SMTP; 15 Feb 2000 12:17:16 -0000 Message-ID: <38A9441E.2DCEA1B1 [at] mscs [dot] mu.edu> Date: Tue, 15 Feb 2000 06:18:38 -0600 From: George Corliss Organization: Marquette University X-Mailer: Mozilla 4.7 [en] (Win98; U) X-Accept-Language: en MIME-Version: 1.0 To: reliable_computing [at] interval [dot] usl.edu Subject: Re: Conform to IEEE 754 References: Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk The query from Alejandro Casares and responses by Baker Kearfott, Nelson Beebe, and Marc Daumas are archived on an Interval FAQ site at http://studsys.mscs.mu.edu/~georgec/IFAQ/casares1.html Dr. George F. Corliss Dept. Math, Stat, Comp Sci Marquette University P.O. Box 1881 Milwaukee, WI 53201-1881 USA georgec [at] mscs [dot] mu.edu; George.Corliss [at] Marquette [dot] edu http://www.mscs.mu.edu/~georgec/ Office: 414-288-6599; Dept: 288-7375; Fax: 288-5472 From owner-reliable_computing [at] interval [dot] usl.edu Thu Feb 17 21:45:43 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id VAA13758 for reliable_computing-outgoing; Thu, 17 Feb 2000 21:45:43 -0600 (CST) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id VAA13753 for ; Thu, 17 Feb 2000 21:45:40 -0600 (CST) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.9.3+Sun/8.9.1) with SMTP id UAA04858 for ; Thu, 17 Feb 2000 20:45:36 -0700 (MST) Message-Id: <200002180345.UAA04858 [at] cs [dot] utep.edu> Date: Thu, 17 Feb 2000 20:45:37 -0700 (MST) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: interval comp page To: reliable_computing [at] interval [dot] usl.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: IL4TzXWgaVC0BtUnZtqGxw== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear Friends, Our university is upgrading its server; we had some expected minor problems, like email disappering without a trace. Right now, the interval website froze, I cannot change anything there. Systems administrators are working on it. I apologize for the inconvenience. Vladik P.S. Dima Shiriaev has just informed me that some of the links do not work. I tried to find new web addresses of former and current Karlsruhe researchers whose old URL's do not work anymore (see mail below) via Alta Vista, but found only a few. I would appreciate it if all interested members of the mailing list would: * check their URL's as listed on this page and, * if this URL is wrong, send me a correct one (or a new one, if there is none on the page) so that I will be able to update the Interval Rsearchers page. If you happen to know the correct new URL's of other researchers please let me know these URL's too. Thanks. Vladik ------------- Begin Forwarded Message ------------- Date: Thu, 17 Feb 2000 17:03:46 -0800 (PST) From: Dmitri Shiriaev Subject: interval comp page To: vladik [at] cs [dot] utep.edu MIME-version: 1.0 Content-MD5: enUcpQhZITZZcebO1iIiMA== Vladik, On the Interval Researchers page most links to people who used to work in Karlsruhe are dead ones. -- Dima -- ------------- End Forwarded Message ------------- From owner-reliable_computing [at] interval [dot] usl.edu Fri Feb 18 13:37:31 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id NAA15655 for reliable_computing-outgoing; Fri, 18 Feb 2000 13:37:31 -0600 (CST) Received: from cdam.me.washington.edu (cdam.me.washington.edu [128.95.34.158]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id NAA15650 for ; Fri, 18 Feb 2000 13:37:22 -0600 (CST) Received: from localhost (chang@localhost) by cdam.me.washington.edu (8.8.7/8.8.7) with ESMTP id LAA13688 for ; Fri, 18 Feb 2000 11:34:16 -0800 X-Authentication-Warning: cdam.me.washington.edu: chang owned process doing -bs Date: Fri, 18 Feb 2000 11:34:16 -0800 (PST) From: Jack Chang X-Sender: chang [at] cdam [dot] me.washington.edu To: "'reliable_computing'" Subject: compiler optimization mode and rounding Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Hi, I am wondering if compiler optimizatiom mode would affect rounding. It looks like that the egcs(gnu) compiler would overwrites rounding control if optimization is turn on. However, if I specify that no floating point variables should store in registers, the rounding control would be working at least for -O1 and -O2 for the egcs compiler. Nonetheless, the performace would suffer a great deal. For instance, if no optimization, (g++ -O0 ...) or with -ffloat-store flag turned on [RNEAR(3.0/7.0),RNEAR(3.0/7.0)] = [0.42857142857142854764, 0.42857142857142854764] [RDOWN(3.0/7.0),RUP(3.0/7.0)] = [0.42857142857142854764, 0.42857142857142860315] with optimization (g++ -O1 or above) [RNEAR(3.0/7.0),RNEAR(3.0/7.0)] = [0.42857142857142854764, 0.42857142857142854764] [RDOWN(3.0/7.0),RUP(3.0/7.0)] = [0.42857142857142854764, 0.42857142857142854764] Is there any way to fix the problem? Please advise, Thank you very much, Jack Chang From owner-reliable_computing [at] interval [dot] usl.edu Fri Feb 18 14:20:48 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id OAA16054 for reliable_computing-outgoing; Fri, 18 Feb 2000 14:20:48 -0600 (CST) Received: from newman.cs.purdue.edu (0 [at] newman [dot] cs.purdue.edu [128.10.2.6]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id OAA16049 for ; Fri, 18 Feb 2000 14:20:43 -0600 (CST) Received: from cs.purdue.edu (felix.cs.purdue.edu [128.10.9.119]) by newman.cs.purdue.edu (8.8.7/8.8.7/PURDUE_CS-2.0) with ESMTP id PAA08002; Fri, 18 Feb 2000 15:20:34 -0500 (EST) Message-ID: <38ADA992.94EE138B [at] cs [dot] purdue.edu> Date: Fri, 18 Feb 2000 15:20:34 -0500 From: "Christoph M. Hoffmann" X-Mailer: Mozilla 4.7 [en] (WinNT; U) X-Accept-Language: en MIME-Version: 1.0 To: Jack Chang CC: "'reliable_computing'" Subject: Re: compiler optimization mode and rounding References: Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk You need to tell the compiler that certain sections of your code are off limits for rearranging, so that the setting of control words isn't undone. Use "volatile" Jack Chang wrote: > Hi, > > I am wondering if compiler optimizatiom mode would affect rounding. It > looks like that the egcs(gnu) compiler would overwrites rounding control > if optimization is turn on. However, if I specify that no floating point > variables should store in registers, the rounding control would be working > at least for -O1 and -O2 for the egcs compiler. Nonetheless, the > performace would suffer a great deal. For instance, > > if no optimization, (g++ -O0 ...) or with -ffloat-store flag turned on > > [RNEAR(3.0/7.0),RNEAR(3.0/7.0)] = > [0.42857142857142854764, 0.42857142857142854764] > > [RDOWN(3.0/7.0),RUP(3.0/7.0)] = > [0.42857142857142854764, 0.42857142857142860315] > > with optimization (g++ -O1 or above) > > [RNEAR(3.0/7.0),RNEAR(3.0/7.0)] = > [0.42857142857142854764, 0.42857142857142854764] > > [RDOWN(3.0/7.0),RUP(3.0/7.0)] = > [0.42857142857142854764, 0.42857142857142854764] > > Is there any way to fix the problem? Please advise, > > Thank you very much, > > Jack Chang -- ________________________________________________________________ Christoph M. Hoffmann URL: www.cs.purdue.edu/people/cmh Computer Science tel: +1-765-494-6185 Purdue University fax: +1-765-494-0739 West Lafayette, IN 47907-1398 ________________________________________________________________ From owner-reliable_computing [at] interval [dot] usl.edu Mon Feb 21 03:13:27 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id DAA20695 for reliable_computing-outgoing; Mon, 21 Feb 2000 03:13:27 -0600 (CST) Received: from dv.bs.dlr.de (dv.bs.dlr.de [129.247.32.132]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id DAA20690 for ; Mon, 21 Feb 2000 03:13:23 -0600 (CST) Received: from achat.rz.bs.dlr.de (achat.rz.bs.dlr.de [129.247.40.218]) by dv.bs.dlr.de (8.9.3/8.9.3) with ESMTP id KAA44984 for ; Mon, 21 Feb 2000 10:13:20 +0100 Received: from dlr.de (bfk143.fm.bs.dlr.de [129.247.39.76]) by achat.rz.bs.dlr.de (8.9.2/8.9.3) with ESMTP id KAA29106 for ; Mon, 21 Feb 2000 10:13:19 +0100 Message-ID: <38B101AF.5DA483B3 [at] dlr [dot] de> Date: Mon, 21 Feb 2000 10:13:19 +0100 From: Lars Witte X-Mailer: Mozilla 4.7 [de] (WinNT; I) X-Accept-Language: de MIME-Version: 1.0 To: reliable_computing [at] interval [dot] louisiana.edu Subject: Simulation of dynamic systems Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear members, I investigate the effects of parameter uncertainties on flight systems. This led to differential equations with interval valued right hand side. My first simulations have shown some behavior like perpetual motion machines (no wrapping effect). Are there possibilities to supress such behavior or is IA in this case generally the wrong way? Thanks very much in advance. Regards, Lars Witte German Aerospace Center - Institute of Flight Research From owner-reliable_computing [at] interval [dot] usl.edu Mon Feb 21 06:02:18 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id GAA21971 for reliable_computing-outgoing; Mon, 21 Feb 2000 06:02:18 -0600 (CST) Received: from automatix.informatik.uni-wuerzburg.de (root [at] wi2x40 [dot] informatik.uni-wuerzburg.de [132.187.10.40]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id GAA21966 for ; Mon, 21 Feb 2000 06:02:14 -0600 (CST) Received: from informatik.uni-wuerzburg.de (Ac2ea.pppool.de [213.6.194.234]) by automatix.informatik.uni-wuerzburg.de (8.8.8/8.8.8) with ESMTP id NAA05160; Mon, 21 Feb 2000 13:02:07 +0100 Message-ID: <38B129E4.E942A0F3 [at] informatik [dot] uni-wuerzburg.de> Date: Mon, 21 Feb 2000 13:04:52 +0100 From: "=?iso-8859-1?Q?J=FCrgen?= Wolff v. Gudenberg" X-Mailer: Mozilla 4.51 [de] (Win98; I) X-Accept-Language: de MIME-Version: 1.0 To: Jack Chang CC: "'reliable_computing'" Subject: Re: compiler optimization mode and rounding References: Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk The advice to take some regions out of the optimization is ok for the moment, but I like to stimulate a slightly more general discussion of the topic. We found similar problems with optimizing compilers and floating-point arithmetic. 1. Switching of the rounding mode is not considered to have any influence on arithmetic operations, so it is moved out of loops etc. possible solution: ==> compiler writers should learn the dependence between rounding and arithmetic. even better solution: ==> computer architects should learn that rounding belongs to an arithmetic operation and provide us with such combined operations instead of manipulating a control register. 2. Different word-length in register and memory causes problems when comparing to numbers. possible solution ==> I think that compiler writers do their job correctly here, they could issue an explicit warning. Computer architects should not be blamed for providing more precision. So we have to avoid those comparisons or use it consciously. 3. If x == NaN, then x > y and x <= y both deliver false according to IEEE 754. possible solution: ==> compiler writers may not change a floating-point comparison in order to save branch instructions. Juergen WvG Jack Chang schrieb: > Hi, > > I am wondering if compiler optimizatiom mode would affect rounding. It > looks like that the egcs(gnu) compiler would overwrites rounding control > if optimization is turn on. However, if I specify that no floating point > variables should store in registers, the rounding control would be working > at least for -O1 and -O2 for the egcs compiler. Nonetheless, the > performace would suffer a great deal. For instance, > > if no optimization, (g++ -O0 ...) or with -ffloat-store flag turned on > > [RNEAR(3.0/7.0),RNEAR(3.0/7.0)] = > [0.42857142857142854764, 0.42857142857142854764] > > [RDOWN(3.0/7.0),RUP(3.0/7.0)] = > [0.42857142857142854764, 0.42857142857142860315] > > with optimization (g++ -O1 or above) > > [RNEAR(3.0/7.0),RNEAR(3.0/7.0)] = > [0.42857142857142854764, 0.42857142857142854764] > > [RDOWN(3.0/7.0),RUP(3.0/7.0)] = > [0.42857142857142854764, 0.42857142857142854764] > > Is there any way to fix the problem? Please advise, > > Thank you very much, > > Jack Chang -- __o \<, ___________________()/ ()__________________ Prof. Dr. J. Wolff v. Gudenberg wolff [at] informatik [dot] uni-wuerzburg.de Tel. 0931 / 888-6602 Fax. 0931 / 888-6603 URL http://www-info2.informatik.uni-wuerzburg.de/staff/wvg Lehrstuhl fuer Informatik II Universitaet Wuerzburg Am Hubland D-97074 Wuerzburg --------------------------------------------- From owner-reliable_computing [at] interval [dot] usl.edu Mon Feb 21 10:37:04 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA22505 for reliable_computing-outgoing; Mon, 21 Feb 2000 10:37:04 -0600 (CST) Received: from csc-sun.math.utah.edu (root@csc-sun.math.utah.edu [128.110.198.2]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA22500 for ; Mon, 21 Feb 2000 10:37:00 -0600 (CST) Received: from suncore.math.utah.edu (suncore0.math.utah.edu [128.110.198.5]) by csc-sun.math.utah.edu (8.9.3/8.9.3) with ESMTP id JAA10589; Mon, 21 Feb 2000 09:36:57 -0700 (MST) Received: (from beebe@localhost) by suncore.math.utah.edu (8.9.3/8.9.3) id JAA15876; Mon, 21 Feb 2000 09:36:57 -0700 (MST) Date: Mon, 21 Feb 2000 09:36:57 -0700 (MST) From: "Nelson H. F. Beebe" To: Jack Chang Cc: beebe [at] math [dot] utah.edu, "'reliable_computing'" X-US-Mail: "Center for Scientific Computing, Department of Mathematics, 322 INSCC, University of Utah, 155 S 1400 E RM 233, Salt Lake City, UT 84112-0090, USA" X-Telephone: +1 801 581 5254 X-FAX: +1 801 585 1640, +1 801 581 4148 X-URL: http://www.math.utah.edu/~beebe Subject: Re: compiler optimization mode and rounding In-Reply-To: Your message of Fri, 18 Feb 2000 11:34:16 -0800 (PST) Message-ID: Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Jack Chang writes on Fri, 18 Feb 2000 11:34:16 -0800 (PST) about a problem with rounding control in gcc with the -ffloat-store flag. This is a bug; I reported it several weeks ago, and received patches for gcc-2.95.2 that will make it into the next release (date unknown). Jack, if you are interested, mail me privately, and I'll dig them out of my mail archives. Otherwise, you could revert to the gcc 2.7x releases, were -ffloat-store works as expected. ------------------------------------------------------------------------------- - Nelson H. F. Beebe Tel: +1 801 581 5254 - - Center for Scientific Computing FAX: +1 801 585 1640, +1 801 581 4148 - - University of Utah Internet e-mail: beebe [at] math [dot] utah.edu - - Department of Mathematics, 322 INSCC beebe [at] acm [dot] org - - 155 S 1400 E RM 233 beebe [at] ieee [dot] org - - Salt Lake City, UT 84112-0090, USA URL: http://www.math.utah.edu/~beebe - ------------------------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] usl.edu Mon Feb 21 10:40:12 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA22666 for reliable_computing-outgoing; Mon, 21 Feb 2000 10:40:12 -0600 (CST) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA22661 for ; Mon, 21 Feb 2000 10:40:07 -0600 (CST) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.9.3+Sun/8.9.1) with SMTP id JAA08144; Mon, 21 Feb 2000 09:40:02 -0700 (MST) Message-Id: <200002211640.JAA08144 [at] cs [dot] utep.edu> Date: Mon, 21 Feb 2000 09:40:02 -0700 (MST) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: Re: GCD or LCM for fuzzy numbers To: zak [at] NOSPAM [dot] majiq.com Cc: reliable_computing [at] interval [dot] usl.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: Y9XopoiqnT8GEIh4aMIweg== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear Eugene, It looks like your question was sent to the wrong list, because it has nothing to do with fuzzy and all to do with intervals. I am forwarding it to the interval computations mailing list, maybe someone knows a good algorithm for that. It may not happen, because we are normally dealing with intervals of real numbers, and for interval of integers, usually, all the problems become much computationally harder. In my experience, it may help if you elaborate some on the practical problem (if there is any) which you are trying to solve. You may also want to try to consult someone working in number theory, maybe they have a good algorithm already known (or some negative result, like NP-hardness). The only close practical problem which I could think of is a problem useful in celestial mecahnics where we have, e.g., two interval [p1-,p1+] and [p2-,p2+] for periods of two planets, and we are trying to find the ratio p1/p2 where p1 and p2 are from the corresponding intervals which is rational with, say, the smallest possible sum of the absolute values of numerator and denominator (this problem is useful for detecting resonances which behave differently in terms of stability (we had a small paper on that some time ago). Vladik > Date: Mon, 21 Feb 2000 14:22:51 +0100 (MET) > Originator: fuzzy-mail [at] dbai [dot] tuwien.ac.at > From: "Eugene Zak" > To: nafips-l [at] sphinx [dot] Gsu.EDU > Subject: GCD or LCM for fuzzy numbers > X-Listprocessor-Version: 8.2.07 -- ListProc(tm) by CREN > X-Comment: Fuzzy Distribution List > X-Sender: fuzzy-mail [at] dbai [dot] tuwien.ac.at > > I am looking for an efficient algorithm for finding GCD or LCM of fuzzy > numbers. I define a fuzzy number "a" as a=[a_min, a_max], and > GCD(a,b) as the greatest among GCD(x,y) where x belongs to [a_min, a_max] > and y belongs to [b_min, b_max]. > LCM(a,b) is the least among LCM(x,y) accordingly. > Example: > a = [9, 11] > b = [14, 16] > I would like to have these answers: GCD(a,b) = 5 and LCM( a, b) = 30. > A trivial enumeration is not acceptable. > Thanks a lot. > Eugene > zak [at] majiq [dot] com From owner-reliable_computing [at] interval [dot] usl.edu Mon Feb 21 21:55:55 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id VAA23990 for reliable_computing-outgoing; Mon, 21 Feb 2000 21:55:55 -0600 (CST) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id VAA23985 for ; Mon, 21 Feb 2000 21:55:51 -0600 (CST) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.9.3+Sun/8.9.1) with SMTP id UAA11385 for ; Mon, 21 Feb 2000 20:55:45 -0700 (MST) Message-Id: <200002220355.UAA11385 [at] cs [dot] utep.edu> Date: Mon, 21 Feb 2000 20:55:46 -0700 (MST) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: Re: GCD or LCM for fuzzy numbers (clarification) To: reliable_computing [at] interval [dot] usl.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: rM92Gs430MDrEy91fA3uoQ== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk ------------- Begin Forwarded Message ------------- From: Eugene_Zak [at] majiq [dot] com Subject: Re: GCD or LCM for fuzzy numbers To: Vladik Kreinovich Date: Mon, 21 Feb 2000 09:20:31 -0800 X-MIMETrack: Serialize by Router on Notes2/Majiq(Release 5.0.2b |December 16, 1999) at 02/21/2000 09:20:31 AM MIME-Version: 1.0 Hello, Vladik: Many thanks for you detailed letter. As a matter fact I do not insist on integrality of the numbers. I used integers for illustration purpose only. As for the practical problem you have a good example. Mine is not from the sky but from the paper industry. A paper customer may accept a paper roll of a certain diameter but with some say 4% tolerance. So the diameter tolerance bring the "fuzziness". That roll is rewound from a larger roll. It would be nice to rewind an integer number of finished rolls out of a large parent roll. Diameter is certainly being translated to linear footage. The general case of the problem stems from a special equipment- biwinder where rolls of several different diameters can be wound from one parent. I agree that intervals is not a full scale fuzzy number case. I appreciate forwarding my letter to the appropriate news group. Thanks. Eugene Vladik Kreinovich To: zak [at] majiq [dot] com Subject: Re: GCD or LCM for fuzzy numbers 02/21/00 08:43 AM Please respond to Vladik Kreinovich ------------- Begin Forwarded Message ------------- Date: Mon, 21 Feb 2000 09:40:02 -0700 (MST) From: Vladik Kreinovich Subject: Re: GCD or LCM for fuzzy numbers To: zak [at] NOSPAM [dot] majiq.com Cc: reliable_computing [at] interval [dot] usl.edu MIME-Version: 1.0 Content-MD5: Y9XopoiqnT8GEIh4aMIweg== Dear Eugene, It looks like your question was sent to the wrong list, because it has nothing to do with fuzzy and all to do with intervals. I am forwarding it to the interval computations mailing list, maybe someone knows a good algorithm for that. It may not happen, because we are normally dealing with intervals of real numbers, and for interval of integers, usually, all the problems become much computationally harder. In my experience, it may help if you elaborate some on the practical problem (if there is any) which you are trying to solve. You may also want to try to consult someone working in number theory, maybe they have a good algorithm already known (or some negative result, like NP-hardness). The only close practical problem which I could think of is a problem useful in celestial mecahnics where we have, e.g., two interval [p1-,p1+] and [p2-,p2+] for periods of two planets, and we are trying to find the ratio p1/p2 where p1 and p2 are from the corresponding intervals which is rational with, say, the smallest possible sum of the absolute values of numerator and denominator (this problem is useful for detecting resonances which behave differently in terms of stability (we had a small paper on that some time ago). Vladik > Date: Mon, 21 Feb 2000 14:22:51 +0100 (MET) > Originator: fuzzy-mail [at] dbai [dot] tuwien.ac.at > From: "Eugene Zak" > To: nafips-l [at] sphinx [dot] Gsu.EDU > Subject: GCD or LCM for fuzzy numbers > X-Listprocessor-Version: 8.2.07 -- ListProc(tm) by CREN > X-Comment: Fuzzy Distribution List > X-Sender: fuzzy-mail [at] dbai [dot] tuwien.ac.at > > I am looking for an efficient algorithm for finding GCD or LCM of fuzzy > numbers. I define a fuzzy number "a" as a=[a_min, a_max], and > GCD(a,b) as the greatest among GCD(x,y) where x belongs to [a_min, a_max] > and y belongs to [b_min, b_max]. > LCM(a,b) is the least among LCM(x,y) accordingly. > Example: > a = [9, 11] > b = [14, 16] > I would like to have these answers: GCD(a,b) = 5 and LCM( a, b) = 30. > A trivial enumeration is not acceptable. > Thanks a lot. > Eugene > zak [at] majiq [dot] com ------------- End Forwarded Message ------------- ------------- End Forwarded Message ------------- From owner-reliable_computing [at] interval [dot] usl.edu Tue Feb 22 17:43:14 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id RAA26335 for reliable_computing-outgoing; Tue, 22 Feb 2000 17:43:14 -0600 (CST) Received: from pompeii.ise (troy.eiffel.com [198.68.147.5]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id RAA26330 for ; Tue, 22 Feb 2000 17:43:10 -0600 (CST) Received: from lannion.ise ([10.0.10.105]) by pompeii.ise with smtp (Exim 3.02 #2) id 12NOwr-0005LB-00 for reliable_computing [at] interval [dot] usl.edu; Tue, 22 Feb 2000 15:42:33 -0800 Received: by lannion.ise (SMI-8.6/SMI-SVR4) id PAA13153; Tue, 22 Feb 2000 15:42:41 -0800 Date: Tue, 22 Feb 2000 15:42:41 -0800 Message-Id: <200002222342.PAA13153 [at] lannion [dot] ise> From: "TOOLS Conferences" To: reliable_computing [at] interval [dot] usl.edu Subject: TOOLS USA 2000 Call for contributions Reply-to: announce [at] tools [dot] com Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear Colleague: This is the abbreviated call for contributions for TOOLS USA 2000. The full information is at http://www.tools-conferences.com/usa Please post or forward this information to any other colleague who think might be interested. With best regards, -- TOOLS Conference organization ************************************************************************* TOOLS USA 2000 "Software Serving Society" Santa Barbara, California July 30 - August 3, 2000 http://www.toolsconferences.com/usa CALL FOR CONTRIBUTIONS (deadline 10 March 2000) TOOLS is the major international conference series devoted to applications object technology, component technology and other advanced approaches to software development. TOOLS USA 2000 will be held in Santa Barbara, CA at the Fess Parker Double Tree Resort, one of the most beautiful resorts on the West Coast and will continue the commitment to excellence of earlier TOOLS conferences in Europe, Australia, Asia and the USA since 1989. The proceedings will be published world-wide by the IEEE Computer Society. PAPERS ------ TOOLS USA 2000 is now soliciting papers on all aspects of object and component technology. All submitted papers will be refereed and assessed for technical quality and usefulness to practitioners and applied researchers. TOOLS USA particularly welcomes papers that present general findings based upon industrial experience. Such papers will be judged by the quality of their contribution to industrial best-practice. TUTORIALS, WORKSHOPS AND PANELS ------------------------------- Tutorials, workshops, and panels form an important part of the TOOLS conferences. TOOLS USA 2000 is welcoming proposals for tutorials, workshops and panels on topics related to the theme of the conference. FOR MORE DETAILS AND REGISTRATION INFORMATION PLEASE VISIT THE CONFERENCE WEBSITE AT http://www.tools-conferences.com/usa From owner-reliable_computing [at] interval [dot] usl.edu Wed Feb 23 03:13:06 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id DAA27125 for reliable_computing-outgoing; Wed, 23 Feb 2000 03:13:06 -0600 (CST) Received: from feu.irisa.fr (feu.irisa.fr [131.254.60.80]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id DAA27120 for ; Wed, 23 Feb 2000 03:13:02 -0600 (CST) Received: from irisa.fr (partance.irisa.fr [131.254.21.57]) by feu.irisa.fr (8.9.3/8.9.3) with ESMTP id KAA06098 for ; Wed, 23 Feb 2000 10:12:54 +0100 (MET) Message-ID: <38B3A492.EE803271 [at] irisa [dot] fr> Date: Wed, 23 Feb 2000 10:12:50 +0100 From: Bernard Philippe X-Mailer: Mozilla 4.03 [fr] (WinNT; I) MIME-Version: 1.0 To: "reliable_computing [at] interval [dot] usl.edu" Subject: Research position at INRIA/IRISA (France) Content-Type: multipart/mixed; boundary="------------93EEF3649168F6420E956E55" Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Il s'agit d'un message multivolet au format MIME. --------------93EEF3649168F6420E956E55 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit RESEARCH POSITION AT INRIA / IRISA INRIA is an internationally recognized research institute in Computer Science and Automation, funded by the French government. INRIA seeks outstanding candidates who have completed a Ph.D. (or equivalent) in Computer Science, Signal and Image Processing, or Applied Mathematics. Government positions are open at the level "Charge de Recherche" (Research Assistant) to French as well as non-French applicants. See the announcement : http://www.inria.fr/Trav/Concours2000/conc2000a-eng.html . The selection of the candidates is organized in each INRIA center. At the INRIA center of Rennes (IRISA), three positions are open. The Aladin group of research (see http://www.irisa.fr/aladin ) seeks for a candidate specialized in Scientific Computing (solving methods for linear algebra or differential equation ; numerical reliability, parallelism) Interested persons should contact as soon as possible : Jocelyne Erhel, (email : Jocelyne.Erhel [at] irisa [dot] fr ) and no later than Monday, 6th of March 2000. For further information : - on IRISA, see : http://www.irisa.fr/accueil/index_uk.htm - on INRIA, see : http://www.inria.fr/welcome-eng.html - on the city of Rennes, see : http://www.rennestelecom.com/index_map.htm --------------93EEF3649168F6420E956E55 Content-Type: text/x-vcard; charset=us-ascii; name="vcard.vcf" Content-Transfer-Encoding: 7bit Content-Description: Carte pour Bernard PHILIPPE Content-Disposition: attachment; filename="vcard.vcf" begin: vcard fn: Bernard PHILIPPE n: PHILIPPE;Bernard org: INRIA/IRISA adr: IRISA;;Campus de Beaulieu;35042 RENNES Cedex;;;FRANCE email;internet: Bernard.Philippe [at] irisa [dot] fr title: Directeur de recherche tel;work: +33 2 99 84 73 38 tel;fax: +33 2 99 84 25 27 tel;home: +33 2 99 59 41 91 x-mozilla-cpt: ;0 x-mozilla-html: FALSE version: 2.1 end: vcard --------------93EEF3649168F6420E956E55-- From owner-reliable_computing [at] interval [dot] usl.edu Thu Feb 24 13:33:45 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id NAA01174 for reliable_computing-outgoing; Thu, 24 Feb 2000 13:33:45 -0600 (CST) Received: from pilot020.cl.msu.edu (pilot020.cl.msu.edu [35.9.5.120]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id NAA01167 for ; Thu, 24 Feb 2000 13:33:27 -0600 (CST) Received: from berz (berz.user.msu.edu [35.10.52.114]) by pilot020.cl.msu.edu (8.9.1a/8.9.1) with SMTP id OAA18416; Thu, 24 Feb 2000 14:33:01 -0500 From: "Martin Berz" To: "Lars Witte" , Subject: RE: Simulation of dynamic systems Date: Thu, 24 Feb 2000 14:31:56 -0500 Message-ID: MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit X-Priority: 3 (Normal) X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook IMO, Build 9.0.2416 (9.0.2910.0) In-Reply-To: <38B101AF.5DA483B3 [at] dlr [dot] de> Importance: Normal X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2314.1300 Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear Dr. Witte, what you are describing sounds very similar to ODEs we are studying, where we usually carry along between 4 and 10 parameters. The verified ODE integrators we have developed can carry along the parameter dependence without inflation of the predicted boxes that you would get with other approaches as soon as the parameter ranges are significant. It also avoids the wrapping effect due to other uncertainties and re-packaging of the boxes. You may want to take a look at the paper Verified Integration of ODEs and Flows using Differential Algebraic Methods on High-Order Taylor Models, M. Berz and K. Makino, Reliable Computing, 4, 361-369 (1998), which is available at http://bt.nscl.msu.edu/papers-cgi/display.pl?name=rdaint. Feel free to contact us with any additional questions; perhaps it would also be useful to have a little more detail about your actual problem under consideration. Sincerely, Martin Berz > -----Original Message----- > From: owner-reliable_computing [at] interval [dot] usl.edu > [mailto:owner-reliable_computing [at] interval [dot] usl.edu]On Behalf Of Lars > Witte > Sent: Monday, February 21, 2000 4:13 AM > To: reliable_computing [at] interval [dot] louisiana.edu > Subject: Simulation of dynamic systems > > > Dear members, > I investigate the effects of parameter uncertainties on flight systems. > This led to differential equations with interval valued right hand side. > My first simulations have shown some behavior like perpetual motion > machines (no wrapping effect). > Are there possibilities to supress such behavior or is IA in this case > generally the wrong way? > Thanks very much in advance. Regards, > > Lars Witte > German Aerospace Center - Institute of Flight Research > > From owner-reliable_computing [at] interval [dot] usl.edu Fri Feb 25 03:14:48 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id DAA02352 for reliable_computing-outgoing; Fri, 25 Feb 2000 03:14:48 -0600 (CST) Received: from genie.eecs.lehigh.edu (genie.eecs.lehigh.edu [128.180.98.9]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id DAA02347 for ; Fri, 25 Feb 2000 03:14:44 -0600 (CST) Received: from pamir.eecs.lehigh.edu (pamir [128.180.98.184]) by genie.eecs.lehigh.edu (8.8.5/8.8.5) with ESMTP id XAA07958 for ; Thu, 24 Feb 2000 23:04:03 -0500 (EST) From: ASAP User Received: (from asap@localhost) by pamir.eecs.lehigh.edu (8.8.5/8.8.5) id XAA00402 for asap-announce; Thu, 24 Feb 2000 23:04:01 -0500 (EST) Date: Thu, 24 Feb 2000 23:04:01 -0500 (EST) Message-Id: <200002250404.XAA00402 [at] pamir [dot] eecs.lehigh.edu> To: asap-announce [at] EECS [dot] Lehigh.EDU Subject: ASAP 2000 Deadline Extension Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear colleagues, The deadline for paper submissions for ASAP 2000 has been extended to March 13, 2000. You can submit your paper and cover page via email to asap [at] eecs [dot] lehigh.edu any time between now and March 13, 2000. The revised call for papers is given below. If you have any questions about the conference or paper submissions, please send email to asap [at] eecs [dot] lehigh.edu or mschulte [at] eecs [dot] lehigh.edu. Best regards, Mike Schulte ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ ASAP 2000 CALL FOR PAPERS ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ 12th International Conference on Application-specific Systems, Architectures and Processors Boston, Massachusetts Revised Dates and Deadlines Submission: March 13, 2000 Acceptance notification: April 13, 2000 Conference: July 10-12, 2000 Topics: The conference will cover the theory and practice of application- specific computing systems. Of particular interest are contributions that either achieve large performance gains, present formal methods for the specification, design and evaluation, analyze technology dependencies and the integration of hardware and software components, or describe and evaluate fabricated systems. Areas for application-specific computing systems are many and varied. Some sample areas include information systems, signal and image processing, multimedia systems, high-speed networks, compression, cryptography. Aspects of application-specific computing systems that are of interest include, but are not limited to: * Application-specific architectures: special purpose designs, design methodology, CAD tools, fault tolerance strategies, specification and interfaces, hardware/software codesign * Application-specific processors: digital signal processing, computer arithmetic, configurable/custom computing, implementation methodology & rapid prototyping, new technologies, fine-grain parallelism * Application-specific systems: network computing, special-purpose systems for exotic applications, performance evaluation, standard software objects, languages, compilers, operating systems, hardware/software integration The conference will feature a keynote speech, paper presentations, and a poster session. The proceedings will be published by IEEE Computer Society Press. Information for authors: Your paper should be a maximum of 5000 words. A PDF version of the complete paper and a separate cover page text file, with the following information * paper title; * paper abstract; * complete name, address, telephone, fax and email of each author; * author which is responsible for correspondence; * which of the conference areas is most relevant to your paper should be submitted via email to asap [at] eecs [dot] lehigh.edu. For further information about the conference, please see the conference web page at http://www.eecs.lehigh.edu/ASAP or send email to asap [at] eecs [dot] lehigh.edu. General Chair: Earl Swartzlander e.swartzlander [at] compmail [dot] com Program Chairs: Graham Jullien jullien [at] uwindsor [dot] ca Michael Schulte mschulte [at] eecs [dot] lehigh.edu Program committee: Magdy Bayoumi, Wayne Burleson, Peter Capello, Liang-Gee Chen, Ed Deprettere, Milos Ercegovac, Gerhard Fettweis, Jose Fortes, Sayfe Kiaei, Israel Koren, S. Y. Kung, Tomas Lang, Wayne Luk, John McCanny, Jean-Michel Muller, Takao Nishitani, Tobias Noll, Peter Pirsch, Patrice Quinton, Sanjay Rajopadhye, Vwani Roychowdhury, Valerie Taylor, Juergen Teich, Lothar Thiele, Mateo Valero, Benjamin Wah, Doran Wilde, Roger Woods, Kung Yao, Pen Yew. From owner-reliable_computing [at] interval [dot] usl.edu Sat Feb 26 11:34:58 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id LAA04570 for reliable_computing-outgoing; Sat, 26 Feb 2000 11:34:58 -0600 (CST) Received: from kleene.math.wisc.edu (kleene.math.wisc.edu [144.92.166.90]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id LAA04565 for ; Sat, 26 Feb 2000 11:34:45 -0600 (CST) Received: from forelli.math.wisc.edu (forelli.math.wisc.edu [144.92.166.70]) by kleene.math.wisc.edu (8.9.3/8.9.3) with SMTP id LAA06404; Sat, 26 Feb 2000 11:30:04 -0600 (CST) Date: Sat, 26 Feb 2000 11:51:51 -0600 (CST) From: Hans Schneider To: NETS -- at-net , "Hershkowitz, Danny -- Hershkowitz Daniel" , Danny Hershkowitz , E-LETTER , "na.digest" , ipnet-digest [at] math [dot] msu.edu, wim@bell-labs.com, hjt [at] eos [dot] ncsu.edu, vkm [at] eedsp [dot] gatech.edu, reliable_computing [at] interval [dot] louisiana.edu cc: Arjen Sevenster , Claudette Daalen van , Aad Thoen , Editors of 4th LSC issue -- Vincent Blondel , Diederich Hinrichsen , "Rosenthal, Joachim -- Joachim Rosenthal" , rosen [at] euler [dot] math.nd.edu, Paul Vandooren , Sally Rear Subject: LAA announcement of a special issue Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Content-Transfer-Encoding: 8bit X-MIME-Autoconverted: from QUOTED-PRINTABLE to 8bit by interval.usl.edu id LAA04566 Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk ------------------------------------------------------------------------------ Hans Schneider hans [at] math [dot] wisc.edu. Department of Mathematics 608-262-1402 (Work) Van Vleck Hall 608-271-7252 (Home) 480 Lincoln Drive 608-263-8891 (Work FAX) University of Wisconsin-Madison 608-271-8477 (Home FAX) Madison WI 53706 USA http://www.math.wisc.edu/~hans (URL) ------------------------------------------------------------------------------ LINEAR ALGEBRA AND ITS APPLICATIONS CALL FOR PAPERS: Fourth Special Issue on Linear Systems and Control. In the past, LAA has published three special issues devoted to the field of Linear Systems and Control: 1983 (vol. 50), 1989 (vols. 122-124) and 1994 (vols. 203-204). More than six years after the publication of the last special issue, it is time to take stock of recent and current interactions between Linear Algebra and Systems Theory. The cross fertilization between these two fields has been very fruitful in the past. While linear algebraic methods have been instrumental for much of the development of linear systems theory, many system theoretic concepts and constructions are now part of the body of linear algebra. Today systems theory is a place where methods from many different parts of mathematics are combined. As a result linear systems theory has become a rich source of linear algebraic problems. More recently, new paradigms, new problems and areas of application have appeared on the scene: the behavioural approach, coding theory, distance problems and parameter uncertainty, the dynamic systems approach to algorithms, computational complexity issues in systems theory and discrete event systems. These important subject areas have enriched linear systems theory and will influence the future development of linear algebra, too. We hope that the upcoming issue will further this process and we encourage all authors working in these areas to submit their contributions. As in previous issues, this one will be open for all papers with significant new results in Systems and Control Theory where either linear algebraic methods play an important role or new tools and problems of linear algebraic nature are presented. Also survey papers are very welcome which illustrate specific areas where the interaction of Systems Theory and Linear Algebra has been particularly successful. Papers must meet the publication standards of Linear Algebra and Its Applications and will be refereed in the usual way. Areas and topics of interest for this special issue include: - Structure theory of linear systems and system families - Stability theory - Distance problems and analysis of uncertain systems - Methods of robust control - Approximation and interpolation problems arising in systems theory - Geometric control theory and geometry of linear systems - Linear behaviors - Multidimensional systems and systems over rings - Module theoretic techniques in system theory - Coding theory with connections to systems theory - Algorithms for linear systems - Numerical issues in linear systems theory - Computational complexity in linear algebra and systems theory - Discrete event systems The deadline for submission of papers is 31 December 2000, and the special issue is expected to be published in the first half of 2002. Papers should be sent to any of its special editors: Vincent Blondel Department of Mathematical Engineering, CESAME Université catholique de Louvain Avenue Georges Lemaitre, 4 B-1348 Louvain-la-Neuve Belgium E-mail: blondel [at] inma [dot] ucl.ac.be Diederich Hinrichsen Institut fuer Dynamische Systeme, Universitaet Bremen Postfach 330 440 D 28334 Bremen Germany E-mail: dh [at] math [dot] uni-bremen.de Joachim Rosenthal Department of Mathematics University of Notre Dame Notre Dame, IN 46556-5683 U.S.A. E-mail: rosen [at] nd [dot] edu Paul Van Dooren Department of Mathematical Engineering, CESAME Université catholique de Louvain Avenue Georges Lemaitre, 4 B-1348 Louvain-la-Neuve Belgium E-mail: vdooren [at] anma [dot] ucl.ac.be From owner-reliable_computing [at] interval [dot] usl.edu Sun Feb 27 19:07:16 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id TAA06049 for reliable_computing-outgoing; Sun, 27 Feb 2000 19:07:16 -0600 (CST) Received: from mscs.mu.edu (studsys.mscs.mu.edu [134.48.4.15]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with SMTP id TAA06044 for ; Sun, 27 Feb 2000 19:07:13 -0600 (CST) Received: (qmail 16454 invoked from network); 28 Feb 2000 01:04:50 -0000 Received: from ppp101.csd.mu.edu (HELO mscs.mu.edu) (134.48.24.1) by studsys.mscs.mu.edu with SMTP; 28 Feb 2000 01:04:50 -0000 Message-ID: <38B9CA0A.C5ADDB4 [at] mscs [dot] mu.edu> Date: Sun, 27 Feb 2000 19:06:18 -0600 From: George Corliss Organization: Marquette University X-Mailer: Mozilla 4.7 [en] (Win98; U) X-Accept-Language: en MIME-Version: 1.0 To: zak [at] NOSPAM [dot] majiq.com CC: Vladik Kreinovich , reliable_computing [at] interval [dot] usl.edu Subject: Re: GCD or LCM for fuzzy numbers References: <200002211640.JAA08144 [at] cs [dot] utep.edu> Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear Eugene, > > I am looking for an efficient algorithm for finding GCD or LCM of fuzzy > > numbers. I define a fuzzy number "a" as a=[a_min, a_max], and > > GCD(a,b) as the greatest among GCD(x,y) where x belongs to [a_min, a_max] > > and y belongs to [b_min, b_max]. > > LCM(a,b) is the least among LCM(x,y) accordingly. > > Example: > > a = [9, 11] > > b = [14, 16] > > I would like to have these answers: GCD(a,b) = 5 and LCM( a, b) = 30. > > A trivial enumeration is not acceptable. > > Thanks a lot. In a paper: Chin1998a: Paulina Chin, Robert M. Corless, and George F. Corliss, Optimization Strategies for the Floating-Point GCD, in Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation (ISAAC '98), Oliver Gloor (ed.), ACM Press, New York, 1998, pp. 228-235. [ BibTex | 1998a.ps.gz (Preprint, 52K) ] See http://www.mscs.mu.edu/~georgec/Pubs/chapt.html#1998a we attacked a vaguely similar problem. The idea in your context is to formulate the question as an optimization problem min -GCD subject to GCD * p = a in [a] GCD * q = b in [b] If your GCD is an integer, this is an integer programming problem. a in [a] and b in [b] are probably expressed to your integer programming software as bound constraints. Actually, I guess this is an integer LP problem? I'm an interval person, so I'd probably use an interval tool, GlobSol from Baker Kearfott, but that is almost surely overkill. Surely a point integer LP solver will do fine. [Responses to this and other questions posed to this mailing list are compiled as Interval Frequently Asked Questions at http://www.mscs.mu.edu/~georgec/IFAQ/ ] Dr. George F. Corliss Dept. Math, Stat, Comp Sci Marquette University P.O. Box 1881 Milwaukee, WI 53201-1881 USA georgec [at] mscs [dot] mu.edu; George.Corliss [at] Marquette [dot] edu http://www.mscs.mu.edu/~georgec/ Office: 414-288-6599; Dept: 288-7375; Fax: 288-5472 From owner-reliable_computing [at] interval [dot] usl.edu Mon Feb 28 05:48:39 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id FAA06792 for reliable_computing-outgoing; Mon, 28 Feb 2000 05:48:39 -0600 (CST) Received: from ns0.eris.dera.gov.uk (ns0.eris.dera.gov.uk [128.98.1.1]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with SMTP id FAA06787 for ; Mon, 28 Feb 2000 05:48:29 -0600 (CST) Received: (qmail 31976 invoked from network); 28 Feb 2000 11:48:20 -0000 Received: from unknown (HELO mail-relay.eris.dera.gov.uk) (128.98.2.7) by ns0.eris.dera.gov.uk with SMTP; 28 Feb 2000 11:48:20 -0000 Received: (qmail 30839 invoked from network); 28 Feb 2000 11:48:20 -0000 Received: from boole.eris.dera.gov.uk (HELO eris.dera.gov.uk) (128.98.7.14) by mail-relay.eris.dera.gov.uk with SMTP; 28 Feb 2000 11:48:20 -0000 Message-ID: <38BA5EFB.7B08B6B0 [at] eris [dot] dera.gov.uk> Date: Mon, 28 Feb 2000 11:41:47 +0000 From: "Colin O'Halloran" X-Mailer: Mozilla 4.6 [en-gb] (Win95; I) X-Accept-Language: en-GB,en,en-* MIME-Version: 1.0 To: facs [at] lboro [dot] ac.uk, fm-info [at] air16 [dot] larc.nasa.gov, formal-methods [at] cs [dot] uidaho.edu, hise-safety-critical [at] minster [dot] cs.york.ac.uk, larc-swe [at] larc [dot] nasa.gov, reliable_computing [at] interval [dot] usl.edu, seworld [at] cs [dot] colorado.edu, system-safety [at] listserv [dot] gsfc.nasa.gov, vdm-forum [at] mailbase [dot] ac.uk, zeves [at] ora [dot] on.ca, zforum [at] prg [dot] ox.ac.uk, sag [at] eris [dot] dera.gov.uk Subject: Call for papers for Automated Software Engineering Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Apologies for multiple copies Automated Software Engineering --- ASE'00 15th IEEE International Conference September 11--15, 2000, Grenoble, France Abstracts due: March 24, 2000; Papers due: March 31, 2000 Latest information: http://sigart.acm.org/Conferences/ase/ Call for Papers The IEEE International Conference on Automated Software Engineering brings together researchers and practitioners to share ideas on the foundations, techniques, tools, and applications of automated software engineering technology. Both automatic systems and systems that support and cooperate with people are within the scope of the conference, as are models of software and software engineering activities. ASE'00 encourages contributions describing basic research, novel applications, and experience relevant to automating software engineering activities. Solicited topics include, but are not limited to: - Automated software specification - Automated software design and synthesis - Category-theoretic approaches - Computer-supported cooperative work - Domain modeling - Knowledge acquisition - Maintenance and evolution - Process and workflow management - Program understanding - Re-engineering - Requirements engineering - Reuse - Software architectures - Testing - Tutoring, help, documentation systems - Human computer interaction - Verification and validation The IEEE International Conference on Automated Software Engineering was formerly known as the Knowledge-Based Software Engineering Conference. In conjunction with the name change three years ago, the conference expanded to encourage worldwide participation and to reach other scientific communities concerned with formal methods, partial evaluation, process support, human-computer interface support, requirements engineering, reverse engineering, testing, or verification & validation. Accepted papers will be published in the conference proceedings, at IEEE Computer Society Press. In addition, several of the highest quality papers will be selected for a special issue of the Journal of Automated Software Engineering (Kluwer). ASE'00 will also include invited talks, tutorials, panel discussions, a doctoral symposium, and project demonstrations, for which separate calls for participation will be issued. Papers should not exceed 6000 words, with full-page figures counting as 300 words. Papers that exceed the length restriction will not be reviewed. Papers will be reviewed by at least three program committee members. All papers, especially application papers and experience reports, should clearly identify their novel contributions. See http://sigart.acm.org/Conferences/ase/SubmissionPointers.html for guidelines. All papers should be submitted electronically to ase00 [at] ittc [dot] ukans.edu in PostScript, MS Word, or PDF format, on or before March 31, 2000. In addition, a single hard copy should be mailed to Perry Alexander at the address below; it serves as a backup should printing problems occur, and it may arrive later than the electronic submission date. To expedite the review process, each paper's title, authors, abstract, keywords, and contact author's email address should be submitted by March 24, 2000 through a link at http://sigart.acm.org/Conferences/ase/. Use the returned paper number to identify your paper when submitting it. All subsequent communications will take place via email to the contact author. General Chair Yves Ledru IMAG Grenoble, France Yves.Ledru [at] imag [dot] fr Program Co-Chairs Perry Alexander ITTC / The Univ. of Kansas 2291 Irving Hill Rd Lawrence, KS 66044-7321 Tel +1 785 864-7741 palexand [at] ukans [dot] edu Pierre Flener Dept of Information Science Uppsala University, Box 513 S-751 20 Uppsala, Sweden Tel +46 18 471-1028 Pierre.Flener [at] dis [dot] uu.se Program Committee: Perry Alexander, USA Daniel Berry, Israel Yves Deville, Belgium Steve Easterbrook, USA Wolfgang Emmerich, UK Martin Feather, USA Steve Fickas, USA Bernd Fischer, USA Pierre Flener, Sweden Alfonso Fuggetta, Italy Gerry Gannod, USA Michael Goedicke, Germany Joseph Goguen, USA Ian Green, UK John Grundy, New Zealand Robert Hall, USA Mehdi Harandi, USA Mats Heimdahl, USA Scott Henninger, USA Bernd Kraemer, Germany Kung-Kiu Lau, UK Baudouin Le Charlier, Belgium Yves Ledru, France Julio Leite, Brazil Mike Lowry, USA Tom Maibaum, UK Neil Maiden, UK Renaud Marlet, France Mihhail Matskin, Norway Ali Mili, USA Bashar Nuseibeh, UK Colin O'Halloran, UK Charles Pecheur, USA John Penix, USA Alex Quilici, USA David Redmiles, USA Arthur Reyes, USA Debra Richardson, USA Julian Richardson, UK Spencer Rugaber, USA Conor Ryan, Ireland Houari Sahraoui, Canada Akiyoshi Sato, Japan Dorothy Setliff, Australia Frank Shipman, USA Doug Smith, USA Kurt Stirewalt, USA Enn Tyugu, Sweden Jeff van Baalen, USA Richard Waldinger, USA Virginie Wiels, France Chris Welty, USA David Wile, USA From owner-reliable_computing [at] interval [dot] usl.edu Tue Feb 29 08:38:05 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id IAA09403 for reliable_computing-outgoing; Tue, 29 Feb 2000 08:38:04 -0600 (CST) Received: from e4.ny.us.ibm.com (e4.ny.us.ibm.com [32.97.182.104]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id IAA09398 for ; Tue, 29 Feb 2000 08:38:02 -0600 (CST) From: banavar [at] us [dot] ibm.com Received: from northrelay02.pok.ibm.com (northrelay02.pok.ibm.com [9.117.200.22]) by e4.ny.us.ibm.com (8.9.3/8.9.3) with ESMTP id JAA131644; Tue, 29 Feb 2000 09:35:53 -0500 Received: from D51MTA03.pok.ibm.com (d51mta03.pok.ibm.com [9.117.200.31]) by northrelay02.pok.ibm.com (8.8.8m2/NCO v2.06) with SMTP id JAA107038; Tue, 29 Feb 2000 09:35:54 -0500 Received: by D51MTA03.pok.ibm.com(Lotus SMTP MTA v4.6.5 (863.2 5-20-1999)) id 85256894.00502050 ; Tue, 29 Feb 2000 09:35:11 -0500 X-Lotus-FromDomain: IBMUS To: MW2K_Publicity [at] us [dot] ibm.com Message-ID: <85256894.004FDEA5.00 [at] D51MTA03 [dot] pok.ibm.com> Date: Tue, 29 Feb 2000 01:02:45 -0500 Subject: Middleware 2000 early registration deadline is March 2nd Mime-Version: 1.0 Content-type: text/plain; charset=us-ascii Content-Disposition: inline Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Please register by March 2nd and save! =============================================================== CALL FOR PARTICIPATION Middleware 2000 The International Conference on Distributed Systems Platforms and Open Distributed Processing April 4 - 8, 2000 Hudson Valley (near New York City) USA http://www.research.ibm.com/Middleware2000 The advance program is available on our web site. We invite you to register now to join us for this premier conference in April. Sponsored by IFIP TC6 WG6.1 and ACM Supported by Agilent Technologies and IBM CONFERENCE BACKGROUND --------------------- Middleware 2000 will be the premier conference on distributed systems platforms and open distributed processing in the opening year of the new millenium. The conference is a synthesis of the major conferences and workshops in this area into a single international event. Middleware 2000 follows in the footsteps of the extremely successful, inaugural Middleware '98 Conference held in the Lake District of the UK in September, 1998. The focus of Middleware 2000 is on the design, implementation, deployment and evaluation of distributed systems platforms and architectures for future networked environments. Of particular interest is the application of both new and existing architectures and platforms (such as RM-ODP, CORBA, RMI and DCOM) in environments which may include public and private networks, overlayed wired and wireless technologies, IPv6 and IP multicast, multimedia and real-time information and an increasing volume of WWW and Java traffic. SOME CONFERENCE HIGHLIGHTS -------------------------- Middleware 2000 is a single-track conference consisting of seven paper sessions, two keynote addresses, and a work-in-progress session. There will also be posters presented during breaks. 1) The seven paper sessions are on Messaging, Caching, Reflection, Indirection, Quality of Service, Transactions and Workflow, and Composition. The details of the paper program is at: http://www.research.ibm.com/Middleware2000/Program/program.html 2) We are offering four tutorials by leading practitioners: April 4 AM Tutorials: T1. "Scalability Issues in CORBA-based Systems" Steve Vinoski, IONA Technologies T2. "Designing with Patterns" John Vlissides, IBM TJ Watson Research Center April 4 PM Tutorials: T3. "Middleware for Programmable Networks" Andrew Campbell, Columbia University T4. "Applying Patterns for Concurrent and Distributed Components" Frank Buschman, Siemens ZT More information on the tutorials is at: http://www.research.ibm.com/Middleware2000/Tutorials/tutorials.html 3. We are organizing a workshop on Reflective Middleware (RM2000) that will be co-located with Middleware 2000. Information on the RM2000 workshop can be found at: http://www.comp.lancs.ac.uk/computing/RM2000/ 4. We will have two keynote addresses by visionaries in the field of middleware: Ken Birman, Professor at Cornell University, and Jim Waldo of Sun Microsystems. 5. We will have a work-in-progress paper session and multiple poster sessions. Information on the WiP papers and posters will be available at: http://www.research.ibm.com/Middleware2000 LOCATION AND ACTIVITIES ----------------------- The conference will be held at the beautiful Hudson River Valley. The IBM Palisades Conference Center is a state-of-the-art meeting center on 106 acres of land, just north of New York City. Check out the URL. http://www.research.ibm.com/Middleware2000/Location/location.html There will be social events as part of this year's conference, including a Welcome Reception where participants can meet the organizing team and other participants in an informal setting. We will also be providing luncheons and dinner to all attendees on all days of the conference, workshop and tutorials. Information on these activities will be available on the conference web page. REGISTRATION ------------ Don't delay and register today for Middleware 2000. It is THE conference to attend. With a great location, on a naturally rich Hudson Valley near culturally rich Manhattan, you can't ask for anything more. We look forward to seeing you there. -------------------------------------------------------------------- Important URL for registration: http://www.regmaster.com/midd2000.html Important Dates for registration: On or before March 2, 2000 : Discount on registration fees After March 2, 2000 or onsite : Regular registration fees ---------------------------------------------------------------------- -------- Guruduth Banavar Publicity Chair, Middleware 2000 Conference From owner-reliable_computing [at] interval [dot] usl.edu Tue Feb 29 14:19:22 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id OAA10261 for reliable_computing-outgoing; Tue, 29 Feb 2000 14:19:21 -0600 (CST) Received: from dragon.relcom.ru (dragon.relcom.ru [193.125.152.57]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id OAA10256 for ; Tue, 29 Feb 2000 14:19:14 -0600 (CST) Received: from uucp by dragon.relcom.ru with UUCP id 12Pt7o-000GZq-00 for reliable_computing [at] interval [dot] usl.edu; Tue, 29 Feb 2000 23:20:08 +0300 Received: by DRAGON.relcom.ru (UUMAIL/2.0); Tue, 29 Feb 0 23:20:08 -0300 Received: by Relay1.relcom.ru (UUMAIL/2.0); Tue, 29 Feb 0 23:16:55 +0300 Received: by globlab.msk.su (UUPC/@ v5.09gamma, 14Mar93); Tue, 29 Feb 2000 23:14:58 +0300 To: reliable_computing [at] interval [dot] usl.edu From: "Alexander G. Yakovlev" Date: Tue, 29 Feb 2000 23:14:57 +0300 Subject: Current information from the RC editorial group Lines: 96 Message-Id: Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk February 29, 2000 Dear colleagues, I would like to inform you about two changes concerning terms and prices for purchasing issues of the international journal RELIABLE COMPUTING (before 1995 named INTERVAL COMPUTATIONS). 1) Beginning on March 1, 2000 prices for back issues (1991-1996) are lower. The main change is for a complete set of back issues and supplements: almost three times lower! We hope that now the back issues have become available for all our potential readers. To achieve this purpose we also have established a special additional discount for students. 2) The number of the bank account of our official representative in Europe Prof. Dr. J. Wolff von Gudenberg has been changed. Do not use it for any purpose! See below for the new number. The terms and prices, starting March 1, 2000, are as follows: FOR INDIVIDUALS (postage included): Each issue from 1/91 until 4/96 - $7.00 (or 14.00 DM) per issue (the issue 1/91 as a set of xeroxed pages) Supplementum 1 ("Bibliography of Works on Interval Computations Published in Russian", 547 items) - $10.00 (or 20.00 DM) The collection of Interval'94 abstracts - $5.00 (or 10.00 DM) The collection of APIC'95 abstracts - $10.00 (or 20.00 DM) The collection of Interval'96 abstracts - $10.00 (or 20.00 DM) FOR INSTITUTIONS (universities, libraries, companies, etc.), all indicated prices should be doubled. A COMPLETE SET of the back issues and supplements may be purchased with a discount. The set includes 22 issues and 4 supplements. Prices are as follows (postage included): FOR INDIVIDUALS - $100 (or 200 DM); FOR INSTITUTIONS - $200 (or 400 DM); FOR STUDENTS - $70 (or 140 DM). All issues of INTERVAL COMPUTATIONS and RELIABLE COMPUTING as well as supplements published before 1997 are available for purchase by journal's regional representatives: Prof. R. Baker Kearfott Prof. Dr. J. Wolff von Gudenberg Department of Mathematics Lehrstuhl f. Informatik II Univ. of Louisiana at Lafayette Universitaet Wuerzburg Box 4-1010 Lafayette Am Hubland LA 70504-1010 Wuerzburg D-97074 USA Germany Office: (318) 231-5270 Phone: +49-931-888-5517 Home: (318) 981-9744 Fax: +49-931-888-4602 E-mail: rbk [at] usl [dot] edu E-mail: wolff [at] informatik [dot] uni- http://interval.usl.edu/kearfott.html wuerzburg.de http://www-info2.informatik.uni- wuerzburg.de/staff/wvg Please make a check to Instructions for bank transfer: the "University of holder: J. Wolff v. Gudenberg Louisiana at Lafayette" number: 560218901 keyword: Reliable Computing bank: Kreissparkasse Wuerzburg bank code: 790 501 30 For purchasing issues 1997-1999 please contact Kluwer Academic Publishers, Order Department (details see at the Kluwer's Web-site: http://www.wkap.nl). For subscribing for 2000 please contact Kluwer Academic Publishers, Order Department, too. You can also subscribe to the journal via the Internet: http://www.wkap.nl/journalhome.htm/1385-3139. Besides, using this service you can order a free sample copy of the journal, find complete tables of contents of the journal and other useful information. Sincerely yours, Alexander Yakovlev, Managing Editor