From owner-reliable_computing Mon Sep 2 13:25:30 1996 Received: by interval.usl.edu id AA02084 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Mon, 2 Sep 1996 18:25:33 -0500 Received: by interval.usl.edu id AA02074 (5.65c/IDA-1.4.4 for reliable_computing); Mon, 2 Sep 1996 18:25:30 -0500 Date: Mon, 2 Sep 1996 18:25:30 -0500 From: "Kearfott R. Baker" Message-Id: <199609022325.AA02074 [at] interval [dot] usl.edu> To: reliable_computing Subject: HTML version of "Interval Computations: Introduction, Uses, and Resources" Sender: owner-reliable_computing Precedence: bulk Dear Colleagues, I have made the portion of the survey "Interval Computations: Introduction, Uses, and Resources" (to appear in volume 2, no. 1 of the Euromath Bulletin) that contains electronic references into an html file. You can access it at: http://interval.usl.edu/euromath.html Although the content overlaps with the interval computations page of Vladik and Misha, I have endeavored to make this page valuable to you. 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 --------------------------------------------------------------- From owner-reliable_computing Tue Sep 10 23:40:17 1996 Received: by interval.usl.edu id AA05925 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Tue, 10 Sep 1996 17:39:28 -0500 Received: from Post-Office.UH.EDU by interval.usl.edu with SMTP id AA05919 (5.65c/IDA-1.4.4 for ); Tue, 10 Sep 1996 17:38:41 -0500 Received: from happy.dt.uh.edu by Post-Office.UH.EDU (PMDF V5.0-7 #8380) id <01I9BLSWRACK0015F2@Post-Office.UH.EDU>; Tue, 10 Sep 1996 17:38:16 -0500 (CDT) Received: by happy.dt.uh.edu (5.0/SMI-SVR4) id AA04042; Tue, 10 Sep 1996 17:40:17 +0600 Date: Tue, 10 Sep 1996 17:40:17 +0600 From: hu [at] happy [dot] dt.uh.edu Subject: support standardizing notations for interval computations To: reliable_computing [at] interval [dot] usl.edu, rbk [at] usl [dot] edu, intblas [at] dt [dot] uh.edu Message-Id: <9609102240.AA04042 [at] happy [dot] dt.uh.edu> Content-Transfer-Encoding: 7BIT X-Sun-Charset: US-ASCII Sender: owner-reliable_computing Precedence: bulk Dear Colleagues: I strongly support the idea of standardizing notations used in the literature of interval computations. With standard notations, the communications will be more effective. I've to admit, in reviewing papers submitted to Reliable Computing, I have to make extra effort to understand different notations used by different authors. A standard notation system is an indication of the maturity of a literature. The literature of interval computing has gone far beyond the stage of maturity to deserve a standard notation system. Standardizing the notation system is long overdue. The work should be done. The sooner, the better. Although I'll not attend the INTERVAL'96 conference, I hope that standardizing notations will be considered and discussed at the meeting. Interval computing is an extension of usual number computations. The standardized notation system should keep the consistency as much as possible with current notations used in mathematics. Professor Kearfott's notation system clearly meets this requirement. We may use his notation system (or others) as the base for further discussion. After we have a standardized notation system, we may require authors of the Journal of Reliable Computing to adopt it. Regards! Chenyi Hu Computer and Mathematical Sciences Department Center for Computational Science and Advanced Distributed Simulation University of Houston-Downtown > Date: Sat, 17 Aug 1996 13:02:35 -0500 > To: reliable_computing [at] interval [dot] usl.edu > From: "R. Baker Kearfott" > Subject: notation for scholarly works > > Dear Colleagues: > > There has been some discussion recently about standardizing notation > for intervals within research and review papers and books. One > suggestion has been to use the notation in my forthcoming Kluwer > monograph "Rigorous Global Search: Continuous Problems." I'd > like to comment on this. > > Basically, I have used boldface to denote intervals and usual > math italic to denote point quantities. I have used underscores > to denote lower bounds and overscores to denote upper bounds. > > A device that has generated some controversy is my > use of uppercase for both vectors and matrices. In particular, > a more usual practice in numerical linear algebra is to reserve > uppercase for matrices only, and to use lowercase for vectors; > vectors are then distinguished from components by use of > subscripts. I agree with this modification to my notation. > > I am in general agreement that a standardized notation would be > advantageous. However, before we force any particular notation (such as > requiring a particular notation in submissions to Reliable Computing), we > should probably have more discussion, as well as some mechanism for coming > to a consensus. If there is a strong feeling for a standardized > notation, I can organize this. > > 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 > --------------------------------------------------------------- > From owner-reliable_computing Fri Sep 13 10:42:57 1996 Received: by interval.usl.edu id AA07545 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 13 Sep 1996 15:42:59 -0500 Received: by interval.usl.edu id AA07535 (5.65c/IDA-1.4.4 for reliable_computing); Fri, 13 Sep 1996 15:42:57 -0500 Date: Fri, 13 Sep 1996 15:42:57 -0500 From: "Kearfott R. Baker" Message-Id: <199609132042.AA07535 [at] interval [dot] usl.edu> To: reliable_computing Subject: A note from the list maintainer Sender: owner-reliable_computing Precedence: bulk Dear colleagues, There is some evidence that some of the addresses on the list "reliable_computing [at] interval [dot] usl.edu" are themselves lists of some sort. In particular, I get bounced messages from addresses that are not on the list, and I get "maximum hop count exceeded," suggesting that there are possible loops in the distribution path. Therefore, I urge people who are automatically forwarding messages from this list further to send me the addresses to which the messages are being forwarded, so I may include them in the "reliable_computing" list directly. It will make the distribution process more efficient, easier to maintain, and friendlier to the recipients. (A particular problem is p00536 [at] psilink [dot] com. Mail from the list to this address has bounced consistently, and no address on my list bears any resemblance to this address.) I apologize for burdening the entire list with this request, but, after much thought, I have not found an alternative. Best regards, --------------------------------------------------------------- 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 Sat Sep 14 07:36:19 1996 Received: by interval.usl.edu id AA08231 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Sat, 14 Sep 1996 10:54:13 -0500 Received: from julian.uwo.ca ([129.100.2.12]) by interval.usl.edu with SMTP id AA08225 (5.65c/IDA-1.4.4 for ); Sat, 14 Sep 1996 10:54:09 -0500 Received: by pineapple.apmaths.uwo.ca (AIX 3.2/UCB 5.64/4.03) id AA12514; Sat, 14 Sep 1996 11:36:19 -0400 Date: Sat, 14 Sep 1996 11:36:19 -0400 From: rmc [at] pineapple [dot] apmaths.uwo.ca (Robert Corless) Message-Id: <9609141536.AA12514 [at] pineapple [dot] apmaths.uwo.ca> To: ned [at] cs [dot] toronto.edu, reliable_computing [at] interval [dot] usl.edu Subject: Re: Taylor Series Sender: owner-reliable_computing Precedence: bulk Sure---Y.F. Chang's ATOMFT code does it quite nicely. Surely George gave you a copy? -r From owner-reliable_computing Mon Sep 16 06:27:59 1996 Received: by interval.usl.edu id AA10235 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Mon, 16 Sep 1996 11:28:20 -0500 Received: from bp.ucs.usl.edu by interval.usl.edu with SMTP id AA10229 (5.65c/IDA-1.4.4 for ); Mon, 16 Sep 1996 11:28:17 -0500 Received: from rbk5287.usl.edu ([130.70.46.171]) ([130.70.46.171]) by bp.ucs.usl.edu with SMTP id AA15075 (5.65c/IDA-1.4.4 for ); Mon, 16 Sep 1996 11:28:16 -0500 Message-Id: <2.2.32.19960916162759.006cb398 [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, 16 Sep 1996 11:27:59 -0500 To: reliable_computing [at] interval [dot] usl.edu From: "R. Baker Kearfott" Subject: SCAN-97 call for papers Sender: owner-reliable_computing Precedence: bulk CALL FOR PAPERS SCAN-97 GAMM/IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics September 10-12, 1997 Ecole Normale Superieure de Lyon France The conference continues the series of SCAN-Symposia which have previously been held at Karlsruhe, Basel, Albena, Oldenburg, Vienna and Wuppertal under the joint sponsorship of GAMM and IMACS. These conferences have traditionally covered the numerical and algorithmic aspects of Scientific Computing, with a strong emphasis on the algorithmic validation of results and on algorithmic and arithmetic tools for this purpose. "Validation" or "verification" characterizes the efforts in Scientific Computing striving to generate - concurrently with numerical results - qualitative and quantitative assertions about the results which are correct in a rigorous mathematical sense. Typical examples of such efforts are - the specification of a domain in which a solution of a given problem exists; - the computation of close upper and lower bounds for the result of a given problem. Assertions from algorithmic validation have the same correctness quality as assertions obtained by classical mathematical methods of derivation and proof. Because of this quality, Validated Numerics has developed into an important subject within the fast growing area of Scientific Computing. SCAN-97 will provide a forum for - presentation of the latest research and developments in theory, algorithmic and arithmetic design for Validated Numerics; - demonstration of new software available for Validated Numerics, - reports of interesting case studies in industrial and scientific application of Validated Numerics, and discussion of new directions in research and development suggested by other advances in Scientific Computing. Potential new directions are the use of parallel architectures for the implementation of validation algorithms and the use of validation ideas in Computer Algebra. Furthermore, the conference should help in the dissemination of the ideas and potentials of Validated Numerics to interested scientists from other areas of Scientific Computing. Within the scope of SCAN-97, there is no restriction regarding the mathematical or applicational background of the problems to be reported: algebra, analysis, optimization, probability, etc. are equally welcome. ORGANIZATION SCIENTIFIC COMMITTEE G. Alefeld (Karlsruhe), J.C. Bajard (Marseille), J.C. Berges (Toulouse), J.M. Chesneaux (Paris), G. Corliss (Milwaukee), M. Daumas (Lyon), A. Frommer (Wuppertal), A. Guyot (Grenoble), G. Heindl (Wuppertal), J. Herzberger (Oldenburg), R.B. Kearfott (Lafayette), S. Knowles (Bristol), V. Kreinovitch (El Paso), U. Kulisch (Karlsruhe), G. Mayer (Rostock), D. Matula (Dallas), A. Mignotte (Lyon), J.M. Muller (Lyon), M. Pichat (Lyon), S.M. Rump (Hamburg), H.J. Stetter (Vienna), Ch. Ullrich (Basel), T. Yamamoto (Matsuyama). LOCAL ORGANIZATION M. Daumas, A. Mignotte, J.M. Muller (chair.) SUBMISSION OF PAPERS You are kindly invited to submit a paper for presentation at the conference. Extended abstract of 1-4 pages must be submitted by e-mail to SCAN97 [at] lip [dot] ens-lyon.fr preferably in LaTeX. Please request a pattern LaTeX file from the above address. If you cannot use LaTeX, please send a plain text file without special editing. Do not use any other text processing system. The head of the abstract must contain the name, affiliation, postal address, and e-mail and fax addresses of the author presenting the paper. If there are several authors, the names of the other authors must be in parentheses. Deadline for extended abstracts: April 1, 1997 As each submitted paper will be refereed on the basis of its extended abstract, the abstract must contain sufficient technical detail to allow reviewing. PROCEEDINGS The proceedings of the conference will be distributed to the attendees. A selection of papers from these proceedings will be published in a special issue of the new Springer-Verlag journal JUCS (Journal of Universal Computer Science). JUCS is a new electronic journal that can be accessed through the Internet (http://hyperg.iicm.tu-graz.ac.at/jucs). There are 12 electronic issues per year, free of charge in 1995 and 1996, one complete paper version per year, and one complete CD-ROM version per year. INFORMATIONS All communications regarding SCAN97 should be directed to: - e-mail: SCAN97 [at] lip [dot] ens-lyon.fr - fax: (+33) 4 72 72 80 30 or (+33) 4 72 72 80 80, attn. ``V. Roger-Ubeda, SCAN'97'' - surface mail: V. Roger-Ubeda, SCAN'97, Laboratoire LIP, ENS-Lyon, 46 Allee d'Italie, F-69364 Lyon Cedex 07, France Please, use e-mail or fax whenever possible. To be included in the mailing list of the conference, please send an e-mail to the above address. WEB PAGE More information (including transportation and accommodation) can be found in our web page: www.ens-lyon.fr/LIP/SCAN-97 --------------------------------------------------------------- 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 Mon Sep 23 03:48:41 1996 Received: by interval.usl.edu id AA14446 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Mon, 23 Sep 1996 10:48:59 -0500 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA14440 (5.65c/IDA-1.4.4 for ); Mon, 23 Sep 1996 10:48:53 -0500 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA11061; Mon, 23 Sep 96 09:48:41 MDT Date: Mon, 23 Sep 96 09:48:41 MDT From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9609231548.AA11061 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu Subject: computational science conference in China Sender: owner-reliable_computing Precedence: bulk Dear Colleagues, Please find attached a CFP for the computational science workshop in China in 1997. This CFP does not specifically mention intervals, but * interval computations is definitely one of the computational science areas, and as we all beleive, an important one, so the organizers expect quite a few interal papers to be presented. * In any case, it is a good idea for interval researchers to mingle with the mainstream of scientific computing and thus increase the popularity of our methods. Call for Papers International Workshop on Computational Science and Engineering Hefei, China, May 27-28, 1997 Conference Organizers: Anhui University, China; University of Science and Technology of China Hefei High Performance Computing Center of China University of Houston, Downtown Papers to be considered for acceptance: 1. High performance computing in science and engineering 2. Key technologies in parallel computing (software environment, system achitecture, and theory) 3. Parallel algorithms for Numerical and Non-numerical problems 4. Models, Languages, Tools and Environments for parallel programming 5. Other areas on computational science and engineering (such as new technology on software technology, multimedia and computer networks, and others) Paper preperations: Papers should be written in LaTeX with IEEE-transection macro. Page limitation is 10 pages. Submission deadline is December 15, 1996. Notifications will be mailed out by January 5, 1997. Camera ready manuscripts should be received before February 15, 1997. Paper submission: Electronic submission is very strongly encouraged. For electronic submission, please e-mail to: CHu [at] uh [dot] edu, and hlin [at] dawn1 [dot] cs.ustc.edu.cn Or, you may mail 5-copies of your paper Inside China, to: Mr. Hong Lin Department of Computer Science University of Science and Technology of China P.O. Box 4, Hefei, Anhui 230027 People's Republic of China Other countries, to: Professor Chenyi Hu Computer and Mathematical Sciences Department University of Houston-Downtown One Main Street Houston, TX 77002 USA Workshop General-chairmen: SHI, Zhongci, Chinese Academy of Sciences Co-chairman: Richard A. Alo', USA Workshop International Advisory Committee: Agrawal, Dharma, North Carolina State University, USA Kennedy, Ken, Center for Research on Parallel Computation, USA Kreinorvich, Vladik, University of Texas at El Paso, USA Hamacher, Carl, Queen's University, Canada Kearfott, Baker, University of Southwestern Louisiana, USA Program Committee: CHEN, Guoliang; (Committee Chairman) University of Science and Technology of China YANG, Qing; University of Rhode Island; USA JIANG, Hong; University of Nebraska-Lincoln; USA Organization Committee: CHENG, Huixia; (Committee Chairman) Anhui University; China HU, Chenyi; University of Houston-Downtown; USA LIN, Hong; University of Science and Technology of China Registration Fee: $200 which covers Workshop Proceedings, a banquet, meals, refreshments, entertainment, and local transportation. Transportation and hotel arragements: Information on discounted airfare, hotel accommodations, and a post-conference highlight China tour for interested participants will be mailed out with the notification by January 5, 1997. From owner-reliable_computing Mon Sep 23 16:38:48 1996 Received: by interval.usl.edu id AA14954 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Mon, 23 Sep 1996 19:39:07 -0500 Received: from cs.hope.edu (smaug.cs.hope.edu) by interval.usl.edu with SMTP id AA14948 (5.65c/IDA-1.4.4 for ); Mon, 23 Sep 1996 19:38:53 -0500 Received: from localhost by cs.hope.edu (5.x/SMI-SVR4 (Mod 5/10/94.8)) id AA18044; Mon, 23 Sep 1996 20:38:48 -0400 Date: Mon, 23 Sep 1996 20:38:48 -0400 (EDT) From: Ron Van Iwaarden X-Sender: rvaniwaa@smaug Reply-To: Ron Van Iwaarden To: Reliable Computing Mailing List Subject: Intervals, derivatives, and if statements Message-Id: Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-reliable_computing Precedence: bulk Hi, As some readers may be aware, I have been adapting ADOL-C (automatic differentiation through C++) to compute derivatives of interval functions. My initial efforts have been met with some success and I am now turning my thoughts towards "corners" in functions and discontinuities. IADOL-C will support a statement that is equivalent to if (b > 0) x = g(x) else if (b <= 0) x = h(x) else x = J(x) The question arises, what should be done in the third case when one is computing derivatives. My present inclination is this: If F(x) = (b > 0) ? g(x) : h(x) is provably discontinuous at x, then we could either abort or set the result to [-infinity, infinity] or [NaN,NaN]. If it is possibly true (similar to Baker Kearfott's Fortran Interval proposal), return the above choice or ConvexHull(g(x), h(x)) based on some user definable parameter (the user may know the function is k times continuously differentiable). A classic example, is what would one do about the derivatives of y = (x > 0) ? x^2/2 : -x^2/2; in some interval containing the point a=0. I welcome any and all advice either in private e-mail or in public. Since IADOL-C will be released to the public at some later point in time, a public discussion of this issue might be better at this point so that all points of view may be considered and debated. --Ron o Ronald Van Iwaarden | Work to live; /\ Hope College | Live to bike; _`\ `_<=== Holland MI 49423 | Bike to work! __(_)/_(_)___.-._ voice : (616)395-7523 | http://www.cs.hope.edu/~rvaniwaa/ From owner-reliable_computing Tue Sep 24 16:08:32 1996 Received: by interval.usl.edu id AA15877 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Tue, 24 Sep 1996 23:08:54 -0500 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA15871 (5.65c/IDA-1.4.4 for ); Tue, 24 Sep 1996 23:08:50 -0500 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA16220; Tue, 24 Sep 96 22:08:32 MDT Date: Tue, 24 Sep 96 22:08:32 MDT From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9609250408.AA16220 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu Subject: conference on theoretical aspects of computing with real numbers Sender: owner-reliable_computing Precedence: bulk CALL FOR PARTICIPATION International Conference JAF13 13th DAYS ON WEAK ARITHMETICS (theoretical aspects of computing, in particular, computing with real numbers) supported by Institut Universitaire de Technologie de Metz Universite' de Metz Conseil Ge'ne'ral de la Moselle Laboratoire d'Informatique The'orique et de Programmation (CNRS - Paris VII) Laboratoire de Recherches en Informatique de Metz ----------------------------------------------------------------------- METZ 1996 I.U.T. de Metz, I^le du Saulcy, DECEMBER 12 and 13 ----------------------------------------------------------------------- Languages: English and French TOPICS : provability in weak arithmetics weak arithmetics and model theory weak arithmetics and decidability/undecidability of logical theories weak arithmetics and computational modelizings PERMANENT JAF COMMITTEE : Patrick CEGIELSKI, University Paris 12, Fontainebleau IUT Jean-Pierre RESSAYRE, CNRS, Jussieu Denis RICHARD, University of Auvergne, Clermont IUT, LLAIC1 PROGRAM COMMITTEE : Ve'ronique BRUYE`RE, University of Mons Serge GRIGORIEFF, University Paris 7, LITP Maurice MARGENSTERN, University of Metz, Metz IUT, LRIM, LITP Chair, organizer Lioudmila PAVLOTSKAYA, MPEI, Moscou Jean-Pierre RESSAYRE, CNRS, Jussieu ORGANIZING COMMITTEE : Maurice MARGENSTERN, University of Metz, Metz IUT, LRIM, LITP, Chair Zsuzsanna ROKA, Guillaume WATIER, University of Metz, Metz IUT, LRIM CONFERENCE WORKING : WEDNESDAY, DECEMBER 11, FROM 2 P.M. UNITL 6h30 A.M. : Reception of participants THURSDAY DECEMBER 12 AND FRIDAY DECEMBER 13 : SPEAKERS TALKS LECTURES : Sergei" ADIAN, Steklov Institute, Moscow On decision problems for single relation monoid representations Maurice BOFFA, Universite' de Mons L'argument de parite' dans PA, ZF et NF. Milos ERCEGOVAC, University of Los Angeles Redundant representations of real numbers and their effect on arithmetic algorithms Richard KAYE, University of Birmingham Hilbert's 10th problem in weak systems of arithmetics Yuri MATYASSEVICH, Institut Steklov, St-Petersbourg, Some arithmetical reformulations of the Four Colour Conjecture Heinz-Otto PEITGEN, Universita"t Bremen, From Pascal to von Neumann and back Jean-Pierre RESSAYRE, CNRS, Jussieu title not yet available Denis RICHARD, Universite' d'Auvergne, IUT de Clermont, LLAIC1 title not yet available TALKS : Patrick CEGIELSKI, Universite' Paris 12, IUT de Fontainebleau, Analyse quasi-re'cursive Jean-Sylvestre GAKWAYA, Universite' de Mons-Hainaut, La Hierarchie de Grzegorczyk et son extension dans le modele BSS Serge GRIGORIEFF, Universite' Paris 7, LITP, title not yet available Fritz von HAESELER, Universita"t Bremen, Automaticity of linear cellular automata Jean-Michel MULLER, CNRS, ENS de Lyon, title not yet available Jean-E'ric PIN, CNRS LITP, title not yet available Gencho SKORDEV, Universita"t Bremen, Linear cellular automata, self-similarity and automaticity Elias TAHHAN BITTAR, Clermont-Ferrand, LLAIC, Caracte'risation syntaxique de la hie'rarchie de Gzregorczyk Gencho SKORDEV, Universita"t Bremen, title not yet communicated Guillaume WATIER, Universite' de Metz, IUT de Metz, LRIM title not yet available An abstract of the speakers talks will be available about three weeks before the conference by FTP at a later indicated address. INSCRIPTION FEES : For attending the conference, send your registration to our secretary or send it using the form, below, using FAX or e-mail. Registration fees amounts to 300FF for all participants. Fees must be paid to the conference organization before December 5 1996. WARNING : way of paying : By cheque, at the order of "Agent Comptable de l'Universite' de Metz", sent to the surface mail, below, one month before the opening of the conference if sent from abroad. You may also wish to pay by direct transfer on the following account : Agent Comptable de l'Universite' de Metz, Compte Postal Starsbourg 5 506 41 H : banque guichet nume'ro compte cle' 20041 01015 0550641H036 16 REGISTRATION FORM : Family name : ................................................. First name : ................................................. Affiliation : ................................................. Address : ................................................. Country : ................................................. e-mail : ................................................. FAX : ................................................. Phone : ................................................. Arrival : ................................................. Departure : ................................................. If you need lodging in hotel, please, keep in mind that RECEPTION will take place in the afternoon of Wednesday December 11 1996. ACCOMODATION Starting from November, 1st, 1996, the organizing committee will send, on request, a list of hotels not too far from the place of the conference. FOR YOUR MAIL : surface mail : Maurice MARGENSTERN 13emes Journe'es sur les Arithme'tiques Faibles, I.U.T. de Metz, De'partement d'informatique, I^le du Saulcy, F - 57045 METZ CEDEX 1 e-mail : jaf13 [at] iut [dot] univ.metz.fr FAX : (33) 87 31 54 96 WARNING, starting from October 19, dial : 33 3 87 31 54 96 from abroad, 03 87 31 54 96 from France ---------------------- PLEASE, DISTRIBUTE WIDELY! --------------------- From owner-reliable_computing Thu Sep 19 09:30:25 1996 Received: by interval.usl.edu id AA16312 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Wed, 25 Sep 1996 02:43:02 -0500 Received: from matsun1.matesco.unican.es by interval.usl.edu with SMTP id AA16306 (5.65c/IDA-1.4.4 for ); Wed, 25 Sep 1996 02:42:41 -0500 Received: from [193.144.183.3] by matsun1.matesco.unican.es (4.1/SMI-4.1) id AA07614; Thu, 19 Sep 96 08:26:28 +0200 Message-Id: Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Thu, 19 Sep 1996 08:30:25 +0100 To: communaute [at] marie [dot] polytechnique.fr, reduce-forum [at] rand [dot] org, reliable_computing [at] interval [dot] usl.edu, events [at] maplesoft [dot] com From: gvega [at] matsun1 [dot] matesco.unican.es (Laureano Gonzalez Vega) Subject: Industry and Polynomial System Solving [FRISCO OPEN WORKSHOP] Sender: owner-reliable_computing Precedence: bulk FRISCO 96 FIRST ANNOUNCEMENT FRISCO Open Workshop on The Needs of Industry in Polynomial System Solving Barcelona, Spain, October 23-25, 1996 The aim of the FRISCO project is to investigate and develop technologies which can be used to deliver highly efficient, versatile polynomial solvers to industrial users. Many industrial problems can be reduced to polynomial equations or polynomial systems. While methods exist which in principle provide complete solutions to these problems, in practice these methods are rarely used outside academic circles. This is because: * Existing implementations of these algorithms are not efficient enough to tackle large systems. * The environments in which these algorithms are implemented - typically interactive computer algebra systems - cannot be interfaced to existing scientific applications in an effective way. Nevertheless there is demonstrable, widespread and persisting interest in applying these algorithms in areas ranging from telecommunications to automated manufacturing and robotics. Such interest provides a strong and encouraging indicator of the industrial relevance of this project. The purpose of this Open Workshop is to bring scientists and engineers in European industry and dealing with polynomial equations into contact with the FRISCO project. The future development of the FRISCO project will take into account the real needs on Polynomial System Solving of the industrial users of mathematical software as expressed in the Open Workshop. The program of the Workshop will be a combination of FRISCO presentations, presentations of industrial problems and/or solutions, and pannel discussions. The FRISCO Open Workshop on "The Needs of Industry in Polynomial System Solving" is organized by the EU FP IV FRISCO Project (No. 21024) with the collaboration of AddLink (the main Spanish distributor of mathematical software). It will be held at the "Gran Hotel Catalonia" (Calle Balmes 142-146, Barcelona). Those willing to participate in the FRISCO Open Workshop on "The Needs of Industry in Polynomial System Solving" are encouraged to contact with Laureano Gonzalez-Vega by e-mail to the address frisco96 [at] matesco [dot] unican.es or by ordinary mail/fax to the address Prof. Laureano Gonzalez-Vega (FRISCO Project) Departamento de Matematicas, Estadistica y Computacion Facultad de Ciencias, Universidad de Cantabria Avenida de Los Castros s/n, Santander 39005, Spain Phone: +34 42-201437 Fax: +34 42-201402 Information about accomodation at Barcelona during the workshop is included at the end of this message. A final announcement with the preliminary program of the Workshop will be distributed at the beginning of October. For general information on the Workshop, please contact Prof. Laureano Gonzalez-Vega to the address above or visit the web page http://matsun1.matesco.unican.es/~gvega/frisco96.html ****************************************************************************** ACCOMODATION Those attending to the FRISCO Open Workshop are encouraged to contact, as soon as posible, with Agencia Central de Viajes (ask for Antonio Gomez mentioning the FRISCO Workshop) Phone: +34 3-4586204 Fax: +34 3-4580341 in order to book a room in the hotel where the FRISCO Open Workshop will be held or in one of the hotels in Barcelona downtown close to the "Gran Hotel Catalonia" where we have already booked a few number of rooms. ****************************************************************************** _______________________________________________________ Laureano Gonzalez-Vega Departamento de Matematicas, Estadistica y Computacion, Facultad de Ciencias, Universidad de Cantabria, Avenida de los Castros s/n, Santander 39071, Cantabria, Spain Phone: 34-(9)42-201437 Fax: 34-(9)42-201402 e-mail: gvega [at] matesco [dot] unican.es gonzalezl [at] besaya [dot] unican.es URL: http://matsun1.matesco.unican.es/CAG/people/gvega _______________________________________________________ From owner-reliable_computing Wed Sep 25 15:58:15 1996 Received: by interval.usl.edu id AA16762 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Wed, 25 Sep 1996 07:30:25 -0500 Received: from colorado.univ-orleans.fr by interval.usl.edu with SMTP id AA16756 (5.65c/IDA-1.4.4 for ); Wed, 25 Sep 1996 07:27:23 -0500 Received: from lifo.univ-orleans.fr (jfplc97@localhost) by colorado.univ-orleans.fr (8.6.12/General) with ESMTP id NAA08523; Wed, 25 Sep 1996 13:58:43 +0200 Message-Id: <199609251158.NAA08523 [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] cis [dot] ohio-state.edu, clp [at] iscs [dot] nus.sg, clpr-users [at] cis [dot] ohio-state.edu, compunode [at] ecrc [dot] de, 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-pe [at] bach [dot] ces.cwru.edu, prolog-vendors [at] sics [dot] se, quintus-users [at] quintus [dot] com, reliable_computing [at] interval [dot] usl.edu, rewriting [at] loria [dot] fr, semantics-list [at] newton [dot] cam.ac.uk, theorem-provers [at] ai [dot] mit.edu Subject: JFPLC'97-CFP Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Date: Wed, 25 Sep 1996 13:58:15 +0200 From: jfplc97 Sender: owner-reliable_computing Precedence: bulk We apologize if you receive this message more than once. Below, you will find the first Call for Papers of the JFPLC'97. A Latex version is joined at the end of this message. http://www.univ-orleans.fr/LIFO/jfplc97 Please post and/or forward to all interested colleagues. ------------------------------------------------------------------------------- First 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, Universite' d'Orle'ans, FRANCE) PROGRAM CHAIR ------------- Fre'de'ric Benhamou (LIFO, Universite' d'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 .......... (Universite' de Marseille, FRANCE) Philippe Devienne ......... (Universite' de Lille, FRANCE) Yves Deville .............. (Universite' Catholique de Louvain, BELGIUM) Franc,ois Fages ........... (CNRS, LIENS, ENS Paris, FRANCE) Laurent Fribourg .......... (CNRS, LIENS, ENS Paris, FRANCE) Franc,oise Gire ........... (Universite' Paris I, FRANCE) Jean-Louis Imbert ......... (Universite' d'Auvergne, FRANCE) Beaudoin Le Charlier ...... (Universite' de Namur, BELGIUM) Ken McAloon ............... (CUNY, NY, USA) Jean-Franc,ois Puget ...... (ILOG, FRANCE) Olivier Ridoux ............ (Universite' de Rennes, FRANCE) Michael Rusinowitch ....... (CRIN, INRIA Lorraine, FRANCE) Pascal Van Hentenryck ..... (Brown University, USA) Marie-Christine Vilarem ... (Universite' Montpellier, FRANCE) 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 http://www.univ-orleans.fr/LIFO/jfplc97 ----------------------- 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 French publisher. 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). 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. %%%%%%%%%%%%%%%%%%%%%%%%%%% please cut here %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%% %%%% %%%% LATEX VERSION %%%% %%%% %%%% %%%%%%%%%%%%%%%%%%%%%%%%%%% please cut here %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \documentstyle{article} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % 1st CALL FOR PAPERS JFPLC'97 % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \def\head{ % TITRE \begin{center} {\LARGE\bf\sf First Call for Papers {\huge\bf\sf JFPLC'97}}\\[0.2cm] {\Large\bf\sf Sixth French Conference on Logic and Constraint Programming\\[0.2cm] May 26-28, 1997\\[0.2cm] Orl\'eans -- France} \end{center} } \def\body{ % CALL TEXT \vspace{0cm} % CONFERENCE PRESENTATION The French Conference on Logic and Constraint Programming and UNIF$^{(*)}$, the International Workshop on Unification, are jointly organized in Orl\'eans 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), N\^{\i}mes\,(93) and Lille\,(92). \myspc % PROGRAM DETAILS 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 Orl\'eans-Technopole and will focus on products and applications of Constraint Programming. \myspc % YOUNG RESEARCHER AWARD 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 {\em December 31, 1996}). Authors meeting this requirement must mention it when submitting. \myspc % LANGUAGES AND PROCEEDINGS The conference proceedings will be published by a French publisher. Official JFPLC'97 languages are French and English. \myspc % TOPICS {\bf Scope\,:} Papers are welcome on all theoretical or experimental aspects of logic programming and/or constraint programming, including, but not limited to\,: \myspc \centerline{\begin{tabular}{ll} \theme{ Semantics}{ Higher-order programming} \theme{ Static Analysis}{ Deductive Databases} \theme{ Theorem Proving}{ Constraint Logic Programming} \theme{ Constraint resolution and optimization}{ Constraint Satisfaction Problems} \theme{ Operations Research}{ Concurrency} \theme{ Parallelism}{ Language Design and Implementation} \theme{ Applications}{ Methodology and environments} \end{tabular}} \myspc % SUBMISSIONS {\bf Submissions\,:} Authors are invited to send papers not exceeding {\em 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. \myspc % ELECTRONIC SUBMISSIONS Electronic submissions are strongly encouraged and should be made before {\em 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 {\tt jfplc97 [at] lifo [dot] univ-orleans.fr} before {\em January 4, 1997}. \myspc % SURFACE SUBMISSIONS 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. \myspc $^{(*)}$ The UNIF'97 workshop organized by S. Anantharaman (University of Orl\'eans) will be held on {\em May 28-30, 1997} in Orl\'eans. For any further information, please contact {\tt unif97 [at] lifo [dot] univ-orleans.fr}. \myspc % ADDITIONAL INFORMATIONS ON THE WEB \fbox{\begin{minipage}[t]{13.75cm}\footnotesize \names{Additional Informations} {\tt http://www.univ-orleans.fr/LIFO/jfplc97} \end{minipage}} } \def\pract{ % PRACTICAL INFORMATIONS \infor{ \names{~\hfill{\normalsize\bf JFPLC'97}\hfill~} \names{ Conference Chair} \lname{G.\,Ferrand}{U.\,Orl\'eans,\,FRA} \names{ Program Chair} \lname{F.\,Benhamou}{U.\,Orl\'eans,\,FRA} \names{ Program Committee} \name{S.\,Abdennadher}{U.\,Munich,\,GER} \name{A.\,Bockmayr}{MPI,\,GER} \name{P.\,Codognet}{INRIA,\,FRA} \name{J.\,Cohen}{Brandeis\,U.,\,USA} \name{A.\,Colmerauer}{U.\,Marseille,\,FRA} \name{P.\,Devienne}{U.\,Lille,\,FRA} \name{Y.\,Deville}{U.\,Louvain,\,BEL} \name{F.\,Fages}{CNRS,\,FRA} \name{L.\,Fribourg}{CNRS,\,FRA} \name{F.\,Gire}{U.\,Paris\,I,\,FRA} \name{J-L.\,Imbert}{U.\,Auvergne,\,FRA} \name{B.\,Le\,Charlier}{U.\,Namur,\,BEL} \name{K.\,McAloon}{CUNY,\,USA} \name{J-F.\,Puget}{ILOG,\,FRA} \name{O.\,Ridoux}{U.\,Rennes,\,FRA} \name{M.\,Rusinowitch}{INRIA,\,FRA} \name{P.\,Van\,Hentenryck}{Brown,\,USA} \lname{M-C.\,Vilarem}{U.\,Mtpellier,\,FRA} \names{ Posters Session Chair} \lename{N.\,Andrianarivelo} \names{ Organizing Committee} M. Berg\`ere, W. Bousdira, J. Cha\-bin, F. Goualard, L. Granvilliers, A. Lallouet, F. Le Berre, S. Limet, P. Rety, G. Richard, F. Saubion, A.~Tellez-Arenas, A. Tessier } \infor{ % SURFACE ADDRESS \names{Surface Mail} JFPLC'97 -- LIFO \\ Facult\'e des Sciences \\ Universit\'e d'Orl\'eans \\ 4, Rue L\'eonard de Vinci \\ B.P. 6759 \\ 45067 ORL\'EANS Cedex 2 \\ FRANCE } \infor{ % ELECTRONIC ADDRESS \names{Electronic Mail} {\tt jfplc97 [at] lifo [dot] univ-orleans.fr} } \infor{ % SPONSORED BY \names{ Supports} %Com. Europ\'eenne (CLN III), Minist\`ere de l'\'Education Nationale de l'Enseignement Sup\'erieur et de la Recherche, R\'egion Centre, D\'epartement du Loiret, Mairie d'Orl\'eans, Universit\'e d'Orl\'eans, CNRS, INRIA, Orl\'eans-Technopole, HITACHI (Orl\'eans), CNET (Issy les Moulineaux). } \infor{ % IMPORTANT DATES \names{ Important Dates} \name{{\em Abstract}}{{\bf Jan. 4, 1997}} \name{{\em Submission}}{{\bf Jan. 10, 1997}} \name{{\em Acceptance}}{{\bf Mar. 8, 1997}} \fname{{\em Final Version}}{{\bf Apr. 5, 1997}} } } % LATEX FORMAT \pagestyle{empty} \textwidth19cm \textheight27cm \topmargin-2.5cm \oddsidemargin-2cm \evensidemargin-2cm \newcommand{\myspc}{\vspace*{0.4cm}} \newcommand{\theme}[2]{$\bullet$ {#1}&$\bullet$ {#2}\\} \newcommand{\names}[1]{{\bf #1}\\[0.1cm]} \newcommand{\name}[2]{{#1}\dotfill{#2}\\} \newcommand{\lname}[2]{{#1}\dotfill{#2}\\[0.2cm]} \newcommand{\fname}[2]{{#1}\dotfill{#2}\\[-0.2cm]} \newcommand{\lename}[1]{{#1}\\[0.2cm]} \newcommand{\infor}[1]{\fbox{\begin{minipage}[t]{4.5cm} \footnotesize\vspace*{0.1cm}\par{#1} \end{minipage}}\vspace*{0.1cm}} % LATEX DOCUMENT \begin{document} \nopagebreak \hspace{1cm} \begin{minipage}[t]{18cm} \head \end{minipage}\\[0.3cm] \begin{minipage}[t]{5cm} \pract \end{minipage} \begin{minipage}[t]{14cm} \body \end{minipage} \end{document}