From owner-reliable_computing Wed Jul 2 04:04:24 1997 Received: by interval.usl.edu id AA21693 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Wed, 2 Jul 1997 09:04:27 -0500 Received: by interval.usl.edu id AA21683 (5.65c/IDA-1.4.4 for reliable_computing [at] interval [dot] usl.edu); Wed, 2 Jul 1997 09:04:24 -0500 Date: Wed, 2 Jul 1997 09:04:24 -0500 From: "Kearfott R. Baker" Message-Id: <199707021404.AA21683 [at] interval [dot] usl.edu> To: reliable_computing [at] interval [dot] usl.edu Subject: Re: Inclusion function of branching algorithm Sender: owner-reliable_computing Precedence: bulk > Date: Wed, 02 Jul 1997 09:28:17 +0200 > To: owner-reliable_computing [at] interval [dot] usl.edu > From: Luc Jaulin > Subject: Inclusion function of branching algorithm > Dear Interval Researchers, > > Interval analysis extends sequential algorithms on real numbers to > intervals. By sequential, I mean an algorithm for which the sequencing of > the execution of the instructions does not depend on the inputs. > > My question is :"For branching algorithms, i.e. algorithms that are non > sequential because they involve IF statement, does it exist a ready made > methodology for such an interval extension ?" > > This question is very important in bounded-error estimation that aims at > characterizing the set S of all parameter vectors that are consistent with > the data box Y. This problem is a set inversion problem S=f^{-1}(Y) and in > many cases, the model is an algorithm f, with many IF. > > Thank you for your help > > Luc Jaulin, lecturer in Angers (France) Luc, A number of people have thought about this question, from developing an abstract theory to proposed language constructs. If I recall correctly, Yakovlev (yakovlev [at] globlab [dot] msk.su) has considered certain theoretical aspects. Bill Walster (Bill.Walster [at] Eng [dot] Sun.com) has developed a set of "certainly," "possibly," and "set" relational operators to clarify thinking about conditional branches in coding with an interval data type; these sets of operators are presently under consideration for adoption with an interval data type in Fortran 2000. I have developed a "CHI" operator for conditional branches in interval computations supported by operator-overloading type automatic differentiation. Preprints of my papers can be found from my home page at: http://interval.usl.edu/kearfott.html by first clicking on "preprints" in the heading, then clicking on either "DVI file" or "Postscript file" under "Automatic Differentiation of Conditional Branches in an Operator Overloading Context, in Computational Differentiation: Techniques, Applications, and Tool" or "Treating Non-Smooth Functions as Smooth Functions in Global Optimization and Nonlinear Systems Solvers" or "Interval Extensions of Non-Smooth Functions for Global Optimization and Nonlinear Systems Solvers" Material on this technique also appears in my Chapter 6 of my book, "Rigorous Global Search: Continuous problems;" information on this book is also available from my home page. I note that, although my proposed technique looks promising both theoretically and practically, it has not been tried yet on large or complicated problems. You also should probably consider some of Herbert Fischer's work (Herbert.Fischer@statistik,tu-muenchen.dpb.de, I think), who has considered the "IF" problem in automatic differentiation. Does anyone else have comments? Best regards, Baker P.S. Luc: If you want your posting to go directly to the list, send it to reliable_computing [at] interval [dot] usl.edu, rather than to owner-reliable_computing [at] interval [dot] usl.edu. The latter, obtained by a "reply" to something from the list, just goes to me :-) --------------------------------------------------------------- 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 Wed Jul 2 02:45:04 1997 Received: by interval.usl.edu id AA21877 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Wed, 2 Jul 1997 10:10:07 -0500 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA21871 (5.65c/IDA-1.4.4 for ); Wed, 2 Jul 1997 10:10:04 -0500 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA20054; Wed, 2 Jul 97 08:45:05 MDT Date: Wed, 2 Jul 97 08:45:04 MDT From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9707021445.AA20054 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu, interval [at] cs [dot] utep.edu Subject: INTERVAL'98 CFP: updated Sender: owner-reliable_computing Precedence: bulk ----- Begin Included Message ----- From interval [at] informatik [dot] uni-wuerzburg.de Wed Jul 2 05:04:35 1997 Date: Wed, 2 Jul 1997 13:04:27 +0200 From: Interval 98 Mailing To: vladik [at] cs [dot] utep.edu Subject: INT'98 CFP Content-Length: 8509 >>> FIRST ANNOUNCEMENT and CALL FOR PAPERS <<< +------------------------------------------------+ | INTERNATIONAL CONFERENCE ON | | INTERVAL METHODS AND THEIR APPLICATION | | IN GLOBAL OPTIMIZATION | | | | (INTERVAL'98) | | | | April 20-23, Nanjing, China | +------------------------------------------------+ ORGANIZED BY - Department of Mathematics, Nanjing University - The Editorial Board of the International Journal "Reliable Computing" INTERNATIONAL PROGRAM COMMITTEE G. Alefeld (co-chair, Germany), G. Corliss (USA), A. Cuyt (Belgium), B. Dobronets (Russia), J. Garloff (Germany), R.B. Kearfott (co-chair, USA), V. Kreinovich (USA), S. Markov (Bulgaria), G. Mayer (Germany), M. Nakao (Japan), V.M. Nesterov (co-chair, Russia), H. Ratschek (Germany), J. Rokne (Canada), S. Rump (Germany), S. Shary (Russia), Z. Shen (chair, People's Republic of China), B. Walster (USA), E. Walter (France), D. Wang (People's Republic of China), J. Wolff von Gudenberg (co-chair, Germany), Z. You (People's Republic of China) Local organizer: Shen Zuhe INTERVAL'XX--CONFERENCES The conferences INTERVAL'XX are significant meetings devoted to various aspects of reliable numerical computations based on the interval approach. (Sometimes the terms validated numerics, localizational computations, or enclosure methods are used). Talks are devoted to development of corresponding mathematical structures, design of computer tools, and applications in a wide range of areas. The first conference was held in September 1992 near Moscow, with impressive success. Papers were presented by 106 participants from 17 countries throughout the world. It was decided to hold the INTERVAL'XX conferences biannually. The INTERVAL'92 conference emphasized the relation of interval computations to mathematical statistics. (The complete title of the conference was "Interval and Stochastic Methods in Science and Engineering"). The INTERVAL'94 conference emphasized interdisciplinary research with computer algebra. (The complete title of the conference was "Interval and Computer Algebraic Methods in Science and Engineering"). It took place March 6-11, 1994 in St. Petersburg, Russia. There were more than 120 talks presented by participants from 18 countries. INTERVAL'96 was focused on computer assisted proofs ranging from symbolic computation through rigorous error estimation, and including different paradigms such as functional and logic programming as well as solution of constraint systems. The traditional interval approach appeared as one important aspect common to most of the approaches. (The complete title of the conference was "Interval Methods and Computer aided Proofs in Science and Engineering"). It took place Sept 30 - Oct 2, 1996 in Wuerzburg, Germany. INTERVAL'98 will emphasize the application of interval mathematics and its combination with the interdisciplinary topics from the two preceding meetings in global optimization. Especially welcome are contributions which use interval arithmetic tools for solving problems of practical relevance. TOPICS The following topics will be considered: interval mathematics, hardware and software for interval and computer-algebraic methods, SC-languages, logic constraint programming, interval modelling, interval constraints, computer aided proofs in analysis, interval algorithms in control theory, organization of symbolic-numeric interfaces, programming environments for scientific computing, and applications in various fields of science and engineering as well as commercial issues. TIME AND PLACE The conference will be held April 20-23 in Nanjing, China. Nanjing(Nanking), situated at 32 degree north latitude and 119 degree east longitude, is the provincial capital and also the political, economic and cultural centre of Jiangsu Province. The city of Nanjing is well placed with the vast Jiangsu plain lying to the north, the rich Changjiang (Yangtse) River delta to the southeast, the gigantic bridge striding over the turbulent river which runs through the city, the Purple Hills towering in its eastern suburbs and the Stone City Wall standing in the west. More information about Nanjing see below. There are several ways to get to Nanjing: 1. from HongKong to Nanjing by air(probably this is the best way to reach Nanjing); 2. from Beijing to Nanjing by air or by railway train(~15 hours over night); 3. from Shanghai to Nanjing by air, by train(~4 hours), or by bus (a new highway, ~3 hours). There is a hotel in the University. The price of a two bed room: appr. US$60/per night. (Unfortunatly, there are no one bed rooms.) FEES The registration fee for the conference will be US$120. EXTENDED ABSTRACTS AND PAPERS Two copies of an extended abstract of maximum 2 pages are requested for selection purposes. The deadline will be 31.10.1997. Electronic submission is strongly recommended. A collection of extended abstracts will be printed before the conference. Refereed proceedings including full versions of selected papers will be published after the conference. LANGUAGES The official language is English. IF YOU WISH TO GET MORE DETAILED INFORMATION CONTACT: Prof. Dr. Shen Zuhe email:shenzuhe [at] netra [dot] nju.edu.cn Mail address : Department of Mathematics Nanjing University Nanjing 21008 People's Republic of China HISTORY OF NANJING Located in the subtropical zone, it enjoys a mild climate with the annual mean temperature at 15 C. Dry in winter, Nanjing is marked by intermittent drizzles in spring but gets most of the rainfall in summer. Nanjing is an old city with a long history. As far back as three or four thousand years ago Chinese forefathers already began to live and work here. Around 1,100 B.C. this region was within the territory of the state of Wu. By the end of the Spring and Autumn Period there was a town with an important smelting industry, called Yecheng or the Metallurgical City, occupying what is now the area around Chaotian Gong. In 473 B.C., when Goujian, the King of the state of Yue, conquered Wu, Fan Li, the Yue prime minister, built a city at Changgan Lane(the area around today's Zhonghuamen Gate) and named it Yuecheng. In the Warring States Period, when Yue was conquered in its turn by the state of Chu, a city named Jinling was built on Stone Hill (now called Qingliang Hill), and that is why, in literary writings, Jinling is often used to refer to Nanjing. During the period of the Three Kingdoms(229-280 A.D.), Sun Quan made it his capital and renamed it Jianye and built a stone wall around it. Nanjing thus began to be the capital of six southern dynasties (Wu, Eastern Jin, Song, Qi, Liang and Chen). With the founding of the Ming Dynasty(1368), the city became for the first time the national capital of the whole country. It was not called Nanjing, however, until 1421 when Emperor Yongle moved the capital to Beijing. During the period of 1853-1864, the Kingdom of Heavenly Peace, founded in revolt against the Qing Dynasty, established its capital here and called it Tianjing. The city resumed its name Nanjing in 1912 with the establishment of a provisional government following the overthrow of the Qing Dynasty by the 1911 Revolution led by Dr. Sun Yat-sen. From 1927 onwards Nanjing was the capital of the Kuomintang Government until it was liberated in April 1949. Clean, spacious and well kept, Nanjing is also a green city with its streets well lined with various trees. As Nanjing is a city with an ancient cultural background, there are many places of interest to visit. The busiest districts in Nanjing are Xinjiekou, Fuzimiao and the Drum Tower area. SIGHTSEEING The local organizers will arrange a sightseeing tour through Nanjing. Furthermore there are plans to arrange an extended excursion to the vicinity of Nanjing (Yellow Mountain). Detailed information will follow later. ----- End Included Message ----- From owner-reliable_computing Thu Jul 3 13:47:42 1997 Received: by interval.usl.edu id AA22903 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Thu, 3 Jul 1997 05:00:28 -0500 Received: from mimi.imi.hr by interval.usl.edu with SMTP id AA22897 (5.65c/IDA-1.4.4 for ); Thu, 3 Jul 1997 05:00:19 -0500 Received: from gandalf (gandalf [161.53.108.20]) by mimi.imi.hr (8.8.5/8.8.4) with SMTP id LAA07633; Thu, 3 Jul 1997 11:47:42 +0200 (MET DST) Date: Thu, 3 Jul 1997 11:47:42 +0200 (MET DST) Message-Id: <199707030947.LAA07633 [at] mimi [dot] imi.hr> X-Sender: dsimic [at] mimi [dot] imi.hr X-Mailer: Windows Eudora Version 1.4.4 Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" To: stat-l [at] vm1 [dot] mcgill.ca, reliable_computing [at] interval [dot] usl.edu, iasc [at] stat [dot] unipg.it From: dsimic [at] imi [dot] hr (Diana Simic) Subject: ITI'98 Call for Papers Cc: wesna [at] srce [dot] hr Sender: owner-reliable_computing Precedence: bulk I appologize for crossposting. Diana **************************************************************************** ***** Call for papers March 15, 1998 20th International Conference INFORMATION TECHNOLOGY INTERFACES ITI '98 Pula, Croatia June 16-19, 1998. http://www.srce.hr/iti Meeting of Researchers in Computer Science, Information Systems, Operations Research and Statistics Topics: 1. Application of Information Technology 2. Artificial Inteligence and Expert Systems 3. Biometrics 4. Computer Systems and Networks 5. Data Analysis and Statistics 6. Design, Synthesis and Test, Methodologies and Applications 7. Information Systems and Databases 8. Mathematics and Computation 9. Modelling, Simulation and Optimization 10. Multimedia 11. Software Engineering and Programming Languages Organized by: University Computing Centre, University of Zagreb, Croatia Co-sponzored by: IMACS - International Association for Mathematics and Computers in Simulation SCS - The Society for Computer Simulation International Co-operating institutions: ARGESIM, Tech. Univ. Vienna Athens Univ. of Economics and Business Croatian Soc. for Biometrics Croatian Soc. for Simulation Modelling Dept. of Comp. Sci., North Carolina State Univ. Dept. of Comp. Sci. and Eng., Slovak Tech. Univ., Bratislava Dept. of Stat. and Op. Res., Polytech. Univ. of Catalonia European Business Management School, Swansea Faculty of Electrical Engineering and Computing, University of Zagreb IEEE Croatia Section, IEEE Croatia Section Computer Chapter School of Computing and Management Sciences, Sheffield Hallam Univ. Submit 3 copies of original papers (do not exceed 6 pages including references, appendices and figures). Submission details are available from conference headquarters. Deadlines: February 1, 1998 Registration forms March 15, 1998 Full papers (camera ready) May 15, 1998 Notification of acceptance Contact: ITI '98 UNIVERSITY COMPUTING CENTRE J. Marohnica bb, HR-10000 Zagreb, Croatia Phone/Fax: (+385 1) 616 55 91 E-mail: iti [at] srce [dot] hr URL: http://www.srce.hr/iti ******************************************************************************** From owner-reliable_computing Thu Jul 3 10:53:35 1997 Received: by interval.usl.edu id AA23195 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Thu, 3 Jul 1997 05:56:56 -0500 Received: from rztsun.rz.tu-harburg.de by interval.usl.edu with SMTP id AA23189 (5.65c/IDA-1.4.4 for ); Thu, 3 Jul 1997 05:56:51 -0500 Message-Id: <01BC87B0.823D98C0@rump> From: "Siegfried M. Rump" To: "'reliable_computing [at] interval [dot] usl.edu'" Subject: AW: linear systems - Help Date: Thu, 3 Jul 1997 12:53:35 +-200 Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing Precedence: bulk My question concerns the solution of linear systmes of equations with interval coefficients. Let's consider a linear system AX=B where Aij and Bi coefficients are functions of N interval variables. That is : A(y1,...,yN) X = B(y1,...,yN) (1) The first paper dealing with dependencies is Ch. Jansson: Interval Linear Systems with Symmetric Matrices, Skew-Symmetric Matrices and Dependencies in the Right hand Side, Computing 46, 265-274 (1991). The idea can be extended to arbitrary linear dependencies between the matrix components and the components of the right hand side. This is done in S.M. Rump: Verification methods for Dense and Sparse Systems of Equations, in "Topics in Validated Computations", ed. J. Herzberger, Elsevier Publications, 1995. Data dependencies are treated in Chapter 4.3. Best regards, Siegfried M. Rump From owner-reliable_computing Fri Jul 4 07:13:49 1997 Received: by interval.usl.edu id AA25023 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 4 Jul 1997 14:13:56 -0500 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA25017 (5.65c/IDA-1.4.4 for ); Fri, 4 Jul 1997 14:13:52 -0500 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA18145; Fri, 4 Jul 97 13:13:49 MDT Date: Fri, 4 Jul 97 13:13:49 MDT From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9707041913.AA18145 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu Subject: Re: AW: linear systems - Help Sender: owner-reliable_computing Precedence: bulk > My question concerns the solution of linear systmes of equations with interval > coefficients. > > Let's consider a linear system AX=B where Aij and Bi coefficients are > functions of N interval variables. That is : > > A(y1,...,yN) X = B(y1,...,yN) (1) > > > The first paper dealing with dependencies is ... The extreme complexity of this problem in general can be proven by the fact that an arbitrary algebraic set can be represented as a set of all possible solution of an appropriate linear systems with coefficients linearly depending on interval variables. For a proof, see: G\"otz Alefeld, Vladik Kreinovich, and G\"unter Mayer, ``The Shape of the Solution Set for Systems of Interval Linear Equations with Dependent Coefficients'', {\it Mathematische Nachrichten} (to appear). The corresponding LaTeX file tr95-39a.tex and the relevant stylefile mathnach.sty can be downloaded by ftp from cs.utep.edu, login anonymous, directory pub/reports. From owner-reliable_computing Sun Jul 6 09:09:50 1997 Received: by interval.usl.edu id AA26177 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Sun, 6 Jul 1997 16:09:58 -0500 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA26171 (5.65c/IDA-1.4.4 for ); Sun, 6 Jul 1997 16:09:54 -0500 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA21591; Sun, 6 Jul 97 15:09:50 MDT Date: Sun, 6 Jul 97 15:09:50 MDT From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9707062109.AA21591 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu Subject: for designers of linear algebra software Sender: owner-reliable_computing Precedence: bulk From: Jack Dongarra Date: Fri, 4 Jul 1997 08:35:00 -0400 Subject: Survey of Freely Available Linear Algebra Software I'm putting together information on freely available software for the solution of linear algebra problems. The interest is in software for high-performance computers that's available in source form on the web for solving problems in numerical linear algebra, specifically dense, sparse direct and iterative systems and sparse iterative eigenvalue problems. I have started a list, see the url http://www.netlib.org/utk/people/JackDongarra/la-sw.html Please let me know about updates and corrections. Thanks, Jack From owner-reliable_computing Sun Jul 6 09:14:39 1997 Received: by interval.usl.edu id AA26295 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Sun, 6 Jul 1997 16:14:44 -0500 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA26289 (5.65c/IDA-1.4.4 for ); Sun, 6 Jul 1997 16:14:41 -0500 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA21888; Sun, 6 Jul 97 15:14:39 MDT Date: Sun, 6 Jul 97 15:14:39 MDT From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9707062114.AA21888 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu Subject: copied from NA Digest Sender: owner-reliable_computing Precedence: bulk From: John Tucker Date: Mon, 30 Jun 1997 10:45:15 -0400 Subject: ICM98 Session on Mathematical Software [The following announcement from Martin Groetschel, President of the ICM98 Organizing Committee, is forwarded by John Tucker, Director, Board on Mathematical Sciences, Room NAS 315, National Academy of Sciences, 2101 Constitution Avenue, N.W., Washington, D. C. 20418, (202) 334-2421, NEW Fax: (202) 334-2422, E-mail: jtucker [at] nas [dot] edu .] Dear colleague: The President of the International Mathematical Union (IMU) has asked the Organizing Committee of the International Congress of Mathematicians 1998 (ICM98, Aug 18 to 27, 1998 in Berlin, see URL: http://elib.zib.de/ICM98) to consider arranging - in addition to the scientific program under the responsibility of the ICM98 program committee - a special session on mathematical software. No special focus or form of presentation was suggested. The only wish was to cover a broad spectrum. Thus, if possible, the session should include general purpose computer algebra systems as well as, e.g., software systems specialized on number theory, algebra or optimization, or systems assisting the work of the mathematicians in some other specific way. The session should be open for presentations from commercial and academic software development groups. This is the first call for contributions to get an idea about how many groups or companies are interested in such presentations and to find out their specific wishes. The current idea is that the Organizing Committee will set up a small committee to select up to 10 software systems for oral 30 minute presentations during one or two afternoons of the congress. Detailed plans can only be made if a good estimate on the number of participants is available. The organizing committee is also contemplating to offer, for a fee to be determined, space for computer demonstrations of the software packages during the congress - possibly in connection with the book exhibition at ICM98. Technical support from the Technische Universitaet Berlin, where the congress will take place, will be very modest, though. Any response or comment on this first call for participation is welcome. Please send your reply to Winfried Neun Konrad-Zuse-Zentrum Takustrasse 7 D-14195 Berlin Germany e-mail: neun [at] zib [dot] de preferrably via e-mail and feel free to give suggestions or to ask questions. If sufficiently many groups show an interest in this event by August 31, 1997, the ICM98 Organizing Committee will go ahead with the planning. Sincerely Martin Groetschel President of the ICM98 Organizing Committee More information about ICM98 can be found in the ICM98 WWW-server. Its master site in Berlin has the URL: http://elib.zib.de/ICM98 Mirror sites of the ICM98 WWW-server are located in Bombay(India), Copenhagen (Denmark), Kyoto (Japan), Marseille (France), Rio de Janeiro (Brazil). This WWW-server also offers an electronic preregistration form. If you do not have access to the World Wide Web and would like to subscribe to the ICM98 circular letters, just send an e-mail to icm98 [at] zib [dot] de writing PRELIMINARY PREREGISTRATION into the SUBJECT line. From owner-reliable_computing Tue Jul 8 19:22:58 1997 Received: by interval.usl.edu id AA28565 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Tue, 8 Jul 1997 10:25:58 -0500 Received: from babinet.univ-angers.fr by interval.usl.edu with SMTP id AA28558 (5.65c/IDA-1.4.4 for ); Tue, 8 Jul 1997 10:24:45 -0500 Received: from [193.49.163.41] by babinet.Univ-Angers.Fr with SMTP (1.37.109.4/16.2) id AA04210; Tue, 8 Jul 97 17:19:38 +0200 Message-Id: <3.0.1.32.19970708172258.00691850 [at] babinet [dot] univ-angers.fr> X-Sender: jaulin [at] babinet [dot] univ-angers.fr X-Mailer: Windows Eudora Light Version 3.0.1 (32) Date: Tue, 08 Jul 1997 17:22:58 +0200 To: reliable_computing [at] interval [dot] usl.edu From: Luc Jaulin Subject: Discret event systems (DES) In-Reply-To: <199707071828.OAA03670 [at] mail3 [dot] uts.ohio-state.edu> Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Sender: owner-reliable_computing Precedence: bulk Dear interval researcher, Two weeks ago, I asked you a question about computing inclusion functions for IF algorithms. Dr R. Moore suggested me to give you a simple example can describe the difficulties I am encountering. Example ------- In a manufacturing system (this is a Discret Event System (DES)), 10 identical parts are given to the input at times e1,e2,...,e10. For example, E=(e1,e2,...,e10)=(1,1,1,3,5,9,9,15,16,16). The vector E is said to be a dater. Note that E(4)=3. This means that the part numbered 4 is given at time 3 seconds). These 10 parts have to be manufactured by two machines M1 and M2. The loading of a part in a machine occurs only when this machine is free. The working time of the machines are given by t1 for M1 and t2 for M2. When a part is available, the machine that is choosen to deal with this part is the one that can complete it as early as possible. The times at which the parts are completed are denoted by Y=(y1,...,y10). In what follows, f1 and f2 contains times at which machines M1 and M2 are free. Let us consider the following algorithm that computes the outputs Y of the DES, given the working time t1 and t2. 1 Input : t1,t2; 2 f1:=0; f2:=0; 3 (e1,e2,...,e10)=(1,1,1,3,5,9,9,15,16,16); 4 For i:=1 to 10 do 5 z1:=max(f1,ei)+t1; 6 z2:=max(f2,ei)+t2; 7 If z1<=z2 then 8 {yi:=z1; 9 f1:=z1} 10 Else 11 {yi:=z2; 12 f2:=z2} 13 EndFor 14 Outpout (y1,...,y10); Line 2: At the begining, M1 is free at time t1=0, and t2 is free at time t2=0. Line 3: Initialization ot the time sequence at which part are coming to the input. Line 5: If the part i is available at time ei, if M1 is free at time f1, if the working time of M1 is t1, then M1 can complete the part i at time z1. Line 6: Idem for M2. Line 7,8,9: If M1 can complete the part i ealier than M2, then M1 is selected. The part will be completed at time yi and M1 will then be free at time f1. For intance, with t1=2 and t2=3, the algorithm generates : i 1 2 3 4 5 6 7 8 9 10 ei 1 1 1 3 5 9 9 15 16 16 F1 0 3 3 ... F2 0 0 4 ... z1 3 5 ... z2 4 4 ... yi 3 4 ... For performance evaluation, scheduling problems , or bounded-error estimation involving such a DES, it is necessary to compute an interval extension for the above algorithm. As you can see, for t1=[1,3] and t2=[2,5] (this is but an example), the interval evaluation is not so trivial. Even with this simple system, to the best of my knowledge, nobody, in the DES community, can deal with it in a guaranteed way. I am sure that interval analysis could be very helpfull to solve many applications involving DES. If you have any suggestions or if you want more informations, please, contact me. Best regards Luc From owner-reliable_computing Tue Jul 8 20:00:30 1997 Received: by interval.usl.edu id AA28840 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Tue, 8 Jul 1997 11:08:06 -0500 Received: from mpi-sb.mpg.de (james1.mpi-sb.mpg.de) by interval.usl.edu with SMTP id AA28833 (5.65c/IDA-1.4.4 for ); Tue, 8 Jul 1997 11:03:46 -0500 Received: from twinpeaks.mpi-sb.mpg.de (twinpeaks.mpi-sb.mpg.de [139.19.3.9]) by mpi-sb.mpg.de (8.8.5/8.8.5) with ESMTP id SAA23823 for ; Tue, 8 Jul 1997 18:00:28 +0200 (MET DST) Received: (from podelski@localhost) by twinpeaks.mpi-sb.mpg.de (8.7.1/8.7.3) id SAA20517 for reliable_computing [at] interval [dot] usl.edu; Tue, 8 Jul 1997 18:00:30 +0200 (MET DST) Date: Tue, 8 Jul 1997 18:00:30 +0200 (MET DST) Message-Id: <199707081600.SAA20517 [at] twinpeaks [dot] mpi-sb.mpg.de> From: Andreas Podelski Subject: Call for Participation - CP97 Apparently-To: Sender: owner-reliable_computing Precedence: bulk We apologize for multiple copies. This message lists the invited and tutorial speakers, the accepted papers, and the workshops organized around the conference; it also contains the registration form and the hotel reservation form. Up-to-date information can be found at the CP97 web site http://www.mpi-sb.mpg.de/conferences/CP97/. CALL FOR PARTICIPATION Third International Conference on Principles and Practice of Constraint Programming (CP97) Schloss Hagenberg, Austria, October 29 - November 1, 1997 Scope of the Conference Constraints have emerged as the basis of a representational and computational paradigm that draws from many disciplines and can be brought to bear on many problem domains. The conference is concerned with all aspects of computing with constraints including: algorithms, applications, environments, languages, models, systems. Conference Venue CP97 will take place at Schloss Hagenberg, a medieval, renovated castle close to Linz, Austria, known as the site of the Research Institute for Symbolic Computation (RISC). Invited Speakers Steven Minton: ``Configurable Solvers: Tailoring General Methods to Specific Applications'' Pascal Van Hentenryck: ``A Modeling Language for Constraint Programming'' Tutorial Speakers Yves Caseau: ``Complex scheduling problems that require complex resources and travel'' Laurent Michel and Jean-Francois Puget: ``Interval methods for non linear constraints'' Leszek Pacholski and Andreas Podelski: ``Set Constraints'' Paper Presentations The list of 37 accepted papers (out of 132 submissions) is below. The proceedings will be published in the Springer LNCS series; they will be available at the conference. Selected papers will appear in a special issue of the CONSTRAINTS journal devoted to the conference. Workshops on October 27-28, preceding the Conference FTP97 International Workshop on First-Order Theorem Proving COTIC 97 Concurrent Constraint Programming for Time Critical Applications Annual workshop of the CompulogNet, area "Constraint Programming", joint with the second meeting of the ERCIM working group on Constraints CP97 Workshops on November 1, the last day of the Conference Constraints and Bioinformatics/Biocomputing Constraint Reasoning on the Internet The Theory and Practice of Dynamic Constraint Satisfaction Industrial Constraint-directed Scheduling Set Constraints and Constraint-based Program Analysis Official Sponsors: Compulog, Ilog, Prologia, DFKI, MPI, RISC Conference Organization Conference Chair: Bruno Buchberger (RISC) Bruno.Buchberger [at] risc [dot] uni-linz.ac.at Program Chair: Gert Smolka (DFKI and Universitaet des Saarlandes) smolka [at] ps [dot] uni-sb.de Program Committee: Franz Baader (RWTH Aachen) Frederic Benhamou (University of Orleans) Alex Brodsky (George Mason University) Yves Caseau (Bouygues) Hoon Hong (RISC) John Hooker (CMU) Joxan Jaffar (National University of Singapore) Claude Kirchner (INRIA Lorraine and CRIN) Michael Maher (Griffith University) Kim Marriott (Monash University) Dave McAllester (AT&T Research) Ken McAloon (Brooklyn College) Bernhard Nebel (University of Freiburg) Tobias Nipkow (TU Muenchen) Martin Odersky (TU Karlsruhe and University of South Australia) Catuscia Palamidessi (University of Genova) Andreas Podelski (Max-Planck-Institut fuer Informatik) Jean-Francois Puget (ILOG) Francesca Rossi (University of Pisa) Thomas Schiex (INRA) Bart Selman (AT&T Research) Gert Smolka (DFKI and Universitaet des Saarlandes) Peter J. Stuckey (University of Melbourne) Edward Tsang (University of Essex) Peter van Beek (University of Alberta) Mark Wallace (ICL/Imperial College) Publicity and Workshop Chair: Andreas Podelski (Max-Planck-Institut fuer Informatik) podelski@mpi-sb.mpg.de Organizing Committee: Alan Borning (University of Washington) Alain Colmerauer (University of Marseille) Eugene Freuder (University of New Hampshire) Jean-Pierre Jouannaud (University of Paris Sud) Jean-Louis Lassez (New Mexico Tech) Ugo Montanari (University of Pisa) Anil Nerode (Cornell University) Vijay Saraswat (AT&T Research) Pascal Van Hentenryck (Brown University) Ralph Wachter (Office of Naval Research) ---------------------------------------------------------------------- CP97 Accepted Papers Operational Semantics and Confluence of Constraint Propagation Rules Slim Abdennadher Random Constraint Satisfaction: A More Accurate Picture Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Michael S.O. Molloy, Yannis C. Stamatiou Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems Philippe Baptiste, Claude Le Pape Five Pitfalls of Empirical Scheduling Research J. Christopher Beck, Andrew J. Davenport, Mark S. Fox Satisfiability of Quantitative Temporal Constraints with Multiple Granularities Claudio Bettini, X. Sean Wang, Sushil Jajodia Narrowing a block of sortings in quadratic time Noelle Bleuzen Guernalec, Alain Colmerauer Semantics and expressive power of a Timed Concurrent Constraint Language F.S. de Boer, M. Gabbrielli, M.C. Meo AC unification of Higher-Order Patterns Alexandre Boudet, Evelyne Contejean Solving Various Weighted Matching Problems with Constraints Yves Caseau, Francois Laburthe Tractable Disjunctive Constraints David Cohen, Peter Jeavons, Manolis Koubarakis >From Restricted Path Consistency to Max-Restricted Path Consistency Romuald Debruyne, Christian Bessiere Solving Classes of Set Constraints with Tree Automata P. Devienne, JM. Talbot, S. Tison Tabu Search for Maximal Constraint Satisfaction Problems Philippe Galinier, Jin-Kao Hao The Logic of Search: Theory and Applications Ian P. Gent, Judith L. Underwood The Constrainedness of Arc Consistency Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Paul Shaw, Toby Walsh Bounding the Optimum of Constraint Optimization Problems Simon de Givry, Gerard Verfaillie, Thomas Schiex Heavy-Tailed Probability Distributions in Combinatorial Search Carla P. Gomes, Bart Selman, Nuno Crato Tractable Recursion over Geometric Data Stephane Grumbach, Gabriel Kuper Reconfigurable architectures: A new vision for optimization problems Youssef Hamadi, David Merceron Compiling Constraint Solving using Projection Warwick Harvey, Peter Stuckey, Alan Borning On the Complexity of Unification and Disunification in Commutative Idempotent Semigroups Miki Hermann, Phokion G. Kolaitis Distributed Partial Constraint Satisfaction Problem Katsutoshi Hirayama, Makoto Yokoo Finding Dense Subgraphs of Constraint Graphs Christoph M. Hoffman, Andrew Lomonosov, Meera Sitharam Counting, structure identification and maximum consistency for binary constraint satisfaction problems Gabriel Istrate Oscillation, Heuristic Ordering and Pruning in Neighborhood Search Jean-Marc Labat, Laurent Mynard Look-Ahead Versus Look-Back for Satisfiability Problems Chu Min Li, Anbulagan Verification of Parallel Systems using Constraint Programming Stephan Melzer Localizer: A Modeling Language for Local Search Laurent Michel, Pascal Van Hentenryck Ordering Constraints over Feature Trees Martin Mueller, Joachim Niehren and Andreas Podelski GENIUS-CP: a Generic Vehicle Routing Algorithm Gilles Pesant, Michel Gendreau, Jean-Marc Rousseau A filtering algorithm for global sequencing constraints Jean-Charles Regin, Jean-Francois Puget Statistical Analysis of Backtracking on Inconsistent CSPs using Reliability Models Irina Rish, Daniel Frost Understanding and Improving the MAC Algorithm Daniel Sabin, Eugene C. Freuder Programming Constraint Inference Engines with First-Class Computation Spaces Christian Schulte NeMo+: Object-Oriented Constraint Programming Environment Based on Subdefinite Models Igor Shvetsov, Vitaly Telerman, Dmitry Ushakov Modelling Exceptionally Hard Constraint Satisfaction Problems Barbara M. Smith, Stuart A. Grant Why Adding More Constraints Makes a Problem Easier for Hill-climbing Algorithms: Analyzing Landscapes of CSPs Makoto Yokoo ---------------------------------------------------------------------- Registration Form Third International Conference on Principles and Practice of CONSTRAINT PROGRAMMING (CP 97) RISC, Castle of Hagenberg, Austria October 29 - November 1, 1997 Personal Data: Family Name: First Name: Affiliation: Mailing Address: Country: e-mail: Phone: Fax: Conference Registration fees: Registration and payment Registration and payment received by Sept. 19, 1997 received after Sept. 19, 1997 Regular* USD 420 USD 460 Students** USD 200 USD 240 Accompanying Person *** USD 230 USD 270 Additional banquet ticket: USD 50 USD 50 For lunches etc.: o Vegetarian o Regular food Payment: Please choose one of the following. All payments must be made in US $. o I have remitted the above total fee on . . . . . . . . . . .(Date) to the account "CP97", No. 26203, Raiffeisenbank Hagenberg, BLZ: 34151, A-4232 Hagenberg, Austria (Europe). I add a copy of the transfer form to confirm the remittance. o I add a bank cheque for the above total fee payable to the account "CP97" No. 26203, Raiffeisenbank Hagenberg, BLZ: 34151, A-4232 Hagenberg, Austria (Europe). o I agree to remit above total fee by credit card o American Express o Mastercard o VISA Card Number: Card holder's name: Expiration Date: Date: Authorized Signature: Date Signature * Fee for regular participant includes: proceedings, refreshment breaks, lunches (hors d'oeuvre, main meal, dessert, drink), conference banquet, shuttle bus from conference hotel to the conference site and back, shuttle bus to the restaurant for the conference dinner, guided walk in the hilly area of the "Muehlviertel". ** Fee for students includes: proceedings, refreshment breaks, lunches (hors d'oeuvre, main meal, dessert, drink), shuttle bus from conference hotel to the conference site and back, guided walk in the hilly area of the "Muehlviertel". *** Fee for accompanying person includes: all conference sessions, refreshment breaks, lunches (hors d'oeuvre, main meal, dessert, drink), conference banquet, shuttle bus from conference hotel to the conference site and back, shuttle bus to the restaurant for the conference dinner, guided walk in the hilly area of the "Muehlviertel". Social programme for accompanying persons and guests (excursion to Salzburg or Vienna) is planned. Please contact the conference office (bcurtis [at] risc [dot] uni-linz.ac.at). Please send the completed form by e-mail or fax or surface mail to: Betina Curtis, RISC - Research Institute for Symbolic Computation Schloss Hagenberg, A-4232 Hagenberg Fax: +43(7236)323130 Tel.:+43(7236)323121 E-mail: bcurtis [at] risc [dot] uni-linz.ac.at ---------------------------------------------------------------------- Hotel Reservation Form Third International Conference on Principles and Practice of Constraint Programming (CP 97) RISC, Castle of Hagenberg, Austria October 29 - November 1, 1997 Name: Affiliation Address: e-mail: Phone: Fax: Accompanying Person(s): Family Name: First Name: I reserve as follows: Arrival Date: Departure Date: o single room ATS 890,- = about US $ 75,- per day/person o double room ATS 550,- = about US $ 47,- per day/person Included in the price: Breakfast buffet, health club, shuttle service airport - hotel - airport. There is a small contingent of student rooms available. These accommodations are secluded and scattered over the region. If you want to reserve this room-category, please contact the local organizer Betina Curtis, e-mail: bcurtis [at] risc [dot] uni-linz.ac.at). o I arrive by plane and need a shuttle service to the hotel: Arrival time: Flight from: Flight number: Please send the completed form by e-mail or fax or surface mail to: Betina Curtis, RISC - Research Institute for Symbolic Computation Schloss Hagenberg, A-4232 Hagenberg Fax: +43(7236)323130 Tel.:+43(7236)323121 E-mail: bcurtis [at] risc [dot] uni-linz.ac.at From owner-reliable_computing Wed Jul 9 03:37:32 1997 Received: by interval.usl.edu id AA29854 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Tue, 8 Jul 1997 18:38:08 -0500 Received: from cesit1.unifi.it by interval.usl.edu with SMTP id AA29848 (5.65c/IDA-1.4.4 for ); Tue, 8 Jul 1997 18:38:03 -0500 Received: from aguirre.ing.unifi.it by CESIT1.UNIFI.IT (PMDF V5.0-4 #3688) id <01IL0KA3VEC0001N8L [at] CESIT1 [dot] UNIFI.IT> for reliable_computing [at] interval [dot] usl.edu; Wed, 09 Jul 1997 01:37:34 +0100 (MET) Received: from ozon180.cs.dsi by aguirre.ing.unifi.it (4.1/SMI-4.1) id AA24896; Wed, 09 Jul 1997 01:37:32 +0200 Received: by ozon180.cs.dsi (5.0/SMI-SVR4) id AA14609; Wed, 09 Jul 1997 01:37:32 +0200 Date: Wed, 09 Jul 1997 01:37:32 +0200 From: oq95 [at] aguirre [dot] ing.UNIFI.IT (( NESI )) Subject: Special Issue on Defect Detaction: Journal of Real-Time Imaging (AP) To: reliable_computing [at] interval [dot] usl.edu Message-Id: <9707082337.AA14609 [at] ozon180 [dot] cs.dsi> Content-Transfer-Encoding: 7BIT Sender: owner-reliable_computing Precedence: bulk Dear Sirs Here is the call for papers for SPECIAL ISSUE ON DEFECT DETECTION for the JOURNAL OF REAL-TIME IMAGING Please accept our apologies if you receive multiple copies of this call. Please post and/or forward to all interested colleagues. Thank you in advance for your kind collaboration. Cheers, the Guest Editors ---------------------------------------------------------------------- CALL FOR PAPERS JOURNAL OF REAL TIME IMAGING Academic Press Special Issue on REAL-TIME DETECTION OF DEFECTS Quality control is a crucial issue for any production process, and many of the traditional methods for defect detection in manufacturing are rapidly changing. Real-time defect detection of shape, colours and textures is becoming mandatory for many products (from tiles to cars, from food to airplane components) made of a variety of materials (fabric, marble, leather, plastic and so on) to meet increasingly demanding quality standards. For this reason, several researchers have been studying parallel architectures, special chips and algorithms for real-time defect detection. Thanks to such new technologies, many new applications have already become possible, and others, unfeasible until today because of the limitations of inspection methods, are being developed and implemented. AIM: The aim of this special issue is to inform practitioners as well as researchers timely of innovative defect detection techniques and their possible applications. SCOPE: The special issue is focussed on real-time techniques and architectures, both software and hardware, for - recognition and classification of defects; - detection of defects in texture and pattern; - detection of shape defects; - detection of defects in colour; - defect modeling: fractals, statistic, etc.; - automatic acquisition of models suitable for defect detection; - validation techniques for defect detectors. Guest Editors: Paolo Nesi Emanuele Trucco Dipartimento di Sistemi e Informatica Dept of Computing and Electrical Eng. University of Florence Heriot-Watt University, Via S. Marta 3 Riccarton, 50139 Firenze, ITALY Edinburgh, EH14 4AS, UK Tel: +39-55-4796523 Tel: +44 131 451.3437 Fax: +39-55-4796363 Fax: +44 131 451.3431 email: nesi [at] ingfi1 [dot] ing.unifi.it email: mtc [at] cee [dot] hw.ac.uk Papers should present innovative results which can be useful for technologists and practitioners alike. Basic research on specific low-level techniques ensuring real-time performances, as well as experiences reporting the development of specific applications are welcome. MANUSCRIPT SUBMISSION Papers must be submitted by *October 31, 1997* to Emanuele Trucco, JRTI Special Issue Co-Editor. Submission guidelines and general information regarding the Special can be found on-line at http://www.cee.hw.ac.uk/~mtc/special/call.html ftp: osiris.cee.hw.ac.uk (anonymous login, then cd pub/rtispecial) Submissions must satisfy the rules of the journal (included in the WWW and ftp sites) for what concerns originality and copyright permission. Notification of acceptance will be sent to the authors by February 1998. Any questions, please contact one of the Editors by email, FAX or phone. From owner-reliable_computing Wed Jul 9 06:00:03 1997 Received: by interval.usl.edu id AA00627 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Wed, 9 Jul 1997 13:00:15 -0500 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA00621 (5.65c/IDA-1.4.4 for ); Wed, 9 Jul 1997 13:00:07 -0500 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA17046; Wed, 9 Jul 97 12:00:03 MDT Date: Wed, 9 Jul 97 12:00:03 MDT From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9707091800.AA17046 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu, interval [at] cs [dot] utep.edu Subject: interval workshop in Mexico Sender: owner-reliable_computing Precedence: bulk Raul Trejo from Mexico City is planning to organize an international interval workshop as a part of the World Congress on Expert Systems: Applications on Advanced Information Technologies that will take place on March 16-20, 1998. Interval computations deal with the basic type of uncertainty: interval uncertainty and as such, are quite relevant to the general topic of the World Congress. Raul has been promoting the idea of an interval workshop in Mexico City for quite a while, and Baker Kearfott suggested that it be good to have it in 1998, with the additional idea that those American researchers who cannot attend Interval'98 in China will be able to attend this workshop (Mexico according to most of US grants is considered local travel). This workshop is intended as a supplement to Interval'98 clearly oriented towards applications and knowledge representation so hopefully it will not cut into Interval'98 attendance but vice versa, promote interval computations in North America where there has not beem a major interval meeting for quite some time. The Congress is especially interested in applications. For general info, see http://www-cia.mty.itesm.mx/wces98 The Congress organizers want some preliminary information about the speakers and topics. If you are interested in attending please send your reply to Raul Trejo rtrejo [at] campus [dot] cem.itesm.mx. He will add your names together with the replies that he has got from the preliminary posting and submit the resulting proposal to the Congress organizers. From owner-reliable_computing Wed Jul 9 12:57:18 1997 Received: by interval.usl.edu id AA01411 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Wed, 9 Jul 1997 19:57:25 -0500 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA01405 (5.65c/IDA-1.4.4 for ); Wed, 9 Jul 1997 19:57:21 -0500 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA22324; Wed, 9 Jul 97 18:57:18 MDT Date: Wed, 9 Jul 97 18:57:18 MDT From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9707100057.AA22324 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu Subject: congratulations to Pankov Cc: vladik [at] cs [dot] utep.edu, pps [at] iuk [dot] kg Sender: owner-reliable_computing Precedence: bulk I have just learned that Pavel S. Pankov, one of the pioneers of interval computations in the former Soviet Union and the author of numerous papers and books, has been elected a Corresponding Member of the Kyrgyzstani National Academy of Sciences. Congratulations! From owner-reliable_computing Wed Jul 9 13:43:40 1997 Received: by interval.usl.edu id AA01717 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Wed, 9 Jul 1997 20:43:45 -0500 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA01711 (5.65c/IDA-1.4.4 for ); Wed, 9 Jul 1997 20:43:42 -0500 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA25172; Wed, 9 Jul 97 19:43:40 MDT Date: Wed, 9 Jul 97 19:43:40 MDT From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9707100143.AA25172 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu Subject: conference of potential interest Sender: owner-reliable_computing Precedence: bulk The information about this and other conferences of potential interest to our community is being placed on the Forthcoming Conferences part of the interval computations website http://cs.utep.edu/interval-comp/ (forwarded) International Colloquium UNIVERSAL MACHINES AND COMPUTATIONS Metz 1998, France, 23-27 March Second Announcement Call for Papers Languages: French, English TOPICS : Digital Computations : Turing machines, register machines, cellular automatas, tiling of the plane, polyominoes, snakes, neural networks, genetic cmputations, word processing (goups and monoids), other machines Analog Computations : BSS machines, infinte cellular automata, real machines In both cases : frontiers between a decidable halting problem and an undecidable one in the various computational settings minimal universal codes : size of such a code, namely, for Turing machines, register machines, cellular automatas, tilings, neural nets, Post systems, ... computation complexity of machines with a decidable halting problem as well as universal machines self-reproduction and other tasks universality and decidability in the real field PROGRAM COMMITTEE : Volker DIEKERT, University of Stuttgart Zoltan ESIK, University of Szeged Serge GRIGORIEFF, LAIC, Universite' Paris 7 Jozef GRUSKA, University of Brno Maurice MARGENSTERN, LRIM, LIAFA, IUT de Metz, chair Giancarlo MAURI, University of Milano Kenichi MORITA, University of Hiroshima Maurice NIVAT, LIAFA, Universite' Paris 7 Jean-Eric PIN, CNRS, LIAFA Lutz PRIESE, University of Koblenz Youri ROGOJINE, Mathematical Institute , Kishinev Arto SALOMAA, University of Turku ORGANIZING COMMITTEE : Maurice MARGENSTERN, LRIM, LIAFA, IUT of Metz, chair Adam CICHON, LORIA, CRIN, Nancy Michel GRANDMOUGIN, IUT of Metz Francine HERRMANN, LRIM, University of Metz Azze'dine KACED, LRIM, University of Metz Jean-Yves MARION, LORIA, CRIN, IUT of Nancy 2 Zsuzsanna ROKA, LRIM, IUT of Metz Daniel SINGER, LRIM, University of Metz Guillaume WATIER, LRIM, LIAFA, IUT of Metz INVITED SPEAKERS : Sergei ADIAN, Steklov Institute, Moscow Lenore BLUM, International Computer Science Institute (ICSI), Berkeley and City University of Hong Kong Michel COSNARD, ENS Lyon Joaquim GABARRO, Polytechnical University of Barcelona Yuri GUREVICH, University of Michigan, Ann Arbor David HAREL, Weizmann Institute, Jerusalem Lila KARI, University of West Ontario, London, Ontario Yuri MATIYASSEVICH, Steklov Institute, Saint-Petersburg Christian MICHAUX, University of Mons-Hainaut, Mons Gheorghe PAUN, Mathematical Institute, Acad. of Sciences, Bucarest Lioudmila PAVLOTSKAYA, Power Engeneering Institute, Moscow Ge'raud SE'NIZERGUES, Universite' de Bordeaux 1 Hava SIEGELMANN, Technion, Hai"fa Hiroshi UMEO, Osaka University of Electrocommunications MCU/UMC'95 gave rise to TCS special issue 168-2 on "Universal Machines and Computations". The interests of computer scientists for the topics of the conference increased in the last years. New domains appeared, continuing them in a natural way. This explains why a second scientifing meeting on this topics must hold, three years later. COLLOQUIUM PROCEEDINGS Besides invited lectures, about twenty contributions are planned. In a first time, lectures and contributions will be published in the Proceedings of MCU/UMC'98 by Metz University Institute of Technology. Participants will receive a volume of the Proceedings at their arrival. Contributions should be submitted as 12 page papers with an extra page indicating the name of the author(s), his/her/their affiliation, e-mail and addresses as well as the title of the contribution, a list of key-words and a short abstract within 300 words. The abstract will be translated into French. Contributions will be submitted by e-mail as a NON ENCODED PostScript file (any encoding will entail rejection of the submission). Accepted contributions will possibly have to be corrected according to referees remarks. In any case, accepted contributions should be send in LATEX format to be indicated later to authors. Please, keep in mind the following dates : Dead line for submission : september, 30, 1997 Notification of acceptance or rejection : january, 15, 1998 Dead line for receiving corrected version of accepted papers : february, 15, 1998 TCS SPECIAL ISSUE A special issue of Theoretical Computer Science devoted to "Universal Machines and Computations'II" will be published on the topics of the colloquium. A selection of the best works of the colloquium, among invited lectures and accepted contributions will be published in this special issue. A paper accepted for the special issue may possibly happen to be an extended version of a paper accepted for the Proceedings. Deadlines for submission to the special issue will be announced at the colloquium. GRANTS FOR STUDENTS : If our grant applications are successful enough, a certain number of grants will be presented to youg post-doc researches or PhD students in order to attend the colloquium works. REGISTRATION FEES : For attending the colloquium send your registration form by surface mail at the below indicated address, by FAX or by e-mail. Registration fees amounts to 900FF if paid before February 1st 1998 and to 1200FF after that date. In that latter case, they must be paid to the colloquium organization before March 15, 1998. ALL participants have to pay the registration fees. RECEPTION Reception of participants will hold on Monday, March, 23 from 10h, a.m. until 12h30. The colloquium will start on that day at 14h. REGISTRATION FORM Family name : ................................................. First name : ................................................. Affiliation : ................................................. Address : ................................................. Country : ................................................. e-mail : ................................................. FAX : ................................................. Phone : ................................................. Arrival : ................................................. Departure : ................................................. ACCOMMODATION Starting from January, 15, 1998, the organizing committee will send, on request, a list of hotels not too far from the place of the colloquium. MAIL: by surface mail : Maurice MARGENSTERN Colloque International "Machines et calculs universels" I.U.T. de Metz, De'partement d'Informatique, I^le du Saulcy, F - 57045 METZ CEDEX FRANCE e-mails : mcu98 [at] iut [dot] univ-metz.fr and, in case of problems : mcu98 [at] antares [dot] iut.univ-metz.fr mcu98 [at] capella [dot] ibp.fr html site http://mcu98.iut.univ-metz.fr/~mcu98 http://www.iut.univ-metz.fr/~mcu98 http://kelp.ke.sys.hiroshima-u.ac.jp/mirror/mcu98/ FAX : (33 3) 87 31 54 96 From owner-reliable_computing Sun Jul 13 16:12:48 1997 Received: by interval.usl.edu id AA04457 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Sun, 13 Jul 1997 07:13:06 -0500 Received: from cesit1.unifi.it by interval.usl.edu with SMTP id AA04451 (5.65c/IDA-1.4.4 for ); Sun, 13 Jul 1997 07:13:01 -0500 Received: from aguirre.ing.unifi.it by CESIT1.UNIFI.IT (PMDF V5.0-4 #3688) id <01IL6VSXXGGG0020V6 [at] CESIT1 [dot] UNIFI.IT> for reliable_computing [at] interval [dot] usl.edu; Sun, 13 Jul 1997 14:12:52 +0100 (MET) Received: from ozon180.cs.dsi by aguirre.ing.unifi.it (4.1/SMI-4.1) id AA23943; Sun, 13 Jul 1997 14:12:48 +0200 Received: by ozon180.cs.dsi (5.0/SMI-SVR4) id AA16692; Sun, 13 Jul 1997 14:12:48 +0200 Date: Sun, 13 Jul 1997 14:12:48 +0200 From: csmr98 [at] aguirre [dot] ing.UNIFI.IT Subject: CFPs:Euromicro Work.Conf.on Soft.Maint.&Reeng. in Florence To: reliable_computing [at] interval [dot] usl.edu Message-Id: <9707131212.AA16692 [at] ozon180 [dot] cs.dsi> Content-Transfer-Encoding: 7BIT Sender: owner-reliable_computing Precedence: bulk Dear colleague: Here is the call for papers for the 2nd EUROMICRO WORKING CONFERENCE on SOFTWARE MAINTENANCE AND REENGINEERING which will be help in Florence, Italy, in March 1998. Please accept our apologies if you receive multiple copies of this call. Please post forward to all your interested colleagues. Thank you, -------------------------------------------------------------------------- Call for Papers 2nd EUROMICRO WORKING CONFERENCE on SOFTWARE MAINTENANCE AND REENGINEERING Florence, Italy -- March 9-11, 1998 The purpose of the working conference is to promote discussion and interaction about a series of topics which are yet underrepresented. We are particularly interested in exchanging concepts, prototypes, research ideas, and other results which could contribute to the academic arena and also benefit business and industrial community. Researcher, practitioners, technology transition experts, project managers, developers and users of tools, are all welcome. Topics of interest include but are not restricted to: Maintenance and Reengineering Tools (CARE-Tools), Reverse Engineering Tools, Support of Reengineering Tasks by CASE-Tools, Software Reusability, Tele-Maintenance (Concepts, Experiences, Use of New Technologies), Maintainability of Programming Languages (eg., OOPLs), Models and Methods for Error Prediction, Measurement of Software Quality, Maintenance Metrics, Formal Methods, Maintenance and Reengineering of KBS, Reengineering and Reverse Engineering Concepts, Experiences from Redesign and Reengineering Projects, Millennium Problem (Year 2000), Euro Problem, Organizational Framework and Models for "RE"-Projects, Software Evolution, Migration and Maintenance Strategies, Design for Maintenance, Preventive Maintenance, Personnel Aspects of Maintenance (Motivation, Team building), Third Party Maintenance, Empirical Results about the Maintenance Situation in Businesses, Version and Configuration Management, Legal Aspects and Jurisdiction, Organization and Management of Large Maintenance Projects, Software Offloading, Related Areas such as Software Documentation. *Submission of papers* There are two types of papers: full length papers (not exceeding 4000 words in length and including a 150-200 word abstract) and short papers (not exceeding 2000 words in length and including a 75-100 word abstract). Authors are strongly encouraged to send a PostScript version of their paper by anonymous ftp to ftp.dsi.unifi.it and put this file into the directory pub/CSMR98/incoming (in order to avoid overwritings, the PostScript file should be named: .ps). In addition, they should send by e-mail to CSMR98 [at] ozon180 [dot] ing.unifi.it the title of the paper, full names, affiliations, postal and e-mail addresses of all authors, fax and telephone numbers. Alternatively, the paper can be sent by postal mail. In that case, five copies of all the above items should be sent to a program chairman. For more information please contact the organization at the addresses: csmr98 [at] ozon180 [dot] ing.unifi.it http://www.isst.fhg.de/csmr http://www.dsi.unifi.it/~nesi/csmr98 The following signed information should be included in the submission: All necessary clearances have been obtained for the publication of this paper. If accepted, the author(s) prepare the camera-ready manuscript in time for inclusion in the proceedings, and will personally present the paper at the working conference. The proceeding will be published by IEEE Computer Society. Full papers exceeding 8 pages (short papers 4 pages) will be charged for pages in excess. Important dates The deadline for submissions is Sept. 15, 1997. Authors will be notified of acceptance by Nov.25, 1997. The camera ready version of the paper will be required by Dec. 25, 1997. Special sessions Sessions of special interest proposed by delegates will be welcome. Please send suggestions to the program chairman before the closing date of submissions. Program Chair: Paolo Nesi Dip. Sistemi e Informatica, Universita' degli Studi di Firenze Via S. Marta, 3, 50139 Firenze, Italy Tel: +39-55-4796523 Fax: +39-55-4796363 email: nesi [at] ingfi1 [dot] ing.unifi.it Program co-Chair Franz Lehner Institute for Business Informatics, University of Regensburg Universitatsstr, 31, D-93040 REGENSBURG, Germany Tel.: +49-941-943-2734 Fax: +49-941-943-4986 email:Franz.Lehner [at] wiwi [dot] uni-regensburg.de Organizing Chair Alessandro Fantechi Dip. di Sistemi e Informatica, Universita' degli Studi di Firenze Via S. Marta, 3, 50139 Firenze, Italy Tel: +39-55-4796265 Fax: +39-55-4796363 email: fantechi [at] dsi [dot] dsi.unifi.it Local Chair Maurizio Campanai CESVIT (High-Tech Agency), Fortezza da Basso Viale F. Strozzi 1, 50129 Firenze, Italy Tel: +39-55-4619154 Fax: +39-55-485345 email: campanai [at] ats [dot] it Program Committee V.S. Alagar, USA; V. Ambriola, I; G. Bakker, NL; K. Bennett, UK; A. Bertolino, I; F. Brito e Abreu, P; G. Bucci, I; M. Campanai, I; A. Cimitile, I; I. Classen, D; L. da F. Costa, BR; J.A. de La Puente, S; A. Fantechi, I; J.-L. Hainaut, B; J. Harauz, CA; B. Henderson-Sellers, AU; M. Hinchey, USA; E.-A. Karlsson, S; T.M. Khoshgoftaar, USA; P. Laplante, USA; S. Liu, J; M. Loewe, D; M. Marchesi, I; T.J. Marlowe, USA; J.-M. Morel, F; D. Natale, I; E. Miller, USA; S. Nocentini, I; M. Pezze`, I; P.T. Poon, USA; L. Richter, CH; D. Rombach, D; G. Sechi, I; I. Sommerville, UK; A. Stoyen, USA; J. Taramaa, SF; H. Toetenel, NL; G. Tsai, USA; C. Verhofer, NL; Y. Yamaguchi, J; General information The conference will take place at Palazzo degli Affari, in the center of Florence. Enquiries about the working conference arrangements should be directed to the organizing chairman or to the local chairman. Preregistration is suggested for the authors. --------------------------------------------------------------------------; From owner-reliable_computing Mon Jul 21 02:23:38 1997 Received: by interval.usl.edu id AA08128 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Mon, 21 Jul 1997 09:23:47 -0500 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA08122 (5.65c/IDA-1.4.4 for ); Mon, 21 Jul 1997 09:23:43 -0500 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA29040; Mon, 21 Jul 97 08:23:38 MDT Date: Mon, 21 Jul 97 08:23:38 MDT From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9707211423.AA29040 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu Subject: school on optimization: in German Sender: owner-reliable_computing Precedence: bulk From: Klaus Schwettmann Date: Thu, 17 Jul 1997 16:39:06 +0200 Subject: Autumn School, What is a smart algorithm? Call for Participation Autumn School "What is a smart algorithm?" October 9-11, 1997 University of Trier, Germany http://www.informatik.uni-trier.de/Herbstschule97/ The aim of the autumn school is to present new trends and ideas in optimization algorithms. It is intended primarily for PhD students, qualified graduated students and researchers interested in this field. The school comprises tutorial lectures and exercise sessions supervised by the lecturers. The courses will be held in German. Lecturers: - E.W. Mayr, Munchen Algorithmen fr polynomielle Gleichungssysteme - A. Neumaier, Wien Intervallverfahren in der Optimierung - P. Spellucci, Darmstadt Aspekte bei der Beurteilung und Auswahl von Optimierungsverfahren fr kontinuierliche Probleme - E. Welzl, Zrich Lsen geometrischer Probleme - einfach, stabil, schnell Registration fee: The registration fee amounts to 30 DM. Applications: Since the number of participants is limited an application (curriculum vitae and letter of recommendation) is required. Send your application until September 1st. to the following address: Herrn Prof. Dr. Ch. Meinel GK Mathematische Optimierung Universitt Trier D-54286 Trier Phone: ++49 651 201-3477 E-mail: mathopt@uni-trier.de From owner-reliable_computing Fri Jul 25 11:52:25 1997 Received: by interval.usl.edu id AA10055 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 25 Jul 1997 04:52:42 -0500 Received: from ns.devinci.fr by interval.usl.edu with SMTP id AA10049 (5.65c/IDA-1.4.4 for ); Fri, 25 Jul 1997 04:52:36 -0500 Received: from USG0002 (usg0002.devinci.fr [193.107.164.87]) by ns.devinci.fr (8.7.5/8.6.12) with SMTP id LAA17174 for ; Fri, 25 Jul 1997 11:52:32 +0200 Received: by USG0002 (940816.SGI.8.6.9/940406.SGI.AUTO) for reliable_computing [at] interval [dot] usl.edu id LAA27056; Fri, 25 Jul 1997 11:52:28 +0200 From: "Franck DELCROIX" Message-Id: <9707251152.ZM27054 [at] USG0002 [dot] devinci.fr> Date: Fri, 25 Jul 1997 11:52:25 +0000 Reply-To: franck.delcroix [at] devinci [dot] fr X-Mailer: Z-Mail (3.2.0 26oct94 MediaMail) To: reliable_computing [at] interval [dot] usl.edu Subject: Contact Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Sender: owner-reliable_computing Precedence: bulk Dear Interval Researchers, I've heard of a software called SMMS, designed for managing interval systems of equations. I'd like to get in touch with his author, Pr. F. Alvarado (the E-mail address I have doesn't seem to be valid anymore). So, if you know where I can find him, or informations about SMMS, please be kind to contact me via E-mail (franck.delcroix [at] devinci [dot] fr). Thank you very much for your help, Franck. -- ,,, (o o) *------------------------oOO--(_)--OOo----------------------------------* * * * FRANCK DELCROIX * * * * Laboratoire de Modelisation et Mecanique des Structures * * Universite Pierre & Marie Curie - PARIS VI * * Tour 66, 5eme etage, 4 place Jussieu 75252 PARIS Cedex France * * Tel (33) 01-44-27-41-44 Fax (33) 01-44-27-71-60 * * Email : Franck [at] lmmc [dot] jussieu.fr * * * * or * * * * D.E.R. Genie Mecanique * * Pole Universitaire Leonard de Vinci * * 92916 PARIS La Defense FRANCE * * Tel (33) 01-41-16-72-07 Fax (33) 01-41-16-71-71 * * Email : FRANCK.DELCROIX [at] DEVINCI [dot] FR * * * *-------------------------(__)------(__)--------------------------------* From owner-reliable_computing Fri Jul 25 01:08:00 1997 Received: by interval.usl.edu id AA10354 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 25 Jul 1997 06:08:09 -0500 Received: from boris.mscs.mu.edu by interval.usl.edu with SMTP id AA10348 (5.65c/IDA-1.4.4 for ); Fri, 25 Jul 1997 06:08:05 -0500 Received: by boris.mscs.mu.edu (Smail3.1.28.1 #9) id m0wriE4-0010tjC; Fri, 25 Jul 97 06:08 CDT Message-Id: From: georgec [at] marque [dot] mscs.mu.edu (Dr. George F. Corliss MU MSCS) Subject: Alvarado? To: reliable_computing [at] interval [dot] usl.edu Date: Fri, 25 Jul 1997 06:08:00 -0500 (CDT) X-Mailer: ELM [version 2.4 PL25] Mime-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Content-Length: 775 Sender: owner-reliable_computing Precedence: bulk Franck DELCROIX, > I've heard of a software called SMMS, designed for managing > interval systems of equations. Yes, very useful software. > I'd like to get in touch with his author, Pr. F. Alvarado (the E-mail > address I have doesn't seem to be valid anymore). Try alvarado [at] engr [dot] wisc.edu See also http://www.engr.wisc.edu/ece/faculty/alvarado_fernando.html > So, if you know where I can find him, or informations about SMMS, please be > kind to contact me via E-mail (franck.delcroix [at] devinci [dot] fr). Hope that works. 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] vms [dot] csd.mu.edu http://www.mscs.mu.edu/~georgec/ (414) 288-6599 (office); 288-7375 (Dept.); 288-5472 (fax) From owner-reliable_computing Fri Jul 25 17:44:32 1997 Received: by interval.usl.edu id AA10707 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 25 Jul 1997 10:09:27 -0500 Received: from shiva.jussieu.fr by interval.usl.edu with SMTP id AA10701 (5.65c/IDA-1.4.4 for ); Fri, 25 Jul 1997 10:09:15 -0500 Received: from tom.biomath.jussieu.fr (tom.biomath.jussieu.fr [134.157.72.8]) by shiva.jussieu.fr (8.8.6/jtpda-5.2) with ESMTP id RAA26406 ; Fri, 25 Jul 1997 17:06:36 +0200 (METDST) Received: from gin.biomath.jussieu.fr (gin.biomath.jussieu.fr [134.157.72.21]) by tom.biomath.jussieu.fr (8.8.5/mailhost/jtpda-5.2/af970507) with SMTP id RAA16028 ; Fri, 25 Jul 1997 17:03:11 +0100 (WET) Received: by gin.biomath.jussieu.fr (5.67b/jf930126+af930328) at Fri, 25 Jul 1997 16:44:32 +0100 Date: Fri, 25 Jul 1997 16:44:32 +0100 Message-Id: <199707251544.AA14967 [at] gin [dot] biomath.jussieu.fr> From: Pierre Zweigenbaum To: aaai@sumex-aim.stanford.edu, aiia [at] di [dot] unito.it, aisb [at] cogs [dot] sussex.ac.uk Subject: ESSLLI: Last Call Mime-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: quoted-printable X-Mime-Autoconverted: from 8bit to quoted-printable by shiva.jussieu.fr id RAA26406 Sender: owner-reliable_computing Precedence: bulk LAST CALL FOR PARTICIPATION - -----------------------------------------------------------------------= -------- - -LLLLLLL--LLLLLLL--LLLLLLL---LLL-------LLL-------LLL-----L--LLLLLLL---L= LLLLLL-- - -LLL------LLL------LLL-------LLL-------LLL-------LLL---L----LLLLLLL----= ---LLL-- - -LLLLLL---LLLLLLL--LLLLLLL---LLL-------LLL-------LLL------------LLL----= ---LLL-- - -LLL----------LLL------LLL---LLL-------LLL-------LLL------------LLL----= ---LLL-- - -LLLLLLL--LLLLLLL--LLLLLLL---LLLLLLL---LLLLLLL---LLL------------LLL----= ---LLL-- - -----------------------------------------------------------------------= -------- ESSLLI'97 European Summer School in Logic, Language, and Information Aix-en-Provence, France (August 11-22, 1997) http://www.lpl.univ-aix.fr/~esslli97 The ninth European Summer School in Logic, Language, and Information will= be=20 held in Aix-en-Provence, France, from August 11 until August 22, 1997. ESSLLI has as its main focus the intersection of the areas of logic,=20 linguistics, and computation. The programme includes courses, workshops a= nd=20 symposia covering a variety of topics within six areas of interest: Logic= , Language, Computation, Logic & Computation, Computation & Language, and Language & Logic. Courses are given at both introductory and advanced= =20 levels. Besides courses, workshops and symposia, there will also be evening lectures, in which the most current topics in research in Logic, Language and Information will be addressed. Please, consult our website (http://www.lpl.univ-aix.fr/~esslli97) for mo= re=20 information and online registration. Contact : ESSLLI'97 LPL - Universit=E9 de Provence 29 Avenue Robert Schuman 13621 Aix-en-Provence FRANCE e-mail: esslli97 [at] lpl [dot] univ-aix.fr phone: +33 (0) 442.95.20.73 fax : +33 (0) 442.59.50.96 http://www.lpl.univ-aix.fr/~esslli97 =0C +-------------------+ | REGISTRATION FORM | +-------------------+ Name: ________________________________________________ First Name: __________________________________________ Institution: _________________________________________ Address: ________________________________________________________________= ___ =09 ____________________________________________________________________ =09 ____________________________________________________________________ Country: ____________________________________________ Phone : ____________________________ Fax : _____________________________ E-mail : __________________________________________=09 Member of FoLLI : o Yes o No 1. Registration Fees - -------------------- +---------------+-------------------+ | Status | Late registration | |---------------+-------------------| | Student | o 1.400 FF | | Scholar | o 2.300 FF | | Industrial | o 4.600 FF | +---------------+-------------------+ 2. Accomodation - --------------- - Day of arrival : _____________ - Day of departure : _____________ - Number of nights : _____________ . Hotel : o 350-400 FF / night (Deposit : 1200 FF) =0C 3. Social events - ---------------- o I would like to take part in ESSLLI parties=09 - Number of tickets : __________ - Total amount : __________ 5. Tee-shirt - ------------ o I would like to buy one (or several) tee-shirt(s) =09 - Number of tee-shirts and size: ____ L ____ XL ____ XXL - Total amount: __________ +-------------------+ | Method of payment | +-------------------+ 1. Detailed account - ------------------- Registration fees : FF ___________________________ Accomodation : FF ___________________________ Social events : FF ___________________________ Tee-shirt : FF ___________________________ Amount: FF ___________________________ Credit card charges=20 (Japan : 4,5 %, Other countries : 3%) FF ___________________________ TOTAL AMOUNT : FF ___________________________ 2. Methods of payment - --------------------- . Cheques : Made out in French Francs, payable to FoLLI. . Bank transfers :=20 - Sorry but you will have to pay the banking charges (if you don't,=20 your registration will be considered as incomplete). - Please enclose with this form a copy of your transfer. This copy should mention the name and adress of your bank. - Do not forget to write down your name on the transfer. - The bank transfer must be done in French Francs on the account: =09 Bank : ABN-AMRO=20 Account number : 45 20 12 449 Swift Code: ABNANL 2A References : ESSLLI'97 / your name=09 Address : Vereniging FoLLI Plantage Muidergracht 24 1018 TV AMSTERDAM The Netherlands =0C . Credit cards :=20 Credit card charges are yours. Whatever your credit card is, credit card=20 charges represent 4,5% of the total amount if your payment comes from Jap= an=20 and 3% if your payment comes from any other foreign country.=20 o VISA o Mastercard o American Express Cardholder's Name : ___________________________________________________= ___ Card number : ____________________________________ Expiration date : ________________________________ Amount : _________________________________________ =09 Signature : _______________________________________ . If these methods of payment are inconvenient, it will be possible for y= ou to=20 pay cash once you are in Aix. In this case, you will have to pay the late= =20 registration fee and you will have to book your room yourself. Some excep= tions=20 to these arrangements can be made for people coming from countries which = do not=20 allow any of the long distance methods of payment above. 3. Cancellation - --------------- . running costs =3D 50% of the registration fees . no reimbursement of the deposits paid for the hotel Date : _____________________ Signature : ________________________________= __ To return by e-mail to : esslli97 [at] lpl [dot] univ-aix.fr A copy of this registration form together with the justificatory of payme= nt=20 and the copy of the student card has to be sent by surface mail to : ESSLLI'97 LPL - Universit=E9 de Provence 29 Avenue Robert Schuman 13621 Aix-en-Provence FRANCE From owner-reliable_computing Fri Jul 25 17:50:48 1997 Received: by interval.usl.edu id AA10996 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Fri, 25 Jul 1997 10:30:45 -0500 Received: from shiva.jussieu.fr by interval.usl.edu with SMTP id AA10990 (5.65c/IDA-1.4.4 for ); Fri, 25 Jul 1997 10:30:39 -0500 Received: from tom.biomath.jussieu.fr ([134.157.72.8] (may be forged)) by shiva.jussieu.fr (8.8.6/jtpda-5.2) with ESMTP id QAA25330 for ; Fri, 25 Jul 1997 16:54:06 +0200 (METDST) Received: from gin.biomath.jussieu.fr (gin.biomath.jussieu.fr [134.157.72.21]) by tom.biomath.jussieu.fr (8.8.5/mailhost/jtpda-5.2/af970507) with SMTP id QAA11060 for ; Fri, 25 Jul 1997 16:50:49 +0100 (WET) Received: by gin.biomath.jussieu.fr (5.67b/jf930126+af930328) at Fri, 25 Jul 1997 16:50:48 +0100 Date: Fri, 25 Jul 1997 16:50:48 +0100 From: pz [at] biomath [dot] jussieu.fr (Pierre Zweigenbaum) Message-Id: <199707251550.AA15244 [at] gin [dot] biomath.jussieu.fr> To: reliable_computing [at] interval [dot] usl.edu Subject: ESSLLI'97: Last Call Mime-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: quoted-printable X-Mime-Autoconverted: from 8bit to quoted-printable by shiva.jussieu.fr id QAA25330 Sender: owner-reliable_computing Precedence: bulk [Sorry for possible duplicates] LAST CALL FOR PARTICIPATION -------------------------------------------------------------------------= ------ -LLLLLLL--LLLLLLL--LLLLLLL---LLL-------LLL-------LLL-----L--LLLLLLL---LLL= LLLL-- -LLL------LLL------LLL-------LLL-------LLL-------LLL---L----LLLLLLL------= -LLL-- -LLLLLL---LLLLLLL--LLLLLLL---LLL-------LLL-------LLL------------LLL------= -LLL-- -LLL----------LLL------LLL---LLL-------LLL-------LLL------------LLL------= -LLL-- -LLLLLLL--LLLLLLL--LLLLLLL---LLLLLLL---LLLLLLL---LLL------------LLL------= -LLL-- -------------------------------------------------------------------------= ------ ESSLLI'97 European Summer School in Logic, Language, and Information Aix-en-Provence, France (August 11-22, 1997) http://www.lpl.univ-aix.fr/~esslli97 The ninth European Summer School in Logic, Language, and Information will= be=20 held in Aix-en-Provence, France, from August 11 until August 22, 1997. ESSLLI has as its main focus the intersection of the areas of logic,=20 linguistics, and computation. The programme includes courses, workshops a= nd=20 symposia covering a variety of topics within six areas of interest: Logic= , Language, Computation, Logic & Computation, Computation & Language, and Language & Logic. Courses are given at both introductory and advanced= =20 levels. Besides courses, workshops and symposia, there will also be evening lectures, in which the most current topics in research in Logic, Language and Information will be addressed. Please, consult our website (http://www.lpl.univ-aix.fr/~esslli97) for mo= re=20 information and online registration. Contact : ESSLLI'97 LPL - Universit=E9 de Provence 29 Avenue Robert Schuman 13621 Aix-en-Provence FRANCE e-mail: esslli97 [at] lpl [dot] univ-aix.fr phone: +33 (0) 442.95.20.73 fax : +33 (0) 442.59.50.96 http://www.lpl.univ-aix.fr/~esslli97 =0C +-------------------+ | REGISTRATION FORM | +-------------------+ Name: ________________________________________________ First Name: __________________________________________ Institution: _________________________________________ Address: ________________________________________________________________= ___ =09 ____________________________________________________________________ =09 ____________________________________________________________________ Country: ____________________________________________ Phone : ____________________________ Fax : _____________________________ E-mail : __________________________________________=09 Member of FoLLI : o Yes o No 1. Registration Fees -------------------- +---------------+-------------------+ | Status | Late registration | |---------------+-------------------| | Student | o 1.400 FF | | Scholar | o 2.300 FF | | Industrial | o 4.600 FF | +---------------+-------------------+ 2. Accomodation --------------- - Day of arrival : _____________ - Day of departure : _____________ - Number of nights : _____________ . Hotel : o 350-400 FF / night (Deposit : 1200 FF) =0C 3. Social events ---------------- o I would like to take part in ESSLLI parties=09 - Number of tickets : __________ - Total amount : __________ 5. Tee-shirt ------------ o I would like to buy one (or several) tee-shirt(s) =09 - Number of tee-shirts and size: ____ L ____ XL ____ XXL - Total amount: __________ +-------------------+ | Method of payment | +-------------------+ 1. Detailed account ------------------- Registration fees : FF ___________________________ Accomodation : FF ___________________________ Social events : FF ___________________________ Tee-shirt : FF ___________________________ Amount: FF ___________________________ Credit card charges=20 (Japan : 4,5 %, Other countries : 3%) FF ___________________________ TOTAL AMOUNT : FF ___________________________ 2. Methods of payment --------------------- . Cheques : Made out in French Francs, payable to FoLLI. . Bank transfers :=20 - Sorry but you will have to pay the banking charges (if you don't,=20 your registration will be considered as incomplete). - Please enclose with this form a copy of your transfer. This copy should mention the name and adress of your bank. - Do not forget to write down your name on the transfer. - The bank transfer must be done in French Francs on the account: =09 Bank : ABN-AMRO=20 Account number : 45 20 12 449 Swift Code: ABNANL 2A References : ESSLLI'97 / your name=09 Address : Vereniging FoLLI Plantage Muidergracht 24 1018 TV AMSTERDAM The Netherlands =0C . Credit cards :=20 Credit card charges are yours. Whatever your credit card is, credit card=20 charges represent 4,5% of the total amount if your payment comes from Jap= an=20 and 3% if your payment comes from any other foreign country.=20 o VISA o Mastercard o American Express Cardholder's Name : ___________________________________________________= ___ Card number : ____________________________________ Expiration date : ________________________________ Amount : _________________________________________ =09 Signature : _______________________________________ . If these methods of payment are inconvenient, it will be possible for y= ou to=20 pay cash once you are in Aix. In this case, you will have to pay the late= =20 registration fee and you will have to book your room yourself. Some excep= tions=20 to these arrangements can be made for people coming from countries which = do not=20 allow any of the long distance methods of payment above. 3. Cancellation --------------- . running costs =3D 50% of the registration fees . no reimbursement of the deposits paid for the hotel Date : _____________________ Signature : ________________________________= __ To return by e-mail to : esslli97 [at] lpl [dot] univ-aix.fr A copy of this registration form together with the justificatory of payme= nt=20 and the copy of the student card has to be sent by surface mail to : ESSLLI'97 LPL - Universit=E9 de Provence 29 Avenue Robert Schuman 13621 Aix-en-Provence FRANCE From owner-reliable_computing Mon Jul 28 04:00:58 1997 Received: by interval.usl.edu id AA12398 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Mon, 28 Jul 1997 11:01:08 -0500 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA12392 (5.65c/IDA-1.4.4 for ); Mon, 28 Jul 1997 11:01:02 -0500 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA28124; Mon, 28 Jul 97 10:00:58 MDT Date: Mon, 28 Jul 97 10:00:58 MDT From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9707281600.AA28124 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu Subject: foundations of computational mathematics website Sender: owner-reliable_computing Precedence: bulk From: Arieh Iserles Date: Thu, 24 Jul 97 10:09:01 BST Subject: Website on Foundations of Computational Mathematics This is to announce to the NA-net community that the FoCM (Foundations of Computational Mathematics) website is fully functional. It is available at the following URLs: Asia: http://www.cityu.edu.hk/ma/focm/ Australia: http://www.maths.unsw.edu.au/FoCM/ Eastern Europe: http://hydra.mimuw.edu.pl/FoCM/ Latin America: http://www.dm.uba.ar/FoCM/ Northern America: http://www.sccm-stanford.edu/FoCM/ Western Europe: http://www.damtp.cam.ac.uk/user/na/FoCM/ Teresa Krick Arieh Iserles Universidad Buenos Aires and University of Cambridge krick [at] dm [dot] uba.ar A.Iserles [at] damtp [dot] cam.ac.uk From owner-reliable_computing Mon Jul 28 04:05:23 1997 Received: by interval.usl.edu id AA12458 (5.65c/IDA-1.4.4 for reliable_computing-outgoing); Mon, 28 Jul 1997 11:05:29 -0500 Received: from cs.utep.edu by interval.usl.edu with SMTP id AA12452 (5.65c/IDA-1.4.4 for ); Mon, 28 Jul 1997 11:05:25 -0500 Received: from earth.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA28230; Mon, 28 Jul 97 10:05:23 MDT Date: Mon, 28 Jul 97 10:05:23 MDT From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9707281605.AA28230 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu Subject: typo Sender: owner-reliable_computing Precedence: bulk There is a typo in the URL of the North American website for Foundations of Computational Mathematics. The correct URL is http://www-sccm.stanford.edu/FoCM/