From owner-reliable_computing [at] interval [dot] usl.edu Mon Feb 1 07:25:31 1999 Received: by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id HAA05035 for reliable_computing-outgoing; Mon, 1 Feb 1999 07:25:31 -0600 (CST) Received: from babinet.Univ-Angers.Fr (babinet.univ-angers.fr [193.49.163.20]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with SMTP id HAA05030 for ; Mon, 1 Feb 1999 07:25:28 -0600 (CST) Received: from [193.49.163.41] by babinet.Univ-Angers.Fr with SMTP (1.37.109.4/16.2) id AA15862; Mon, 1 Feb 99 14:13:48 +0100 Message-Id: <3.0.1.32.19990130000451.006ba304 [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: Sat, 30 Jan 1999 00:04:51 +0100 To: reliable_computing [at] interval [dot] usl.edu From: Luc Jaulin Subject: Newton interval for rectangular matrices Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear colleagues, Can you please help me on the following problem. When dealing with interval-error estimation problems, we have to solve interval equations like (1) f(x)=y, x in [x] and y in [y] where x and y are vectors and [x] and [y] are two boxes. Here, n=dim(x) is the number of parameters to be estimated and m=dim(y) is the number of measurement. In general, n < m, for instance, n=5 and m=30. When we linearize, in order to apply a Newton interval reduction over [x], we obtain the following linear interval equations (2) [A]x=[z], x in [x] where [A] is a rectangular (m X n) interval matrix and [z] is a box with dimension m. Usually, when [A] is a square matrix, we use a preconditioning step by pre-multiplying (2) by the approximate inverse B of the center matrix of [A]. We obtain the linear interval system (3) [M]x=[v] where [M]=B[A] and V=B[z]. Then, a reduction procedure based on a Gauss-Seidel iteration can be performed. But here, [A] is not square. So what should I do ? 1) Should I use as pre-conditioning matrix the generalized inverse matrix T -1 T (4) B=(Ac Ac) * A , where Ac=Center([A]), ? 2) or should I choose the n 'best' constraints among the m constraints "[Ai]x=[zi]", where [Ai] is the ith row of [A] and [zi] the ith entrie of [z], in order to obtain a square interval system ? 3) or should I use another approach ? If you have some references about this problem, can you please give them. Thank you very much for your help, Best regards, Luc Luc Jaulin, LISA, 2 Bd Lavoisier, 49 045 Angers Cedex. Tel (33) 02 41 73 54 17 Fax : (33) 02 41 73 53 52 http://www.istia.univ-angers.fr/~jaulin/ From owner-reliable_computing [at] interval [dot] usl.edu Mon Feb 1 16:15:52 1999 Received: (from daemon@localhost) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id QAA05600 for reliable_computing-outgoing; Mon, 1 Feb 1999 16:15:52 -0600 (CST) Received: from isse.gmu.edu (isse.gmu.edu [129.174.40.15]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id QAA05595 for ; Mon, 1 Feb 1999 16:15:44 -0600 (CST) Received: (from xywang@localhost) by isse.gmu.edu (8.8.5/8.8.5) id NAA01867; Mon, 1 Feb 1999 13:40:30 -0500 (EST) From: Xiaoyang "Sean" Wang Message-Id: <199902011840.NAA01867 [at] isse [dot] gmu.edu> Subject: CP99 CFP (5th Intl Conf on Principles and Practice of Constraint Programming) To: xywang [at] gmu [dot] edu Date: Mon, 1 Feb 1999 13:40:30 -0500 (EST) X-Mailer: ELM [version 2.4 PL24] MIME-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 8bit Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Sorry if you receive multiple copies of this.... CALL FOR PAPERS - CP'99 Fifth International Conference on Principles and Practice of Constraint Programming October 11--15, 1999 Alexandria, Virginia, USA http://www.ise.gmu.edu/cp99 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, and systems. Contributions are welcome from any discipline concerned with constraints, including artificial intelligence, combinatorial algorithms, computational logic, concurrent computation, databases, discrete mathematics, operations research, programming languages, symbolic computation. We also solicit papers from any domain employing constraints, including computational linguistics, configuration, decision support, design, diagnosis, graphics, hardware verification, molecular biology, planning, qualitative reasoning, real-time systems, resource allocation, robotics, scheduling, software engineering, temporal reasoning, vision, visualization, user interfaces. Papers that bridge disciplines or combine theory and practice are especially welcome. Important dates: Submissions: April 16, 1999 Notification of acceptance: July 2, 1999 Camera-ready papers due: July 31, 1999 Submissions: Submission should be done by sending two emails to cp99 [at] comp [dot] nus.edu.sg The first email should have the subject "CP99 Abstract:" followed by the paper title. The body of this first email should contain the title, authors and a short abstract of the paper, all in plain text. The second email should have subject "CP99 Paper:" followed by the paper title. The body of this second email should contain a postscript file, in portable format. All authors must be prepared to send a hardcopy by fast airmail upon request. For authors who are unable to submit electronically, five paper copies can be mailed to the program chair, to arrive by the submission deadline. Publication: The proceedings will be published by Springer Verlag in the Lecture Notes in Computer Science series. A special issue of the Constraints journal (Kluwer Academic Publishers) is planned, based on selected papers. Conference site: The conference will be held at Old Town Alexandria which is just minutes from Washington, D.C. by car, bus or metro. Old Town Alexandria is a colonial era seaport, with a revitalized two miles long waterfront. It still has cobblestone streets and many 18th century buildings. This quaint historic town features a centralized shopping district with numerous galleries and boutiques within eight blocks from the hotel. Workshops: Workshops are planned for Friday, Oct 15, 1999. Workshop proposals can be submitted to the workshop chair (to be announced soon) by approximately March 15, 1999. Details will be available soon. Conference Chair Alex Brodsky Dept of Information & Software Engineering George Mason University Fairfax, Virginia 22030-4444 USA brodsky [at] isse [dot] gmu.edu +703-993-1529, fax +703-993-1638 Program Chair Joxan Jaffar School of Computing National University of Singapore S16, Lower Kent Ridge Road Singapore 119260 Republic of Singapore joxan [at] comp [dot] nus.edu.sg +65-874-6731, fax +65-779-4580 Program Committee TBA Publicity Chair X.Sean Wang Dept of Information & Software Engineering George Mason University Fairfax, Virginia 22030-4444 USA xywang [at] gmu [dot] edu +703-993-1662, fax +703-993-1638 Organizing Committee: A. Borning (Univ. of Washington), J. Cohen (Brandeis Univ.), A. (Univ. of Marseille), E. Freuder, chair (Univ. of New Hampshire), H. Gallaire (Xerox), J.-P. Jouannaud (Univ. of Paris Sud), J.-L. Lassez (New Mexico Tech), M. Maher (Griffith Univ.), U. Montanari (Univ. of Pisa), A. Nerode (Cornell Univ.), J-F. Puget (ILOG), F. Rossi (Univ. of Padova), V. Saraswat (AT&T Research), G. Smolka (DFKI and Univ. Saarlandes), R. Wachter (Office of Naval Research). From owner-reliable_computing [at] interval [dot] usl.edu Mon Feb 1 19:47:18 1999 Received: (from daemon@localhost) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id TAA05989 for reliable_computing-outgoing; Mon, 1 Feb 1999 19:47:18 -0600 (CST) Received: from mercury.Sun.COM (mercury.Sun.COM [192.9.25.1]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with SMTP id TAA05984 for ; Mon, 1 Feb 1999 19:47:14 -0600 (CST) Received: from Eng.Sun.COM (engmail2 [129.146.1.25]) by mercury.Sun.COM (SMI-8.6/mail.byaddr) with SMTP id RAA07822; Mon, 1 Feb 1999 17:46:36 -0800 Received: from ha-sims.eng.sun.com (phys-thestorka.Eng.Sun.COM [129.146.1.231]) by Eng.Sun.COM (SMI-8.6/SMI-5.3) with ESMTP id RAA24663; Mon, 1 Feb 1999 17:46:31 -0800 Received: from gww (gww.Eng.Sun.COM) by ha-sims.eng.sun.com (Sun Internet Mail Server sims.3.5.1998.09.21.23.34) with SMTP id <0F6I003AP7JYZ3@ha-sims.eng.sun.com>; Mon, 1 Feb 1999 17:45:34 -0800 (PST) Date: Mon, 01 Feb 1999 17:46:32 -0800 (PST) From: William Walster Subject: Re: Newton interval for rectangular matrices To: reliable_computing [at] interval [dot] usl.edu, jaulin [at] monica [dot] lss.supelec.fr Reply-to: William Walster Message-id: <0F6I003AQ7JYZ3@ha-sims.eng.sun.com> MIME-version: 1.0 X-Mailer: dtmail 1.2.1 CDE Version 1.2.1 SunOS 5.6 sun4m sparc Content-type: TEXT/plain; charset=us-ascii Content-MD5: 3O2xmW47Np2YHoav/yd2IA== Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear Dr Jaulin: I have no experience with preconditioning non-square systems. However, I have some comments which may be relevant. Let's think in terms of narrow intervals. The purpose of preconditioning is to transform the system into one in which operations after preconditoning are essentially small perturbations. In such a case, the growth of intervals caused by dependency only causes the growth of small quantities. If a preconditioning step is such that large changes must still be made, then it has not eliminated the "dependency problem". Therefore, I don't think your second option is a very good one. Multiplying A by its transpose to form the normal equations worsens the condition of the problem. However, multiplying the center of A by its transpose just to get an approximate preconditioning matrix might be OK. Therefore, using the approximate generalized inverse as a preconditioner might be OK. In the non-interval case, one should do elimination on the non-square matrix and not form the normal equations. I would do the same here. I would (approximately) generate the m by m matrix which transforms the center of A into an n by n diagonal block above an (m-n) by n zero block. I would then use this as the preconditoner. I don't know if this is a good procedure or not. However, I would guess that it would be suitable. Good luck. Eldon Hansen >Date: Sat, 30 Jan 1999 00:04:51 +0100 >From: Luc Jaulin >Subject: Newton interval for rectangular matrices >X-Sender: jaulin [at] babinet [dot] univ-angers.fr >To: reliable_computing [at] interval [dot] usl.edu >MIME-version: 1.0 > >Dear colleagues, > > >Can you please help me on the following problem. > > > >When dealing with interval-error estimation problems, we have to solve >interval equations like > > (1) f(x)=y, x in [x] and y in [y] > >where x and y are vectors and [x] and [y] are two boxes. Here, n=dim(x) is >the number of parameters to be estimated and m=dim(y) is the number of >measurement. In general, n < m, for instance, n=5 and m=30. > >When we linearize, in order to apply a Newton interval reduction over [x], >we obtain the following linear interval equations > > (2) [A]x=[z], x in [x] > >where [A] is a rectangular (m X n) interval matrix and [z] is a box with >dimension m. >Usually, when [A] is a square matrix, we use a preconditioning step by >pre-multiplying (2) by the approximate inverse B of the center matrix of >[A]. We obtain the linear interval system > > (3) [M]x=[v] where [M]=B[A] and V=B[z]. > >Then, a reduction procedure based on a Gauss-Seidel iteration can be >performed. > >But here, [A] is not square. So what should I do ? > >1) Should I use as pre-conditioning matrix the generalized inverse matrix > > T -1 T > (4) B=(Ac Ac) * A , where Ac=Center([A]), ? > > >2) or should I choose the n 'best' constraints among the m constraints >"[Ai]x=[zi]", where [Ai] is the ith row of [A] and [zi] the ith entrie of >[z], in order to obtain a square interval system ? > >3) or should I use another approach ? > >If you have some references about this problem, can you please give them. > >Thank you very much for your help, > >Best regards, > >Luc > > > > > > > > > > >Luc Jaulin, LISA, 2 Bd Lavoisier, 49 045 Angers Cedex. >Tel (33) 02 41 73 54 17 Fax : (33) 02 41 73 53 52 >http://www.istia.univ-angers.fr/~jaulin/ From owner-reliable_computing [at] interval [dot] usl.edu Tue Feb 2 09:50:26 1999 Received: (from daemon@localhost) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id JAA06798 for reliable_computing-outgoing; Tue, 2 Feb 1999 09:50:26 -0600 (CST) Received: from cs.utep.edu (cs.utep.edu [129.108.1.41]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with SMTP id JAA06793 for ; Tue, 2 Feb 1999 09:50:20 -0600 (CST) Received: from saturn.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA21665; Tue, 2 Feb 99 08:50:10 MST Date: Tue, 2 Feb 99 08:50:10 MST From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9902021550.AA21665 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu, interval [at] cs [dot] utep.edu Subject: ISIPTA '99: Deadline extension Cc: hunguyen [at] nmsu [dot] edu Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk ----- Begin Included Message ----- From ipp-list-request [at] ensmain [dot] rug.ac.be Tue Feb 2 08:46:22 1999 Resent-Date: Tue, 2 Feb 1999 16:45:24 +0100 X-Authentication-Warning: ensmain.rug.ac.be: lists set sender to ipp-list-request [at] ensmain [dot] rug.ac.be using -f Sender: gert [at] allserv [dot] rug.ac.be Date: Tue, 02 Feb 1999 16:38:12 +0000 From: Gert de Cooman Reply-To: gert.decooman [at] rug [dot] ac.be Organization: Universiteit Gent, Onderzoeksgroep SYSTeMS X-Mailer: Mozilla 4.5 [en] (X11; I; Linux 2.0.34 i586) X-Accept-Language: en Mime-Version: 1.0 To: ipp-list [at] ensmain [dot] rug.ac.be, cjcram98 [at] email [dot] bnu.edu.cn, Els.Goetghebeur [at] rug [dot] ac.be, zhangg [at] cs [dot] curtin.edu.au, manski [at] ssc [dot] wisc.edu, Patrick.Fabiani [at] cert [dot] fr, j.lawry [at] bristol [dot] ac.uk, ellen [at] ifi [dot] uio.no, kurt [at] isl [dot] hrl.hac.com, hunguyen [at] nmsu [dot] edu Subject: ISIPTA '99: Deadline extension Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Resent-Message-Id: <"KDDCM2.0.wV2.frnjs"@ensmain.rug.ac.be> Resent-From: ipp-list [at] ensmain [dot] rug.ac.be X-Mailing-List: archive/latest/7 X-Loop: ipp-list [at] ensmain [dot] rug.ac.be Resent-Sender: ipp-list-request [at] ensmain [dot] rug.ac.be Content-Length: 1424 We apologise of you receive this message more than once. First International Symposium on Imprecise Probabilities and Their Applications (ISIPTA '99) Ghent, Belgium, 30 June - 2 July 1999 DEADLINE EXTENSION Since a few people have asked us for more time in order to be able prepare their abstracts, we have decided to extend the deadline with two weeks. The new deadline for 4-10 page abstract submission is February 15 1999. This deadline is hard and final. We cannot extend it any further without compromising the review process, and we will therefore not accept abstracts that reach us too late! More information about ISIPTA '99 can be found on the symposium web site: http://ensmain.rug.ac.be/~isipta99. Gert de Cooman For the ISIPTA '99 Organising Committee -- ============================================================== Dr. ir. Gert de Cooman Postdoctoraal Onderzoeker FWO/Postdoctoral Fellow FWO -------------------------------------------------------------- E-mail: gert.decooman [at] rug [dot] ac.be URL: http://ensmain.rug.ac.be/~gert -------------------------------------------------------------- Universiteit Gent Vakgroep Elektrische Energietechniek Onderzoeksgroep SYSTeMS Technologiepark - Zwijnaarde 9 9052 Zwijnaarde Belgium -------------------------------------------------------------- Tel: +32-(0)9-264 56 53 Fax: +32-(0)9-264 58 40 ============================================================== ----- End Included Message ----- From owner-reliable_computing [at] interval [dot] usl.edu Wed Feb 3 05:52:31 1999 Received: (from daemon@localhost) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id FAA07792 for reliable_computing-outgoing; Wed, 3 Feb 1999 05:52:31 -0600 (CST) Received: from contact.fh-konstanz.de (contact.fh-konstanz.de [141.37.216.5]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id FAA07787 for ; Wed, 3 Feb 1999 05:52:15 -0600 (CST) Received: from ti-pc01.fh-konstanz.de (dec-switch.fh-konstanz.de [141.37.28.1]) by contact.fh-konstanz.de (8.8.8/8.8.8) with SMTP id MAA09919 for ; Wed, 3 Feb 1999 12:51:16 +0100 (MET) Message-Id: <1.5.4.32.19990203113916.006d2f54 [at] mail [dot] fh-konstanz.de> X-Sender: garloff [at] mail [dot] fh-konstanz.de X-Mailer: Windows Eudora Light Version 1.5.4 (32) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Wed, 03 Feb 1999 12:39:16 +0100 To: reliable_computing [at] interval [dot] usl.edu From: Juergen Garloff Subject: submission Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Research Position in the Project Solution of Systems of Algebraic Equations at the Institute for Applied Research of the University of Applied Sciences/ FH Konstanz, Germany Aim of the project funded by the German Ministry for Education, Science, Research, and Technology (BMBF) is the development of new algorithms for solving systems of allgebraic equations. We are seeking a candidate with programming skills in C/C++; a background in interval computations would be beneficial. A master or diploma in mathematics, computer science or related fields is required. The position is termed till Dec. 31, 1999 but is expected to be extended. The salary is regulated by the German BAT contract: IIa BAT or less depending on qualifications. Applications will be accepted until the position is filled. Interested applicants should send a resume and a cover letter as soon as possible to Prof. Dr. Juergen Garloff Fachhochschule Konstanz FB Informatik Postfach 100543 D-78405 Konstanz Germany Tel.: +49-7531-206-597 or -627 Fax: +49-7531-206-559 email: garloff@fh-konstanz.de -------------------------------------------------------------- Prof. Dr. Juergen Garloff Fachhochschule Konstanz/ University of Applied Sciences Konstanz Fachbereich Informatik Postfach 100543 D-78405 Konstanz Germany Tel.: +49-7531-206-597 or -627 Fax: +49-7531-206-559 email: garloff@fh-konstanz.de URL: http://www-home.fh-konstanz.de/~garloff/ -------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] usl.edu Wed Feb 3 11:39:02 1999 Received: (from daemon@localhost) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id LAA08252 for reliable_computing-outgoing; Wed, 3 Feb 1999 11:39:02 -0600 (CST) Received: from cs.utep.edu (cs.utep.edu [129.108.1.41]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with SMTP id LAA08247 for ; Wed, 3 Feb 1999 11:38:53 -0600 (CST) Received: from saturn.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA25998; Wed, 3 Feb 99 10:38:43 MST Date: Wed, 3 Feb 99 10:38:43 MST From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9902031738.AA25998 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu, interval [at] cs [dot] utep.edu Subject: IEEE Hong Kong Symposium on Robotics and Control Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear Colleagues, This is FYI. Robust (including interval-based) control is included and very welcome. Call for Papers IEEE Hong Kong Symposium on Robotics and Control Hong Kong July 2, 3, 1999 Organized by Dept. Mechanical and Automation Eng., CUHK and IEEE HK Joint Chapter on Robotics and Automation and Control Systems Objectives: To provide a forum for researchers in robotics and control areas to disseminate the recent advances and their views on the future perspective of research. Symposium: Two parallel sessions will be run in one and a half days. One is on robotics and the other is on control. In addition, three keynote speeches will be delivered by three renowned scientists in the areas. Topics: The scope will cover but not limited to * Adaptive control * CAD/CAM/Manufacturing * Computer vision * Control applications * Discrete event systems * Fuzzy systems * Human-robot interfaces * Intelligent control * Industrial automation * Linear control * MEMs and smart materials * Mobile robots * Motion planing * Neural networks * Nonlinear control * Robot manipulator control * Robust control * Sensors and actuators * Systems theory Submission of papers: Authors are welcome to submit a full paper of no more than 6 pages printed with high-quality printers in double-column format, using type size of 11-point Unless specified otherwise, correspondence will be directed to the first author. Three copies of each paper should be sent to the program chair: Prof. Yunhui Liu Dept. of Mechanical and Automation Engineering The Chinese University of Hong Kong Shatin, N. T., Hong Kong Tel: +852-2609-8340, Fax: +852-2603-6002 Email: yhliu [at] mae [dot] cuhk.edu.hk Deadlines: Invited papers and keynote speeches: Camera-ready paper: May 1st, 1999 Regular papers: Paper submission: March 15, 1999 Notification of acceptance: April 15, 1999 Camera-ready copy: May 1st, 1999 For further information, please contact Prof. Yunhui Liu Dept. of Mechanical and Automation Engineering The Chinese University of Hong Kong Shatin, N. T., Hong Kong Tel: +852-2609-8340, Fax: +852-2603-6002 http://www.mae.cuhk.edu.hk/events/ Honorary Chair: P. C. Ching (CUHK, Hong Kong) General Chair: Yangsheng Xu (CUHK, Hong Kong) Co-chairs: Max Q.-H. Meng (Alberta, Canada), L. F. Yeung (CityU, Hong Kong) Program Chair: Yunhui Liu (CUHK, Hong Kong) Co-chairs: Jie Huang (CUHK, Hong Kong) Ning Xi (Michigan State, US) Yeung Yam (CUHK, Hong Kong) Organizing Committee: Secretary Y. L. Kan (CUHK, Hong Kong) Local arrangement W. J. Li (CUHK, Hong Kong) Publicity J. Wang (CUHK, Hong Kong) Publication R. Chung (CUHK, Hong Kong) Registration K. C. Hui(CUHK, Hong Kong) Treasurer W. H. Liao(CUHK, Hong Kong) Program Committee: L. L. Cai (HKUST, Hong Kong) P. E. Caines (McGill Canada) X. R. Cao (HKUST, Hong Kong) C. Cassandras(Boston, USA) C. C. Chan (HKU, Hong Kong) H. F. Chen (CAS, China) J. Chow (RPI, USA) S. Chiaverini (Nopoli, Italy) R. C.-K. Chung (CUHK, Hong Kong) L. C. Fu (National Taiwan, Taiwan) T. Fukuda (Nagoya, Japan) A. Isidori (Rome, Italy) P. F. Jia (Tsinghua, China) H. Khalil(Michigan State, USA) C. P. Kwong (CUHK, Hong Kong) Tim Lueth (Humboldt-Berlin, Germany) Z. X. Li (HKUST, Hong Kong) W. Lin (Case Western, USA) Z. H. Luo (Nagaoka, Japan) S. D. Ma (Beijing Inst. of Automation, China) J. Mills (Toronto, Canada) F. Miyazaki (Osaka, Japan) W. J. Rugh(Johns Hopkins, US) Helen Shen (HKUST, Hong Kong) M. Song(Ford, US) T. J. Tarn (Washington, US) Y. Youcef-Toumi (MIT, US) S. K Tso (CityU, Hong Kong) H. T. Tsui (CUHK, Hong Kong) J. Xiao (NSF, US) J. Wen (RPI, US) Danwei Wang (Nanyang, Singapore) J. Wang (CUHK, Hong Kong) Y. C. Wang (Shenyang Inst. of Automation, China) From owner-reliable_computing [at] interval [dot] usl.edu Wed Feb 3 12:00:20 1999 Received: (from daemon@localhost) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id MAA08482 for reliable_computing-outgoing; Wed, 3 Feb 1999 12:00:20 -0600 (CST) Received: from mercury.Sun.COM (mercury.Sun.COM [192.9.25.1]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with SMTP id MAA08477 for ; Wed, 3 Feb 1999 12:00:12 -0600 (CST) Received: from Eng.Sun.COM (engmail4 [129.144.134.6]) by mercury.Sun.COM (SMI-8.6/mail.byaddr) with SMTP id JAA19517 for ; Wed, 3 Feb 1999 09:59:29 -0800 Received: from ha-sims.eng.sun.com (phys-thestorka.Eng.Sun.COM [129.146.1.231]) by Eng.Sun.COM (SMI-8.6/SMI-5.3) with ESMTP id JAA28347 for ; Wed, 3 Feb 1999 09:59:28 -0800 Received: from gww (gww.Eng.Sun.COM) by ha-sims.eng.sun.com (Sun Internet Mail Server sims.3.5.1998.09.21.23.34) with SMTP id <0F6L00ECPB9HON@ha-sims.eng.sun.com> for reliable_computing [at] interval [dot] usl.edu; Wed, 3 Feb 1999 09:58:29 -0800 (PST) Date: Wed, 03 Feb 1999 09:59:27 -0800 (PST) From: William Walster Subject: HPCFIN Conference To: reliable_computing [at] interval [dot] usl.edu Reply-to: William Walster Message-id: <0F6L00ECQB9HON@ha-sims.eng.sun.com> MIME-version: 1.0 X-Mailer: dtmail 1.2.1 CDE Version 1.2.1 SunOS 5.6 sun4m sparc Content-type: TEXT/plain; charset=us-ascii Content-MD5: AqJqEoB+rmY3xbLLbDN+dg== Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk ---------------------------------------------------------------------- Second Announcement and Call for Papers - HPCFIN Conference - HIGH-PERFORMANCE COMPUTING FOR FINANCIAL PLANNING Ischia, Italy - April 11-13, 1999 The Conference on High Performance Computing for Financial Planning aims at bringing together market leaders from the financial services and computing industries with leading scholars to review recent de- velopments in the interface of financial planning and high-performance computing. Equal emphasis will be placed on: - meaningful and practical models that address real needs of the user community that are currently made feasible with the use of high- performance computing; - software and networking issues that make the technology easily ac- cessible by the users. The Conference is the outgrowth of a 3-year project funded by the Di- rectorade General III - Industry of the European Commission under the INCO Program. Project participants will present the results of this project. Papers are also solicited from the international community of finan- cial institutions and academia. HPCFIN Conference is organized as a day of tutorials (April 11, 1999) and two days regular sessions (April 12-13, 1999) on the following topics (include but are not limited to): - Monte Carlo simulations for princing complex derivative securities; - modeling market behaviour using high-frequency data; - risk management using novel optimization techniques; - asset and liability management for insurance and pension fund in the global markets; - novel computational techniques using artificial neural networks, genetic algorithms and parallel computations. Special attention will be given to papers that are relevant to parallel implementations issues. PLENARY SPEAKERS: - Thierry Van der Pyl, European Commission DG III - Industry - Richard Olsen, Olsen & Associates, Zurich, CH TUTORIALS: - Management Science and Operations Research for Planning Financial Services Stavros Zenios, University of Cyprus, Cyprus - The Stochastic Programming Approach to Asset-Liability Management William Ziemba, University of British Columbia, Canada INTERNATIONAL PROGRAM COMMITTEE: - Mordecai Avriel, The Technion, Israel - Achille Basile, University of Naples Federico II'', Italy - Marida Bertocchi, University of Bergamo, Italy - Michael Brennan, The Anderson School, UCLA, USA - Nikos Christofides, Imperial College, UK - Tom Coleman, Cornell University, USA - Pasquale L. De Angelis, Istituto Universitario Navale di Napoli, Italy - Michael Dempster, Cambridge University, UK - Jitka Dupacova, Charles University, Czech Republic - Geoffrey Fox, NPAC, Syracuse University, USA - Lucio Grandinetti, University of Calabria, Italy - Stewart Hodges, Warwick Business School, UK - Andrew Lo, School of Management, MIT, USA - Eitan Muller, Tel-Aviv University, Israel - John Mulvey, Princeton University, USA - Soren Nielsen, University of Texas, USA - Richard Olsen, Olsen & Associates, CH - Paul Refenes, London Business School, UK - Berc Rustem, Imperial College, UK - Anthony Santomero, The Wharton School, USA - Jaap Spronk, Erasmus University, NL - Vincenzo Vespri, University of Florence, Italy - Ton Vorst, Erasmus University, NL - William Ziemba, University of British Columbia, Canada CONFERENCE CHAIRMEN: - Almerico Murli, University of Naples Federico II'' and Director of Center for Research on Parallel Computing and Supercomputers (CPS-CNR), Italy - Stavros Zenios, University of Cyprus, Cyprus SUBMISSIONS: Authors wishing to present a paper are invited to submit an abstract (maximum two pages), by using the electronic form on the web site: http://at.yorku.ca/cgi-bin/amca/submit/cacq-01 and to send a copy by e-mail or fax, to: Prof. Stavros A. Zenios University of Cyprus, Kallipoleos 75 Nicosia, CYPRUS FAX: +357-2-339063 E-MAIL: zenios [at] wharton [dot] upenn.edu zenioss [at] atlas [dot] pba.ucy.ac.cy and to: Prof. Almerico Murli Center for Research on Parallel Computing and Supercomputers Via Cintia, Monte S. Angelo 80126 Napoli, ITALY FAX: +39 - 081 - 675636 E-MAIL: hpcfin [at] matna2 [dot] dma.unina.it Abstracts can be submitted in plain ASCII or in any version of TeX. A confirmation of receipt of abstract is always sent to partecipant by e-mail. A limited number of papers will be selected following a review by the International Program Committee. Selected papers will be published following the usual review process into a special issue of the Journal of Economic Dynamics and Control. IMPORTANT DATES: - Deadline for submission of abstracts: February 28, 1999 - Notification of acceptance: March 15, 1999 - Registration deadline: March 1, 1999 CONFERENCE VENUE: Hotel Regina Isabella in the island of Ischia in the bay of Naples, Italy. REGISTRATION FEES: - 250 US dollars (before March 15, 1999) - 300 US dollars (after March 15, 1999) Registration fee includes admission to the Conference, book of abstracts, coffee breaks, lunches (April 11,12,13) and Gala dinner. Registration form and payment modalities can be found at the web page: http://pixel.dma.unina.it/EVENTS/HPCFIN_ws.html HOTEL RESERVATION: Hotel Reservation form (with all information) can be found at the web page: http://pixel.dma.unina.it/EVENTS/HPCFIN_ws.html ORGANIZATION COMMITTEE: For any questions related to HPCFIN Conference please refer to: Marina Marino University of Naples "Federico II", Italy Francesca Perla University of Rome La Sapienza'', Italy at the following address: Center for Research on Parallel Computing and Supercomputers Via Cintia, Monte S. Angelo, 80126 Naples - Italy FAX: +39-081-675636 E-MAIL: hpcfin [at] matna2 [dot] dma.unina.it WEB SITE: http://pixel.dma.unina.it/EVENTS/HPCFIN_ws.html ------------- End Forwarded Message ------------- From owner-reliable_computing [at] interval [dot] usl.edu Wed Feb 3 13:51:29 1999 Received: (from daemon@localhost) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id NAA08891 for reliable_computing-outgoing; Wed, 3 Feb 1999 13:51:29 -0600 (CST) Received: from inf.ufrgs.br (caracol.inf.ufrgs.br [143.54.11.7]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id NAA08886 for ; Wed, 3 Feb 1999 13:50:48 -0600 (CST) Received: from inf.ufrgs.br (calisto [143.54.13.135]) by inf.ufrgs.br (8.9.1a/8.9.1) with ESMTP id RAA23969 for ; Wed, 3 Feb 1999 17:49:27 -0200 (EDT) Message-ID: <36B8B6F7.CAD246E6 [at] inf [dot] ufrgs.br> Date: Wed, 03 Feb 1999 17:52:07 -0300 From: Rafael Sagula X-Mailer: Mozilla 4.06 [en] (WinNT; I) MIME-Version: 1.0 To: reliable_computing [at] interval [dot] usl.edu Subject: SBAC99 - CALL FOR PAPERS Content-Type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: 8bit Content-Transfer-Encoding: 8bit Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk SBAC-PAD'99 11th SYMPOSIUM ON COMPUTER ARCHITECTURE AND HIGH PERFORMANCE COMPUTING NATAL, BRAZIL September 29th - October 2nd, 1999 CALL FOR PAPERS THE SYMPOSIUM The SBAC-PAD'99 is the continuation of a series of conferences on computer architecture started in 1988. During the last years the conference has shown the wide expansion of knowledge on computer architecture and high performance computing. During the conference, many interactions among researchers are established and new targets are proposed. The conference is opened for all. Graduate students, faculty members and researchers around the world are invited to submit their contributions. In this edition, SBAC-PAD will be held in Natal, one of the most beautiful cities at the northeast of Brazil. INSTRUCTIONS FOR AUTHORS Papers written in English are encouraged and should not exceed 8 pages, double column, 10pt font. Papers written in Portuguese will be accepted but should not exceed 6 pages. Electronic submission in Postscript and PDF formats are strongly recommend. Detailed submission requirements can be found at the SBAC-PAD'99 Web site (http://www.inf.ufrgs.br/~sbac99/) TOPICS OF INTEREST * Application-specific architectures * Benchmarking and measurements * Cache and memory architectures * Distributed and object-oriented operating systems * Fault-tolerant architectures and systems * High performance applications * High performance processor architectures * Interconnection networks * Languages and compilers for parallel and distributed programming * Parallel and distributed computer architecture * Scheduling and load balancing * Simulation and performance evaluation DEADLINES Submission of manuscripts: May 3, 1999 Notification of Acceptance: June 14, 1999 Camera-ready submission: July 12, 1999 SECRETARY Events Secretary - SBAC-PAD'99 Instituto de Informática - UFRGS - PO Box 15064 91501-970 Porto Alegre - RS - Brazil Tel: +55 51 316 6166 Fax: +55 51 319 1576 E-mail: sbac99 [at] inf [dot] ufrgs.br WWW: http://www.inf.ufrgs.br/~sbac99/ GENERAL CHAIR Philippe Olivier A. Navaux UFRGS/Brazil PROGRAM COMMITTEE Afonso Ferreira INRIA/France Alba Cristina Melo CIC/UnB/Brazil Álvaro Coutinho COPPE/UFRJ/Brazil Benjamin Baran CNC/UNA/Paraguay Brigitte Plateau IMAG/France Carl Kesselman ISI/USC/USA Celso Maciel da Costa PUC-RS/Brazil Cláudio F. R. Geyer (Chair) UFRGS/Brazil Edil S. T. Fernandes COPPE/UFRJ/Brazil Eduardo W. Bergamini INPE/MCT/Brazil Ernest Leiss Houston/Texas/USA Frank Dehne Carleton/Canada Gopal Gupta NMSU/USA Guang Gao Delaware/USA Hans Ulrich Heiss Paderborn /Germany Horst Simon NERSC/Berkley/USA Jorge Luis e Silva DC/UFSCar/Brazil Jean-Luc Gaudiot EE/USC/USA José Nelson Amaral PUC-RS/Brazil Júlio Salek Aude NCE/UFRJ/Brazil Líria Matsumoto LSI/USP/Brazil Mario Nemirovsky UCSC/USA Miguel Menasche DEE/PUC-RJ/Brazil Nader Bagherzadeh UC-Irvine/USA Orlando Loques UFF/Brazil Philippe Olivier A. Navaux UFRGS/Brazil Roberto Hexsel UFPR/Brazil Sergio Bampi UFRGS/Brazil Sergio Takeo Kofuji LSI/USP/Brazil Siang Wun Song IME/USP/Brazil Valmir C. Barbosa COPPE/UFRJ/Brazil ORGANIZING COMMITTEE David Boris Paul Deharbe UFRN Denise Grune Ewald CESUP/UFRGS Ivan Saraiva Silva UFRN Jorge Luís Victória Barbosa UCPEL Lourdes Tassinari UFRGS Nicolau Meisel FINEP Patrícia Kayser Vargas UFRGS Paulo Henrique L. Fernandes PUC-RS Rafael Linden Sagula UFRGS Rafael R. dos Santos (Co-Chair) UNISC/UFRGS Ronaldo A. L. Gonçalves UEM/UFRGS Tatiana G. Serra dos Santos UFRGS Tiarajú Asmuz Diverio (Chair) UFRGS From owner-reliable_computing [at] interval [dot] usl.edu Thu Feb 4 07:24:07 1999 Received: by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id HAA09912 for reliable_computing-outgoing; Thu, 4 Feb 1999 07:24:07 -0600 (CST) Received: from suze.ucs.usl.edu (root [at] smh138s [dot] ucs.usl.edu [130.70.40.60]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id HAA09907 for ; Thu, 4 Feb 1999 07:24:05 -0600 (CST) Received: from rbk5287 (rbk5287.usl.edu [130.70.64.43]) by suze.ucs.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with SMTP id HAA07767; Thu, 4 Feb 1999 07:23:46 -0600 (CST) Message-Id: <2.2.32.19990204132347.0076b32c [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="iso-8859-1" Date: Thu, 04 Feb 1999 07:23:47 -0600 To: rueher [at] unice [dot] fr From: "R. Baker Kearfott" Subject: Re: optimal interval enclosure of linear constraint systems Cc: reliable_computing [at] interval [dot] usl.edu Content-Transfer-Encoding: 8bit X-MIME-Autoconverted: from quoted-printable to 8bit by interval.usl.edu id HAA09908 Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Michel, $\Sigma_{i=1}^{i=n}a_i x_i = [\beta_i,b_i]$, a related problem, has definitely been studied. There exists a polynomial time algorithm for this case (but not for the case when the coefficients $a_i$ are intervals -- see "Computational Complexity and Feasibility of Data Processing and Interval Computations", Kreinovich, Lakeyev, Rohn, and Kahl, Kluwer, 1998, or ask Jiri Rohn for his papers.) I'm not certain about the case where $\beta_i = -\infty$, that is, the case you describe. (Note that, even if the problem is NP-complete, there are many interval algorithms to give approximations to the bounding polytope.) I have taken the liberty of posting this to the list reliable_computing [at] interval [dot] usl.edu, to see if anyone else has knowledge of this problem. If anyone does, please reply to both me and Prof. Rueher (or else to the list), as I am also interested. Best regards, Baker At 10:29 AM 2/4/99 +0100, you wrote: >Dear Professor R. Baker Kearfott, > >I would like to compute of the optimal interval >enclosure of linear constraint systems of the form : > $\Sigma_{i=1}^{i=n}a_i x_i \le b_i$ >where the $x_i$'s denote real variables while the $a_i$'s and $b_i$'s are real constants. >More precisely, we would like to find the smallest $n$-ary box containing >the polyhedron (usually it is a polytope since all the $x$'s are bounded) defined by such constraint systems. >The goal is to approximate optima in mixed optimization problems with both real and integer variables; since the problem are mixed we do >not want to use the simplex method. >So, I wonder whether this problem has already been solved in the interval community. > >Thanks in anticipation, > > Michel >-- >Michel Rueher, Professor >Université de Nice - Sophia Antipolis (France) >http://www.essi.fr/~rueher > > > > --------------------------------------------------------------- R. Baker Kearfott, rbk [at] usl [dot] edu (318) 482-5346 (fax) (318) 482-5270 (work) (318) 981-9744 (home) URL: http://interval.usl.edu/kearfott.html Department of Mathematics, University of Southwestern Louisiana USL Box 4-1010, Lafayette, LA 70504-1010, USA --------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] usl.edu Thu Feb 4 09:38:53 1999 Received: by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id JAA10329 for reliable_computing-outgoing; Thu, 4 Feb 1999 09:38:53 -0600 (CST) Received: from cs.utep.edu (cs.utep.edu [129.108.1.41]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with SMTP id JAA10324 for ; Thu, 4 Feb 1999 09:38:46 -0600 (CST) Received: from saturn.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA29276; Thu, 4 Feb 99 08:38:35 MST Date: Thu, 4 Feb 99 08:38:35 MST From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9902041538.AA29276 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu Subject: Re: optimal interval enclosure of linear constraint systems Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear Professor Rueher, >I would like to compute of the optimal interval >enclosure of linear constraint systems of the form : > $\Sigma_{i=1}^{i=n}a_i x_i \le b_i$ >where the $x_i$'s denote real variables while the $a_i$'s and $b_i$'s are >real constants. >More precisely, we would like to find the smallest $n$-ary box containing >the polyhedron (usually it is a polytope since all the $x$'s are bounded) >defined by such constraint systems. >The goal is to approximate optima in mixed optimization problems with >both real and integer variables; since the problem are mixed we do >not want to use the simplex method. >So, I wonder whether this problem has already been solved in the interval >community. It sounds to me as if you have two questions: 1) an explicit question, about the system in which $x_i$ are real variables, and 2) an implicit question, in which some of the variables $x_i$ may take integer values. In the first case, when $x_i$ are real variables, you want to find (if I understood you correctly), for each $i$ from 1 to $n$, the smallest and the largest values of $x_i$ which satisfy the above inequality constraints. Finding the smallest possible value of such $x_i$ is equivalent to solving the following linear programming problem: $x_i\to\min$ under the conditions $\sum_{i=1}^{i=n}a_{ji} x_i \le b_j$, where $j=1,2,\ldots$ is the number of the constraint. Similarly, finding the largest possible value of $x_i$ means solving a similar problem with max instead of min. Both problems are linear programming problems, so we can use methods developed in linear programming for solving these problems. * We can either use simplex method which is * polynomial-time on average but * exponential-time in the worst case, * or we can use ellipsoid methods (efficient ones started with Karmarkar's 1984 paper) which are * polynomial-time in the worst case. There has been a lot of improvement in progress in linear programming community, and I do not think anyone from interval community has designed any new algorithm for linear programming that can beat their algorithms. 2) In the second case, the problem is a generalization of integer linear programming which is known to be NP-hard, so there is not much hope to find a polynomial-time method. There has been some research in interval community about integer linear programming problems with interval coefficients, but they are usually reducing to known algorithms for the case when intervals are degenerate (i.e., become real numbers), and I am not aware of new interval community-generated algorithms intended to simply solve integer linear programming problems in which all the coefficients are real numbers (not intervals). Vladik From owner-reliable_computing [at] interval [dot] usl.edu Thu Feb 4 10:25:40 1999 Received: (from daemon@localhost) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id KAA10608 for reliable_computing-outgoing; Thu, 4 Feb 1999 10:25:40 -0600 (CST) Received: from balan.ap.univie.ac.at (balan.ap.univie.ac.at [131.130.11.51]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with SMTP id KAA10603 for ; Thu, 4 Feb 1999 10:25:30 -0600 (CST) Received: from homer.mat.univie.ac.at by balan.ap.univie.ac.at (5.65v4.0/1.1.10.5/01Feb99-0628PM) id AA01953; Thu, 4 Feb 1999 17:25:18 +0100 Received: by homer.mat.univie.ac.at (5.65v3.2/1.1.10.5/19Mar97-1148AM) id AA08636; Tue, 2 Feb 1999 13:27:01 +0100 Date: Tue, 2 Feb 1999 13:27:01 +0100 From: Arnold Neumaier Message-Id: <9902021227.AA08636 [at] homer [dot] mat.univie.ac.at> To: reliable_computing [at] interval [dot] usl.edu Subject: Re: Newton interval for rectangular matrices Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk [I am not sure whether I sent this already; if so, please excuse. A.N.] Luc Jaulin asked for the best way to solve a rectangular linear system of interval equations (2) [A]x=[z], x in [x] I think this is an important problem that received so far much less attention than desirable. In many applications, [x] is nonnegative; then the best approach, giving the tightest possible intervals, is to solve 2*dim(x) linear programs min +-x_i s.t. inf(A)*x<=sup(z), sup(A)*x>=inf(z), inf(x)<=x<=sup(x) On many platforms one can exploit that only the objective function changes in these problems. Work is O(n^4) at worst. In general, there is no clear answer what to do; I'd recommend the approach given for homogeneous rectangular systems in A. Neumaier, The enclosure of solutions of parameter-dependent systems of equations. In: Reliability in Computing (ed. by R.E. Moore). Acad. Press, San Diego 1988, pp. 269-286. The suggestion there is to use row pivoting of a suitably scaled copy of [A] to pick the most relevant rows of [A] to be used for preconditioning, and refines the preconditioned estimate by generalized Gauss-Seidel sweeps both on the original and on the preconditioned system. One may also try to improve the result by adding further equations obtained by different preconditioning. The scaling used has a big effect on the result, and research on how to do it best would be quite important. To make the system homogeneous, write (2) as [A]x=[z]x_{n+1}, x in [x], x_{n+1}=1. Note that it may pay (sometimes drastically) to add the equations Ix=[x]x_{n+1} to the system before proceeding as described. Arnold Neumaier From owner-reliable_computing [at] interval [dot] usl.edu Thu Feb 4 10:25:45 1999 Received: (from daemon@localhost) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id KAA10631 for reliable_computing-outgoing; Thu, 4 Feb 1999 10:25:45 -0600 (CST) Received: from ifp.ifp.fr (ifp.ifp.fr [156.118.212.2]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id KAA10601 for ; Thu, 4 Feb 1999 10:25:24 -0600 (CST) Received: from irsun76.ifp.fr (irsun76.ifp.fr [156.118.20.70]) by ifp.ifp.fr (8.8.5/8.8.5) with ESMTP id RAA11424 for ; Thu, 4 Feb 1999 17:23:53 +0100 (MET) Received: from ifp.fr (localhost [127.0.0.1]) by irsun76.ifp.fr (8.8.5/8.8.5) with ESMTP id RAA20014 for ; Thu, 4 Feb 1999 17:25:28 +0100 (MET) Message-ID: <36B9C9F7.6824209C [at] ifp [dot] fr> Date: Thu, 04 Feb 1999 17:25:28 +0100 From: "Philippe.NIVLET" Organization: IFP X-Mailer: Mozilla 4.05 [en] (X11; I; SunOS 5.6 sun4u) MIME-Version: 1.0 To: reliable_computing [at] interval [dot] usl.edu Subject: intervals arithmetic and rough sets Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear members, I am currently beginning a pHD on uncertainties in the geophysical field. My problem is to evaluate at each step of the process these uncertainties, which can be due to interpretation parameters or input parameters. I would try to apply methods such as interval arithmetic or rough sets to this issue. If you know general references about this kind of problems, could you please give them to me. Thank you. Best regards. -- ************************************************ Philippe NIVLET Institut Francais du Petrole Division Geophysique et Instrumentation tel : 33-(0)1-47-52-60-00 (poste 8824) mail : philippe.nivlet [at] ifp [dot] fr ************************************************ From owner-reliable_computing [at] interval [dot] usl.edu Thu Feb 4 11:11:06 1999 Received: (from daemon@localhost) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id LAA11177 for reliable_computing-outgoing; Thu, 4 Feb 1999 11:11:06 -0600 (CST) Received: from antares.mcs.anl.gov (mcs.anl.gov [140.221.9.6]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with SMTP id LAA11172 for ; Thu, 4 Feb 1999 11:11:00 -0600 (CST) Received: from ember.mcs.anl.gov (ember.mcs.anl.gov [140.221.9.206]) by antares.mcs.anl.gov (8.6.10/8.6.10) with ESMTP id LAA22847; Thu, 4 Feb 1999 11:10:40 -0600 Received: from mcs.anl.gov (more@localhost) by ember.mcs.anl.gov (8.8.8/8.8.8) with ESMTP id LAA10202; Thu, 4 Feb 1999 11:11:50 -0600 (CST) Message-Id: <199902041711.LAA10202 [at] ember [dot] mcs.anl.gov> X-Authentication-Warning: ember.mcs.anl.gov: more owned process doing -bs To: reliable_computing [at] interval [dot] usl.edu cc: more [at] mcs [dot] anl.gov Subject: Postdoctoral position at Argonne on optimization Date: Thu, 04 Feb 1999 11:11:50 -0600 From: "Jorge More'" Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk We are seeking, in particular, applications from researchers interested in global optimization. Jorge ===================== Postdoctoral Positions: Optimization / metaNEOS Project We invite applications for postdoctoral research positions in the metaNEOS project. This project, which involves researchers at Argonne National Laboratory, the University of Chicago, Columbia University, Northwestern University, and the University of Wisconsin, will explore the use of metacomputing platforms in solving large optimization problems. The successful candidates will work in fundamental algorithm analysis and development and/or construction of optimization software tools, including tools targeted to the metacomputing environment. Further information on the metaNEOS project can be obtained from the project Web site at www.mcs.anl.gov/metaneos/ Candidates should have a Ph.D. in optimization, numerical analysis, applied mathematics, or computer science. Knowledge of computational optimization algorithms, familiarity with software tool development for scientific computing, and experience with parallel computation are all highly desirable. A broad background in computer science is also a plus. Good communication skills and a willingness to work in a collaborative environment are essential. The successful candidates will be appointed at Northwestern University, but will spend the majority of their time at Argonne. The Mathematics and Computer Science Division at Argonne has an outstanding computational environment that includes the facilities of the newly established Center for Computational Science and Technology. At the core of the center are scalable parallel computers, a distributed supercomputing laboratory, and a virtual environments laboratory. Argonne is located in the southwestern Chicago suburbs, offering the advantages of affordable housing, good schools, and easy access to the cultural attractions of the city. Resumes should be addressed to Jan Griffin Mathematics and Computer Science Division Argonne National Laboratory 9700 S. Cass Avenue Argonne, IL 60439 and must include a resume and the names and addresses of three references. For electronic submission of applications, please e-mail to griffin [at] mcs [dot] anl.gov. The positions are available immediately; applications will be accepted until they are filled. For further inquiries, contact Jorge More' (more [at] mcs [dot] anl.gov) or Steve Wright (wright [at] mcs [dot] anl.gov). Northwestern University is an affirmative action/equal opportunity employer. Hiring is contingent upon eligibility to work in the United States. From owner-reliable_computing [at] interval [dot] usl.edu Thu Feb 4 16:30:19 1999 Received: by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id QAA11725 for reliable_computing-outgoing; Thu, 4 Feb 1999 16:30:19 -0600 (CST) Received: from alpha.teleriviera.fr (alpha.teleriviera.fr [195.115.146.8]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id QAA11720 for ; Thu, 4 Feb 1999 16:30:13 -0600 (CST) Received: from pc2-55 ([192.168.3.6]) by alpha.teleriviera.fr (8.8.5/) with SMTP id XAA11629; Thu, 4 Feb 1999 23:22:26 +0100 (MET) Message-ID: <006801be508d$d8f50660$a87cfea9@pc2-55.teleriviera.fr> From: "Michel Rueher" To: "Vladik Kreinovich" , Subject: Re: optimal interval enclosure of linear constraint systems Date: Thu, 4 Feb 1999 23:29:31 +0100 MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 8bit X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 4.72.3110.5 X-MimeOLE: Produced By Microsoft MimeOLE V4.72.3110.3 Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk >From : Vladik Kreinovich ... > >It sounds to me as if you have two questions: >1) an explicit question, > about the system in which $x_i$ are real variables, and >2) an implicit question, in which some of the variables $x_i$ may > take integer values. > >In the first case, when $x_i$ are real variables, >you want to find (if I understood you correctly), for each $i$ from 1 to >$n$, the smallest and the largest values of $x_i$ which satisfy the >above inequality constraints. Finding the smallest possible value of >such $x_i$ is equivalent to solving the following linear programming >problem: > I'm afraid you didn’t get the point: I do not want to compute every vertex of the polytope but the smallest box that contains the polytope. For example, if the solution space of the constraint system is delimited by a triangle, I just want to find the smallest rectangle containing this triangle. To find such a n-ary box , I definitively don't want to solve 2*n linear optimisations problems. Michel From owner-reliable_computing [at] interval [dot] usl.edu Thu Feb 4 16:52:24 1999 Received: by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id QAA11976 for reliable_computing-outgoing; Thu, 4 Feb 1999 16:52:24 -0600 (CST) Received: from cs.utep.edu (cs.utep.edu [129.108.1.41]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with SMTP id QAA11971 for ; Thu, 4 Feb 1999 16:52:08 -0600 (CST) Received: from saturn.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA01424; Thu, 4 Feb 99 15:51:41 MST Date: Thu, 4 Feb 99 15:51:41 MST From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9902042251.AA01424 [at] cs [dot] utep.edu> To: vladik [at] cs [dot] utep.edu, reliable_computing [at] interval [dot] usl.edu, rueher [at] teleriviera [dot] fr Subject: Re: optimal interval enclosure of linear constraint systems Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk > >From : Vladik Kreinovich > ... > > > >It sounds to me as if you have two questions: > >1) an explicit question, > > about the system in which $x_i$ are real variables, and > >2) an implicit question, in which some of the variables $x_i$ may > > take integer values. > > > >In the first case, when $x_i$ are real variables, > >you want to find (if I understood you correctly), for each $i$ from 1 to > >$n$, the smallest and the largest values of $x_i$ which satisfy the > >above inequality constraints. Finding the smallest possible value of > >such $x_i$ is equivalent to solving the following linear programming > >problem: Dear Michel, Maybe I misunderstood you. Maybe my explanation was not clear enough. In both cases, I apologize. Let me try to rephrase my idea. Baker, if you can help me or Michael by further rephrasing, please do so. > I'm afraid you didn't get the point: I do not want to compute every ver= > tex > of the polytope but the smallest box that contains the polytope. This is exactly what I am suggesting. The algorithm which I described above does NOT compute every vertex, it only computes the box which contains the polytope. > For > example, if the solution space of the constraint system is delimited by a > triangle, I just want to find the smallest rectangle containing this > triangle. This is exactly what the above algorithm is doing. For a box $B=[a_1,b_1]\times \ldots [a_n,b_m]$ to contain a polytope $P$, we need, in particular, to require that every value $x_1$ which can be the 1st coordinate of a point from $P$ is in $[a_1,b_1]$. The box is the narrowest in its 1st coordinate if it ONLY contains such points. Therefore, to find $a_1$, it is suffciient to find the smallest possible value of $x_1$ for all points $x=(x_1,\ldots,x_n)$ which belong to the polytope $P$ (i.e., which satisfy all the inequalities). So, the value $a_1$ is a solution to the optimization problem $x_1\to\min$ under the condition $(x_1,\ldots,x_n)\in P$ (i.e., which is equivalent, under all the inequality conditions). Thus, the problem of finding the value $a_1$ for the smallest box which encloses the desired polytope is a linear programming problem. Similarly, to find $b_1$, we solve the following problem: $x_1\to\max$ under the condition $(x_1,\ldots,x_n)\in P$ (i.e., which is equivalent, under all the inequality conditions). Thus, after solving 2 linear programming problems, you get the interval $[a_1,b_1]$ of the smallest box. Similarly, we solve two more problems to find $[a_1,b_2]$, etc., and after solving problems, we get the complete description of the box $B$. > To find such a n-ary box , I definitively don't want to solve 2*n linear > optimisations problems. I am not sure I understand why you do not want 2n optimiszation problems. Since linear programming is polynomial time, you still get a polynomail time algorithm. Do you want a faster algorithm that solving 2n linear programming problems? Or there is other reason why you are looking for a different algorithm? Vladik From owner-reliable_computing [at] interval [dot] usl.edu Fri Feb 5 08:17:26 1999 Received: by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id IAA12896 for reliable_computing-outgoing; Fri, 5 Feb 1999 08:17:26 -0600 (CST) Received: from linuxmail.dibe.unige.it (IDENT:root [at] linuxmail [dot] dibe.unige.it [130.251.89.131]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id IAA12891 for ; Fri, 5 Feb 1999 08:16:55 -0600 (CST) Received: from thevenin (thevenin.dibe.unige.it [130.251.89.139]) by linuxmail.dibe.unige.it (8.8.5/8.8.5) with SMTP id PAA29300 for ; Fri, 5 Feb 1999 15:29:51 +0100 Message-ID: <000901be5112$30543a00$8b59fb82 [at] thevenin [dot] dibe.unige.it> From: "Federico Bizzarri" To: "interval mailing list" Subject: clustering Date: Fri, 5 Feb 1999 15:16:54 +0100 MIME-Version: 1.0 Content-Type: multipart/alternative; boundary="----=_NextPart_000_0006_01BE511A.909AB490" X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 4.72.2106.4 X-MimeOLE: Produced By Microsoft MimeOLE V4.72.2106.4 Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Messaggio a più sezioni in formato MIME. ------=_NextPart_000_0006_01BE511A.909AB490 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable Can anyone tell me something about the "clustering phenomenon" that can = be found working with Interval Analysis Algorithms? For example it can be found in some algorithms to solve non-linear = system of equations, proposed by L.Kolev, in order to identify all the = DC operating points of a resistive network. Thanks. Federico Bizzarri ------=_NextPart_000_0006_01BE511A.909AB490 Content-Type: text/html; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable
Can anyone tell me something about = the =20 "clustering phenomenon" that can be found working with = Interval=20 Analysis Algorithms?
For example it = can be found=20 in some algorithms to solve non-linear system of equations, proposed by = L.Kolev,=20 in order to identify all the DC operating points of a resistive=20 network.
Thanks.
Federico = Bizzarri
------=_NextPart_000_0006_01BE511A.909AB490-- From owner-reliable_computing [at] interval [dot] usl.edu Fri Feb 5 11:06:14 1999 Received: by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id LAA13279 for reliable_computing-outgoing; Fri, 5 Feb 1999 11:06:14 -0600 (CST) Received: from balin.ap.univie.ac.at (balin.ap.univie.ac.at [131.130.11.50]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with SMTP id LAA13274 for ; Fri, 5 Feb 1999 11:06:08 -0600 (CST) Received: from homer.mat.univie.ac.at by balin.ap.univie.ac.at (5.65v4.0/1.1.10.5/01Feb99-0627PM) id AA03971; Fri, 5 Feb 1999 18:06:04 +0100 Received: by homer.mat.univie.ac.at (5.65v3.2/1.1.10.5/19Mar97-1148AM) id AA13748; Fri, 5 Feb 1999 18:06:04 +0100 Date: Fri, 5 Feb 1999 18:06:04 +0100 From: Arnold Neumaier Message-Id: <9902051706.AA13748 [at] homer [dot] mat.univie.ac.at> To: bizet [at] linuxmail [dot] dibe.unige.it, reliable_computing [at] interval [dot] usl.edu Subject: Re: clustering Cc: neum [at] cma [dot] univie.ac.at Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk >>Can anyone tell me something about the "clustering phenomenon" that can = be found working with Interval Analysis Algorithms?<< I think, Baker kearfott and his group has published about this... Arnold Neumaier From owner-reliable_computing [at] interval [dot] usl.edu Fri Feb 5 13:43:20 1999 Received: by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id NAA13666 for reliable_computing-outgoing; Fri, 5 Feb 1999 13:43:20 -0600 (CST) Received: from suze.ucs.usl.edu (root [at] smh138s [dot] ucs.usl.edu [130.70.40.60]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id NAA13661 for ; Fri, 5 Feb 1999 13:43:19 -0600 (CST) Received: from bp.usl.edu (liberty.usl.edu [130.70.46.171]) by suze.ucs.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with SMTP id NAA21727; Fri, 5 Feb 1999 13:43:11 -0600 (CST) Message-Id: <2.2.32.19990205193943.00682180 [at] pop [dot] usl.edu> X-Sender: rbk5287 [at] pop [dot] usl.edu X-Mailer: Windows Eudora Pro Version 2.2 (32) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Fri, 05 Feb 1999 13:39:43 -0600 To: reliable_computing [at] interval [dot] usl.edu From: "R. Baker Kearfott" Subject: Re: clustering Cc: bizet [at] linuxmail [dot] dibe.unige.it Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Yes. Check out my home page at http://interval.usl.edu/kearfott.html by clicking on "preprints". The papers you want are The Cluster Problem in Global Optimization: The Univariate case, joint with K. Du, in Computing (Suppl.) 9, pp. 117-127 (1992). and The Cluster Problem in Multivariate Global Optimization, joint with K. Du, in the Journal of Global Optimization 5, pp. 253-265 (1994). Preprints are available in Postscript and DVI form from the above-mentioned web site. The above do not tell the whole story about the "Cluster" problem. There are other reasons for it in practical implementations. I am presently writing up something about that. Best regards, Baker At 06:06 PM 2/5/99 +0100, Arnold Neumaier wrote: >>>Can anyone tell me something about the "clustering phenomenon" that can = >be found working with Interval Analysis Algorithms?<< > >I think, Baker kearfott and his group has published about this... > >Arnold Neumaier > > --------------------------------------------------------------- R. Baker Kearfott, rbk [at] usl [dot] edu (318) 482-5346 (fax) (318) 482-5270 (work) (318) 981-9744 (home) URL: http://interval.usl.edu/kearfott.html Department of Mathematics, University of Southwestern Louisiana USL Box 4-1010, Lafayette, LA 70504-1010, USA --------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] usl.edu Sun Feb 7 21:35:27 1999 Received: (from daemon@localhost) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id VAA15773 for reliable_computing-outgoing; Sun, 7 Feb 1999 21:35:27 -0600 (CST) Received: from mscs.mu.edu (studsys.mscs.mu.edu [134.48.4.25]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with SMTP id VAA15768 for ; Sun, 7 Feb 1999 21:35:23 -0600 (CST) Received: (qmail 26155 invoked from network); 8 Feb 1999 03:35:20 -0000 Received: from ppp108.csd.mu.edu (HELO taylor) (134.48.24.8) by studsys.mscs.mu.edu with SMTP; 8 Feb 1999 03:35:20 -0000 Message-ID: <001e01be5314$208522c0$08183086@taylor> From: "George Corliss" To: "reliable_computing" Subject: Tighter bounds for Taylor coefficients? Date: Sun, 7 Feb 1999 21:35:50 -0600 MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 4.72.3155.0 X-MimeOLE: Produced By Microsoft MimeOLE V4.72.3155.0 Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Interval Taylor Coefficients Solve a System George F. Corliss, georgec [at] mscs [dot] mu.edu Marquette University 07 Feb 1999 For many years, I have suggested using nonlinear system tools to tighten enclosures for Taylor series coefficients generated by recurrence relations. This message outlines the approach and why it DOES NOT WORK. For example, consider the Lorenz system x' = sigma * (y(t) - x(t)) y' = r * x(t) - y(t) - x(t) * z(t) z' = x(t) * y(t) - b * z(t), with sigma = 10, b = 8/3, and r = 28, and interval-valued initial conditions. Taylor coefficients are given by recurrence relations X[2] := sigma*(Y[1] - X[1]) * h; Y[2] := (r*X[1] - Y[1] - X[1]*Z[1]) * h; Z[2] := (X[1]*Y[1] - (b*Z[1])) * h; for k from 3 to Order do X[k] := sigma*(Y[k-1] - X[k-1]) * h / (k-1); Y[k] := (r*X[k-1] - Y[k-1] - sum(X[n]*Z[k-n-1], n = 1..k-1)) * h / (k-1); Z[k] := (sum(X[n]*Y[k-n-1], n = 1..k-1) - b*Z[k-1]) * h / (k-1); od; Low order terms appear many times in the computation of the high order terms, so the dependency effects lead to large over-estimations, which force an ODE solver to take much smaller steps than should be required. Suppose we view the recurrence relations as defining a system of equations for the unknowns X[2], Y[2], Z[2], ... Forward substitution solves the system, but an interval Newton, constraint propagation, or other technique might give tighter enclosures. The interval Newton system for this example (and in general, for h small) has diagonal elements 1 is sparse, lower triangular, and strictly diagonally dominant has modest condition number A Gauss-Seidel iterative solution to the interval Newton system is EXACTLY the same as a centered mean value evaluation of the forward recurrences. Hence one Newtion iteration and Gauss-Seidel iteration are sufficient, but NEITHER OFFER AN APPRECIABLE IMPROVEMENT OVER NAIVE INTERVAL EVALUATION of the recurrence relations, although they take far more CPU time. Reformulating recurrence relations as a system DOES NOT HELP because the dependence of high order terms on multiple copies of low order terms is genuine. Tricky evaluation does not remove it. On the other hand, by using Maple to express symbolically high order terms as expressions in initial conditions X[1], Y[1], and Z[1], arranging those expressions carefully, and evaluating in as naive interval arithmetic DOES give bounds tighter than evaluating the recurrence relations directly. To me, this points to the insight and power of the approach of Martin Berz (see www.mscs.mu.edu/~globsol/13Berz/). He expands the solutions x(t), y(t), and z(t) as a floating-point valued truncated Taylor series in terms of the INITIAL CONDITIONS, and adds a constant interval enclosure of round-off and truncation errors. I do not care to write a journal article on this great idea that did not work, so I'll let this message communicate the negative results. If anyone cares for details, please e-mail me, and I can send a sequence of Maple worksheets. Otherwise, I recommend Berz's papers at http://bt.nscl.msu.edu/cosy/index.htm See [COSY References] link. From owner-reliable_computing [at] interval [dot] usl.edu Mon Feb 8 16:13:30 1999 Received: by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id QAA16785 for reliable_computing-outgoing; Mon, 8 Feb 1999 16:13:30 -0600 (CST) Received: from cs.utep.edu (cs.utep.edu [129.108.1.41]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with SMTP id QAA16780 for ; Mon, 8 Feb 1999 16:13:23 -0600 (CST) Received: from saturn.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA14355; Mon, 8 Feb 99 15:13:18 MST Date: Mon, 8 Feb 99 15:13:18 MST From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9902082213.AA14355 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu, interval [at] cs [dot] utep.edu Subject: New Journal, Optimization and Engineering Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk >From NA Digest: Call for papers for the new journal OPTIMIZATION AND ENGINEERING The first issue is due to be published by Kluwer Academic Publishers in early 2000 in early 2000 AIMS and SCOPE: Optimization and Engineering is a multidisciplinary journal. Its primary goal is to promote the application of optimization methods in the general area of engineering sciences. This includes facilitating the development of advanced optimization methods for direct or indirect use in engineering sciences. The journal provides a forum in which engineering scientists obtain information about recent advances of optimization sciences, and researchers in mathematical optimization learn about the needs of engineering sciences and successful applications of optimization methods. Its aim is to close the gap between optimization theory and the practice of engineering. All optimization methods of relevance to applications in engineering sciences will be considered: deterministic and stochastic, continuous, mixed integer and discrete, when they are relevant for applications in engineering sciences. The journal also strives to publish successful applications of optimization in various engineering areas. The scope of the journal includes the following: OPTIMIZATION: All mathematical methods and algorithms of mathematical optimization. Numerical and implementation issues, optimization software, bench-marking. Specifically: Linear and convex optimization, general nonlinear and nonlinear mixed- integer optimization, combinatorial optimization, equilibrium, multilevel and multi-objective optimization, stochastic optimization. ENGINEERING SCIENCES: Electrical engineering, VLSI design, robotics, mechanical and structural engineering, geophysical engineering, civil engineering, industrial engineering, chemical and process engineering, aerospace engineering, water management, environmental and bio-engineering, transportation and communication sciences. SUBMISSIONS: Papers submitted for publication in OPTIMIZATION AND ENGINEERING should be sent to the editor in chief Tamas Terlaky Dept SSOR, Facylty ITS/TWI Delft University of Technology P.O. Box 5031, 2600 GA Delft, The Netherlands Tel.: +31 15 2782547 Fax: +31 15 2787255 E-mail: T.Terlaky [at] twi [dot] tudelft.nl URL address: http://ssor.twi.tudelft.nl/~terlaky Electronic submission of papers is strongly encouraged. For more information look at: http://ssor.twi.tudelft.nl/~terlaky/OPTE/call-for-papers.opte From owner-reliable_computing [at] interval [dot] usl.edu Sun Feb 14 15:52:51 1999 Received: (from daemon@localhost) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id PAA22022 for reliable_computing-outgoing; Sun, 14 Feb 1999 15:52:51 -0600 (CST) Received: from cs.utep.edu ([129.108.5.2]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with SMTP id PAA22017 for ; Sun, 14 Feb 1999 15:52:47 -0600 (CST) Received: from saturn.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1) id AA01689; Sun, 14 Feb 99 14:52:45 MST Date: Sun, 14 Feb 99 14:52:45 MST From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich) Message-Id: <9902142152.AA01689 [at] cs [dot] utep.edu> To: reliable_computing [at] interval [dot] usl.edu Subject: from NA Digest; interval linear algebra Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk From: Jack Dongarra Date: Thu, 11 Feb 1999 11:40:23 -0500 Subject: BLAS Technical Forum BLAS TECHNICAL FORUM, March 16-18, 1998, Oak Ridge, TN We are planning a BLAS Technical Forum meeting on March 16-18, 1999. The meeting will be hosted by the University of Tennessee and will be held at the Ramada Inn & Suites in Oak Ridge, TN: Ramada Inn & Suites 420 S. Illinois Avenue Oak Ridge, TN 37830 (423) 483-4371 The Forum has been established to consider expanding the Basic Linear Algebra Subprograms (BLAS) in a number of directions in the light of modern software, language, and hardware developments. The first meeting of the Forum was held in Nashville on February 19-20, 1996. We strongly urge and encourage attendance at the meeting so that we can make tangible progress towards much needed standards. Wide input is needed to help ensure that emerging proposals are useful and acceptable to the community. It is appreciated that it is not easy for everyone to attend the meetings of the Forum, but we would nevertheless welcome your input since we wish the discussion to be as open as possible, and the results to reflect consensus from the community at large. The tentative schedule for the meeting will be: 9am-5pm: Tues, March 16 9am-5pm: Wed, March 17 9am-1pm: Thurs, March 18 Morning and afternoon snacks will be provided, but you're on-your-own for lunches. A rough agenda for the meeting follows: * Second/third reading of the following chapters: Chapter 1: Introduction Chapter 2: Dense and Banded BLAS Chapter 3: Sparse BLAS Chapter 4: Extended and Mixed Precision BLAS Chapter 5: Interval BLAS * Discussion of model implementations and test suites. Please send us items you would like to see on the agenda or that you would like to discuss. For more information see: http://www.netlib.org/blas/blast-forum/blast-forum.html Jack Dongarra and Sven Hammarling From owner-reliable_computing [at] interval [dot] usl.edu Thu Feb 18 17:25:20 1999 Received: (from daemon@localhost) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id RAA25937 for reliable_computing-outgoing; Thu, 18 Feb 1999 17:25:20 -0600 (CST) Received: from mercury.Sun.COM (mercury.Sun.COM [192.9.25.1]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with SMTP id RAA25932 for ; Thu, 18 Feb 1999 17:25:12 -0600 (CST) Received: from Eng.Sun.COM (engmail4 [129.144.134.6]) by mercury.Sun.COM (SMI-8.6/mail.byaddr) with SMTP id PAA12990 for ; Thu, 18 Feb 1999 15:24:38 -0800 Received: from ha-sims.eng.sun.com (phys-thestorka.Eng.Sun.COM [129.146.1.231]) by Eng.Sun.COM (8.8.8+Sun/SMI-5.3) with ESMTP id PAA05426 for ; Thu, 18 Feb 1999 15:24:37 -0800 (PST) Received: from gww (gww.Eng.Sun.COM) by ha-sims.eng.sun.com (Sun Internet Mail Server sims.3.5.1998.09.21.23.34) with SMTP id <0F7D00CFPIBANM@ha-sims.eng.sun.com> for reliable_computing [at] interval [dot] usl.edu; Thu, 18 Feb 1999 15:23:34 -0800 (PST) Date: Thu, 18 Feb 1999 15:24:36 -0800 (PST) From: William Walster Subject: HPCN99-Early-Registration-Deadline To: reliable_computing [at] interval [dot] usl.edu Reply-to: William Walster Message-id: <0F7D00CFQIBANM@ha-sims.eng.sun.com> MIME-version: 1.0 X-Mailer: dtmail 1.2.1 CDE Version 1.2.1 SunOS 5.6 sun4m sparc Content-type: TEXT/plain; charset=us-ascii Content-MD5: AY+r4qkwkh8SFXnJNFeXwQ== Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk *********************************************************************** * * * HPCN Europe 99 * * * * RAI Conference Center Amsterdam, April 12-14, 1999 * * * ************************************************************************ Early registration deadline FEBRUARY 28 ! REGISTER NOW! http://www.wins.uva.nl/events/HPCN99/registration.html The Organisation of the HPCN Europe '99 event is proud to announce the HPCN Europe '99 Program. For the detailed program see: http://www.wins.uva.nl/events/HPCN99/ HPCN Europe '99 covers a multi-workshop and conference event: - HPCN Conference: - Industrial and General Applications - Computational Science - Computer Science - Workshops: - Virtual Reality - Distributed and MetaComputing - Java in HPC - EuroTools Workshop on Performance Prediction and Measurement - High Performance Numerical Computations with Applications - High Performance Computing on Very Large Data Sets - Enabling Technology, Hard- and Software - High Performance Data Mining for Large Scale Data Sets - The Hospital of the Future: European Technology Transfer - Applications in Finance - 1355 Interconnect and Routing - Traffic Simulation - International mini Conference on Telemedical Information Society IEEE EMBS ITIS-ITAB '99 HPCN Europe 99 has six (!) parallel tracks. - 4 tracks with 13 (!) thematic workshops presenting (invited) papers - 2 conference tracks presenting 84 selected papers as well as - 2 poster sessions, presenting a total of 54 selected papers. Finally, HPCN Europe '99 presents three renowned keynote speakers: - R. Gruber from EPFL, Switzerland 'Parallel Computer Architectures for Commodity Computing' - C. Kesselman from the California Institute of Technology, USA 'Life on the Grid: Adventures in High Performance Distributed Computing Using the Globus Computational Grid Toolkit' - P. Adriaans from Syllogic BV, The Netherlands 'Fuzzy Logic' Come and join us at HPCN Europe 99 ! All information can be found on: ******************************************* * * * http://www.wins.uva.nl/events/HPCN99/ * * * ******************************************* From owner-reliable_computing [at] interval [dot] usl.edu Sat Feb 20 16:02:57 1999 Received: by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id QAA27733 for reliable_computing-outgoing; Sat, 20 Feb 1999 16:02:57 -0600 (CST) Received: from kleene.math.wisc.edu (kleene.math.wisc.edu [144.92.166.90]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id QAA27728 for ; Sat, 20 Feb 1999 16:02:53 -0600 (CST) Received: from riemann.math.wisc.edu (riemann.math.wisc.edu [144.92.166.103]) by kleene.math.wisc.edu (8.9.1a/8.9.1) with ESMTP id PAA02872 for ; Sat, 20 Feb 1999 15:57:54 -0600 (CST) From: Lou Rall Received: (from rall@localhost) by riemann.math.wisc.edu (8.8.8/8.8.8) id QAA16592 for reliable_computing [at] interval [dot] usl.edu; Sat, 20 Feb 1999 16:01:25 -0600 (CST) Date: Sat, 20 Feb 1999 16:01:25 -0600 (CST) Message-Id: <199902202201.QAA16592 [at] riemann [dot] math.wisc.edu> To: reliable_computing [at] interval [dot] usl.edu Subject: Freiburger Intervall-Berichte Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk I have duplicate copies of complete volumes and individual numbers of the Freiburger Intervall-Berichte, other intervalabilia, and books on Pascal-SC and Pascal-XSC that I would like to dispose of at reasonable prices. If you're interested, contact me and I'll send you a list of what's available and prices. rall [at] math [dot] wisc.edu (Louis Rall) From owner-reliable_computing [at] interval [dot] usl.edu Wed Feb 24 16:15:38 1999 Received: (from daemon@localhost) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id QAA01388 for reliable_computing-outgoing; Wed, 24 Feb 1999 16:15:38 -0600 (CST) Received: from london.eiffel.com (outback.eiffel.com [198.68.147.2]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id QAA01383 for ; Wed, 24 Feb 1999 16:15:31 -0600 (CST) Received: from dublin.eiffel.com (dublin.eiffel.com [89.9.200.6]) by london.eiffel.com (8.8.8/8.8.8) with SMTP id OAB20891 for ; Wed, 24 Feb 1999 14:08:53 -0800 (PST) Received: from lannion.eiffel.com by dublin.eiffel.com (4.1/SMI-4.1) id AA26830; Wed, 24 Feb 99 14:14:39 PST Received: by lannion.eiffel.com (SMI-8.6/SMI-SVR4) id OAA25987; Wed, 24 Feb 1999 14:14:13 -0800 Date: Wed, 24 Feb 1999 14:14:13 -0800 Message-Id: <199902242214.OAA25987 [at] lannion [dot] eiffel.com> From: "Karen Ouellette" To: reliable_computing [at] interval [dot] usl.edu Subject: TOOLS USA '99 - Last Call for Submissions Reply-To: karen [at] tools [dot] com Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk [apologies if you receive multiple copies of this announcement] ************************************************************** LAST CALL FOR SUBMISSIONS TOOLS USA '99 Technology of Object-Oriented Languages and Systems "DELIVERING QUALITY SOFTWARE" Santa Barbara, Calif., August 1-5, 1999 Fess Parker's Double Tree Resort http://www.tools.com/usa ************************************************************** Program Chair: Donald Firesmith, Storage Technology Corp., USA Tutorial Chair: Richard Riehle, AdaWorks, USA Workshop & Panel Chair: Gilda Pour, San Jose State University, USA Conference Chair: Bertrand Meyer, ISE, USA PROGRAM COMMITTEE Nadia Adhami, Countrywide, USA Vasu Alagar, Concordia University, Canada Jan Bosch, University of Karlskrona/Ronneby, Sweden Benjamin Brosgol, Aonix, USA Alistair Cockburn, Humans and Technology, USA Derek Coleman, Hewlett-Packard, USA Raimund K. Ege, Florida International University, USA Martin Griss, Hewlett-Packard Laboratories, USA Brian Henderson-Sellers, University of Sydney, Australia Laura Hill, Sun Microsystems, USA Eric Jul, University of Copenhagen, Denmark Stuart Kent, University of Brighton, UK Reto Kramer, Cambridge Technology Partners, Switzerland Qiaoyun Li, Sony Electronics Inc., USA Robert Marcus, General Motors, USA John McGregor, Software Architects, USA James C. McKim, Rensselaer at Hartford, USA Christine Mingins, Monash University, Australia Michael Philippsen, University of Karlsruhe, Germany Reinhold Ploesch, Johannes Kepler University, Austria Bran Selic, ObjecTime Limited, Canada Frank Tip, IBM T.J. Watson Research Center, USA Jeffrey Voas, RST Corporation, USA TECHNICAL PAPERS =================== TOOLS USA '99 is now soliciting papers on all aspects of object-oriented technology. All submitted papers will be refereed and judged by the International Program Committee, not only according to standards of technical quality but also on their usefulness to practitioners and applied researchers. TOOLS USA '99 will feature a special emphasis on issues relating to the challenges of ensuring the quality of delivered applications. Technical papers that report and assess advances and experiences in this area are expressly sought. A non-exhaustive list of topics includes: - Ensuring the quality of delivered applications throughout the life cycle - OO verification and testing techniques - Specification and modeling methods and techniques - Components, frameworks, and reuse - Distributed and intelligent objects and agents - Standardization of languages and methods - Management, migration, and training issues - Experience reports with OO technology In the first phase, an abstract of the paper must be submitted by electronic mail to tools-usa-abstracts [at] tools [dot] com no later than February 26, 1999. Subsequently, the full paper, in the range of 10 to 20 double-spaced pages (10,000 to 20,000 words), should be submitted electronically to tools-usa-submissions [at] tools [dot] com or in hard copy, to arrive no later than March 5, 1999. The proceedings of the 30th TOOLS Conference will be published by IEEE Computer Society Press. Final camera-ready versions of accepted papers will therefore be required to adhere to the IEEE publication format (guidelines available soon), and will contain no more than 10 pages. IMPORTANT DATES: Electronic abstract submission: February 26, 1999 Manuscript (electronic or hard-copy) submission: March 5, 1999 Notification of acceptance: April 12, 1999 Camera-ready papers due at IEEE: May 7, 1999 PROPOSALS SHOULD BE SUBMITTED TO: Donald Firesmith TOOLS USA '99 Program Chair Storage Technology Corporation 2270 South 88th Street Louisville, Colorado 80028-5210 USA Phone: +1-303-661-5943 Donald_Firesmith [at] stortek [dot] com (for contact only, see above for electronic submission addresses) TUTORIALS =========== TOOLS USA '99 now is soliciting proposals for high quality tutorials. Topics of high potential interest in the OO field, and not yet covered in other conferences, are particularly sought for presentation at TOOL USA '99. Tutorials should be innovative, with a strong practical content, or based on significant industrial developments, and be of interest to a significant part of the software community. Tutorials are normally one half-day (three and a half hours including one break). Tutorial presenters are entitled to submit an article of a related topic (up to 10 pages), for inclusion in the TOOLS 30 Conference Proceedings, published by the IEEE Computer Society (upon Chair's approval). Please note that you must prepare tutorial notes for the participants. IMPORTANT DATES: Tutorial submission deadline: February 26, 1999 Notification of acceptance: March 22, 1999 Camera-ready article: May 7, 1999 Camera-ready notes: June 25, 1999 PROPOSALS SHOULD BE SUBMITTED TO: Richard Riehle TOOLS USA '99 Tutorial Chair AdaWorks, USA tools-usa-tutorials [at] tools [dot] com WORKSHOPS ============ The purpose of a workshop is to provide a forum for researchers and practitioners to meet and discuss focused issues that defy the object technology field today, in an atmosphere that encourages interaction, brainstorming, exchange of ideas, and problem solving. A workshop should have a well-defined theme, and a clearly defined target audience. All topics related to object technology are potential candidates for workshops. Workshops addressing the theme of "Quality Software" will be given special consideration. Workshops can be half-day (3 hours) or full-day (6 hours) in length. Position papers will be included (upon Chair's approval) in the IEEE-published TOOLS Conference Proceedings. IMPORTANT DATES: Workshop submission deadline: February 26, 1999 Notification of acceptance: March 22, 1999 Camera-ready papers due at IEEE: May 7, 1999 PROPOSALS SHOULD BE SUBMITTED TO: Gilda Pour TOOLS USA '99 Workshop & Panel Chair San Jose State University, USA gpour [at] email [dot] sjsu.edu PANELS ======== The objective of a panel is to stimulate discussion about ideas and issues of importance and interest to the object technology community today. A panel session will usually last 90 minutes and can be organized in various formats. It should involve 4-5 panelists, presenting before the TOOLS audience, their various viewpoints on a certain issue, followed by a question and answer period. Position papers will be included (upon Chair's approval) in the IEEE-published TOOLS Conference Proceedings. IMPORTANT DATES: Panel submission deadline: March 5, 1999 Notification of acceptance: March 19, 1999 Camera-ready papers due at IEEE: May 7, 1999 PROPOSALS SHOULD BE SUBMITTED TO: Gilda Pour TOOLS USA '99 Workshop & Panel Chair San Jose State University, USA gpour [at] email [dot] sjsu.edu ** See the complete online submission guidelines at: http://www.tools.com/usa/submissions.html ** ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ FOR MORE INFORMATION ON TOOLS USA '99 OR ANY OTHER EVENTS IN THE TOOLS CONFERENCE SERIES, VISIT OUR WEB SITE AT http://www.tools.com OR CONTACT US AT tools [at] tools [dot] com ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ From owner-reliable_computing [at] interval [dot] usl.edu Thu Feb 25 18:15:33 1999 Received: by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id SAA02654 for reliable_computing-outgoing; Thu, 25 Feb 1999 18:15:33 -0600 (CST) Received: from cdam.me.washington.edu (cdam.me.washington.edu [128.95.34.158]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id SAA02649 for ; Thu, 25 Feb 1999 18:15:28 -0600 (CST) Received: from localhost (chang@localhost) by cdam.me.washington.edu (8.8.7/8.8.7) with ESMTP id RAA17631 for ; Thu, 25 Feb 1999 17:17:16 -0800 X-Authentication-Warning: cdam.me.washington.edu: chang owned process doing -bs Date: Thu, 25 Feb 1999 17:17:16 -0800 (PST) From: Jack Chang X-Sender: chang [at] cdam [dot] me.washington.edu To: "'reliable_computing'" Subject: general interval arithmetic reports by Kahan and Hanson Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Hi, I should be very grateful if somebody can give me a copy of two reports about general interval arithmetic. One is by Kahan: "A more complete interval arithmetic, lecture notes for a summer course at U of Michigan (1968)". The other one is by Hanson: "Interval arithmetic as a closed arithmetic system on a computer, Jet propulsion Laboratory report 197". I have tried to locate these two reports from JPL, U of Toronto, and U of Michigan but with no luck. I am very willing to pay for all the trouble you might have for giving me a copy of these two reports. Thank you very much for your help, Jack Chang MEB 117-1, ME Dept, U of Washington Seattle, WA 98195 (206)543-2657 From owner-reliable_computing [at] interval [dot] usl.edu Thu Feb 25 23:47:25 1999 Received: (from daemon@localhost) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id XAA03097 for reliable_computing-outgoing; Thu, 25 Feb 1999 23:47:25 -0600 (CST) Received: from mercury.Sun.COM (mercury.Sun.COM [192.9.25.1]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with SMTP id XAA03092 for ; Thu, 25 Feb 1999 23:47:23 -0600 (CST) From: bill.walster [at] Eng [dot] Sun.COM Received: from Eng.Sun.COM (engmail2 [129.146.1.25]) by mercury.Sun.COM (SMI-8.6/mail.byaddr) with SMTP id VAA06436; Thu, 25 Feb 1999 21:46:48 -0800 Received: from ha-sims.eng.sun.com (phys-thestorka.Eng.Sun.COM [129.146.1.231]) by Eng.Sun.COM (8.8.8+Sun/SMI-5.3) with ESMTP id VAA07553; Thu, 25 Feb 1999 21:46:45 -0800 (PST) Received: from ha-sims.eng.sun.com (westapp.EBay.Sun.COM) by ha-sims.eng.sun.com (Sun Internet Mail Server sims.3.5.1998.09.21.23.34) with ESMTP id <0F7Q00C3OYNRNG@ha-sims.eng.sun.com>; Thu, 25 Feb 1999 21:45:40 -0800 (PST) Date: Thu, 25 Feb 1999 22:00:22 -0800 Subject: Re: general interval arithmetic reports by Kahan and Hanson To: Jack Chang , "'reliable_computing'" Reply-to: bill.walster [at] Eng [dot] Sun.COM Message-id: <0F7Q00C3PYNVNG@ha-sims.eng.sun.com> MIME-version: 1.0 X-Mailer: Sun NetMail 2.2.5 Content-type: text/plain; charset="US-ASCII" Content-transfer-encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Jack, I have them both. Send me your fax numbe and I will fax them to you on next Monday. I will be out of the office till then. Regards, Bill "Jack Chang" wrote: Date: Thu, 25 Feb 1999 17:17:16 -0800 (PST) Hi, I should be very grateful if somebody can give me a copy of two reports about general interval arithmetic. One is by Kahan: "A more complete interval arithmetic, lecture notes for a summer course at U of Michigan (1968)". The other one is by Hanson: "Interval arithmetic as a closed arithmetic system on a computer, Jet propulsion Laboratory report 197". I have tried to locate these two reports from JPL, U of Toronto, and U of Michigan but with no luck. I am very willing to pay for all the trouble you might have for giving me a copy of these two reports. Thank you very much for your help, Jack Chang MEB 117-1, ME Dept, U of Washington Seattle, WA 98195 (206)543-2657 From owner-reliable_computing [at] interval [dot] usl.edu Fri Feb 26 23:19:29 1999 Received: by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id XAA04308 for reliable_computing-outgoing; Fri, 26 Feb 1999 23:19:29 -0600 (CST) Received: from tempest.ocis.temple.edu (root [at] tempest [dot] ocis.temple.edu [155.247.166.120]) by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id XAA04303 for ; Fri, 26 Feb 1999 23:19:27 -0600 (CST) Received: from unix.temple.edu (091064-2.dorm.temple.edu [155.247.154.52]) by tempest.ocis.temple.edu (8.8.8/8.8.8) with ESMTP id AAA21313; Sat, 27 Feb 1999 00:19:19 -0500 (EST) Message-ID: <36D77FD7.2E3362EE [at] unix [dot] temple.edu> Date: Sat, 27 Feb 1999 00:17:11 -0500 From: "Angel L. Pereira" Organization: Temple University X-Mailer: Mozilla 4.06 [en] (Win98; I) MIME-Version: 1.0 To: reliable_computing [at] interval [dot] usl.edu, Angel Pereira Subject: Javascript codes Content-Type: multipart/mixed; boundary="------------21AFCD04667189B0161E68F2" Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk This is a multi-part message in MIME format. --------------21AFCD04667189B0161E68F2 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Hi, I'm trying to create a javascript interval calculator abd I'm having problem comming with a Sin,Tan,Cos code that works with an input form. Can any body help me find or give me any ideas of how I can create or find a good code for this purpose. The main problem is that it won't let me use the functions more than once at the same time. Thank you. Angel L. Pereira apereira [at] unix [dot] temple.edu --------------21AFCD04667189B0161E68F2 Content-Type: text/x-vcard; charset=us-ascii; name="vcard.vcf" Content-Transfer-Encoding: 7bit Content-Description: Card for Angel Pereira Content-Disposition: attachment; filename="vcard.vcf" begin: vcard fn: Angel Pereira n: Pereira;Angel org: Temple University adr: 2029 N. broad St.;;1064 Hardwick Hall;Philadelphia;Pa;19122;US email;internet: apereira [at] unix [dot] temple.edu title: Student tel;home: (215) 204.4822 x-mozilla-cpt: ;0 x-mozilla-html: FALSE version: 2.1 end: vcard --------------21AFCD04667189B0161E68F2--