From owner-reliable_computing [at] interval [dot] usl.edu Sat Jul 1 22:40:32 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id WAA00456 for reliable_computing-outgoing; Sat, 1 Jul 2000 22:40:32 -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 WAA00451 for ; Sat, 1 Jul 2000 22:40:14 -0500 (CDT) Received: from ns1.glasnet.ru.glasnet.ru (ppp111-246.dialup.mtu-net.ru [212.188.111.246]) by mtu.ru (Postfix) with SMTP id 6896B4525; Sun, 2 Jul 2000 07:39:49 +0400 (MSD) (envelope-from Yakovlev@rc-journal.mtu-net.ru) Message-ID: <00d501bfe3d7$3ea77960$be66bcd4 [at] glasnet [dot] ru.glasnet.ru> Reply-To: "Alexander G. Yakovlev" From: "Alexander G. Yakovlev" To: Subject: My addres has been changed - 2 Date: Sun, 2 Jul 2000 07:39:27 +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;andrey [at] leland [dot] stanford.edu;angelique.hempel [at] wkap [dot] nl;dmitri.chiriaev [at] eng [dot] sun.com;Gerd.Bohlender [at] math [dot] uni-karlsruhe.de;fridval [at] hotmail [dot] com;hempel [at] wkap [dot] nl;iosef [at] vms [dot] huji.ac.il;Kerstin.Dick [at] math [dot] uni-karlsruhe.de;Musayev [at] usa [dot] net;rbk [at] usl [dot] edu;roos [at] wkap [dot] nl;Rudi.Klatte [at] math [dot] uni-karlsruhe.de;shulam [at] actcom [dot] co.il;Ulrich.Kulisch [at] math [dot] uni-karlsruhe.de;yohayv [at] microsoft [dot] com;vladik [at] cs [dot] utep.edu;wolff [at] informatik [dot] uni-wuerzburg.de;yiddishstudies@oxf-inst.demon.co.uk Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear colleagues, After circular sending round my previous message (see below) I have suddenly found that some mail servers can't receive messages contaning the sign '_' after '@'. So, I have corrected my new address. Its final form is as follows: Yakovlev@rc-journal.mtu-net.ru Sincerely yours, Alexander Yakovlev ------------------------------------------------------ Dear colleagues, I would like to inform you that my address Yakovlev [at] globlab [dot] msk.su is not actual starting this moment. Instead of the former address please write me to Yakovlev@rc_journal.mtu-net.ru However, it is preferable to send me to this address relatively small messages (for instance, not more than 15 KB). Large letters please send to another address: scdl [at] glasnet [dot] ru Usually, mail from the both addresses will be read at least once per day. Sincerely yours, Alexander Yakovlev, Managing Editor of the journal `Reliable Computing' From owner-reliable_computing [at] interval [dot] usl.edu Tue Jul 4 09:15:36 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id JAA04713 for reliable_computing-outgoing; Tue, 4 Jul 2000 09:15:36 -0500 (CDT) Received: from mx2.iat.cnr.it (mx2.iat.cnr.it [146.48.65.89]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id JAA04708 for ; Tue, 4 Jul 2000 09:15:07 -0500 (CDT) Received: from CONVERSION.MAIL.IAT.CNR.IT by mail.iat.cnr.it (PMDF V6.0-24 #36023) id <01JRDIRKHKGW8Y4ZOS [at] mail [dot] iat.cnr.it> (original mail from t.bolognesi [at] IEI [dot] PI.CNR.IT) for reliable_computing [at] interval [dot] usl.edu; Tue, 04 Jul 2000 16:12:30 +0100 (MET) Received: from CONVERSION.MAIL.IAT.CNR.IT by mail.iat.cnr.it (PMDF V6.0-24 #36023) id <01JRDIRYM1LS8WWMBE [at] mail [dot] iat.cnr.it>; Tue, 04 Jul 2000 16:12:44 +0100 (MET) Received: from mailserv.iei.pi.cnr.it (mailserv.iei.pi.cnr.it [146.48.84.3]) by mail.iat.cnr.it (PMDF V6.0-24 #36023) with ESMTP id <01JRDIRYCNHQ8WWMPR [at] mail [dot] iat.cnr.it>; Tue, 04 Jul 2000 16:12:43 +0100 (MET) Received: from [146.48.84.49] (mac-bolognesi.iei.pi.cnr.it [146.48.84.49]) by mailserv.iei.pi.cnr.it (8.9.3/8.9.3) with ESMTP id OAA02774; Tue, 04 Jul 2000 14:13:57 -0100 (GMT) Date: Tue, 04 Jul 2000 16:17:38 +0100 From: Tommaso Bolognesi Subject: FORTE/PSTV 2000 - Call for Participation & Poster Contribution X-Sender: bolog [at] mailserv [dot] iei.pi.cnr.it To: forte-pstv-2000-people [at] mail [dot] iat.cnr.it, forte-pstv-2000-lists [at] mail [dot] iat.cnr.it Reply-to: forte-pstv-2000 [at] cpr [dot] it Message-id: MIME-version: 1.0 Content-type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: 8bit X-MIME-Autoconverted: from quoted-printable to 8bit by interval.usl.edu id JAA04709 Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk ------------------- CALL FOR PARTICIPATION ------------------------ ------------------- CALL FOR POSTER CONTRIBUTION ----------- ******** ******** ************** ************** ************** ************** F O R T E / P S T V 2 0 0 0 ************** *** ************** ***** ************** ***** ************** ***** ************** ***** ************** ***** ----------------------- Pisa, October 10-13, 2000 --------------- http://forte-pstv-2000.cpr.it IFIP TC6/WG6.1 Joint International Conference FORMAL DESCRIPTION TECHNIQUES for Distributed Systems and Communication Protocols (FORTE XIII) PROTOCOL SPECIFICATION, TESTING, AND VERIFICATION (PSTV XX) Satellite Workshop: FORMAL METHODS *ELSEwHERE* INVITED SPEAKERS Rocco De Nicola Fausto Giunchiglia John Rushby TUTORIALS on Model Checking, Testing, and more. IFIP TRAVEL GRANTS available for students. EC GRANTS available for young researchers. POSTERS -------------- This year, FORTE/PSTV will offer a Poster Space aimed at giving young researchers attending the conference an opportunity to show their "work-in-progess" and to interact effectively with senior researchers. Since EC Grants are precisely meant to to promote *active* participation of young researchers and their interaction with leading scientists, applications for obtaining these Grants are seen more favourably if associated with a poster submission (which, however, is not mandatory). Poster authors should send a 500 word text file describing the contents of their poster to: forte-pstv-2000 [at] cpr [dot] it. Application: before August 20, 2000 Notification: before August 30, 2000. EARLY REGISTRATION DEADLINE: August 31 -------------------------------------------------------------------- HOTEL ACCOMODATION and CONFERENCE REGISTRATION forms: ===> http://forte-pstv-2000.cpr.it <=== For further information: forte-pstv-2000 [at] cpr [dot] it =============================================== ************************************************************ FORTE/PSTV 2000 PROGRAMME *** Twentieth Anniversary *** *** Formal Methods: Implementation Under Test *** =============================================== TUESDAY, OCT. 10 - TUTORIALS DAY =============================================== 8:00 Registration 9:00-19:30 TUTORIAL TRACK A 9:00-19:30 TUTORIAL TRACK B TUTORIAL TRACK A -------------------------------- A1 - E. Allen Emerson Model Checking 9:00-10:30 Part I 11:00-12:30 Part II A2 - Jan Tretmans Specification based testing with formal methods: from theory via tools to applications 14:00-15:30 Part I 16:00-17:30 Part II A3 - Marta Kwiatkowska Modelling and verification of probabilistic real-time systems using probabilistic timed automata 18:00-19:30 TUTORIAL TRACK B ------------------------------- B1 - Hartmut Koenig, Peter Langendoerfer Automated Derivation of Efficient Implementations from Formal Protocol Specifications 9:00-10:30 Part I 11:00-12:30 Part II B2 - R. Gotzhein, E. Börger, A. Prinz Abstract State Machines and their Applications 14:00-15:30 Part I 16:00-17:30 Part II B3 - C. Petitpierre Bridging the Gap Between Formal Methods and the Implementation Process 18:00-19:30 =============================================== WEDNESDAY, OCT. 11 =============================================== 8:00 REGISTRATION 8:45 OPENING INVITED TALK I ------------------------------------ 9:00-10:30 From Refutation to Verification John Rushby - SRI International SESSION 1 - VERIFICATION AND THEOREM PROVING ------------------------------------ 11:00-11:30 Formal Verification of the TTP Group Membership Algorithm H. Pfeifer (Ulm Univ.) 11:30-12:00 Verification of a Sliding Window Protocol Using IOA and MONA M. A. Smith (IRISA), N. Klarlund (AT&T Labs Research) 12:00-12:30 A Priori Verification of Reactive Systems M. Majster-Cederbaum, F. Salger, M. Sorea (Mannheim Univ.) SESSION 2 - TEST GENERATION ------------------------------------ 14:00 - 14:30 From Rule-based to Automata-based Testing K. Etessami, M. Yannakakis (Bell Labs) 14:30 - 15:00 Integrated System Interoperability Testing with Applications to VOIP N. Griffeth, R. Hao, D. Lee, R. K. Sinha (Bell Labs) 15:00 - 15:30 On Test Derivation from Partial Specifications A. Petrenko (CRIM), N. Yevtushenko (Tomsk State Univ.) SESSION 3 - MODEL CHECKING - THEORY ------------------------------------ 16:00-16:30 Compositional Model Checking A. Santone (Pisa Univ.) 16:30-17:00 A Model Checking Method for Partially Symmetric Systems S. Haddad (Paris Dauphine Univ.), J.-M. Ilié, K. Ajami (Paris VI Univ.) INDUSTRIAL PRESENTATION ------------------------------------ 17:00-18:00 TEsTing RAdio Protocols.How to obtain benefits by the application of Formal Description Techniques to the Software Development Process. Vincenzo Cipolla - Marconi Communications =============================================== THURSDAY, OCT. 12 =============================================== 8:30 Registration INVITED TALK II ------------------------------------ 9:00-10:30 Process Algebraic Analysis of Cryptographic Protocols Rocco de Nicola - Florence Univ. SESSION 4 - MODEL CHECKING - APPLICATIONS ------------------------------------ 11:00-11:30 Specification and Verification of Message Sequence Charts D. Peled (Bell Labs) 11:30-12:00 A State-Exploration Technique for Spi-Calculus Testing Equivalence Verification L. Durante, R. Sisto (Politecnico Torino), A. Valenzano (CNR-IRITI) 12:00-12:30 Verification of Consistency Protocols via Infinite-State Symbolic Model Checking G. Delzanno (Genova Univ.) SESSION 5 - MULTICAST PROTOCOL ANALYSIS AND SIMULATION ------------------------------------ 14:00 - 14:30 Systematic Performance Evaluation of Multipoint Protocols A. Helmy, S. Gupta, D. Estrin, A. Cerpa, Y. Yu (Univ. Southern California) 14:30-15:00 Simulating Multicast Transport Protocols in Estelle J. Templemore-Finlayson (INT Evry), E. Borcoci (Univ. Politec. Bucharest) 15:00-15:30 Generation of Realistic Signalling Traffic in an ISDN Load Test System using SDL User Models T. Steinert (Univ. Stuttgart), G. Roessler (Tenovis) SESSION 6 - EXHAUSTIVE AND PROBABILISTIC TESTING ------------------------------------ 16:00-16:30 Satisfaction up to Liveness U. Ultes-Nitsche (Univ. of Southampton) 16:30-17:00 Testing IP Routing Protocols - From Probabilistic Algorithms to a Software Tool R. Hao, D. Lee, R. K. Sinha, D. Vlah (Bell Labs) =============================================== FRIDAY, OCT. 13 =============================================== INVITED TALK III ------------------------------------ 9:00-10:30 A Logic of Belief and a Model Checking Algorithm for Security Protocols Fausto Giunchiglia - IRST and Trento Univ. SESSION 7 - HARDWARE SPECIFICATION, IMPLEMENTATION AND TESTING ------------------------------------ 11:00-11:30 Verifying and Testing Asynchronous Circuits using LOTOS J. He, K. Turner (Univ. of Stirling) 11:30-12:00 Hardware implementation of Concurrent Periodic EFSM H. Katagiri, M. Kirimura (Osaka Univ.), K. Yasumoto (Shiga Univ.), T. Higashino, K. Taniguchi (Osaka Univ.) 12:00-12:30 Modelling Distributed Embedded Systems in Multiclock ESTEREL B. Rayan, R. K. Shyamasundar (Tata Institute) SESSION 8 - FORMAL SEMANTICS ------------------------------------ 14:00 -14:30 Compact Net Semantics for Process Algebras M. Bernardo, M. Ribaudo (Univ. Torino), N. Busi (Univ. Bologna) 14:30-15:00 A Concise Compositional Statecharts Semantics Definition M. von der Beeck (Munich Univ. of Technology) 15:00-15:30 Implementing CCS in Maude A. Verdejo, N. Martí-Oliet (Univ. Complutense Madrid) 15:30-15:45 CLOSING ================================================================= From owner-reliable_computing [at] interval [dot] usl.edu Sat Jul 8 02:19:51 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id CAA10193 for reliable_computing-outgoing; Sat, 8 Jul 2000 02:19:51 -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 CAA10188 for ; Sat, 8 Jul 2000 02:19:45 -0500 (CDT) Received: from slava.UUCP (uucp@localhost) by into.nit.spb.ru (8.8.7/8.8.7) with UUCP id LAA14470 for reliable_computing [at] interval [dot] usl.edu; Sat, 8 Jul 2000 11:21:28 +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); Sat, 8 Jul 2000 11:00:31 +0400 To: reliable_computing [at] interval [dot] usl.edu Message-Id: Organization: Slava Nesterov Date: Sat, 8 Jul 2000 11:00:31 +0400 (MSD) Reply-To: nest [at] into [dot] nit.spb.su From: "Slava Nesterov" X-Mailer: dMail [Demos Mail for DOS v1.23] Subject: Reliable Computing, Vol.6, issue 4 Lines: 39 Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Reliable Computing Volume 6, Issue 4, 2000 Special Issue Proceedings of the International Conference on Rational Approximation ICRA99 June 6-11, 1999, Antwerp, Belgium Guest Editors: Annie Cuyt and Brigitte Verdonk Foreword 363 Effective Computation of Rational Approximants and Interpolants Bernhard Beckermann, George Labahn 365-390 Rational Interpolation from Stochastic Data: A New Froissart's Phenomenon Jean-Daniel Fournier, Maciej Pindor 391-409 Reliability of Lanczos-Type Product Methods from Perturbation Theory Peter R. Graves-Morris 411-428 Hybrid Rational Function Approximation and Its Accuracy Analysis Hiroshi Kai, Matu-Tarow Noda 429-438 Numerical Computation of the Least Common Multiple of a Set of Polynomials Nicos Karcanias, Marilena Mitrouli 439-457 On Factorization of Analytic Functions and Its Verification Tetsuya Sakurai, Hiroshi Sugiura 459-470  From owner-reliable_computing [at] interval [dot] usl.edu Sat Jul 8 05:11:59 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id FAA11394 for reliable_computing-outgoing; Sat, 8 Jul 2000 05:11:59 -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 FAA11389 for ; Sat, 8 Jul 2000 05:11:55 -0500 (CDT) Received: from hilbert.theoinf-fernuni-hagen.de (actually hilbert.fernuni-hagen.de) by elm.fernuni-hagen.de via local-channel with SMTP; Sat, 8 Jul 2000 12:11:42 +0200 Received: by hilbert.theoinf-fernuni-hagen.de (SMI-8.6/SMI-SVR4) id MAA14603; Sat, 8 Jul 2000 12:11:40 +0200 Date: Sat, 8 Jul 2000 12:11:40 +0200 From: Vasco.Brattka@FernUni-Hagen.de (Vasco Brattka) Message-Id: <200007081011.MAA14603 [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 _______________________________________________________________________ Second Announcement and Call for Papers 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 As part of the workshop a friendly competition between systems for exact real computation, organized by David Lester (Manchester, England) dlester [at] cs [dot] man.ac.uk will take place. The systems will be run on a set of problems and evaluated. The systems should compute an approximation to the exact result to any predetermined accuracy. For further information, including a list of proposed problems, see http://www.cs.man.ac.uk/arch/dlester/arithmetic/comp.html Competitors should give an overview of their systems. We wish to inaugurate an ongoing open forum for real number programming. Submissions on implementation issues are encouraged for the workshop. Paper Submission Authors are invited to send one copy of an article either electronically as a PostScript file to cca@fernuni-hagen.de or a paper copy to CCA-2000 Klaus Weihrauch FernUniversitaet D-58084 Hagen Germany Proceedings Preliminary proceedings will be available for the workshop in the form of a technical report. It is intended for final versions of selected papers to be fully refereed and published in a Springer Lecture Notes in Computer Science. Deadline for inclusion in the preliminary proceedings is 15 August 2000. Authors' instructions We advise authors to follow the guidelines for articles in the Springer Lecture Notes in Computer Science series, see http://www.springer.de/comp/lncs/authors.html In particular, we recommend preparing the manuscript with LaTeX2e and the document class llncs.cls. Venue Department of Computer Science, University of Wales Swansea. Accommodation Accomodation is available on campus for 32 pounds per night including breakfast. A conference fee of 60 pounds including 2 evening meals and two lunches will apply. Bookings need to be made 3 weeks in advance with CCA 2000 Mrs Jill Edwards Department of Computer Science University of Wales Swansea Singleton Park Swansea SA2 8PP UK Web site http://www.informatik.fernuni-hagen.de/cca/cca2000/ From owner-reliable_computing [at] interval [dot] usl.edu Tue Jul 11 03:18:51 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id DAA16111 for reliable_computing-outgoing; Tue, 11 Jul 2000 03:18:51 -0500 (CDT) Received: from gatesrv.rz.unibw-muenchen.de (gatesrv.RZ.UniBw-Muenchen.de [137.193.10.21]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id DAA16106 for ; Tue, 11 Jul 2000 03:18:46 -0500 (CDT) Received: from aeneas.informatik.unibw-muenchen.de (aeneas.Informatik.UniBw-Muenchen.de [137.193.60.85]) by gatesrv.rz.unibw-muenchen.de (8.9.1b+Sun/8.9.3) with ESMTP id KAA11560; Tue, 11 Jul 2000 10:17:54 +0200 (MET DST) Received: from unibw-muenchen.de (localhost [127.0.0.1]) by aeneas.informatik.unibw-muenchen.de (8.9.1b+Sun/8.9.1) with ESMTP id KAA04772; Tue, 11 Jul 2000 10:17:50 +0200 (MET DST) Message-ID: <396AD82D.29EDF192@unibw-muenchen.de> Date: Tue, 11 Jul 2000 10:17:49 +0200 From: Andy Schuerr Organization: University Bw Munich X-Mailer: Mozilla 4.73 [en] (X11; U; SunOS 5.7 sun4u) X-Accept-Language: en MIME-Version: 1.0 To: "Andy.Schuerr" Subject: CFP: OMER-2 - Object-oriented Modeling of Embedded RT-Systems Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk CALL FOR POSITION PAPERS O M E R - 2 Object-oriented Modeling of Embedded RT-Systems (http://ist.unibw-muenchen.de/GROOM/OMER-2/) 10 - 12 May 2001 Herrsching am Ammersee 9th Workshop of Working Group "GROOM: Foundations of OO Modeling" of the "GI-Fachgruppe 2.1.9" "OOSE: OO-Software-Entwicklung" * * * SCOPE The importance of embedded real-time (RT) systems for our daily life is rapidly increasing. Important application areas are e.g. the aerospace, automotive, chemical process engineering, and telecommunications industry. In all these areas the complexity and functionality of functions realized in software increases rapidly. Often this software is still developed using software engineering technologies of the eighties. As a consequence, it does not fulfill our expectations concerning maintenance and reusability of developed subcomponents. Furthermore, it often suffers from a separation of functions and data. These are the reasons why object-oriented (OO) approaches are needed that facilitate the development of reusable software components, which hide data and functions behind well-defined interfaces. The workshop OMER-2 addresses all aspects of the development and application of object-oriented methods (languages, tools, processes) for the design and implementation of embedded RT systems. Its main purpose is to serve as a platform for academics and industry as well as for tool (method) developers and users to exchange their experiences in this field and to discuss new trends. A further intention is to clarify a research agenda for the OO development of embedded RT software, allowing academics to focus their efforts and practitioners to reflect their daily business. FORMAT OMER-2 is planned to be an "informal" workshop (similar to its predecessor) with a limited number of participants (authors of position paper submissions will be preferred), invited talks of distinguished experts, short presentations of accepted submissions, a modeling contest, and ample time for discussions and working subgroups on different topics. INVITED SPEAKER * Bruce Douglass (I-Logix, Andover) MODELING CONTEST (http://www.automotive-uml.com/mc/) The workshop is accompanied by a modeling contest. The best models will be honored with prize money and be presented at the workshop. SUBMISSIONS Position papers of four to six pages pertaining to all aspects of OO embedded RT system modeling are sought, not limited to the following: * Architectural styles, patterns, ... * Code generation from models * Development of reusable components * Experience reports of OO projects * Extensions of OO modeling languages * Testing and verification strategies Submissions should be sent as pdf- or ps-files to mailto:omer [at] ist [dot] unibw-muenchen.de The proceedings of OMER-2 will be published as a technical report. Authors of selected submissions will be invited to submit a journal paper version after the workshop. DEADLINES Deadline for position papers: March 1st, 2001 Notification of authors: April 1st, 2001 Registration for workshop: April 11th, 2001 LOCAL ORGANIZATION A. Schuerr (Andy.Schuerr [at] ist [dot] unibw-muenchen.de) Institute for Software Technology University of the Federal Armed Forces, Munich D-85577 Neubiberg, Germany PROGRAM COMMITTEE P. Hofmann, DaimlerChrysler, Esslingen (co-chair) A. Schuerr, University Bw, Muenchen (co-chair) M. von der Beeck, TU Muenchen M. Cohen, I-Logix, Andover W. Damm, OFFIS, Oldenburg G. Engels, University of Paderborn M. Fuchs, BMW, Muenchen D. Hogrefe, University of Luebeck J. Hooman, University of Nijmegen J. Kaiser, Universitaet Ulm B. Moller-Pedersen, Ericsson AS, Billingstad U. Pansa, Telelogic Germany A. Radermacher, Siemens AG, Muenchen R. Resch, Berner & Mattner GmbH, Muenchen St. Schmerler, FZI Karlsruhe B. Selic, ObjecTime Limited, Kanata A. Shaw, University of Washington, Seattle H.-Ch. von der Wense, Motorola GmbH, Muenchen J. Ziegler, Nokia, Helsinki From owner-reliable_computing [at] interval [dot] usl.edu Fri Jul 21 01:37:30 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id BAA04289 for reliable_computing-outgoing; Fri, 21 Jul 2000 01:37:29 -0500 (CDT) Received: from gcet_int.gcet.ac.in (PPP49-36.ahd.vsnl.net.in [202.54.49.36]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id BAA04284 for ; Fri, 21 Jul 2000 01:37:01 -0500 (CDT) Received: from CABIN2 by gcet_int.gcet.ac.in with SMTP (Microsoft Exchange Internet Mail Service Version 5.0.1460.8) id 3FTBC15P; Fri, 21 Jul 2000 12:07:33 +0530 Message-ID: <002c01bff2de$16fdb350$170a0a0a [at] gcet [dot] ac.in> From: "Mr. Ketan Kotecha" To: Subject: forte-fortran-95 Date: Fri, 21 Jul 2000 12:06:42 +0530 MIME-Version: 1.0 Content-Type: multipart/alternative; boundary="----=_NextPart_000_0029_01BFF30C.21D2E650" X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 5.00.2314.1300 X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2314.1300 Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk This is a multi-part message in MIME format. ------=_NextPart_000_0029_01BFF30C.21D2E650 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable Is Sun's forte-Fortran-95 availble on Windows platform? What is the price? ------=_NextPart_000_0029_01BFF30C.21D2E650 Content-Type: text/html; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable
Is Sun's forte-Fortran-95  = availble on Windows=20 platform?
What is the = price?
------=_NextPart_000_0029_01BFF30C.21D2E650-- From owner-reliable_computing [at] interval [dot] usl.edu Fri Jul 21 05:22:49 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id FAA05525 for reliable_computing-outgoing; Fri, 21 Jul 2000 05:22:48 -0500 (CDT) Received: from d15.ucs.usl.edu (rbk5287 [at] d15 [dot] ucs.usl.edu [130.70.112.15]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id FAA05520 for ; Fri, 21 Jul 2000 05:22:45 -0500 (CDT) Received: (from rbk5287@localhost) by d15.ucs.usl.edu (8.9.1/8.9.1/ucs-client_1.3) id FAA26642; Fri, 21 Jul 2000 05:21:56 -0500 (CDT) Date: Fri, 21 Jul 2000 05:21:56 -0500 (CDT) From: Kearfott Ralph B Message-Id: <200007211021.FAA26642 [at] d15 [dot] ucs.usl.edu> To: Bill.Walster [at] Eng [dot] Sun.COM, kk [at] gcet [dot] ac.in, reliable_computing [at] interval [dot] usl.edu Subject: Re: forte-fortran-95 Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Probably the most appropriate person to answer this question is someone within Sun, or perhaps you can look at the Sun web page. However, based on the traditional marketing strategy of Sun, I seriously doubt it would be available for MS-Windows. Nonetheless, Sun has a version of its Solaris operating system for Intel-based machines, and there's a good chance that the compiler will be available for that system. There's also a chance (perhaps not as good a one) that the compiler will be available for Linux. Again, I probably should have looked (or asked) Sun directly about this. Anyone who has looked this up, or who knows, please feel free to post the answer to this list. Best regards, Baker From: "Mr. Ketan Kotecha" To: Subject: forte-fortran-95 Date: Fri, 21 Jul 2000 12:06:42 +0530 Is Sun's forte-Fortran-95 availble on Windows platform? What is the price? From owner-reliable_computing [at] interval [dot] usl.edu Fri Jul 21 06:48:51 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id GAA05871 for reliable_computing-outgoing; Fri, 21 Jul 2000 06:48:51 -0500 (CDT) Received: from yonge.cs.toronto.edu (root [at] yonge [dot] cs.toronto.edu [128.100.1.8]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with SMTP id GAA05866 for ; Fri, 21 Jul 2000 06:48:47 -0500 (CDT) Received: from jane.cs.toronto.edu ([128.100.2.31]) by yonge.cs.toronto.edu with SMTP id <33966-23052>; Fri, 21 Jul 2000 07:48:39 -0400 Received: from qew.cs.toronto.edu by jane.cs.toronto.edu id <453138-18344>; Fri, 21 Jul 2000 07:48:30 -0400 From: Ken Jackson To: reliable_computing [at] interval [dot] usl.edu Subject: Re: Announcement: 2001-02 NA Year at the Fields Institute in Toronto Cc: krj [at] cs [dot] toronto.edu Message-Id: <00Jul21.074830edt.453138-18344 [at] jane [dot] cs.toronto.edu> Date: Fri, 21 Jul 2000 07:48:24 -0400 Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk The Fields Institute in Toronto is sponsoring a Thematic Year on "Numerical and Computational Challenges in Science and Engineering" (NCCSE) from August 2001 to July 2002. The main point of this announcement is to inform the scientific computing committee about this event so that any people interested in participating can include it in their plans for 2001-02. A key to the success of this program will be the senior long-term visitors that it attracts. Their research interests will shape many of the events that take place during the year and their participation in the program will attract many junior colleagues, postdocs and graduate students. We are now considering applications from senior researchers to visit the Fields Institute for a month or more, possibly spread out over several shorter visits, such as a couple of weeks around two or more workshops or one day each week for a term. We would particularly welcome visitors for one or both terms of the year. We have some funds to support travel and local expenses for senior researchers, but not to pay their salaries. If you are a senior researcher interested in participating in the program, please e-mail Ken Jackson at krj [at] cs [dot] utoronto.ca. More information about the Fields Institute in general and the NCCSE Thematic Year in particular can be found at http://www.fields.utoronto.ca and http://www.fields.utoronto.ca/numerical.html respectively. From owner-reliable_computing [at] interval [dot] usl.edu Fri Jul 21 10:04:48 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA06308 for reliable_computing-outgoing; Fri, 21 Jul 2000 10:04:47 -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 KAA06303 for ; Fri, 21 Jul 2000 10:04:44 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.10.1/8.10.1) with SMTP id e6LF4bg07301 for ; Fri, 21 Jul 2000 09:04:38 -0600 (MDT) Message-Id: <200007211504.e6LF4bg07301 [at] cs [dot] utep.edu> Date: Fri, 21 Jul 2000 09:04:37 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: Special issue of the TCS To: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: 8YgBPSGT36zFJz3hO+zREg== 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 ------------- Begin Forwarded Message ------------- Date: Fri, 21 Jul 2000 15:30:05 +0200 (MEST) From: Peter Kornerup To: RNC4 List: ; Subject: Special issue of the TCS MIME-Version: 1.0 Dear Colleague, As promised in the information on the 4th "Real Numbers and Computers" held at Scloss Dagstuhl last April, we have now obtained the approval of a special issue of the journal "Theoretical Computer Science". Please consider if you may have a paper suitable to submit. I apologize if you receive this message more than once. Best Regards, Peter Kornerup ----------- CALL FOR PAPERS: Please distribute ---------- Theoretical Computer Science Special issue: Real Numbers and Computers Guest Editors: Jean-Claude Bajard, Christiane Frougny, Jean-Michel Muller and Peter Kornerup. Important Dates: - Deadline for submissions of manuscripts (full papers only; extended abstracts will be rejected): January 5, 2001 - Notification of acceptance/rejection: March 15, 2001 - Deadline for reception of final papers: April 16, 2001 Efficient manipulation of (some) real numbers in computers is still a challenge! Many interesting theoretical and algorithmic problems are linked with that topic, and belong to quite distant fields such as computer science, number theory, numerical analysis, computer algebra and logics. A number of TCS special issues on real numbers and computers has previously been issued, as follow-up to the now bi-annual meetings on these topics, the last one being RNC4 which took place at Schloss Dagstuhl in April 2000, proceeding of which can be found at the following URL: http://www.dagstuhl.de/DATA/Events/00/00162.proceedings/ The success of these meetings and the special issues of the TCS has shown an increasing interest for such questions in many scientific communities. The aim of this new special issue of the TCS is likewise to gather contributions on what is becoming a new active research domain. Scientists working on questions related to real computer arithmetic are encouraged to present the theoretical or algorithmic aspects of their results. Email a PostScript version of your full paper to: kornerup [at] imada [dot] sdu.dk (subject: TCS) before January 5!!! Please clearly indicate that your submission is to the special issue of TCS. Make sure that your PostScript file can be printed on a standard laser printer. Another possible check is to view it by Ghostscript. Language: English. -------- Peter Kornerup | Email: kornerup [at] imada [dot] sdu.dk Dept. of Math. & Comp. Science | URL: http://www.imada.sdu.dk/~kornerup/ SDU/Odense University | Phone: +45 6550 2357 DK-5230 Odense M, DENMARK | Fax: +45 6593 2691, Home: +45 6591 0395 ------------- End Forwarded Message ------------- From owner-reliable_computing [at] interval [dot] usl.edu Fri Jul 21 10:14:46 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA06562 for reliable_computing-outgoing; Fri, 21 Jul 2000 10:14:46 -0500 (CDT) Received: from lukla.Sun.COM (lukla.Sun.COM [192.18.98.31]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA06556 for ; Fri, 21 Jul 2000 10:14:42 -0500 (CDT) Received: from engmail1.Eng.Sun.COM ([129.146.1.13]) by lukla.Sun.COM (8.9.3+Sun/8.9.3) with ESMTP id JAA10667 for ; Fri, 21 Jul 2000 09:14:39 -0600 (MDT) Received: from susila.eng.sun.com (susila.Eng.Sun.COM [129.146.79.72]) by engmail1.Eng.Sun.COM (8.9.3+Sun/8.9.3/ENSMAIL,v1.7) with ESMTP id IAA04690; Fri, 21 Jul 2000 08:08:37 -0700 (PDT) Received: from susila (susila [129.146.79.72]) by susila.eng.sun.com (8.9.3+Sun/8.9.3) with SMTP id IAA23528; Fri, 21 Jul 2000 08:08:36 -0700 (PDT) Message-Id: <200007211508.IAA23528 [at] susila [dot] eng.sun.com> Date: Fri, 21 Jul 2000 08:08:36 -0700 (PDT) From: "Gregory V. Tarsy" Reply-To: "Gregory V. Tarsy" Subject: Re: forte-fortran-95 To: reliable_computing [at] interval [dot] usl.edu, kk [at] gcet [dot] ac.in MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: 73iG0onSSe4ymOfC4rUNzQ== 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 Forte Fortran95 is only available on Solaris/SPARC platforms. ........................................ Gregory V. Tarsy, Ph.D. Manager, Floating Point and Performance Sun Microsystems Inc. M/S MPK16-303 901 San Antonio Ave. Palo Alto, CA 94303 V:(650)786-8908 F:(650)786-9551 gvt [at] eng [dot] sun.com ........................................ #From: "Mr. Ketan Kotecha" #To: #Subject: forte-fortran-95 #Date: Fri, 21 Jul 2000 12:06:42 +0530 #MIME-Version: 1.0 #X-Priority: 3 #X-MSMail-Priority: Normal #X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2314.1300 # #Is Sun's forte-Fortran-95 availble on Windows platform? #What is the price? From owner-reliable_computing [at] interval [dot] usl.edu Sat Jul 22 14:49:28 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id OAA08788 for reliable_computing-outgoing; Sat, 22 Jul 2000 14:49:27 -0500 (CDT) Received: from gauss.Mines.EDU (gauss.Mines.EDU [138.67.22.33]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id OAA08783 for ; Sat, 22 Jul 2000 14:49:23 -0500 (CDT) Received: (from xwu@localhost) by gauss.Mines.EDU (8.9.3/8.9.3) id NAA16733 for reliable_computing [at] interval [dot] usl.edu; Sat, 22 Jul 2000 13:42:52 -0600 (MDT) From: Xindong Wu Message-Id: <200007221942.NAA16733 [at] gauss [dot] Mines.EDU> Subject: Knowledge and Information Systems: Vol 2 No 3 (2000) To: reliable_computing [at] interval [dot] usl.edu Date: Sat, 22 Jul 100 13:42:52 -0600 (MDT) X-Mailer: ELM [version 2.4 PL25] MIME-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Knowledge and Information Systems: An International Journal ----------------------------------------------------------- ISSN 0219-1377 by Springer-Verlag Home Page: http://kais.mines.edu/~kais/ ======================================= Volume 2, Number 3 (August 2000): Table of Contents --------------------------------------------------- Critical Reviews - The State of the Art in Agent Communication Languages by Mamadou Tadiou Kone, Akira Shimazu and Tatsuo Nakajima Regular Papers - Simulating the Ecology of Oligopoly Competition with Genetic Algorithms by Shu-Heng Chen and Chih-Chi Ni - Intentions in the Coordinated Generation of Graphics and Text from Tabular Data by Massimo Fasciano and Guy Lapalme - An Intelligent Decision Support System for Investment Analysis by K.L. Poh Short Papers - Spatio-Temporal Analysis with the Self-Organizing Feature Map by Susan E. George - A Probe-based Technique to Optimize Join Queries in Distributed Internet Databases by Cyrus Shahabi, Latifur Khan, and Dennis McLeod From owner-reliable_computing [at] interval [dot] usl.edu Sat Jul 22 19:25:49 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id TAA09262 for reliable_computing-outgoing; Sat, 22 Jul 2000 19:25:49 -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 TAA09257 for ; Sat, 22 Jul 2000 19:25:45 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.10.1/8.10.1) with SMTP id e6N0PaT12511 for ; Sat, 22 Jul 2000 18:25:36 -0600 (MDT) Message-Id: <200007230025.e6N0PaT12511 [at] cs [dot] utep.edu> Date: Sat, 22 Jul 2000 18:25:35 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: new server for the interval computations website To: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: iJBT7r6L6IhQ5Yz6oo4thg== 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 Friends, As you probably know, the interval computations website resides on our Department's web. Our system administrator has moved all the web material to a new server http://www.cs.utep.edu which is only doing the web connections (all the other system functions stay with the previous server http://cs.utep.edu). Since we now have a special server which only does web connections, this should lead to a faster and more reliable connection to all our web material. If you use the old address http://cs.utep.edu/interval-comp, you can still get the access, but since it goes through the old server, you will not notice any improvement in the connection speed. To utilize this speed up, it is necessary to link to the interval computations page as http://www.cs.utep.edu/interval-comp, with "www" before "cs". Please change your bookmarked links accordingly. Again, there is no big problem if you keep the old URL, but if you use the new one hopefully the connection will be faster. If there are any problems with the old or new URL's please let me know. Sorry for the inconvenience and I hope that increased access speed will be a compensation for it. Thanks Vladik From owner-reliable_computing [at] interval [dot] usl.edu Sun Jul 23 08:18:35 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id IAA10954 for reliable_computing-outgoing; Sun, 23 Jul 2000 08:18:35 -0500 (CDT) Received: from henoch.cc.fh-lippe.de (henoch.cc.fh-lippe.de [193.16.112.72]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id IAA10949 for ; Sun, 23 Jul 2000 08:18:30 -0500 (CDT) Received: from spock.cc.fh-lippe.de([193.16.118.120]) (3363 bytes) by henoch.cc.fh-lippe.de via sendmail with P:esmtp/R:inet_hosts/T:smtp (sender: ) id for ; Sun, 23 Jul 2000 15:18:28 +0200 (MET DST) (Smail-3.2.0.111 2000-Feb-17 #1 built 2000-Mar-17) Received: from aleph(placida.cc.fh-lippe.de[193.16.112.184]) (2974 bytes) by spock.cc.fh-lippe.de via sendmail with P:smtp/R:smart_host/T:smtp (sender: ) id for ; Sun, 23 Jul 2000 15:18:26 +0200 (MET DST) (Smail-3.2.0.111 2000-Feb-17 #1 built 2000-Mar-17) Message-ID: <013601bff4a7$df19f7c0$a67010c1@aleph> Reply-To: "Norbert Heldermann" From: "Norbert Heldermann" To: Subject: JCA 7 (2000) Number 1 has appeared Date: Sun, 23 Jul 2000 15:13:10 +0200 MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 5.00.2615.200 X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2615.200 Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear Collegues: Number 1 of Volume 7 (2000) of the Journal of Convex Analysis has just appeared. We have completed today the shipping of all issues to editors, authors and subscribers. The distribution of reprints and free copies to authors has also been done. You find the list of contents below. This list -- enriched with abstracts -- can also be found on our web site: www.heldermann.de/jcacon.htm. Finally I would like to draw your attention to the "Journal Price Survey", published by the American Mathematical Society at http://www.ams.org/index/membership/journal-survey.html I have ordered the 251 journals in this list according to the parameter "price per page". The resulting Excel list is available from me upon request. The Journal of Convex Analysis achieved place 37. Five journals of Heldermann Verlag achieved places among the 37 leading publications -- a remarkable result. Finally I would like to draw your attention also to the list of forthcoming papers in JCA, which you find at http://www.heldermann.de/jcafopa.htm Sincerely yours, Norbert Heldermann. Heldermann Verlag, www.heldermann.de Email heldermann [at] gmx [dot] net Journal of Convex Analysis 7 (2000) Number 1: D. Aze, S. Bolintineanu Optimality Conditions for Constrained Convex Parabolic Control Problems Via Duality 001--018 K.-W. Zhang Rank-One Connections at Infinity and Quasiconvex Hulls 019--046 A. Eberhard, R. Wenczel Epi-Distance Convergence of Parametrised Sums of Convex Functions in Non-Reflexive Spaces 047--072 M. Finzel, W. Li Piecewise Affine Selections for Piecewise Polyhedral Multifunctions and Metric Projections 073--094 J.-P. Penot, C. Zalinescu Harmonic Sum and Duality 095--114 A. Verona, M. E. Verona Regular Maximal Monotone Operators and the Sum Theorem 115--128 S. Markov On the Algebraic Properties of Convex Bodies and Some Applications 129--166 G. Crasta, A. Malusa Euler-Lagrange Inclusions and Existence of Minimizers for a Class of Non-Coercive Variational Problems 167--182 B. Aghezzaf, S. Sajid On the Second-Order Contingent Set and Differential Inclusions 183--196 F. Alvarez Absolute Minimizer in Convex Programming by Exponential Penalty 197--202 Li Feng-Quan, Li Guang-Wei Summability of the Solutions to Nonlinear Parabolic Equations with Measure Data 203--208 From owner-reliable_computing [at] interval [dot] usl.edu Sun Jul 23 16:38:27 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id QAA11582 for reliable_computing-outgoing; Sun, 23 Jul 2000 16:38:27 -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 QAA11577 for ; Sun, 23 Jul 2000 16:38:22 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.10.1/8.10.1) with SMTP id e6NLYOS14050; Sun, 23 Jul 2000 15:34:24 -0600 (MDT) Message-Id: <200007232134.e6NLYOS14050 [at] cs [dot] utep.edu> Date: Sun, 23 Jul 2000 15:34:23 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: simple material on interval analysis To: kosko [at] sipi [dot] usc.edu Cc: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: GMGPTZEjxNmUoTA4Iu85Iw== 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 Bart, Thanks a lot for your request. I think it is a very good idea to give students exposure to interval techniques. I do not have such material ready, but I am sending your request to the interval computations mailing list, hopefully, someone already has such material (Bill Walster was thinking of preparing something like this a while ago). Vladik > From: Bart Kosko > Do you have any simple material on interval analysis that > would count as homework problem in an upper-division probability > course? That's a great way to introduce students to such concepts > and I have many opportunities to do so. (Secret: I also enjoy > working pen-and-paper problems myself.) From owner-reliable_computing [at] interval [dot] usl.edu Tue Jul 25 07:44:41 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id HAA15074 for reliable_computing-outgoing; Tue, 25 Jul 2000 07:44:41 -0500 (CDT) Received: from liasun13.epfl.ch (liasun13.epfl.ch [128.178.155.37]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id HAA15069 for ; Tue, 25 Jul 2000 07:44:38 -0500 (CDT) Received: from liasun22.epfl.ch (root [at] liasun22 [dot] epfl.ch [128.178.155.61]) by liasun13.epfl.ch (8.8.X/EPFL-8.1a) with ESMTP id OAA15423; Tue, 25 Jul 2000 14:44:04 +0200 (MET DST) Received: from lia.di.epfl.ch (haroud@localhost [127.0.0.1]) by liasun22.epfl.ch (8.8.X/EPFL-8.1a) with ESMTP id OAA22017; Tue, 25 Jul 2000 14:44:06 +0200 (MET DST) Message-ID: <397D8B96.5F40C595 [at] lia [dot] di.epfl.ch> Date: Tue, 25 Jul 2000 14:44:06 +0200 From: haroud X-Mailer: Mozilla 4.5 [en] (X11; I; SunOS 5.6 sun4u) X-Accept-Language: en MIME-Version: 1.0 To: reliable_computing [at] interval [dot] louisiana.edu CC: haroud [at] lia [dot] di.epfl.ch Subject: Postdoc position (Lausanne, Switzerland) Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk The Swiss Federal Institute of Technology, Lausanne Artificial Intelligence Laboratory (Director: B. Faltings) is seeking to fill a Post-doctoral Research Position for research combining techniques of interval arithmetic, constraint programming and non-linear programming, with application to real-world constraint satisfaction and optimisation problems in numerical domains. Required background: * Ph.D. in Computer Science or Mathematics * Strong academic background in constraint programming and/or non-linear programming and optimisation * Interest to pursue research on combining techniques from different areas (interval methods, non-linear programming, constraint programming and large-scale local optimization) * Knowledge of French not essential Conditions: * Competitive salary * International and dynamic environment * Lausanne, Switzerland is located on the shores of lake Geneva and offers one of the best living environments in Europe * Starting date: as soon as possible * Duration: 12 months (extension possible, max. 36 months) More information about the laboratory is available on the WWW at http://liawww.epfl.ch/ Please submit a detailed CV (with e-mail), statement of interest and list of publications to: Dr. Djamila Sam-Haroud Artificial Intelligence Laboratory LIA(DI), EPFL IN-Ecublens 1015 Lausanne, Switzerland haroud [at] lia [dot] di.epfl.ch who may also be contacted for further information. -- ------------------------------------------------------------------------------- Djamila Sam-Haroud| haroud [at] lia [dot] di.epfl.ch ArtificiaI Intelligence lab. Swiss Federal Institute of Technology(EPFL) DI-Ecublens, 1015 Lausanne Switzerland. Voice: +41 21 693 52 09 Fax: +41 21 693 52 25 ------------------------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] usl.edu Tue Jul 25 08:03:20 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id IAA15371 for reliable_computing-outgoing; Tue, 25 Jul 2000 08:03:20 -0500 (CDT) Received: from buffalo.ens-lyon.fr (buffalo.ens-lyon.fr [140.77.1.8]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id IAA15366 for ; Tue, 25 Jul 2000 08:03:16 -0500 (CDT) Received: from ENS-Lyon.Fr (rye [140.77.13.119]) by buffalo.ens-lyon.fr (8.9.1a/8.9.1) with ESMTP id PAA02072 for ; Tue, 25 Jul 2000 15:03:11 +0200 (MET DST) Message-ID: <397D9015.6E1D6FCA@ENS-Lyon.Fr> Date: Tue, 25 Jul 2000 15:03:17 +0200 From: Marc Daumas Organization: CNRS - LIP - INRIA X-Mailer: Mozilla 4.74 [en] (Windows NT 5.0; U) X-Accept-Language: fr,en MIME-Version: 1.0 To: reliable_computing [at] interval [dot] louisiana.edu Subject: Interval arithmetic vs. running error analysis (Wilkinson) References: <200007230025.e6N0PaT12511 [at] cs [dot] utep.edu> Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk -----BEGIN PGP SIGNED MESSAGE----- Dear Interval readers, I am interested in a reference that would compare the running error analysis method presented by Wilkinson (for example in "Error analysis revisited" - 1986, or in pages 72-73 of Higham's 1996 book) and a straightforward implementation with interval arithmetic. Many thanks. - -- Marc Daumas - Charge de recherches au CNRS (LIP - ENS de Lyon) mailto:Marc.Daumas@ENS-Lyon.Fr - http://www.ens-lyon.fr/~daumas PGP Key FP : A3AF 0AB0 DE64 06EE AF57 7010 497B BD84 4F87 B768 ENS de Lyon - 46, allee d'Italie - 69364 Lyon Cedex 07 - FRANCE Phone: (+33) 4 72 72 83 52 - Fax: (+33) 4 72 72 80 80 -----BEGIN PGP SIGNATURE----- Version: PGPfreeware 6.5.3 for non-commercial use iQBFAwUBOX2B9Nfza7LJVCWlAQHB1QF/VeM0eOqhcVc8+7haK/QG1MjE2SdGra7t GJndR2PVE5wRUhu01bKppyZEZOJ9LnTP =4tU/ -----END PGP SIGNATURE----- From owner-reliable_computing [at] interval [dot] usl.edu Tue Jul 25 14:17:28 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id OAA15941 for reliable_computing-outgoing; Tue, 25 Jul 2000 14:17:28 -0500 (CDT) Received: from awcst094.netaddress.usa.net (awcst094.netaddress.usa.net [204.68.24.94]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with SMTP id OAA15936 for ; Tue, 25 Jul 2000 14:17:15 -0500 (CDT) Received: (qmail 14330 invoked by uid 60001); 25 Jul 2000 19:17:12 -0000 Message-ID: <20000725191712.14329.qmail [at] awcst094 [dot] netaddress.usa.net> Received: from 204.68.24.94 by awcst094 for [131.107.3.87] via web-mailer(34FM1.5A.01A) on Tue Jul 25 19:17:12 GMT 2000 Date: 25 Jul 00 14:17:12 CDT From: ELDAR MUSAYEV To: Kearfott Ralph B , Bill.Walster [at] Eng [dot] Sun.COM, kk [at] gcet [dot] ac.in, reliable_computing [at] interval [dot] usl.edu Subject: Re: [Re: forte-fortran-95] X-Mailer: USANET web-mailer (34FM1.5A.01A) Mime-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 8bit X-MIME-Autoconverted: from quoted-printable to 8bit by interval.usl.edu id OAA15937 Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dmitry Shiraev may know that. If I know correctly, Dima works for Sun, but I don't know his current email. I am also sure that such a compiler will be a major pain to move from processor to processor. Eldar Kearfott Ralph B wrote: > Probably the most appropriate person to answer this question is > someone within Sun, or perhaps you can look at the Sun web page. > > However, based on the traditional marketing strategy of Sun, I > seriously doubt it would be available for MS-Windows. > Nonetheless, Sun has a version of its Solaris operating system > for Intel-based machines, and there's a good chance that the > compiler will be available for that system. There's also a > chance (perhaps not as good a one) that the compiler will be > available for Linux. > > Again, I probably should have looked (or asked) Sun directly > about this. Anyone who has looked this up, or who knows, please > feel free to post the answer to this list. > > Best regards, > > Baker > > From: "Mr. Ketan Kotecha" > To: > Subject: forte-fortran-95 > Date: Fri, 21 Jul 2000 12:06:42 +0530 > > Is Sun's forte-Fortran-95 availble on Windows platform? > What is the price? ____________________________________________________________________ Get free email and a permanent address at http://www.amexmail.com/?A=1 From owner-reliable_computing [at] interval [dot] usl.edu Tue Jul 25 14:27:09 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id OAA16180 for reliable_computing-outgoing; Tue, 25 Jul 2000 14:27:09 -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 OAA16173 for ; Tue, 25 Jul 2000 14:27:04 -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 OAA00118 for ; Tue, 25 Jul 2000 14:27:03 -0500 (CDT) Message-Id: <2.2.32.20000725193219.012a388c [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: Tue, 25 Jul 2000 14:32:19 -0500 To: reliable_computing [at] interval [dot] usl.edu From: "R. Baker Kearfott" Subject: Re: [Re: forte-fortran-95] Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk I got a definitive reply from Sun personnel that the compiler will be available only for Solaris on Sparc. The stated reason was that Solaris on Sparc is the most appropriate platform for high-performance interval computations. Best regards, Baker At 02:17 PM 7/25/00 CDT, ELDAR MUSAYEV wrote: > >Dmitry Shiraev may know that. If I know correctly, Dima works for Sun, >but I don't know his current email. > >I am also sure that such a compiler will be a major pain to move from >processor to processor. > >Eldar > >Kearfott Ralph B wrote: >> Probably the most appropriate person to answer this question is >> someone within Sun, or perhaps you can look at the Sun web page. >> >> However, based on the traditional marketing strategy of Sun, I >> seriously doubt it would be available for MS-Windows. >> Nonetheless, Sun has a version of its Solaris operating system >> for Intel-based machines, and there's a good chance that the >> compiler will be available for that system. There's also a >> chance (perhaps not as good a one) that the compiler will be >> available for Linux. >> >> Again, I probably should have looked (or asked) Sun directly >> about this. Anyone who has looked this up, or who knows, please >> feel free to post the answer to this list. >> >> Best regards, >> >> Baker >> >> From: "Mr. Ketan Kotecha" >> To: >> Subject: forte-fortran-95 >> Date: Fri, 21 Jul 2000 12:06:42 +0530 >> >> Is Sun's forte-Fortran-95 availble on Windows platform? >> What is the price? > > >____________________________________________________________________ >Get free email and a permanent address at http://www.amexmail.com/?A=1 > > --------------------------------------------------------------- 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 Thu Jul 27 09:30:48 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id JAA19264 for reliable_computing-outgoing; Thu, 27 Jul 2000 09:30:48 -0500 (CDT) Received: from lukla.Sun.COM (lukla.Sun.COM [192.18.98.31]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id JAA19259 for ; Thu, 27 Jul 2000 09:30:45 -0500 (CDT) Received: from engmail1.Eng.Sun.COM ([129.146.1.13]) by lukla.Sun.COM (8.9.3+Sun/8.9.3) with ESMTP id IAA17088 for ; Thu, 27 Jul 2000 08:30:38 -0600 (MDT) Received: from ha-sims.eng.sun.com (phys-thestorkb.Eng.Sun.COM [129.146.1.232]) by engmail1.Eng.Sun.COM (8.9.3+Sun/8.9.3/ENSMAIL,v1.7) with ESMTP id HAA28755 for ; Thu, 27 Jul 2000 07:30:37 -0700 (PDT) Received: from gww (gww.Eng.Sun.COM [129.146.78.116]) by ha-sims.eng.sun.com (Sun Internet Mail Server sims.4.0.1999.06.13.00.20) with SMTP id <0FYD00K961N1QE@ha-sims.eng.sun.com> for reliable_computing [at] interval [dot] usl.edu; Thu, 27 Jul 2000 07:30:37 -0700 (PDT) Date: Thu, 27 Jul 2000 07:30:37 -0700 (PDT) From: William Walster Subject: OON: Smallest Eigenvalue Routine? To: reliable_computing [at] interval [dot] usl.edu Reply-to: William Walster Message-id: <0FYD00K971N1QE@ha-sims.eng.sun.com> MIME-version: 1.0 X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4.2 SunOS 5.8 sun4u sparc Content-type: TEXT/plain; charset=us-ascii Content-MD5: 97loXxxa6/f1r6yuARHCgg== Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk ------------- Begin Forwarded Message ------------- Date: Thu, 27 Jul 2000 12:42:32 +0000 From: Volker_Claus.Falk@t-online.de Subject: OON: Smallest Eigenvalue Routine? X-Sender: 320052663093-0002@t-dialin.net To: oon-list [at] oonumerics [dot] org MIME-version: 1.0 Content-transfer-encoding: 7BIT X-Authentication-warning: www.oonumerics.org: majordomo set sender to owner-oon-list [at] oonumerics [dot] org using -f Hi all out there, any good idea where to find an algorithm or routine for getting rather quick the smallest eigenvalue (and only this one) of a _sparse_ matrix (want to decide if it has _negative_ eigenvalues)? As much as I understood ARPACK++ it will only solve the whole eigenvalue problem and this would be useless as I need only the smallest value. Any hints appreciated Thanx Volker C. Falk Volker Claus Falk Ingenieurbuero BAU+FE Reichertsklinge 9 75323 Bad Wildbad Germany voice: +49 - 7081 - 384398 fax: +49 - 7081 - 384396 cellular: +49 - 173 - 3171711 e-mail: volker_claus.falk@t-online.de --------------------- Object Oriented Numerics List -------------------------- * To subscribe/unsubscribe: use the handy web form at http://oonumerics.org/oon/ * If this doesn't work, please send a note to owner-oon-list [at] oonumerics [dot] org ------------- End Forwarded Message ------------- From owner-reliable_computing [at] interval [dot] usl.edu Thu Jul 27 10:40:34 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA19630 for reliable_computing-outgoing; Thu, 27 Jul 2000 10:40:34 -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 KAA19625 for ; Thu, 27 Jul 2000 10:40:22 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.10.1/8.10.1) with SMTP id e6RFdiX02769; Thu, 27 Jul 2000 09:39:44 -0600 (MDT) Message-Id: <200007271539.e6RFdiX02769 [at] cs [dot] utep.edu> Date: Thu, 27 Jul 2000 09:39:42 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: Re: OON: Smallest Eigenvalue Routine? To: reliable_computing [at] interval [dot] usl.edu, bill.walster [at] eng [dot] sun.com MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: GUh5XAO8kHciBt63FEcoIg== 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 Bill, This may be of help: There are many good algorithms for finding the _largest_ eigenvalue and eignevector of a non-negatively definite matrix A, e.g., pick a random initial vector x(0) and then do the following iterations: x(k+1):=Ax(k)/||Ax(k)||, where ||.|| is a Euclidean norm. For almost all starting vectors, this procedure converges to the eignevector corresponding to the largest eigenvalue, and the corresponding norm ||Ax(k)|| converges to the largest eigenvalue. There are other algorithms, but I am mentioning this simple one because it clearly takes advantage of the sparseness of A by cutting the time needed to compute the matrix-vector product Ax. If you know a lower bound C on the negative eignevalues of your matrix M, then the matrix A:=|C|I-M (I the unary matrix) is non-negative definite (positive semidefinite) and its largest eignevalue is exactly |C|-the smallest eigenvalue of your matrix M. So, you can apply one of the known algorithms to compute the largest eigenvalue mu of A and then compute the desired smallest eignevalue of M as |C|-mu. When M is sparse, A is also sparse. I may have misunderstood you and you are looking for a _reliable_ (interval) algorithm, then you have to use some interval algorithm for finding the largest eignevector instead of the one described above. Vladik > Date: Thu, 27 Jul 2000 07:30:37 -0700 (PDT) > From: William Walster > Subject: OON: Smallest Eigenvalue Routine? > To: reliable_computing [at] interval [dot] usl.edu > MIME-version: 1.0 > Content-MD5: 97loXxxa6/f1r6yuARHCgg== > > > ------------- Begin Forwarded Message ------------- > > Date: Thu, 27 Jul 2000 12:42:32 +0000 > From: Volker_Claus.Falk@t-online.de > Subject: OON: Smallest Eigenvalue Routine? > X-Sender: 320052663093-0002@t-dialin.net > To: oon-list [at] oonumerics [dot] org > MIME-version: 1.0 > Content-transfer-encoding: 7BIT > X-Authentication-warning: www.oonumerics.org: majordomo set sender to > owner-oon-list [at] oonumerics [dot] org using -f > > Hi all out there, > > any good idea where to find an algorithm or routine for getting > rather quick the smallest eigenvalue (and only this one) of a > _sparse_ matrix (want to decide if it has _negative_ eigenvalues)? > > As much as I understood ARPACK++ it will only solve the whole > eigenvalue problem and this would be useless as I need only the > smallest value. > > Any hints appreciated > > Thanx > > Volker C. Falk > > > > > Volker Claus Falk > Ingenieurbuero BAU+FE > Reichertsklinge 9 > 75323 Bad Wildbad > > Germany > > voice: +49 - 7081 - 384398 > fax: +49 - 7081 - 384396 > cellular: +49 - 173 - 3171711 > > e-mail: volker_claus.falk@t-online.de > > --------------------- Object Oriented Numerics List -------------------------- > * To subscribe/unsubscribe: use the handy web form at > http://oonumerics.org/oon/ > * If this doesn't work, please send a note to owner-oon-list [at] oonumerics [dot] org > > ------------- End Forwarded Message ------------- > From owner-reliable_computing [at] interval [dot] usl.edu Thu Jul 27 10:53:02 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA19904 for reliable_computing-outgoing; Thu, 27 Jul 2000 10:53:02 -0500 (CDT) Received: from judy.ic.ac.uk (judy.ic.ac.uk [155.198.5.28]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA19898 for ; Thu, 27 Jul 2000 10:52:58 -0500 (CDT) From: h.haitao [at] ic [dot] ac.uk Received: from juliet.ic.ac.uk ([155.198.5.4]) by judy.ic.ac.uk with esmtp (Exim 2.12 #1) id 13Hpxu-0006UA-00 for reliable_computing [at] interval [dot] usl.edu; Thu, 27 Jul 2000 16:52:54 +0100 Received: from sunfs1-gw.ps.ic.ac.uk ([155.198.164.2] helo=sunfs1.ps.ic.ac.uk) by juliet.ic.ac.uk with esmtp (Exim 2.12 #1) id 13Hpxz-0006O2-00 for reliable_computing [at] interval [dot] usl.edu; Thu, 27 Jul 2000 16:53:00 +0100 Received: from sunv44.ps.ic.ac.uk by sunfs1.ps.ic.ac.uk (8.8.8+Sun/4.1) id QAA17571; Thu, 27 Jul 2000 16:52:53 +0100 (BST) Date: Thu, 27 Jul 2000 16:52:52 +0100 (BST) Message-Id: <22789.200007271552 [at] sunv44 [dot] ps.ic.ac.uk> To: reliable_computing [at] interval [dot] usl.edu Subject: Question on bounding dynamic non-linear system using Interval methods Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Content-MD5: ymw7Qecx7uZFNY9Pp9heMA== Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear all, May I get help from you to prove theoretically the bounding on a dynamic system? I am considering safety issue of a chemical reactor with a cooling jacket. In the reactor, there is a exothermic first order reaction (A to B) taking place. This is a dynamic system (the temperature (T) and conversion (X) of A in the reactor is changing with time). The safety concerns are that the T must be less than a maximum temperature (Tmax) during the reaction time horizon and the final conversion X (at the end of time horizon ) should be greater than a minimum conversion (Xmin). The dynamic equations for the system are: dX/dt = k*R*T(1 - X) (1); k = k1*exp(-E/(R*T)) (2); Cp*(dT/dt) = H*NA*dX + Q (3); T(0) = T0 (initial temperature); X(0) = 1 (initial conversion); In these equations, X and T vary with time t while Q is a variable parameter within the interval [Q_inf, Q_sup], where inf and sup represent lower bound and upper bound separately; the other symbols are constant. Apparently, at given time t, the value of X and T depend on T0[T0_inf, T0_sup] and Q[Q_inf, Q_sup]. So the questions are : 1. How can I bound X and T for the domain region T0[T0_inf, T0_sup]*Q[Q_inf, Q_sup] at given time t? 2. When I discretise on time t to do the simulation, there is a stable problem with the delta t. I was asked to prove I have get the stable solution. Does any one know how to prove or any relevant paper (book) on this issue or methods avoiding discretising to do the job? 3. After discretising, I use the following way to bound X and T, X_inf(t+1) = f1(X_inf(t), T_inf(t)) X_sup(t+1) = f1(X_sup(t), T_sup(t)) where f1 means equation (1) T_inf(t+1) = f3(X_sup(t), T_inf(t), Q_inf) T_sup(t+1) = f3(X_inf(t), T_sup(t), Q_sup) where f3 means equation (3) While this bound method is numerally proved, I can not prove it theoretically. Does any one can help me on this or any other good bounding (inclusion) method? Thanks in advance Haitao From owner-reliable_computing [at] interval [dot] usl.edu Thu Jul 27 10:56:05 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA20071 for reliable_computing-outgoing; Thu, 27 Jul 2000 10:56:04 -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 KAA20065 for ; Thu, 27 Jul 2000 10:56:00 -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 KAA19795; Thu, 27 Jul 2000 10:55:26 -0500 (CDT) Message-Id: <2.2.32.20000727155604.0073cdec [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: Thu, 27 Jul 2000 10:56:04 -0500 To: Vladik Kreinovich , reliable_computing [at] interval [dot] usl.edu, bill.walster [at] eng [dot] sun.com From: "R. Baker Kearfott" Subject: Re: OON: Smallest Eigenvalue Routine? Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Vladik and colleagues, That, of course, is just the power method, traditionally taught in a first numerical analysis course. More sophisticated variants include using origin shifts and the "QR" method, which, to my understanding, is used frequently in practice. My understanding is that Lanczos methods are frequently used for LARGE systems. Regarding reliable methods, I think Alefeld et al have said some things in the literature. Basically, the quadratic system AX - \lambda X = 0, along with a normalization condition, is solved using an interval Newton method. There are some opportunities for taking advantage of sparsity there, although my understanding is that, at present, the opportunities are somewhat less than in the point case. Best regards, Baker At 09:39 AM 7/27/00 -0600, Vladik Kreinovich wrote: >Dear Bill, > >This may be of help: > >There are many good algorithms for finding the _largest_ eigenvalue and >eignevector of a non-negatively definite matrix A, e.g., pick a random initial >vector x(0) and then do the following iterations: x(k+1):=Ax(k)/||Ax(k)||, >where ||.|| is a Euclidean norm. For almost all starting vectors, this >procedure converges to the eignevector corresponding to the largest eigenvalue, >and the corresponding norm ||Ax(k)|| converges to the largest eigenvalue. > >There are other algorithms, but I am mentioning this simple one because it >clearly takes advantage of the sparseness of A by cutting the time needed to >compute the matrix-vector product Ax. > >If you know a lower bound C on the negative eignevalues of your matrix M, then >the matrix A:=|C|I-M (I the unary matrix) is non-negative definite (positive >semidefinite) and its largest eignevalue is exactly |C|-the smallest eigenvalue >of your matrix M. So, you can apply one of the known algorithms to compute the >largest eigenvalue mu of A and then compute the desired smallest eignevalue of >M as |C|-mu. > >When M is sparse, A is also sparse. > >I may have misunderstood you and you are looking for a _reliable_ (interval) >algorithm, then you have to use some interval algorithm for finding the largest >eignevector instead of the one described above. > >Vladik > >> Date: Thu, 27 Jul 2000 07:30:37 -0700 (PDT) >> From: William Walster >> Subject: OON: Smallest Eigenvalue Routine? >> To: reliable_computing [at] interval [dot] usl.edu >> MIME-version: 1.0 >> Content-MD5: 97loXxxa6/f1r6yuARHCgg== >> >> >> ------------- Begin Forwarded Message ------------- >> >> Date: Thu, 27 Jul 2000 12:42:32 +0000 >> From: Volker_Claus.Falk@t-online.de >> Subject: OON: Smallest Eigenvalue Routine? >> X-Sender: 320052663093-0002@t-dialin.net >> To: oon-list [at] oonumerics [dot] org >> MIME-version: 1.0 >> Content-transfer-encoding: 7BIT >> X-Authentication-warning: www.oonumerics.org: majordomo set sender to >> owner-oon-list [at] oonumerics [dot] org using -f >> >> Hi all out there, >> >> any good idea where to find an algorithm or routine for getting >> rather quick the smallest eigenvalue (and only this one) of a >> _sparse_ matrix (want to decide if it has _negative_ eigenvalues)? >> >> As much as I understood ARPACK++ it will only solve the whole >> eigenvalue problem and this would be useless as I need only the >> smallest value. >> >> Any hints appreciated >> >> Thanx >> >> Volker C. Falk >> >> >> >> >> Volker Claus Falk >> Ingenieurbuero BAU+FE >> Reichertsklinge 9 >> 75323 Bad Wildbad >> >> Germany >> >> voice: +49 - 7081 - 384398 >> fax: +49 - 7081 - 384396 >> cellular: +49 - 173 - 3171711 >> >> e-mail: volker_claus.falk@t-online.de >> >> --------------------- Object Oriented Numerics List >-------------------------- >> * To subscribe/unsubscribe: use the handy web form at >> http://oonumerics.org/oon/ >> * If this doesn't work, please send a note to owner-oon-list [at] oonumerics [dot] org >> >> ------------- End Forwarded Message ------------- >> > > --------------------------------------------------------------- R. Baker Kearfott, rbk [at] louisiana [dot] edu (337) 482-5346 (fax) (337) 482-5270 (work) (337) 981-9744 (home) URL: http://interval.louisiana.edu/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 Thu Jul 27 10:56:35 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA20101 for reliable_computing-outgoing; Thu, 27 Jul 2000 10:56:34 -0500 (CDT) Received: from homer.mat.univie.ac.at (homer.mat.univie.ac.at [131.130.145.130]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA20091 for ; Thu, 27 Jul 2000 10:56:28 -0500 (CDT) Received: (from neum@localhost) by homer.mat.univie.ac.at (8.9.3/8.9.3) id RAA21614; Thu, 27 Jul 2000 17:56:13 +0200 (MET DST) Date: Thu, 27 Jul 2000 17:56:13 +0200 (MET DST) From: Arnold Neumaier Message-Id: <200007271556.RAA21614 [at] homer [dot] mat.univie.ac.at> To: bill.walster [at] eng [dot] sun.com, reliable_computing [at] interval [dot] usl.edu Subject: Re: OON: Smallest Eigenvalue Routine? Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk >>want to decide if it has _negative_ eigenvalues<< Try spectrum slicing, described in Parlett's book. Arnold Neumaier From owner-reliable_computing [at] interval [dot] usl.edu Thu Jul 27 11:18:59 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id LAA20872 for reliable_computing-outgoing; Thu, 27 Jul 2000 11:18:59 -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 LAA20867 for ; Thu, 27 Jul 2000 11:18:55 -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 LAA20153; Thu, 27 Jul 2000 11:18:26 -0500 (CDT) Message-Id: <2.2.32.20000727161905.00744140 [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: Thu, 27 Jul 2000 11:19:05 -0500 To: Vladik Kreinovich From: "R. Baker Kearfott" Subject: Re: OON: Smallest Eigenvalue Routine? Cc: reliable_computing [at] interval [dot] ull.edu Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Vladik, Thanks. I guess I should have read it more carefully. Best regards, Baker At 10:10 AM 7/27/00 -0600, you wrote: >Dear Baker, > >Thanks for an immediate reply and useful comment. > >I was citing this simple power method as an example, my main point is that >Bill's seemingly-rarely-solved problem of computing the _smallest_ eignevalue >is easily reducible to a more well known and well-researched problem of dinding >the _largest_ eignevalue (provided we know the lower bound; if we do not, then >we can use a lower bound based on the matrix itself. > >For example (and only for example, I know that better lower bounds are >possible), we can take the minimum of all elements of a matrix. > >> X-Sender: rbk5287 [at] pop [dot] usl.edu >> Mime-Version: 1.0 >> Date: Thu, 27 Jul 2000 10:56:04 -0500 >> To: Vladik Kreinovich , >reliable_computing [at] interval [dot] usl.edu, bill.walster [at] eng [dot] sun.com >> From: "R. Baker Kearfott" >> Subject: Re: OON: Smallest Eigenvalue Routine? >> >> Vladik and colleagues, >> >> That, of course, is just the power method, traditionally taught in a >> first numerical analysis course. More sophisticated variants include >> using origin shifts and the "QR" method, which, to my understanding, >> is used frequently in practice. My understanding is that Lanczos >> methods are frequently used for LARGE systems. >> >> Regarding reliable methods, I think Alefeld et al have said some >> things in the literature. Basically, the quadratic system >> AX - \lambda X = 0, along with a normalization condition, is solved >> using an interval Newton method. There are some opportunities for >> taking advantage of sparsity there, although my understanding >> is that, at present, the opportunities are somewhat less than >> in the point case. >> >> Best regards, >> >> Baker >> >> At 09:39 AM 7/27/00 -0600, Vladik Kreinovich wrote: >> >Dear Bill, >> > >> >This may be of help: >> > >> >There are many good algorithms for finding the _largest_ eigenvalue and >> >eignevector of a non-negatively definite matrix A, e.g., pick a random >initial >> >vector x(0) and then do the following iterations: x(k+1):=Ax(k)/||Ax(k)||, >> >where ||.|| is a Euclidean norm. For almost all starting vectors, this >> >procedure converges to the eignevector corresponding to the largest >eigenvalue, >> >and the corresponding norm ||Ax(k)|| converges to the largest eigenvalue. >> > >> >There are other algorithms, but I am mentioning this simple one because it >> >clearly takes advantage of the sparseness of A by cutting the time needed to >> >compute the matrix-vector product Ax. >> > >> >If you know a lower bound C on the negative eignevalues of your matrix M, >then >> >the matrix A:=|C|I-M (I the unary matrix) is non-negative definite (positive >> >semidefinite) and its largest eignevalue is exactly |C|-the smallest >eigenvalue >> >of your matrix M. So, you can apply one of the known algorithms to compute >the >> >largest eigenvalue mu of A and then compute the desired smallest eignevalue >of >> >M as |C|-mu. >> > >> >When M is sparse, A is also sparse. >> > >> >I may have misunderstood you and you are looking for a _reliable_ (interval) >> >algorithm, then you have to use some interval algorithm for finding the >largest >> >eignevector instead of the one described above. >> > >> >Vladik >> > >> >> Date: Thu, 27 Jul 2000 07:30:37 -0700 (PDT) >> >> From: William Walster >> >> Subject: OON: Smallest Eigenvalue Routine? >> >> To: reliable_computing [at] interval [dot] usl.edu >> >> MIME-version: 1.0 >> >> Content-MD5: 97loXxxa6/f1r6yuARHCgg== >> >> >> >> >> >> ------------- Begin Forwarded Message ------------- >> >> >> >> Date: Thu, 27 Jul 2000 12:42:32 +0000 >> >> From: Volker_Claus.Falk@t-online.de >> >> Subject: OON: Smallest Eigenvalue Routine? >> >> X-Sender: 320052663093-0002@t-dialin.net >> >> To: oon-list [at] oonumerics [dot] org >> >> MIME-version: 1.0 >> >> Content-transfer-encoding: 7BIT >> >> X-Authentication-warning: www.oonumerics.org: majordomo set sender to >> >> owner-oon-list [at] oonumerics [dot] org using -f >> >> >> >> Hi all out there, >> >> >> >> any good idea where to find an algorithm or routine for getting >> >> rather quick the smallest eigenvalue (and only this one) of a >> >> _sparse_ matrix (want to decide if it has _negative_ eigenvalues)? >> >> >> >> As much as I understood ARPACK++ it will only solve the whole >> >> eigenvalue problem and this would be useless as I need only the >> >> smallest value. >> >> >> >> Any hints appreciated >> >> >> >> Thanx >> >> >> >> Volker C. Falk >> >> >> >> >> >> >> >> >> >> Volker Claus Falk >> >> Ingenieurbuero BAU+FE >> >> Reichertsklinge 9 >> >> 75323 Bad Wildbad >> >> >> >> Germany >> >> >> >> voice: +49 - 7081 - 384398 >> >> fax: +49 - 7081 - 384396 >> >> cellular: +49 - 173 - 3171711 >> >> >> >> e-mail: volker_claus.falk@t-online.de >> >> >> >> --------------------- Object Oriented Numerics List >> >-------------------------- >> >> * To subscribe/unsubscribe: use the handy web form at >> >> http://oonumerics.org/oon/ >> >> * If this doesn't work, please send a note to >owner-oon-list [at] oonumerics [dot] org >> >> >> >> ------------- End Forwarded Message ------------- >> >> >> > >> > >> --------------------------------------------------------------- >> R. Baker Kearfott, rbk [at] louisiana [dot] edu (337) 482-5346 (fax) >> (337) 482-5270 (work) (337) 981-9744 (home) >> URL: http://interval.louisiana.edu/kearfott.html >> Department of Mathematics, University of Louisiana at Lafayette >> Box 4-1010, Lafayette, LA 70504-1010, USA >> --------------------------------------------------------------- > > --------------------------------------------------------------- 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 Thu Jul 27 11:36:57 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id LAA21171 for reliable_computing-outgoing; Thu, 27 Jul 2000 11:36:56 -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 LAA21166 for ; Thu, 27 Jul 2000 11:36:35 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.10.1/8.10.1) with SMTP id e6RGaOG03022; Thu, 27 Jul 2000 10:36:24 -0600 (MDT) Message-Id: <200007271636.e6RGaOG03022 [at] cs [dot] utep.edu> Date: Thu, 27 Jul 2000 10:36:22 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: Re: Question on bounding dynamic non-linear system using Interval methods To: reliable_computing [at] interval [dot] usl.edu Cc: h.haitao [at] ic [dot] ac.uk MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: pe5E6MmVpUQi5TEnfw/RrA== 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 Haitao, I am forwarding your correction to the mailing list. Vladik ------------- Begin Forwarded Message ------------- From: h.haitao [at] ic [dot] ac.uk Date: Thu, 27 Jul 2000 17:29:37 +0100 (BST) To: vladik [at] cs [dot] utep.edu Subject: Re: Question on bounding dynamic non-linear system using Interval methods Mime-Version: 1.0 Content-Transfer-Encoding: 7bit Content-MD5: 3d4EV0VBE8d8kvHPqNfs5g== > From vladik [at] cs [dot] utep.edu Thu Jul 27 17:12 BST 2000 > Date: Thu, 27 Jul 2000 10:12:17 -0600 (MDT) > From: Vladik Kreinovich > Subject: Re: Question on bounding dynamic non-linear system using Interval methods > To: h.haitao [at] ic [dot] ac.uk > MIME-Version: 1.0 > Content-MD5: Ir3PqjFYtFShxgHpHP+Xhw== > > There must be a typo in your equation (3): > > Cp*(dT/dt) = H*NA*dX + Q (3); > > what is dX? A new constant? > Sorry, I have not made it correct. The dX should be (\dot X in latex) dX/dt. I am waiting for your help. Thanks haitao ------------- End Forwarded Message ------------- From owner-reliable_computing [at] interval [dot] usl.edu Fri Jul 28 11:37:21 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id LAA23237 for reliable_computing-outgoing; Fri, 28 Jul 2000 11:37:20 -0500 (CDT) Received: from cse.psu.edu (root [at] claven [dot] cse.psu.edu [130.203.3.50]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id LAA23232 for ; Fri, 28 Jul 2000 11:37:14 -0500 (CDT) Received: from sweetpea.cse.psu.edu (barlow [at] sweetpea [dot] cse.psu.edu [130.203.8.8]) by cse.psu.edu (8.8.8/8.8.8) with ESMTP id MAA19420 for ; Fri, 28 Jul 2000 12:36:54 -0400 (EDT) Received: (from barlow@localhost) by sweetpea.cse.psu.edu (8.9.3+Sun/8.9.1) id MAA11106; Fri, 28 Jul 2000 12:36:52 -0400 (EDT) Date: Fri, 28 Jul 2000 12:36:52 -0400 (EDT) Message-Id: <200007281636.MAA11106 [at] sweetpea [dot] cse.psu.edu> X-Authentication-Warning: sweetpea.cse.psu.edu: barlow set sender to barlow [at] sweetpea [dot] cse.psu.edu using -f From: Jesse Barlow To: reliable_computing [at] interval [dot] louisiana.edu Subject: LAA Special Issue on Accurate Solution of Eigenvalue Problems Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear Reader, I would like to submit this to your newsletter. Jesse Barlow. _____________________________________________________________________________ Jesse L. Barlow, Professor Phone:+1-814-863-1705 Department of Computer Science and Engineering FAX: +1-814-865-3176 312 Pond Laboratory E-mail:barlow [at] cse [dot] psu.edu The Pennsylvania State University URL:http://www.cse.psu.edu/~barlow University Park, PA 16802-6106 USA ------------------------------------------------------------------------------- Special Issue of Linear Algebra and Its Applications ACCURATE SOLUTION OF EIGENVALUE PROBLEMS II In the last several years, there have been a number of advances in the accurate solution of eigenvalue problems. Many of the results have come from the realization that eigenvalue algorithms that exploit the structure of the problem can lead to more accurate eigenvalue and eigenvector computations. Well known examples include faster and more accurate methods for solving the symmetric tridiagonal eigenproblem, more accurate methods for computing the singular value decompostion, and further understanding of the conditioning theory for the non--symmetric eigenvalue problem. To recognize these advances and to encourage further advances, we are proposing to have a special issue of Linear Algebra and Its Applications on Accurate Solution of Eigenvalue Problems. This is the second such special issue. The first was volume 309 of Linear Algebra and Its Applications, published in early 2000. This special issue is in coordination with the International Workshop on Accurate Solution of Eigenvalue Problems III held in Hagen, Germany on July 3-6,2000. The participants in the workshop have been strongly encouraged to submit papers to the special issue. Submissions are alsowelcome from non-participants as long as they are consistent with the themes of the workshop. The editors for this special issue will be Jesse L. Barlow Department of Computer Science and Engineering The Pennsylvania State University University Park, PA 16802--6106 USA Beresford N. Parlett Department of Mathematics University of California at Berkeley Berkeley, CA 94720 USA Kresimir Veselic' Fernuniversitaet Hagen Lehrgebeit Math. Physik Postfach 940 58084 Hagen, Germany Please submit three (3) copies of your manuscript to the editor of your choice. However, if another editor is deemed more qualified to handle your manuscript, it may be forwarded to that editor. Manuscripts submitted to this special issue will be refereed according to standard procedures for Linear Algebra and Its Applications. All papers for this special issue should be postmarked by February 1, 2001. From owner-reliable_computing [at] interval [dot] usl.edu Fri Jul 28 19:33:41 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id TAA23890 for reliable_computing-outgoing; Fri, 28 Jul 2000 19:33:41 -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 TAA23885 for ; Fri, 28 Jul 2000 19:33:37 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.10.1/8.10.1) with SMTP id e6T0XWR09481 for ; Fri, 28 Jul 2000 18:33:32 -0600 (MDT) Message-Id: <200007290033.e6T0XWR09481 [at] cs [dot] utep.edu> Date: Fri, 28 Jul 2000 18:33:31 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: possible faculty position in El Paso To: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: GtWLFu2QI2CvxyxhyRVDaA== 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 Friends, This is FYI: It is highly probable that our Department of Computer Science will get an extra tenure-track faculty position starting from the year 2001/02, and interval computations is one of the targeted areas in which the Department would like to hire. If you are interested or if you have graduating students or post-docs who may be interested please contact me. This is not official yet, the official approval will (hopefully) come in the middle to late Fall, then the official ad will be sent out. Yours Vladik From owner-reliable_computing [at] interval [dot] usl.edu Sun Jul 30 07:34:14 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id HAA27179 for reliable_computing-outgoing; Sun, 30 Jul 2000 07:34:14 -0500 (CDT) Received: from maebashi-it.ac.jp (zhong01.maebashi-it.ac.jp [202.236.152.193] (may be forged)) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id HAA27174 for ; Sun, 30 Jul 2000 07:34:09 -0500 (CDT) Received: (from zhong@localhost) by maebashi-it.ac.jp (8.9.1/8.9.1) id VAA09301 for reliable_computing [at] interval [dot] usl.edu; Sun, 30 Jul 2000 21:43:00 +0900 (JST) (envelope-from zhong) Date: Sun, 30 Jul 2000 21:43:00 +0900 (JST) From: Ning Zhong Message-Id: <200007301243.VAA09301@maebashi-it.ac.jp> To: reliable_computing [at] interval [dot] usl.edu Subject: IEEE Data Mining 2001: Call for Papers Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk [Apologies if you receive this more than once] ---------------------------------------------------------------------- ICDM '01: The 2001 IEEE International Conference on Data Mining Sponsored by the IEEE Computer Society ---------------------------------------------------------------------- Silicon Valley, California, USA November 29 - December 2, 2001 Home Page: http://kais.mines.edu/~xwu/icdm/icdm-01.html Call for Papers *************** The 2001 IEEE International Conference on Data Mining (ICDM '01) provides a forum for the sharing of original research results and practical development experiences among researchers and application developers from different data mining related areas such as machine learning, automated scientific discovery, statistics, pattern recognition, knowledge acquisition, soft computing, databases and data warehousing, data visualization, and knowledge-based systems. The conference seeks solutions to challenging problems facing the development of data mining systems, and shapes future directions of research by promoting high quality, novel and daring research findings. As an important part of the conference, the workshops program will focus on new research challenges and initiatives. Topics of Interest ================== Topics related to the design, analysis and implementation of data mining theory, systems and applications are of interest. These include, but are not limited to the following areas: - Foundations and principles of data mining - Data mining algorithms and methods in traditional areas (such as classification, clustering, probabilistic modeling, and association analysis), and in new areas - Data and knowledge representation for data mining - Modeling of structured, textual, temporal, spatial, multimedia and Web data to support data mining - Complexity, efficiency, and scalability issues in data mining - Data pre-processing, data reduction, feature selection and feature transformation - Statistics and probability in large-scale data mining - Soft computing (including neural networks, fuzzy logic, evolutionary computation, and rough sets) and uncertainty management for data mining - Integration of data warehousing, OLAP and data mining - Man-machine interaction in data mining and visual data mining - Artificial intelligence contributions to data mining - High performance and distributed data mining - Machine learning, pattern recognition and automated scientific discovery - Quality assessment and interestingness metrics of data mining results - Process centric data mining and models of data mining process - Security and social impact of data mining - Emerging data mining applications, such as electronic commerce, Web mining and intelligent learning database systems Conference Publications and ICDM Best Paper Awards ================================================== High quality papers in all data mining areas are solicited. Papers exploring new directions will receive a careful and supportive review. All submitted papers should be limited to a maximum of 6,000 words (approximately 20 A4 pages), and will be reviewed on the basis of technical quality, relevance to data mining, originality, significance, and clarity. Accepted papers will be published in the conference proceedings by the IEEE Computer Society Press. A selected number of ICDM '01 accepted papers will be expanded and revised for possible inclusion in the Knowledge and Information Systems journal (http://kais.mines.edu/~kais/) by Springer-Verlag. ICDM Best Paper Awards will be conferred on the authors of the best papers at the conference. Important Dates =============== June 15, 2001 Paper submissions. July 31, 2001 Acceptance notices. August 31, 2001 Final camera-readies. Nov 29 - Dec 2, 2001 Conference. Detailed instructions for paper submissions will be provided on the conference home page at http://kais.mines.edu/~xwu/icdm/icdm-01.html. Conference Chair: ================= Xindong Wu, Colorado School of Mines, USA (xindong [at] computer [dot] org) Program Committee Chairs: ========================= Nick Cercone, University of Waterloo, Canada (ncercone [at] math [dot] uwaterloo.ca) T.Y. Lin, San Jose State University, USA (tylin [at] mathcs [dot] sjsu.edu) ICDM '01 Workshops Chair: ========================= Johannes Gehrke, Cornell University, USA (johannes [at] cs [dot] cornell.edu) ICDM '01 Tutorials Chair: ========================= Chris Clifton, MITRE, USA (clifton [at] mitre [dot] org) ICDM '01 Panels Chair: ====================== Ramamohanarao Kotagiri, University of Melbourne, Australia (rao [at] cs [dot] mu.oz.au) ICDM '01 Publicity Chair: ========================= Ning Zhong, Maebashi Institute of Technology, Japan (zhong@maebashi-it.ac.jp) ICDM '01 Local Arrangements Chair: ================================== Xiaohua (Tony) Hu, Blue Martini Software Inc., USA (tonyhu [at] bluemartini [dot] com) ICDM Steering Committee ======================= Max Bramer, University of Portsmouth, UK Nick Cercone, University of Waterloo, Canada Ramamohanarao Kotagiri, University of Melbourne, Australia Katharina Morik, University of Dortmund, Germany Xindong Wu, Chair (Colorado School of Mines, USA) Philip S. Yu, IBM T.J. Watson Research Center, USA Ning Zhong, Maebashi Institute of Technology, Japan Jan M. Zytkow, University of North Carolina, Charlotte, USA Further Information =================== Dr. Xindong Wu Dept. of Mathematical and Computer Sciences, Colorado School of Mines, 1500 Illinois Street, Golden, Colorado 80401, USA. Telephone: +1-303-273-3874 Facsimile: +1-303-273-3875 E-mail: xindong [at] computer [dot] org