From owner-reliable_computing Mon Dec 2 13:43:39 1996 Received: by interval.usl.edu id AA28748 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Mon, 2 Dec 1996 21:43:45 -0600 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA28742 (5.65c/IDA-1.4.4 for ); Mon, 2 Dec 1996 21:43:42 -0600 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA12083; Mon, 2 Dec 96 20:43:39 MST Date: Mon, 2 Dec 96 20:43:39 MST From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9612030343.AA12083 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu Subject: contents of Reliable Computing Sender: owner-reliable_computing Precedence: bulk Reliable Computing. - 1996. - N 2 (4). -70 p. CONTENTS Preface 339 Mathematical research Linear interval equations: Computing enclosures with bounded relative or absolute overestimation is NP-hard Vladik Kreinovich and Anatoly V. Lakeyev 341 On the speed of convergence of the total step iterative method for a class of interval linear algebraic systems Marina A. Lyashko 351 Improving the efficiency index in enclosing a root of an equation Yixun Shi 357 Applications Some examples using the interval data type in the relational database model John W. Starner 373 * * * Paul Erd\"os, 1913-1996 383 Letters to the Editor Double bubble minimizes: Interval computations help in solving a long-standing geometric problem Vladik Kreinovich 387 Information Reliable Computing in 1997 389 Peter Fishburn receives von Neumann prize 390 Best student paper award Vladik Kreinovich and G\"unter Mayer 390 Meetings WAI'96: II Workshop on Computer Arithmetic, Interval and Symbolic Computations Marcilia A. Campos 391 Interval'96: International Conference on Interval Methods and Computer Aided Proofs in Science and Engineering J. Wolff von Gudenberg 392 Interval Talks at FUZZ-IEEE'96 Erich Peter Klement and Vladik Kreinovich 394 Addresses of the Editorial Board members 402 Information for authors 404 Contents 405 From owner-reliable_computing Tue Dec 3 14:07:53 1996 Received: by interval.usl.edu id AA29249 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Tue, 3 Dec 1996 06:09:09 -0600 Received: from uci.agh.edu.pl (galaxy.uci.agh.edu.pl) by interval.usl.edu with SMTP id AA29243 (5.65c/IDA-1.4.4 for ); Tue, 3 Dec 1996 06:08:25 -0600 Received: from localhost (solak@localhost) by uci.agh.edu.pl (8.8.3/8.7.3) with SMTP id NAA14651; Tue, 3 Dec 1996 13:07:53 +0100 (MET) Date: Tue, 3 Dec 1996 13:07:53 +0100 (MET) From: Wieslaw Solak X-Sender: solak@galaxy To: "R. Baker Kearfott" Cc: reliable_computing [at] interval [dot] usl.edu Subject: Re: reliable_computing In-Reply-To: <2.2.32.19961116155049.006d3cbc [at] pop [dot] usl.edu> Message-Id: Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-reliable_computing Precedence: bulk Lieber Herr Prof.Kearfott! Ich habe eine scho"nne ideje zum realiziren ein Film uber die Interval Rechnunk, auch fu"r komplexe Zahlen.Geben Sie mir eine suggestion? Mit bestten gru"ssen Ihr ergebener. p.s.die ideje ist auch interesant fu"r real Zahlen W.Solak On Sat, 16 Nov 1996, R. Baker Kearfott wrote: > Dear Colleagues: > > Kluwer has just informed me that my book, > > "Rigorous Global Search: Continuous Problems" > > can be available $60 for classroom use. It is a good idea that anybody > using it for a course specifically mention that they want the adoption > price. > > Although the book is somewhat specialized in places, it contains > many appropriate exercises, and has a sizeable general introduction to > interval computations, automatic differentiation, etc. > > I append my original posting. > > Best regards, > > Baker > > > >> Dear Colleagues: > >> > >> My book, "Rigorous Global Search: Continuous Problems" will be available > >> from Kluwer Academic Publishers by the end of the month. > >> > >> The book treats research results and software in verified solution > >> of nonlinear systems and global optimization. It has an extensive > >> introduction to general theory and techniques. A table of contents and > >> preface are available, in Postscript form, at: > >> > >> http://interval.usl.edu/books/table-of-contents-and-preface.ps > >> > >> The index is available, in Postscript form, at: > >> > >> http://interval.usl.edu/books/index.ps > >> > >> The summary on the back cover and an order form are available at: > >> > >> http://interval.usl.edu/books/Rigorous-Global-Search.txt > >> > >> I am also making my research code, in Fortran 90, available. This > >> code contains automatic differentiation, as described in the book, > >> nonlinear systems code, and code for constrained and unconstrained > >> optimization. Software engineering for neat packaging continues to proceed, > >> and different portions are in different states of polish. The > >> elementary portions (such as the interval arithmetic module) are in the > >> highest state of completion. The nonlinear systems solver is in relatively > >> good shape, while improvements are continuing on the general constrained > >> global optimization part. > >> > >> The package includes a significant collection of test problems, written > >> simply in Fortran 90. Executables for Windows 95 machines (486 or higher) > >> and Sun Sparc machines are available. For source and executables, see: > >> > >> > >> ftp://interval.usl.edu/pub/interval_math/Fortran_90_software/INTOPT_90/"> > >> > >> > >> All of the above URL's can be accessed from my home page at: > >> > >> http://interval.usl.edu/kearfott.html > >> > >> > >> > >> The ISBN for the book is 0-7923-4238-0, and the price is $134.00. > >> For alternate ordering instructions, see: > >> > >> http://www.wkap.nl > >> > >> Best regards, > >> > >> Baker > >> --------------------------------------------------------------- > >> 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 > >> --------------------------------------------------------------- > >> > >> > > > >--------------------------------------------------------------- > 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 Tue Dec 3 10:38:04 1996 Received: by interval.usl.edu id AA00295 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Tue, 3 Dec 1996 20:37:02 -0600 Received: from venus.Sun.COM by interval.usl.edu with SMTP id AA00289 (5.65c/IDA-1.4.4 for ); Tue, 3 Dec 1996 20:36:59 -0600 Received: from Eng.Sun.COM ([129.146.1.25]) by venus.Sun.COM (SMI-8.6/mail.byaddr) with SMTP id SAA20791 for ; Tue, 3 Dec 1996 18:36:54 -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 SAA16636; Tue, 3 Dec 1996 18:36:52 -0800 Received: by gww.eng.sun.com (SMI-8.6/SMI-SVR4) id SAA06269; Tue, 3 Dec 1996 18:38:04 -0800 Date: Tue, 3 Dec 1996 18:38:04 -0800 Message-Id: <199612040238.SAA06269 [at] gww [dot] eng.sun.com> To: reliable_computing [at] interval [dot] usl.edu Subject: FYI: Wanted: Interval SQE Engineer X-Sun-Charset: US-ASCII Sender: owner-reliable_computing Precedence: bulk Software Quality Engineer - Interval Math Are you the type of person who is consumed with finding the 1 cent error in your checkbook or calculating the interest on your 30 year mortgage? Do you consider yourself a math guru? If so, come join us in a fun and challenging work environment where you will have opportunities to help design software to evaluate the accuracy and performance of Interval Math libraries. We're looking for someone who is motivated and interested in advancing the state of the art in interval computation and excited to be the quality engineer for these libraries. Previous testing experience highly desired. Strong math background and interest in Fortran also desired. Hiring Manager: Sandi Yolland +1 (415) 786-3797 sandi.yolland [at] Eng [dot] sun.com From owner-reliable_computing Sun Dec 8 04:17:34 1996 Received: by interval.usl.edu id AA03100 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Sun, 8 Dec 1996 12:17:41 -0600 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA03094 (5.65c/IDA-1.4.4 for ); Sun, 8 Dec 1996 12:17:37 -0600 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA17195; Sun, 8 Dec 96 11:17:34 MST Date: Sun, 8 Dec 96 11:17:34 MST From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9612081817.AA17195 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu Subject: new alias for interval computation webpage Cc: mkosh [at] cs [dot] utep.edu, vladik [at] cs [dot] utep.edu Sender: owner-reliable_computing Precedence: bulk INFORMATION. Thanks to the generosity of Megalith Company, the Interval Computations website has two new aliases. You can still access it at http://cs.utep.edu/interval-comp/main.html but you can now also use http://interval-computations.home.ml.org or http://intcomp.home.ml.org MOTIVATION. We have received several emails from people who accidentally ran across the interval computations homepage and, since it is listed under our University (cs.utep.edu), automatically assumed that this page only reflects what UTEP is doing in this area. We therefore believe it desirable to have an alias for the interval computation homepage that is not related to any particular university and will thus avoid this wrong impression. Misha and Vladik From owner-reliable_computing Sun Dec 8 04:52:11 1996 Received: by interval.usl.edu id AA03713 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Sun, 8 Dec 1996 12:52:18 -0600 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA03707 (5.65c/IDA-1.4.4 for ); Sun, 8 Dec 1996 12:52:13 -0600 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA17320; Sun, 8 Dec 96 11:52:11 MST Date: Sun, 8 Dec 96 11:52:11 MST From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9612081852.AA17320 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu Subject: JAF14: zero announcement Sender: owner-reliable_computing Precedence: bulk >From arithmet [at] logic [dot] pdmi.ras.ru 14th Days of Weak Arithmetics ZERO ANNOUNCEMENT Dear Colleague, In December 1996 13iemes Journees sur les Arithmetiques Faibles (13th Days of Weak Arithmetics) will take place in Metz in France, the country where the Days had been established and took place twelve previous times. Long ago The Days became international in participantship; now they are going to become international geographically. Namely, I'll be happy to organize 14th Days of Weak Arithmetics in 1997 in Saint-Petersburg, Russia. For the success of the meeting to be held for the first time outside France, it is very important to select for the 14th Days the dates suitable for majority of potential participants. To this end I ask you, if you are interested to participate in the 14th DWA, to expess your preferences in possible dates in the following way. ! very suitable + possible ? difficult - impossible Example: Personal preferences of D.Smith for the dates of 14th Days of Weak Arithmetic: May SMTWTFSSMTWTFSSMTWTFS 111111111222222222233 123456789012345678901 ----??????+++!!!!!!!! June SMTWTFSSMTWTFSSMTWTFSSMTWTFSSM 111111111122222222223 123456789012345678901234567890 !!!!!!+++++++??????????------- July TWTFSSMTWTFSSMTWTFSSMTWTFSSMTWT 1111111111222222222233 1234567890123456789012345678901 ----??++++++++++++!!!!!!!!!!!!! End of example Personal preferences of ....... for the dates of 14th Days of Weak Arithmetic: May SMTWTFSSMTWTFSSMTWTFS 111111111222222222233 123456789012345678901 June SMTWTFSSMTWTFSSMTWTFSSMTWTFSSM 111111111122222222223 123456789012345678901234567890 July TWTFSSMTWTFSSMTWTFSSMTWTFSSMTWT 1111111111222222222233 1234567890123456789012345678901 Please, fill in your preferences and send them to: arithmet [at] logic [dot] pdmi.ras.ru (this email address can be used for all correspondence connected with 14th DWA). In present difficult economic situation I can hope to find funds for supporting Russian participants only. Yuri Matiyasevich P.S. The meeting will last for 2 or 3 days. However, if you wish to stay longer in St.Petersburg to collaborate with my colleagues and me, this can be easily organized in the framework of the following program. % __________________________________________________________________________ % % LaTeX (ASCII text at the end of the file) % __________________________________________________________________________ \documentstyle{article} \voffset=-2cm \pagestyle{empty} \begin{document} {\Large The Euler International Mathematical Institute (EIMI) operates from January 1996 as a part of the St.Petersburg Division of the Steklov Mathematical Institute (PDMI) of the Russian Academy of Sciences.} \bigskip \centerline{\LARGE \sc EIMI announces a new ongoing} \medskip \centerline{\LARGE \sc program of scientific collaboration:} \bigskip \medskip \centerline{\huge \bf T{\^E}TE-{\`A}-T{\^E}TE in RUSSIA} \bigskip \medskip {\large The goal of this program is to provide facilities for western and Russian mathematicians (not necessary from St.Petersburg) to meet for joint work. Such a meeting of two or more colleagues could last from a couple of days to several months. \medskip In view of the present difficult economic situation, it is assumed that visitors will find the required funds from other sources. For its part, EIMI will provide offices, (modest) computer facilities (including TeX and INTERNET connection), and access to the libraries of EIMI and PDMI. Visitors are welcome to participate in the regular mathematical seminars of PDMI and the UNIVERSITY and in the meetings of the St.Petersburg Mathematical Society. EIMI will issue invitations as required for obtaining Russian visas and will help in finding (reasonably inexpensive) accommodation. \medskip If you and your colleague(s) in Russia are interested in partici\-pating in this program, please fill in the attached form and e-mail it (with any questions you may have) to \medskip \centerline{\tt admin [at] euler [dot] pdmi.ras.ru} \medskip Acceptance of the application is subject to demand and to events in other EIMI programs. For more information about EIMI activities see our page on WWW: \medskip \centerline{\tt http://www.pdmi.ras.ru} } \newpage \renewcommand{\baselinestretch}{0.9} \centerline{\Large \bf Application for participation in the EIMI program} \medskip \centerline{\LARGE \bf T\^ETE-\`A-T\^ETE IN RUSSIA} \bigskip \bigskip \parbox{70mm}{ {\Large\sc I. Western participant(s)} {\large \begin{itemize} \item[1)] last name \item[2)] given name(s) \item[3)] citizenship \item[4)] degree, title(s) \item[5)] affiliation \item[6)] position \item[7)] mailing address \item[8)] e-mail address \item[9)] phone number \item[10)] FAX number \end{itemize} }} \parbox{70mm}{ {\Large\sc II. Russian participant(s)} {\large \begin{itemize} \item[1)] family name \item[2)] given name \item[3)] patronymic \item[4)] degree, title(s) \item[5)] affiliation \item[6)] position \item[7)] mailing address \item[8)] e-mail address \item[9)] phone number \item[10)] FAX number \end{itemize} }} \medskip {\Large\sc III. Subject and form of proposed joint work} {\large\rule{0mm}{5mm} (a few phrases)} \medskip {\Large\sc IV. Desired duration \dots\dots days/weeks/months in the period from \dots\dots to \dots\dots} \end{document} _________________________________________________________________________ The Euler International Mathematical Institute (EIMI) operates from January 1996 as a part of the St.Petersburg Division of the Steklov Mathematical Institute (PDMI) of the Russian Academy of Sciences. EIMI announces a new ongoing program of scientific collaboration: TETE-A-TETE in RUSSIA The goal of this program is to provide facilities for western and Russian mathematicians (not necessary from St.Petersburg) to meet for joint work. Such a meeting of two or more colleagues could last from a couple of days to several months. In view of the present difficult economic situation, it is assumed that visitors will find the required funds from other sources. For its part, EIMI will provide offices, (modest) computer facilities (including TeX and INTERNET connection), and access to the libraries of EIMI and PDMI. Visitors are welcome to participate in the regular mathematical seminars of PDMI and the UNIVERSITY as well as in the meetings of the St. Peters- burg Mathematical Society. EIMI will issue invitations as required for obtaining Russian visas and will help in finding (reasonably inexpensive) accommodation. If you and your colleague(s) in Russia are interested in participating in this program, please fill in the attached form and e-mail it (with any questions you may have) to admin [at] euler [dot] pdmi.ras.ru Acceptance of the application is subject to demand and to events in other EIMI programs. For more information about EIMI activities see our page on WWW: http://www.pdmi.ras.ru (Cut here)--------------------------------------------------------------- Application for participation in the EIMI program TETE-A-TETE IN RUSSIA I. Western participant(s) 1) last name 2) given name(s) 3) citizenship 4) degree, title(s) 5) affiliation 6) position 7) mailing address 8) e-mail address 9) phone number 10) FAX number II. Russian participant(s) 1) family name 2) given name 3) patronymic 4) degree, title(s) 5) affiliation 6) position 7) mailing address 8) e-mail address 9) phone number 10) FAX number III. Subject and form of proposed joint work (a few phrases) IV. Desired duration ... days/weeks/months in the period from ... to ... ----- End Included Message ----- From owner-reliable_computing Tue Dec 10 06:57:12 1996 Received: by interval.usl.edu id AA05110 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Tue, 10 Dec 1996 16:56:07 -0600 Received: from venus.Sun.COM by interval.usl.edu with SMTP id AA05104 (5.65c/IDA-1.4.4 for ); Tue, 10 Dec 1996 16:56:04 -0600 Received: from Eng.Sun.COM ([129.146.1.25]) by venus.Sun.COM (SMI-8.6/mail.byaddr) with SMTP id OAA03602; Tue, 10 Dec 1996 14:56:02 -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 OAA26610; Tue, 10 Dec 1996 14:55:57 -0800 Received: by gww.eng.sun.com (SMI-8.6/SMI-SVR4) id OAA13801; Tue, 10 Dec 1996 14:57:12 -0800 Date: Tue, 10 Dec 1996 14:57:12 -0800 Message-Id: <199612102257.OAA13801 [at] gww [dot] eng.sun.com> To: reliable_computing [at] interval [dot] usl.edu Subject: Wanted: Interval Fortran Compiler Developer X-Sun-Charset: US-ASCII Sender: owner-reliable_computing Precedence: bulk Job Description: The first assignment for the person hired for this position will be to lead an international team to implement interval arithmetic in a Fortran 90 front-end. This will consist of designing and implementing an interval arithmetic extension to an existing Fortran 90 compiler front-end, including: - Expressions, - Intrinsics, - I/O, - Run-time system, and - Back-end interface. It will be beneficial for the person holding this job to be an evangelist for interval arithmetic, both inside and outside Sun. The ideal candidate for this position will have the following skills, experience, and interests: - Fortran compiler front-end development, - Familiarity with CRI Fortran 90 front-end, - Interval arithmetic implementation, - Numerical analysis, - Interval analysis, - C, and - Solaris The set of people having all these skills may be empty. If you have some of the above and are interested, please send me your resume. Bill Walster Hiring Manager +1 (415) 786-9004 (phone) +1 (414) 786-9551 (fax) bill.walster [at] eng [dot] sun.com From owner-reliable_computing Wed Dec 11 07:31:00 1996 Received: by interval.usl.edu id AA05669 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Wed, 11 Dec 1996 13:32:48 -0600 Received: from boris.mscs.mu.edu by interval.usl.edu with SMTP id AA05663 (5.65c/IDA-1.4.4 for ); Wed, 11 Dec 1996 13:32:03 -0600 Received: by boris.mscs.mu.edu (Smail3.1.28.1 #9) id m0vXuNi-0010tkC; Wed, 11 Dec 96 13:31 CST Message-Id: Date: Wed, 11 Dec 96 13:31 CST From: georgec [at] marque [dot] mscs.mu.edu (Dr. George F. Corliss MU MSCS) To: reliable_computing [at] interval [dot] usl.edu Subject: Who needs intervals? X-Sun-Charset: US-ASCII Sender: owner-reliable_computing Precedence: bulk One of our local Sun representatives got turned on to intervals by a talk Bill Walster gave. He asked me who might be interested in interval technology. I thought others might be interested in my response. > What other types of companies would be interested? Finance? > Manufacturing? Those. Also research efforts such as Bell Labs, Amoco, Motorola, ... in the Chicago area. One reservation is that our interval tools are not yet well developed. What Bill is working on is for Sun to provide easy to use solutions, as easy to use as current applications tools, where the interval engine is hidden under the hood. All you see is the answer, but you don't have to see the workings. We are not there yet. Current interval tools are research tools, requiring understanding on the part of their programmers. Customers will expect that interval solutions are slow. Many interval algorithms are 4 - 100 times slower than approximate algorithms. However, interval global optimization algorithms are often FASTER than approximate algorithms for hard problems because they can safely throw away regions in which the solution is NOT. Hence, they provide guaranteed answers faster than the competition gives (often bad) estimates. Many nonlinear data fitting or parameter identification problems are of that form. Interval techniques are often useful not for the entire computation, but for small, accuracy-critical portions. Ernst Adams et al used an interval ODE solver to detect regions of instability in an experimental testing strategy for industrial turbines and gears. Interval techniques are often used as tools during the development of robust approximate techniques. I once worked on a project with Amoco in oil resevoir simulation. In one sub-sub-sub problem, a Newton iteration was failing. By using interval techniques, we isolated the source of the problem and devised a strategy by which the approximate code worked correctly. Interval techniques are often used to validate approximate production codes. One project I did with IBM wrote an interval quadrature (integration) routine. We compared it with QUADPACK, the then state-of-the-art approximate solver. We found many eaxmples for which the QUADPACK answer was outside our interval, but not a single example for which the QUADPACK answer differed by more than the width of our interval. That is, we verified that the particular QUADPACK routine we tested is VERY reliable. Dr. George F. Corliss Dept. Math, Stat, Comp Sci Marquette University P.O. Box 1881 Milwaukee, WI 53201-1881 USA georgec [at] mscs [dot] mu.edu (414) 288-6599 (office) From owner-reliable_computing Wed Dec 11 22:02:49 1996 Received: by interval.usl.edu id AA00358 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Thu, 12 Dec 1996 04:05:05 -0600 Received: from bp.ucs.usl.edu by interval.usl.edu with SMTP id AA00352 (5.65c/IDA-1.4.4 for ); Thu, 12 Dec 1996 04:05:03 -0600 Received: from rbk5287.usl.edu (rbk5287.usl.edu [130.70.64.43]) by bp.ucs.usl.edu with SMTP id AA05309 (5.65c/IDA-1.4.4 for ); Thu, 12 Dec 1996 04:05:00 -0600 Message-Id: <2.2.32.19961212100249.006e17ac [at] pop [dot] usl.edu> X-Sender: rbk5287 [at] pop [dot] usl.edu X-Mailer: Windows Eudora Pro Version 2.2 (32) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Thu, 12 Dec 1996 04:02:49 -0600 To: reliable_computing [at] interval [dot] usl.edu From: "R. Baker Kearfott" Subject: Special Functions, Proposed Electronic Handbook Sender: owner-reliable_computing Precedence: bulk Dear colleagues: I recently received the appended message concerning a revision of Abramowitz and Stegun. I am posting it to this group, since someone may know of interval-computations-related material that is appropriate to include. Best regards, R. Baker Kearfott >Date: Wed, 11 Dec 96 18:19:28 EST >From: lozier [at] cam [dot] nist.gov (Daniel W Lozier) >To: lozier [at] cam [dot] nist.gov, rbk [at] usl [dot] edu >Subject: Special Functions, Proposed Electronic Handbook > >Greetings! > >A small group from several technical divisions of NIST is approaching key >mathematicians, statisticians, engineers and scientists who are conversant >with special functions. You are receiving this letter because we value >your experience and opinions in this field. > >Undoubtedly you are familiar with the 1000-page compendium edited by >Abramowitz and Stegun, "Handbook of Mathematical Functions (with Formulas, >Graphs, and Mathematical Tables)", first published by the National Bureau >of Standards in 1964, last corrected in 1972, and still in print. (In 1988 >the National Bureau of Standards became the National Institute of Standards >and Technology.) Very preliminary discussions have taken place within NIST >concerning a possible major revision of the Handbook. > >We believe it is time for a thorough review of the Handbook with regard to >the needs of today. Is the overall structure still appropriate? Are there >functions not presently covered that should be added? Are there functions >that should be removed? Is there specific information about each function >that needs to be added or removed? Are there important new mathematical >formulas? Should more emphasis be placed on computational aspects? Should >numerical methods and tables, and should graphical representations, be >augmented or even replaced by computer software? What is the proper role >for numerical, graphical and symbolic software? These kinds of questions >will need to be answered with the assistance of qualified professionals >from around the world, just as was done for the original Handbook. > >We are proposing a revision that would be an electronic publication on the >World Wide Web. It would make full use of advanced communications and >computational resources at NIST to present not only static data but also >the opportunity to obtain made-to-order dynamic information such as graphs, >tables of numerical values and symbolic transformations. A careful refereeing >process would be an integral part of the project. The authoritative status >of the existing Handbook would be preserved for static data and extended >insofar as possible to dynamic information. However, no decisions have been >made. A first step in the decision process is likely to be an invitational >workshop under the auspices of NIST. > >Our purpose in writing to you at this time is simply to ask you if you >agree that a revised and modernized Handbook of Mathematical Functions is a >worthwhile project. Of course, any additional commentary will be received >with gratitude. Your input is needed for our next group meeting in early >January. Please send your response by electronic mail to > > dlozier [at] nist [dot] gov > >or, if you prefer, to > > Daniel W. Lozier > Applied and Computational Mathematics Division > Building 820, Room 365 > National Institute of Standards and Technology > Gaithersburg, MD 20899 > >We thank you in advance for your assistance. > >Sincerely, >Dan Lozier > >NIST Working Group on Handbook Revision >P.T. Boggs, R.F. Boisvert, C.W. Clark, J.E. Devaney, D.W. Lozier, L.C. Maximon, >P.J. Mohr, B.R. Miller, F.W.J. Olver, J.R. Rumble, B. Schneider, C.P. Sturrock > > --------------------------------------------------------------- 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 USL Box 4-1010, Lafayette, LA 70504-1010, USA --------------------------------------------------------------- From owner-reliable_computing Thu Dec 12 00:11:33 1996 Received: by interval.usl.edu id AA00759 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Thu, 12 Dec 1996 10:10:24 -0600 Received: from venus.Sun.COM by interval.usl.edu with SMTP id AA00753 (5.65c/IDA-1.4.4 for ); Thu, 12 Dec 1996 10:10:20 -0600 Received: from Eng.Sun.COM ([129.146.1.25]) by venus.Sun.COM (SMI-8.6/mail.byaddr) with SMTP id IAA06547; Thu, 12 Dec 1996 08:10:18 -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 IAA04893; Thu, 12 Dec 1996 08:10:16 -0800 Received: by gww.eng.sun.com (SMI-8.6/SMI-SVR4) id IAA00743; Thu, 12 Dec 1996 08:11:33 -0800 Date: Thu, 12 Dec 1996 08:11:33 -0800 Message-Id: <199612121611.IAA00743 [at] gww [dot] eng.sun.com> To: reliable_computing [at] interval [dot] usl.edu, rbk [at] usl [dot] edu Subject: Re: Special Functions, Proposed Electronic Handbook X-Sun-Charset: US-ASCII Sender: owner-reliable_computing Precedence: bulk In my opinion, this is a tremendous opportunity for the interval community. It was my inability to compute (with guaranteed accuracy) some of the special functions commonly used in statistics that lead me to begin the effort to promote interval arithmetic. We need to do everything possible to support NIST in this effort. Bill From owner-reliable_computing Sun Dec 15 05:46:00 1996 Received: by interval.usl.edu id AA03747 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Sun, 15 Dec 1996 11:47:04 -0600 Received: from boris.mscs.mu.edu by interval.usl.edu with SMTP id AA03741 (5.65c/IDA-1.4.4 for ); Sun, 15 Dec 1996 11:46:59 -0600 Received: by boris.mscs.mu.edu (Smail3.1.28.1 #9) id m0vZKeO-0010tkC; Sun, 15 Dec 96 11:46 CST Message-Id: Date: Sun, 15 Dec 96 11:46 CST From: georgec [at] marque [dot] mscs.mu.edu (Dr. George F. Corliss MU MSCS) To: reliable_computing [at] interval [dot] usl.edu Subject: re:Who needs intervals? X-Sun-Charset: US-ASCII Sender: owner-reliable_computing Precedence: bulk In response to my comments, Bill Older writes: ----- Begin Included Message ----- From nortel.ca!wolder Thu Dec 12 12:55:09 1996 Date: 12 Dec 1996 12:06 EST Sender: "Bill Older" To: georgec [at] marque [dot] mscs.mu.edu From: "Bill Older" Subject: re:Who needs intervals? Dr. Corliss, I agree with your comments concerning the usefulness of intervals. But the conventional use of intervals that you describe is, I think, only part of the story. I have been working since about 1988 with a technology that combines intervals and constraint processing. The particular combination that I am most fmailiar with is called CLP(BNR) and was developed originally as a sub-system of BNR Prolog during 1988-1992, based on a paper by Dr. John Cleary. Since then other combinations , variants, and improvements have been made : Prolog IV, ILOG, Newton, Helios,... The classical interval techniques can improve the numerical reliability of computation, but leave the traditional functional & iterative structure more or less intact; consequently, there is still a need for algorithms to control the computation (although intervals do provide an opportunity for some novel algorithms) as well as much work to formulate problems in functional terms. When intervals are coupled with constraint concepts, however, one gets a much more radical change as most "control" either disappears completely or gets relegated into some global policy parameters; in place of algorithms one has mostly just (very carefully chosen) statements of the problem and boundary conditions (including their precision!). To a large extent, the same mathematical formulation can be used regardless of which data is given and which is to be sought. Approximate knowledge, asymptotes, limiting cases etc. can all be tossed into the mix and will automatically be used whenever possible. Non-linearities and consequently multiple solutions are in this framework no longer so problematic generally. This technology is still young and really big problems (on the order of weather forecasting say) haven't been tried as yet, but there have been a number of impressive (and little publicised) successes on more modest problems for which conventional solutions are very difficult or (practically) unworkable (because e.g. they get bogged down in overwhelming complexity ). Two of the characteristics of this technolgy deserve special mention: one is that the overall computational structure is logic ( a sort of intuitionit predicate calculus ), and as a consequence general programs for a class of problems tend to have the same sort of structure as the corresponding theory; i.e. the wide gap between "theory" and "code" is absent and numerical computations are always esentially proofs. Second, and still puzzling, is that what is regarde as hard vs easy in this technology is usually very different than in traditional approaches, in many cases almost the opposite. One aspect of this which has major consequences is that, traditionally, one leaves out "details" of a physical problem in order to regularize its mathematical expression, and solution techniques are oriented around these somewhat abstract mathematical idealizations, but we have found that with CLP(BNR) it can be much more effective--and sometimes necessary-- to deal with the problem in its specific, concrete and detailed form. Bill Older ----- End Included Message ----- From owner-reliable_computing Mon Dec 16 11:05:18 1996 Received: by interval.usl.edu id AA04333 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Mon, 16 Dec 1996 04:13:38 -0600 Received: from colorado.univ-orleans.fr by interval.usl.edu with SMTP id AA04326 (5.65c/IDA-1.4.4 for ); Mon, 16 Dec 1996 04:09:04 -0600 Received: from lifo.univ-orleans.fr (jfplc97@localhost) by colorado.univ-orleans.fr (8.6.12/General) with ESMTP id KAA24621; Mon, 16 Dec 1996 10:05:50 +0100 Message-Id: <199612160905.KAA24621 [at] colorado [dot] univ-orleans.fr> X-Authentication-Warning: colorado.univ-orleans.fr: jfplc97 owned process doing -bs X-Mailer: exmh version 1.6 To: APPIAr [at] fct [dot] unl.pt, acclaim [at] sics [dot] se, aiia [at] di [dot] unito.it, alp-list [at] intellektik [dot] informatik.th-darmstadt.de, clp [at] iscs [dot] nus.sg, concurrency [at] cwi [dot] nl, csp-list [at] cert [dot] fr, cup [at] icot [dot] or.jp, dbworld [at] cs [dot] wisc.edu, flprog [at] informatik [dot] uni-muenchen.de, gulp [at] di [dot] unipi.it, linear [at] cs [dot] stanford.edu, lprolog [at] central [dot] cis.upenn.edu, jicslp96 [at] informatik [dot] uni-bonn.de, parforce [at] ecrc [dot] de, prolog-vendors [at] sics [dot] se, quintus-users [at] quintus [dot] com, reliable_computing [at] interval [dot] usl.edu, rewriting [at] loria [dot] fr, theorem-provers [at] ai [dot] mit.edu, benelog [at] cs [dot] kuleuven.ac.be, prolog-pe [at] bach [dot] ces.cwru.edu, compunode [at] compulog [dot] org, clpr-users [at] iscs [dot] nus.sg, csp-list [at] saturne [dot] cert.fr, IDSS [at] socs [dot] uts.edu.au, semantics-list [at] newton [dot] cam.ac.uk Subject: JFPLC'97-CFP Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Date: Mon, 16 Dec 1996 10:05:18 +0100 From: jfplc97 Sender: owner-reliable_computing Precedence: bulk We apologize if you receive this message more than once. Below, you will find the Call for Papers of the JFPLC'97. The Latex- and PostScript versions can be downloaded from the WWW conference site at URL: http://www.univ-orleans.fr/LIFO/jfplc97 Please post and/or forward to all interested colleagues. ------------------------------------------------------------------------------- Second Call for Papers JFPLC'97 Sixth French Conference on Logic and Constraint Programming May 26-28 1997 -- Orle'ans, France http://www.univ-orleans.fr/LIFO/jfplc97 --------------------------------------- The French Conference on Logic and Constraint Programming and UNIF, the International Workshop on Unification, are jointly organized in Orle'ans this year. The aim of the meeting is to review recent research work on the conference topics with a particular focus on the interactions between the different aspects of logic programming, automated deduction, constraint resolution and their application domains. JFPLC'97 follows the series of previous meetings which took place in Clermont-Ferrand (96), Dijon (95), Bordeaux (94), Nimes (93) and Lille (92). * CONFERENCE CHAIR * Ge'rard Ferrand (LIFO, University of Orle'ans, FRANCE) * PROGRAM CHAIR * Fre'de'ric Benhamou (LIFO, University of Orle'ans, FRANCE) * PROGRAM COMMITTEE * Slim Abdennadher .......... (Munich University, GERMANY) Alexander Bockmayr ........ (MPI, Saarbru"cken, GERMANY) Philippe Codognet ......... (INRIA Rocquencourt, FRANCE) Jacques Cohen ............. (Brandeis University, USA) Alain Colmerauer .......... (University of Marseilles, FRANCE) Philippe Devienne ......... (University of Lille, FRANCE) Yves Deville .............. (Catholic University of Louvain, BELGIUM) Franc,ois Fages ........... (CNRS, LIENS, ENS Paris, FRANCE) Laurent Fribourg .......... (CNRS, LIENS, ENS Paris, FRANCE) Franc,oise Gire ........... (University of Paris I, FRANCE) Jean-Louis Imbert ......... (University of Auvergne, FRANCE) Beaudoin Le Charlier ...... (University of Namur, BELGIUM) Ken McAloon ............... (Brooklyn College CUNY, NY, USA) Jean-Franc,ois Puget ...... (ILOG, FRANCE) Olivier Ridoux ............ (University of Rennes, FRANCE) Michael Rusinowitch ....... (CRIN, INRIA Lorraine, FRANCE) Pascal Van Hentenryck ..... (Brown University, USA) Marie-Catherine Vilarem ... (LIRMM, University of Montpellier II, FRANCE) * INVITED LECTURES (TEMPORARY) * John Alan Robinson, Professor Emeritus at Syracuse University Unification and resolution in retrospect Catuscia Palamidessi, Professor at Universita` di Genova, title non available * SCOPE * Papers are welcome on all theoretical or experimental aspects of logic programming and/or constraint programming, including, but not limited to: Semantics Higher-order programming Static Analysis Deductive Databases Theorem Proving Constraint Logic Programming Constraint resolution and optimization Constraint Satisfaction Problems Operations Research Concurrency Parallelism Language Design and Implementation Applications Methodology and environments * SUBMISSIONS * Authors are invited to send papers not exceeding 15 pages (2 pages for posters), formatted according to the JFPLC'97 style (available on the WWW conference site). Papers should contain original, previously unpublished results (neither in a conference nor in a journal). Accepted papers should be presented at the conference. Electronic submissions are strongly encouraged and should be made before January 10, 1997. The e-mail should contain an uuencoded gzipped (or compressed) PostScript file. Details are provided on the WWW page. Authors should also send an e-mail, containing the title, authors, abstract, keywords of the paper and the name, addresses (surface and electronic mail), phone and fax numbers of the main author, to mailto:jfplc97 [at] lifo [dot] univ-orleans.fr before January 4, 1997. When electronic submission is not available, authors should send six copies of the paper (or poster presentation) to the program committee chairman at the conference address before the deadline. * ADDITIONAL INFORMATIONS * The technical program of the conference will include invited conferences, presentations of refereed papers and posters. A full session will be devoted to industrial participants. This session will be jointly organized with Orle'ans-Technopole and will focus on products and applications of Constraint Programming. A special award will be given to the best paper presented by one or several young researchers (none of the authors having defended his PhD. thesis before December 31, 1996). Authors meeting this requirement must mention it when submitting. The conference proceedings will be published by a Herme`s. Official JFPLC'97 languages are French and English. Abstract ........ Jan. 4, 1997 IMPORTANT DATES Submission ...... Jan. 10, 1997 Acceptance ...... Mar. 8, 1997 Final Version ... Apr. 5, 1997 JFPLC'97 -- LIFO -- Faculte' des Sciences SURFACE MAIL Universite' d'Orle'ans -- 4, Rue Le'onard de Vinci B.P. 6759 -- 45067 ORLE'ANS Cedex 2 -- FRANCE ELECTRONIC MAIL mailto:jfplc97 [at] lifo [dot] univ-orleans.fr POSTERS SESSION CHAIR Nirina Andrianarivelo Michel Berge`re, Wadoud Bousdira, Jacques Chabin, Fre'de'ric Goualard, Laurent Granvilliers, ORGANIZING COMMITTEE Arnaud Lallouet, Franc,ois Le Berre, Se'bastien Limet, Pierre Rety, Gilles Richard, Fre'de'ric Saubion, Agne`s Tellez-Arenas, Alexandre Tessier. Ministe`re de l'E'ducation Nationale de l'Enseignement Supe'rieur et de la Recherche, SUPPORTS Re'gion Centre, De'partement du Loiret, Mairie d'Orle'ans, Universite' d'Orle'ans, CNRS, INRIA, Orle'ans-Technopole, HITACHI (Orle'ans), CNET (Issy les Moulineaux). Reception at the Mayor's house (renaissance building) SOCIAL EVENTS Visit of one of the royal Loire castles Banquet on the Loire river banks The UNIF'97 workshop organized by S. Anantharaman UNIF97 (University of Orle'ans) will be held on May 28-30, 1997 in Orle'ans. For any further information, please contact mailto:unif97 [at] lifo [dot] univ-orleans.fr. From owner-reliable_computing Mon Dec 16 20:03:54 1996 Received: by interval.usl.edu id AA04777 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Mon, 16 Dec 1996 12:05:15 -0600 Received: from cesit1.unifi.it by interval.usl.edu with SMTP id AA04771 (5.65c/IDA-1.4.4 for ); Mon, 16 Dec 1996 12:05:07 -0600 Received: from INGFI1.ING.UNIFI.IT by CESIT1.UNIFI.IT (PMDF V5.0-4 #3688) id <01ID372X5ZJK000FPB [at] CESIT1 [dot] UNIFI.IT> for reliable_computing [at] interval [dot] usl.edu; Mon, 16 Dec 1996 19:04:11 +0100 (MET) Date: Mon, 16 Dec 1996 19:03:54 +0100 (MET) From: NESI [at] ingfi1 [dot] ing.unifi.it Subject: CFP: ICECCS'97 To: TO"reliable_computing [at] interval [dot] usl.edu"@ingfi1.ing.unifi.it Message-Id: <961216190354.202006bd [at] ingfi1 [dot] ing.unifi.it> Content-Transfer-Encoding: 7BIT Sender: owner-reliable_computing Precedence: bulk I hope that this message will be usefull for your work. Sorry for multiple copies, PN ------------------------------------------------------------------------ Third IEEE International Conference on ENGINEERING OF COMPLEX COMPUTER SYSTEMS ICECCS'97 Villa Olmo Como, Italy September 8-12, 1997 Held jointly with 5th IEEE Workshop on Real-Time Applications (5th IEEE RTAW= ) SPONSORED BY: IEEE Computer Society - IEEE Technical Committee on Complexity in Computing ICECCS'97 General Chair Mike Hinchey, New Jersey Institute of Technology (USA) and University of Limerick (Ireland) ICECCS'97 Program Co-Chair-The Americas Hassan Gomaa, George Mason University (USA) ICECCS'97 Program Co-Chairs-Europe & Africa Jeffrey Kramer, Imperial College of Science Technology and Medicine (U.K.) Mauro Pezze', Politecnico di Milano (Italy) ICECCS'97 Program Co-Chair-Asia/Oceania Yoshinori Yamaguchi, ETL (Japan) RTAW'97 Co-Chairs Jean-Jacques Schwarz, IUT - University Claude Bernard de Lyon. Lyon (France) Kim Man, City University of Hong Kong, (Hong Kong) Sarah Chodrow, Emory University (USA) ICECCS'97 Industrial/Exhibits Chair Tom Bihari, AMT Systems Engineering Inc. (USA) Benny Graf Mortensen, Institute of Applied Computer Science, IFAD (Denmark) ICECCS'97 Tutorial Chair Alberto Broggi, Universita' di Parma (Italy) Local Arrangements Chair =46rancesco Tisato, Universita' di Milano (Italy) Steering Committee T. Bihari, J. Harauz, S. Howell, T. Ichikawa, A. Stoyenko (Chair) Program Committee M. Adiba, T. Ae, S. Agerholm, V.S. Alagar, P. Ammann, S. F. Andler, M. Ardis, G. Avrunin, J. Bacquet, S.K. Baruah, D. Batory, T. Bihari, D. Bolton, P. Bose, U. Buy, S. Chakravarthy, S.C. Cheung, Z. Chi, S. E. Chodrow, A. Coen Porisini, L. da Fontoura Costa, K. Davis, J.A. de la Puente, R. De Nicola, F. De Paoli, P. Devanbu, L. Dillon, S. Faulk, M. =46elder, A. Finkelstein, B. Furth, C. Ghezzi, L. Guan, W. A. Halang, J. Harauz, C. Heitmayer, B. Holtkamp, S. Howell, T. Ichikawa, D. Jackson, R. Jacquart, G. Johnson, D. Juttelstad, Y. Kakuda, A. Kanevsky, K. Kang, J. Knight, Ph. Laplante, L. Lavazza, D. Lawrence, J.C. Leite, S. Liu, M. R. Lyu, J. Magee, T. J. Marlowe, T. D. Meijler, C. Montangero, R. Milovanovic, L. Motus, P. Nesi, K. Nielsen, L. Nigro, R. L. Nord, S. Nunn, J. Offut, C. E. Pereira, P. T. Poon, F. Saglietti, H. Saiedian, J. Salinas, A. Sch=FCrr, J.J. Schwarz, N. Serbedzija, A Silberman, J. Skubich, N. Suri, A. Stoyenko, I. Suzuki, W.J. Toetenel, G. Tortora, G. Tsai, M. F. Younis, M. Young DESCRIPTION: IEEE Computer Society's Third International Conference on the Engineering of Complex Computer Systems (ICECCS'97) is to be held in Como, Italy, in September 1997. SCOPE: Complex computer systems are common in many sectors, such as manufacturing, communications, defense, transportation, aerospace, hazardous environments, energy, and health care. These systems are frequently distributed over heterogeneous networks, and are driven by many diverse requirements on performance, real-time behavior, fault tolerance, security, adaptability, development time and cost, long life concerns, and other areas. Such requirements frequently conflict, and their satisfaction therefore requires managing the trade-off among them during system development and throughout the entire system life. The goal of this conference is to bring together industrial, academic, and government experts from these disciplines, to determine how the disciplines' problems and solution techniques interact within the whole system. Researchers, practitioners, tool developers and users, and technology transition experts are all welcome. The scope of interest includes long-term research issues, near-term complex system requirements and promising tools; existing complex systems and commercially available tools will be examined on a level playing field. TRACKS/MINI-TRACKS/SESSIONS: - AI and Intelligent Systems (T. Ae, L. Guan) - System and Software Architecture (R. Nord) - Tools, Environments, and Languages (J.A. De La Puente, T. Marlowe, M.F. Younis) - Complex and Real-time Database Systems and Data Management (S. Andler, S.Chakravarthy, K. Davis) - Dependable Real-Time Systems (S. Faulk, R. Jacquart, N. Serbedzija) - Formal Methods (A. Coen Porisini, R. De Nicola, S. Liu) - Software Engineering, Re-engineering, Re-use (V.S. Alagar, P. T. Poon) - Systems Engineering (T. Bihari, C.E. Pereira) - Virtual Reality, Multimedia, Real-Time Imaging (L. Da Fontoura Costa) - Technology Integration (A. Kanevsky) - Networking, Complexity, and Protocol Engineering (Y. Kakuda) - Distributed and Mobile Systems (J. Magee, S.C. Cheung) - Software Process Improvement (H. Saiedian) - Visual Languages and Tools (A. Schuerr) - CSCW and HCI (F. De Paoli) - Interoperability (D. Bolton, A. Finkelstein) - Standards (J. Harauz) - Neural Networks and Fuzzy Systems (Z. Chi) - ESSI Industrial Software Best Practices (J.Bacquet) SUBMISSIONS: Different classes of contributions are sought, ranging from research papers to lessons learned and status reports. The ultimate goal is to build a rich and comprehensive conference program that can fit the interests and needs of different classes of attendees: professionals, researchers, managers, and students. Papers shall describe original research or report industrial experience and shall not exceed 6000 words. Panel proposals shall describe the topic (500 words) and shall include a short CV (maximum 300 words) and a short position paper (maximum 300 words= ) from each panelist. Tutorial proposal (maximum 3000 words) shall describe the material that will be covered in the course and the schedule, and shall include a short CV (maximum 300 words) for each instructor. Tool exhibits are invited. Abstract of 500 words for the special session "ESSI Industrial Software Best Practices" shall describe experiences in technology transfer. Deadlines for submissions of Papers, Panel, and Tutorial proposals is March = 3, 1997. Deadlines for proposals of Tool exhibits is June 3, 1997. Complete papers for ICECCS'97 and RTAW'97 must be sent by March 3, 1997 to: Mike Hinchey Real-Time Computing Laboratory Department of Computer and Information Science New Jersey Institute of Technology University Heights Newark, NJ 07102 USA =46or each paper submitted to ICECCS'97, an electronic abstract must be sent by February 25, 1997 to: iceccs97 [at] elet [dot] polimi.it Authors will be notified by June 5, 1997. Panel proposals must be sent by March 3, 1997 to: Mauro Pezze' Dipartimento di Elettronica e Informazione Politecnico di Milano piazza Leonardo da Vinci 32 I-20133 Milano, Italy Tutorial proposals must be sent by March 3, 1997 to: Alberto Broggi Dipartimento di Ingegneria dell'Informazione Universita` di Parma Viale delle Scienze I-43100 Parma, Italy Abstracts for the special session "ESSI Industrial Software Best Practices" must be sent by June 3, 1997 to: Joel Bacquet European Commission DG III F4 Avenue des Nerviens 105 Office 3/54 B-1040 Brussels, Belgium Proposals of exhibits of research prototypes and commercially available tools and technology must be sent by June 3, 1997 to: Benny Graff Mortensen, IFAD =46orskerparken 10, DK-5230 Odense M, Denmark Electronic submissions will not be considered. An extended version of selected papers of ICECCS97 will be published in a special issue of IEEE Transactions on Software Engineering ICECCS conference series can be monitored via WWW at http://www.elet.polimi.it/iceccs97, or http://www.rtl.njit.edu/iceccs97, or on the IEEE Computer Society home page at http://www.computer.org --------------------------------------------------------------- | Mauro Pezze' | associate professor | Politecnico di Milano | piazza Leonardo da Vinci 32 | 20133 Milano | Italy | | tel: +39-2-2399-3523 | fax: +39-2-2399-3411 | | e-mail: pezze [at] elet [dot] polimi.it -------------------------------------------------------------- From owner-reliable_computing Tue Dec 24 10:18:31 1996 Received: by interval.usl.edu id AA02586 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Tue, 24 Dec 1996 18:18:38 -0600 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA02580 (5.65c/IDA-1.4.4 for ); Tue, 24 Dec 1996 18:18:34 -0600 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA07105; Tue, 24 Dec 96 17:18:31 MST Date: Tue, 24 Dec 96 17:18:31 MST From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9612250018.AA07105 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu Subject: Reliable Computing in 1997 Sender: owner-reliable_computing Precedence: bulk Dear Friends, As you may already know, starting from January 1997, the journal Reliable Computing is going under Kluwer. The corresponding changes in journal policies are described in detail in the interval computations website http://cs.utep.edu/interval-comp (click on the journal). These changes are presented in two new items: * Welcome from Slava Nestrov, Editor-in-Chief; * New in 1997, from Alexander Yakovlev, Managing Editor; and also in General Information, Information for Authors, and Ordering sections. If you do not have access to the web, please email me, I will be glad to send the corresponding files by email. Vladik From owner-reliable_computing Mon Dec 30 04:12:27 1996 Received: by interval.usl.edu id AA01262 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Mon, 30 Dec 1996 12:12:37 -0600 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA01256 (5.65c/IDA-1.4.4 for ); Mon, 30 Dec 1996 12:12:34 -0600 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA06872; Mon, 30 Dec 96 11:12:27 MST Date: Mon, 30 Dec 96 11:12:27 MST From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9612301812.AA06872 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu Subject: interval conference in Mexico City in 1998? Cc: rtrejo [at] campus [dot] cem.itesm.mx, vladik [at] cs [dot] utep.edu Sender: owner-reliable_computing Precedence: bulk Raul Trejo from the Instituto Tecnologico de Monterey, Mexico City (who is currently visiting me) has gotten his Department interested in interval research, and he has the Departmental enthusiastic support in organizing an interval event in Mexico City. Raul and his Department believe that organizing an International workshop or a conference in Mexico City would expose Mexican researchers to the area (and get researchers from other countries the chance to combine interesting talks with exciting sightseeing and "sighttasting" :-) Tecnologico has conference facilities available that are often used for internatioanl meetings, and the institute will be glad to host an interval event. This conference can be one of the regular interval conferences coming to Mexico or a stand-alone conference (like the one in Brazil). It is probably too late to schedule anything for 1997, but, on the other hand, it is best not to delay too much and to capitalize on the existing interest and enthusiasm. Thus, the best time seems to be 1998. Raul has talked with several interval researchers, and several of them, including Professor Dr. Alefeld, are enthusiastic about this idea (actually, Dr. Alefeld said that he has been thinking about a conference in Mexico for some time). For US researchers, Mexico has the additional advantage that for many granting agencies, local travel funds (that are much easier to get than foreign travel) can be used for conferences in Mexico as well. We would like to know whether there is enough interest in the interval community for the big conference, and what is the best time for it. Traditionally, the US interval conferences are held in late February which is a good time for Raul, and the European conferences are mainly in August or September, which is also a good time (beginning of Auguts may be a better time for the US researchers, because our classes start in mid to late August). Please respond to Raul (his mail is in the header). If we have enough interest, we can form an ad hoc organizing committee. Raul volunteers to be the main local organizer, and we hope that Dr. Alefeld will be kind enough to serve as a chair (or as an honorary chair, whicever that means :-) of the international organizing committee. Happy New Year! !Felix Aneo Nuevo! !Bienvenidos a Ciudad de Mexico en 1998! Vladik