--- sorry if you received = multiple copies=20 ---

Dear Colleagues,

My addresses

nest [at] into [dot] nit.spb.su = =20 and

nest [at] slava [dot] nit.spb.su

are not working any more (since = June 1) due=20 to technical reasons.

Please send me emails to new=20 address

slavanest [at] yahoo [dot] com

This address is temporal and will = be changed=20 later. I'll inform about that in advance.

Sorry for = inconvenience,

Slava=20 Nesterov

------=_NextPart_000_0034_01C0ECD2.A993D8E0-- From owner-reliable_computing [at] interval [dot] louisiana.edu Mon Jun 11 11:12:45 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f5BGCji00356 for reliable_computing-outgoing; Mon, 11 Jun 2001 11:12:45 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f5BGCYm00351 for ; Mon, 11 Jun 2001 11:12:38 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id f5BGBli08772; Mon, 11 Jun 2001 10:11:48 -0600 (MDT) Message-Id: <200106111611.f5BGBli08772 [at] cs [dot] utep.edu> Date: Mon, 11 Jun 2001 10:11:45 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: [CCA] CCA 2000 Proceedings available To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: umpmVJ9sj8dY/4T1N5FDrA== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Several papers form this book may be of interest to the interval community. ------------- Begin Forwarded Message ------------- X-Authentication-Warning: laplace.fernuni-hagen.de: majordom set sender to owner-cca-list@fernuni-hagen.de using -f Date: Mon, 11 Jun 2001 15:18:29 +0200 From: Vasco.Brattka@FernUni-Hagen.de (Vasco Brattka) To: cca-list@FernUni-Hagen.de Subject: [CCA] CCA 2000 Proceedings available _______________________________________________________________________ Jens Blanck, Vasco Brattka, and Peter Hertling (Eds.) COMPUTABILITY AND COMPLEXITY IN ANALYSIS 4th International Workshop, CCA 2000, Swansea, UK, September 17-19, 2000, Selected Papers Springer-Verlag Berlin Heidelberg New York, 2001 ISBN 3-540-42197-1, 395 pp. _______________________________________________________________________ http://link.springer.de/link/service/series/0558/tocs/t2064.htm http://www.informatik.fernuni-hagen.de/cca/cca2000/ _______________________________________________________________________ Contents _______________________________________________________________________ - Effectivity of Regular Spaces Jens Blanck - The Degree of Unsolvability of a Real Number Anthony J. Dunlop and Marian Boykan Pour-El - A Survey of Exact Arithmetic Implementations Paul Gowland and David Lester - Standard Representations of Effective Metric Spaces Armin Hemmerling - Banach-Mazur Computable Functions on Metric Spaces Peter Hertling - A Generic Root Operation for Exact Real Arithmetic Namhyun Hur and James H. Davenport - Effective Contraction Theorem and Its Application Hiroyasu Kamo - Polynomially Time Computable Functions over p-Adic Fields George Kapoulas - On the Computational Content of the Krasnoselski and Ishikawa Fixed Point Theorems Ulrich Kohlenbach - Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory Margarita V. Korovina and Oleg V. Kudinov - Computing a Required Absolute Precision from a Stream of Linear Fractional Transformations Marko Krznaric - delta-Approximable Functions Charles Meyssonnier, Paolo Boldi, and Sebastiano Vigna - Computabilities of Fine-Continuous Functions Takakazu Mori - The iRRAM: Exact Arithmetic in C++ Norbert Th. Mueller - The Uniformity Conjecture Daniel Richardson - Admissible Representations of Limit Spaces Matthias Schroeder - Characterization of the Computable Real Numbers by Means of Primitive Recursive Functions Dimiter Skordev - Effective Fixed Point Theorem over a Non-computably Separable Metric Space Izumi Takeuti - Computational Dimension of Topological Spaces Hideki Tsuiki - Some Properties of the Effective Uniform Topological Space Yoshiki Tsujii, Mariko Yasugi, and Takakazu Mori - On Computable Metric Spaces Tietze-Urysohn Extension Is Computable Klaus Weihrauch - Is the Linear Schroedinger Propagator Turing Computable? Klaus Weihrauch and Ning Zhong - A Computable Spectral Theorem Martin Ziegler and Vasco Brattka - Exact Real Arithmetic Systems: Results of Competition Jens Blanck ------------- End Forwarded Message ------------- From owner-reliable_computing [at] interval [dot] louisiana.edu Mon Jun 11 22:07:29 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f5C37Tg00718 for reliable_computing-outgoing; Mon, 11 Jun 2001 22:07:29 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f5C37Om00713 for ; Mon, 11 Jun 2001 22:07:25 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id f5C37Ll13211; Mon, 11 Jun 2001 21:07:21 -0600 (MDT) Message-Id: <200106120307.f5C37Ll13211 [at] cs [dot] utep.edu> Date: Mon, 11 Jun 2001 21:07:19 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: conference of potential interest to interval community To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: yA8HZZNzk7RG+a9qyP9nPg== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk ------------- Begin Forwarded Message ------------- From: Logic Programming Rsrch Association Date: Mon, 11 Jun 2001 16:03:10 -0600 Subject: CFP: CICLOPS 2001 ======================================================================== FIRST call for papers FIRST call for papers FIRST call for papers We apologize for multiple copies of this mail / posting ======================================================================== Post-Conference Workshop CICLOPS 2001 Colloquium on Implementation of Constraint and LOgic Programming Systems held in conjunction with the International Conference on Logic Programming Paphos, Cyprus December 1, 2001 ======================================================================== see also: http://www.cs.nmsu.edu/~complog/conferences/iclp01 ======================================================================== This workshop is a continuation of the series of workshops on Implementations of Logic Programming Systems, previously held with considerable success in Budapest (1993), Santa Margherita (1994) and Ithaca (1994), as well as the Compulog Net workshops on Parallelism and Implementation Technologies held in Madrid (1993-4), Utrecht (1995), Bonn (1996), Port Jefferson (1997), Manchester (1998), Las Cruces (1999), and London (2000). This year, the event will join forces with TRICS (Techniques for Implementing Constraint Programming Systems), previously held in Singapore (2000), thus providing coverage to implementation technology for both Logic and Constraint Programming. The last years have seen continuous progress in the computing technology available both for the academic and commercial computing environments. Examples include improved processor performance, increased memory capacity and bandwidth, faster networking technology, and Operating System support for cluster computing. Combined with recent advances in compilation technologies, these improvements are causing high-level languages to be regarded as good candidates for programming complex, real world applications. Logic Programming and Constraint Programming, in particular, seem to offer one of the best alternatives, as they couple a very high level of abstraction and a declarative nature with an extreme flexibility in the design of its execution model. The main intent of this workshop is to bring together, in an informal and friendly setting, key researchers on implementation technologies for logic and constraint-based languages and systems, in order to promote a much needed exchange of ideas and feedback on recent developments. The workshop is focused on design and implementation of logic and constraint programming systems whether sequential, parallel, or concurrent. Preference will be given to the analysis and description of implemented systems (or systems currently under implementation) and their associated techniques, problems found in their development or design, and steps taken towards the solution of these problems. Suggested topics of interest include, but are not limited to: - standard and non-standard implementation schemes e.g. modification of WAM, translation to C, native-code generation etc. - optimizing compilers and static analysis - parallelism and concurrency - techniques for the implementation of different extensions of logic and constraint programming, e.g., multi-paradigm languages and systems, non-monotonic reasoning systems, inductive logic programming - benchmarking and performance evaluation - Software design aspects of LP/CP systems: components, patterns, etc. - memory management and garbage collection - programming environments - tools for internet applications - experiences from using systems in real-life applications Contributions: -------------- Authors are invited to submit papers written in English and not exceeding 12 pages (10pts Font, letter-size paper, 1 inch margin). To speed up the process of refereeing, authors are requested to submit their paper in Postscript or PDF form by electronic mail to the workshop coordinator (e-mail address below). Conventional paper copies may be sent to the contact address below only if access to electronic media is not available. Submissions should contain full return mail and email address (if applicable), and FAX number (if applicable) of the contact author. Prospective authors are kindly requested to first send an indication of interest together with a paper title to the organizers. Deadline for submissions is September 5, 2001. Authors submitting by electronic mail will receive an acknowledgement (also by electronic mail) within 2-3 days. Accepted papers: ---------------- Submitted papers will be reviewed by at least two referees. Authors will be notified of the acceptance of their papers by September 23, 2001. To be included in the workshop proceedings (to be distributed to the workshop participants), revised versions of the accepted papers must be sent no later than October 5, 2001. Electronic versions of the accepted papers will be also made available through the workshop's homepage. Workshop Chairs: ---------------- I. Dutra (Federal University of Rio de Janeiro, Brazil) M. Henz (National University of Singapore, Singapore) Program committee: ------------------ M. Carro (Politechnic Univ. of Madrid, Spain) M. Carlsson (SICS, Sweden) B. Demoen (K.U. Leuven, Belgium) G. Gupta (Univ. of Texas at Dallas, USA) F. Laburthe (Bouygues E-lab, France) I. Niemela (Helsinki University of Technology, Finland) E. Pontelli (New Mexico State University, USA) V. Santos Costa (Federal University of Rio de Janeiro, Brazil) C. Schulte (Universitat des Saarlandes, Germany) F. Silva (Univ. of Porto, Portugal) Important dates: ---------------- Indication of interest: as soon as possible Submission of papers: September 5, 2001 Notification of authors: September 23, 2001 Final version sent by: October 5, 2001 ICLP'01 Conference: Nov. 26 - Dec. 1, 2001 Workshop: December 1, 2001 Contact address for Workshop Coordinator: ----------------------------------------- Enrico Pontelli Dept. Computer Science New Mexico State University Box 30001/CS, Las Cruces, NM 88003 Phone: +1 (505) 646-6239 FAX: +1 (505) 646-1002 email: epontell [at] cs [dot] nmsu.edu Workshop Web Site: ------------------ http://www.cs.nmsu.edu/~complog/conferences/iclp01 ======================================================================== ------------- End Forwarded Message ------------- From owner-reliable_computing [at] interval [dot] louisiana.edu Wed Jun 13 11:46:53 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f5DGkqt00374 for reliable_computing-outgoing; Wed, 13 Jun 2001 11:46:52 -0500 (CDT) Received: from kite.wfu.edu.cn ([210.44.64.66]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f5DGkjb00369 for ; Wed, 13 Jun 2001 11:46:46 -0500 (CDT) Received: from 388L8j5ck (slip-12-64-73-201.mis.prserv.net [12.64.73.201]) by kite.wfu.edu.cn (8.11.0/8.8.7) with SMTP id f5E0nGi10919; Wed, 13 Jun 2001 20:49:18 -0400 DATE: 13 Jun 24 9:51:06 AM FROM: sara74lee5 [at] yahoo [dot] com Message-ID: <02Y8lmFIaZ7> SUBJECT: (None) Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Educate yourself about everything you ever wanted to know !!! Individually, these products often sell for as much as $100!!! 1. Satellite TV/RCA Dish Descrambler Our unique, complete plans for building your own home satellite TV descrambler. For access to a clear reception of pay TV signals on your home satellite dish! It does not require any additional equipment! Complete PC board template & instructions! This also includes a manual for accessing the RCA/DSS satellite dish to receive free pay channels. All the latest information for doing it right. 2. X-Ray Envelope Spray Have you ever wanted to read the contents of an envelope without opening it? Many government and other organizations use what is known as X-Ray Envelope Spray to do this! An envelope is sprayed with this secret chemical and it becomes translucent for a short period of time, which allows the contents to be read without opening. Private supply houses sell small cans of this aerosol spray for up to $50 a can! The spray is actually a commonly available item found in major grocery and discount stores. No modification of the spray is needed, as it is ready to use as X-Ray Envelope Spray and sells for about $1.99 in retail stores! 3. How to Find Anyone and Obtain Unlisted Phone Numbers Tired of getting the wrong number? Stop looking! We can help! We'll show you how to get the unlisted phone number of anyone. No one can hide now! Simple. Skip tracers use these tricks. We also include everything you need to know about finding missing people or loved ones from the comfort of your home. Why pay money when you can do it yourself? 4. Radar Zapper This simply technique converts existing radar detectors into a device that will jam police radar. This device sends false readings back to the police radar! Works on virtually all detectors and easy to use! 5. Untraceable E-Mail How to send totally anonymous and untraceable E-mail. We're not talking about those generic Yahoo! Accounts -- this is the real McCoy, anonymous email. Everything explained. Absolutely untraceable. 6. Underground Guide to Utility Meters The illustrated guide to gas, water & electric meters! We show you in detail methods many people use to stop, slow down, even reverse all three types! This underground manual is one of our most popular items! Complete illustrated techniques and easy to do. Shows how to defeat all major brands & models of gas, water & electric meters. 7. Scan-Tron Genius Here at last!! This very controversial report describes in detail how any student can easily defeat Scan-Tron test readers to pass a test even though he does not know the answer! This simple method will fool the scan reader into thinking you answered correctly! No tools needed. Completely tested. You won't believe how simple this method is! 8. Bad Credit Cleaning Manual Simple ways to restore your bad credit rating to A++. Don't pay a credit counselor good money to do what you can do yourself. Many methods presented here - some legal & some "not so legal". Wipe your slate clean from your own home. Get a fresh start. 9. Pass Drug Tests Don't use of drugs! However, many innocent people are victims of drug testing. Some over the counter medicine can trigger false results & cost you your job. Proven methods to beat drug tests. We show you how to build a simple device that can fool the best! Protect yourself & your job, even if you don't use drugs. 10.Cable TV Decoders How to get cable TV and turn your converter box into "full service" mode. This is the latest and best way to gain access. Also, how to build your own "snooper stopper" for pennies. Prevents cable companies from spying on you. 11. Free Long Distance You can make long distance calls to other countries at no cost! The information in these reports explains everything you need to call other countries! Country codes, city codes, overseas sender codes! Call England, Germany, the UK, practically anywhere! 12. Dissolving Checks We show you in detail the "insufficient funds" checks scam used by people to obtain goods & cash without having any money in the account. Many people do not even use false ID's in pulling this scam off. Complete detailed instructions plus rare information on the famous "dissolving" checks. These checks "dissolve" after being chemically coated & deposited in the bank leaving no trace of the writer or account number. Not for illegal purposes. See how others do it. 13. Outsmart Lie Detector Tests Hundreds of thousands of people in this country are wrongfully fired or not hired simply because they did not pass the lie detector test even though they've done nothing wrong! Read drugless methods to help pass whether you are lying or not! A valuable tool for any job seeker. Don't be harassed by your employer ever again. Tested and proven. 14. Lock-picks & Lock-picking. Why buy expensive lock-picks & pay for rip-off mail order locksmith courses? We'll show you how to make your own professional lock-picks. Exact detailed drawings & construction techniques! This is perhaps the easiest to understand course ever published on this hush-hush subject. You won't believe how easy it is to make these tools! We also show you how a basic lock works & how they are picked. This publication is complete with detailed drawings & illustrations. ALL IN ONE!!! PREVIOUSLY SOLD FOR HUNDREDS!!! ORDER NOW!!! That's 14 products, all for just $29.95 [shipping & handling included]. CA residents please add sales tax We accept cash, personal checks, money orders and cashiers checks. You must include a Primary and secondary E-mail address, as we will be emailing you all the reports as soon as your payment is received. Print the following form & mail it to: Info 4 Edu Only 1300 N. Cahuenga Blvd # 362 Los Angeles, CA 90028 Please Print Clearly Name: _________________________________________________ Primary Email Address: ___________________________________ Secondary Email Address: _________________________________ Make your check payable to: Info 4 Edu Only DISCLAIMER: Please note that this information is being provided for educational purposes only. The information itself is legal, while the usage of such information may be illegal. We do not advocate unauthorized use or theft of any services. If in doubt, check your local laws and act accordingly. NOTE: All of the publications are Copyright 2001 by Info 4 Edu Only . We aggressively protect our copyrights and will seek prosecution of any website, web-master, web hosting service or anyone else that is in violation of US & International Copyright Laws. To be removed from our future mailing please email optout7846 [at] aol [dot] com with the word remove in the subject line From owner-reliable_computing [at] interval [dot] louisiana.edu Fri Jun 15 17:15:55 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f5FMFsv00613 for reliable_computing-outgoing; Fri, 15 Jun 2001 17:15:54 -0500 (CDT) Received: from imf13bis.bellsouth.net (mail213.mail.bellsouth.net [205.152.58.153]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f5FMFob00608 for ; Fri, 15 Jun 2001 17:15:51 -0500 (CDT) Received: from u8174 ([65.81.241.119]) by imf13bis.bellsouth.net (InterMail vM.5.01.01.01 201-252-104) with SMTP id <20010615221633.NLH15655.imf13bis.bellsouth.net@u8174> for ; Fri, 15 Jun 2001 18:16:33 -0400 Message-Id: <2.2.32.20010615221333.00741a60 [at] pop [dot] louisiana.edu> X-Sender: rbk5287 [at] pop [dot] louisiana.edu X-Mailer: Windows Eudora Pro Version 2.2 (32) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Fri, 15 Jun 2001 17:13:33 -0500 To: reliable_computing [at] interval [dot] louisiana.edu From: "R. Baker Kearfott" Subject: Semiannual reliable_computing subscription verification results Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Colleagues, Thank you for cooperating with our semiannual subscription verification process. I have removed the following addresses, which bounced for the reasons indicated. If you know of corrections to these addresses, I would appreciate the information. eamj [at] fnn [dot] net this user doesn't exist in our system. ... User unknown ... User unknown collart [at] math [dot] ethz.ch 550 Permanent error: Recipient Invalid ... User unknown ... User unknown angelo.montanari [at] uniud [dot] it 550 5.1.1 unknown or illegal user tgm [at] co [dot] intel.com ... Host unknown jean-michel.muller [at] lip [dot] ens-lyon.fr 550 Host unknown ae20 [at] iamk4526 [dot] mathematik.uni-karlsruhe.de 550 Host unknown Sincerely, Baker P.S. It is a shame that we got a particularly offensive "spam" message close to the time that the subscription verification was sent out. However, any technical solution to this problem would cause additional inconvenience to list users. Unless the problem gets worse, I will continue to run the list as before. Of course, anyone is welcome to mail me with suggestions, comments, or complaints. P.P.S Please remember that, starting July 1, it is reliable_computing [at] interval [dot] louisiana.edu The reliable_computing [at] interval [dot] usl.edu address will not work after that date. --------------------------------------------------------------- R. Baker Kearfott, rbk [at] louisiana [dot] edu (337) 482-5346 (fax) (337) 482-5270 (work) (337) 981-9744 (home) URL: http://interval.louisiana.edu/kearfott.html Department of Mathematics, University of Louisiana at Lafayette Box 4-1010, Lafayette, LA 70504-1010, USA --------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] louisiana.edu Sun Jun 17 18:16:18 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f5HNGIb02303 for reliable_computing-outgoing; Sun, 17 Jun 2001 18:16:18 -0500 (CDT) Received: from mail.cts.com.mo ([202.175.1.196]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f5HNGCb02298 for ; Sun, 17 Jun 2001 18:16:13 -0500 (CDT) Received: from L83MFHW85 (ip206.lawest.quik.com [216.176.1.206]) by mail.cts.com.mo with SMTP (Microsoft Exchange Internet Mail Service Version 5.5.1960.3) id MNWD9YWJ; Mon, 18 Jun 2001 00:31:39 +0800 DATE: 17 Jun 01 10:07:29 AM FROM: oiuygoiuyg8 [at] yahoo [dot] com Message-ID: <8ZAUqJ0FYEX7> SUBJECT: Wave of the Future Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk We will put your product or service instantly into the hands of millions of prospects! =============================================================== "Many business people are finding out that they can now advertise in ways that they never could have afforded in the past. The cost of sending mass e-mail is extremely low, and the response rate is high and quick." - USA TODAY =============================================================== Since 1996, Bulk Email Network has provided bulk email marketing to thousands of well-satisfied customers. We offer the most competitive prices in the industry, made possible by our high percentage of repeat business. We have the most advanced direct email technology employed by only a knowledgeable few in the world. We have over 160 million active email addresses, increasing our list at the rate of half a million to one million a month. You will have instant guaranteed results, something no other form of marketing can claim. Our turn around time is a remarkable 24 hours. Our email addresses are sorted by country, state, city and target. Your marketing campaign will speed with pinpoint accuracy to your desired audience! Call us for a free consultation at 323 876 6148 [U.S.A.]. We guarantee the lowest prices or your service is free! Best of ALL, Bulk Email Network can be used as a 100% TAX WRITE OFF for your Business! 1) Let's say you... Sell a $24.95 PRODUCT or SERVICE. 2) Let's say you... Mass Email to 1,000,000 PEOPLE DAILY. 3) Let's say you... Receive JUST 1 ORDER for EVERY 2,500 EMAILS. CALCULATION OF YOUR EARNINGS BASED ON THE ABOVE STATISTICS: [Day 1]: $9,980 [Week 1]: $69,860 [Month 1]: $279,440 Now you know why you receive so many email advertisements... Best Regards, Sam Al Bulk Email Network C.E.O Under Bill s.1618 TITLE III passed by the 105th U.S. Congress this letter is not considered "spam" as long as we include: 1) contact information and, 2) the way to be removed from future mailings (see below). To Remove Yourself From This List: Please email to jk72jk72 [at] yahoo [dot] com with the email address that you would like removed and the word REMOVE in the subject heading. From owner-reliable_computing [at] interval [dot] louisiana.edu Mon Jun 18 05:59:13 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f5IAxD802913 for reliable_computing-outgoing; Mon, 18 Jun 2001 05:59:13 -0500 (CDT) Received: from automatix.informatik.uni-wuerzburg.de (wi2x40.informatik.uni-wuerzburg.de [132.187.10.40]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f5IAx8b02908 for ; Mon, 18 Jun 2001 05:59:08 -0500 (CDT) Received: from informatik.uni-wuerzburg.de (wi2d38.informatik.uni-wuerzburg.de [132.187.10.138]) by automatix.informatik.uni-wuerzburg.de (8.11.2/8.11.2/SuSE Linux 8.11.1-0.5) with ESMTP id f5IAx5F14641 for ; Mon, 18 Jun 2001 12:59:05 +0200 Message-ID: <3B2DDEF8.F8F3ED1A [at] informatik [dot] uni-wuerzburg.de> Date: Mon, 18 Jun 2001 12:59:04 +0200 From: "J. Wolff v. Gudenberg" X-Mailer: Mozilla 4.76 [en] (Windows NT 5.0; U) X-Accept-Language: de,en MIME-Version: 1.0 To: reliable_computing [at] interval [dot] louisiana.edu Subject: Scan 2000 / Interval 2000 Proceedings References: <200106032343.f53Nhks15465 [at] cs [dot] utep.edu> Content-Type: multipart/mixed; boundary="------------ECC0597DCC3BBAEC29579FDE" Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk This is a multi-part message in MIME format. --------------ECC0597DCC3BBAEC29579FDE Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Dear colleagues, the proceedings of the joint conference Scan2000 / Interval2000 are in press. The list of contents is attached. We would like to take the opportunity and thank all those who have contributed to the book, as an author, as a referee, as an early subscriber, or as a general helper. Best regards J. Wolff v. Gudenberg W. Kraemer --------------ECC0597DCC3BBAEC29579FDE Content-Type: text/plain; charset=iso-8859-1; name="inhalt.txt" Content-Transfer-Encoding: 8bit Content-Disposition: inline; filename="inhalt.txt" Subject: Inhaltsverzeichnis Proceedings Book Date: Tue, 12 Jun 2001 09:48:21 +0200 From: Markus Grimmer Organization: Bergische Universität/Gesamthochschule Wuppertal, FB Mathematik To: "J.Wolff v. Gudenberg" Hallo Herr wolff v. Gudenberg, hier das Inhaltsverzeichnis des Buches als Textfile. Viele Gruesse, Markus Grimmer -- *************************************************************************** Markus Grimmer Fachbereich Mathematik --- Wissenschaftliches Rechnen/Softwaretechnologie Bergische Universität GH Wuppertal, Gaussstr. 20, Raum G.15.29, 42097 Wuppertal, Germany office> markus.grimmer [at] math [dot] uni-wuppertal.de home> markus.grimmer [at] gmx [dot] de *************************************************************************** --------------------------------------------------------------------- SCIENTIFIC COMPUTING VALIDATED NUMERICS INTERVAL METHODS Edited by WALTER KRAEMER University of Wuppertal, Germany JUERGEN WOLFF V. GUDENBERG University of Wuerzburg, Germany Kluwer Academic Publishers Boston/Dordrecht/London Contents Preface xi SCAN 2000 Keynote Address The Future of Intervals 1 G.William Walster Part I Software-and Hardware-Tools Variable-Precision Exponential Evaluation 19 Javier Hormigo, Julio Villalba, Michael J. Schulte Fast computation of some special integrals of mathematical physics 29 Ekatherina A. Karatsuba Interval Input and Output 41 Eero Hyvoenen A Case for Interval Hardware on Superscalar Processors 53 James E. Stine, Michael J. Schulte Evaluating the Impact of Accurate Branch Prediction on Interval Software 69 Ahmet Akkas, Michael J. Schulte, James E. Stine Automatic Test Case Generation using Interval Arithmetic 81 Guenter Schumacher, Armin Bantle Part II Linear Algebra On the Hull of the Solution Sets of Interval Linear Equations 91 Jana Konickova Computation of Algebraic Solutions to Interval Systems via Systems of Coordinates 103 Svetoslav Markov Towards Diagrammatic Analysis of Systems of Interval "Linear Equations" 115 Zenon Kulpa On the Solution of Parametrised Linear Systems 127 Evgenija D. Popova Part III Polynomials Verified solutions of systems of nonlinear polynomial equations 141 Daniela Fausten, Wolfram Luther Euler-like method with Weierstrass' correction 153 Miodrag S. Petkovic, Dejan V. Vranic Part IV Set Enclosures Guaranteed Set Computation with Subpavings 167 Michel Kieffer, Isabelle Braems, Éric Walter, Luc Jaulin A New Intersection Algorithm for Parametric Surfaces Based on LIEs 179 Katja Buehler, Wilhelm Barth State estimation using interval constraint propagation 191 Luc Jaulin, Isabelle Braems, Michel Kieffer, Éric Walter Part V Global Optimization Interval Methods for Global Optimization Using the Boxing Method 205 Andras Erik Csallner, Rudi Klatte, Dietmar Ratz, Andreas Wiethoff A Branch-and-Prune Method for Global Optimization 215 Dimitris G. Sotiropoulos and Theodoula N. Grapsa Simulation of a Controlled Aircraft Elevator under Sensor Uncertainties 227 Juergen Heeks, Eberhard P. Hofer, Bernd Tibken, Karin Lunde, Klaus Thorwart Part VI Control Traditional parameter estimation versus estimation of guaranteed parameter sets 241 Eberhard P. Hofer, Bernd Tibken, Milan Vlach Stabilizing Control Design of Nonlinear Process Involving Uncertainties 255 Mikhail Krastanov, Neli Dimitrova Set Estimation, Computation of Volumes and Data Safety 267 Isabelle Braems, Michel Kieffer, Éric Walter, Luc Jaulin Part VII ODE and DAE and Applications Verified High-Order Integration of DAEs and Higher-order ODEs 281 Jens Hoefkens, Martin Berz, Kyoko Makino About a Finite Dimensional Reduction Method for Conservative Dynamical Sys- tems and its Applications 293 Anatoliy Prykarpatsky, Stanislaw Brzychczy, V. Samoylenko Verified Determination of Singularities in Chemical Processes 305 Christian H. Bischof, Bruno Lang, Wolfgang Marquardt, Martin Moennigmann Modeling of Multibody Systems with Interval Arithmetic 317 Christian Hoersken, Holger Traczinski Part VIII Stochastics and Probability On the Algebraic Properties of Stochastic Arithmetic. Comparison to Interval Arithmetic 331 Rene Alt, Svetoslav Markov Global Random Walk Simulations of Diffusion 343 Calin Vamos, Nicolae Suciu, Harry Vereecken, Olaf Nitzsche, Horst Hardelauf Interval Computations as a Particular Case of a General Scheme Involving Classes of Probability Distributions 355 Scott Ferson, Lev Ginzburg, Vladik Kreinovich, Harry Schulte For reliable and powerful scientific computations 367 Fabienne Jézéquel, Jean-Marie Chesneaux Reliable representations of strange attractors 379 Dominique Michelucci Appendix: The Referees 391 --------------ECC0597DCC3BBAEC29579FDE-- From owner-reliable_computing [at] interval [dot] louisiana.edu Mon Jun 18 11:47:26 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f5IGlP100446 for reliable_computing-outgoing; Mon, 18 Jun 2001 11:47:25 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f5IGlHx00441 for ; Mon, 18 Jun 2001 11:47:18 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id f5IGlBW29236 for ; Mon, 18 Jun 2001 10:47:11 -0600 (MDT) Message-Id: <200106181647.f5IGlBW29236 [at] cs [dot] utep.edu> Date: Mon, 18 Jun 2001 10:47:09 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: Moore's 1959 technical reports To: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: CEt23+/3/AveAU5lrmNDtA== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear Friends, I am looking for hardcopies of Moore's 1959 technical report. Dr. Moore himself does not have them anymore. R. E. Moore, Automatic error analysis in digital computation, Lockheed Missiles and Space Co. Technical Report LMSD-48421, Palo Alto, CA, 1959. R. E. Moore, C. T. Yang, Interval analysis, Lockheed Missiles and Space Co. Technical Report LMSD-285875, Palo Alto, CA, 1959. If anyone has them I would appreciate a xerox copy. I will be gald to pay for copying and sending. My mailing address is: Vladik Kreinovich Department of Computer Science University of Texas at El Paso 500 W. University El Paso, TX 79968, USA Thanks a lot Vladik From owner-reliable_computing [at] interval [dot] louisiana.edu Mon Jun 18 16:17:17 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f5ILHHs00656 for reliable_computing-outgoing; Mon, 18 Jun 2001 16:17:17 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f5ILHBx00651 for ; Mon, 18 Jun 2001 16:17:12 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id f5ILH2301429; Mon, 18 Jun 2001 15:17:02 -0600 (MDT) Message-Id: <200106182117.f5ILH2301429 [at] cs [dot] utep.edu> Date: Mon, 18 Jun 2001 15:17:02 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: Re: Moore's 1959 technical reports To: celarier [at] jwocky [dot] gsfc.nasa.gov Cc: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: Za4ytdkKT1xNNsvQkIoeCw== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear Edward, I will do my best. Actually, quite a few people expressed interest, so I will try my best to put the texts online (in some form) when I get them. Vladik > Date: Mon, 18 Jun 2001 14:33:35 -0400 > From: "Edward A. Celarier" > To: Vladik Kreinovich > Subject: Re: Moore's 1959 technical reports > Mime-Version: 1.0 > Content-Disposition: inline > User-Agent: Mutt/1.2.5i > > Vladik: > > Do you think it would be possible, once you do have copies, to scan them > and make them available electronically on your web site? > > -Edward > > > On Mon, Jun 18, 2001 at 10:47:09AM -0600, Vladik Kreinovich wrote: > > Dear Friends, I am looking for hardcopies of Moore's 1959 technical report. Dr. > > Moore himself does not have them anymore. > > > > R. E. Moore, Automatic error analysis in digital computation, Lockheed Missiles > > and Space Co. > > Technical Report LMSD-48421, Palo Alto, CA, 1959. > > > > R. E. Moore, C. T. Yang, Interval analysis, Lockheed Missiles and Space > > Co. Technical Report > > LMSD-285875, Palo Alto, CA, 1959. > > > > If anyone has them I would appreciate a xerox copy. I will be gald to pay for > > copying and sending. My mailing address is: > > > > Vladik Kreinovich > > Department of Computer Science > > University of Texas at El Paso > > 500 W. University > > El Paso, TX 79968, USA > > > > Thanks a lot > > > > Vladik > > -- > ############################################################################# > # Edward A. Celarier, Ph.D. # Internet: celarier [at] jwocky [dot] gsfc.nasa.gov # > # Scientific Programmer/Analyst # Voxnet: 301 614 6041 - Office # > # SGT, Inc. # 301 738 9699 - Home # > # Greenbelt, MD # Faxnet: 301 614 5903 - Office # > # ############################################ > # Mathematics may be defined as the subject in which we never know what # > # we are talking about, nor whether what we are saying is true. # > # -- Bertrand Russell (1872-1967) # > ############################################################################# From owner-reliable_computing [at] interval [dot] louisiana.edu Tue Jun 19 10:00:19 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f5JF0Jk01444 for reliable_computing-outgoing; Tue, 19 Jun 2001 10:00:19 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f5JF0Ex01439 for ; Tue, 19 Jun 2001 10:00:14 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id f5JF0B604565 for ; Tue, 19 Jun 2001 09:00:11 -0600 (MDT) Message-Id: <200106191500.f5JF0B604565 [at] cs [dot] utep.edu> Date: Tue, 19 Jun 2001 09:00:10 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: optimization in Mathematica To: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: Qw8+s0xlyG3Ggw7eYjTqMg== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear Friends, A colleague of mine is doing global optimization on mathematica for a specific practical materials-related problem, and non-validated methods seem to get an undesired local maximum, so he is looking for validated (interval?) techniques. Is there a ready-to-use validated global optimization program in Mathematica? I know that Mathematica does include interval arithmetic, and then Popova and Ullrich did implement directed interval arithmetic, so I hope such a program exists. Any ideas would be helpful. Vladik From owner-reliable_computing [at] interval [dot] louisiana.edu Tue Jun 19 17:27:47 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f5JMRlD00431 for reliable_computing-outgoing; Tue, 19 Jun 2001 17:27:47 -0500 (CDT) Received: from patan.sun.com (patan.Sun.COM [192.18.98.43]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f5JMRhv00426 for ; Tue, 19 Jun 2001 17:27:43 -0500 (CDT) Received: from engmail1.Eng.Sun.COM ([129.146.1.13]) by patan.sun.com (8.9.3+Sun/8.9.3) with ESMTP id QAA25991; Tue, 19 Jun 2001 16:27:34 -0600 (MDT) Received: from phys-mpkmaila (phys-mpkmaila.Eng.Sun.COM [129.146.1.131]) by engmail1.Eng.Sun.COM (8.9.3+Sun/8.9.3/ENSMAIL,v2.1p1) with ESMTP id PAA19684; Tue, 19 Jun 2001 15:27:34 -0700 (PDT) Received: from gww (gww.Eng.Sun.COM [129.146.78.116]) by mpkmail.eng.sun.com (iPlanet Messaging Server 5.1 (built Apr 8 2001)) with SMTP id <0GF700FIL7MGJA [at] mpkmail [dot] eng.sun.com>; Tue, 19 Jun 2001 15:25:28 -0700 (PDT) Date: Tue, 19 Jun 2001 15:27:34 -0700 (PDT) From: William Walster Subject: Re: Moore's 1959 technical reports To: celarier [at] jwocky [dot] gsfc.nasa.gov, vladik [at] cs [dot] utep.edu Cc: reliable_computing [at] interval [dot] louisiana.edu Reply-to: William Walster Message-id: <0GF700FIM7MGJA [at] mpkmail [dot] eng.sun.com> MIME-version: 1.0 X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4.2 SunOS 5.8 sun4u sparc Content-type: TEXT/plain; charset=us-ascii Content-transfer-encoding: 7BIT Content-MD5: 0uQnCWX9HCF7TivbJIaJcw== Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Vladik, Eldon may have a copy. Unfortunately he is on vacation for two weeks. I'm sure you can get a copy from Lockheed. Eldon does have a copy of Ray's Dissertation, but I'm sure Ray does too. Unfortunately, neither Eldon, nor I have copies of the paper by Dwyer. The reference is: Dwyer, P. S. (1951). Computation with approximate numbers in "Linear Computations, P. S. Dwyer (ed.), Wiley, New York, pp. 11-34. Regards, Bill >Date: Mon, 18 Jun 2001 15:17:02 -0600 (MDT) >From: Vladik Kreinovich >Subject: Re: Moore's 1959 technical reports >To: celarier [at] jwocky [dot] gsfc.nasa.gov >Cc: reliable_computing [at] interval [dot] louisiana.edu >MIME-version: 1.0 >Content-MD5: Za4ytdkKT1xNNsvQkIoeCw== > >Dear Edward, > >I will do my best. Actually, quite a few people expressed interest, so I will >try my best to put the texts online (in some form) when I get them. > >Vladik > >> Date: Mon, 18 Jun 2001 14:33:35 -0400 >> From: "Edward A. Celarier" >> To: Vladik Kreinovich >> Subject: Re: Moore's 1959 technical reports >> Mime-Version: 1.0 >> Content-Disposition: inline >> User-Agent: Mutt/1.2.5i >> >> Vladik: >> >> Do you think it would be possible, once you do have copies, to scan them >> and make them available electronically on your web site? >> >> -Edward >> >> >> On Mon, Jun 18, 2001 at 10:47:09AM -0600, Vladik Kreinovich wrote: >> > Dear Friends, I am looking for hardcopies of Moore's 1959 technical report. >Dr. >> > Moore himself does not have them anymore. >> > >> > R. E. Moore, Automatic error analysis in digital computation, Lockheed >Missiles >> > and Space Co. >> > Technical Report LMSD-48421, Palo Alto, CA, 1959. >> > >> > R. E. Moore, C. T. Yang, Interval analysis, Lockheed Missiles and >Space >> > Co. Technical Report >> > LMSD-285875, Palo Alto, CA, 1959. >> > >> > If anyone has them I would appreciate a xerox copy. I will be gald to pay >for >> > copying and sending. My mailing address is: >> > >> > Vladik Kreinovich >> > Department of Computer Science >> > University of Texas at El Paso >> > 500 W. University >> > El Paso, TX 79968, USA >> > >> > Thanks a lot >> > >> > Vladik >> >> -- >> ############################################################################# >> # Edward A. Celarier, Ph.D. # Internet: celarier [at] jwocky [dot] gsfc.nasa.gov # >> # Scientific Programmer/Analyst # Voxnet: 301 614 6041 - Office # >> # SGT, Inc. # 301 738 9699 - Home # >> # Greenbelt, MD # Faxnet: 301 614 5903 - Office # >> # ############################################ >> # Mathematics may be defined as the subject in which we never know what # >> # we are talking about, nor whether what we are saying is true. # >> # -- Bertrand Russell (1872-1967) # >> ############################################################################# > From owner-reliable_computing [at] interval [dot] louisiana.edu Tue Jun 19 22:11:01 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f5K3B0p00351 for reliable_computing-outgoing; Tue, 19 Jun 2001 22:11:00 -0500 (CDT) Received: from hotmail.com (oe40.pav1.hotmail.com [64.4.30.97]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f5K3At900346 for ; Tue, 19 Jun 2001 22:10:56 -0500 (CDT) Received: from mail pickup service by hotmail.com with Microsoft SMTPSVC; Tue, 19 Jun 2001 20:10:49 -0700 X-Originating-IP: [216.62.132.1] Reply-To: "Brian Webb" From: "Brian Webb" To: References: <0GF700FIM7MGJA [at] mpkmail [dot] eng.sun.com> Subject: Re: Moore's 1959 technical reports Date: Tue, 19 Jun 2001 22:10:08 -0500 MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 5.50.4133.2400 X-MimeOLE: Produced By Microsoft MimeOLE V5.50.4133.2400 Message-ID: X-OriginalArrivalTime: 20 Jun 2001 03:10:49.0811 (UTC) FILETIME=[9B75C230:01C0F936] Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk > Dwyer, P. S. (1951). Computation with approximate numbers in > "Linear Computations, P. S. Dwyer (ed.), Wiley, New York, pp. 11-34. There are several used book stores offering this book, most under $20 US. To see them for yourself, go to www.bookfinder.com - Brian From owner-reliable_computing [at] interval [dot] louisiana.edu Thu Jun 21 10:55:35 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f5LFtZ700452 for reliable_computing-outgoing; Thu, 21 Jun 2001 10:55:35 -0500 (CDT) Received: from mailhub.iastate.edu (mailhub.iastate.edu [129.186.1.102]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f5LFtVq00447 for ; Thu, 21 Jun 2001 10:55:31 -0500 (CDT) Received: from mx.eng.iastate.edu (mx.eng.iastate.edu [129.186.23.116]) by mailhub.iastate.edu (8.9.3/8.9.3) with ESMTP id KAA27421 for ; Thu, 21 Jun 2001 10:55:29 -0500 Received: by mx.eng.iastate.edu with Internet Mail Service (5.5.2653.19) id ; Thu, 21 Jun 2001 10:55:29 -0500 Message-ID: <873F9637C545D311A5C500902771C859015DC580 [at] mx [dot] eng.iastate.edu> From: "Berleant, D." To: reliable_computing [at] interval [dot] louisiana.edu Subject: FW: Interval website Date: Thu, 21 Jun 2001 10:55:20 -0500 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.5.2653.19) Content-Type: text/plain; charset="iso-8859-1" Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Forwarded to reliable_computing [at] interval [dot] louisiana.edu Nelson H. F. Beebe writes: [This is off the reliable_computing list; the list maintainers are free to repost it if they feel it worthwhile]: If we ask why Fortran is still in use after the appearance of dozens of other languages with features that Fortran lacks, one of the reasons surely has to be the huge publicly-available base of software written in Fortran, including EISPACK, LINPACK, LAPACK, ELLPACK, SPARSPAK, DIFFPACK, TOOLPACK, ..., and nearly 800 ACM and TOMS algorithms, plus other libraries such as ESSL, IMSL, NAG, PORT, Boeing BCSlib, and SLATEC [see @String{pub-PH = "Pren{\-}tice-Hall"} @String{pub-PH:adr = "Upper Saddle River, NJ 07458, USA"} @Book{Cowell:SDM84, editor = "Wayne R. Cowell", title = "Sources and Development of Mathematical Software", publisher = pub-PH, address = pub-PH:adr, pages = "xii + 404", year = "1984", ISBN = "0-13-823501-5", LCCN = "QA76.95 .S68 1984", bibdate = "Tue Dec 14 22:44:45 1993", series = "Prentice-Hall Series in Computational Mathematics, Cleve Moler, Advisor", } for a good survey of the state of Fortran software up to 1984; regrettably, I know of no book since that has provided similar coverage.] Ergo, in order for interval arithmetic to become widely used by people other than the small community of I-A researchers themselves, there needs to be a large body of well-documented, well-tested, and portable software to solve the same kinds of problems that the above-mentioned Fortran libraries do. Sadly, the lack of a common language in which to write I-A code has been a huge hindrance to its use. The average researcher has no interest in writing code in Pascal-SC, or for IBM's ACRITH package that is only available on mainframes, because there is no portability, and there is a large learning curve. Siegfried Rump's INTLAB toolkit for Matlab, and the I-A package for Mathematica, are worthy of mention. However, Matlab is a commercial product, and suffers from the single-implementation syndrome, like all of the symbolic algebra languages. [When there is only a single implementation of a programming language, users can be held hostage to bugs in the implementation, and there is no way to demonstrate honest implementation of the language specification. Indeed, for these systems, there almost never exists a rigorous public language specification, analogous to that provided by, e.g., the ISO Fortran, C, and C++ Standards, the Adobe PostScript and PDF Language Reference Manuals, and the Sun Java Language and Java Virtual Machine books.] Since last summer, I argue that this situation has now changed for the better, with the release of Sun's Workshop 6 compilers, with Fortran 90 and C++ support of I-A. While these are admittedly a vendor-specific solution, they happen to be available for the largest installed base of UNIX systems, and if their users find them useful, those users will demand COMPATIBLE support from other vendors as well. If we ask, how could I-A be made most-widely available in this way, the obvious answer is that I-A support must be implemented in the GNU gcc compiler suite, where, if done properly, it could provide I-A support for Ada, Chill, Fortran 77, C, C++, Objective-C, and Java, all in a highly-similar way, and most importantly, immediately available for all of the common computing environments today, from personal desktop systems running MS Windows, through the entire UNIX family, on up to supercomputers. This is certainly a nontrivial task; the weekly gcc-3.0 development snapshots now contain more than 1.4M lines of source code. Nevertheless, this could possibly be the most valuable I-A project that could be done today. It is almost certainly too big for a single individual, although an outstanding PhD candidate with a strong computer science background and understanding of I-A might be able to pull it off for one of the gcc languages. Another development possibility is this: IBM, HP, SGI, and Sun have all recently made significant corporate committments to supporting the open source movement, either through release of existing code (e.g., SGI's Pro64 compilers), or through support of GNU/Linux (e.g., IBM). If joint corporate funding, possibly augmented by government funding (NSF, NASA, and EEC), could be obtained for hiring a competent programmer team, perhaps through an existing GNU support company, such as Red Hat, then wide support of I-A might be achieved much more quickly. The sponsoring vendors would then be able to offer their customers I-A support in several languages, either through a repackaging of the GNU compilers (note that the now-defunct NeXT, and now Apple with Rhapsody, Darwin, and MacOS X, ship(ped) the gcc compilers, so there is a proven mechanism for commercial use of these compilers), or by porting the technology back into their own compiler families. I believe that they should do both, so as to avoid the single-implementation syndrome. Bringing this back to the I-A Web site question, I therefore propose that a clear top-level path be established that lets visitors rapidly find their way to whatever I-A software currently exists, and that the I-A community be strongly encouraged to contribute to that I-A software archive. [P.S. two recent postings of the I-A Web site address had typos: "uetp" instead of "utep". Perhaps the correct Web site URL should be included in either a footer of all reliable_computing postings, or as an X-URL header. There should also be an easily-searchable archive at the Web site of all back mail from the reliable_computing list.] ---------------------------------------------------------------------------- --- - 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 beebe [at] computer [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] louisiana.edu Thu Jun 21 11:34:34 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f5LGYYc00702 for reliable_computing-outgoing; Thu, 21 Jun 2001 11:34:34 -0500 (CDT) Received: from imf16bis.bellsouth.net (mail016.mail.bellsouth.net [205.152.58.36]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f5LGYTq00696 for ; Thu, 21 Jun 2001 11:34:29 -0500 (CDT) Received: from u8174 ([216.78.183.38]) by imf16bis.bellsouth.net (InterMail vM.5.01.01.01 201-252-104) with SMTP id <20010621163508.ZGYY18647.imf16bis.bellsouth.net@u8174> for ; Thu, 21 Jun 2001 12:35:08 -0400 Message-Id: <2.2.32.20010621163458.0075952c [at] pop [dot] louisiana.edu> X-Sender: rbk5287 [at] pop [dot] louisiana.edu X-Mailer: Windows Eudora Pro Version 2.2 (32) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Thu, 21 Jun 2001 11:34:58 -0500 To: reliable_computing [at] interval [dot] louisiana.edu From: "R. Baker Kearfott" Subject: reliable_computing archives Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Colleagues, There have been several recent inquiries on how to access the archives of this mailing list. In response, I am appending a list of "frequently asked questions." Best regards, R. Baker Kearfott ============================================================================ [Last updated on: Thursday June 21 11:30 2001] This mailing list, reliable_computing [at] interval [dot] louisiana.edu, is a mailing list with automatic maintenance by the "majordomo" software. This list is meant to stimulate discussion of topics on reliable computing, including the mathematics associated with automatic result verification, hardware and software issues of interval computations, high-accuracy or variable precision arithmetic, interfaces with symbolic computations and automatic differentiation, etc. Conference announcements, preprint announcements, book announcements, announcements of software availability and the like are particularly welcome. Anyone may automatically subscribe or unsubscribe themselves from the list. To subscribe, send mail to majordomo [at] interval [dot] louisiana.edu and include the line subscribe reliable_computing in the body. Similarly, to unsubscribe, send mail to majordomo [at] interval [dot] louisiana.edu, and include the line unsubscribe reliable_computing in the body. To get a complete list of commands available (such as adding persons other than yourself to the list), send mail to majordomo [at] interval [dot] louisiana.edu, and include the line help in the body. To send to everyone in the list, send your message to reliable_computing [at] interval [dot] louisiana.edu The list will initially be unmoderated, that is, any message sent to the list will be posted directly to the entire list. I would like your opinion on this, however. If you strongly prefer a moderated list (in which I read all articles before they are sent), please tell me. The advantage of a moderated list is that subscribers will not be bothered by offensive or irrelevant articles. The disadvantages include possible further delays before articles are posted and the fact that a single person (that is, I) decides what is relevant. I ask that people be thoughtful and considerate when posting articles to the list. Also, problems concerning the list itself should be directed to me, not to the list. Another option is to subscribe to the list reliable_computing-digest in the same manner as above. The digest is only sent periodically, and consists of collections of messages from reliable_computing. The list presently has between 450 and 500 recipients. ANOTHER FREQUENTLY ASKED QUESTION: > Concerning mails posted to reliable_computing [at] interval [dot] louisiana.edu, I was > wondering if these are centrally logged somewhere ? I also read that > there is a reliable_computing-digest. Can these digests be consulted > (long) after they have been sent? > There are both a "digest" and a monthly archive. These are all kept. The majordomo software should allow you to access these. For a command summary, send a message to majordomo [at] interval [dot] louisiana.edu The body of the message should consist of the single line help Archives from a particular month, say, from January, 1996, are stored as reliable_computing.9601 Thus, to get the January, 1996 archive, you would send a message with the following single line as its body: get reliable_computing reliable_computing.9601 The majordomo software will then send you the file reliable_computing.9601, and send you notification that it has done so in a separate message. --------------------------------------------------------------- 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/pub/interval_math/kearfott.html Department of Mathematics, University of Louisiana at Lafayette --------------------------------------------------------------- ============================================================================ --------------------------------------------------------------- R. Baker Kearfott, rbk [at] louisiana [dot] edu (337) 482-5346 (fax) (337) 482-5270 (work) (337) 981-9744 (home) URL: http://interval.louisiana.edu/kearfott.html Department of Mathematics, University of Louisiana at Lafayette Box 4-1010, Lafayette, LA 70504-1010, USA --------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] louisiana.edu Thu Jun 21 12:41:57 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f5LHfvf00928 for reliable_computing-outgoing; Thu, 21 Jun 2001 12:41:57 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f5LHfoq00923 for ; Thu, 21 Jun 2001 12:41:51 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id f5LHfih18901; Thu, 21 Jun 2001 11:41:44 -0600 (MDT) Message-Id: <200106211741.f5LHfih18901 [at] cs [dot] utep.edu> Date: Thu, 21 Jun 2001 11:41:42 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: new arrangement on the interval web front page To: reliable_computing [at] interval [dot] louisiana.edu Cc: berleant [at] iastate [dot] edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: txbU9tl/VnIUhS49F75Qjg== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear Friends, As you probably know, Dan Berleant volunteered to be a co-maintainer of the interval website. Here is the first result of our collaboration: Dan's proposal for the new front page (which looks very good to me). Please send us your comments whether it is a step in the right direction, and what other rearrangement you believe are necessary. We are very thankful to people who made suggestions, especially to Nelson Beebe. The new front page is at http://www.cs.utep.edu/interval-comp/main2.html Vladik From owner-reliable_computing [at] interval [dot] louisiana.edu Fri Jun 22 15:46:00 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f5MKjx400774 for reliable_computing-outgoing; Fri, 22 Jun 2001 15:45:59 -0500 (CDT) Received: from yonge.cs.toronto.edu (root [at] yonge [dot] cs.toronto.edu [128.100.1.8]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with SMTP id f5MKjtM00769 for ; Fri, 22 Jun 2001 15:45:55 -0500 (CDT) Received: from jane.cs.toronto.edu ([128.100.3.248]) by yonge.cs.toronto.edu with SMTP id <34019-29969>; Fri, 22 Jun 2001 16:45:38 -0400 Received: from dvp.cs.toronto.edu by jane.cs.toronto.edu id <453139-24698>; Fri, 22 Jun 2001 16:45:21 -0400 From: Ken Jackson To: reliable_computing [at] interval [dot] louisiana.edu Subject: Fields Informal Working Group on Validated Methods for ODEs and DAEs Cc: krj [at] cs [dot] toronto.edu Message-Id: <01Jun22.164521edt.453139-24698 [at] jane [dot] cs.toronto.edu> Date: Fri, 22 Jun 2001 16:45:18 -0400 Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk We intend to hold an informal working group on the "Validated Methods for ODEs and DAEs", 10-14 September 2001, as part of the Fields Institute Thematic Year on Computational Challenges in Science and Engineering. This event will be very unstructured. If you have a talk you'd like to give on a related topic, please bring it along. We could use that to start a discussion. The goal of this meeting is to start some new collaborations. Therefore, there will be lots of time to discuss new unsolved problems. For more information, see our webpage http://www.fields.utoronto.ca/programs/scientific/01-02/numerical/ODEandDAE/index.html From owner-reliable_computing [at] interval [dot] louisiana.edu Fri Jun 22 15:58:38 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f5MKwcE00856 for reliable_computing-outgoing; Fri, 22 Jun 2001 15:58:38 -0500 (CDT) Received: from imf12bis.bellsouth.net (mail012.mail.bellsouth.net [205.152.58.32]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f5MKwWM00851 for ; Fri, 22 Jun 2001 15:58:33 -0500 (CDT) Received: from u8174 ([216.78.183.196]) by imf12bis.bellsouth.net (InterMail vM.5.01.01.01 201-252-104) with SMTP id <20010622205914.JOWI12775.imf12bis.bellsouth.net@u8174> for ; Fri, 22 Jun 2001 16:59:14 -0400 Message-Id: <2.2.32.20010622205922.00745354 [at] pop [dot] louisiana.edu> X-Sender: rbk5287 [at] pop [dot] louisiana.edu X-Mailer: Windows Eudora Pro Version 2.2 (32) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Fri, 22 Jun 2001 15:59:22 -0500 To: reliable_computing [at] interval [dot] louisiana.edu From: "R. Baker Kearfott" Subject: Workshop on Validated Methods for ODE's and DAE's Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk From: Ken Jackson To: reliable_computing [at] interval [dot] usl.edu Subject: Fields Informal Working Group on Validated Methods for ODEs and DAEs Cc: krj [at] cs [dot] toronto.edu Message-Id: <01Jun22.144249edt.453139-24698 [at] jane [dot] cs.toronto.edu> Date: Fri, 22 Jun 2001 14:42:45 -0400 We intend to hold an informal working group on the "Validated Methods for ODEs and DAEs", 10-14 September 2001, as part of the Fields Institute Thematic Year on Computational Challenges in Science and Engineering. This event will be very unstructured. If you have a talk you'd like to give on a related topic, please bring it along. We could use that to start a discussion. The goal of this meeting is to start some new collaborations. Therefore, there will be lots of time to discuss new unsolved problems. For more information, see our webpage http://www.fields.utoronto.ca/programs/scientific/01-02/numerical/ODEandDAE/index.html --------------------------------------------------------------- R. Baker Kearfott, rbk [at] louisiana [dot] edu (337) 482-5346 (fax) (337) 482-5270 (work) (337) 981-9744 (home) URL: http://interval.louisiana.edu/kearfott.html Department of Mathematics, University of Louisiana at Lafayette Box 4-1010, Lafayette, LA 70504-1010, USA --------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] louisiana.edu Fri Jun 22 22:15:18 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f5N3FH201199 for reliable_computing-outgoing; Fri, 22 Jun 2001 22:15:17 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f5N3FCM01194 for ; Fri, 22 Jun 2001 22:15:12 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id f5N3F9A28823; Fri, 22 Jun 2001 21:15:09 -0600 (MDT) Message-Id: <200106230315.f5N3F9A28823 [at] cs [dot] utep.edu> Date: Fri, 22 Jun 2001 21:15:09 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: Pat Nava receives IEEE Medal To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu Cc: pnava [at] ece [dot] utep.edu, vladik [at] cs [dot] utep.edu, nafips-l [at] sphinx [dot] gsu.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: HldgpyFEKhciIPIlXpWRqQ== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Patricia A. Nava from the Department of Computer and Electrical Engineering of the University of Texas at El Paso received the Third Millennium Medal from the Institute of Electrical and Electronic Engineers (IEEE). The medal is awarded to IEEE members who have provided valuable services and outstanding contributions to the Institute. Pat's research involves combining interval, fuzzy, and neural techniques. She has shown that the resulting "hybrid" techniques improve the quality of many practical tasks such as voice recognition. From owner-reliable_computing [at] interval [dot] louisiana.edu Wed Jun 27 09:56:20 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f5REuKK00369 for reliable_computing-outgoing; Wed, 27 Jun 2001 09:56:20 -0500 (CDT) Received: from imap.ufrn.br (muriu.dimap.ufrn.br [200.19.160.21]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f5REu6j00364 for ; Wed, 27 Jun 2001 09:56:13 -0500 (CDT) Received: from lagoanova (lagoanova [10.9.96.180]) by Wed Jun 27 11:55:33 2001imap.ufrn.br (8.9.3/8.9.1) with SMTP id LAA04726 for ; Wed, 27 Jun 2001 11:55:33 -0300 Reply-To: From: "regivan" To: Subject: Hammind distance Date: Wed, 27 Jun 2001 11:55:33 -0300 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) X-Mimeole: Produced By Microsoft MimeOLE V5.00.2314.1300 Importance: Normal Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Is there someone with a reference about "Hamming distance" ? I would be glad for any information. Regards Regivan