From owner-reliable_computing Fri Oct 4 07:22:47 1996 Received: by interval.usl.edu id AA21993 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 4 Oct 1996 14:23:00 -0500 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA21987 (5.65c/IDA-1.4.4 for ); Fri, 4 Oct 1996 14:22:52 -0500 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA07444; Fri, 4 Oct 96 13:22:47 MDT Date: Fri, 4 Oct 96 13:22:47 MDT From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9610041922.AA07444 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu Subject: error in JAF13 first ANNOUNCEMENT Sender: owner-reliable_computing Precedence: bulk ----- Begin Included Message ----- From margens [at] iut [dot] univ-metz.fr Thu Oct 3 08:17:05 1996 International Conference 13th DAYS ON WEAK ARITHMETICS A misprint occurred in the first announcement of the conference in the e-mail address to which registration forms should be sent. Here is the right address: jaf13 [at] iut [dot] univ-metz.fr From owner-reliable_computing Sat Oct 5 15:17:29 1996 Received: by interval.usl.edu id AA22713 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Sat, 5 Oct 1996 22:17:37 -0500 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA22707 (5.65c/IDA-1.4.4 for ); Sat, 5 Oct 1996 22:17:33 -0500 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA12389; Sat, 5 Oct 96 21:17:29 MDT Date: Sat, 5 Oct 96 21:17:29 MDT From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9610060317.AA12389 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu Subject: interval methods help robots Sender: owner-reliable_computing Precedence: bulk Interval Methods Help a Robot Succeed Interval methods helped a robot designed by the University of Texas at El Paso (UTEP) team win a prestigious third place world-wide in the robot competition held during the American Association of Artificial Intelligence conference in Portland, Oregon, August 6--7, 1996. Robots have to deal with two types of uncertainty: * first, their sensors are not absolutely accurate; as a result, they measure, e.g., distances to obstacles only approximately; * second, their actuators are not absolutely precise; as a result, e.g., a command to turn 90 degrees can actually leads to an 85 or 95 degree turn. Traditionally, statistical methods have been used to deal with these two types of uncertainty. There are, however, two major problems related to these methods: * first, they are very computationally intensive: for every pixel, at any moment of time, we need to compute and store the probability that the corresponding point contains an obstacle; in a mobile robot, it is desirable to have computational methods that are as simple as possible; * second, even more importantly, these methods require that we know the probabilities of errors for different sensors and actuators, and we usually do not know the exact values of these probabilities. Instead, we only know the INTERVALS of possible error values. We can try to guesstimate the probabilities, but: * if we wrongly guess the probabilities of sensor errors, we may erroneously hit an obstacle; * if we wrongly guess the probabilities of actuator errors, and use these wrong probabilities in some filtering-type correction, we may worsen the position error instead of compensating for it. The team leaders of the UTEP team, graduate students David Morales and Tran Son and their supervisor Chitta Baral, decided to abandon statistical methods and use interval-based methods instead. To take sensor errors d into consideration, their robot assumes that any pixel that could be (within this error) inside an obstacle has to be avoided. As a result, e.g., when going in a corridor, the robot actually follows the ``virtual corridor'' whose width is 2d smaller than the actual width. To compensate for the actuator errors, with unknown probabilities, the robot does not attempt any statistical filter-type corrections; instead, it uses the sensor feedback to periodically adjusts its position and orientation. Several other novel ideas have been used. The resulting algorithms turned out to be computationally simpler and more reliable than the previously known ones. In the robot competition, the robot Diablo implementing these algorithms won the third place in complicated office navigation competition where robots had to navigate in a realistic office environment. Diablo proved top be 100% reliable, always staying on track and never hitting any obstacle. The only points it lost were due to speed. Due to novel algorithms, UTEP's commercially built robot outperformed more than 20 much more technologically sophisticated robots from all over the world, including teams from prestigious institutions long involved in world-class robotic research such as Carnegie-Mellon University and the Universities of Stuttgart and Bonn. In addition to D. Morales and T. Son, the main team included Luis Floriano and Monica Nogueira. Support team members who assisted with the robot's programming were Alfredo Gabaldon, Richard Watson, Glen Hutton, and Dara Morgenstein. From owner-reliable_computing Sun Oct 6 06:27:51 1996 Received: by interval.usl.edu id AA23093 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Sun, 6 Oct 1996 09:28:11 -0500 Received: from mail0.uts.ohio-state.edu by interval.usl.edu with SMTP id AA23087 (5.65c/IDA-1.4.4 for ); Sun, 6 Oct 1996 09:28:03 -0500 Received: from ts34-12.homenet.ohio-state.edu (ts34-12.homenet.ohio-state.edu [140.254.114.179]) by mail0.uts.ohio-state.edu (8.7.6/8.7.3) with SMTP id KAA07177; Sun, 6 Oct 1996 10:27:51 -0400 (EDT) Date: Sun, 6 Oct 1996 10:27:51 -0400 (EDT) Message-Id: <199610061427.KAA07177 [at] mail0 [dot] uts.ohio-state.edu> X-Sender: rmoore [at] pop [dot] service.ohio-state.edu X-Mailer: Windows Eudora Pro Version 2.1.2 Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" To: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) From: Ramon Edgar Moore Subject: Re: interval methods help robots Cc: reliable_computing [at] interval [dot] usl.edu Sender: owner-reliable_computing Precedence: bulk At 09:17 PM 10/5/96 MDT, you wrote: >Interval Methods Help a Robot Succeed > >Interval methods helped a robot designed by the University of Texas at >El Paso (UTEP) team win a prestigious third place world-wide in the robot >competition held during the American Association of Artificial Intelligence >conference in Portland, Oregon, August 6--7, 1996. >The team leaders of the UTEP team, graduate students David Morales >and Tran Son and their supervisor Chitta Baral, decided to abandon >statistical methods and use interval-based methods instead. > >Several other novel ideas have been used. The resulting algorithms >turned out to be computationally simpler and more reliable than the >previously known ones. In the robot competition, the robot Diablo >implementing these algorithms won the third place in complicated office >navigation competition where robots had to navigate in a realistic >office environment. Diablo proved top be 100% reliable, always staying >on track and never hitting any obstacle. The only points it lost were >due to speed. > >Due to novel algorithms, UTEP's commercially built robot outperformed >more than 20 much more technologically sophisticated robots from all >over the world, including teams from prestigious >institutions long involved in world-class robotic research >such as Carnegie-Mellon University and the >Universities of Stuttgart and Bonn. > >In addition to D. Morales and T. Son, the main team included Luis >Floriano and Monica Nogueira. Support team members who assisted with >the robot's programming were Alfredo Gabaldon, Richard Watson, Glen >Hutton, and Dara Morgenstein. > My sincere congratulations to the entire team in this robot competition. And thanks to Vladik for telling us all about this fine accomplishment. Ramon Moore From owner-reliable_computing Sun Oct 6 15:10:14 1996 Received: by interval.usl.edu id AA23449 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Sun, 6 Oct 1996 18:12:43 -0500 Received: from life (life.bio.sunysb.edu) by interval.usl.edu with SMTP id AA23443 (5.65c/IDA-1.4.4 for ); Sun, 6 Oct 1996 18:12:40 -0500 Received: by life (5.x/SMI-SVR4) id AA21487; Sun, 6 Oct 1996 19:10:14 -0400 Date: Sun, 6 Oct 1996 19:10:14 -0400 (EDT) From: AB Risk Group To: reliable_computing [at] interval [dot] usl.edu Subject: Workshop: interval and fuzzy methods in risk analysis In-Reply-To: <199609251232.AA16778 [at] interval [dot] usl.edu> Message-Id: Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-reliable_computing Precedence: bulk WORKSHOP Risk Assessment Using Interval Analysis and Fuzzy Arithmetic Sunday, 8 December 1996, Society for Risk Analysis Annual Meeting Fairmont Hotel, New Orleans, Louisiana http://gramercy.ios.com/~ramas/interval.html This full day workshop will review the use of interval analysis and fuzzy arithmetic for propagating uncertainty through calculations in a quantitative risk assessment. These methods can be used even when data are far too sparse for other uncertainty projection methods. They are widely applicable and are useful for handling uncertainty of all kinds no matter what its nature or source. During the workshop, the methods will be applied to several environmental risk and safety assessment problems, including hydrocarbon contamination, pesticide misapplication, soil lead cleanup targets, extinction of endangered species and event-tree/fault-tree safety analysis. A workshop booklet and software disk will be provided to participants. The booklet contains hardcopies of transparency illustrations used in the presentations, numerical examples, and references, including instructions for accessing the various Internet resources for interval analysis and fuzzy arithmetic. The software disk contains source code and executable programs for doing interval and fuzzy arithmetic calculations. Computers will be available at the workshop to run the provided software and make calculations needed to solve the example problems. For further information, consult the workshop's homepage at http://gramercy.ios.com/~ramas/interval.html or contact Scott Ferson at 516-751-4350 or ramas [at] gramercy [dot] ios.com. From owner-reliable_computing Tue Oct 8 01:02:05 1996 Received: by interval.usl.edu id AA24699 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Tue, 8 Oct 1996 10:01:46 -0500 Received: from mercury.Sun.COM by interval.usl.edu with SMTP id AA24693 (5.65c/IDA-1.4.4 for ); Tue, 8 Oct 1996 10:01:39 -0500 Received: by mercury.Sun.COM (Sun.COM) id IAA27273; Tue, 8 Oct 1996 08:01:31 -0700 From: bill.walster [at] eng [dot] sun.com Received: from gww.eng.sun.com by Eng.Sun.COM (SMI-8.6/SMI-5.3) id IAA28359; Tue, 8 Oct 1996 08:01:17 -0700 Received: by gww.eng.sun.com (SMI-8.6/SMI-SVR4) id IAA00963; Tue, 8 Oct 1996 08:02:05 -0700 Date: Tue, 8 Oct 1996 08:02:05 -0700 Message-Id: <199610081502.IAA00963 [at] gww [dot] eng.sun.com> To: reliable_computing [at] interval [dot] usl.edu Subject: A central problem in computer vision X-Sun-Charset: US-ASCII Sender: owner-reliable_computing Precedence: bulk Has anybody in the interval community taken a look at this problem? It appears that we might be able to provide some help solving this problem. ----- Begin Included Message ----- STANFORD UNIVERSITY ___________________ SCIENTIFIC COMPUTING AND COMPUTATIONAL MATHEMATICS SEMINARS ___________________________________________________________ For further information about the seminars contact: Andrew Stuart 415-723-8142 stuart [at] sccm [dot] stanford.edu To be added/deleted from the mailing list contact action [at] sccm [dot] stanford.edu ****************** NOTE NEW TIME **** ****************** DATE: September 30th TIME: 4:45 p.m. ROOM: Gates B12 SPEAKER: Carlo Tomasi FROM: Stanford, CS TITLE: Is ``Strcture from Motion'' Worth Pursuing? Joint work with John Zhang and Tom Binford Structure-from-motion is the problem of recovering the motion of a camera and the shape of objects in front of it from the images that the camera produces. This is a central problem in computer vision. However, decades of research have shown that this computation is very sensitive to errors in image measurements. How bad is this problem, really? Surprisingly, no satisfactory answer to this question is known yet. This lack of understanding is due to two main reasons. One is that the function to be analyzed, which takes image measurements as inputs and produces structure and camera motion as outputs, is not explicitly available. Reconstruction methods exist, but they differ in important ways, so restricting the analysis to a particular method severely limits the generality of any conclusion. The other reason is that if sensitivity is expressed as the Jacobian of the reconstruction process, this very large matrix of numbers is by itself uninspiring and needs interpretation, a less than straightforward task. We propose a framework for the sensitivity analysis of structure-from-motion that addresses both these difficulties. Although not available directly, the reconstruction function is completely specified locally by the formulation of structure-from-motion as a least squares problem. Implicit differentiation then leads to the desired Jacobian. The interpretation of the latter is made possible by the Singular-Value Decomposition (SVD) which exposes the structure of the matrix in a way that lends itself directly to geometric interpretation. +----------------------------------------------------------------------------+ | This message was sent via the Stanford Computer Science Department | | colloquium mailing list. To be added to this list send an arbitrary | | message to colloq-subscribe [at] cs [dot] stanford.edu. To be removed from this list,| | send a message to colloq-unsubscribe [at] cs [dot] stanford.edu. For more information,| | send an arbitrary message to colloq-request [at] cs [dot] stanford.edu. For directions| | to Stanford, check out http://www-forum.stanford.edu | +-------------------------------------------------------------------------xcl+ ----- End Included Message ----- From owner-reliable_computing Tue Oct 8 10:53:17 1996 Received: by interval.usl.edu id AA25386 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Tue, 8 Oct 1996 13:55:19 -0500 Received: from nebula.systemsz.cs.yale.edu (SYSTEMSZ-GW.CS.YALE.EDU) by interval.usl.edu with SMTP id AA25349 (5.65c/IDA-1.4.4 for ); Tue, 8 Oct 1996 13:54:09 -0500 Received: from blender.ai.cs.yale.edu by nebula.systemsz.cs.yale.edu (8.7.1/res.host.cf-4.0) with ESMTP id OAA10661; Tue, 8 Oct 1996 14:53:19 -0400 (EDT) sender hager-greg [at] CS [dot] YALE.EDU for Received: by blender.ai.cs.yale.edu (Sendmail-8.7.1/res.client.cf-4.0) id OAA15567; Tue, 8 Oct 1996 14:53:17 -0400 (EDT) Date: Tue, 8 Oct 1996 14:53:17 -0400 (EDT) From: hager-greg [at] CS [dot] YALE.EDU Message-Id: <199610081853.OAA15567 [at] blender [dot] ai.cs.yale.edu> To: bill.walster [at] eng [dot] sun.com Cc: reliable_computing [at] interval [dot] usl.edu In-Reply-To: <199610081502.IAA00963 [at] gww [dot] eng.sun.com> (bill.walster [at] eng [dot] sun.com) Subject: Re: A central problem in computer vision Sender: owner-reliable_computing Precedence: bulk Walster: >> Has anybody in the interval community taken a look at this problem? It >> appears that we might be able to provide some help solving this problem. I actually applied interval methods to SFM (structure from motion) at one time, albeit in a slightly modified fashion. It worked ok, but was, at the time, hideously slow. More generally, I've been watching the messages on interval analysis and robotics/vision with some interest. I have tried interval-based ideas in these areas. It is important to note most cases, the issue is *not* really numerical accuracy and sensitivity, it is that fact that data comes from sensors with inaccuracies several orders of magnitude larger than that resulting from numerical roundoff. Hence, many of the problems of interval overestimation and growth are greatly compounded when applied to these problems. My conclusion was that interval methods work well in certain cases, but there are a variety of practical problems (for example, data outliers that violate sensor data tolerances) that crop up which are difficult to surmount. At any rate, for anyone who is interested, here are a few of my publications which use sets and intervals to solve some robotics problems. The references in these articles point to other related work. Task-Directed Computation of Qualitative Decisions from Sensor Data. {\it IEEE Transactions on Robotics and Automation,} 10(4), pp.~415-429, 1994. Solving Large Systems of Non-Linear Constraints with Application to Data Modeling. {\em Interval Computations,} 2, pp.~169-200, 1994. Real-Time Vision-Based Robot Localization (with S. Atiya). {\em IEEE Transactions on Robotics and Automation,} 9(6), pp.~785-800, 1993. {\em Task-Directed Sensor Fusion and Planning}. Kluwer, Boston, 1990. On Comparing Statistical and Set-Based Methods in Sensor Data Fusion (with S. Engelson and S. Atiya). In {\em Proceedings of the 1993 IEEE International Conference on Robotics and Automation}, pp. 1662--1667, 1993. Constraint Solving Methods and Sensor-Based Decision Making. In {\em Proceedings of the 1992 IEEE International Conference on Robotics and Automation}, pp. 1662--1667, 1992. Towards Geometric Decision Making in Unstructured Environments. {\em Proceedings of the International Workshop on Intelligent Robots and Systems}, pp. 1412--1417. A revised version appears in the proceedings of SPIE, Sensor Fusion IV, 1991. ------------------------------------------------------------------------ Prof. Greg Hager Dept. of Computer Science hager [at] cs [dot] yale.edu Yale University Phone: (203) 432-6432 P.O. Box 208285, Yale Station FAX: (203) 432-0593 New Haven, CT 06520-8285 http://www.cs.yale.edu/users/hager.html ------------------------------------------------------------------------ From owner-reliable_computing Thu Oct 17 03:57:24 1996 Received: by interval.usl.edu id AA02314 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Thu, 17 Oct 1996 11:16:51 -0500 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA02308 (5.65c/IDA-1.4.4 for ); Thu, 17 Oct 1996 11:16:47 -0500 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA18649; Thu, 17 Oct 96 09:57:24 MDT Date: Thu, 17 Oct 96 09:57:24 MDT From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9610171557.AA18649 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu Subject: next student issue of RC Sender: owner-reliable_computing Precedence: bulk CALL FOR PAPERS STUDENT ISSUES of the International Journal RELIABLE COMPUTING Editors of student issues: Guenter Mayer and Vladik Kreinovich The future of Interval Computations is with the student researchers entering the field. Their vision, their insights, and their approaches will shape future research. To highlight their contributions, the International Journal "Reliable Computing" regularly allocates special issues for high-quality papers written by students (either alone, or in co-authorship with their professors). These papers undergo the same refereeing as all the other papers. We will try our best to publish these issues as fast as possible. The nearest (third) student issue is scheduled as No. 4, 1997. Papers should be (ideally) written in a version of TeX (preferably plain LaTeX). Please submit your papers to Vladik Kreinovich Department of Computer Science University of Texas at El Paso El Paso, TX 79968 phone (915) 747-6951 fax (915) 747-5030 email vladik [at] cs [dot] utep.edu From owner-reliable_computing Fri Oct 18 05:56:52 1996 Received: by interval.usl.edu id AA03848 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 18 Oct 1996 10:58:39 -0500 Received: from bp.ucs.usl.edu by interval.usl.edu with SMTP id AA03842 (5.65c/IDA-1.4.4 for ); Fri, 18 Oct 1996 10:58:35 -0500 Received: from rbk5287.usl.edu (rbk5287.usl.edu [130.70.64.43]) by bp.ucs.usl.edu with SMTP id AA27523 (5.65c/IDA-1.4.4 for ); Fri, 18 Oct 1996 10:58:33 -0500 Message-Id: <2.2.32.19961018155652.006f9a40 [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: Fri, 18 Oct 1996 10:56:52 -0500 To: reliable_computing [at] interval [dot] usl.edu From: "R. Baker Kearfott" Subject: Sender: owner-reliable_computing Precedence: bulk help--------------------------------------------------------------- R. Baker Kearfott, rbk [at] usl [dot] edu (318) 482-5346 (fax) (318) 482-5270 (work) (318) 981-9744 (home) URL: http://interval.usl.edu/kearfott.html Department of Mathematics, University of Southwestern Louisiana --------------------------------------------------------------- From owner-reliable_computing Fri Oct 18 06:21:14 1996 Received: by interval.usl.edu id AA04139 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 18 Oct 1996 11:23:02 -0500 Received: from bp.ucs.usl.edu by interval.usl.edu with SMTP id AA04133 (5.65c/IDA-1.4.4 for ); Fri, 18 Oct 1996 11:23:00 -0500 Received: from rbk5287.usl.edu (rbk5287.usl.edu [130.70.64.43]) by bp.ucs.usl.edu with SMTP id AA29148 (5.65c/IDA-1.4.4 for ); Fri, 18 Oct 1996 11:22:58 -0500 Message-Id: <2.2.32.19961018162114.006f54b0 [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: Fri, 18 Oct 1996 11:21:14 -0500 To: reliable_computing [at] interval [dot] usl.edu From: "R. Baker Kearfott" Subject: apology Sender: owner-reliable_computing Precedence: bulk Colleagues, I apologize for the test message that I erroneously directed to this list. --------------------------------------------------------------- R. Baker Kearfott, rbk [at] usl [dot] edu (318) 482-5346 (fax) (318) 482-5270 (work) (318) 981-9744 (home) URL: http://interval.usl.edu/kearfott.html Department of Mathematics, University of Southwestern Louisiana --------------------------------------------------------------- From owner-reliable_computing Fri Oct 18 07:05:54 1996 Received: by interval.usl.edu id AA04486 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 18 Oct 1996 14:06:29 -0500 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA04480 (5.65c/IDA-1.4.4 for ); Fri, 18 Oct 1996 14:06:26 -0500 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA09917; Fri, 18 Oct 96 13:05:55 MDT Date: Fri, 18 Oct 96 13:05:54 MDT From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9610181905.AA09917 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu Subject: double bubble again: AMS interval exposure Sender: owner-reliable_computing Precedence: bulk The latest issue of the Notices of the American Mathematical Society contains a nice and brief exposition of the double bubble result, with an explicit mention of interval computations, and even with the explanation of what interval arithmetic is about (pp. 1363-1364; intervals are mentioned on p. 1364). P.S. Interval computations are also explicitly mentioned in the new AMS edited book Problems of Reducing the Exhaustive Search advertised on p. 1386. This is a translation from Russian, with a main emphasis on logic and Computer Science problems; intervals are mentioned in the last chapter that surveys applications and ideas developed after the Russian edition: namely, it mentions that heuristic methods natural for interval problems can lead to non-trivial heuristics for logic and CS problems, heuristics that are related to chemical computing, neural networks, etc. From owner-reliable_computing Fri Oct 18 07:25:48 1996 Received: by interval.usl.edu id AA04790 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 18 Oct 1996 16:25:29 -0500 Received: from venus.Sun.COM by interval.usl.edu with SMTP id AA04784 (5.65c/IDA-1.4.4 for ); Fri, 18 Oct 1996 16:25:19 -0500 Received: from Eng.Sun.COM ([129.146.1.25]) by venus.Sun.COM (SMI-8.6/mail.byaddr) with SMTP id OAA01078 for ; Fri, 18 Oct 1996 14:25:07 -0700 From: bill.walster [at] eng [dot] sun.com Received: from gww.eng.sun.com by Eng.Sun.COM (SMI-8.6/SMI-5.3) id OAA23319; Fri, 18 Oct 1996 14:25:04 -0700 Received: by gww.eng.sun.com (SMI-8.6/SMI-SVR4) id OAA14882; Fri, 18 Oct 1996 14:25:48 -0700 Date: Fri, 18 Oct 1996 14:25:48 -0700 Message-Id: <199610182125.OAA14882 [at] gww [dot] eng.sun.com> To: reliable_computing [at] interval [dot] usl.edu Subject: Call for Interval R & D Proposals X-Sun-Charset: US-ASCII Sender: owner-reliable_computing Precedence: bulk Dear interval researchers, The following is an interval-specific version of a more general R & D program being supported by SunSoft. I would like to make sure that we are well represented among funded proposals. Please submit a short proposal for an interval research and development project. If it is not obvious, please explain how the proposed project will speed the commercial acceptance of interval arithmetic. You may send proposals to: Michael W. Condry Sun MicroSystems, Inc Director, Open Systems and SunSoft Standards MS UMPK17-307 EMAIL: michael.condry [at] Eng [dot] sun.com 2550 Garcia Avenue m.condry [at] opengroup [dot] org Mountain View, CA 94043-1100 m.condry [at] ieee [dot] org USA FAX: +1 (415) 786-5734 TEL: +1 (415) 786-5568 If you send proposals by email, please use the above subject title, so Michael can easily spot them in his input queue. Thanks, Bill ---------------------------------------------------------------------- SUNSOFT UNIVERSITY R & D SunSoft has created a matching funds program for University research. This program is intended to facilitate SunSoft's collaboration with Universities as a vehicle for advanced technology development - an influence on future products. In addition, using the program may build relationships with students that can lead to new staff. Projects done through this program are to help execute on a vision of future technology that can lead to future products. Such research evolves technology need not necessarily create product quality results, at least directly. This program provides a process to define and to manage these projects as well as means for matching funding. An advisory board recommends the projects to be funded from the list of requests. Ideas for research projects can be created by SunSoft staff or can be accepted from a list of projects provided by research institutions. The algorithm for computing the amount of matching funds has not yet been announced. This program should be viewed as an opportunity to test some concepts or to engage in some technology studies of interest to Sun and which may provide significant long-term payoff to Sun's overall product and technology strategies. Anything that will facilitate rapid acceptance of interval arithmetic can be considerd as a potential project. For example, project ideas can generally fall into one of 3 categories: * Product/Technology ... ie., Build a "proof-of-concept" interval application * Tests ... ie., Develop an interval version of "Paranoia" * Tools ... ie., Build a tool for locating numerical instabilities during algorithm execution * Tools ... ie., Build tools to assist in porting point algorithms to interval arithmetic For example, a recent start-up (Inkomi) started as a Sun-funded University initiative at U.C. Berkeley under the NOW (Network of Workstations) project and that Inkomi has developed a state-of-the-art search engine. In summary, this collaborative process is quite simple: * Project Ideas Ideas for cooperative projects result from within SunSoft or directly from the University. The program provides the processes associated with idea creation and maintains the database. * Brokering Ideas once developed are brokered among the relevant engineering organization and/or the relevant University. * Approval Projects are approved by a panel of SunSoft Distinguished Engineers headed by Rob Gingell. * Funding Matching funding for the project is provided by SunSoft finance. Engineering management will provide a list of ideas for beneficial projects, but for which funds, time, or energy are lacking. The program will provide a list of projects in which Universities are interested. For planning purposes, it is estimated that the average project will be approximately $150K with a 50% grant being awarded to the relevant development organization. These are rough guidelines which can be modified as appropriate. From owner-reliable_computing Thu Oct 24 09:48:26 1996 Received: by interval.usl.edu id AA12792 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Thu, 24 Oct 1996 16:48:53 -0500 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA12786 (5.65c/IDA-1.4.4 for ); Thu, 24 Oct 1996 16:48:46 -0500 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA17196; Thu, 24 Oct 96 15:48:26 MDT Date: Thu, 24 Oct 96 15:48:26 MDT From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9610242148.AA17196 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu Subject: 1996 best student paper Sender: owner-reliable_computing Precedence: bulk 1996 Best Student Paper Award for the "Reliable Computing" Journal In 1993, the editorial board of the "Interval Computations" journal (now called "Reliable Computing") announced that papers submitted for the special student issue will be automatically entered into an annual Best Student Paper contest. The referee reports and the reports from the members of the editorial board of "Reliable Computing" served as the basis for choosing the best paper. It was a difficult decision to make because we have received several excellent papers. We are pleased to announce the results. The 1996 best student paper award is awarded to the paper "Newton's constant of gravitation and verified numerical quadrature" by Oliver Holzmann, Bruno Lang, and Holger Schuett. This paper is published in "Reliable Computing", 1996, Vol. 2, No. 3, pp. 229-240. In addition to being a very good paper, it is devoted to an important application (measuring the gravitational constant) that has led to a good publicity for interval computations (in "Discover", one of the major popular science journals). Congratulations to Oliver Holtzmann, the student author of this paper, and thanks to all other students authors for their excellent job. Vladik Kreinovich and Guenter Mayer co-editors of the student issue October 24, 1996 From owner-reliable_computing Mon Oct 28 08:15:46 1996 Received: by interval.usl.edu id AA15248 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Mon, 28 Oct 1996 18:15:00 -0600 Received: from venus.Sun.COM by interval.usl.edu with SMTP id AA15242 (5.65c/IDA-1.4.4 for ); Mon, 28 Oct 1996 18:14:56 -0600 Received: from Eng.Sun.COM ([129.146.1.25]) by venus.Sun.COM (SMI-8.6/mail.byaddr) with SMTP id QAA11024 for ; Mon, 28 Oct 1996 16:14:51 -0800 From: bill.walster [at] eng [dot] sun.com Received: from gww.eng.sun.com by Eng.Sun.COM (SMI-8.6/SMI-5.3) id QAA20559; Mon, 28 Oct 1996 16:14:48 -0800 Received: by gww.eng.sun.com (SMI-8.6/SMI-SVR4) id QAA09678; Mon, 28 Oct 1996 16:15:46 -0800 Date: Mon, 28 Oct 1996 16:15:46 -0800 Message-Id: <199610290015.QAA09678 [at] gww [dot] eng.sun.com> To: reliable_computing [at] interval [dot] usl.edu Subject: Interval Proposal Format X-Sun-Charset: US-ASCII Sender: owner-reliable_computing Precedence: bulk Folks, Just received the following template which should be used for any proposals for interval R & D projects. Thanks, Bill ************************************************************************ Sunsoft ThinkTank 1-Pager: (University Submission) ================================================== * Project Name: * University Sponsor: Name: Email: Department: * Date Submitted: * Project Description: * Overview of Other Research Activities of Possible Interest to SunSoft: * Estimated Project Cost: ************************************************************************ From owner-reliable_computing Wed Oct 30 09:41:37 1996 Received: by interval.usl.edu id AA16302 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Wed, 30 Oct 1996 01:43:36 -0600 Received: from rztsun.rz.tu-harburg.de by interval.usl.edu with SMTP id AA16296 (5.65c/IDA-1.4.4 for ); Wed, 30 Oct 1996 01:43:01 -0600 Date: Wed, 30 Oct 96 08:41:37 +0100 From: rump@tu-harburg.d400.de ( Prof.Dr.S.M. Rump) Message-Id: <9610300741.AA03400 [at] ti3sun [dot] ti3.tu-harburg.de> To: reliable_computing [at] interval [dot] usl.edu Sender: owner-reliable_computing Precedence: bulk Folgendes Buch ist soeben erschienen: "Software Engineering im Scientific Computing", Hrsg. W. Mackens und S.M. Rump, Vieweg 1996 Aus dem Vorwort: Bei Entwicklern und Anwendern numerischer Software besteht dringender Bedarf an modernen und praxisnahen Konzepten der Informatik. Umgekehrt stellt die Informatik Werkzeuge zur Verfuegung, die im wissenschaftlichen Rechnen nicht immer wahrgenommen werden. Das Ziel des Buches ist es, die gemeinsamen Probleme und Ziele des wissenschaftlichen Rechnens und der anwendungsorientierten Informatik fuer die jeweiligen Gruppen darzustellen, zur Verbesserung der Kommunikation zwischen den Gruppen beizutragen sowie praktische Werkzeuge, Informatik-Methoden und Anforderungen des wissenschaftlichen Rechnens bekannt zu machen. Auf dreihundert Seiten kommen Experten der Informatik und des wissenschaftlichen Rechnens zu Wort. Ein Stichwortverzeichnis schliesst das Buch ab. From owner-reliable_computing Thu Oct 31 18:39:20 1996 Received: by interval.usl.edu id AA20530 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Thu, 31 Oct 1996 10:40:05 -0600 Received: from rztsun.rz.tu-harburg.de by interval.usl.edu with SMTP id AA20524 (5.65c/IDA-1.4.4 for ); Thu, 31 Oct 1996 10:39:41 -0600 Date: Thu, 31 Oct 96 17:39:20 +0100 From: rump@tu-harburg.d400.de ( Prof.Dr.S.M. Rump) Message-Id: <9610311639.AA04082 [at] ti3sun [dot] ti3.tu-harburg.de> To: reliable_computing [at] interval [dot] usl.edu Cc: rump@tu-harburg.d400.der Sender: owner-reliable_computing Precedence: bulk subject: New book (most articles in German) Einige Kollegen fragten nach der ISBN-Nummer, die ich bei letzter mail nicht mit angegeben hatte. Hier ist sie: "Software Engineering im Scientific Computing", Hrsg. W. Mackens und S.M. Rump, Vieweg 1996 ISBN 3-528-06904-X From owner-reliable_computing Thu Oct 31 18:40:51 1996 Received: by interval.usl.edu id AA20560 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Thu, 31 Oct 1996 10:41:38 -0600 Received: from rztsun.rz.tu-harburg.de by interval.usl.edu with SMTP id AA20554 (5.65c/IDA-1.4.4 for ); Thu, 31 Oct 1996 10:40:54 -0600 Date: Thu, 31 Oct 96 17:40:51 +0100 From: rump@tu-harburg.d400.de ( Prof.Dr.S.M. Rump) Message-Id: <9610311640.AA04090 [at] ti3sun [dot] ti3.tu-harburg.de> To: reliable_computing [at] interval [dot] usl.edu Cc: rump@tu-harburg.d400.de Sender: owner-reliable_computing Precedence: bulk GAMM annual meeting 1997 On March, 24-27 1997 there will be the annual meeting of the GAMM in Regensburg. In the afternoon there will be short lectures in different sections. Section 16 Computeralgebra and -analysis will be organized by Andreas Frommer, Wuppertal and myself. In this section we will alse have 30-minutes talks. So far the following colleagues agreed to present such a talk: Prof. Dr. G. Mayer, Rostock Prof. Dr. H. Moeller, Dortmund Prof. Dr. J. Rohn, Prague Prof. Dr. H. Stetter, Vienna Prof. Dr. P. Wittwer, Geneve We would like to encourage you and your colleagues/students to participate actively in this section with a talk of 15 minutes. The GAMM-meeting are open to members as well as non-members. The deadline for registration is November 15, and abstracts should be avalailable by then. Registration forms are available at Prof. Dr. R. Mennicken GAMM 97 NWF I - Mathematik Universitaet Regensburg D - 93040 Regensburg Tel: 0941 - 943 - 4918 Fax: 0941 - 943 - 4005 e-mail: r.gamm [at] mathematik [dot] uni.regensburg.de Please note that participants have to pay the usual conference fee and to take care for accomodation and travel. With best regards, Andreas Frommer Siegfried M. Rump From owner-reliable_computing Thu Oct 31 19:09:24 1996 Received: by interval.usl.edu id AA21007 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Thu, 31 Oct 1996 11:09:42 -0600 Received: from iamk4525.mathematik.uni-karlsruhe.de by interval.usl.edu with SMTP id AA21001 (5.65c/IDA-1.4.4 for ); Thu, 31 Oct 1996 11:09:32 -0600 Received: (from ae34@localhost) by iamk4525.mathematik.uni-karlsruhe.de (8.6.10/8.6.10) id SAA09713 for reliable_computing [at] interval [dot] usl.edu; Thu, 31 Oct 1996 18:09:25 +0100 From: Rudolf Lohner Message-Id: <199610311709.SAA09713 [at] iamk4525 [dot] mathematik.uni-karlsruhe.de> Subject: Announcement: SCAN 97 in Lyon, France To: reliable_computing [at] interval [dot] usl.edu Date: Thu, 31 Oct 1996 18:09:24 +0100 (MET) X-Mailer: ELM [version 2.4 PL21] Content-Type: text Content-Length: 3955 Sender: owner-reliable_computing Precedence: bulk Dear Interval Community: Here is the first announcement of the SCAN 97 conference which will be held in Lyon, France, next year. Best regards, Rudolf Lohner. ------------------------------------------------------------------------------ Rudolf Lohner, Institut fuer Angewandte Mathematik, Universitaet Karlsruhe (TH) Phone: +49(721)608-4273 Fax : +49(721)385979 email: Rudolf.Lohner [at] math [dot] uni-karlsruhe.de www : http://www.uni-karlsruhe.de/~Rudolf.Lohner ------------------------------------------------------------------------------ S C A N - 9 7 GAMM/IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, September 10 - 12, 1997, Ecole Normale Superieure de Lyon, France Local Organization: Jean-Michel Muller The conference continues the series of SCAN-Symposia which have previously been held at Karlsruhe, Basel, Albena, Oldenburg, Vienna and Wuppertal under the joint sponsorship of GAMM and IMACS. These conferences have traditionally covered the numerical and algorithmic aspects of Scientific Computing, with a strong emphasis on the algorithmic validation of results and on algorithmic and arithmetic tools for this purpose. Validation or verification characterizes those efforts in Scientific Computing which strive to generate - concurrently with numerical results - qualitative and quantitative assertions about the results which are correct in a rigorous mathematical sense. Typical examples of such efforts are the specification of a domain in which a solution of a given problem exists and the computation of close upper and lower bounds for the result of a given problem. Assertions from algorithmic validation have the same correctness quality as assertions obtained by classical mathematical methods of derivation and proof. Because of this quality, Validated Numerics has developed into an important subject within the fast growing area of Scientific Computing. SCAN-97 will provide a forum for the presentation of the latest research and developments in theory, algorithmic and arithmetic design for Validated Numerics, demonstration of new software available for Validated Numerics, reporting of interesting case studies in industrial and scientific applications of Validated Numerics, and for the discussion of new directions in research and development suggested by other advances in Scientific Computing. Potential new directions are the use of parallel architectures for the implementation of validation algorithms and the use of validation ideas in Computer Algebra. Furthermore, the conference should help in the dissemination of the ideas and potentials of Validated Numerics to interested scientists from other areas of Scientific Computing. Within the scope of SCAN-97, there is no restriction regarding the mathematical or applicational background of the problems to be reported: Algebra, analysis, optimization, probability, etc., are equally welcome. Scientific committee: G. Alefeld (Karlsruhe), J.C. Bajard (Marseille), J.M. Chesneaux (Paris), G.F. Corliss (Milwaukee), M. Daumas (Lyon), A. Frommer (Wuppertal), A. Guyot (Grenoble), G. Heindl (Wuppertal), J. Herzberger (Oldenburg), R.B. Kearfott (Lafayette), S. Knowles (Bristol), V. Kreinovich (El Paso), U. Kulisch (Karlsruhe), G. Mayer (Rostock), D.M. Matula (Dallas), A. Mignotte (Lyon), J.M. Muller (Lyon), M. Pichat (Lyon), S.M. Rump (Hamburg), H. J. Stetter (Vienna), Ch. Ullrich (Basel), T. Yamamoto (Matsuyama). Info: To be included in the mailing list send (as soon as possible) your electronic and postal addresses to e-mail: SCAN97 [at] lip [dot] ens-lyon.fr Deadline for conference registration: July 15, 1997.