From owner-reliable_computing [at] interval [dot] usl.edu Wed Aug 2 20:20:30 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id UAA03319 for reliable_computing-outgoing; Wed, 2 Aug 2000 20:20:30 -0500 (CDT) Received: from cse.unl.edu (root [at] cse [dot] unl.edu [129.93.33.1]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id UAA03314 for ; Wed, 2 Aug 2000 20:20:25 -0500 (CDT) Received: from localhost (fayad@localhost) by cse.unl.edu (8.9.1/8.9.1) with ESMTP id UAA1665342; Wed, 2 Aug 2000 20:11:43 -0500 (CDT) Date: Wed, 2 Aug 2000 20:11:43 -0500 From: Mohamed Fayad To: Undisclosed recipients: ; Subject: 3-vol. Book - Extended Deadline Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Greetings, Based on many requests, the deadline for submissions has been extended to October 1, 2000. Apologies if you recieve multitple copies of this cfcs. Enclosed, please find a call for chapters and reviewers. Please post. Thank you. Cheers, M. Fayad ---------------------------------------------------------- *** Chapters submission: extended deadline *** *** >>>>> October 1, 2000 <<<<< *** ---------------------------------------------------------- 3-volume book on Software Architectures, Components, and Frameworks Call for Chapters and Reviewers Authors and Editors: Dr. Mohamed Fayad: fayad [at] cse [dot] unl.edu, m.fayad [at] computer [dot] org, fayadm [at] acm [dot] org, URL: http://www.cse.unl.edu/~fayad Dr. David Garlan: garlan [at] cs [dot] cmu.edu URL: http://www.cs.cmu.edu/~garlan Professor Wolfgang Pree: pree [at] acm [dot] org URL: www.informatik.uni-konstanz.de/swe We are developing three-volume series of books on software architectures, components, and frameworks. If this is your area of interest/research, I would like to invite you to submit a chapter. This series of books will serve as a complete reference set for academics and practitioners. Volume 1: Software Architectures The working title of the first-volume is "Software Architectures." Architecture-based software engineering research has yielded an impressive array of technologies and demonstrations over the past decade. Using an architecture-based approach, applications have been built which: - Are understandable - Are expected to evolve - Exhibit remarkable flexibility - Demonstrate significant reuse of off-the-shelf components - Leverage experience from related applications in the same problem domain - Are analyzable earlier in their development than ever before - Are key milestones in software managerial and development processes Currently, there is relatively little guidance for software developers on how to develop software architectures. This volume addresses several topics crucial to the state of the art and practice of software architecture. The book presents a complete reference on how to develop a good software architecture and provides guidelines for resolving key software architecture issues, such as evolving software architectures, leveraging existing investment in software architecture artifacts, representing architecture description languages, introducing formal models for software architectures, addressing architectural analysis techniques & development methods, transitioning from software architecture to coding and surveying architectural design tools and environments. In addition, the book will include sections on: accessing of software architectures, testing and validating software architectures, improving software architecture quality, documenting software architectures, and many more. This is a pragmatic book that is specifically designed to help organizations develop software architectures for real projects in the real world. Comprehensive technical and management guidelines are thoroughly discussed, ranging from specifying software architecture elements and their behaviors, to the impact of software architecture on the job. Likewise, technical issues (such as documenting and utilizing software architectures) are discussed in detail. Volume 2: Product-Line Architectures The working title of the second-volume is "Product-Line Architectures". Software product lines are emerging as a new and important software development paradigm. A Product-Line Architecture (PLA) is a design for a family of related applications, and its motivation is to simplify the design and maintenance of program families and to address the needs of highly customizable applications in an economical manner. Companies are realizing that the practice of building sets of related systems from common assets can yield remarkable improvements in productivity, time to market, product quality and customer satisfaction. But these gains are only a part of the picture; organizational, technical and management issues are other factors that should be considered. Although there are encouraging research experiences with PLAs and some guidelines exist to help in the development process, some issues about component-based development in PLAs are still under study. The goal of this book is to examine the foundational concepts underlying product lines and address the essential activities developers should consider to apply a PLA to a number of lines of products. The book will include sections on: lessons learned in PLA-based development, architectural specification, tools and process for software development, core asset management, domain analysis, configuration management, evaluation methods, quality factors involved, implementation strategies, and many more. Volume 3: Component-Based Software Developments & Enterprise Frameworks The working title of the third-volume is "Component-Based Software Development and Enterprise Frameworks". Nowadays, software engineering is moving forward on an architecture-based development conception where systems are built by composing or assembling components that are often developed independently. The key to making a large variety of software products and reducing time to market is to build pieces of software where the development effort can serve in other products as well. Thus, large-grained components are becoming a practical part of an enterprise component strategy. Such generic components usually include interactions with other components, code, design models, design patterns and specifications. In addition, they must provide ways to be adaptable and customizable according with the client's needs. In this context, enterprise frameworks offer an appropriate base for waving the software architectures, components, and core requirements into one container that is adaptable, customizable, extensible, and reusable. The technology of component-based systems is quite well established, but it is not the same with the methods to develop them. The need of well-defined techniques, notations and architectural support is still pending. The book will cover all these issues. This book is intended to provide valuable, real world insight into successful development and/or adaptation of OO Enterprise Frameworks, by describing the problems with frameworks, explaining the issues related to the development and adaptation of enterprise frameworks, selecting the right methods and tools for building frameworks. The book will be derived from actual experiences, successes and failures, and is presented in a practical, easy to understand manner. This is information that readers can apply today. The key issues are: + What are the key enterprise-oriented framework issues? + How to develop enterprise frameworks and what are the framework design guidelines? + What kind of evolution does an Enterprise Framework undergo and how is it correlated with the enterprise life span? + How can the adaptation of OO enterprise framework be accomplished with minimum impact on the cost and schedule? + Understand make vs. buy decisions, selection guidelines, and how to select and adapt the right enterprise framework for the job. + Understand the implication of enterprise business requirements on the framework design. + How to use your large-scale enterprise framework and how to protect your investment. + How to deal with resource requirements, enterprise framework integration problems, framework reporting, and others. + What are the impacts of enterprise frameworks on the national and global economy? This volume helps organizations apply component-based technology effectively by citing examples from the real world. This book combines the actual experiences and lessons learned from developing and/or adapting component-based enterprise framework developments. Reviewers: Please e-mail your contact information and your area of interests to the lead author and editor. Authors: Please submit one electronic copy in RTF interchange or Microsoft Word document formats by October 1, 2000 or sooner to the lead author and editor: Dr. Mohamed E. Fayad J.D. Edwards Professor Computer Science & Engineering Dept., University of Nebraska, Lincoln 108 Ferguson Hall, P.O. Box 880115, Lincoln, NE 68588-0115 Ph: (402) 472-2615, Fax: (402) 472-7767 E-mail: fayad [at] cse [dot] unl.edu, m.fayad [at] computer [dot] org, fayadm [at] acm [dot] org URL: http://www.cse.unl.edu/~fayad Submissions: Submissions should be presented in a practical, easy to understand manner, providing information that readers can apply today. We seek original articles on specific practical and research issues related to software architectures, product-line architectures, component-based software developments and enterprise application frameworks. Chapters may be of any length, ranging from a few pages (2-3 pages or 1,200 words - sidebars) to a full treatment of substantial software architectures, components, or frameworks (ranging from 10 pages to say 40 pages or 25,000 words - Chapters), including illustrations. Submissions are peer-reviewed and are subject to editing for style, clarity, and space. We also encourage authors to submit supplement materials, such as documentation and portions of the detailed implementation of their frameworks or complete documentation or portions of the software architecture or product-line architecture. All submissions should identify a principal contact author by e-mail address and/or fax and/or telephone number and postal address. Please keep in mind that each volume will be the only complete work on this topic. We received excellent responses from most of the authors that we contacted for this project. We promise a high-quality and an extremely useful publication for the computer and software industries. Your chapter should have appendixes of annotated references, notation, process, and definitions. Each chapter will include the biographies of the authors. We will also ask you to perform a final review for two or three chapters, collect opinions from you related to the organization of each volume and keep you up-to-date about the progress of this project. If a chapter is accepted, the authors will be asked to provide the following sections: 1. Review questions, 2. Problem sets, and/or 3. Projects, and 4. Key solutions. We would like to finish the work related to this project in twelve to fifteen months. Currently, we have over 10 chapters for the first volume,10 papers for the second volume, and 5 papers for the third volume. All papers are under review. Questions regarding the suitability of a topic should be sent to: fayad [at] cse [dot] un1.edu, garlan [at] cs [dot] cmu.edu, or pree [at] acm [dot] org If you are considering submitting a chapter, I would like to receive the following information immediately for starting the review process for your chapter: 1. The title of your chapter 2. The list of authors and their contact information 3. The abstract 4. The point of contact For further information about this series of books, please contact me at , , or For detailed author guidelines, check the following web site: www.cse.unl.edu/~fayad Book Projects From owner-reliable_computing [at] interval [dot] usl.edu Thu Aug 3 06:27:30 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id GAA04818 for reliable_computing-outgoing; Thu, 3 Aug 2000 06:27:30 -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 GAA04813 for ; Thu, 3 Aug 2000 06:27:25 -0500 (CDT) Received: (from neum@localhost) by homer.mat.univie.ac.at (8.9.3/8.9.3) id NAA26067 for reliable_computing [at] interval [dot] louisiana.edu; Thu, 3 Aug 2000 13:27:22 +0200 (MET DST) Date: Thu, 3 Aug 2000 13:27:22 +0200 (MET DST) From: Arnold Neumaier Message-Id: <200008031127.NAA26067 [at] homer [dot] mat.univie.ac.at> To: reliable_computing [at] interval [dot] louisiana.edu Subject: Position at the University of Vienna (Austria) Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Position at the University of Vienna (Austria) ---------------------------------------------- Development of modular global optimization techniques and software in a branch and bound framework The Institute for Mathematics of the University of Vienna invites applications for a post-doctoral research position in optimization. The contract is for at most three years, probably beginning Fall 2000 (dependent on the starting date of a European project to be funded by the European Union). Vienna, the capital of Austria, is one of the great scientific, politic, and cultural centers of the world. The Computational Mathematics group (URL: http://solon.cma.univie.ac.at) is currently primarily involved in the development of high quality software for global optimization and in interdisciplinary applications of optimization (e.g., to protein folding and to parameter estimation in stochastic models). The successful applicant will participate in the development of modular techniques and software for global optimization in a branch and bound framework, with emphasis on the combination of techniques from - large-scale local optimization - combinatorial optimization - constrained (logic) programming - interval analysis Candidates must have a Ph. D. in Mathematics, Operations Research, or Computer Science. Especially welcome are applicants who have - excellent practical knowledge of numerical methods for optimization and linear algebra, - excellent programming skills in C and C++, and - previous experience with branch and bound methods. Interested researchers should contact Prof. Arnold Neumaier (neum [at] cma [dot] univie.ac.at), preferably before September 15, 2000. From owner-reliable_computing [at] interval [dot] usl.edu Fri Aug 4 16:55:02 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id QAA02289 for reliable_computing-outgoing; Fri, 4 Aug 2000 16:55:02 -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 QAA02284 for ; Fri, 4 Aug 2000 16:54:59 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.10.1/8.10.1) with SMTP id e74LssN28515 for ; Fri, 4 Aug 2000 15:54:54 -0600 (MDT) Message-Id: <200008042154.e74LssN28515 [at] cs [dot] utep.edu> Date: Fri, 4 Aug 2000 15:54:53 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: from NA Digest To: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: KFBWv0gGcGXBVTiVy0UyyQ== 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 I apologize for multiple messages. From: Paul Barton Date: Thu, 27 Jul 2000 10:34:25 +0200 Subject: Postdoctoral Position at MIT POSTDOCTORAL RESEARCH ASSOCIATE POSITION AT MIT Candidates are sought for the position of Postdoctoral Research Associate at the Department of Chemical Engineering at MIT. The position will involve the development of novel algorithms and software for sensitivity and interval analysis of differential-algebraic equations (DAEs). The task will involve close collaboration with other researchers participating in the DAEPACK project a MIT (http://yoric.mit.edu/daepack/daepack.html), and with colleagues in industry and at national laboratories. Candidates should have a Ph.D. in computational science or engineering, or closely related science or engineering discipline. Please send a curriculum vitae plus a list of a least three referees to: Paul I. Barton Associate Professor Department of Chemical Engineering Massachusetts Institute of Technology, 66-464 77 Massachusetts Avenue Cambridge MA 01239 U.S.A. From owner-reliable_computing [at] interval [dot] usl.edu Mon Aug 7 10:04:11 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA07509 for reliable_computing-outgoing; Mon, 7 Aug 2000 10:04:11 -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 KAA07504 for ; Mon, 7 Aug 2000 10:04:01 -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 13LoRb-0006Zb-00 for reliable_computing [at] interval [dot] louisiana.edu; Mon, 7 Aug 2000 16:03:59 +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 13LoRa-0006zD-00 for reliable_computing [at] interval [dot] louisiana.edu; Mon, 7 Aug 2000 16:03:58 +0100 Received: from sunv44.ps.ic.ac.uk by sunfs1.ps.ic.ac.uk (8.8.8+Sun/4.1) id QAA09919; Mon, 7 Aug 2000 16:03:50 +0100 (BST) Date: Mon, 7 Aug 2000 16:03:49 +0100 (BST) Message-Id: <1293.200008071503 [at] sunv44 [dot] ps.ic.ac.uk> To: reliable_computing [at] interval [dot] louisiana.edu Subject: Bounding on dynamic system Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Content-MD5: dg/7cc4QoLene84lPXeoSg== Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear all, I am considering a dynamic process system, which is described by a set of ordinary differential equations (ODE) or differential algebraic equations (DAE). Traditionally, we consider a point system at t1, then we can use integration method to get the corresponding point at t2. Now, if we consider a continuous space (a lot of point systems) at time t1, we want to find the corresponding space at time t2. The way I am doing is to find models to bounding the space at time t2. However, I must ensure the space at time t2 is still continuous, then I can do some other evaluations on the space. My problem is how to prove the space at t2 is still continuous or what assumptions on the underlying ODE (or DAE) need to be made to ensure the space at t2 still continuous. It may be a silly question for a mathematician, but it is difficult and important for me. Could anyone please help me or give a clue on how to prove this. haitao From owner-reliable_computing [at] interval [dot] usl.edu Fri Aug 11 06:19:36 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id GAA14612 for reliable_computing-outgoing; Fri, 11 Aug 2000 06:19:36 -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 GAA14607 for ; Fri, 11 Aug 2000 06:19:31 -0500 (CDT) Received: from jane.cs.toronto.edu ([128.100.2.31]) by yonge.cs.toronto.edu with SMTP id <33976-6694>; Fri, 11 Aug 2000 07:19:20 -0400 Received: from qew.cs.toronto.edu by jane.cs.toronto.edu id <453134-13040>; Fri, 11 Aug 2000 07:19:11 -0400 From: Ken Jackson To: reliable_computing [at] interval [dot] usl.edu Subject: Announcement: 2001-02 NA Year at the Fields Institute in Toronto Cc: krj [at] cs [dot] toronto.edu Message-Id: <00Aug11.071911edt.453134-13040 [at] jane [dot] cs.toronto.edu> Date: Fri, 11 Aug 2000 07:19:08 -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 Mon Aug 14 16:27:54 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id QAA20340 for reliable_computing-outgoing; Mon, 14 Aug 2000 16:27:54 -0500 (CDT) Received: from mcs.anl.gov (cliff.mcs.anl.gov [140.221.9.17]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id QAA20335 for ; Mon, 14 Aug 2000 16:27:50 -0500 (CDT) Received: from cliff.mcs.anl.gov (merlin.mcs.anl.gov [140.221.11.61]) by mcs.anl.gov (8.9.3/8.9.3) with ESMTP id QAA302018; Mon, 14 Aug 2000 16:27:43 -0500 Message-Id: <200008142127.QAA302018 [at] mcs [dot] anl.gov> To: reliable_computing [at] interval [dot] usl.edu cc: dolan [at] mcs [dot] anl.gov, more [at] mcs [dot] anl.gov Subject: Expansion of the NEOS Server for Optimization Date: Mon, 14 Aug 2000 16:27:43 -0500 From: "Jorge More'" Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk The NEOS Server continues to expand and improve as we add new services and facilities. We are currently processing about 3,000 jobs/month. Among the recent developments: GAMS solvers Semidefinite programming solvers JAVA Submission Tool The NEOS Server 3.0 package. *** GAMS *** Through the help of GAMS Development Corporation, we now have extensive support for solving optimization problems with GAMS (General Algebraic Modeling System). The NEOS Server currently hosts the following solvers, which accept input in the GAMS modeling language. CONOPT (ARKI Consulting and Development) MINOS (Murtagh and Saunders) SNOPT (Gill, Murray, and Saunders) BDMLP (Brooke, Drud, and Meeraus) MILES (Rutherford) and PATH (Dirkse, Ferris, and Munson) *** Semidefinite Programming *** Hans Mittelmann has added an extensive list of semidefinite programming solvers in sparse SDPA format: CSDP (Brian Borchers) SDPA (Katsuki Fujisawa, Masakazu Kojima, and Kazuhide Nakata) SDPT3 (Kim Toh, Mike Todd, and Reha Tutuncu) SeDuMi (Jos Sturm) These solvers run on machines at the Arizona State University. *** JAVA Submission Tool for Windows users *** We now have Java-based Submission Tool which connects to the NEOS Server through TCP/IP sockets. This tool provides Windows and Unix users with rapid access to the Server and allows submission forms to be saved for repeated use. http://www-neos.mcs.anl.gov/neos/server-submit.html *** NEOS Server 3.0 package *** You can now download the software behind the Server! While the NEOS Server does not provide downloads of any solver software, the NEOS Server 3.0 package provides a ready-made Application = Service Provider. Your own applications can be brought on-line through NEOS without the pain of creating from scratch such necessities as user interfaces, submission parsing and scheduling software, or the communications handling necessary to run jobs on remote systems. http://www-neos.mcs.anl.gov/neos/server-downloads.html *** To learn more about recent developments in the NEOS Server, visit http://www-neos.mcs.anl.gov/ Liz Dolan and Jorge More' for the NEOS Group. The NEOS Server is a project of the Optimization Technology Center, jointly managed by Argonne National Laboratory and Northwestern University. From owner-reliable_computing [at] interval [dot] usl.edu Fri Aug 18 12:34:06 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id MAA27750 for reliable_computing-outgoing; Fri, 18 Aug 2000 12:34:06 -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 MAA27745 for ; Fri, 18 Aug 2000 12:33:37 -0500 (CDT) Received: from slava.UUCP (uucp@localhost) by into.nit.spb.ru (8.8.7/8.8.7) with UUCP id VAA25096 for reliable_computing [at] interval [dot] usl.edu; Fri, 18 Aug 2000 21:35:25 +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); Fri, 18 Aug 2000 21:21:30 +0400 To: reliable_computing [at] interval [dot] usl.edu Message-Id: Organization: Slava Nesterov Date: Fri, 18 Aug 2000 21:21:30 +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, Volume 7, issue 1 Lines: 63 Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Reliable Computing Volume 7, Issue 1, 2001 Mathematical Research Path Planning Using Intervals and Graphs Luc Jaulin 1-15 Automatic Computation of a Linear Interval Enclosure Lubomir V. Kolev 17-28 On Kernel Inclusions Hans-Juergen Dobner 29-39 Roundoff-Free Number Fields for Interval Computations Vladik Kreinovich 41-47 Short Communications A Note on a Uniqueness Theorem for the Second-Derivative Test of Qi Michael A. Wolfe 49-52 On $\wedge$-Subdistributivity and $\vee$-Superdistributivity with Respect to Interval Map in Kaucher Arithmetic Gregory G. Menshikov, Alexey V. Tomashevsky 53-57 The Feasibility of the Interval Gaussian Algorithm for Arrowhead Matrices Uwe Schaefer 59-62 Reminiscences "Back in the Good Old Days" The Mystery of Intervals Svetoslav Markov 63-65 Information Interval Methods and Their Applications: invited sessions at the World Automation Congress (WAC'2000) 67-68 Session ``Interval and Computer-Algebraic Methods in Science and Engineering'' at the 6th International Association for Mathematics and Computers in Simulation (IMACS) Conference on Applications of Computer Algebra (ACA'2000) 69-70 A special session on Granular Computing and Interval Computations at the 19th International Conference of the North American Fuzzy Information Processing Society (NAFIPS) 71-72 Minisymposium on Applications of Interval Computations at the Third World Congress of Nonlinear Analysts 73-74  From owner-reliable_computing [at] interval [dot] usl.edu Sun Aug 20 15:41:30 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id PAA02220 for reliable_computing-outgoing; Sun, 20 Aug 2000 15:41:29 -0500 (CDT) Received: from kleene.math.wisc.edu (kleene.math.wisc.edu [144.92.166.90]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id PAA02215 for ; Sun, 20 Aug 2000 15:41:25 -0500 (CDT) Received: from forelli.math.wisc.edu (forelli.math.wisc.edu [144.92.166.70]) by kleene.math.wisc.edu (8.9.3/8.9.3) with SMTP id PAA08648; Sun, 20 Aug 2000 15:32:56 -0500 (CDT) Date: Sun, 20 Aug 2000 15:34:11 -0500 (CDT) From: Hans Schneider To: NETS -- at-net , "Hershkowitz, Danny -- Hershkowitz Daniel" , Danny Hershkowitz , E-LETTER , "na.digest" , ipnet-digest [at] math [dot] msu.edu, wim@bell-labs.com, hjt [at] eos [dot] ncsu.edu, vkm [at] eedsp [dot] gatech.edu, reliable_computing [at] interval [dot] louisiana.edu Subject: LAA Contents Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear Net Organizer: Please circulate the attached LAA contents over your net. Thanks hans ------------------------------------------------------------------------------ Hans Schneider hans [at] math [dot] wisc.edu. Department of Mathematics 608-262-1402 (Work) Van Vleck Hall 608-271-7252 (Home) 480 Lincoln Drive 608-263-8891 (Work FAX) University of Wisconsin-Madison 608-271-8477 (Home FAX) Madison WI 53706 USA http://www.math.wisc.edu/~hans (URL) ------------------------------------------------------------------------------ NOTE: ContentsDirect, which is automatically generated, lists the first author of each paper and the corresponding author (if different). Visit the journal at http://www.elsevier.nl/locate/jnlnr/07738 Please note that subscribers can access full text and abstracts through the provided URL: ContentsDirect from Elsevier Science ===================================== Journal: Linear Algebra and its Applications ISSN : 0024-3795 Volume : 314 Issue : 1-3 Date : 15-Jul-2000 pp 1-47 On Lie gradings III. Gradings of the real forms of classical Lie algebras M. Havlicek, J. Patera, E. Pelantova http://www.elsevier.nl/PII/S0024379500000999 pp 49-74 On triality and automorphisms and derivations of composition algebras A. Elduque http://www.elsevier.nl/PII/S0024379500001051 pp 75-89 Construction of the Jordan decomposition by means of Newton's method D. Schmidt http://www.elsevier.nl/PII/S0024379500001117 pp 91-136 Interpolation theory in sectorial Stieltjes classes and explicit system solutions D. Alpay, E. Tsekanovskii http://www.elsevier.nl/PII/S0024379500001130 pp 137-164 Hankel matrices, positive functions and related questions Y.V. Genin http://www.elsevier.nl/PII/S002437950000121X pp 165-189 The eigenvalue problem for networks of beams B. Dekoninck, S. Nicaise http://www.elsevier.nl/PII/S002437950000118X pp 191-203 On the nonuniqueness of the factorization factors in the product singular value decomposition D. Chu, B. De Moor http://www.elsevier.nl/PII/S0024379500001361 pp 205 Index ------- ContentsDirect from Elsevier Science ===================================== Journal: Linear Algebra and its Applications ISSN : 0024-3795 Volume : 315 Issue : 1-3 Date : 15-Aug-2000 pp 1-23 Sums of diagonalizable matrices J.D. Botha http://www.elsevier.nl/PII/S0024379599002803 pp 25-38 Convexity properties of Tr[(a^*a)^n] L.E. Mata-Lorenzo, L. Recht http://www.elsevier.nl/PII/S0024379500000501 pp 39-59 Identification of almost invariant aggregates in reversible nearly uncoupled Markov chains P. Deuflhard, W. Huisinga, A. Fischer, C. Schutte http://www.elsevier.nl/PII/S0024379500000951 pp 61-81 Some general techniques on linear preserver problems A. Guterman, C.-K. Li, P. Semrl http://www.elsevier.nl/PII/S0024379500001191 pp 83-112 On the curvature of monotone metrics and a conjecture concerning the Kubo-Mori metric J. Dittmann http://www.elsevier.nl/PII/S0024379500001300 pp 113-123 Explicit factorization of the Vandermonde matrix H. Oruc, G.M. Phillips http://www.elsevier.nl/PII/S0024379500001245 pp 125-138 The invariant polynomials degrees of the Kronecker sum of two linear operators and additive theory C. Caldeira, J.A. Dias da Silva http://www.elsevier.nl/PII/S0024379500001257 pp 139-144 The determinant of random power series matrices over finite fields K.A.S. Abdel-Ghaffar http://www.elsevier.nl/PII/S0024379500001348 pp 145-154 Numerical ranges and matrix completions D.W. Hadwin, K.J. Harrison, J.A. Ward http://www.elsevier.nl/PII/S002437950000135X pp 155-173 Maximal orthogonality and pseudo-orthogonality with applications to generalized inverses M.Q. Rieck http://www.elsevier.nl/PII/S0024379500001427 pp 175-188 Characterization of joint spectral radius via trace Q. Chen, X. Zhou http://www.elsevier.nl/PII/S002437950000149X pp 189-196 The Ostrowski-Reich theorem for SOR iterations: extensions to the rank deficient case J.-Y. Yuan http://www.elsevier.nl/PII/S0024379500001488 pp 197-205 Two-dimensional Q-algebras T. Nakazi http://www.elsevier.nl/PII/S0024379500001518 pp 209 Index ------- From owner-reliable_computing [at] interval [dot] usl.edu Tue Aug 22 12:56:37 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id MAA06568 for reliable_computing-outgoing; Tue, 22 Aug 2000 12:56:37 -0500 (CDT) Received: from mailhost.uni-koblenz.de (mailhost.uni-koblenz.de [141.26.64.1]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id MAA06563 for ; Tue, 22 Aug 2000 12:56:30 -0500 (CDT) Received: from nostromo.uni-koblenz.de (root [at] nostromo [dot] uni-koblenz.de [141.26.66.122]) by mailhost.uni-koblenz.de (8.9.3/8.9.3) with ESMTP id TAA07690; Tue, 22 Aug 2000 19:55:56 +0200 (MET DST) Received: (from peter@localhost) by nostromo.uni-koblenz.de (8.9.3/8.9.1) id TAA27592; Tue, 22 Aug 2000 19:55:52 +0200 MIME-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: 8bit Message-ID: <14754.48808.89342.325193 [at] nostromo [dot] uni-koblenz.de> Date: Tue, 22 Aug 2000 19:55:52 +0200 (CEST) From: IJCAR Publicity Chair Reply-to: IJCAR Publicity Chair Subject: CFP: IJCAR 2001 - International Joint Conference on Automated Reasoning X-Mailer: VM 6.75 under 21.1 (patch 12) "Channel Islands" XEmacs Lucid Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk +------------------------------------------------------------------+ | | | IJCAR 2001 | | | | The International Joint Conference on Automated Reasoning | | | | June 18-23, 2001, Siena, Italy | | | | http://www.dii.uni-si.it/~ijcar/ | | | | CALL FOR PAPERS / TUTORIALS / WORKSHOPS | | | +------------------------------------------------------------------+ CALL FOR PAPERS =============== The International Joint Conference on Automated Reasoning (IJCAR) is the fusion of three major conferences in Automated Reasoning: CADE (The International Conference on Automated Deduction), TABLEAUX (The International Conference on Automated Reasoning with Analytic Tableaux and Related Methods) and FTP (The International Workshop on First-Order Theorem Proving). These three events will join for the first time at the IJCAR conference in Siena in June 2001. IJCAR 2001 invites submissions related to all aspects of automated reasoning, including foundations, implementations, and applications. Original research papers and descriptions of working automated deduction systems are solicited. Topics ------ LOGICS of interest include propositional, first-order, classical, equational, higher-order, non-classical, constructive, modal, temporal, many-valued, substructural, description, and meta-logics, type theory and set theory. TECHNIQUES of interest include model-elimination, tableaux, sequent calculi, resolution, connection method, inverse method, term rewriting, induction, unification, constraint solving, decision procedures, model generation, model checking, semantic guidance, interactive theorem proving, logical frameworks, and AI-related methods for deductive systems such as proof planning and proof presentation. APPLICATIONS of interest include hardware and software development, systems analysis and verification, functional and logic programming, proof carrying code, deductive databases, knowledge representation, computer mathematics, natural language processing, linguistics, planning and other AI areas. Submissions - Research papers and system descriptions ----------------------------------------------------- Submitted research papers and system descriptions must be original and not submitted for publication elsewhere. Research papers can be up to 15 proceedings pages long, and system descriptions can be up to 5 pages long. The proceedings of IJCAR 2001 will be published by Springer-Verlag in the LNAI series. All submissions must be received by January 14, 2001. Submissions that are late or too long or require substantial revision will not be considered. Authors of accepted papers will be requested to sign a form transfering copyright of their contribution to Springer-Verlag. IN THE RESEARCH PAPER CATEGORY, SUBMISSIONS OF THEORETICAL, PRACTICAL AND EXPERIMENTAL NATURE ARE EQUALLY ENCOURAGED. Submissions - Short papers -------------------------- Short papers are intended for quick dissemination of work in progress or results not substantial enough for a full research paper. Their length is limited to 10 pages. Submissions under this category will not be formally refereed, but their content and relevance will be reviewed. Those submissions accepted will be published in a technical report, which will be available at the conference. Authors of accepted papers are expected to present a brief outline of their work at the conference and to prepare a poster for display at the conference venue. The submission deadline is April 2, 2001. Submission details - All categories ----------------------------------- Authors are strongly encouraged to use LATEX2e and the Springer llncs class files. The primary means of submission is electronic. More submission details can be found at the IJCAR 2001 web site. Best Student Paper Award ------------------------ A prize of 500 Euros will be given to the best paper, as judged by the program committee, written solely by one or more students. A submission is eligible if all authors are full-time students at the time of submission. This should be indicated in the submission letter. The program committee may decline to make the award or may split it among several papers. Organization ------------ Conference Chair: Fabio Massacci University of Siena Dipartimento di Ingegneria dell'Informazione via Roma 56 53100 Siena, Italy Phone: +39 0577 234607 FAX: +39 0577 233602 Email: ijcar-cch [at] dii [dot] unisi.it Workshop Chair: D. Hutter (Saarbr"ucken) ijcar-workshop [at] dii [dot] unisi.it Tutorial Chair: T. Walsh (York) ijcar-tutorial [at] dii [dot] unisi.it Program Co-Chairs: Rajeev Gor'e (ARP-ANU, Australia) Alexander Leitsch (TU-Wien, Austria) Tobias Nipkow (TU-M"unchen, Germany) collective Email address: ijcar-pch [at] dii [dot] unisi.it Publicity Chair: P. Baumgartner (Koblenz) Treasurer: E. Giunchiglia (Genova) Invited speakers ---------------- N. Jones (DIKU, DK) L. Paulson (Cambridge, UK) H. Schwichtenberg (M"unchen, D) A. Voronkov (Manchester, UK) D. Zeilberger (Temple Univ., USA) Program committee ----------------- R. Alur (Philadelphia) F. Baader (Aachen) M. Baaz (Wien) B. Beckert (Karlsruhe) R. Caferra (Grenoble) R. Dyckhoff (St. Andrews) U. Furbach (Koblenz) D. Galmiche (Nancy) H. Ganzinger (MPI Saarbr"ucken) J. Goubault-Larrecq (INRIA Rocq.) R. H"ahnle (Chalmers) J. Harrison (Intel, Hillsboro) D. Kapur (New Mexico) H. Kautz (ATT, Florham Park) M. Kohlhase (Saarbr"ucken) Z. Manna (Stanford) P. Patel-Schneider (Bell Labs) F. Pfenning (Pittsburgh) A. Podelski (MPI Saarbr"ucken) W. Reif (Augsburg) G. Salzer (Wien) M. Vardi (Houston) Important dates --------------- (all dates in 2001) January 14 Submission deadline - Research papers and system descriptions March 19 Notification of acceptance - Research papers and system descriptions April 2 Submission deadline - Short papers April 12 Camera-ready copy due - Research papers and system descriptions April 30 Notification of acceptance - Short papers May 14 Camera-ready copy due - Short papers June 18 - June 23 IJCAR 2001 CALL FOR TUTORIALS ================== Scope ----- It is planned to hold a number of tutorials within the technical programme of the confer ence. We invite proposals for these tutorials (as well as suggestions for topics that might be covered). The topics of the tutorials can cover any area related to automated reasoning and any related cross-disciplinary areas that might be of interest (constraints, formal methods, ...). At present, the tutorials are scheduled to take place on Monday 18th and Tuesday 19th June. How to Propose a Tutorial ------------------------- Proposals should be in English and between one and two pages in length. They should contain: * The title of the tutorial. * The names, and affiliations of the person or persons who will present the tutorial. * A brief technical description of the topics covered by the tutorial. * Contact details (email, web page, phone, fax, etc). * A list of tutorials previously given in this or related areas. Proposals should be submitted electronically (in ASCII, Ghostscript compatible Postscript or LaTeX) at the follwing address: Toby Walsh, IJCAR Tutorial Chair Artificial Intelligence Group Department of Computer Science University of York York YO10 5DD, U.K. Email: ijcar-tutorial [at] dii [dot] unisi.it Tel: +44 1904 432745 Fax: +44 1904 432767 Important dates --------------- Tutorial proposal deadline: January 15, 2001 Notification of acceptance: January 29, 2001 Tutorials: June 18+19, 2001 CALL FOR WORKSHOPS ================== Scope ----- Researchers and practitioners are invited to submit proposals for workshops on IJCAR related topics as mentioned in the "Call for Papers". Proposals that promise to bring new topics into IJCAR, of either practical or theoretical importance, or provide a forum for more detailed discussion on central topics of continuing importance are also welcomed. Workshops that close the gap between automated reasoning and related areas, like for instance formal methods or software engineering, are especially encouraged. Recent workshops of participating conferences have included, for instance, automated model building, automation of proofs by induction, empirical studies in logic algorithms, mechanization of partial functions, proof search in type-theoretic languages, strategies in automated deduction, automated theorem proving in software engineering and in mathematics, and integration of symbolic computation and deduction. Submission Details ------------------ Anyone wishing to organize a workshop in conjunction with IJCAR should send in postscript format (e-mail preferred) a proposal no longer than two pages to the workshop chair (ijcar-workshop [at] dii [dot] unisi.it) by January 1, 2001. Proposals should consist of two parts. First, a short scientific justification of the proposed topic, its significance and the particular benefits of the workshop. A second part should include the proposed format and agenda, the procedures for selecting papers and participants, and contact information for the organizers. In particular it should also include estimated dates for paper submissions, acceptance of notification (before May 1, 2001) and camera ready copy. Proposals will be evaluated, and decisions will be communicated by January 15, 2001. Further information about the arrangements for workshops can be obtained from the IJCAR 2001 Web site. Important dates --------------- Workshop proposal deadline: January 1, 2001 Notification of acceptance: January 15, 2001 Workshops: June 18+19, 2001 Workshop chair -------------- Dieter Hutter (Saarbr"ucken, D) ijcar-workshop [at] dii [dot] unisi.it Sponsors -------- Università degli Studi di Siena, the University of Siena AI*IA, l'Associazione Italiana per l'Intelligenza Artificiale CADE Inc., The Conference on Automated Deduction. EATCS, The European Association for Theoretical Computer Sciences. ECCAI, The European Coordinating Committee on Artificial Intelligence. ERCIM, The European Research Consortium for Informatics and Mathematics. IJCAI Inc., The International Joint Conferences on Artificial Intelligence. MPS, Monte dei Paschi di Siena -- Peter Baumgartner phone: +49 261 287 2777 mail: peter@uni-koblenz.de fax: +49 261 287 2731 WWW: http://www.uni-koblenz.de/~peter/ From owner-reliable_computing [at] interval [dot] usl.edu Wed Aug 23 12:09:24 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id MAA09162 for reliable_computing-outgoing; Wed, 23 Aug 2000 12:09:23 -0500 (CDT) Received: from kleene.math.wisc.edu (kleene.math.wisc.edu [144.92.166.90]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id MAA09157 for ; Wed, 23 Aug 2000 12:09:17 -0500 (CDT) Received: from forelli.math.wisc.edu (forelli.math.wisc.edu [144.92.166.70]) by kleene.math.wisc.edu (8.9.3/8.9.3) with SMTP id MAA19077; Wed, 23 Aug 2000 12:00:48 -0500 (CDT) Date: Wed, 23 Aug 2000 12:02:15 -0500 (CDT) From: Hans Schneider To: NETS -- at-net , "Hershkowitz, Danny -- Hershkowitz Daniel" , Danny Hershkowitz , E-LETTER , "na.digest" , ipnet-digest [at] math [dot] msu.edu, wim@bell-labs.com, hjt [at] eos [dot] ncsu.edu, vkm [at] eedsp [dot] gatech.edu, reliable_computing [at] interval [dot] louisiana.edu Subject: LAA contents Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear Net Organizer: Please circulate the attached LAA contents over your net. Thanks hans ------------------------------------------------------------------------------ Hans Schneider hans [at] math [dot] wisc.edu. Department of Mathematics 608-262-1402 (Work) Van Vleck Hall 608-271-7252 (Home) 480 Lincoln Drive 608-263-8891 (Work FAX) University of Wisconsin-Madison 608-271-8477 (Home FAX) Madison WI 53706 USA http://www.math.wisc.edu/~hans (URL) ------------------------------------------------------------------------------ ContentsDirect from Elsevier Science ===================================== Journal: Linear Algebra and its Applications ISSN : 0024-3795 Volume : 316 Issue : 1-3 Date : 01-Sep-2000 Please note that subscribers can access full text and abstracts through the provided URLs. Visit the journal at http://www.elsevier.nl/locate/jnlnr/07738 NOTE: ContentsDirect, which is automatically generated, lists the first author of each paper and the corresponding author (if different). pp 1-12 Dedication to Robert J. Plemmons http://www.elsevier.nl/PII/S0024379500001804 pp 13-20 Lower bounds for the eigenvalues of Laplacian matrices A. Berman, X.-D. Zhang http://www.elsevier.nl/PII/S0024379599002645 pp 21-28 Markov chain sensitivity measured by mean first passage times G.E. Cho, C.D. Meyer http://www.elsevier.nl/PII/S0024379599002633 pp 29-43 Structuredmatrixrepresentationsoftwo-parameter Hankel transforms in adaptive optics V.P. Pauca, B.L. Ellerbroek, R.J. Plemmons, X. Sun http://www.elsevier.nl/PII/S0024379599002670 pp 45-65 Regular Markov chains for which the transition matrix has large exponent S.J. Kirkland, M. Neumann http://www.elsevier.nl/PII/S0024379599002657 pp 67-87 Comparison theorems for the convergence factor of iterative methods for singular matrices I. Marek, D.B. Szyld http://www.elsevier.nl/PII/S002437959900275X pp 89-104 Cosine transform preconditioners for high resolution image reconstruction M.K. Ng, R.H. Chan, T.F. Chan, A.M. Yip http://www.elsevier.nl/PII/S0024379599002748 pp 105-112 Domain decomposition splittings R.E. White http://www.elsevier.nl/PII/S0024379500000161 pp 113-135 A mathematical framework for the linear reconstructor problem in adaptive optics M. Chu, V. Pauca, R. Plemmons, X. Sun http://www.elsevier.nl/PII/S0024379500000197 pp 137-156 Solving total least-squares problems in information retrieval E. Jiang, M. Berry http://www.elsevier.nl/PII/S0024379500000306 pp 157-169 GMRES-type methods for inconsistent systems D. Calvetti, B. Lewis, L. Reichel http://www.elsevier.nl/PII/S0024379500000641 pp 171-182 A fast eigenvalue algorithm for Hankel matrices F.T. Luk, S. Qiao http://www.elsevier.nl/PII/S0024379500000847 pp 183-197 Unifying unitary and hyperbolic transformations A. Bojanczyk, S. Qiao, A.O. Steinhardt http://www.elsevier.nl/PII/S0024379500001087 pp 199-222 On the existence and computation of rank-revealing LU factorizations C.-T. Pan http://www.elsevier.nl/PII/S0024379500001208 pp 223-236 Quasi-Newton approach to nonnegative image restorations M. Hanke, J.G. Nagy, C. Vogel http://www.elsevier.nl/PII/S0024379500001166 pp 237-258 A new approach to constrained total least squares image restoration M.K. Ng, R.J. Plemmons, F. Pimentel http://www.elsevier.nl/PII/S0024379500001154 pp 259-285 Convergence of the alternating minimization algorithm for blind deconvolution T. Chan, C.K. Wong http://www.elsevier.nl/PII/S0024379500001415 pp 287 Index ------- From owner-reliable_computing [at] interval [dot] usl.edu Sun Aug 27 06:42:43 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id GAA17061 for reliable_computing-outgoing; Sun, 27 Aug 2000 06:42:42 -0500 (CDT) Received: from unknown ([206.215.214.219]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with SMTP id GAA17046; Sun, 27 Aug 2000 06:42:29 -0500 (CDT) From: bench1 [at] lakmail [dot] com Subject: your imaging supplies Date: Wed, 27 Aug 1997 03:59:23 Message-Id: <810.280387.633716@> Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk BENCHMARK SUPPLY 5334 LAKE VIEW CLUB ATLANTA GA 30338 ***LASER PRINTER TONER CARTRIDGES*** ***FAX AND COPIER TONER*** WE ACCEPT GOVERNMENT, SCHOOL & UNIVERSITY PURCHASE ORDERS JUST LEAVE YOUR PO # WITH CORRECT BILLING & SHIPPING ADDRESS CHECK OUT OUR NEW CARTRIDGE PRICES FOR USE IN THE FOLLOWING PRINTERS: APPLE LASER WRITER PRO 600 OR 16/600 $69 LASER WRITER SELECT 300,310.360 $69 LASER WRITER 300, 320 $54 LASER WRITER LS,NT,2NTX,2F,2G & 2SC $54 LASER WRITER 12/640 $79 HEWLETT PACKARD LASERJET SERIES 2,3 & 3D (95A) $49 LASERJET SERIES 2P AND 3P (75A) $54 LASERJET SERIES 3SI AND 4SI (91A) $75 LASERJET SERIES 4L AND 4P $49 LASERJET SERIES 4, 4M, 5, 5M, 4+ (98A) $59 LASERJET SERIES 4000 HIGH YIELD (27X) $89 LASERJET SERIES 4V $95 LASERJET SERIES 5SI , 8000 $95 LASERJET SERIES 5L AND 6L $49 LASERJET SERIES 5P, 5MP, 6P, 6MP $59 LASERJET SERIES 5000 (29A) $135 LASERJET SERIES 1100 (92A) $49 LASERJET SERIES 2100 (96A) $79 LASERJET SERIES 8100 (82X) $145 HP LASERFAX LASERFAX 500, 700, FX1, $59 LASERFAX 5000, 7000, FX2, $59 LASERFAX FX3 $69 LASERFAX FX4 $79 LEXMARK OPTRA 4019, 4029 HIGH YIELD $135 OPTRA R, 4039, 4049 HIGH YIELD $135 OPTRA S 4059 HIGH YIELD $135 OPTRA E $59 OPTRA N $115 EPSON EPL-7000, 8000 $105 EPL-1000, 1500 $105 CANON LBP-430 $49 LBP-460, 465 $59 LBP-8 II $54 LBP-LX $54 LBP-MX $95 LBP-AX $49 LBP-EX $59 LBP-SX $49 LBP-BX $95 LBP-PX $49 LBP-WX $95 LBP-VX $59 CANON FAX L700 THRU L790 FX1 $59 CANONFAX L5000 L70000 FX2 $59 CANON COPIERS PC 20, 25 ETC.... $89 PC 3, 6RE, 7, 11 (A30) $69 PC 320 THRU 780 (E40) $89 NEC SERIES 2 LASER MODEL 90,95 $105 PLEASE NOTE: 2) WE DO NOT SEND OUT CATALOGS OR PRICE LISTS 3) WE DO NOT FAX QUOTES OR PRICE LISTS. 5) WE DO NOT CARRY: BROTHER-MINOLTA-KYOSERA-PANASONIC PRODUCTS 6) WE DO NOT CARRY: XEROX-FUJITSU-OKIDATA OR SHARP PRODUCTS 7) WE DO NOT CARRY ANY COLOR PRINTER SUPPLIES 8) WE DO NOT CARRY DESKJET/INKJET OR BUBBLEJET SUPPLIES ****OUR ORDER LINE IS 770-399-0953 **** ****OUR CUSTOMER SERVICE LINE IS 770-512-7444**** ****OUR E-MAIL REMOVAL AND COMPLAINT LINE IS 888-494-8597**** ****PLACE YOUR ORDER AS FOLLOWS**** : BY PHONE 770-399-0953 BY FAX: 770-698-9700 BY MAIL: BENCHMARK SUPPLY 5334 LAKE VIEW CLUB ATLANTA GA 30338 MAKE SURE YOU INCLUDE THE FOLLOWING INFORMATION IN YOUR ORDER: 1) YOUR PHONE NUMBER 2) COMPANY NAME 3) SHIPPING ADDRESS 4) YOUR NAME 5) ITEMS NEEDED WITH QUANTITIES 6) METHOD OF PAYMENT. (COD OR CREDIT CARD) 7) CREDIT CARD NUMBER WITH EXPIRATION DATE 1) WE SHIP UPS GROUND. ADD $4.5 FOR SHIPPING AND HANDLING. 2) COD CHECK ORDERS ADD $3.5 TO YOUR SHIPPING COST. 2) WE ACCEPT ALL MAJOR CREDIT CARD OR "COD" ORDERS. 3) OUR STANDARD MERCHANDISE REPLCAMENT POLICY IS NET 90 DAYS. NOTE NUMBER (1): PLEASE DO NOT CALL OUR ORDER LINE TO REMOVE YOUR E-MAIL ADDRESS OR COMPLAIN. OUR ORDER LINE IS NOT SETUP TO FORWARD YOUR E-MAIL ADDRESS REMOVAL REQUESTS OR PROCESS YOUR COMPLAINTS..IT WOULD BE A WASTED PHONE CALL.YOUR ADDRESS WOULD NOT BE REMOVED AND YOUR COMPLAINTS WOULD NOT BE HANDLED.PLEASE CALL OUR TOLL FREE E-MAIL REMOVAL AND COMPLAINT LINE TO DO THAT. NOTE NUMBER (2): OUR E-MAIL RETURN ADDRESS IS NOT SETUP TO ANSWER ANY QUESTIONS YOU MIGHT HAVE REGARDING OUR PRODUCTS. OUR E-MAIL RETURN ADDRESS IS ALSO NOT SETUP TO TAKE ANY ORDERS AT THIS TIME. PLEASE CALL THE ORDER LINE TO PLACE YOUR ORDER OR HAVE ANY QUESTIONS ANSWERED. OTHERWISE PLEASE CALL OUR CUSTOMER SERCICE LINE. From owner-reliable_computing [at] interval [dot] usl.edu Mon Aug 28 08:49:33 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id IAA19231 for reliable_computing-outgoing; Mon, 28 Aug 2000 08:49:33 -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 IAA19226 for ; Mon, 28 Aug 2000 08:49:29 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.10.1/8.10.1) with SMTP id e7SDnKu16573 for ; Mon, 28 Aug 2000 07:49:20 -0600 (MDT) Message-Id: <200008281349.e7SDnKu16573 [at] cs [dot] utep.edu> Date: Mon, 28 Aug 2000 07:49:18 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: ISIPTA '01: Preliminary Call for Papers To: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: xCdcuWgDCF07pEPkkQ4YUw== 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: Mon, 28 Aug 2000 15:12:44 +0200 From: Gert de Cooman X-Accept-Language: en Subject: ISIPTA '01: Preliminary Call for Papers ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ ISIPTA '01 THE SECOND INTERNATIONAL SYMPOSIUM ON IMPRECISE PROBABILITIES AND THEIR APPLICATIONS Cornell University Ithaca, NY, USA 26 - 29 June 2001 PRELIMINARY CALL FOR PAPERS ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Encouraged by the success of the First International Symposium on Imprecise Probabilities and Their Applications (ISIPTA '99, Ghent, Belgium, 30 June - 2 July 1999, see the web site http://ippserv.rug.ac.be/~isipta99 for more detailed information; see http://decsai.ugr.es/~smc/isipta99/proc/proceedings.html for an electronic version of the proceedings), we have decided to create a biennial series of ISIPTA conferences on imprecise probabilities, each to take place at a different location. The Second International Symposium on Imprecise Probabilities and Their Applications (ISIPTA '01), will be held at Cornell University, Ithaca, NY, USA, from 26 till 29 June 2001. Steering Committee ------------------ Gert de Cooman (Universiteit Gent, Belgium) Fabio G. Cozman (Universidade de Sao Paulo, Brazil) Terrence Fine (Cornell University, USA) Serafin Moral (Universidad de Granada, Spain) Program Committee ----------------- Board: Gert de Cooman (Belgium) Terrence Fine (USA) Teddy Seidenfeld (USA) Russell Almond (USA) Charles F. Manski (USA) Paul Anand (UK) Massimo Marinacci (Italy) Thomas Augustin (Germany) Serafin Moral (Spain) Salem Benferhat (France) Sujoy Mukerji (UK) Jean-Marc Bernard (France) Klaus Nehring (USA) David Budescu (USA) Robert Nau (USA) Fabio G. Cozman (Brazil) Endre Pap (Yugoslavia) Dieter Denneberg (Germany) Jeff Paris (UK) James M. Dickey (USA) David Pennock (USA) Didier Dubois (France) Henri Prade (France) Itzhak Gilboa (Israel) Giuliana Regoli (Italy) Angelo Gilio (Italy) Romano Scozzafava (Italy) Fernando Gomide (Brazil) Glenn Shafer (USA) Michel Grabisch (France) Philippe Smets (Belgium) Pierre Hanssen (Canada) Michael Smithson (Australia) David Harmanec (Czech Republic) Wynn Stirling (USA) Jean-Yves Jaffray (France) Milan Studeny (Czech Republic) Hugo Janssen (Belgium) Lev Utkin (Russia) Etienne Kerre (Belgium) Jirina Vejnarova (Czech Republic) George Klir (USA) Paolo Vicig (Italy) Henry Kyburg (USA) Frans Voorbraak (The Netherlands) Isaac Levi (USA) Kurt Weichselberger (Germany) Thomas Lukasiewicz (Austria) Nic Wilson (UK) Mark Machina (USA) Marco Zaffalon (Switzerland) More information about the organising committee will appear soon on the symposium web site. What is imprecise probability? ------------------------------ Imprecise probability is a generic term for the many mathematical models which measure chance or uncertainty without sharp numerical probabilities. These models include belief functions, Choquet capacities, comparative probability orderings, convex sets of probability measures, fuzzy measures, interval-valued probabilities, possibility measures, plausibility measures, and upper and lower expectations or previsions. Such models are needed in inference problems where the relevant information is scarce, vague or conflicting, and in decision problems where preferences may also be incomplete. See the IPP web site for introductory articles about imprecise probabilities, an extensive bibliography, and a collection of survey articles on special types of imprecise probability models. Symposium language ------------------ The working language of the symposium will be English. No simultaneous translation in other languages will be available. How to submit a paper --------------------- Papers are encouraged on all aspects of imprecise probability and its applications. Those wishing to present a paper at the symposium should submit a short paper of 4-10 pages electronically, by 15 January 2001. LaTeX and Word style files will be made available on the symposium web site (http://ippserv.rug.ac.be/~isipta01) well before the submission deadline. The Program Committee will decide which of these papers are accepted. The successful authors will then be invited to submit a final version of their paper, for publication in a volume of symposium proceedings (which will be available for the symposium). Each accepted paper will be given the opportunity for both a brief oral presentation as well as a poster session. All the papers that are accepted for the symposium will also be made available on our web site (http://ippserv.rug.ac.be/~isipta01) well before the conference. This will allow the participants to study the papers in some detail before they are actually presented. Symposium web site ------------------ All information relating to the symposium will be published on the symposium web site: http://ippserv.rug.ac.be/~isipta01 Important dates (still tentative) --------------- Paper submission deadline: 15 January 2001 Notification of acceptance: 9 March 2001 Deadline for revised papers: 30 March 2001 Symposium: 30 June - 2 July 1999 Questions --------- If you have any questions about the symposium, please contact the Organising Committee, at the following address: Terrence Fine Director Center for Applied Mathematics Rhodes Hall 612 Cornell University Ithaca NY 14853 USA Tel: +1-607-255-4336/3643 E-mail: tlfine [at] cam [dot] cornell.edu ------------- End Forwarded Message ------------- From owner-reliable_computing [at] interval [dot] usl.edu Mon Aug 28 11:24:01 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id LAA19628 for reliable_computing-outgoing; Mon, 28 Aug 2000 11:24:01 -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 LAA19623 for ; Mon, 28 Aug 2000 11:23:58 -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 LAA05761 for ; Mon, 28 Aug 2000 11:23:56 -0500 (CDT) Message-Id: <2.2.32.20000828163045.012c19c8 [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: Mon, 28 Aug 2000 11:30:45 -0500 To: reliable_computing [at] interval [dot] louisiana.edu From: "R. Baker Kearfott" Subject: Inner estimation? Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Colleagues, Can you post anything you know about literature regarding inner estimation of arithmetic expressions? In particular, if {\ivl x} is a usual interval, and E(x) is an algebraic expression in the real variable x, how might we use arithmetic to obtain a set I such that I \subseteq {y | y\in the range of E over {\ivl x}} and such that I is not empty??? I am aware of some of the work of Sergei Shary in this regard, in particular, for inner estimates of solutions to linear systems, but can that arithmetic be used for general expressions? What, in your opinion, is the best introductory literature to the subject? Best regards, Baker --------------------------------------------------------------- R. Baker Kearfott, rbk [at] louisiana [dot] edu (337) 482-5346 (fax) (337) 482-5270 (work) (337) 981-9744 (home) URL: http://interval.louisiana.edu/kearfott.html Department of Mathematics, University of Louisiana at Lafayette Box 4-1010, Lafayette, LA 70504-1010, USA --------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] usl.edu Mon Aug 28 13:53:21 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id NAA20082 for reliable_computing-outgoing; Mon, 28 Aug 2000 13:53:20 -0500 (CDT) Received: from solon.mat.univie.ac.at (solon.mat.univie.ac.at [131.130.145.131]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id NAA20077 for ; Mon, 28 Aug 2000 13:52:43 -0500 (CDT) Received: (from neum@localhost) by solon.mat.univie.ac.at (8.9.3/8.9.3) id UAA04677; Mon, 28 Aug 2000 20:51:32 +0200 (MET DST) Date: Mon, 28 Aug 2000 20:51:32 +0200 (MET DST) From: Arnold Neumaier Message-Id: <200008281851.UAA04677 [at] solon [dot] mat.univie.ac.at> To: rbk [at] louisiana [dot] edu, reliable_computing [at] interval [dot] louisiana.edu Subject: Re: Inner estimation? Cc: neum [at] cma [dot] univie.ac.at, rbk [at] usl [dot] edu Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Baker Kearfott asked, >>Can you post anything you know about literature regarding inner estimation of arithmetic expressions? In particular, if {\ivl x} is a usual interval, and E(x) is an algebraic expression in the real variable x, how might we use arithmetic to obtain a set I such that I \subseteq {y | y\in the range of E over {\ivl x}} and such that I is not empty???<< On very tiny intervals, any inner enclosure computable without extended precision by an arbitrary method might turn out to be empty, while one always has a more natural measure of quality of an outer enclosure, namely the Haussdorff distance. If q is the Haussdorff-distance of an enclosure [x] of a range in the infty-norm then moving each boundary by q inward gives an inner enclosure. Upper bounds on the Haussdorff distance may be computed recursively; see my (now unfortunately out of print) book A. Neumaier, Interval Methods for Systems of Equations Cambridge Univ. Press, Cambridge 1990 in particular Theorem 2.1.1 and Theorem 2.3.3. For scalar-valued functions, branch and bound schemes provide inner estimates for the range, by taking the (possibly empty) interval [min(f(x_i).sup),max(f(x_i).inf)] over all x_i whose function value has been evaluated. There are usually some evaluations quite close to the extrema, so the quality of these inner estimates can be excellent. For scalar-valued functions of a single variable, I made a INTLAB program for inner and outer range enclosure available at http://solon.cma.univie.ac.at/~neum/software/1Drange (Since INTLAB is designed for matrix computations it is v e r y slow for univariate functions. I'd appreciate if someone provided a faster Fortran 90 or C++ implementation for the public domain.) The problem is somewhat ill-posed for vector-valued functions since there are uncountably many maximal such boxes, and if one allows more general shapes the only natural set I is the range... Arnold Neumaier From owner-reliable_computing [at] interval [dot] usl.edu Tue Aug 29 10:27:10 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA00622 for reliable_computing-outgoing; Tue, 29 Aug 2000 10:27:10 -0500 (CDT) Received: from pilot28.cl.msu.edu (pilot28.cl.msu.edu [35.9.5.48]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA00617 for ; Tue, 29 Aug 2000 10:26:58 -0500 (CDT) Received: from berz ([35.10.52.114]) by pilot28.cl.msu.edu (8.10.2/8.10.2) with SMTP id e7TFOfp83498; Tue, 29 Aug 2000 11:24:41 -0400 From: "Martin Berz" To: "R. Baker Kearfott" , Cc: "Makino, Kyoko" , "Hoefkens Jens" Subject: RE: Inner estimation? Date: Tue, 29 Aug 2000 11:23:17 -0400 Message-ID: MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit X-Priority: 3 (Normal) X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook IMO, Build 9.0.2416 (9.0.2910.0) X-MIMEOLE: Produced By Microsoft MimeOLE V5.50.4133.2400 Importance: Normal In-Reply-To: <2.2.32.20000828163045.012c19c8 [at] pop [dot] usl.edu> Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear Baker and Colleagues, > Can you post anything you know about literature regarding inner estimation > of arithmetic expressions? In particular, if {\ivl x} is a usual > interval, > and E(x) is an algebraic expression in the real variable x, how might > we use arithmetic to obtain a set I such that > > I \subseteq {y | y\in the range of E over {\ivl x}} > > and such that I is not empty??? > > I am aware of some of the work of Sergei Shary in this regard, in > particular, for inner estimates of solutions to linear systems, but > can that arithmetic be used for general expressions? What, in your > opinion, is the best introductory literature to the subject? > > Best regards, > > Baker I cannot quite answer the question regarding the literature, but there is a nearly elementary way of doing this efficiently within the framework of Taylor model arithmetic. Some of you may recall that around 11/15/99, there was a question on the mailing list of getting higher-order convergent bounds for complicated functions, for which Baker posed the challenge of finding tight bounds for "Gritton's Problem". This function, merely a polynomial of around order around 20, exhibits a tremendous amount of overestimation when evaluated with intervals, yet can be bounded under almost complete avoidance of the dependency problem with the Taylor model approach. Specifically, using Taylor model arithmetic, one obtains an enclosure of the range of the dependencies within Taylor polynomial plus an interval remainder bound. This can lead to very sharp inclusions; as an example, we had considered the point x=1, and with a domain width of 0.1, we had obtained remaider intervals: >*** Width 0.1000000000000000 > > REMAINDER BOUND INTERVAL > Order 5 [-.6726596225651657E-004,0.6726596225651657E-004] > Order 10 [-0.5340837667066269E-12, 0.5340837667066269E-12] > which when bounding the Taylor polynomial part (even by mere evaluation with intervals) leads to the following sharp overall bounds: > Bound evaluation of the function > Taylor Model: [ 3.639055771004044 , 5.004415060553268 ] > Naive Interval: [ -1942.104301934065 , 1832.828958028471 ] > Rastering: [ 3.794653671645733 , 4.617163892782912 ] > This method can be modified easily to also provide wide inner bounds for the range; the exact range of the fifth order Taylor polynomial can be obtained analytically, then adding the lower bound of the fifth order remainder bound to the max gives an upper inner bound for the range, and adding the upper bound to the min gives a lower inner bound. Many variations of this basic idea are possible; for example instead of bounding the high order polynomial one can just bound it up to a certain order, and bound the rest by mere interval evaluation; this corresponds to the bounding scheme used for the above examples. This can still avoid most of the dependency problem for things like Gritton's problem, as it is still analogous in sharpness to the outer bounding problem. Martin Berz