From owner-reliable_computing Tue Jun 30 09:56:48 1998 Received: by interval.usl.edu id AA00582 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Wed, 1 Jul 1998 10:30:59 -0500 Received: from mercury.Sun.COM by interval.usl.edu with SMTP id AA00576 (5.65c/IDA-1.4.4 for ); Wed, 1 Jul 1998 10:30:53 -0500 Received: from Eng.Sun.COM (engmail4 [129.144.134.6]) by mercury.Sun.COM (SMI-8.6/mail.byaddr) with SMTP id QAA01955 for ; Tue, 30 Jun 1998 16:56:49 -0700 Received: from thestork.eng.sun.com (thestork.Eng.Sun.COM [129.146.88.47]) by Eng.Sun.COM (SMI-8.6/SMI-5.3) with ESMTP id QAA28479 for ; Tue, 30 Jun 1998 16:56:49 -0700 Received: from gww (gww.Eng.Sun.COM) by thestork.eng.sun.com (Sun Internet Mail Server sims.3.5.1998.06.03.00.09) with SMTP id <0EVE00DDU2IMC1 [at] thestork [dot] eng.sun.com> for reliable_computing [at] interval [dot] usl.edu; Tue, 30 Jun 1998 16:56:47 -0700 (PDT) Date: Tue, 30 Jun 1998 16:56:48 -0700 (PDT) From: William Walster Subject: Regarding the pulication of applications and the Internet 2 To: reliable_computing [at] interval [dot] usl.edu Reply-To: William Walster Message-Id: <0EVE00DDZ2INC1 [at] thestork [dot] eng.sun.com> Mime-Version: 1.0 X-Mailer: dtmail 1.2.1 CDE Version 1.2.1 SunOS 5.6 sun4m sparc Content-Type: TEXT/plain; charset=us-ascii Content-Md5: BGtfKbK8+yn4nAjc6FcQIQ== Sender: owner-reliable_computing Precedence: bulk Dear Reliable Computing readers, Regarding the recent discussion of editorial policy and publishing applications, I have the following comments in support of publishing applications: 1) Computer companies are driven by the need to gain competitive advantage in the market place. They compete by supplying technology that their customers can use to gain advantage over *their* competition. 2) To the extent that intervals can be used to solve important problems with which end users can make money, it makes good business sense to spend some of that money on machines to solve these problems. To the extent that intervals are required, computer companies will be willing to invest in support for intervals in their compilers, hardware, and libraries of solvers. Providing a good interval environment is a competitive advantage if intervals are the key to solving important problems, 3) Support for compilers and tool development will accomplish two things for interval researchers: it will provide a better environment within which interval researchers can develop and test new algorithms; and it will be the source of some funding devoted to basic research in new algorithms and theory. 4) The bottom line is that applications drive the revenue engine on which basic and applied interval research depends. Applications need to solve revenue-generating problems and be capable of scaling to solve large problems that may require clusters of large machines. Important revenue-generating problems are required to justify large machines. Big problems generating huge revenues are great. Journals can help promote intervals by implementing an editorial policy that encourages publication of new and important applications. Regarding connectivity to the future Internet 2: One obvious connection between the Internet 2 and the future of intervals is the use of the Internet 2 to form a super network of computers with which to solve large problems. Interval algorithms are ideally suited for such applications as they are "embarrassingly parallel". To the extent that the Internet 2 is used to develop solutions to real problems of practical import, the interval community will contribute to success of Internet 2 by demonstrating why the government and industry should continue to fund this type of infrastructure. The development of intervals can be thought of as a business with customers. To the extent that interval research helps interval customers to make money, supporting interval R & D is an easy decision to make. Of course, some resources need to be devoted to interval theory and basic research. However, industry is less likely to fund this kind of activity than the government, that is, unless a convincing case can be made that the basic research in question will have large practical payoff. Regards, Bill Walster From owner-reliable_computing Sat Jul 4 01:13:33 1998 Received: by interval.usl.edu id AA02112 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 3 Jul 1998 17:24:53 -0500 Received: from mailserver.di.unipi.it (memphis.di.unipi.it) by interval.usl.edu with SMTP id AA02106 (5.65c/IDA-1.4.4 for ); Fri, 3 Jul 1998 17:24:48 -0500 Organization: Dipartimento di Informatica di Pisa - Italy Received: from mox.di.unipi.it (mox.di.unipi.it [131.114.4.238]) by mailserver.di.unipi.it (8.8.8/8.8.8) with SMTP id XAA18132; Fri, 3 Jul 1998 23:19:39 +0200 (MET DST) Message-Id: <3.0.5.32.19980703231333.007a1aa0 [at] mailserver [dot] di.unipi.it> X-Sender: bista [at] mailserver [dot] di.unipi.it (Unverified) X-Mailer: QUALCOMM Windows Eudora Light Version 3.0.5 (32) Date: Fri, 03 Jul 1998 23:13:33 +0200 To: (Recipient list suppressed) From: Stefano Bistarelli Subject: CP98: Telecom application contest Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Sender: owner-reliable_computing Precedence: bulk --------------------------------------------------------------------- The Fourth International Conference on Principles and Practice of Constraint Programming (CP98) (Pisa, Italy, October 26-30, 1998) http://www.di.unipi.it/cp98/ is organizing a TELECOM APPLICATION CONTEST --------------------------------------------------------------------- CP98, the annual conference on constraint programming, is organizing a contest for constraint-based systems, or algorithms, or programs, to tackle telecommunication applications. Telecom Italia, the company handling Italian telecommunications, will support the contest by providing the award for the winner of the contest, which will be a cellular phone. Moreover, Telecom Italia is also supporting the conference. The aim of this contest is to stimulate the use of constraints to develop useful applications in the field of telecommunications. The applications we have in mind involve not only telephone communications, but also data communications, picture broadcasting, and Internet. The submission, in the form of short application descriptions, will be judged according to several criteria, among which are the following: significance, originality, cost-effectiveness, usefulness, quality (commercial or just prototype). The committee which will judge the submissions and select the winner will include the following people: -- Jean-Francois Puget (ILOG), CP98 program co-chair; -- Michael Maher (Griffith University), CP98 program co-chair; -- Remo Pareschi (Telecom Italia), Telecom Italia research director. The winner will receive the following: -- the opportunity to present his/her work at the conference during the main program; -- five pages in the conference proceedings to publish a short description of his/her application; -- a cellular phone. However, the judges reserve the right to not award the prize. To participate to the CP98 Telecom application contest, send a five-page (LNCS format) description of your application, in postscript format, by e-mail (with subject: CP98 Telecom contest) to cp98 [at] di [dot] unipi.it, by August 30, 1998. The winner will be notified by September 15, 1998. Additional updated information about this contest can be found at the CP98 web site. From owner-reliable_computing Sat Jul 4 00:51:29 1998 Received: by interval.usl.edu id AA02331 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 3 Jul 1998 17:35:58 -0500 Received: from mailserver.di.unipi.it (memphis.di.unipi.it) by interval.usl.edu with SMTP id AA02324 (5.65c/IDA-1.4.4 for ); Fri, 3 Jul 1998 17:35:55 -0500 Organization: Dipartimento di Informatica di Pisa - Italy Received: from mox.di.unipi.it (mox.di.unipi.it [131.114.4.238]) by mailserver.di.unipi.it (8.8.8/8.8.8) with SMTP id WAA17835; Fri, 3 Jul 1998 22:55:53 +0200 (MET DST) Message-Id: <3.0.5.32.19980703225129.0079db00 [at] mailserver [dot] di.unipi.it> X-Sender: bista [at] mailserver [dot] di.unipi.it (Unverified) X-Mailer: QUALCOMM Windows Eudora Light Version 3.0.5 (32) Date: Fri, 03 Jul 1998 22:51:29 +0200 To: (Recipient list suppressed) From: Stefano Bistarelli Subject: Final CFP: CP98 workshop on set constraints and constraint-based program analysis Mime-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable Sender: owner-reliable_computing Precedence: bulk --------------------------------------------------------------------- CALL FOR PAPERS --------------------------------------------------------------------- CP98 Workshop on Set Constraints and Constraint-based Program Analysis (http://www.mpi-sb.mpg.de/~podelski/conferences/sc98.html) --------------------------------------------------------------------- Pisa, Italy 30 October 1998 --------------------------------------------------------------------- (in conjunction with the Fourth International Conference on Principles and Practice of Constraint Programming, http://www.di.unipi.it/cp98/) --------------------------------------------------------------------- Scope: The first uses of set constraints date back at least to John Reynold's early work on program analysis in 1969. In the last decade there has been a significant increase in the interest in set constraints, with major advances both in the foundations of set constraints as well as in applications. Meanwhile, constraints have become a core technology in areas such as types and program analysis. Constraint-based approaches have led to many algorithmic and conceptual advances in type inference (particularly subtypes), data-flow analysis, control-flow analysis, binding-time analysis, and sorted-unification. Many of these works directly use set constraints; other used equational and constraint theories of which set constraints are a generalization. Organizing Committee: Alexander Aiken (UC Berkeley, U.S.A.) Harald Ganzinger (Max Planck Institute, Germany) Nevin Heintze (Bell Laboratories, U.S.A.) Fritz Henglein (DIKU, University of Copenhagen) Joxan Jaffar (National University of Singapore) Bruno Legeard (Univ. of Franche-Comt=E9, France) David McAllester (AT&T Laboratories, U.S.A.) Leszek Pacholski (University of Wroclaw, Poland) Jens Palsberg (Purdue University) Andreas Podelski (Max Planck Institute, Germany) Jean-Francois Puget (ILOG, France) Jakob Rehof (Microsoft Research, U.S.A.) Sophie Tison (University of Lille, France) Submission Details: Authors are invited to submit short papers (2-8 pages) for presentation at the workshop, by email to podelski@mpi-sb.mpg.de. Papers may describe preliminary or partial results as well as finished research. Position papers are also welcome. Topics of interest include, but are not limited to: - decision procedures and algorithms, - applications, - implementation, - connections with other areas such as model checking. The aim of this workshop is to bring together researchers working on all aspects of set constraints, and provide a forum for discussing novel applications, implementation, new results and open problems. We also hope that the workshop will give a sense of the diversity of set constraints applications, and in so doing generate new problems, approaches, and opportunities. Submissions deadline: July 15, 1998 Acceptance decisions: August 20 Camera-ready deadline: September 20 Workshop: October 30 From owner-reliable_computing Sat Jul 4 01:07:34 1998 Received: by interval.usl.edu id AA02747 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 3 Jul 1998 17:44:23 -0500 Received: from mailserver.di.unipi.it (memphis.di.unipi.it) by interval.usl.edu with SMTP id AA02740 (5.65c/IDA-1.4.4 for ); Fri, 3 Jul 1998 17:44:21 -0500 Organization: Dipartimento di Informatica di Pisa - Italy Received: from mox.di.unipi.it (mox.di.unipi.it [131.114.4.238]) by mailserver.di.unipi.it (8.8.8/8.8.8) with SMTP id XAA18014; Fri, 3 Jul 1998 23:13:40 +0200 (MET DST) Message-Id: <3.0.5.32.19980703230734.007a4330 [at] mailserver [dot] di.unipi.it> X-Sender: bista [at] mailserver [dot] di.unipi.it (Unverified) X-Mailer: QUALCOMM Windows Eudora Light Version 3.0.5 (32) Date: Fri, 03 Jul 1998 23:07:34 +0200 To: (Recipient list suppressed) From: Stefano Bistarelli Subject: CP98 registration form Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Sender: owner-reliable_computing Precedence: bulk You can now register to the Fourth International Conference on Principles and Practice of Constraint Programming (CP98), that will be held in Pisa, Italy, on October 26-30, 1998. You may find the registration and accomodation form, as well as all the details about the conference, at the following URL: http://www.di.unipi.it/cp98 If you have problems using the web, you may contact us at cp98 [at] di [dot] unipi.it. Looking forward to seeing you in Pisa! From owner-reliable_computing Sat Jul 4 11:53:05 1998 Received: by interval.usl.edu id AA03278 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Sat, 4 Jul 1998 18:53:13 -0500 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA03272 (5.65c/IDA-1.4.4 for ); Sat, 4 Jul 1998 18:53:09 -0500 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA00489; Sat, 4 Jul 98 17:53:05 MDT Date: Sat, 4 Jul 98 17:53:05 MDT From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9807042353.AA00489 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu, interval [at] cs [dot] utep.edu Subject: MISC99. 2nd CFP. ** EXTENDED DEADLINE ** Sender: owner-reliable_computing Precedence: bulk ----- Begin Included Message ----- From misc99 [at] silver [dot] udg.es Fri Jul 3 09:04:59 1998 Date: Fri, 03 Jul 1998 17:01:36 +0200 From: MISC 99 Organization: Universitat de Girona X-Mailer: Mozilla 4.05 [en] (Win95; I) Mime-Version: 1.0 To: misc99 [at] silver [dot] udg.es Subject: MISC99. 2nd CFP. ** EXTENDED DEADLINE ** Content-Type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: 8bit Content-Length: 5360 Update: Paper submission extended deadline: September 30, 1998. http://eia.udg.es/~misc99 MISC'99 Workshop on: Applications of Interval Analysis to Systems and Control with special emphasis on recent advances in Modal Interval Analysis 24-26 February 1999 University of Girona Girona, Spain Presentation During the last years, Interval Analysis has been widely applied to solve open problems in Systems and Control Engineering. For instance, problems like analysis and synthesis of robust controllers for uncertain plants or fuzzy inference has been stated from the interval point of view. Other fields where the use of Interval Analysis is increasing are qualitative, semiqualitative and interval simulation and their application to fault detection and diagnosis and to systems identification. All these applications benefit of the ability of intervals to manipulate imprecise data, keep track of truncation and round-off errors and reliability, but they suffer the main weakness of the classical Interval Analysis: too conservative results are often obtained when the range of a function is computed. The aims of this workshop are: 1.to present recent advances in applications of Interval Analysis in Control, focusing on the limitations and drawbacks of Classical Interval Analysis, 2.to present recent advances on the Modal Interval Analysis, a new paradigm on uncertainty representation, and some of its recent applications to control, 3.to analise and discuss, in the context of Modal Interval Analysis, open problems in the field of Control Systems where Classical Interval Analysis is used and fails or seems to be limited. Topics The workshop will focus on four main topics: Modal Interval Analysis: Modal Interval Analysis will be presented with recent results and applications. Open Problems: Authors are encouraged to submit theoretical or practical open problems which may be considered as interval problems, but their resolution goes beyond Classical Interval Analysis. Interval Applications to Control: The following topics will be considered but not restricted to robust control design, identification, fuzzy control, robustness analysis, signal processing, etc. Interval Simulation: Interval modelling. Qualitative, semi-qualitative and interval simulation. Applications to fault detection and diagnosis. Organised by: Department of Informatics and Applied Mathematics, University of Girona Institut d'Inform`tica i Aplicacions, University of Girona Workshop chair Chairman: Ernest Gardeqes, Universitat de Barcelona - Spain International Program Committee: Josep Aguilar-Martin, Universitat de Girona - Spain Ernest Gardeqes, Universitat de Barcelona - Spain J|ergen Garloff, Fachoschule Konstanz - Germany Luc Jaulin, Universiti d'Angers - France Vladik Kreinovich, University of Texas, El Paso - USA Victor Krymsky, Ufa State Aviation Eng. Univ.- Russia Svetoslav Markov, Inst. of Mathematics and Comp. Sci - Bulgaria Mario Milanese, Politecnico di Torino - Italia Joseba Quevedo, Polytechnical University of Catalonia - Spain Josi Rodellar, Polytechnical University of Catalonia - Spain Sergei Shary, Inst. of Comp. Tec. Novosibirsk- Rusia Louise Trave-Massuyes LAAS, Toulouse - France Eric Walter, Lab. des Sig. et Syst, CNRS-SUPELEC - France Paper submission Five copies of full papers of no more than 15 pages including abstract, references, figures, and tables (one column format, 11pt Times font, and A4 paper) should to be received by conference organizers by September 30. All papers must be submitted in hard copy form. No paper will be accepted by fax or in electronic form. Submission adress Dr. Josep Vehm Control Engineering and Intelligent Systems Group Campus Montilivi. Edifici P-II University of Girona E-17071 Girona (Spain) Important dates September 30, 1998 : Full paper submissions November 30, 1998 : Notification of acceptance/rejection December 20, 1988 : Camera-ready copy due & Registration February 24-26, 1999 : Workshop will be held Participation Fee The workshop participation fee (incorporating the organization costs, the refreshments during the breaks, lunches, the proceedings volume containing full papers, the banquet dinner and a short sightseeing tour) will be 23000 Spanish pesetas (~150 US Dollars). Publication All the presented papers will be published in a proceedings volume. Financial Aid Limited funds are expected to be available to assist a small number of student authors and authors from developing countries, who will attend the Workshop with a paper accepted. Girona Information Girona is a small city in the north-east of Spain, situated 100 km northerly from Barcelona and about 30 km from some of the nicest beaches of the Mediterranean. The city of Girona, an interesting historical environment, full of narrow medieval streets, is an excellent meeting place which will allow discussions and for sharing experience. -- VISIT MISC'99 WWW PAGE: http://eia.udg.es/~misc99 ----- End Included Message ----- From owner-reliable_computing Sat Jul 4 12:50:21 1998 Received: by interval.usl.edu id AA03616 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Sat, 4 Jul 1998 19:50:27 -0500 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA03610 (5.65c/IDA-1.4.4 for ); Sat, 4 Jul 1998 19:50:24 -0500 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA00648; Sat, 4 Jul 98 18:50:21 MDT Date: Sat, 4 Jul 98 18:50:21 MDT From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9807050050.AA00648 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu Subject: interval-based geometric software Sender: owner-reliable_computing Precedence: bulk Dear Friends, For your information: there is a free C++ geometric modeller SvLis that is substantially based on interval arithmetic, which has been successfully applied to manufacturing, robotics, archeology, etc. It has been developed at the University of Bath, England, by a team headed by Dr. Ardian Bowyer. For information, see http://www.bath.ac.uk/~ensab/G_mod/Svlis/svlis.html (you can also click on SvLis if you go to the interval computations website http://cs.utep.edu/interval-comp, and then click on interval software). Yours Vladik From owner-reliable_computing Sun Jul 5 07:03:24 1998 Received: by interval.usl.edu id AA04145 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Sun, 5 Jul 1998 14:03:35 -0500 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA04139 (5.65c/IDA-1.4.4 for ); Sun, 5 Jul 1998 14:03:31 -0500 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA02293; Sun, 5 Jul 98 13:03:24 MDT Date: Sun, 5 Jul 98 13:03:24 MDT From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9807051903.AA02293 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu Subject: new interval-based Java applets Sender: owner-reliable_computing Precedence: bulk Dear Friends, Links to several interval-based Java applets have been added to the Interval Software part of the Interval Computations website http://cs.utep.edu. You can also access them directly: http://www.zib.de/kuehn/Java1.0/Gradient.html Rigorous Gradient Calculator; Computes the gradient of a function using rigorous interval arithmetic. http://www.zib.de/kuehn/Java1.0/TestPlot2d.html Rigorous Graphing Applet; Graphs functions and finds their roots. http://www.zib.de/kuehn/dynamic/Ivp.html Cascade Applet; Rigorously solves the initial value problem for discrete, planar maps. Thanks to Dr. Kuehn for the links. Vladik From owner-reliable_computing Sun Jul 5 08:15:13 1998 Received: by interval.usl.edu id AA04484 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Sun, 5 Jul 1998 15:15:18 -0500 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA04478 (5.65c/IDA-1.4.4 for ); Sun, 5 Jul 1998 15:15:15 -0500 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA02453; Sun, 5 Jul 98 14:15:13 MDT Date: Sun, 5 Jul 98 14:15:13 MDT From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9807052015.AA02453 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu Subject: this link may be of interest Sender: owner-reliable_computing Precedence: bulk This link may be of interest: Optimization with Sensitivity Analysis http://ubmail.ubalt.edu/~harsham/refop/Refop.htm From owner-reliable_computing Wed Jul 8 05:13:44 1998 Received: by interval.usl.edu id AA05912 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Wed, 8 Jul 1998 10:13:41 -0500 Received: from bp.ucs.usl.edu by interval.usl.edu with SMTP id AA05906 (5.65c/IDA-1.4.4 for ); Wed, 8 Jul 1998 10:13:38 -0500 Received: from rbk5287.usl.edu (rbk5287.usl.edu [130.70.64.43]) by bp.ucs.usl.edu (8.8.7/8.8.7/ucs-server_1.1) with SMTP id KAA02380 for ; Wed, 8 Jul 1998 10:13:35 -0500 (CDT) Message-Id: <2.2.32.19980708151344.008d8a94 [at] pop [dot] usl.edu> X-Sender: rbk5287 [at] pop [dot] usl.edu X-Mailer: Windows Eudora Pro Version 2.2 (32) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Wed, 08 Jul 1998 10:13:44 -0500 To: reliable_computing [at] interval [dot] usl.edu From: "R. Baker Kearfott" Subject: mail disruptions for rbk [at] usl [dot] edu Sender: owner-reliable_computing Precedence: bulk If people have had mail bounce from my address rbk [at] usl [dot] edu during the past five days, rest assured that this disruption is temporary. We just moved to a new system, and the mail aliasing program was broken. Staff are diligently working on it. In the mean time, email can reach me at rbk5287 [at] usl [dot] edu My apologies to people to whom this message is irrelevant. Sincerely, 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 USL Box 4-1010, Lafayette, LA 70504-1010, USA --------------------------------------------------------------- From owner-reliable_computing Fri Jul 17 12:46:54 1998 Received: by interval.usl.edu id AA08687 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 17 Jul 1998 03:47:22 -0500 Received: from wrzx07.rz.uni-wuerzburg.de by interval.usl.edu with SMTP id AA08681 (5.65c/IDA-1.4.4 for ); Fri, 17 Jul 1998 03:47:17 -0500 Received: from wi2x44.informatik.uni-wuerzburg.de (root [at] wi2x44 [dot] informatik.uni-wuerzburg.de [132.187.10.44]) by wrzx07.rz.uni-wuerzburg.de (8.8.8/8.8.8) with ESMTP id KAA30638; Fri, 17 Jul 1998 10:46:55 +0200 (MET DST) Received: from informatik.uni-wuerzburg.de by wi2x44.informatik.uni-wuerzburg.de (8.8.5/uniwue-C-3.3) id KAA00444; Fri, 17 Jul 1998 10:46:54 +0200 Message-Id: <35AF0F7E.C789C1B6 [at] informatik [dot] uni-wuerzburg.de> Date: Fri, 17 Jul 1998 10:46:54 +0200 From: "J.Wolff v. Gudenberg" X-Mailer: Mozilla 4.04 [en] (X11; I; Linux 2.0.32 i586) Mime-Version: 1.0 To: Chenyi Hu , reliable_computing [at] interval [dot] usl.edu Subject: Re: interval BLAS document for review References: <9807071025.ZM1288 [at] happy [dot] dt.uh.edu> Content-Type: multipart/mixed; boundary="------------051C81CA126E792EF8B1D4F6" Sender: owner-reliable_computing Precedence: bulk This is a multi-part message in MIME format. --------------051C81CA126E792EF8B1D4F6 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Chenyi Hu wrote: > > Hello, Friends, > > The BLAST Forum is considering to include a chapter on > interval BLAS. A draft document is available for review > at > http://happy.dt.uh.edu/~hu/INTBLAS/Interval_BLAS.ps > > Your comments on the draft document will be highly > appreciated. > > Information on the BLAST Forum can be found at the URL: > http://www.netlib.org/utk/papers/blast-forum.html > > Chenyi Hu > > -- > Ph.D., Associate Professor, Computer and Mathematical Sciences > > Center for Computational Science and Advanced Distributed Simulation > University of Houston-Downtown Phone: 713 221-8414 > One Main Street Fax: 713 221-8086 > Houston, Texas 77002 E-mail: CHu [at] uh [dot] edu > > http://happy.dt.uh.edu/~hu/Hu.html > -- Dear colleagues, please find my comments as an attachment Juergen Wolff v Gudenberg __o \<, ___________________()/ ()__________________ Prof. Dr. J. Wolff v. Gudenberg Lehrstuhl fuer Informatik II wolff [at] informatik [dot] uni-wuerzburg.de Universitaet Wuerzburg Tel. 0931 / 888-5517 Am Hubland Fax. 0931 / 888-4602 D-97074 Wuerzburg URL http://www-info2.informatik.uni-wuerzburg.de/staff/wvg --------------------------------------------- --------------051C81CA126E792EF8B1D4F6 Content-Type: application/x-tex; name="comment.tex" Content-Transfer-Encoding: 7bit Content-Disposition: inline; filename="comment.tex" \documentclass{article} \begin{document} \title{ Comments on the Draft for Level 1 Interval BLAS Standard\\ BLAST Forum, 7/7/98} \author {J. Wolff v. Gudenberg} \maketitle \section{General Statement} {\bf I think the draft has to be revised completely.} Besides several typing errors and other language faults the contents is misleading and unclear. In my opinion the standard has to describe the following essentials for interval Blas routines: \begin{itemize} \item Consider only machine intervals, i.e. the endpoints are machine floating-point numbers. \item All operations thus have to use directed rounding. \item Every result must contain the result of the corresponding powerset operation. \item The enclosure shall be as sharp as possible. \end{itemize} The first item is totally warped in the draft. Fact is, that we can not represent arbitrary real numbers, hence constants for $\pi$ etc. have to be provided. But then, we have machine intervals everywhere ! We can consider a machine interval as one representation of a real number, the sharper the bounds are, the more information we have. If directed rounding is not available or very expensive, but faithful rounding is provided, then the operations may be performed by round-out of floating-point approximations for the endpoints. These technical details shall be encapsulated in the algorithms and not visible for the user. \section{Detailed Comments} The draft uses "real" for real number as well as for double precision floating-point. this has to be clarified. A.3.2:\\ Drop the note on scale operation: We do not deal with real numbers ! $\epsilon$ inflation is missing A.3.3:\\ A specific operation where one operand is a floating-point vector makes sense, since it is more efficient. "display of error messages" shall be replaced by a call of a proper language specific exception handling A.3.4:\\ The specification should not rule out the optimally accurate dot product. Hence \[ \{\sum_0^{n-1}{x_i * y_i} | x_i \in X_i, y_i \in Y_i\} \subseteq z\] The dot product should be a function rather than a procedure. A.3.5:\\ directed norms may be helpful for several verifying algorithms. A.4.3:\\ Overlap is $\not$ disjoint, hence only one is necessary. A.4:\\ A containment of a floating-point vector in an interval vector is missing. \end{document} --------------051C81CA126E792EF8B1D4F6-- From owner-reliable_computing Mon Jul 20 14:30:23 1998 Received: by interval.usl.edu id AA09799 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Mon, 20 Jul 1998 08:36:50 -0500 Received: from songoku.udg.es by interval.usl.edu with SMTP id AA09792 (5.65c/IDA-1.4.4 for ); Mon, 20 Jul 1998 08:36:42 -0500 Received: from narola.udg.es by songoku.udg.es with SMTP (1.37.109.4/16.2) id AA16737; Mon, 20 Jul 98 12:30:22 +0200 Message-Id: <35B31C3F.EF907066 [at] eia [dot] udg.es> Date: Mon, 20 Jul 1998 12:30:23 +0200 From: MISC 99 Organization: Universitat de Girona X-Mailer: Mozilla 4.05 [en] (WinNT; I) Mime-Version: 1.0 To: misc99 [at] silver [dot] udg.es Subject: MISC99. 2nd CFP. ** EXTENDED DEADLINE ** Content-Type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: 8bit Sender: owner-reliable_computing Precedence: bulk Update: Paper submission extended deadline: September 30, 1998. http://eia.udg.es/~misc99 MISC'99 Workshop on: Applications of Interval Analysis to Systems and Control with special emphasis on recent advances in Modal Interval Analysis 24-26 February 1999 University of Girona Girona, Spain Presentation During the last years, Interval Analysis has been widely applied to solve open problems in Systems and Control Engineering. For instance, problems like analysis and synthesis of robust controllers for uncertain plants or fuzzy inference has been stated from the interval point of view. Other fields where the use of Interval Analysis is increasing are qualitative, semiqualitative and interval simulation and their application to fault detection and diagnosis and to systems identification. All these applications benefit of the ability of intervals to manipulate imprecise data, keep track of truncation and round-off errors and reliability, but they suffer the main weakness of the classical Interval Analysis: too conservative results are often obtained when the range of a function is computed. The aims of this workshop are: 1.to present recent advances in applications of Interval Analysis in Control, focusing on the limitations and drawbacks of Classical Interval Analysis, 2.to present recent advances on the Modal Interval Analysis, a new paradigm on uncertainty representation, and some of its recent applications to control, 3.to analise and discuss, in the context of Modal Interval Analysis, open problems in the field of Control Systems where Classical Interval Analysis is used and fails or seems to be limited. Topics The workshop will focus on four main topics: Modal Interval Analysis: Modal Interval Analysis will be presented with recent results and applications. Open Problems: Authors are encouraged to submit theoretical or practical open problems which may be considered as interval problems, but their resolution goes beyond Classical Interval Analysis. Interval Applications to Control: The following topics will be considered but not restricted to robust control design, identification, fuzzy control, robustness analysis, signal processing, etc. Interval Simulation: Interval modelling. Qualitative, semi-qualitative and interval simulation. Applications to fault detection and diagnosis. Organised by: Department of Informatics and Applied Mathematics, University of Girona Institut d'Inform`tica i Aplicacions, University of Girona Workshop chair Chairman: Ernest Gardeqes, Universitat de Barcelona - Spain International Program Committee: Josep Aguilar-Martin, Universitat de Girona - Spain Ernest Gardeqes, Universitat de Barcelona - Spain J|ergen Garloff, Fachoschule Konstanz - Germany Luc Jaulin, Universiti d'Angers - France Vladik Kreinovich, University of Texas, El Paso - USA Victor Krymsky, Ufa State Aviation Eng. Univ.- Russia Svetoslav Markov, Inst. of Mathematics and Comp. Sci - Bulgaria Mario Milanese, Politecnico di Torino - Italia Joseba Quevedo, Polytechnical University of Catalonia - Spain Josi Rodellar, Polytechnical University of Catalonia - Spain Sergei Shary, Inst. of Comp. Tec. Novosibirsk- Rusia Louise Trave-Massuyes LAAS, Toulouse - France Eric Walter, Lab. des Sig. et Syst, CNRS-SUPELEC - France Paper submission Five copies of full papers of no more than 15 pages including abstract, references, figures, and tables (one column format, 11pt Times font, and A4 paper) should to be received by conference organizers by September 30. All papers must be submitted in hard copy form. No paper will be accepted by fax or in electronic form. Submission adress Dr. Josep Vehm Control Engineering and Intelligent Systems Group Campus Montilivi. Edifici P-II University of Girona E-17071 Girona (Spain) Important dates September 30, 1998 : Full paper submissions November 30, 1998 : Notification of acceptance/rejection December 20, 1988 : Camera-ready copy due & Registration February 24-26, 1999 : Workshop will be held Participation Fee The workshop participation fee (incorporating the organization costs, the refreshments during the breaks, lunches, the proceedings volume containing full papers, the banquet dinner and a short sightseeing tour) will be 23000 Spanish pesetas (~150 US Dollars). Publication All the presented papers will be published in a proceedings volume. Financial Aid Limited funds are expected to be available to assist a small number of student authors and authors from developing countries, who will attend the Workshop with a paper accepted. Girona Information Girona is a small city in the north-east of Spain, situated 100 km northerly from Barcelona and about 30 km from some of the nicest beaches of the Mediterranean. The city of Girona, an interesting historical environment, full of narrow medieval streets, is an excellent meeting place which will allow discussions and for sharing experience. -- VISIT MISC'99 WWW PAGE: http://eia.udg.es/~misc99 From owner-reliable_computing Mon Jul 20 03:06:52 1998 Received: by interval.usl.edu id AA10145 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Mon, 20 Jul 1998 10:06:26 -0500 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA10139 (5.65c/IDA-1.4.4 for ); Mon, 20 Jul 1998 10:06:24 -0500 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA04554; Mon, 20 Jul 98 09:06:52 MDT Date: Mon, 20 Jul 98 09:06:52 MDT From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9807201506.AA04554 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu Subject: conference in global optimization Sender: owner-reliable_computing Precedence: bulk From: Panos Pardalos Date: Sat, 18 Jul 98 13:13:02 EDT Subject: Conference on Advances in Convex Analysis and Global Optimization PRELIMINARY ANNOUNCEMENT Conference on "Advances in Convex Analysis and Global Optimization" Honoring the memory of C. Caratheodory (1873-1950) Date: June 5-9, 2000 Location: Pythagorion - Samos, Greece Organizers: Nicolas Hadjisavvas and Dimitrios Kandilakis University of the Aegean, Greece Panos Pardalos University of Florida, USA The conference on Advances in Convex Analysis and Global Optimization aims at fostering the cooperation among practitioners and theoreticians in the fields of convex analysis and global optimization. Several invited talks will report on original research (both theoretical and experimental) in all areas of convex analysis and global optimization, including surveys of important recent results/directions. The conference will be held in the city of Pythagorion, on the island of Samos, Greece. Samos, an island of astonishing natural beauty and very old history is located in the Northeast Aegean sea, and is the birthplace of Pythagoras, Epikouros and Aristarchos. Additional information on travel and local accommodations will be provided at a later date. More information on the conference can be obtained from the organizers. From owner-reliable_computing Tue Jul 21 20:54:28 1998 Received: by interval.usl.edu id AA10836 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Tue, 21 Jul 1998 15:18:22 -0500 Received: from mailserver.di.unipi.it (memphis.di.unipi.it) by interval.usl.edu with SMTP id AA10830 (5.65c/IDA-1.4.4 for ); Tue, 21 Jul 1998 15:18:15 -0500 Organization: Dipartimento di Informatica di Pisa - Italy Received: from mox.di.unipi.it (mox.di.unipi.it [131.114.4.238]) by mailserver.di.unipi.it (8.8.8/8.8.8) with SMTP id SAA17209; Tue, 21 Jul 1998 18:59:24 +0200 (MET DST) Message-Id: <3.0.5.32.19980721185428.0079e810 [at] mailserver [dot] di.unipi.it> X-Sender: bista [at] mailserver [dot] di.unipi.it (Unverified) X-Mailer: QUALCOMM Windows Eudora Light Version 3.0.5 (32) Date: Tue, 21 Jul 1998 18:54:28 +0200 To: (Recipient list suppressed) From: Stefano Bistarelli Subject: CP98 Telecom contest: earlier deadline Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Sender: owner-reliable_computing Precedence: bulk ******************************************************************** ATTENTION!!! THIS IS A REVISED CALL: -- THE DEADLINE HAS BEEN ANTICIPATED TO AUGUST 20 -- SUBMISSIONS SHOULD BE SENT TO cp98-telecom [at] di [dot] unipi.it ******************************************************************** --------------------------------------------------------------------- The Fourth International Conference on Principles and Practice of Constraint Programming (CP98) (Pisa, Italy, October 26-30, 1998) http://www.di.unipi.it/cp98/ is organizing a TELECOM APPLICATION CONTEST --------------------------------------------------------------------- CP98, the annual conference on constraint programming, is organizing a contest for constraint-based systems, or algorithms, or programs, to tackle telecommunication applications. Telecom Italia, the company handling Italian telecommunications, will support the contest by providing the award for the winner of the contest, which will be a cellular phone. Moreover, Telecom Italia is also supporting the conference. The aim of this contest is to stimulate the use of constraints to develop useful applications in the field of telecommunications. The applications we have in mind involve not only telephone communications, but also data communications, picture broadcasting, and Internet. The submission, in the form of short application descriptions, will be judged according to several criteria, among which are the following: significance, originality, cost-effectiveness, usefulness, quality (commercial or just prototype). The committee which will judge the submissions and select the winner will include the following people: -- Henry Kautz (AT&T Labs); -- Ora Lassila (Nokia Research Center); -- Claude Le Pape (Bouygues Telecom), Head of R&D Departement; -- Michael Maher (Griffith University), CP98 program co-chair; -- Jean-Francois Puget (ILOG), CP98 program co-chair; -- Remo Pareschi (Telecom Italia), Telecom Italia research director. The winner will receive the following: -- the opportunity to present his/her work at the conference during the main program; -- five pages in the conference proceedings to publish a short description of his/her application; -- a cellular phone. However, the judges reserve the right to not award the prize. To participate to the CP98 Telecom application contest, send a five-page (LNCS format, no page numbers) description of your application, in postscript format, by e-mail (with subject: CP98 Telecom contest) to cp98-telecom [at] di [dot] unipi.it, by August 20, 1998. The winner will be notified by August 30, 1998. Additional updated information about this contest can be found at the CP98 web site. From owner-reliable_computing Sun Jul 26 14:58:37 1998 Received: by interval.usl.edu id AA12255 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Sun, 26 Jul 1998 22:03:58 -0500 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA12249 (5.65c/IDA-1.4.4 for ); Sun, 26 Jul 1998 21:59:26 -0500 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA02741; Sun, 26 Jul 98 20:58:37 MDT Date: Sun, 26 Jul 98 20:58:37 MDT From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9807270258.AA02741 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu, interval [at] cs [dot] utep.edu Subject: Re: SIAM'98 Sender: owner-reliable_computing Precedence: bulk 1998 SIAM Annual Meeting: Interval Highlights Toronto, Canada, July 13-17, 1998 George Corliss and Ramon Moore The 1998 Annual meeting of the Society for Industrial and Applied Mathematics (SIAM) was held in Toronto, Canada, 13-17 July. Focuses of the meeting were financial modeling and biological modeling. Attendance was good, and participation and enthusiasm were high. Seven of the 78 scheduled minisymposia were interval oriented, giving a well-balanced overview of recent progress in interval computations, representing major strides forward in every direction, since the early beginnings. The talks were well-attended and well-received. Martin Berz described a method used by his COSY INFINITY software for the accurate computation of particle trajectories in accelerator rings. His method handles the wrapping effect in modest systems of ODEs by expanding the solution in a multi-dimensional Taylor series in time and in the initial conditions. He does not propagate an enclosing box from one step to the next. Instead, the mapping of an initial box, induced by the differential flow, is followed by multivariate Taylor polynomials with point coefficients plus small interval remainders, effectively eliminating "the wrapping effect". Pascal Van Hentenryck, Fr\'{e}d\'{e}ric Benhamou, and Jean-Francois Puget described the commercial Numerica package, which uses constraint processing techniques to solve nonlinear systems and global optimization problems, perhaps with constraints. Numerica solves many problems at a time proportional to problem dimension and has solved problems in several hundred dimensions. Jean-Francois described applications solved for Chrysler's Neon and Ford's transmission design. Pascal intends to extend some constraint processing techniques to validated solution of ordinary differential equations. Rudolf Lohner, Ole Stauning, and Ned Nedialkov reported on software for validated solution of ODEs and strategies for step size control and control of the wrapping effect. The old restriction by constant a priori bounds to Euler steps has been replaced by several variants of a priori polynomial enclosures and validation by Taylor series plus remainder. Ned Nedialkov and Robert Rihm described validated methods suitable for stiff ODEs based on implicit Taylor series methods. Ned showed several examples for which his implicit Hermite-Obreshkov methods are more efficient than forward interval Taylor series methods. John Pryce and Weldon Lodwick showed how validated methods can also be applied to differential algebraic equations (DAEs). Pryce extracts a certain linear programming problem from the DAE. The solution to the LP tells us the sequence in which to compute the Taylor coefficients for differential and algebraic components. Then, high order Taylor polynomials can be generated and passed to the ODE stepping components of software by Lohner, Stauning, or Nedialkov. Baker Kearfott presented the SunSoft Globsol package for validated solution of nonlinear systems and global optimization problems, perhaps with constraints. GlobSol has solved simple problems in up to 256 dimensions and more realistic problems in as many as 100 dimensions. Paul Thalacker, Paulina Chin, and George Corliss presented prototypical industrial applications of importance in finance, mechanical and electrical engineering, medicine, and symbolic computations. Zhe Liu, in a minisymposium on numerical analysis, discussed the C++ implementation of interval arithmetic operations in the IEEE floating-point standard, following the interval exception-handling model proposed by Chiraev and Walster at Sun. I. Burkhan Turksen discussed uses of interval computation in the theory of fuzzy sets, logic, and measures, and Ulrike Storck discussed adaptive validated quadrature algorithms. In many ways, it was the applications of validated techniques we found most exciting. In addition to the particle accelerators of Berz and the GlobSol applications already mentioned, Vladik Kreinovich talked about aerospace applications, John Funge about robots and intelligent agents, Jon Rokne about geometric primitives in computer graphics, Luis Seco about quantum mechanics, and Ramon Moore about practical applications from range safety at the Pacific Missile Range in the 1960's to quantum mechanics, atomic physics, vortex sheet motions, and beam physics in the 1990s. He also proposed an application to the calculation of closest approaches of asteroids and comets. We are already organizing minisymposia and talks for next year's SIAM Annual Meeting in Atlanta, May 12-15, and interval sessions for several applications areas. Please feel welcome to participate and spread the word, or contact George Corliss (georgec [at] mscs [dot] mu.edu) for suggestions. From owner-reliable_computing Sun Jul 26 18:37:10 1998 Received: by interval.usl.edu id AA12432 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Mon, 27 Jul 1998 03:42:31 -0500 Received: from aruba.U.Arizona.EDU by interval.usl.edu with SMTP id AA12418 (5.65c/IDA-1.4.4 for ); Mon, 27 Jul 1998 03:37:59 -0500 Received: from localhost (karnum@localhost) by aruba.u.arizona.edu (8.8.8/8.8.8) with SMTP id BAA43042 for ; Mon, 27 Jul 1998 01:37:11 -0700 Date: Mon, 27 Jul 1998 01:37:10 -0700 (MST) From: Karnum Shashidhar Reply-To: Karnum Shashidhar To: reliable_computing [at] interval [dot] usl.edu Subject: A very basic query. Message-Id: Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-reliable_computing Precedence: bulk Hi : I am sorry to bother you with a basic question like this,I don't know whether I should bring up such a question here,Any answers will be greatly appreciated. I am a graduate student in Industrial Engineering.I have recently entered into a project which requires the use of Interval mathematics. Being a beginner, I had a very basic question in the method of Interval propagation. My question: I was going to the work of Interval propagation of Dr.Hyvonen: "Constraint reasoning based on Interval arithmetic,the tolerance propagation approach" Artificial Intelligence,1992. If we take three interval variables, representing the length, breadth and area of a rectangle, say L,B and A respectively. if L=[3,5] and B=[10,12] and A=[30,50], The constraint being A= L*B. By taking the notion of solution functions. It appears that no further refinement of the intervals is possible using the algorithm for local propagation,However if we take L=5 and W=12.We get A = 60 which does not lie in the given interval.Is this an inconsistency?(Physically it is not right to use the area interval given since we get a value that lies outside the interval assigned to the Area). Could you please help? Sincerely Karnum --------------------------------------------------------------------------- Karnum Shashidhar 1815,E.Speedway Blvd,#D110 Tucson,AZ 85719 Ph:(520)326-8194 From owner-reliable_computing Mon Jul 27 16:26:17 1998 Received: by interval.usl.edu id AA12971 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Mon, 27 Jul 1998 08:37:49 -0500 Received: from rig9.rose.de ([193.141.168.87]) by interval.usl.edu with SMTP id AA12965 (5.65c/IDA-1.4.4 for ); Mon, 27 Jul 1998 08:37:43 -0500 Received: from rig9.rose.de (marc [at] rig9 [dot] rose.de [192.9.200.9]) by rig9.rose.de (8.8.8/8.8.8) with SMTP id OAA13312; Mon, 27 Jul 1998 14:26:18 +0200 Date: Mon, 27 Jul 1998 14:26:17 +0200 (MEST) From: Marc Dzaebel To: Karnum Shashidhar Cc: reliable_computing [at] interval [dot] usl.edu Subject: Re: A very basic query. In-Reply-To: Message-Id: Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-reliable_computing Precedence: bulk On Mon, 27 Jul 1998, Karnum Shashidhar wrote: > Hi : > I am sorry to bother you with a basic question like this,I don't know > whether I should bring up such a question here,Any answers will be greatly > appreciated. Your'e not wrong her, however Dr. Eero Hyvonen may have a better answer. > I am a graduate student in Industrial Engineering.I have recently entered > into a project which requires the use of Interval mathematics. What is it? > Being a beginner, I had a very basic question in the method of Interval > propagation. > > My question: > I was going to the work of Interval propagation of Dr.Hyvonen: > "Constraint reasoning based on Interval arithmetic,the tolerance > propagation approach" > Artificial Intelligence,1992. That's a really good contribution, isn't it! > If we take three interval variables, representing the length, breadth and > area of a rectangle, say L,B and A respectively. > if L=[3,5] and B=[10,12] and A=[30,50], The constraint being A= L*B. > By taking the notion of solution functions. It appears that no further > refinement of the intervals is possible using the algorithm for > local propagation,However if we take L=5 and W=12.We get A = 60 which does > not lie in the given interval.Is this an inconsistency?(Physically it is > not right to use the area interval given since we get a value that lies > outside the interval assigned to the Area). > Could you please help? > Sincerely > Karnum I just modeled your example in 'rodon' and got same results. This is the trace of our constraint satisfaction: 1)1.Karnum(= A/1:{[30 50]} (* B/1:{[10 12]} L/1:{[3 5]})) 0: (INTS* ([10 12]) ([3 5])) 0: returned ([30 60]) 2)2.Karnum(= L/1:{[3 5]} (/ A/1:{[30 50]} B/1:{[10 12]})) 0: (INTS/ A/1:{[30 50]} B/1:{[10 12]}) 0: returned {[2.5 5]} 3)3.Karnum(= B/1:{[10 12]} (/ A/1:{[30 50]} L/1:{[3 5]})) 0: (INTS/ A/1:{[30 50]} L/1:{[3 5]}) 0: returned {[6 50/3]} No interval had to be reduced. This is in fact a global consistent solution even if there are combinations of points that are inconsistent. It depends on how you define your formula. Whether you mean 'it EXISTS(A,L,B) with ...' or 'for ALL(A,L,B) with ...'. Hyvoenen's approach solves the first question, which is a resonable assumption. Think about following formula: A:[1 2] = B:[1 2] Choosing A=1 and B=2 would be inconsistent even if you can't reduce the intervals, do you? The intervals are only a method of viewing the results in a compact form. To make a correct representation of the formular you would need to gather infinite many vectors of point combinations (global consistence) You get local consistence by tolerance propagation. However Hyvoenen implemented several methods in his new company that computes global solutions. Yours, Marc Dzaebel, R.O.S.E. Informatik: marc [at] rose [dot] de marc [at] acco [dot] net http://www.rose.de http://home.earthlink.net/~rig/ +49 (0)7321/9593-14 > --------------------------------------------------------------------------- > Karnum Shashidhar > 1815,E.Speedway Blvd,#D110 > Tucson,AZ 85719 > > Ph:(520)326-8194 From owner-reliable_computing Mon Jul 27 08:22:24 1998 Received: by interval.usl.edu id AA13535 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Mon, 27 Jul 1998 13:23:06 -0500 Received: from bp.ucs.usl.edu by interval.usl.edu with SMTP id AA13529 (5.65c/IDA-1.4.4 for ); Mon, 27 Jul 1998 13:23:04 -0500 Received: from rbk5287.usl.edu (rbk5287.usl.edu [130.70.64.43]) by bp.ucs.usl.edu (8.9.1/8.9.1/ucs-server_1.2) with SMTP id NAA11457 for ; Mon, 27 Jul 1998 13:23:00 -0500 (CDT) Message-Id: <2.2.32.19980727182224.008b3880 [at] pop [dot] usl.edu> X-Sender: rbk5287 [at] pop [dot] usl.edu X-Mailer: Windows Eudora Pro Version 2.2 (32) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Mon, 27 Jul 1998 13:22:24 -0500 To: reliable_computing [at] interval [dot] usl.edu From: "R. Baker Kearfott" Subject: Re: A very basic query. Sender: owner-reliable_computing Precedence: bulk At 01:37 AM 7/27/98 -0700, you wrote: >If we take three interval variables, representing the length, breadth and >area of a rectangle, say L,B and A respectively. >if L=[3,5] and B=[10,12] and A=[30,50], The constraint being A= L*B. >By taking the notion of solution functions. It appears that no further >refinement of the intervals is possible using the algorithm for >local propagation,However if we take L=5 and W=12.We get A = 60 which does >not lie in the given interval.Is this an inconsistency?(Physically it is >not right to use the area interval given since we get a value that lies >outside the interval assigned to the Area). >Could you please help? It hinges on how you interpret the given intervals. If L and B are given sharp bounds, we would compute A = [30,60]. That range for A is the precise range of L and B as the point values range over the intervals. If all three are considered to be (possibly non-sharp) bounds on actual point values, then we can POSSIBLY do something to make some of them narrower, based on the condition relating length, width, and area. In particular, as you know, we may solve for L: L = [3,5] .intersect. [30,50]/[10,12] = [3,5] .intersect. [2.5,5] = [3,5] , no decrease. B = [10,12] .intersect. [30,50]/[3,5] = [10,12] .intersect. [6,16.66...] = [10,12], no decrease. Yes, in this case, you are right; it is not possible to decrease the widths further using just the formula for the area. This may or may not be so in other specific instances. (For example, if one of L and B were a point, i.e. a 'thin' interval, then we definitely could reduce the other one further in such a situation. In the case you gave, there is a value from B for every value from L that gives a value in A, and visa versa.) If it is necessary to reduce widths further, it may be useful in such situations to introduce additional conditions. 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 USL Box 4-1010, Lafayette, LA 70504-1010, USA --------------------------------------------------------------- From owner-reliable_computing Wed Jul 28 01:34:25 1999 Received: by interval.usl.edu id AA14004 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Mon, 27 Jul 1998 16:48:13 -0500 Received: from pulsar.univ-valenciennes.fr by interval.usl.edu with SMTP id AA13998 (5.65c/IDA-1.4.4 for ); Mon, 27 Jul 1998 16:45:29 -0500 Received: from albop.univ-valenciennes.fr (albop.univ-valenciennes.fr [193.50.192.239]) by pulsar.univ-valenciennes.fr (8.8.8/jtpda-5.3) with ESMTP id XAA04214 ; Mon, 27 Jul 1998 23:46:30 +0100 (WET DST) Received: from univ-valenciennes.fr (datar11.univ-valenciennes.fr [193.50.192.210]) by albop.univ-valenciennes.fr (8.6.12/kit5.1-1804) with ESMTP id XAA02582 ; Mon, 27 Jul 1998 23:36:20 +0100 Message-Id: <379E25E1.43EA0BEC@univ-valenciennes.fr> Date: Tue, 27 Jul 1999 23:34:25 +0200 From: Sylvain PIECHOWIAK X-Mailer: Mozilla 4.05 [en] (Win95; I) Mime-Version: 1.0 To: "R. Baker Kearfott" Cc: reliable_computing [at] interval [dot] usl.edu Subject: Re: A very basic query. References: <2.2.32.19980727182224.008b3880 [at] pop [dot] usl.edu> Content-Type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: quoted-printable X-Mime-Autoconverted: from 8bit to quoted-printable by pulsar.univ-valenciennes.fr id XAA04214 Sender: owner-reliable_computing Precedence: bulk R. Baker Kearfott wrote: > At 01:37 AM 7/27/98 -0700, you wrote: > > >If we take three interval variables, representing the length, breadth = and > >area of a rectangle, say L,B and A respectively. > >if L=3D[3,5] and B=3D[10,12] and A=3D[30,50], The constraint being A=3D= L*B. > >By taking the notion of solution functions. It appears that no further > >refinement of the intervals is possible using the algorithm for > >local propagation,However if we take L=3D5 and W=3D12.We get A =3D 60 = which does > >not lie in the given interval.Is this an inconsistency?(Physically it = is > >not right to use the area interval given since we get a value that lie= s > >outside the interval assigned to the Area). > >Could you please help? > > It hinges on how you interpret the given intervals. > > If L and B are given sharp bounds, we would compute A =3D [30,60]. Tha= t > range for A is the precise range of L and B as the point values range > over the intervals. > > If all three are considered to be (possibly non-sharp) bounds on actual > point values, then we can POSSIBLY do something to make some of them na= rrower, > based on the condition relating length, width, and area. In particular= , > as you know, we may solve for L: > > L =3D [3,5] .intersect. [30,50]/[10,12] > =3D [3,5] .intersect. [2.5,5] > =3D [3,5] , no decrease. > > B =3D [10,12] .intersect. [30,50]/[3,5] > =3D [10,12] .intersect. [6,16.66...] > =3D [10,12], no decrease. > > Yes, in this case, you are right; it is not possible to decrease the > widths further using just the formula for the area. This may or may > not be so in other specific instances. (For example, if one of L and > B were a point, i.e. a 'thin' interval, then we definitely could > reduce the other one further in such a situation. In the case you gave= , > there is a value from B for every value from L that gives a value > in A, and visa versa.) > > If it is necessary to reduce widths further, it may be useful in such > situations to introduce additional conditions. > > Best regards, > > Baker Hi, I agree with answers from R. Baker Kearfott and Marc Dzaebel, the problem= you talk about is well known in CSP (Constraint Satisfaction Problem) community. O= ne technique to resolve CSP consists in 2 steps : 1) local propagation 2) enumerating solutions. The second step is necessary with local propagatio= n because this one is not complete: after local propagation all the solutions can b= e found in the resulting CSP but there are some possible instantiation of variabl= es that are not solution. Example: domain of A, B and C is {a,b}, and the constraint between A, B a= nd C is : A <> B, B <> C, A <> C. We can not remove any value from the domains of A= , B and C whit local propagation. But there is no solution of this problem ! Best regards, Excuse my very bad english !! Dr Sylvain Piechowiak, Universit=E9 de Valenciennes Email: sylvain.piechowiak@univ-valenciennes.fr From owner-reliable_computing Tue Jul 28 12:24:47 1998 Received: by interval.usl.edu id AA14398 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Tue, 28 Jul 1998 03:18:07 -0500 Received: from rig9.rose.de ([193.141.168.87]) by interval.usl.edu with SMTP id AA14392 (5.65c/IDA-1.4.4 for ); Tue, 28 Jul 1998 03:17:53 -0500 Received: from rig9.rose.de (marc [at] rig9 [dot] rose.de [192.9.200.9]) by rig9.rose.de (8.8.8/8.8.8) with SMTP id KAA31461; Tue, 28 Jul 1998 10:24:47 +0200 Date: Tue, 28 Jul 1998 10:24:47 +0200 (MEST) From: Marc Dzaebel To: Sylvain PIECHOWIAK Cc: "R. Baker Kearfott" , reliable_computing [at] interval [dot] usl.edu Subject: Re: A very basic query. In-Reply-To: <379E25E1.43EA0BEC@univ-valenciennes.fr> Message-Id: Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Content-Transfer-Encoding: QUOTED-PRINTABLE Sender: owner-reliable_computing Precedence: bulk On Tue, 27 Jul 1999, Sylvain PIECHOWIAK wrote: > R. Baker Kearfott wrote: >=20 > > At 01:37 AM 7/27/98 -0700, you wrote: > > > > >If we take three interval variables, representing the length, breadth = and > > >area of a rectangle, say L,B and A respectively. > > >if L=3D[3,5] and B=3D[10,12] and A=3D[30,50], The constraint being A= =3D L*B. > > >By taking the notion of solution functions. It appears that no further > > >refinement of the intervals is possible using the algorithm for > > >local propagation,However if we take L=3D5 and W=3D12.We get A =3D 60 = which does > > >not lie in the given interval.Is this an inconsistency?(Physically it = is > > >not right to use the area interval given since we get a value that lie= s > > >outside the interval assigned to the Area). > > >Could you please help? > > > > It hinges on how you interpret the given intervals. > > > > If L and B are given sharp bounds, we would compute A =3D [30,60]. Tha= t > > range for A is the precise range of L and B as the point values range > > over the intervals. > > > > If all three are considered to be (possibly non-sharp) bounds on actual > > point values, then we can POSSIBLY do something to make some of them na= rrower, > > based on the condition relating length, width, and area. In particular= , > > as you know, we may solve for L: > > > > L =3D [3,5] .intersect. [30,50]/[10,12] > > =3D [3,5] .intersect. [2.5,5] > > =3D [3,5] , no decrease. > > > > B =3D [10,12] .intersect. [30,50]/[3,5] > > =3D [10,12] .intersect. [6,16.66...] > > =3D [10,12], no decrease. > > > > Yes, in this case, you are right; it is not possible to decrease the > > widths further using just the formula for the area. This may or may > > not be so in other specific instances. (For example, if one of L and > > B were a point, i.e. a 'thin' interval, then we definitely could > > reduce the other one further in such a situation. In the case you gave= , > > there is a value from B for every value from L that gives a value > > in A, and visa versa.) > > > > If it is necessary to reduce widths further, it may be useful in such > > situations to introduce additional conditions. > > > > Best regards, > > > > Baker >=20 > Hi, >=20 > I agree with answers from R. Baker Kearfott and Marc Dzaebel, the problem= you talk > about is well known in CSP (Constraint Satisfaction Problem) community. O= ne > technique to resolve CSP consists in 2 steps : 1) local propagation 2) > enumerating solutions. The second step is necessary with local propagatio= n because > this one is not complete: after local propagation all the solutions can b= e found > in the resulting CSP but there are some possible instantiation of variabl= es that > are not solution. >=20 > Example: domain of A, B and C is {a,b}, and the constraint between A, B a= nd C is : > A <> B, B <> C, A <> C. We can not remove any value from the domains of A= , B and C > whit local propagation. But there is no solution of this problem ! >=20 > Best regards, Excuse my very bad english !! >=20 > Dr Sylvain Piechowiak, Universit=E9 de Valenciennes > Email: sylvain.piechowiak@univ-valenciennes.fr Thats a popular CSP example. Note, A <> A has same properties e.g. if A is interval valued. This shows again the need of symbolic elimination methods to support local propagation (at least for mathematical constraints) Yours, Marc From owner-reliable_computing Tue Jul 28 01:13:19 1998 Received: by interval.usl.edu id AA14863 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Tue, 28 Jul 1998 06:13:26 -0500 Received: from boris.mscs.mu.edu by interval.usl.edu with SMTP id AA14857 (5.65c/IDA-1.4.4 for ); Tue, 28 Jul 1998 06:13:22 -0500 Received: by boris.mscs.mu.edu (Smail3.1.28.1 #9) id m0z17h2-001HchC; Tue, 28 Jul 98 06:13 CDT Message-Id: From: georgec [at] mscs [dot] mu.edu (Dr. George F. Corliss MU MSCS) Subject: Re: A very basic query. To: karnum [at] U [dot] Arizona.EDU Date: Tue, 28 Jul 1998 06:13:19 -0500 (CDT) Cc: reliable_computing [at] interval [dot] usl.edu In-Reply-To: from "Karnum Shashidhar" at Jul 27, 98 01:37:10 am X-Mailer: ELM [version 2.4 PL25] Mime-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Content-Length: 1148 Sender: owner-reliable_computing Precedence: bulk Karnum, You might also consider @BOOK { VanHentenryck1997a, AUTHOR = "Pascal {Van Hentenryck} and Laurent Michel and Yves Deville", TITLE = "Numerical: A Modeling Language for Global Optimization", PUBLISHER = "MIT Press", SERIES = "", ADDRESS = "Cambridge, Mass.", YEAR = "1997", REFERRED = "", COMMENTS = "", KEYWORDS = "", ABSTRACT = "", } See also www.ilog.com/html/press_numerica.html First commercial interval solver from ILOG Solving nonlinear equations is often a nontrivial problem. ILOG Numerica allows you to solve many seemingly impossible nonlinear problems. It embodies recent advances in the theories of constraint-based programming and numerical analysis as described in a MIT-Press book titled Numerica, a Modeling Language for Global Optimization by Pascal Van Hentenryck, Laurent Michel, and Yves Deville. 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; CorlissG [at] Marquette [dot] edu http://www.mscs.mu.edu/~georgec/ Office: 414-288-6599; Dept: 288-7375; Fax: 288-5472 From owner-reliable_computing Thu Jul 30 18:16:39 1998 Received: by interval.usl.edu id AA16118 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 31 Jul 1998 11:33:02 -0500 Received: from mailserver.di.unipi.it (memphis.di.unipi.it) by interval.usl.edu with SMTP id AA16112 (5.65c/IDA-1.4.4 for ); Fri, 31 Jul 1998 11:32:55 -0500 Organization: Dipartimento di Informatica di Pisa - Italy Received: from mox.di.unipi.it (mox.di.unipi.it [131.114.4.238]) by mailserver.di.unipi.it (8.8.8/8.8.8) with SMTP id QAA12871; Fri, 31 Jul 1998 16:21:18 +0200 (MET DST) Message-Id: <3.0.5.32.19980730161639.00797d50 [at] mailserver [dot] di.unipi.it> X-Sender: bista [at] mailserver [dot] di.unipi.it (Unverified) X-Mailer: QUALCOMM Windows Eudora Light Version 3.0.5 (32) Date: Thu, 30 Jul 1998 16:16:39 +0200 To: (Recipient list suppressed) From: Stefano Bistarelli Subject: Final CFP: CP98 workshop on set constraints and constraint-based program analysis Mime-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable Sender: owner-reliable_computing Precedence: bulk ******************************************************************** ATTENTION!!!=20 THIS IS A REVISED CALL: -- THE DEADLINE HAS BEEN POSTICIPATED TO AUGUST 28 -- SUBMISSIONS SHOULD BE SENT TO cp98-telecom [at] di [dot] unipi.it ******************************************************************** --------------------------------------------------------------------- CALL FOR PAPERS --------------------------------------------------------------------- CP98 Workshop on Set Constraints and Constraint-based Program Analysis (http://www.mpi-sb.mpg.de/~podelski/conferences/sc98.html) --------------------------------------------------------------------- Pisa, Italy 30 October 1998 --------------------------------------------------------------------- (in conjunction with the Fourth International Conference on Principles and Practice of Constraint Programming, http://www.di.unipi.it/cp98/) --------------------------------------------------------------------- Scope: The first uses of set constraints date back at least to John Reynold's early work on program analysis in 1969. In the last decade there has been a significant increase in the interest in set constraints, with major advances both in the foundations of set constraints as well as in applications. Meanwhile, constraints have become a core technology in areas such as types and program analysis. Constraint-based approaches have led to many algorithmic and conceptual advances in type inference (particularly subtypes), data-flow analysis, control-flow analysis, binding-time analysis, and sorted-unification. Many of these works directly use set constraints; other used equational and constraint theories of which set constraints are a generalization. Organizing Committee: Alexander Aiken (UC Berkeley, U.S.A.) Harald Ganzinger (Max Planck Institute, Germany) Nevin Heintze (Bell Laboratories, U.S.A.) Fritz Henglein (DIKU, University of Copenhagen) Joxan Jaffar (National University of Singapore) Bruno Legeard (Univ. of Franche-Comt=E9, France) David McAllester (AT&T Laboratories, U.S.A.) Leszek Pacholski (University of Wroclaw, Poland) Jens Palsberg (Purdue University) Andreas Podelski (Max Planck Institute, Germany) Jean-Francois Puget (ILOG, France) Jakob Rehof (Microsoft Research, U.S.A.) Sophie Tison (University of Lille, France) Submission Details: Authors are invited to submit short papers (2-8 pages) for presentation at the workshop, by email to podelski@mpi-sb.mpg.de. Papers may describe preliminary or partial results as well as finished research. Position papers are also welcome. Topics of interest include, but are not limited to: - decision procedures and algorithms, - applications, - implementation, - connections with other areas such as model checking. The aim of this workshop is to bring together researchers working on all aspects of set constraints, and provide a forum for discussing novel applications, implementation, new results and open problems. We also hope that the workshop will give a sense of the diversity of set constraints applications, and in so doing generate new problems, approaches, and opportunities. Submissions deadline: July 15, 1998 Workshop: October 30 From owner-reliable_computing Fri Jul 31 14:48:22 1998 Received: by interval.usl.edu id AA16257 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 31 Jul 1998 11:44:22 -0500 Received: from mailserver.di.unipi.it (memphis.di.unipi.it) by interval.usl.edu with SMTP id AA16250 (5.65c/IDA-1.4.4 for ); Fri, 31 Jul 1998 11:44:18 -0500 Organization: Dipartimento di Informatica di Pisa - Italy Received: from mox.di.unipi.it (mox.di.unipi.it [131.114.4.238]) by mailserver.di.unipi.it (8.8.8/8.8.8) with SMTP id QAA12729; Fri, 31 Jul 1998 16:16:10 +0200 (MET DST) Message-Id: <3.0.5.32.19980731124822.007a1e90 [at] mailserver [dot] di.unipi.it> X-Sender: bista [at] mailserver [dot] di.unipi.it (Unverified) X-Mailer: QUALCOMM Windows Eudora Light Version 3.0.5 (32) Date: Fri, 31 Jul 1998 12:48:22 +0200 To: (Recipient list suppressed) From: Stefano Bistarelli Subject: Final CFP: CP98 workshop on Modeling and Computing with Concurrent Constraint Programming Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Sender: owner-reliable_computing Precedence: bulk --------------------------------------------------------------------- CALL FOR PAPERS --------------------------------------------------------------------- CP98 Workshop on Modeling and Computing with Concurrent Constraint Programming (http://www.ueda.info.waseda.ac.jp/cp98-ccp/) -------------------------------------------------------------------- Pisa, Italy 30 October 1998 -------------------------------------------------------------------- (in conjunction with the fourth International Conference on Principles and Practice of Constraint Programming (CP98)) -------------------------------------------------------------------- Description The workshop is intended to be a forum of discussions on the practical aspects of Concurrent Constraint Programming (CCP), a simple and elegant formalism for modelling concurrent, parallel, and distributed computation. Topics covered by the workshop include: * Experiences with programming in CCP framework * Novel applications of the CCP framework * Novel implementation techniques of the CCP family of languages * Language constructs for addressing novel applications * Comparison between CCP and other programming paradigms The workshop will consist of the presentation of accepted papers and discussions about selected topics. Organizing committee (in alphabetical order) * Andreas Podelski (Max-Planck-Institut, podelski@mpi-sb.mpg.de) * Vijay Saraswat (AT&T, vijay [at] chit [dot] saraswat.org) * Kazunori Ueda (Waseda Univ., ueda [at] ueda [dot] info.waseda.ac.jp) (contact) Paper Submission Authors are invited to send manuscripts by e-mail in a self-contained PostScript file (gzipped and uuencoded) to the organizers. E-mail submissions should be sent to ALL of the following three adresses: ueda [at] ueda [dot] info.waseda.ac.jp, podelski@mpi-sb.mpg.de, vijay [at] chit [dot] saraswat.org The length guidelines are 10-12 pages in 11-point font and 4000 words. In addition, a separate e-mail message should be sent containing the paper title and a 150-word abstract, authors, keywords, postal address, e-mail address and fax number. Publication We plan to publish all the accepted papers on the workshop web site. We will also distribute a hard-copy version of the proceedings at the workshop. Important Dates AUGUST 15, 1998 PAPER SUBMISSION DEADLINE September 10, 1998 Acceptance decisions October 5, 1998 Final copy due October 30, 1998 CP98 Workshop Workshop URL: http://www.ueda.info.waseda.ac.jp/cp98-ccp/ CP98 URL: http://www.di.unipi.it/cp98/ From owner-reliable_computing Fri Jul 31 14:48:22 1998 Received: by interval.usl.edu id AA16773 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 31 Jul 1998 12:02:22 -0500 Received: from mailserver.di.unipi.it (memphis.di.unipi.it) by interval.usl.edu with SMTP id AA16766 (5.65c/IDA-1.4.4 for ); Fri, 31 Jul 1998 12:02:14 -0500 Organization: Dipartimento di Informatica di Pisa - Italy Received: from mox.di.unipi.it (mox.di.unipi.it [131.114.4.238]) by mailserver.di.unipi.it (8.8.8/8.8.8) with SMTP id QAA12584; Fri, 31 Jul 1998 16:14:14 +0200 (MET DST) Message-Id: <3.0.5.32.19980731124822.007a2100 [at] mailserver [dot] di.unipi.it> X-Sender: bista [at] mailserver [dot] di.unipi.it (Unverified) X-Mailer: QUALCOMM Windows Eudora Light Version 3.0.5 (32) Date: Fri, 31 Jul 1998 12:48:22 +0200 To: (Recipient list suppressed) From: Stefano Bistarelli Subject: Final CFP: CP98 workshop on large scale combinatorial optimization Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Sender: owner-reliable_computing Precedence: bulk --------------------------------------------------------------------- CALL FOR PAPERS --------------------------------------------------------------------- CP98 Workshop on Large Scale Combinatorial Optimisation and Constraints (http://www.icparc.ic.ac.uk/~mgw/chic2_workshop.html) -------------------------------------------------------------------- Pisa, Italy 30 October 1998 -------------------------------------------------------------------- (in conjunction with the fourth International Conference on Principles and Practice of Constraint Programming (CP98)) -------------------------------------------------------------------- This workshop will explore hybrid algorithms for complex optimisation problems. These will be based on the integration of different approaches, viz. constraint programming, mathematical programming and stochastic repair techniques. These approaches have sometimes been perceived as competitors, but more recently they have come to be seen as complementary. The need for such algorithms in solving optimisation problems arises from the fact that different techniques are suited to solving different aspects of the problem. Among the key techniques are constraint propagation, Lagrangean relaxation, linear programming, randomised search and local optimisation. Constraint propagation is ideal for customising an algorithm with domain-dependent constraints. Lagrangean relaxation is the technique of choice for obtaining lower bounds in a branch and bound approach. Linear programming is the only technique that can solve to optimiality large linear problems. Randomised search is necessary for problems that are too large for branch and bound. Local optimisation is the preferred technique for problems that have a specific neighbourhood structure, such as routing problems. Many optimisation problems are hybrid, embracing several different requirements. For example real-life dispatching problems involve both matching, routing and scheduling. For such problems there is a clear need to mix techniques. This mixing can take different forms. On one hand generic methods, such as tabu search or constraint propagation can be significantly enhanced by importing techniques developed for branch and bound (such as edge-finding) or for local optimisation (such as neighbourhood structure). On the other hand different techniques can be applied at different stages of the search. For instance initial solutions can be found using constructive search with constraint propagation, and the solution can then be improved through local optimisation. The workshop invites submissions related to LSCO and Constraints. Topics of interest include: -- hybrid algorithms -- LSCO applications solved using hybrid algorithms -- Methods for integrating different techniques -- Methodologies for devising application-specific hybrid algorithms -- Platforms supporting experimentation with hybrid algorithms -- Surveys of existing hybrid techniques and related literature PAPER SUBMISSIONS: Submission deadline is 15 August 1998. Authors are invited to submit original papers written in English and approximately 10 A4 pages to either Mark Wallace or Yves Caseau at the contact address below. We encourage authors to submit by electronic mail in Word or self-contained Postscript format. Alternatively 3 paper copies may be submitted by post. Decisions on acceptance will be sent to authors by by 15 September 1998. ORGANISATION: -- Mark Wallace IC-Parc, William Penney Laboratory Imperial College, London SW7 2BZ, UK email: mgw [at] icparc [dot] ic.ac.uk -- Yves Caseau Bouygues, Challenger, 1 Av Eugene Freyssinet, 78061 St-Quentin-Yvelines Cedex, FRANCE email: ycs [at] challenger [dot] bouygues.fr -- Eric Jacquet-Lagreze, EuroDecision -- Helmut Simonis, Cosytec -- Gilles Pesant Centre for Research on Transportation, Univ. Montreal IMPORTANT DATES: -- 15 August 1998: Paper submissions -- 15 September 1998: Acceptance decisions -- 10 October 1998: Final copy due -- 30 October 1998: Workshop FURTHER INFORMATION: Additional information about CP98 will be available at the CP98 web site: http://www.di.unipi.it/cp98/ From owner-reliable_computing Fri Jul 31 14:48:21 1998 Received: by interval.usl.edu id AA17049 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 31 Jul 1998 12:11:29 -0500 Received: from mailserver.di.unipi.it (memphis.di.unipi.it) by interval.usl.edu with SMTP id AA17041 (5.65c/IDA-1.4.4 for ); Fri, 31 Jul 1998 12:11:25 -0500 Organization: Dipartimento di Informatica di Pisa - Italy Received: from mox.di.unipi.it (mox.di.unipi.it [131.114.4.238]) by mailserver.di.unipi.it (8.8.8/8.8.8) with SMTP id QAA11940; Fri, 31 Jul 1998 16:03:01 +0200 (MET DST) Message-Id: <3.0.5.32.19980731124821.007a2100 [at] mailserver [dot] di.unipi.it> X-Sender: bista [at] mailserver [dot] di.unipi.it (Unverified) X-Mailer: QUALCOMM Windows Eudora Light Version 3.0.5 (32) Date: Fri, 31 Jul 1998 12:48:21 +0200 To: (Recipient list suppressed) From: Stefano Bistarelli Subject: Final CFP: CP98 workshop on constraints in biocomputing Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Sender: owner-reliable_computing Precedence: bulk --------------------------------------------------------- Apologies if you receive this more than once! --------------------------------------------------------- --------------------------------------------------------------------- CALL FOR PAPERS --------------------------------------------------------------------- CP98 Workshop on Constraints in Bioinformatics/Biocomputing (http://www.cs.city.ac.uk/~drg/cp98-workshop/cp98-workshop.html) -------------------------------------------------------------------- Pisa, Italy 30 October 1998 -------------------------------------------------------------------- The workshop will be held in conjunction with the Fourth International Conference on Principles and Practice of Constraint Programming (CP98), October 26-30, 1998 at Pisa, Italy. Scope of the workshop Bioinformatics is the development and application of methods in mathematics and informatics for approaching problems in molecular biology, whereas Biocomputing uses naturally occurring architectures and behaviours as models for computational methods, for example neural networks, genetic algorithms, genetic programming and DNA computing. This is the second workshop on this topic, in an very exciting and rapidly expanding area; selected papers from the first workshop will appear in a special issue of the Constraints Journal. We believe that constraint programming technologies can play a very significant role in these fast developing areas. Contributions are solicited from researchers working in any of these fields. Topics include (but are not restricted to) the application of constraint technology to * sequencing and sequence analysis * languages for the description of biomolecular structures (primary, secondary and tertiary) * design and implementation of biomolecular databases * algorithms for locating structures in biomolecular databases * protein topology, including prediction and folding pathways * determination of protein domains * molecular docking problems * description and determination of metabolic pathways * determination of evolutionary relationships * discovery and data mining of biostructures * genetic and physical mapping * DNA rearrangement * sequence alignment * phylogeny * neural networks * genetic algorithms * genetic programs * DNA computing Papers that combine theory and practice are especially welcome. Authors are strongly encouraged to ensure high quality of both the biological as well as the computer science aspects of their submissions. Paper submissions Authors are invited to submit original papers written in English and approximately 10 A4 pages in length to David Gilbert (drg [at] cs [dot] city.ac.uk) at the contact address below. We encourage authors to submit by electronic mail in self-contained Postscript format. Alternatively five paper copies may be submitted. Publication An informal proceedings of the workshop will be available on-line prior to the workshop. It is expected that selected papers will either be published as a book or as an international journal issue. Organisation David Gilbert, City University, UK, drg [at] cs [dot] city.ac.uk Rolf Backofen, Ludwig-Maximilians-Universitaet Muenchen, Germany, backofen [at] informatik [dot] uni-muenchen.de Geoff Barton, European BioInformatics Institute, Cambridge UK, geoff [at] ebi [dot] ac.uk Ingvar Eidhammer, University of Bergen, Norway, ingvar [at] ii [dot] uib.no Christine Gaspin, National Institute of Agronomical Research, France, gaspin [at] toulouse [dot] inra.fr Roland Yap, National University of Singapore, ryap [at] iscs [dot] nus.edu.sg Important dates 15 August 1998 Paper submissions 15 September 1998 Acceptance decisions 10 October 1998 Final copy due 30 October 1998 Workshop Further information The workshop web-site is http://www.cs.city.ac.uk/~drg/cp98-workshop/cp98-workshop.html Information on CP98 is available at the CP98 web site: http://www.di.unipi.it/cp98/ From owner-reliable_computing Thu Jul 30 18:14:54 1998 Received: by interval.usl.edu id AA17431 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 31 Jul 1998 12:32:39 -0500 Received: from mailserver.di.unipi.it (memphis.di.unipi.it) by interval.usl.edu with SMTP id AA17424 (5.65c/IDA-1.4.4 for ); Fri, 31 Jul 1998 12:32:35 -0500 Organization: Dipartimento di Informatica di Pisa - Italy Received: from mox.di.unipi.it (mox.di.unipi.it [131.114.4.238]) by mailserver.di.unipi.it (8.8.8/8.8.8) with SMTP id QAA12817; Fri, 31 Jul 1998 16:19:32 +0200 (MET DST) Message-Id: <3.0.5.32.19980730161454.007997b0 [at] mailserver [dot] di.unipi.it> X-Sender: bista [at] mailserver [dot] di.unipi.it (Unverified) X-Mailer: QUALCOMM Windows Eudora Light Version 3.0.5 (32) Date: Thu, 30 Jul 1998 16:14:54 +0200 To: (Recipient list suppressed) From: Stefano Bistarelli Subject: Final CFP: CP98 workshop on constraint problem reformulation Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Sender: owner-reliable_computing Precedence: bulk --------------------------------------------------------- Apologies if you receive this more than once! --------------------------------------------------------- --------------------------------------------------------------------- CALL FOR PAPERS --------------------------------------------------------------------- CP98 Workshop on Constraint Problem Reformulation (http://ic-www.arc.nasa.gov/ic/people/frank/workshop.html) --------------------------------------------------------------------- Pisa, Italy 30 October 1998 --------------------------------------------------------------------- (in conjunction with the fourth International Conference on Principles and Practice of Constraint Programming (CP98)) --------------------------------------------------------------------- This workshop will focus on reformulating Constraints Problems to take advantage of efficient techniques in particular constraints problem domains. In particular, the workshop will focus on reformulating NP-Complete problems and related optimization problems to translate them to domains which have good problem solver performance A fundamental issue is planning and search is the choice of an appropriate problem representation. While the importance of problem representation has been widely recognized within AI, starting from the work of Saul Amarel on represenations of the Missionaries and Cannibals, there have not been a great many success stories. Much research focuses on exploiting the domain-specific details of a particular problem domain in order to come up with the best algorithm. However, there is considerable value to exploring alternate representations for which good algorithms already exist. For eaxmple, SATPLAN exploits the excellent performance of algorithms (both deterministic and non-deterministic) to solve SAT problem instances. SATPLAN's success is hard-won, however, in that automatic procedures for translating planning problems to SAT representation are not as effective as hand-designed representations. Other efforts at reformulation, such as encoding Hamiltonian Cycle problems as SAT problems and using local search to solve them, have not been successful. WORKSHOP FOCUS: Issues which workshop submissions will focus on include: What are the issues in reformulation? Speed of translation procedure. Exposing/hiding of information by the translation procedure. Translation by hand vs. automated translation. Translation of problem classes vs. translation of problem instances. How should reformulation be used? Reformulation to solve problems directly. Reformulation to motivate improvements in the original space. Explaining success/failure of reformulation. A more detailed explanation of the workhshop themes can be found in the extended workshop announcement, which is available on the workshop web page. Paper Submission and Important Dates Prospective authors are asked to submit papers of 6 pages or less in length. The papers should be original, written in English, and formatted on either 8.5 by 11 inches or A4 paper. Papers may be sent electronically, with appropriate instructions, or by mail. Submissions should be submitted to both Jeremy Frank and Mihaela Sabin; contact information is provided at the end of the call. Workshop attendees are asked to send a 1 page statement of interest; all of these statements will be published with the workshop proceedings. August 28, 1998: Submission of workshop papers. September 11, 1998: Announcement of workshop speakers and posting of workshop schedule. September 25, 1998: Submission of statement of interest by workshop attendees. September 25, 1998: Final copy of the accepted papers due. October 30, 1998: Workshop occurs in conjunction with CP 98 in Pisa, Italy. Publication With the authors permission, we will publish all of the accepted papers on the workshop web site. We will also publish the papers and statements of interest, along with the introductory components of the workshop call for papers, in a booklet which will be made available at the workshop. Workshop Format The morning session will be reserved for presentations: each presentation will be limited to 20 minutes. A 3.5 hour morning session leaves time for roughly 10 presentations of 20 minutes each. The afternoon session would then be reserved for free-form discussion on the topics presented in the morning, with about a half-hour wrap up. The accompanying workshop proceedings will include a 6 page paper for each speaker, plus 1 page statements of interest from any other participants. Contact Information Jeremy Frank Caelum Research Corp. Mail Stop 269-1 NASA Ames Research Center Moffett Field, CA 94040 frank [at] ptolemy [dot] arc.nasa.gov Mihaela Sabin Computer Science Department University of New Hampshire Durham, NH 03824 mcs [at] cs [dot] unh.edu Constraint Programming 1998 page: http://www.di.unipi.it/cp98/ Constraint Problem Reformulation Workshop page: http://ic-www.arc.nasa.gov/ic/people/frank/workshop.html