From owner-reliable_computing [at] interval [dot] usl.edu Fri Sep 1 09:57:19 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id JAA04905 for reliable_computing-outgoing; Fri, 1 Sep 2000 09:57:19 -0500 (CDT) Received: from hplms26.hpl.hp.com (hplms26.hpl.hp.com [15.255.168.31]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id JAA04900 for ; Fri, 1 Sep 2000 09:57:10 -0500 (CDT) From: sventek [at] labs [dot] agilent.com Received: from hplms2.hpl.hp.com (hplms2.hpl.hp.com [15.0.152.33]) by hplms26.hpl.hp.com (8.9.3 (PHNE_18979)/HPL-PA Relay) with ESMTP id HAA28742 for ; Fri, 1 Sep 2000 07:56:30 -0700 (PDT) Received: from sqf2004.sqf.hp.com (sqf2004.sqf.hp.com [15.144.184.84]) by hplms2.hpl.hp.com (8.10.2/8.10.2 HPL-PA Hub) with SMTP id e81EuSh12889 for ; Fri, 1 Sep 2000 07:56:28 -0700 (PDT) Message-Id: <200009011456.e81EuSh12889 [at] hplms2 [dot] hpl.hp.com> Subject: Middleware 2001 Call for Participation Date: Fri, 01 Sep 2000 15:56:20 GDT To: reliable_computing [at] interval [dot] usl.edu Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk ======================================================== APOLOGIES to those who receive duplicates of this call ======================================================== Call For Contributions Middleware 2001 IFIP/ACM INTERNATIONAL CONFERENCE ON DISTRIBUTED SYSTEMS PLATFORMS Middleware is now widely acknowledged to be the premier conference on distributed systems platforms and open distributed processing. The conference is a synthesis of the major conferences and workshops in this area into a single international event. Highlights of Middleware 2001 will include a high-quality technical program, full and half-day tutorials, invited speakers, poster presentations and an advanced topic workshop, all held in the beautiful university city of Heidelberg, Germany. The focus of Middleware 2001 is on the design, implementation, deployment and evaluation of distributed systems platforms and architectures for future networked environments. Of particular interest is the experience with both new and existing architectures and platforms (such as RM-ODP, CORBA, RMI and DCOM) in environments which may include public, private and mobile networks, overlaid wired and wireless technologies, IPv6 and IP multicast, multimedia and real-time information and an increasing volume of WWW and Java traffic. Key Topics ========== The conference seeks original, unpublished research and experience papers on all aspects of systems support for distributed applications including case studies on the use of such technologies and examples of advanced distributed applications. The following topics have been identified by the program committee as being of special relevance to the conference: * integration of middleware platforms with web and Java technologies. * real-time middleware platforms including real-time ORBs. * reliable middleware platforms including fault-tolerant ORBs. * provision of multimedia support in middleware platforms. * applications of, and support for, QoS in middleware platforms. * event based, publish/subscribe and asynchronous platforms. * novel paradigms and APIs for distributed systems platforms. * open architectures for adaptive and reflective systems. * applications of middleware technologies including telematics and commerce. * extensions and refinements to RM-ODP, CORBA, DCOM etc. * the impact of emerging Internet technologies on middleware platforms. * distributed systems management and interactive configuration and development tools. * issues of scalability in existing and new distributed systems platforms. * engineering distributed systems in heterogeneous and mobile networks. Advanced Topic Workshop - Middleware for Mobile Computing ========================================================= The software infrastructure to support mobile applications is becoming critically important to the next horizon in computing. This one-day workshop is intended as a forum for understanding the issues associated with this emerging area of middleware for mobile computing. We propose to focus the discussion on the following key topics: * Requirements on mobile middleware. * Paradigms and platforms for mobile computing. * Service architectures and novel services. * Performance and manageability issues. We are interested in work-in-progress and visionary papers as well as experimental and systems-related papers. To encourage a working atmosphere, the workshop will invite a limited number of conference participants based on position papers. Position papers should be two to four pages in length and will be reviewed by the workshop program committee. Submission Guidelines ===================== Middleware 2001 seeks submissions in the following forms: * Full technical papers. These should describe original, unpublished research or experience and be no longer than 7000 words. * Work-in-progress papers. These should describe on-going work and interim results. Submissions should be no longer than 2500 words. * Posters. Posters can be used to publicize current research initiatives. A 500-word summary of the poster's contents should be submitted. * Tutorial proposals. Middleware 2001 aims to include a number of high- quality tutorials in areas relevant to the conference themes. Tutorial proposals should be no longer than 1000 words and should include the intended audience, duration (full or half day) and speaker biographies for the tutorial. * Advanced topic position papers. These should be 2-4 pages in length. All technical papers will be reviewed by members of the Program Committee; advanced topic position papers will be reviewed by the workshop program committee. Full papers accepted for presentation at Middleware 2001 will be included in the proceedings published by Springer Verlag (LNCS series). For outstanding full papers and workshop position papers, extended versions of selected research papers will be considered for publication in "IEEE Transactions on Parallel and Distributed Systems" and extended versions of experience papers will be considered for publication in "Software: Practice and Experience". Work in progress and poster submissions will be made available to conference delegates but will not appear in the published proceedings. Advanced topic position papers will be made available to workshop attendees. Papers must be submitted in Postscript or PDF formats. Please ensure the first page of your submission includes the paper title, an abstract and the address, telephone, FAX and email of the primary contact person and that the nature of your submission (full paper, work-in-progress paper etc.) is clearly identified. Conference information and style guidelines for submissions will be available soon at http://www.labs.agilent.com/middleware2001 Further information may be obtained from the program chair, the tutorial chair, the works-in-progress chair, or the workshop chair. Important dates =============== 07 May 2001 regular paper abstract 15 May 2001 full regular paper 15 June 2001 tutorial proposal 15 June 2001 work in progress paper 15 June 2001 poster proposal 15 June 2001 workshop position paper Notification by: 07 July 2001 Final versions due by: 07 August 2001 Conference convenes: 12-16 November 2001 Organization ============ General Chair ------------- Joe Sventek, Agilent Laboratories, Scotland. WIP and Poster Chair -------------------- Maartin van Steen, Vrije Universiteit, the Netherlands. Tutorials Chair --------------- Frank Buschmann, Siemens AG, Germany. Publicity Chair --------------- Joe Sventek, Agilent Laboratories, Scotland. Advanced Workshop Chair ----------------------- Guruduth Banavar, IBM, USA. Local Arrangements Chair ------------------------ Alex Buchmann, Universitaet Darmstadt, Germany. Steering Committee ------------------ Jan de Meer (chair), GMD-Fokus, Germany. Partha Dasgupta, Arizona State University, USA. Kerry Raymond, DSTC, Australia. Alexander Schill, TU Dresden, Germany. Jacob Slonim, Dalhousie University, Canada. Gordon Blair, Lancaster University, UK. Guy LeDuc, University of Liege, Belgium. Program Chair ------------- Rachid Guerraoui, EPF Lausanne, Switzerland. Program Committee ----------------- Gustavo Alonso, ETH Zurich, Switzerland. Jean Bacon, Cambridge University, UK. Geoff Coulson, Lancaster University, UK. Pascal Felber, Bell Labs, USA. Jean-Charle Fabre, Laas-CNRS, France. Svend Frolund, HP Labs, USA. Naranker Dulay, Imperial College, UK. Peter Honeyman, CITI, University of Michigan, USA. Yennun Huang, AT&T Labs, USA. Anne-Marie Kermarrec, Microsoft Research, UK. Doug Lea, SUNY at Oswego, USA. Christoph Liebig, Universitaet Darmstadt, Germany. Claudia Linnhoff-Popien, Universitaet Muenchen, Germany. Louise Moser, University of California at Santa Barbara. Silvano Maffeis, Softwired Inc., Switzerland. Fabio Panzieri, Universita' di Bologna, Italy. Luis Rodrigues, Universidade de Lisboa, Portugal. Isabelle Rouvellou, IBM, USA. Jean-Bernard Stefani, France Telecom R&D, Grenoble, France. Santosh Shrivastava, Newcastle University, UK. Zahir Tari, RMIT University, Australia. Steve Vinoski, IONA Technologies, USA. Werner Vogels, Cornell University, USA. Gregor von Bochmann, University of Ottawa, Canada. From owner-reliable_computing [at] interval [dot] usl.edu Sun Sep 3 20:11:24 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id UAA09021 for reliable_computing-outgoing; Sun, 3 Sep 2000 20:11:24 -0500 (CDT) Received: from mtu.ru (ns.mtu.ru [195.34.32.10]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id UAA09016 for ; Sun, 3 Sep 2000 20:11:19 -0500 (CDT) Received: from ns1.glasnet.ru.glasnet.ru (ppp105-134.dialup.mtu-net.ru [212.188.105.134]) by mtu.ru (Postfix) with SMTP id 4298045FA; Mon, 4 Sep 2000 05:10:27 +0400 (MSD) (envelope-from Yakovlev@rc-journal.mtu-net.ru) Message-ID: <003e01c0160c$d6477600$0f03efc3 [at] glasnet [dot] ru.glasnet.ru> Reply-To: "Alexander G. Yakovlev" From: "Alexander G. Yakovlev" To: Subject: My additional address has been changed Date: Mon, 4 Sep 2000 05:08:46 +0400 MIME-Version: 1.0 Content-Type: text/plain; charset="koi8-r" Content-Transfer-Encoding: 7bit X-Priority: 1 X-MSMail-Priority: High X-Mailer: Microsoft Outlook Express 5.00.2417.2000 X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2314.1300 X-Recipient: ae42 [at] rz [dot] uni-karlsruhe.de Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear colleagues, I would like to inform you that my additional (for large messages) address scdl [at] glasnet [dot] ru is not actual starting this moment. Instead of this address please write me to scdl [at] online [dot] ru My main address Yakovlev@rc-journal.mtu-net.ru is also available. Please use it for relatively small messages (for instance, not more than 15 KB). Sincerely yours, Alexander Yakovlev, Managing Editor of the journal `Reliable Computing' From owner-reliable_computing [at] interval [dot] usl.edu Mon Sep 4 08:34:29 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id IAA10608 for reliable_computing-outgoing; Mon, 4 Sep 2000 08:34:29 -0500 (CDT) Received: from into.nit.spb.ru (ns.nit.spb.ru [212.193.6.225]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id IAA10603 for ; Mon, 4 Sep 2000 08:34:14 -0500 (CDT) Received: from slava.UUCP (uucp@localhost) by into.nit.spb.ru (8.8.7/8.8.7) with UUCP id RAA02251 for reliable_computing [at] interval [dot] louisiana.edu; Mon, 4 Sep 2000 17:36:09 +0400 (MSD) (envelope-from slava.nit.spb.su!nest [at] slava [dot] nit.spb.su) Received: by slava.nit.spb.su (dMail for DOS v1.23, 15Jun94); Sun, 3 Sep 2000 15:09:16 +0400 To: reliable_computing [at] interval [dot] louisiana.edu Message-Id: Organization: Slava Nesterov Date: Sun, 3 Sep 2000 15:09:16 +0400 (MSD) Reply-To: nest [at] into [dot] nit.spb.su From: "Slava Nesterov" X-Mailer: dMail [Demos Mail for DOS v1.23] Subject: Re: Inner estimation? Lines: 27 Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Baker, My paper in Reliable Computing vol 3, n.4, 1997 is devoted to exactly this problem. Slava --Can you post anything you know about literature regarding inner estimation --of arithmetic expressions? In particular, if {\ivl x} is a usual interval, --and E(x) is an algebraic expression in the real variable x, how might --we use arithmetic to obtain a set I such that -- --I \subseteq {y | y\in the range of E over {\ivl x}} -- --and such that I is not empty??? -- --I am aware of some of the work of Sergei Shary in this regard, in --particular, for inner estimates of solutions to linear systems, but --can that arithmetic be used for general expressions? What, in your --opinion, is the best introductory literature to the subject? -- --Best regards, -- --Baker  From owner-reliable_computing [at] interval [dot] usl.edu Tue Sep 5 07:41:29 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id HAA12680 for reliable_computing-outgoing; Tue, 5 Sep 2000 07:41:29 -0500 (CDT) Received: from interval.usl.edu (rbk5287@interval [130.70.43.77]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with SMTP id HAA12675 for ; Tue, 5 Sep 2000 07:41:25 -0500 (CDT) Message-Id: <200009051241.HAA12675 [at] interval [dot] usl.edu> Date: Tue, 5 Sep 2000 07:41:24 -0500 (CDT) From: "Kearfott R. Baker" Reply-To: "Kearfott R. Baker" Subject: Change of address for Eldar Musaev To: reliable_computing [at] interval [dot] usl.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: kA2dASR2Q34Tv2AQf8pkOw== X-Mailer: dtmail 1.2.1 CDE Version 1.2.1 SunOS 5.6 sun4m sparc Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Subject: Change of address Date: Sun, 3 Sep 2000 22:33:01 -0700 MIME-Version: 1.0 Dear friends and colleagues, I'd like to inform you that my address Eldar [at] ibm [dot] net, you were using to = communicate with me for about 4 years will cease to exist shortly. Please, use my new address Musayev [at] usa [dot] net. Alternatively you can use = address EMusayev [at] acm [dot] org, which will redirect the mail to my current = correct address, whatever it will be for any foreseeable future. With best regards, Eldar Musayev From owner-reliable_computing [at] interval [dot] usl.edu Wed Sep 6 23:02:30 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id XAA16498 for reliable_computing-outgoing; Wed, 6 Sep 2000 23:02:29 -0500 (CDT) 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 XAA16493 for ; Wed, 6 Sep 2000 23:02:21 -0500 (CDT) 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 WAA04563; Wed, 6 Sep 2000 22:53:17 -0500 (CDT) Date: Wed, 6 Sep 2000 22:35:57 -0500 (CDT) From: Hans Schneider Reply-To: 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 Dear Net Oerganizer: Please circulate these LAA contents over your net, Thanks hans ------------------------------------------------------------------------------ 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) ------------------------------------------------------------------------------ ContentsDirect from Elsevier Science ===================================== Journal: Linear Algebra and its Applications ISSN : 0024-3795 Volume : 317 Issue : 1-3 Date : 15-Sep-2000 NOTE: ContentsDirect, which is automatically generated, lists the first author of each paper and the corresponding author (if different). Please note that subscribers can access full text and abstracts through the provided URLs. Visit the journal at http://www.elsevier.nl/locate/jnlnr/07738 pp 1-12 Algebraic constructions of the minimal forbidden digraphs of strong sign nonsingular matrices J.-Y. Shao, Z.-X. Hu http://www.elsevier.nl/PII/S0024379500001038 pp 13-40 Normal forms of ''near similarity'' transformations and linear matrix equations A. Tovbis http://www.elsevier.nl/PII/S0024379500001129 pp 41-52 Nearly L-matrices and generalized row sign balanced matrices J.-Y. Shao, S.-G. Hwang http://www.elsevier.nl/PII/S0024379500001178 pp 53-102 Canonical matrices for linear matrix problems V.V. Sergeichuk http://www.elsevier.nl/PII/S0024379500001506 pp 103-125 Block ILU factorization preconditioners for a block-tridiagonal H-matrix S.W. Kim, J.H. Yun http://www.elsevier.nl/PII/S0024379500001464 pp 127-141 Numerical range of linear pencils P.J. Psarrakos http://www.elsevier.nl/PII/S0024379500001452 pp 143-176 Anti-triangular and anti-m-Hessenberg forms for Hermitian matrices and pencils C. Mehl http://www.elsevier.nl/PII/S0024379500001567 pp 177-192 State feedback in linear control theory S. Mondie, P. Zagalak, V. Kucera http://www.elsevier.nl/PII/S0024379500001531 pp 193-200 On the third largest eigenvalue of a graph B. Liu, Z. Bo http://www.elsevier.nl/PII/S0024379500001592 pp 201-205 Disproof of a conjecture on the existence of the path-recursive period for a connected graph X. Yong, S. Cao http://www.elsevier.nl/PII/S0024379500001622 pp 207-216 Elementary operators and orthogonality A. Turnsek http://www.elsevier.nl/PII/S0024379500001634 pp 217-224 A note on diagonally dominant matrices G. Dahl http://www.elsevier.nl/PII/S0024379500001786 pp 225-226 The exponential Vandermonde matrix J. Robbin, D. Salamon http://www.elsevier.nl/PII/S0024379500001865 pp 227-240 Modified Gauss-Seidel type methods and Jacobi type methods for Z-matrices W. Li, W. Sun http://www.elsevier.nl/PII/S0024379500001403 pp 241 Index w From owner-reliable_computing [at] interval [dot] usl.edu Thu Sep 7 09:39:34 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id JAA18145 for reliable_computing-outgoing; Thu, 7 Sep 2000 09:39:33 -0500 (CDT) Received: from elm.fernuni-hagen.de (elm.fernuni-hagen.de [132.176.114.24]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id JAA18140 for ; Thu, 7 Sep 2000 09:39:26 -0500 (CDT) Received: from hilbert.theoinf-fernuni-hagen.de (actually hilbert.fernuni-hagen.de) by elm.fernuni-hagen.de via local-channel with SMTP; Thu, 7 Sep 2000 16:39:17 +0200 Received: by hilbert.theoinf-fernuni-hagen.de (SMI-8.6/SMI-SVR4) id QAA06000; Thu, 7 Sep 2000 16:39:16 +0200 Date: Thu, 7 Sep 2000 16:39:16 +0200 From: Vasco.Brattka@FernUni-Hagen.de (Vasco Brattka) Message-Id: <200009071439.QAA06000 [at] hilbert [dot] theoinf-fernuni-hagen.de> To: reliable_computing [at] interval [dot] louisiana.edu Subject: CCA2000 X-Sun-Charset: US-ASCII Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk _______________________________________________________________________ C C A 2 0 0 0 Fourth Workshop on Computability and Complexity in Analysis September 17-19, 2000, Swansea, Wales _______________________________________________________________________ Call for Participation _______________________________________________________________________ Aim The aim of the workshop is to bring together people interested in computability and complexity aspects of analysis and to explore connections with numerical methods, physics and, of course, computer science. Submissions on any aspect of these subjects are welcome. Program Committee Ker-I Ko (Stony Brook, USA) Marian Pour-El (Minnesota , USA) Dana Scott (Carnegie-Mellon, USA) Viggo Stoltenberg-Hansen (Uppsala, Sweden) John V. Tucker (Swansea, Wales) Klaus Weihrauch, chair (Hagen, Germany) Mariko Yasugi (Kyoto Sangyo, Japan) Ning Zhong (Cincinnati, USA) Jeff Zucker (McMaster, Canada) Organizing Committee Jens Blanck (Swansea, Wales) csjens [at] swansea [dot] ac.uk Vasco Brattka (Hagen, Germany) vasco.brattka@fernuni-hagen.de Peter Hertling (Hagen, Germany) peter.hertling@fernuni-hagen.de Competition & Forum David Lester (Manchester, England) dlester [at] cs [dot] man.ac.uk _______________________________________________________________________ Preliminary Program _______________________________________________________________________ Sunday, September 17 _______________________________________________________________________ 14:00 Opening 14:10 Ning Zhong Turing Computability of the Schroedinger Propagator 14:35 Abbas Edalat and Andre Lieutier Domain of Differentiable Functions 15:00 Break 15:30 Keye Martin Complexity and Verification of a Renee Equation 15:55 Matthias Schroeder Admissible Representations of Limit Spaces 16:20 Break 16:50 Yoshiki Tsujii, Mariko Yasugi and Takakazu Mori Some Properties of the Effectively Uniform Topological Space 17:15 Armin Hemmerling Standard Representations of Effective Metric Spaces 17:40 Break 18:30 Dinner _______________________________________________________________________ Monday, September 18 _______________________________________________________________________ 8:35 Ulrich Kohlenbach On the Computational Content of the Krasnoselski and Ishikawa Fixed Point Theorems 9:00 Dmitry Buy Some Remarks about Fixpoint Theorems 9:25 Izumi Takeuti Effective Fixed Point Theorem Over a Non-Separable Space 9:50 Break 10:20 Martin Ziegler and Vasco Brattka A Computable Spectral Theorem 10:45 Tobias Gaertner and Guenter Hotz Recursive Analytic Functions of a Complex Variable 11:10 Break 11:40 Abbas Edalat, Elham Kashefi and Andre Lieutier The Convex Hull is Computable! 12:05 Marko Krznaric Computing a Required Absolute Precision from an Exact Floating Point Number ----------------------------------------------------------------------- 12:30 Lunch break ----------------------------------------------------------------------- 14:30 Namhyun Hur and James H. Davenport A Generic Root Operation for Exact Real Arithmetic 14:55 Tom Kelsey Exact Numerical Computation via Symbolic Computation 15:20 Break 15:50 Norbert Th. Mueller The iRRAM: Exact Arithmetic in C++ 16:15 Paul Gowland and David Lester A Survey on Exact Computer Arithmetic 16:40 Break 17:10 Competition 18:10 Break 19:00 Dinner _______________________________________________________________________ Tuesday, September 19 _______________________________________________________________________ 8:35 Jens Blanck Effectivity of Regular Spaces 9:00 Hiroyasu Kamo Effective Contraction Theorem and its Application 9:25 Charles Meyssonnier, Paolo Boldi and Sebastiano Vigna delta-approximable Functions 9:50 Break 10:20 Daniel Richardson The Uniformity Conjecture 10:45 Klaus Weihrauch On Computable Metric Spaces Tietze-Urysohn Extension is Computable 11:10 Break 11:40 Takakazu Mori Computabilities of Functions on Effectively Separable Metric Spaces 12:05 Forum ----------------------------------------------------------------------- 12:30 Lunch break ----------------------------------------------------------------------- 14:30 Peter Hertling Banach-Mazur Computable Functions on Metric Spaces 14:55 George Kapoulas Polynomially Time Computable Functions over p-adic Fields 15:20 Break 15:50 Hideki Tsuiki Computational Dimension of Topological Spaces Based on Embeddings to n-bottom-Sequence Spaces 16:15 Margarita V. Korovina and Oleg V. Kudinov A Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory 16:40 Break 17:10 Ashley Burrows and David Lester Exact Arithmetic and the Korteweg-de Vries Equation 17:35 Vasco Brattka A Computable Kolmogorov Superposition Theorem 18:00 End of CCA'2000 _______________________________________________________________________ Venue The venue of the workshop is Department of Computer Science, University of Wales Swansea. How to get there If you arrive at Heathrow the fastest way is to take the raillink bus to Reading and change to train. Tickets can be bought for the whole trip at the train ticket desks in the terminals. The trains are operated by Great Western. There are also buses operated by National Express leaving from the central bus station. Once in Swansea you should take a taxi to the university. If you arrive by car on the M4 you should leave at Junction 42 for Swansea and Gower. Continue to head for Gower until the signs for the university appears on the right hand side. Finding your way on campus The conference will take place in building 8.1. The accommodation is in building 20. The lunches and the dinner on Sunday will be served in building 17. Accommodation Accomodation is available on campus for 32 pounds per night including breakfast. Bookings need to be made as soon as possible: CCA2000 Mrs Jill Edwards Department of Computer Science University of Wales Swansea Singleton Park Swansea SA2 8PP UK Phone +44 1792 295393 csjill [at] swan [dot] ac.uk The on campus accommodation is in building 20. There should be porters there to give you keys to your room. Fee A conference fee of 60 pounds including 2 evening meals and two lunches will apply. Finding something to eat There is a pub situated just outside the campus to the southwest. Plenty of restaurants can of course be found in the city of Swansea, which is about 3 km away. The Dylan Thomas Centre, between the museum and Sainsbury's on the city map, serves excellent meals at reasonable prices. The former fishing village of Mumbles is situated 4 km south of campus and has a number of restaurants. Web site http://www.informatik.fernuni-hagen.de/cca/cca2000/ From owner-reliable_computing [at] interval [dot] usl.edu Thu Sep 7 11:22:31 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id LAA18550 for reliable_computing-outgoing; Thu, 7 Sep 2000 11:22:30 -0500 (CDT) Received: from disi.unige.it (mailhost.disi.unige.it [130.251.61.19]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id LAA18545 for ; Thu, 7 Sep 2000 11:22:25 -0500 (CDT) Received: from [130.251.61.155] (reggio [130.251.61.155]) by disi.unige.it (8.8.8/8.8.8) with ESMTP id RAA23773; Thu, 7 Sep 2000 17:25:15 +0200 (MET DST) Mime-Version: 1.0 Message-Id: Date: Thu, 7 Sep 2000 17:23:13 +0100 To: etaps2001 [at] disi [dot] unige.it From: Etaps 2001 Subject: ETAPS 2001: SECOND ANNOUNCEMENT & CALL FOR SUBMISSIONS Content-Type: text/plain; charset="us-ascii" ; format="flowed" Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk ETAPS 2001 APRIL 2 - 6, 2001 - GENOVA, ITALY The European Joint Conferences on Theory and Practice of Software (ETAPS) is a loose and open confederation of conferences and other events that has become the primary European forum for academic and industrial researchers working on topics relating to Software Science. http://www.disi.unige.it/etaps2001/ SECOND ANNOUNCEMENT & CALL FOR SUBMISSIONS ----------------------------------------------------------------------- 5 Conferences - Tutorials - Tool Demonstrations - 8 Satellite Events ----------------------------------------------------------------------- CONFERENCES ----------------------------------------------------------------------- CC 2001: International Conference on Compiler Construction Chair: Reinhard Wilhelm ESOP 2001, European Symposium On Programming Chair: David Sands FASE 2001, Fundamental Approaches to Software Engineering Chair: Heinrich Hussmann FOSSACS 2001, Foundations of Software Science and Computation Structures Chair: Furio Honsell TACAS 2001, Tools and Algorithms for the Construction and Analysis of Systems Chairs: Tiziana Margaria and Wang Yi Prospective authors are invited to submit, before October 20, 2001, full papers in English presenting original research. Submitted papers must be unpublished and not submitted for publication elsewhere. In particular, simultaneous submission of the same contribution to multiple ETAPS conferences is forbidden. The proceedings of each main conference will be published as a separate volume in the Springer Verlag Lecture Notes in Computer Science series. TUTORIALS ----------------------------------------------------------------------- Proposals for half-day or full-day tutorials related to ETAPS 2001 are invited. Tutorial proposals will be evaluated on the basis of their assessed benefit for prospective participants to ETAPS 2001. Contact: Bernhard Rumpe (Technische Universitaet Munchen, Germany) TOOL DEMONSTRATIONS ----------------------------------------------------------------------- Demonstrations of tools presenting advances on the state of the art are invited. Submissions in this category should present tools having a clear connection to one of the main ETAPS conferences, possibly complementing a paper submitted separately. These should not be confused with contributions to TACAS, which emphasizes principles of tool design, implementation, and use, rather than focusing on specific domains of application. Contact: Don Sannella (University of Edinburgh) SATELLITE EVENTS ----------------------------------------------------------------------- Besides the five main conferences the following satellite events are planned for ETAPS 2001 CMCS: Co-algebraic Methods in Computer Science Contact: Ugo Montanari (Universita' di Pisa, Italy) ETI Day: Electronic Tool Integration platform Day Contacts: Tiziana Margaria (Universitaet Dortmund, Germany) and Andreas Podelski (MPI Saarbrucken, Germany) JOSES: Java Optimization Strategies for Embedded Systems Contact: Uwe Assmann (Universitat Karlsruhe, Germany) LDTA: Workshop on Language Descriptions, Tools and Applications Contact: Mark van den Brand (CWI Amsterdam, The Netherlands) PFM: Proofs For Mobility Contact: Davide Sangiorgi (INRIA-Sophia Antipolis, France) RelMiS: Relational Methods in Software Contact: Wolfram Kahl (Universitaet der Bundeswehr Munchen, Germany) UNIGRA: Uniform Approaches to Graphical Process Specification Techniques Contact: Julia Padberg (Technische Universitaet Berlin, Germany) WADT: Workshop on Algebraic Development Techniques Contact: Maura Cerioli (DISI-Universita' di Genova, Italy) IMPORTANT DATES: ----------------------------------------------------------------------- October 20, 2000: Submissions Deadline for the Main Conferences, Demos and Tutorials December 15, 2000: Notification of Acceptance/Rejection January 15 2001: Camera-ready Version Due April 2-6, 2001: ETAPS 2001 in Genova March 31 - April 8, 2001: Satellite Events ----------------------------------------------------------------------- [ Sorry for multiple copies. Do not reply to this message. If you believe we have sent this to a list not appropriate, please let us know by mailing to etaps2001 [at] disi [dot] unige.it ] From owner-reliable_computing [at] interval [dot] usl.edu Thu Sep 7 13:28:55 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id NAA19161 for reliable_computing-outgoing; Thu, 7 Sep 2000 13:28:55 -0500 (CDT) Received: from wren.prod.itd.earthlink.net (wren.prod.itd.earthlink.net [207.217.121.64]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id NAA19156 for ; Thu, 7 Sep 2000 13:28:52 -0500 (CDT) Received: from company.mail (ip81.garden-city2.ny.pub-ip.psi.net [38.26.50.81]) by wren.prod.itd.earthlink.net (8.9.3/8.9.3) with ESMTP id LAA19014 for ; Thu, 7 Sep 2000 11:25:42 -0700 (PDT) Received: from ramas.com [192.0.0.24] by company.mail [127.0.0.1] with SMTP (MDaemon.v3.1.0.R) for ; Thu, 07 Sep 2000 14:23:51 -0400 Message-ID: <39B7DC16.1D366EA6 [at] ramas [dot] com> Date: Thu, 07 Sep 2000 14:19:02 -0400 From: Scott Ferson Organization: Applied Biomathematics X-Mailer: Mozilla 4.73 [en] (Win98; U) X-Accept-Language: en MIME-Version: 1.0 To: "reliable_computing [at] interval [dot] usl.edu" Subject: axioms for interval analysis? Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit X-MDaemon-Deliver-To: reliable_computing [at] interval [dot] usl.edu X-Return-Path: scott [at] ramas [dot] com X-MDRcpt-To: reliable_computing [at] interval [dot] usl.edu X-MDRemoteIP: 192.0.0.24 Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk I think that Vladik Kreinovich may disapprove of the following question, but I ask it out of curiosity. Have there been axiomatizations of interval analysis? It might be suggested that the axioms of arithmetic (http://library.thinkquest.org/10030/2arithax.htm): closure, commutativity, associativity, identity element, inverse element, and distributivity, for addition and multiplication could simply be weakened so that inverse element becomes subcancellation, and distributivity becomes subdistributivity. Should such a weakened set be considered the "axioms of interval analysis"? If so, it would seem that fuzzy arithmetic (sensu Kauffman and Gupta) must be a special case, because it obeys them too. What distinguishes the essence of the interval approach? In 1993, Rabinovich offered three "axioms" for the theory measurement error: 1) the true value exists, 2) the true value is constant, and 3) the true value cannot be found. While these lack a certain mathematical character, they do seem closer to the spirit of interval analysis. Is this an inappropriate question? Scott Ferson Applied Biomathematics 631-751-4350, fax -3435 From owner-reliable_computing [at] interval [dot] usl.edu Thu Sep 7 14:56:45 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id OAA19614 for reliable_computing-outgoing; Thu, 7 Sep 2000 14:56:45 -0500 (CDT) 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 OAA19609 for ; Thu, 7 Sep 2000 14:56:37 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.10.1/8.10.1) with SMTP id e87JtmO11185; Thu, 7 Sep 2000 13:55:48 -0600 (MDT) Message-Id: <200009071955.e87JtmO11185 [at] cs [dot] utep.edu> Date: Thu, 7 Sep 2000 13:55:47 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: Re: axioms for interval analysis? To: reliable_computing [at] interval [dot] usl.edu, scott [at] ramas [dot] com Cc: smarkov [at] iph [dot] bio.bas.bg MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: IwwklsxOPACg7xtMkKLmkQ== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear Scott, Svetoslav Markov (email smarkov [at] iph [dot] bio.bas.bg) has done a lot of work on algebraic characterization of interval arithmetic. I think he would give you the best bibliography of his and related work. Vladik P.S. Nothing wrong with asking a question, why should I disapprove of it. smarkov [at] iph [dot] bio.bas.bg > Date: Thu, 07 Sep 2000 14:19:02 -0400 > From: Scott Ferson > X-Accept-Language: en > MIME-Version: 1.0 > To: "reliable_computing [at] interval [dot] usl.edu" > Subject: axioms for interval analysis? > Content-Transfer-Encoding: 7bit > X-MDaemon-Deliver-To: reliable_computing [at] interval [dot] usl.edu > X-Return-Path: scott [at] ramas [dot] com > X-MDRcpt-To: reliable_computing [at] interval [dot] usl.edu > X-MDRemoteIP: 192.0.0.24 > > > I think that Vladik Kreinovich may disapprove of > the following question, but I ask it out of curiosity. > > Have there been axiomatizations of interval analysis? > > It might be suggested that the axioms of arithmetic > (http://library.thinkquest.org/10030/2arithax.htm): > closure, > commutativity, > associativity, > identity element, > inverse element, and > distributivity, > for addition and multiplication could simply be > weakened so that inverse element becomes > subcancellation, and distributivity becomes > subdistributivity. Should such a weakened set be > considered the "axioms of interval analysis"? If so, > it would seem that fuzzy arithmetic (sensu Kauffman > and Gupta) must be a special case, because it > obeys them too. What distinguishes the essence > of the interval approach? > > In 1993, Rabinovich offered three "axioms" for the > theory measurement error: > 1) the true value exists, > 2) the true value is constant, and > 3) the true value cannot be found. > While these lack a certain mathematical character, > they do seem closer to the spirit of interval analysis. > > Is this an inappropriate question? > > Scott Ferson > Applied Biomathematics > 631-751-4350, fax -3435 > From owner-reliable_computing [at] interval [dot] usl.edu Fri Sep 8 04:42:35 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id EAA21493 for reliable_computing-outgoing; Fri, 8 Sep 2000 04:42:35 -0500 (CDT) Received: from animal.cs.chalmers.se (root [at] animal [dot] cs.chalmers.se [129.16.225.30]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id EAA21488 for ; Fri, 8 Sep 2000 04:42:29 -0500 (CDT) Received: from cs.chalmers.se (muppet13.cs.chalmers.se [129.16.226.24]) by animal.cs.chalmers.se (8.8.5/8.8.5) with ESMTP id LAA06266; Fri, 8 Sep 2000 11:04:59 +0200 (MET DST) Message-ID: <39B8ABB9.5391DC9E [at] cs [dot] chalmers.se> Date: Fri, 08 Sep 2000 11:04:57 +0200 From: Bengt Nordstrom Organization: Dept. of CS, Chalmers, Sweden X-Mailer: Mozilla 4.7 [en] (X11; U; SunOS 5.6 sun4u) X-Accept-Language: en MIME-Version: 1.0 Subject: Professorship in 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! Our sister department, the dept of Computer Engineering is announcing a chair in Software Engineering. From their description: "The professorship will deal with methods and techniques for the development of software, and also in industrial settings. This includes theories and applied methods for specification, verification and validation of functional characteristics along with issues pertaining to quality, dependability, security and safety. Issues related to production, maintenance and management of software systems are also of interest." The full description can be found from their homepage http://www.ce.chalmers.se/MenyE/ Sincerely, Bengt Nordstrom From owner-reliable_computing [at] interval [dot] usl.edu Fri Sep 8 09:30:12 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id JAA22168 for reliable_computing-outgoing; Fri, 8 Sep 2000 09:30:12 -0500 (CDT) Received: from iph.bio.bas.bg (IDENT:0@bas-bio.lines.bas.bg [195.96.252.58]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id JAA22163 for ; Fri, 8 Sep 2000 09:30:02 -0500 (CDT) Received: from biomath (biomath.bio.bas.bg [195.96.247.160]) by iph.bio.bas.bg (8.9.3/8.9.3) with ESMTP id RAA02368; Fri, 8 Sep 2000 17:36:13 +0300 From: "Svetoslav Markov" Organization: Institute of Mathematics, BAS To: reliable_computing [at] interval [dot] usl.edu Date: Fri, 8 Sep 2000 17:28:19 +0200 X-Total-Enclosures: 1 X-Enclosure-Info: DOS,"MAXIOMS.TXT",,,,Text Subject: Re: axioms for interval analysis? Reply-to: smarkov [at] iph [dot] bio.bas.bg CC: Vladik Kreinovich , scott [at] ramas [dot] com, Dr John D Pryce Message-ID: <39B921B3.7131.177A806@localhost> Priority: normal In-reply-to: <200009071955.e87JtmO11185 [at] cs [dot] utep.edu> X-mailer: Pegasus Mail for Win32 (v3.12c) Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk > Dear Scott, > > Svetoslav Markov (email smarkov [at] iph [dot] bio.bas.bg) has done a lot of work on > algebraic characterization of interval arithmetic. I think he would give you the > best bibliography of his and related work. > > Vladik > > P.S. Nothing wrong with asking a question, why should I disapprove of it. > Vladik, thank you, I compiled a list, but this list is not exaustive. Besides, axiomatic studies are strongly related to studies of the algebraic properties, and it is difficult to separate the sources. I appologize also that most of the items are well-known. I have enlisted 3 related unpublished papers of mine. I can send abstracts to those who are interested. Svetoslav -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + Svetoslav Markov Section "Biomathematics", Inst. of phone: +3592-979-3704, +3592-707460, Mathematics and Computer Sci., fax: +3592-971-3649, Bulgarian Academy of Sciences, e-mail: smarkov [at] iph [dot] bio.bas.bg "Acad. G. Bonchev" st., block 8, BG-1113 Sofia, BULGARIA home address: 11 Mizia, 1124 Sofia, tel. +3592-444651 -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -------------- Enclosure number 1 ---------------- Selected papers on the algebra of intervals by S. Markov Markov, S., Extended interval arithmetic. Compt. rend. Acad. bulg. Sci. 30, 9, 1977, 1239--1242. Markov, S., On the extended interval arithmetic. Compt. rend. Acad. bulg. Sci., 31, 2, 1978, 163--166. Markov, S. M.: On the Presentation of Ranges of Monotone Functions Using Interval Arithmetic; Interval Computations 4(6) (1992), 19--31. Markov, S. M.: Extended interval arithmetic involving infinite intervals. Mathematica Balkanica, New Series {\sl 6}, 3, 269--304 (1992). Markov, S. M.: On Directed Interval Arithmetic and its Applications, J. UCS 1, 7 (1995), 514--526. http://www.iicm.edu/jucs 1 7 Markov, S., On the Foundations of Interval Arithmetic. Scientific Computing and Validated Numerics, G. Alefeld, A. Frommer, B. Lang (eds.), Mathematical Research, Vol. 90, Akademie Verlag, Berlin, 307--313, 1996. Markov, S., Isomorphic Embeddings of Abstract Interval Systems. Reliable Computing 3, No. 3, 199--207, 1997. Markov, S., On the Algebra of Intervals and Convex Bodies, J. UCS 4, No. 1, 34--47, 1998. http://www.iicm.edu/jucs_4_1 Markov, S. An Iterative Method for Algebraic Solution to Interval Equations, Applied Numerical Mathematics 30, No. 2-3 (1999), 225--239. Markov, S., On the Algebraic Properties of Convex Bodies and Some Applications, J. Convex Analysis 7 (2000), No. 1, 129--166. Markov, S., On the Algebraic Properties of Intervals and some Applications, Reliable Computing, to be published. Markov, S., Reducing Linear Interval Systems to Systems of Coordinates, manuscript. Markov, S. The algebra of errors (symmetric intervals), manuscript. =================== Selected literature on interval algebraic systems: (ordered chronologically) Warmus, M., {\em Calculus of Approximations}, Bull. Acad. Polon. Sci., Cl. III 4 (1956), 253--259. Sunaga, T., {\em Theory of an Interval Algebra and its Application to Numerical Analysis}, RAAG Memoirs 2 (1958), Misc. II, 547--564. (see also: S. Markov, K. Okumura: The Contribution of T. Sunaga to Interval Analysis and Reliable Computing, In: T. Csendes (ed.), Developments in Reliable Computing, Kluwer, 1999, 163--184. ) Warmus, M., {\em Approximations and Inequalities in the Calculus of Approximations. Classification of Approximate numbers}, Bull. Acad. Polon. Sci., Ser. math. astr. et phys., 9 (1961), 241--245. Ratschek, H., \"{U}ber einige intervallarithmetische Grundbegriffe. Computing, 4, 1969, 43--55. Ortolf, H-J., {\em Eine Verallgemeinerung der Intervallarithmetik}. Geselschaft fuer Mathematik und Datenverarbeitung, Bonn 11, 1969. Mayer, O., {\em Algebraische und metrische Strukturen in der Intervallrechnung und einige Anwendungen}, Computing 5 (1970), 144--162. Henrici, P., {\em Circular Arithmetic and the Determination of Polynomial Zeroes}. Springer Lecture Notes in Mathematics 228 (1971), 86--92. Ratschek, H., Die Subdistributivit\"{a}t der Intervallarithmetik, ZAMM, 51, 1971, 189--192. Ratschek H., Teilbarkeitskriterien der Intervallarithmetik. J. Reine Angew. Math. 252, 128--138 (1972). Kracht, M., Schr\"{o}der, G., Eine Einf\"{u}rung in der Theorie der quasilinearen R\"{a}ume mit Anwendung auf die in der Intervalrechnung augftr\"{a}tenden R\"{a}ume, Math.-Phys. Semesterber. 20, 226--242 (1973). Kracht, M., Schr\"{o}der, G., Zur Intervallrechnung in Quasilinearen R\"{a}umen, Computing 11, 73--79 (1973). Kaucher E., \"{U}ber metrische und algebraische Eigenschaften einiger beim numerischen Rechnen auftretender R\"{a}ume. Dissertation, Universit\"{a}t Karlsruhe, 1973. Alefeld G., Herzberger J. Einf\"{u}hrung in der Intervallrechnung, Bibliographisches Institut Mannheim, 1974. Kulisch U., Grundlagen des Numerischen Rechnens, Mathematische Begr\"{u}ndung der Rechnerarithmetik, Bibliographisches Institut Manncheim, 1976. Ratschek, H., G. Schr\"{o}der, {\em \"{U}ber den quasilinearen Raum}, Ber. Math.-statist. Sekt., Forschungszentrum Graz, No. 65 (1976). Kaucher, E.,{\em Algebraische Erweiterungen der Intervallrechnung unter Erhaltung der Ordnungs- und Verbandstrukturen}, Computing Suppl., 1 (1977), 65--79. Ratschek, H., G. Schr\"{o}der, {\em Representation of Semigroups as Systems of Compact Convex Sets}, Proc. Amer. Math. Soc. 65 (1977), 24--28. Ratschek, H., {\em Representation of Interval Operations by Coordinates}, Computing 24 (1980), 93--96. Kaucher, E., {\em Interval Analysis in the Extended Interval Space} $I\R$, Computing Suppl. 2, 33--49 (1980). Garde\~{n}es, E., A. Trepat, {\em Fundamentals of SIGLA, an Interval Computing System over the Completed Set of Intervals}, Computing 24, 161--179 (1980). Garde\~{n}es, E.; Trepat, A.; Janer, J.~M.: {\em SIGLA-PL/1 Development and Applications}. In: Nickel, K.: {\em Interval Mathematics 1980}. Academic Press, 1980, 301--315. Dimitrova, N., {\em \"{U}ber die Distributiveges\"{a}tze der Erweiterten Intervallarithmetik}. Computing 24, 33--49 (1980). Wolff v. Gudenberg, J., {\em Determination of Minimum Sets of the Set of Zeros of a Function}, Computing 24, 1980, 203--212. Garde\~{n}es, E.; Trepat, A.; Janer, J. M.: {\em Approaches to Simulation and to the Linear Problem in the SIGLA System.} Freiburger Interval-Berichte 81/8, 1981, 1--28. Garde\~{n}es, E.; Trepat, A.; Mieglo H.: {\em Present Perspective of the SIGLA Interval System}. Freiburger Interval-Berichte 82/9, 1982, pp. 1--65. Neumaier, A., {\em A Distributive Interval Arithmetic}, Freiburger Intervall--Berichte 82/10, Inst. f. Angew. Math., U. Freiburg i. Br., 1982, 31--38. Garde\~{n}es, E.; Trepat, A.; Mieglo H.; Trepat, A.: {\em Modal Intervals: Reasons and Ground Semantics}. In ``Interval Mathematics 1985'' (Ed. K. Nickel), Lecture Notes in Computer Science 212, Springer, 27--35 (1986). Neumaier, A., {\em Interval Methods for Systems of Equations}, Cambridge University Press, 1990. Popova, E., {\em Algebraic Solutions to a Class of Interval Equations}, J. UCS 4, 48--67 (1998). Kosheleva, O., V. Kreinovich, Only Intervals Preserve the Invertibility of Arithmetic Operations. Reliable Computing 5, 4, 1999, 385--394. Popova, E., {\em Generalized Interval Distributive Relations and their Applications}. In MISC'99 Preprints, Workshop Appl. of Interval Analysis to Systems and Control, Girona, Spain, 24--26. 02. 1999, U. of Girona, 1999, 13--23. Rump, S. M., {\em Fast and Parallel Interval Arithmetic}, BIT 39 (1999), 3, 534--554. ========================== Selected literature on inner estimations Markov, S., Some applications of the extended interval arithmetic to interval iterations, Computing Suppl. 2, 1980, 69--84. Markov S., On the Interval Computation of Elementary Functions, Comp. Rend. Acad. Bulg. Sci. 34, 32, 319--322 (1981). N. Dimitrova, S. M. Markov. \"{U}ber die intervall-arithmetische Berechnung des Wertebereichs einer Funktion mit Anwendungen, Freiburger Intervall-Berichte, Univ. Freiburg, 81/4 (1981), 1--22. Dimitrova, N., S. M. Markov, On the interval-arithmetic presentation of the range of a class of monotone functions of many variables. In: Computer arithmetic, scientific computation annd mathematical modelling (Ed. by E.Kaucher, S.M.Markov, G.Mayer), J.C.Balzer, Basel, 1991, 213-228. Markov, S. M.: Some Interpolation Problems Involving Interval Data, Interval Computations 3 (1993), 164--182. Dimitrova, N., S. Markov, A Validated Newton Type Method for Nonlinear Equations, Interval Computation 2 (1994), 27-51. V. Nesterov: How to use Monotonicity-Type Information To Get Better Estimates of the Range of Real-Valued Functions, Interval Computations, 4, 1993, 3--12. (5 cit) Bartholomew-Biggs, M., Zakovic, S.: Using Markov's interval arithmetic to evaluate Bessel Functions, Num. Algorithms, 10, 1995, 261--287. Markov, S., E. D. Popova, U. Schneider, J. Schulze, On Linear Interpolation under Interval Data. Mathematics and Computers in Simulation 42, 1 (1996), 35--45. Markov, S. M.: On the Presentation of Ranges of Monotone Functions Using Interval Arithmetic; Interval Computations, No. 4(6) (1992), 19--31. Markov, S., Some applications of the extended interval arithmetic to interval iterations, Computing Suppl. 2, 1980, 69--84. Markov, S., Reducing Linear Interval Systems to Systems of Coordinates, manuscript. From owner-reliable_computing [at] interval [dot] usl.edu Fri Sep 8 10:10:40 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA22539 for reliable_computing-outgoing; Fri, 8 Sep 2000 10:10:40 -0500 (CDT) 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 KAA22534 for ; Fri, 8 Sep 2000 10:10:35 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.10.1/8.10.1) with SMTP id e88FAQh16488; Fri, 8 Sep 2000 09:10:27 -0600 (MDT) Message-Id: <200009081510.e88FAQh16488 [at] cs [dot] utep.edu> Date: Fri, 8 Sep 2000 09:10:24 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: ISSAC-2001: ISSAC 2001 - Call for Papers To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu MIME-Version: 1.0 Content-Type: MULTIPART/mixed; BOUNDARY=Exaltation_of_Larks_520_000 X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk --Exaltation_of_Larks_520_000 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: PGwTt6ZTu+STyqDvBQnQkQ== forwarding: apologies for multiple copies ------------- Begin Forwarded Message ------------- X-Authentication-Warning: mailsrv2.zib.de: mail set sender to issac2001 [at] orcca [dot] on.ca using -f Date: Fri, 08 Sep 2000 14:17:15 +0200 From: Publicity Chair MIME-Version: 1.0 To: issac2001 [at] zib [dot] de Subject: ISSAC-2001: ISSAC 2001 - Call for Papers CALL FOR PAPERS International Symposium on Symbolic and Algebraic Computation University of Western Ontario, Canada, July 22-25, 2001 http://www.orcca.on.ca/issac2001/ ISSAC is the yearly premier international symposium in Symbolic and Algebraic Computation that provides an opportunity to learn of new developments and to present original research results in all areas of symbolic mathematical computation. ISSAC'2001 will be locally hosted by the University of Western Ontario at London and the Ontario Research Centre for Computer Algebra (ORCCA). Important dates Before January 15, 2001 Submission to the Program Committee Chair deadline March 12, 2001 Notification of acceptance April 2, 2001 Camera -ready copy received Original research results and insightful analyses of current concerns are solicited for submission. Papers will be reviewed by a program committee and referees. Survey articles may be suitable for submission if identified as such, they will be considered in a separate category from the research papers. Proceedings will be distributed at the symposium. Electronic submission is encouraged. Program Committee Chair: Gilles.Villard@ens-lyon.fr Conference Topics: Topics of the meeting include, but are not limited to, Algorithmic mathematics. Algebraic, symbolic and symbolic-numeric algorithms. Simplification, function manipulation, equations, summation, integration, ODE/PDE, linear algebra, number theory, group and geometric computing. Computer Science. Theoretical and practical problems in symbolic computation. Systems, problem solving environments, user interfaces, softwares, libraries, parallel/distributed computing and programming languages for symbolic computation, concrete analysis, benchmarking, complexity of computer algebra algorithms, automatic differentiation, code generation, mathematical data structures and exchange protocols. Applications. Problem treatments using algebraic, symbolic or symbolic-numeric computation in an essential or a novel way. Engineering, economics and finance, physical and biological sciences, computer science, logic, mathematics, statistics, education. Program Committee: Chair: Gilles Villard, CNRS IMAG Grenoble, Gilles.Villard@ens-lyon.fr Proceedings Editor: Bernard Mourrain, INRIA Sophia Antipolis, mourrain [at] sophia [dot] inria.fr Submissions must not substantially duplicate work published or submitted for publication elsewhere. Late submissions will be rejected. Best student author award. This award will be given to the best student author. An author is eligible if full-time student at the time of submission, this should be indicated. Notification. Authors will be sent notification of acceptance or rejection by e-mail on or before March 12, 2001. A final copy of each accepted paper will be required by April 2, 2001. This is again a firm deadline. An author of each accepted paper must attend the Conference and present the paper, or make arrangements to have it presented. Preparing final versions. Formatting requirements will be based on the ACM Proceedings Templates, for instance in LaTeX2e you should use the acm_proc_article-sp.cls document class file to format your document. ------------- End Forwarded Message ------------- --Exaltation_of_Larks_520_000 Content-Type: TEXT/html; name="call_for_papers.html"; charset=us-ascii Content-Description: call_for_papers.html Content-MD5: Hm7LuhDpLQHKo649X9AOBQ== Gilles VILLARD, ISSAC 2001 Call for Papers Call for Papers  - 05/09/2000
ISSAC'2001
International Symposium on Symbolic and Algebraic Computation
University of Western Ontario, Canada, July 22-25, 2001
[home page]

ISSAC is the yearly premier international symposium in Symbolic and Algebraic Computation that provides an opportunity to learn of new developments and to present original research results in all areas of symbolic mathematical computation. ISSAC'2001 will be locally hosted by the University of Western Ontario at London and the Ontario Research Centre for Computer Algebra (ORCCA).
 

Important dates
Before January 15, 2001 Submission to the Program Committee Chair deadline
March 12, 2001  Notification of acceptance
April 2, 2001 Camera -ready copy received 

       Original research results and insightful analyses of current concerns are solicited for submission. Papers will be reviewed by a program committee and referees. Survey articles may be suitable for submission if identified as such, they will be considered in a separate category from the research papers. Proceedings will be distributed at the symposium.  Electronic submission is encouraged, a description of the procedure will appear on this site. 

   Program Committee Chair:  Gilles.Villard@ens-lyon.fr
 

Conference Topics:

Topics of the meeting include, but are not limited to,

    Algorithmic mathematics.  Algebraic, symbolic and symbolic-numeric algorithms. Simplification, function manipulation, equations, summation, integration, ODE/PDE, linear algebra, number theory, group and geometric computing.

    Computer Science. Theoretical and practical problems in symbolic computation. Systems, problem solving environments, user interfaces, softwares, libraries, parallel/distributed computing and  programming languages for symbolic computation, concrete analysis, benchmarking, complexity of computer algebra algorithms, automatic differentiation, code generation, mathematical data structures and exchange protocols.

    Applications. Problem treatments using algebraic, symbolic or symbolic-numeric computation in an essential or a novel way. Engineering, economics and finance, physical and biological sciences, computer science, logic, mathematics, statistics, education.

Program Committee:

     Chair: Gilles Villard, CNRS IMAG Grenoble, Gilles.Villard@ens-lyon.fr

Proceedings Editor: Bernard Mourrain, INRIA Sophia Antipolis, mourrain [at] sophia [dot] inria.fr

Submissions must not substantially duplicate work published or submitted for publication elsewhere.  Late submissions will be rejected.

Best student author award. This award will be given to the best student author. An author is eligible if full-time student at the time of submission, this should be indicated.

Notification. Authors will be sent notification of acceptance or rejection by e-mail on or before March 12, 2001. A final copy of each accepted paper will be required by April 2, 2001. This is again a firm deadline. An author of each accepted paper must attend the Conference and present the paper, or make arrangements to have it presented.

Preparing final versions. Formatting requirements will be based  on the ACM Proceedings Templates, for instance in LaTeX2e you should use the acm_proc_article-sp.cls document class file to format your document. --Exaltation_of_Larks_520_000-- From owner-reliable_computing [at] interval [dot] usl.edu Sat Sep 9 21:24:51 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id VAA00964 for reliable_computing-outgoing; Sat, 9 Sep 2000 21:24:51 -0500 (CDT) 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 VAA00959 for ; Sat, 9 Sep 2000 21:24:46 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.10.1/8.10.1) with SMTP id e8A2OZk00491; Sat, 9 Sep 2000 20:24:35 -0600 (MDT) Message-Id: <200009100224.e8A2OZk00491 [at] cs [dot] utep.edu> Date: Sat, 9 Sep 2000 20:24:34 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: axiomatizations of interval analysis To: reliable_computing [at] interval [dot] louisiana.edu, scott [at] ramas [dot] com Cc: vladik [at] cs [dot] utep.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: tPMXLsp8T4GGjb2L7Z6c5A== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear Scott, Let me add, to my previous reply, a comment about the second part of your question. The three "axioms" which Rabinovich describes in his book "Measurement errors: theory and practice" (on foundations of uncertainty in measurement theory) seem very reasonable indeed from the viewpoint of measurement theory - one of the major sources of applications for interval mathematics. However, none of the existing axiomatizations of interval mathematics is directly reflecting these three properties. I think that a natural formalization of these properties would come if we consider modal logic: Traditional axiomatization of real numbers is using the traditional (first order) logic in which every statement is either true or false. In modal logic, there are two additional connectives: "possible" and "necessary", with the usual interpretation that there are several possible models ("worlds"); * "possible A" means that A is true in one of the possible worlds; * "necessarily A" means that A is true in all possible worlds, and * simply "A" means that A is true in the actual world (we do not know which of the possible worlds is the actual world). In these terms, Rabinovich's idea is that when a measurement results in an interval [a,b], this means that the (unknown) actual value X of the measured quantity can possibly be equal to any value from this interval. In other words, "possible (X=x) if and only if a<= x<=b" If we thus interpret the intervals of possible values of several variables X1,...,Xn, then, for an arbitrary algebraic function X=f(X_1,...,Xn), we get exactly the same interval of possible values as interval computation. This analogy is known: it was first orginally proposed by Gardenes (who went - in his Modal Interval Analysis - much further than formalizing interval computations). It is used in our book with Lakeyev, Rohn, and Kahl on Computational Complexity and Feasibility of Data Processing and Interval Computations (Appendix C) from the viewpoint of computational complexity of the corresponding problems. It may be a good idea to exploit this modal logic idea as a foundations for interval mathematics. I am sending this message to the entire list so that we may get some more references and ideas on this. Maybe, this formalization will be as easy as selecting a piece of morer sophisticated Gardenes's ideas. Maybe, we will need to think some more about it. And it may fit nicely with a more algebraic approach - since some of Markov's papers actually formalize not just the usual interval computations, but also its generalizations - some of it by operations which were proposed by Gardenes's Modal Interval Analysis. Vladik ************************************************************************** On Thu, 7 Sep 2000, Scott Ferson wrote: I think that Vladik Kreinovich may disapprove of the following question, but I ask it out of curiosity. Have there been axiomatizations of interval analysis? It might be suggested that the axioms of arithmetic (http://library.thinkquest.org/10030/2arithax.htm): closure, commutativity, associativity, identity element, inverse element, and distributivity, for addition and multiplication could simply be weakened so that inverse element becomes subcancellation, and distributivity becomes subdistributivity. Should such a weakened set be considered the "axioms of interval analysis"? If so, it would seem that fuzzy arithmetic (sensu Kauffman and Gupta) must be a special case, because it obeys them too. What distinguishes the essence of the interval approach? In 1993, Rabinovich offered three "axioms" for the theory measurement error: 1) the true value exists, 2) the true value is constant, and 3) the true value cannot be found. While these lack a certain mathematical character, they do seem closer to the spirit of interval analysis. Is this an inappropriate question? Scott Ferson Applied Biomathematics 631-751-4350, fax -3435 From owner-reliable_computing [at] interval [dot] usl.edu Sun Sep 10 08:42:28 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id IAA02562 for reliable_computing-outgoing; Sun, 10 Sep 2000 08:42:28 -0500 (CDT) Received: from iph.bio.bas.bg (IDENT:0@bas-bio.lines.bas.bg [195.96.252.58]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id IAA02557 for ; Sun, 10 Sep 2000 08:42:17 -0500 (CDT) Received: from biomath (biomath.bio.bas.bg [195.96.247.160]) by iph.bio.bas.bg (8.9.3/8.9.3) with ESMTP id QAA05352; Sun, 10 Sep 2000 16:48:46 +0300 From: "Svetoslav Markov" Organization: Institute of Mathematics, BAS To: reliable_computing [at] interval [dot] usl.edu, Scott Ferson Date: Sun, 10 Sep 2000 16:40:42 +0200 Subject: Re: axioms for interval analysis? Reply-to: smarkov [at] iph [dot] bio.bas.bg CC: Vladik Kreinovich Message-ID: <39BBB98A.18207.4CE785@localhost> Priority: normal In-reply-to: <39B7DC16.1D366EA6 [at] ramas [dot] com> X-mailer: Pegasus Mail for Win32 (v3.12c) Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear Dr Ferson, You are right in your intuitive idea of axiomatization of interval arithmetic, as one important step in this direction has been namely the weekening of the distributive law leading to the concept of quasilinear space (Mayer, Ratschek, Schroeder, Kracht, etc.). Another important step has been the turnover of the semigroup systems into group systems (Ortolf, Kaucher, Gardenes etc) and the isomorphic extension of inclusion (Kaucher) in the same manner as nonnegative numbers are extended by negative ones. I should like to mention (in connection to Vladik's answer) that, when working in a group system we need an interpretation of inproper results (in the same way we interprete negative results). Such an interpretation is offered by the modal interval arithmetic proposed by Gardenes. There are other interpretations as well. The axiomatization of interval arithmetic has not been yet finished. Again, to make it more precise, denote: I(R) the set of (proper) interval on the real line + addition * multiplication by scalar X interval multiplication \subseteq inclusion <= preceeding distance, norm etc. Then the following systems have been axiomatized: (I(R),+,*) quasilinear space (Mayer, Ratschek, etc) (I, X, \subseteq) Ortolf, Kaucher, Gardenes (I write "I" because this is a group structure including improper elements) (I,+) is trivial system, but it should be mentioned Let me note that quasilinear systems with group structure connect both lines of investigations. Still little is published about (I,+,X,\subseteq, <=). There are many investigations related to distance, norm, etc. Much remains to be done, but I think that we are very close to a full axiomatization of interval arithmetic. This subject is closed to the one of axiomatization of convex analysis (where an arithmetic of convex bodies is needed). It should be noted expressively that interval arithmetic has enriched the algebra by the concept of quasilinear space. This is an important concept, because it provides a better understanding of linear spaces. It is a pity that it seems to be so little known within us. The group system (I,X) is also very interesting as it has the symmetries identity, negation, opposite and dual. I dare hope that this system will also be studied soon in the textbooks of algebra. S. Markov > > I think that Vladik Kreinovich may disapprove of > the following question, but I ask it out of curiosity. > > Have there been axiomatizations of interval analysis? > > It might be suggested that the axioms of arithmetic > (http://library.thinkquest.org/10030/2arithax.htm): > closure, > commutativity, > associativity, > identity element, > inverse element, and > distributivity, > for addition and multiplication could simply be > weakened so that inverse element becomes > subcancellation, and distributivity becomes > subdistributivity. Should such a weakened set be > considered the "axioms of interval analysis"? If so, > it would seem that fuzzy arithmetic (sensu Kauffman > and Gupta) must be a special case, because it > obeys them too. What distinguishes the essence > of the interval approach? > > In 1993, Rabinovich offered three "axioms" for the > theory measurement error: > 1) the true value exists, > 2) the true value is constant, and > 3) the true value cannot be found. > While these lack a certain mathematical character, > they do seem closer to the spirit of interval analysis. > > Is this an inappropriate question? > > Scott Ferson > Applied Biomathematics > 631-751-4350, fax -3435 > -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + Svetoslav Markov Section "Biomathematics", Inst. of phone: +3592-979-3704, +3592-707460, Mathematics and Computer Sci., fax: +3592-971-3649, Bulgarian Academy of Sciences, e-mail: smarkov [at] iph [dot] bio.bas.bg "Acad. G. Bonchev" st., block 8, BG-1113 Sofia, BULGARIA home address: 11 Mizia, 1124 Sofia, tel. +3592-444651 -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + -- + From owner-reliable_computing [at] interval [dot] usl.edu Sun Sep 10 19:00:42 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id TAA03253 for reliable_computing-outgoing; Sun, 10 Sep 2000 19:00:42 -0500 (CDT) 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 TAA03248 for ; Sun, 10 Sep 2000 19:00:38 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.10.1/8.10.1) with SMTP id e8B00T402993; Sun, 10 Sep 2000 18:00:29 -0600 (MDT) Message-Id: <200009110000.e8B00T402993 [at] cs [dot] utep.edu> Date: Sun, 10 Sep 2000 18:00:29 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: Thiland conference: deadline extended, interval papers sought To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu Cc: pratit@s-t.au.ac.th MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: Sf+zm76XjWWf8nJj3Ucw9w== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk September 10, 2000 Dear Friends, On December 13-15, 2000, the first international conference on intelligent technologies will be held in Thailand. The official deadline for submission was September 4. Quite a few researchers have already asked for an extension, since they have been out of town for Summer and need time to finish their papers. Professor Hung T. Nguyen, the conference's Organizing Co-Chair, has recently returned from Bangkok, where he discussed this problem with the local organizers. With the commitment of referees, it looks like it is possible to referee a paper and publish it before the conference if the paper is submitted before October 1. So, if you are interested in submitting a paper, then the special new deadline is October 1, 2000 Please refer to this email when submitting your paper. (Camera-ready copies of the final versions of accepted papers are currently scheduled to go to the publisher on November 1, so no further deadline extension seems possible.) Also, if anyone is interested in organizing an invited session with 4-5 papers, so that this organizer will take care of the refereeing process, please contact me and Dr. Pratit Santiprabhob, the General Chair of the conference (email pratit@s-t.au.ac.th), as soon as possible. We will set up the deadlines for the refereed papers and, if necessary, help with the refereeing. If you are also interested in serving as a referee, please also let us know. The conference will be covering a wide range of different topics. In particular, since Professor Santiprabhob is a former student of Ladislav Kohout, one of the pioneers in interval methods in knowledge representation, we would like to greatly encourage submissions in this area. If someone is interested in organizing a special invited session in this topic it will be great. Professor Santiprabhob also asked us to assure potential authors that the local organizers will do their best to make the trip not only scientifically interesting, but also pleasurable. During his recent visit, Hung T. Nguyen was very much impressed by the organization, by the amazing campus and the beautiful country. Vladik ------------------------------------------------------------------------ CALL FOR PAPERS INTERNATIONAL CONFERENCE ON INTELLIGENT TECHNOLOGIES - BANGKOK DECEMBER 13-15, 2000 ------------------------------------------------------------------------ The International Conference on Intelligent Technologies (InTech'2000) is the first international conference on intelligent technologies to be held in Bangkok, Thailand. The conference especially focuses on topics in Artificial Intelligence, Soft Computing and related fields. The aims of InTech'2000 are to: * bring together researchers and practitioner in order to exchange their ideas and discuss issues occurred when implementing intelligent technologies in real-world environment * provide a forum for discussion of new research areas, results, and issues. * encourage national researches in this technology Selected, extended, revised and refereed papers from the Conference will be published in: * Special Issue on Intelligent Technologies in the International Journal of Intelligent Systems (Ron Yager, Editor-in-Chief, John Wiley publishers, USA); and * A special issue of the International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (Bernadette Bouchon-Meunier, Editor-in-Chief) For more information, see the website http://www.s-t.au.ac.th/~Intech2000/ From owner-reliable_computing [at] interval [dot] usl.edu Sun Sep 10 19:22:33 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id TAA03566 for reliable_computing-outgoing; Sun, 10 Sep 2000 19:22:33 -0500 (CDT) Received: from corinna.its.utas.edu.au (corinna.its.utas.edu.au [131.217.10.51]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id TAA03561 for ; Sun, 10 Sep 2000 19:22:19 -0500 (CDT) Received: from [131.217.124.71] (colyvan.phil.utas.edu.au [131.217.124.71]) by corinna.its.utas.edu.au (8.9.3/8.9.3) with ESMTP id LAA25379 for ; Mon, 11 Sep 2000 11:21:57 +1100 (EST) Mime-Version: 1.0 X-Sender: mcolyvan [at] postoffice [dot] utas.edu.au Message-Id: In-Reply-To: <20000910235827.26791.qmail [at] web901 [dot] mail.yahoo.com> References: <20000910235827.26791.qmail [at] web901 [dot] mail.yahoo.com> Date: Mon, 11 Sep 2000 11:26:26 +1100 To: reliable_computing [at] interval [dot] louisiana.edu From: Mark Colyvan Subject: Re: axiomatizations of interval analysis Content-Type: text/plain; charset="us-ascii" ; format="flowed" Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk >Dear Scott, > >Let me add, to my previous reply, a comment about the second part of your >question. > >The three "axioms" which Rabinovich describes in his book "Measurement errors: >theory and practice" (on foundations of uncertainty in measurement >theory) seem >very reasonable indeed from the viewpoint of measurement theory - one of the >major sources of applications for interval mathematics. > >However, none of the existing axiomatizations of interval mathematics is >directly reflecting these three properties. > >I think that a natural formalization of these properties would come if we >consider modal logic: Traditional axiomatization of real numbers is using the >traditional (first order) logic in which every statement is either true or >false. In modal logic, there are two additional connectives: "possible" and >"necessary", with the usual interpretation that there are several possible >models ("worlds"); >* "possible A" means that A is true in one of the possible worlds; >* "necessarily A" means that A is true in all possible worlds, and >* simply "A" means that A is true in the actual world (we do not know which > of the possible worlds is the actual world). >In these terms, Rabinovich's idea is that when a measurement results in an >interval [a,b], this means that the (unknown) actual value X of the measured >quantity can possibly be equal to any value from this interval. In >other words, >"possible (X=x) if and only if a<= x<=b" >If we thus interpret the intervals of possible values of several variables >X1,...,Xn, then, for an arbitrary algebraic function X=f(X_1,...,Xn), we get >exactly the same interval of possible values as interval computation. > >This analogy is known: it was first orginally proposed by Gardenes (who went - >in his Modal Interval Analysis - much further than formalizing interval >computations). It is used in our book with Lakeyev, Rohn, and Kahl on >Computational Complexity and Feasibility of Data Processing and Interval >Computations (Appendix C) from the viewpoint of computational >complexity of the >corresponding problems. > >It may be a good idea to exploit this modal logic idea as a foundations for >interval mathematics. I am sending this message to the entire list so that we >may get some more references and ideas on this. > >Maybe, this formalization will be as easy as selecting a piece of morer >sophisticated Gardenes's ideas. Maybe, we will need to think some more about >it. > >And it may fit nicely with a more algebraic approach - since some of Markov's >papers actually formalize not just the usual interval computations, but also >its generalizations - some of it by operations which were proposed by >Gardenes's Modal Interval Analysis. > >Vladik Dear Vladik and Scott, It should be pointed out that Vladik's above presentation of modal logic is in fact S5 modal logic (since he does not mention the all-important accessibility relation on the worlds). S5 is just one of many modal logics (see G.E. Hughes and M.J. Cresswell, *A New Introduction to Modal Logic* (London: Routledge, 1996)). Moreover, it is well known that S5 has some quite undesirable features if interpreted as an epistemic logic. I do not know the Gardenes stuff on modal logic for interval analysis but you may be interested in Jaakko Hintikka's *Knowledge and Belief: An Introduction to the Logic of the Two Notions* (Ithaca: Cornell, 1962). This is the standard source for (modal) epistemic logic. Hintikka recommends the weaker S4 as the appropriate modal system for epistemic applications. I hope this is helpful. Mark Colyvan. ______________________________________________________ Mark Colyvan School of Philosophy University of Tasmania GPO Box 252-41 Hobart, Tasmania, 7001 Australia Phone: +61 3 6226 1776 Fax: +61 3 6226 7847 Email: Mark.Colyvan [at] utas [dot] edu.au http://www.utas.edu.au/docs/humsoc/philosophy/Mark_Colyvan.html ______________________________________________________ From owner-reliable_computing [at] interval [dot] usl.edu Sun Sep 10 19:38:42 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id TAA03906 for reliable_computing-outgoing; Sun, 10 Sep 2000 19:38:42 -0500 (CDT) 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 TAA03901 for ; Sun, 10 Sep 2000 19:38:38 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.10.1/8.10.1) with SMTP id e8B0cQD03160; Sun, 10 Sep 2000 18:38:26 -0600 (MDT) Message-Id: <200009110038.e8B0cQD03160 [at] cs [dot] utep.edu> Date: Sun, 10 Sep 2000 18:38:26 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: Re: axiomatizations of interval analysis To: reliable_computing [at] interval [dot] louisiana.edu, Mark.Colyvan [at] utas [dot] edu.au MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: 41BlzbMwH/MMhkzdThLcUA== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear Mark, Thanks a lot for the useful comment. > It should be pointed out that Vladik's above presentation of modal > logic is in fact S5 modal logic (since he does not mention the > all-important accessibility relation on the worlds). This is absolutely correct. In the general Kripke-style semantics of model logic, "possible A" is interpreted as true in a given world w is A is true is some world which is accesible from w. In the context of interval uncertainty, when the only information we have about a physical quantity x is that it belongs to the interval [a,b], it is naturakl to interpret possible worlds as possible values of the variable x. Similarly, if we have several quantities x1,...,xn with interval uncertainty, possible worlds can be identified with possible values of these variables withing given intervals. In this context, it seems natural to assume that any two values are accessible from each other, so the modal logic is indeed S5. > S5 is just one > of many modal logics (see G.E. Hughes and M.J. Cresswell, *A New > Introduction to Modal Logic* (London: Routledge, 1996)). Moreover, > it is well known that S5 has some quite undesirable features if > interpreted as an epistemic logic. I do not know the Gardenes stuff > on modal logic for interval analysis but you may be interested in > Jaakko Hintikka's *Knowledge and Belief: An Introduction to the Logic > of the Two Notions* (Ithaca: Cornell, 1962). This is the standard > source for (modal) epistemic logic. Hintikka recommends the weaker > S4 as the appropriate modal system for epistemic applications. I am familiar with this research, and, although I do not think it necessary to use S4 for intervals, but you make a good point that if we want to go beyond that and start treating more general uncertainty, we may have to use S4 or maybe even some other version of modal logic. Thanks again. Vladik I hope this is helpful. Mark Colyvan. From owner-reliable_computing [at] interval [dot] usl.edu Mon Sep 11 21:30:14 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id VAA06857 for reliable_computing-outgoing; Mon, 11 Sep 2000 21:30:14 -0500 (CDT) Received: from mail1.sjtu.edu.cn ([202.38.97.230]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id VAA06852 for ; Mon, 11 Sep 2000 21:30:06 -0500 (CDT) Received: from yahoo.com ([202.120.8.134]) by mail1.sjtu.edu.cn (Netscape Messaging Server 4.15) with ESMTP id G0R5WP00.T1B for ; Tue, 12 Sep 2000 10:36:25 +0800 Message-ID: <39BD9650.2BB80F92 [at] yahoo [dot] com> Date: Tue, 12 Sep 2000 10:34:57 +0800 From: zmm80899 X-Mailer: Mozilla 4.6 [en] (Win95; I) X-Accept-Language: en MIME-Version: 1.0 To: reliable_computing [at] interval [dot] usl.edu Subject: ask Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear sir, I am interested in computation methods and hope to get the answer for the following question. If the initial value in a interval is relatively large, how to divide them to get better approximating effect? For example, we wish to get the solution of the following equation: x'(t)=Ax , with initial value x0=[a, b] The interval is large, but how to divide it? Is there some criteria to deal with the problem? Your sincerely, Zhang, Miaomiao -- Miaomiao Zhang Department of Automation Jiaotong University A9803022 Shanghai, P.R.China 200030 email:zmm80899 [at] yahoo [dot] com zmm80899 [at] 21cn [dot] com Tel: 021-62933212(o) 021-62934071(h) Fax: 021-62933212 From owner-reliable_computing [at] interval [dot] usl.edu Tue Sep 12 09:17:05 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id JAA08445 for reliable_computing-outgoing; Tue, 12 Sep 2000 09:17:04 -0500 (CDT) Received: from mail1.sjtu.edu.cn ([202.38.97.230]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id JAA08427 for ; Tue, 12 Sep 2000 09:16:55 -0500 (CDT) Received: from yahoo.com ([202.120.8.134]) by mail1.sjtu.edu.cn (Netscape Messaging Server 4.15) with ESMTP id G0S2MP03.41W for ; Tue, 12 Sep 2000 22:23:13 +0800 Message-ID: <39BE3BFB.E022B6BB [at] yahoo [dot] com> Date: Tue, 12 Sep 2000 22:21:47 +0800 From: zmm80899 X-Mailer: Mozilla 4.6 [en] (Win95; I) X-Accept-Language: en MIME-Version: 1.0 To: reliable_computing [at] interval [dot] usl.edu Subject: ask Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear sir, I have another question. By interval computation, we can get the discrete solution of the continuous dynamic. But how to get the continuous smooth solution? That is, if time t lies in some interval (t1,t2), by what method can all the discrete approximating rectangle achieved by interval computaion in this period are connected smoothly? Thank you very much! Zhang, Miaomiao From owner-reliable_computing [at] interval [dot] usl.edu Tue Sep 12 09:44:01 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id JAA08737 for reliable_computing-outgoing; Tue, 12 Sep 2000 09:44:00 -0500 (CDT) 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 JAA08732 for ; Tue, 12 Sep 2000 09:43:56 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.10.1/8.10.1) with SMTP id e8CEhQs17018; Tue, 12 Sep 2000 08:43:26 -0600 (MDT) Message-Id: <200009121443.e8CEhQs17018 [at] cs [dot] utep.edu> Date: Tue, 12 Sep 2000 08:43:25 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: Re: ask To: reliable_computing [at] interval [dot] usl.edu, zmm80899 [at] yahoo [dot] com MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: 2QmKd1MjFKlgGFAFEVJxNg== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear Dr. Zhang, I may have misunderstood your question, but here is my reaction: Interval computation can lead to different enclosures for the solution. We may get a sequence of boxes which contains the unknown smooth function; this sequence of boxes, by itself, has only one relation to smoothness: that it contains a smooth function which is the solution to the original equation. There are other methods: e.g., Martin Berz and his group combine interval computations with Taylor series techniques, so you get a solution, crudely speaking, in terms of smooth Taylor series-type polynomial. In this case, smoothness is implicit. If you are interested in this, you can check Dr. Berz's homepage (it can accessed from the Personial part of the interval computations website http://www.cs.utep.edu/interval-comp). If I misunderstood you I apologize. Vladik P.S. From your addressing "Dear Sir" it is not clear to me that you aware of it, so just in case: you are posting your messages to the interval computations mailing list. Your questions are definitely appropriate for this list, so you have not made a mistake by posting, I am just letting you know in case you are under th impression that you are mailing to a single person. himself (you can find his coordinates > Date: Tue, 12 Sep 2000 22:21:47 +0800 > From: zmm80899 > X-Accept-Language: en > MIME-Version: 1.0 > To: reliable_computing [at] interval [dot] usl.edu > Subject: ask > Content-Transfer-Encoding: 7bit > > Dear sir, > > I have another question. > > By interval computation, we can get the discrete solution of the > continuous dynamic. But how to get the continuous smooth solution? That > is, if time t lies in some interval (t1,t2), by what method can all > the discrete approximating rectangle achieved by interval computaion in > this period are connected smoothly? > > Thank you very much! > > Zhang, Miaomiao > > > From owner-reliable_computing [at] interval [dot] usl.edu Tue Sep 12 10:18:43 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA09078 for reliable_computing-outgoing; Tue, 12 Sep 2000 10:18:43 -0500 (CDT) Received: from solon.mat.univie.ac.at (solon.mat.univie.ac.at [131.130.145.131]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA09073 for ; Tue, 12 Sep 2000 10:18:38 -0500 (CDT) Received: (from neum@localhost) by solon.mat.univie.ac.at (8.9.3/8.9.3) id RAA08421; Tue, 12 Sep 2000 17:18:05 +0200 (MET DST) Date: Tue, 12 Sep 2000 17:18:05 +0200 (MET DST) From: Arnold Neumaier Message-Id: <200009121518.RAA08421 [at] solon [dot] mat.univie.ac.at> To: reliable_computing [at] interval [dot] usl.edu, zmm80899 [at] yahoo [dot] com Subject: Re: ask Cc: neum [at] cma [dot] univie.ac.at Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk >>By interval computation, we can get the discrete solution of the continuous dynamic. But how to get the continuous smooth solution? That is, if time t lies in some interval (t1,t2), by what method can all the discrete approximating rectangle achieved by interval computaion in this period are connected smoothly?<< Lohner's method provides both boxes enclosing the solution at some points determined adaptively, and a parameterized expression for linearly transformed boxes containing the solution curve between the points used for constructing the enclosure. Arnold Neumaier From owner-reliable_computing [at] interval [dot] usl.edu Wed Sep 13 05:41:47 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id FAA11428 for reliable_computing-outgoing; Wed, 13 Sep 2000 05:41:47 -0500 (CDT) Received: from narech.irin.univ-nantes.fr (IDENT:root [at] narech [dot] irin.sciences.univ-nantes.fr [193.52.99.2]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id FAA11423 for ; Wed, 13 Sep 2000 05:41:42 -0500 (CDT) Received: from irin.univ-nantes.fr (red [193.52.99.179]) by narech.irin.univ-nantes.fr (8.9.3/jtpda-5.3.2) with ESMTP id MAA03518 ; Wed, 13 Sep 2000 12:41:37 +0200 Message-ID: <39BF59C2.E65DD43D [at] irin [dot] univ-nantes.fr> Date: Wed, 13 Sep 2000 12:41:07 +0200 From: Evgueni Petrov Organization: IRIN X-Mailer: Mozilla 4.72 [en] (X11; U; Linux 2.2.14-5.0 i586) X-Accept-Language: en MIME-Version: 1.0 To: reliable_computing [at] interval [dot] usl.edu Subject: list References: <200009121443.e8CEhQs17018 [at] cs [dot] utep.edu> Content-Type: text/plain; charset=koi8-r Content-Transfer-Encoding: 8bit X-MIME-Autoconverted: from base64 to 8bit by interval.usl.edu id FAA11424 Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk list From owner-reliable_computing [at] interval [dot] usl.edu Wed Sep 13 09:31:32 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id JAA11958 for reliable_computing-outgoing; Wed, 13 Sep 2000 09:31:32 -0500 (CDT) Received: from SPM1.springer.de (root [at] spm1 [dot] springer.de [192.129.25.2]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id JAA11953 for ; Wed, 13 Sep 2000 09:31:23 -0500 (CDT) Received: from HDMSX01.pip.springer.de (hdmsx01.pip.springer.de [172.20.10.62]) by SPM1.springer.de (8.9.3/8.9.1) with ESMTP id QAA26380 for ; Wed, 13 Sep 2000 16:31:20 +0200 (METDST) Received: by hdmsx01.pip.springer.de with Internet Mail Service (5.5.2650.21) id ; Wed, 13 Sep 2000 16:33:00 +0200 Message-ID: From: "Tickner, Sally" To: "'reliable_computing [at] interval [dot] usl.edu'" Subject: Newsgroup Enquiry Date: Wed, 13 Sep 2000 16:26:53 +0200 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.5.2650.21) Content-Type: text/plain Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk September 12th 2000 Dear General Secretary/Newsgroup Administrator, RE: Reliable Computing I would like to introduce myself to you, and indeed Springer's reliability engineering publications... I am Sally Tickner, the Senior Marketing Manager in the UK office of Springer-Verlag. As part of a global initiative I would like to promote a forthcoming Handbook of Reliability Engineering and related titles. At this stage, I would like to know how many online subscribers you have to reliable-computing [at] interval [dot] usl.edu? Could you help us to reach your members in any of the following ways: * Do you have a mailing list of your members? Would you supply labels? * Do you send your members a regular newsletter? Would you consider inserting some of our leaflets into your member mailings? * Do you organise or attend regular events? Could we promote our titles at such an event? * Do you take advertisements and/or inserts? * Do you have a website or newsgroup where we could set up links and/or announcements? We would need to negotiate a cost for all of the above suggestions and I look forward to hearing any other ideas you or your colleagues may have too. Needless to say, I am happy to offer your members a special discounted rate on books and/or a FREE sample copy of the journal. Looking forward to hearing from you. Thank you in advance. Yours sincerely, Sally Tickner Email: sally [at] svl [dot] co.uk Sally Tickner, Sr. Marketing Manager, Springer-Verlag London Ltd, Sweetapple House, Catteshall Road, Godalming, Surrey, GU7 3DJ, UK Tel: 01483 414113 Fax: 01483 415151 Email: sally [at] svl [dot] co.uk www.springer.co.uk www.springer.de From owner-reliable_computing [at] interval [dot] usl.edu Wed Sep 13 16:11:51 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id QAA12803 for reliable_computing-outgoing; Wed, 13 Sep 2000 16:11:51 -0500 (CDT) Received: from marnier.ucs.usl.edu (root@[130.70.40.2]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id QAA12798 for ; Wed, 13 Sep 2000 16:11:46 -0500 (CDT) Received: from liberty (liberty.usl.edu [130.70.46.171]) by marnier.ucs.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.4) with SMTP id QAA20376; Wed, 13 Sep 2000 16:11:41 -0500 (CDT) Message-Id: <2.2.32.20000913211211.012dc124 [at] pop [dot] usl.edu> X-Sender: rbk5287 [at] pop [dot] usl.edu X-Mailer: Windows Eudora Pro Version 2.2 (32) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Wed, 13 Sep 2000 16:12:11 -0500 To: "Tickner, Sally" From: "R. Baker Kearfott" Subject: Re: Newsgroup Enquiry Cc: reliable_computing [at] interval [dot] louisiana.edu Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Sally, We do have a mailing list; in fact your original message went to the entire mailing list. (The list is presently unmoderated, but we've had little reason to change that -- it's been on-topic and amiable.) I can't readily supply mailing labels, although you are welcome to post information to the reliable_computing [at] interval [dot] louisiana.edu mailing list, if it is relevant to reliable_computing. It sounds like the Reliability Engineering publications are, at least tangentially so. The reliable_computing mailing list has people constantly subscribing and unsubscribing, but the total number of persons has remained almost constant at about 425 for the past five years. The most regular event we attend is the set of "SCAN" conferences. The upcoming one, SCAN-2000 will be September 19-22 in Karlsruhe, Germany; you can see a description at http://www.scan2000.de/ One focal web site of interest to us is maintained by Vladik Kreinovich, vladik [at] cs [dot] utep.edu The URL for this web site is http://www.cs.utep.edu/interval-comp/main.html Free sample copies of the journal and reduced rates could be well-received, if the contents are related to topics of interest to members. You can definitely send me a free copy :-) You may also want to post to reliable_computing [at] interval [dot] louisiana.edu a URL of a web page where people can explore the titles offered. I, for one, would like to see more about what "Reliability Engineering" means at Springer. Best regards, R. Baker Kearfott At 04:26 PM 9/13/00 +0200, you wrote: > > September 12th 2000 > > Dear General Secretary/Newsgroup Administrator, > > RE: Reliable Computing > > I would like to introduce myself to you, and indeed Springer's >reliability engineering publications... > > I am Sally Tickner, the Senior Marketing Manager in the UK office of >Springer-Verlag. As part of a global initiative I would like to promote a >forthcoming Handbook of Reliability Engineering and related titles. > > At this stage, I would like to know how many online subscribers you >have to reliable-computing [at] interval [dot] usl.edu? > Could you help us to reach your members in any of the following >ways: > > * Do you have a mailing list of your members? > Would you supply labels? > > * Do you send your members a regular newsletter? > Would you consider inserting some of our leaflets into your member >mailings? > > * Do you organise or attend regular events? > Could we promote our titles at such an event? > > * Do you take advertisements and/or inserts? > > * Do you have a website or newsgroup where we could set up >links and/or announcements? > > We would need to negotiate a cost for all of the above suggestions >and I look forward to hearing any other ideas you or your colleagues may >have too. > > Needless to say, I am happy to offer your members a special >discounted rate on books and/or a FREE sample copy of the journal. > > Looking forward to hearing from you. Thank you in advance. > > Yours sincerely, > Sally Tickner > Email: sally [at] svl [dot] co.uk > > >Sally Tickner, Sr. Marketing Manager, Springer-Verlag London Ltd, >Sweetapple House, Catteshall Road, Godalming, Surrey, GU7 3DJ, UK >Tel: 01483 414113 Fax: 01483 415151 Email: sally [at] svl [dot] co.uk >www.springer.co.uk www.springer.de > > --------------------------------------------------------------- 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 Sat Sep 16 15:17:17 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id PAA03143 for reliable_computing-outgoing; Sat, 16 Sep 2000 15:17:16 -0500 (CDT) 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 PAA03137 for ; Sat, 16 Sep 2000 15:17:07 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.10.1/8.10.1) with SMTP id e8GKGvV21436 for ; Sat, 16 Sep 2000 14:16:57 -0600 (MDT) Message-Id: <200009162016.e8GKGvV21436 [at] cs [dot] utep.edu> Date: Sat, 16 Sep 2000 14:16:56 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: a book of interest to interval community To: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: 2xQV81zFCUaw3CzRW4od0w== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk A new book System Reliability Under Incomplete Information, by S. V. Gurov and L. V. Utkin, Lubavich Publ., St. Petersburg, Russia, 1999 (in Russian). deals with the interval methods in system reliability (in the more traditional engineering sense of this word). Interested researchers may want to contact Dr. Utkin at lvu [at] utkin [dot] usr.etu.spb.ru Vladik From owner-reliable_computing [at] interval [dot] usl.edu Tue Sep 19 12:25:06 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id MAA08771 for reliable_computing-outgoing; Tue, 19 Sep 2000 12:25:05 -0500 (CDT) Received: from cosmos.imag.fr (cosmos.imag.fr [147.171.130.1]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id MAA08766 for ; Tue, 19 Sep 2000 12:25:01 -0500 (CDT) Received: (from echahed@localhost) by cosmos.imag.fr (8.9.3/8.8.6) id SAA06355; Tue, 19 Sep 2000 18:46:35 +0200 (MET DST) Date: Tue, 19 Sep 2000 18:46:35 +0200 (MET DST) From: Rachid Echahed Message-Id: <1000919184635.ZM6353 [at] cosmos [dot] imag.fr> X-Mailer: Z-Mail (5.0.0 30July97) To: Rachid.Echahed [at] imag [dot] fr Subject: ETAPS-2002: Call for Affiliated Workshops MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 8bit Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk (Apologies if you receive multiple copies of this announcement) ----------------------------------------------------------------------- Call for Affiliated Workshops ETAPS 2002 April 2002, Grenoble, France http://www-etaps.imag.fr ----------------------------------------------------------------------- ETAPS, the European Joint Conferences on Theory and Practice of Software is a major international forum for academic and industrial researchers working on topics relating to Software Science. After ETAPS'98 in Lisbon, ETAPS'99 in Amsterdam, ETAPS 2000 in Berlin and ETAPS 2001 in Genova, ETAPS 2002 will take place in Grenoble during April 2002 (the precise dates will be communicated later). ETAPS is a confederation of five main conferences: the International Conference on Compiler Construction (CC), the European Symposium On Programming (ESOP), Fundamental Approaches to Software Engineering (FASE), Foundations of Software Science and Computation Structures (FOSSACS) and Tools and Algorithms for the Construction and Analysis of Systems (TACAS). Workshops affiliated to ETAPS 2002 will be held before, after or partly in parallel with the main conferences. Researchers and practitioners wishing to organize a workshop affiliated to ETAPS 2002 are invited to submit, by electronic mail in ASCII or Postscript format, proposals for workshops to the ETAPS 2002 Workshop Chair, by December 1st, 2000. Such a proposal should be no longer than two pages and should describe the topic of the workshop, the names and contact information of the organizers, the estimated dates for paper submissions, notification of acceptance and final versions (before Ferbruary 15, 2002), the expected number of participants and duration, the preferred period (pre- or post-ETAPS) and any other relevant information (e.g., invited speakers, panels, publication policy, demo sessions etc.). The proposals will be evaluated by the ETAPS 2002 organizing committee on the basis of their assessed benefit for prospective participants to ETAPS 2002. Acceptance decisions will be made by December 15, 2000. The titles and brief information related to accepted workshop proposals will be included in the conference program and advertised in the call for participation. Workshop organizers will be responsible for producing a Call for papers, Web site, reviewing and making acceptance decisions on submitted papers and scheduling workshop activities in consultation with the local organizers. Any further information needed for preparing a workshop proposal can be obtained by contacting the ETAPS 2002 Workshop Chair: Rachid Echahed, Rachid.Echahed [at] imag [dot] fr Important dates : December 1, 2000 : Workshop proposals December 15, 2000 : Notification of acceptance ETAPS 2002 Web site: http://www-etaps.imag.fr/ -- From owner-reliable_computing [at] interval [dot] usl.edu Wed Sep 20 08:16:43 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id IAA11093 for reliable_computing-outgoing; Wed, 20 Sep 2000 08:16:43 -0500 (CDT) Received: from mail.unisannio.it (mail.unisannio.it [193.206.108.2]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id IAA11088 for ; Wed, 20 Sep 2000 08:16:20 -0500 (CDT) Received: (from icsm2001@localhost) by mail.unisannio.it (8.9.3/8.8.7) id PAA07957 for reliable_computing [at] interval [dot] usl.edu; Wed, 20 Sep 2000 15:16:04 +0200 Date: Wed, 20 Sep 2000 15:16:04 +0200 From: ICSM2001 (Canfora) Message-Id: <200009201316.PAA07957 [at] mail [dot] unisannio.it> To: reliable_computing [at] interval [dot] usl.edu Subject: CFPs: IEEE Int. Conf. on Software Maint., Florence, Italy Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear Colleague I hope that this CFPs could be useful for your work. Please forward the following to anybody who you think may be interested. Apologies if you have already seen this. If you would like to be removed from our list please send an email to icsm2001 [at] unisannio [dot] it with REMOVE in the subject. ICSM2001 Technical Committee _=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_= CALL---FOR---PAPERS IEEE International Conference on Software Maintenance 2001 FLORENCE, ITALY, 5-9 November 2001, http://www.dsi.unifi.it/icsm2001 Theme: Systems and Software Evolution in the era of the Internet _=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_=_= ICSM is the major international conference in the field of software and systems maintenance, evolution, and management. In the era of the Internet, businesses and end-users have invested in new technologies and small and large software organizations around the world are looking for Internet related solutions to evolve and maintain their new Internet software products. Internet technologies are strongly impacting system architectures and business processes and rules. In some cases businesses and end-users have been overwhelmed trying to keep up with software development and evolution processes and practices. In addition to novel solutions to enable the life-cycle of new web-based software systems, huge investments are necessary to migrate aginglegacy applications to web-enabled contemporary systems. ICSM 2001 will address these major changes in the software landscape and their impact on maintenance and evolution. The focus of the conference will be to explore the new challenges that the Internet, as a driver for business changes, poses for software maintenance, and the new opportunities it opens as infrastructure and enabling technology. The purpose of the conference is to promote discussion and interaction between researchers and practitioners. We are particularly interested in exchanging concepts, prototypes, research ideas, and other results which could contribute to the academic arena and also benefit business and the industrial community. ICSM 2001 will be participatory, with working collaborative sessions and presentations of industry projects. ICSM 2001 will bring together researchers, practitioners, developers and users of tools, technology transfer experts, and project managers. The Conference will be held in conjunction with WESS, the Workshop on Empirical Studies of Software. Topics of interest include but are not restricted to the following aspects of maintenance and evolution: - Methods and theories -Processes and strategies - Organizational frameworks -Life cycle and process control - Design for maintenance -Tools and environments - Internet and distributed systems -Multimedia systems - User interface evolution -Commercial off-the-shelf (COTS) - Third party maintenance -Freeware and open source applications - Program comprehension -Software and system visualization - Knowledge based systems -Formal methods - Impact of new software practices -Empirical studies - Software reusability -Programming languages - Source code analysis and manipulation -Testing and regression testing - Models and methods for error prediction -Measurement of software - Maintenance and/or productivity metrics -Preventive maintenance - Personnel aspects of maintenance -Reengineering and reverse engineering - Version and configuration management -Legal aspects and standards - Management and organization -Remote, tele-work, and co-operative applications RESEARCH PAPERS Research papers should describe original and significant work in the research and practice of software maintenance. Research case studies, empirical research, and experiments are particularly welcome. Papers should be 2000 - 5000 words in length, in English. Submit them in PDF or PostScript via email to icsm2001 [at] unisannio [dot] it by 15 January 2001. A prize of the Journal of Software Maintenance will be assigned at the Best submitted Paper. INDUSTRIAL APPLICATIONS We welcome proposals for presentations of Industrial Applications. These can be experience reports from real projects, industrial practices and models, or tool demonstrations. Submit proposals for Industrial Application presentations via email to icsm2001.industry [at] unisannio [dot] it by 12 March 2001. Industrial Applications proposals will be reviewed by a dedicated sub-committee of the program committee and a 1 page summary of accepted proposals will be included in the conference proceedings. TUTORIALS Tutorials should present software maintenance and evolution topics of interest to practitioners. Tutorials may be full-day or half-day in length. Submit tutorial proposals via email to icsm2001.tutorial [at] unisannio [dot] it by 12 February 2001. IMPORTANT DATES Research Paper submission 15 January 2001, notification of acceptance 1 June 2001 Industrial Application submission 12 March 2001 Tutorial submission 12 February 2001 ------------------------------ General chair: Paolo Nesi, University of Florence, Italy, nesi [at] dsi [dot] unifi.it Financial chair: Vaclav Rajlich, Wayne State University, USA, vtr [at] cs [dot] wayne.edu Program co-chairs: Gerardo Canfora, University of Sannio, Italy, gerardo.canfora [at] unisannio [dot] it Anneliese von Mayrhauser, Colorado State University, USA, avm [at] CS [dot] ColoState.EDU Tutorials co-chairs: Lionel C. Briand, Carleton University, briand [at] sce [dot] carleton.ca Alessandro Fantechi, University of Florence, Italy, Fantechi [at] dsi [dot] unifi.it Industrial Applications co-chairs: Panagiotis K. Linos, Tennessee Technological University, USA, linos [at] tntech [dot] edu Harry Sneed, Software Engineering Service GmbH, Germany, Harry.Sneed@t-online.de Chris Verhoef, University of Amsterdam, NL, x [at] wins [dot] uva.nl Publicity co-chairs: Nicholas Zvegintzov (General Co-chair), Software Management Network, USA, zvegint [at] attglobal [dot] net Malcolm Munro (Co-chair for Europe), University of Durham, UK, malcolm.munro [at] durham [dot] ac.uk William Cheng-Chung Chu (Co-chair for East), TungHai University, Taiwan, chu [at] cis [dot] thu.edu.tw Local Arrangements co-chairs: Fabrizio Fioravanti, University of Florence, Italy, fioravan [at] dsi [dot] unifi.it Pierfrancesco Bellini (Industrial Applications, and Demos), University of Florence, Italy, bellini [at] hpcn [dot] dsi.unifi.it WEB Master: Marius Bogdan Spinu, University of Florence, Italy, spinu [at] hpcn [dot] dsi.unifi.it -------------------------------------------------------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] usl.edu Sat Sep 23 09:28:44 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id JAA18378 for reliable_computing-outgoing; Sat, 23 Sep 2000 09:28:44 -0500 (CDT) Received: from marnier.ucs.usl.edu (root@[130.70.40.2]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id JAA18373 for ; Sat, 23 Sep 2000 09:28:40 -0500 (CDT) Received: from u8174 (rbk5287 [at] goedel [dot] usl.edu [130.70.49.203]) by marnier.ucs.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.4) with SMTP id JAA29718 for ; Sat, 23 Sep 2000 09:28:38 -0500 (CDT) Message-Id: <2.2.32.20000923143012.006e6c70 [at] pop [dot] usl.edu> X-Sender: rbk5287 [at] pop [dot] usl.edu X-Mailer: Windows Eudora Pro Version 2.2 (32) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Sat, 23 Sep 2000 09:30:12 -0500 To: reliable_computing [at] interval [dot] louisiana.edu From: "R. Baker Kearfott" Subject: SCAN 2000 ? Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Colleagues, I am regretful that it was impractical for me to attend SCAN 2000. If someone who did attend has the inclination, could they please post a summary (formal or informal) of the high-points and happenings of the meeting to this mailing list, for me and persons like me? Best regards, Baker --------------------------------------------------------------- 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 Sun Sep 24 20:02:34 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id UAA20943 for reliable_computing-outgoing; Sun, 24 Sep 2000 20:02:34 -0500 (CDT) Received: from marnier.ucs.usl.edu (root@[130.70.40.2]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id UAA20938 for ; Sun, 24 Sep 2000 20:02:29 -0500 (CDT) Received: from u8174 (rbk5287 [at] goedel [dot] usl.edu [130.70.49.203]) by marnier.ucs.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.4) with SMTP id UAA08066 for ; Sun, 24 Sep 2000 20:02:25 -0500 (CDT) Message-Id: <2.2.32.20000925010400.0076bffc [at] pop [dot] usl.edu> X-Sender: rbk5287 [at] pop [dot] usl.edu X-Mailer: Windows Eudora Pro Version 2.2 (32) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Sun, 24 Sep 2000 20:04:00 -0500 To: reliable_computing [at] interval [dot] louisiana.edu From: "R. Baker Kearfott" Subject: RE: GlobSol - circuit analysis with wide intervals Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Colleagues, I thought many of you would be interested in the following. Also, we would welcome any additional contributions or ideas you would have. Best regards, Baker >Return-Path: >From: gsaxena [at] informatica [dot] com >To: rbk [at] louisiana [dot] edu >Subject: RE: GlobSol - interval math application >Date: Sun, 24 Sep 2000 16:29:42 -0700 > >Hi Baker, > >By all means, please do post this discussion on >reliable_computing [at] interval [dot] louisiana.edu mailing list. I will try to join >this list as well. I am curious if anyone else has come up with unique >solutions to the simple circuit analysis problem posed below. > >Thank you for your thorough answer. In order to better understand the >techniques chosen to solve this problem, I will research the interval theory >from your publication "Rigorous Global Search -- Continuous Problems," >Kluwer, 1996. > >Gautam > >-----Original Message----- >From: R. Baker Kearfott [mailto:rbk [at] louisiana [dot] edu] >Sent: Saturday, September 23, 2000 2:35 PM >To: gsaxena [at] informatica [dot] com >Subject: RE: GlobSol - interval math application > > >Gautam, > >Now I think I understand the problem. In the original equations, >both "I" and "V" occur in both equations, so, without initial bounds >on them, you cannot get narrower intervals by constraint propagation. >Your symbolic manipulation puts things in a form where you can >first solver for "I" in terms of known quantities, then solve for >"V". > >GlobSol uses a combination of constraint propagation, interval Newton >methods, and subdivision. The basic methods are described in my >book "Rigorous Global Search -- Continuous Problems," Kluwer, 1996, >although there have been many improvements to the actual software >since then. > >The main issue in using such general software to solve problems of >that type is the non-trivial-width intervals in the constants. I have >addressed that in the paper "On Stopping Criteria in Verified >Nonlinear Systems or Optimization Algorithms, accepted for >publication in the "ACM Transactions on Mathematical Software." (A >preprint is available from my web site.) > >Using the distribution version of GlobSol with default configuration, >I have tried the small problem; It gave 52 small boxes, the union of >which contains the solution. Using the subdivision method described in >the aforementioned paper, and subdividing "R" into five subintervals, >I obtained ten interval vectors containing the solution set, and >I obtained, for interval hull: > > The interval hull of the boxes with verified feasible points: > [ -0.8529D+01, 0.8529D+01 ] [ -0.3023D+01, 0.3023D+01 ] > The interval hull of the objective values corresponding > to the boxes with verified feasible points: > [ 0.0000D+00, 0.1878D+02 ] > >My initial intervals (needed by GlobSol) were [-10^6,10^6] in both >variables, and it executed in less than two seconds. > >I note that the "exact" positive parts of the answers are > > V = [5.6568542494923796,8.4852813742385714] > I = [2.0,3.0] > >(I obtained this by using your reformulated equations and the >interval data type in Sun's f95 compiler.) > >You see that the upper bounds are not far from what GlobSol with >the constant subdivision modification gave. >When I restrict the variables to be positive, thus including only >one branch of the square root and eliminating the symmetry in the >direction of the voltage and current, GlobSol with the constant subdivision >modification gives five boxes in 0.2 seconds, and gives an answer of > > The interval hull of the boxes with verified feasible points: > [ 0.5302D+01, 0.9107D+01 ] [ 0.1834D+01, 0.3150D+01 ] > The interval hull of the objective values corresponding > to the boxes with verified feasible points: > [ 0.0000D+00, 0.3560D+02 ] > >With 20 subdivisions, it gives 20 boxes, in 0.44 CPU seconds, with >an answer of > > The interval hull of the boxes with verified feasible points: > [ 0.5118D+01, 0.9285D+01 ] [ 0.1798D+01, 0.3263D+01 ] > The interval hull of the objective values corresponding > to the boxes with verified feasible points: > [ 0.0000D+00, 0.3377D+02 ] > Ratio of width of phi to width of varied constant: > 0.1689D+02 > >(It appears both constants need to be subdivided to make this more >accurate.) > > >I'm presently working on alternate ideas to make GlobSol more effective >on this kind of problem. > >Best regards, > >Baker > >P.S. May I post this to the reliable_computing [at] interval [dot] louisiana.edu > mailing list? I think there may be general interest in it there. > >At 03:12 PM 9/22/00 -0700, you wrote: >>Hi Baker, >> >>Let's say that R and P are known: >> >>eg R=[2,4] >> P=[16,18] >> I=[-INF,+INF] >> V=[-INF,+INF] >> >>that is, R and P are known intervals, and I and V are initially completely >>unknown. >> >>and the equations are, as before: >> >>P = V * I --- equation 1 --> Power = Voltage * Current >>V = I *R --- equation 2 --> Voltage = Current * Resistance >> >>Can Globsol correctly determine the intervals for all 4 variables? Do you >>have a paper on your website describing how it solves for this system of 2 >>equations? (One solution we were exploring at McGill was using an >algebraic >>engine which would generate the two needed equations: P=I^2*R and P=V^2/R >in >>order to resolve the relationship between P and R. This solution did not >>scale for a system of many equations) >> >>Regards, >> >>Gautam >> >>-----Original Message----- >>From: R. Baker Kearfott [mailto:rbk [at] louisiana [dot] edu] >>Sent: Friday, September 22, 2000 4:11 PM >>To: gsaxena [at] informatica [dot] com >>Subject: Re: GlobSol - interval math application >> >> >>Gautam, >> >>I'm not sure I understand your simple example. Which quantities are >>you considering to be known, and which are unknown? >> >>Baker >> >>At 09:49 AM 9/22/00 -0700, you wrote: >>>Hi Dr. Kearfott, >>> >>>While researching interval mathematic tools, I came across your product, >>>GlobSol. I have a simple "yes/no" question which I was unable to answer >>>easily from reviewing website information regarding GlobSol: >>> >>>Can GlobSol solve a set of algebraic equations accurately given interval >>>definitions of the various variables? >>> >>>The simplest example from electrical circuits analysis would be: >>> >>>P=V*I; >>>V=I*R; >>> >>>where P, V, I, R are all defined as intervals. As you undoubtedly know, >>>even this simplest of equations gives incorrect results if you simply >apply >>>basic interval math. One solution is to generate the equations P=I^2*R >and >>>P=V^2/R and to then solve using standard interval math techniques. How >>does >>>GlobSol solve this equation? >>> >>>Gautam Saxena >>>(I am a recent graduate of Computer Engineering, BEng 2000, McGill >>>University; one component of my thesis was to work on interval math based >>>algebraic solvers) >>> >>> >> --------------------------------------------------------------- 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 Mon Sep 25 11:27:49 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id LAA22855 for reliable_computing-outgoing; Mon, 25 Sep 2000 11:27:49 -0500 (CDT) Received: from bologna.vision.caltech.edu (bologna.vision.caltech.edu [131.215.163.1]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id LAA22850 for