From owner-reliable_computing [at] interval [dot] louisiana.edu Mon Sep 3 06:14:18 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f83BEIx08126 for reliable_computing-outgoing; Mon, 3 Sep 2001 06:14:18 -0500 (CDT) Received: from sigma.ifpan.edu.pl (sigma.ifpan.edu.pl [148.81.44.1]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f83BE4508120 for ; Mon, 3 Sep 2001 06:14:13 -0500 (CDT) Received: from ifpan.edu.pl (gutow [at] gutow [dot] ifpan.edu.pl [148.81.45.16]) by sigma.ifpan.edu.pl (8.9.3/8.9.2) with ESMTP id NAA10421 for ; Mon, 3 Sep 2001 13:14:36 +0200 Message-ID: <3B936709.F2736551 [at] ifpan [dot] edu.pl> Date: Mon, 03 Sep 2001 13:18:33 +0200 From: "Marek W. Gutowski" Reply-To: gutow [at] ifpan [dot] edu.pl Organization: Institute of Physics, Polish Academy of Sciences X-Mailer: Mozilla 4.77 [en] (X11; U; Linux 2.2.16 i586) X-Accept-Language: pl, en MIME-Version: 1.0 To: reliable_computing [at] interval [dot] louisiana.edu Subject: Convergency of interval sequences Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear interval researchers, The usual definition of convergence of a sequence of intervals is lim [xl_k, xu_k] = [xl_0, xu_0] as k goes to infinity when both limits below exist in the usual (e.g. Cauchy) sense, i.e. xl_k --> xl_0 and xu_k --> xu_0 as k goes to infinity. If this is the case then, indeed, the convergence to thin interval is equivalent to: width([xl_l, xu_k]) --> 0. But, is it indeed a correct definition in IR ? What if I try to investigate the monotonicity of inclusion for a function 'f', say at the point x0, and I use the sequences xl_k = x0 + 2^{-k} xu_k = x0 + 2_{1-k} ?? Shouldn't the definition of convergence take into account the partial order generated by inverse inclusion existing in IR, as an additional requirement? What I mean is that the sequence should have the required property [xu_{k+1}, xl_{k+1}] \subset [xl_k, xu_k] for k > K which might be necessary for various proofs. Marek Gutowski -- ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Marek Gutowski | gutow [at] ifpan [dot] edu.pl Institute of Physics, ON-3.2 | ### ##### #### # # # Al. Lotnikow 32/46 | # # # # # # ## # (PL) 02-668 Warszawa, Poland | # ### #### ##### # ## tel. 8437001 ext. 3122 | ### # # # # # # *** To talk or not to talk? Yes, talk, plain ASCII please *** ---------------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] louisiana.edu Thu Sep 6 13:16:16 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f86IGFm00418 for reliable_computing-outgoing; Thu, 6 Sep 2001 13:16:15 -0500 (CDT) Received: from yonge.cs.toronto.edu (root [at] yonge [dot] cs.toronto.edu [128.100.1.8]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with SMTP id f86IG5M00412 for ; Thu, 6 Sep 2001 13:16:09 -0500 (CDT) Received: from jane.cs.toronto.edu ([128.100.2.31]) by yonge.cs.toronto.edu with SMTP id <15170-24475>; Thu, 6 Sep 2001 14:15:53 -0400 Received: from dvp.cs.toronto.edu by jane.cs.toronto.edu id <453139-10664>; Thu, 6 Sep 2001 14:15:39 -0400 From: Ken Jackson To: reliable_computing [at] interval [dot] louisiana.edu Subject: 2001-02 NA Year at the Fields Institute in Toronto Cc: krj [at] cs [dot] toronto.edu Message-Id: <01Sep6.141539edt.453139-10664 [at] jane [dot] cs.toronto.edu> Date: Thu, 6 Sep 2001 14:15:35 -0400 Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Thematic Year on Numerical and Computational Challenges in Science and Engineering At the Fields Institute August 2001 to August 2002 The Fields Institute in Toronto is sponsoring a Thematic Year on "Numerical and Computational Challenges in Science and Engineering" (NCCSE) from August 2001 to August 2002. The main point of this announcement is to inform the scientific computing committee about this event so that any people interested in participating can include it in their plans for 2001-02. More information about the Fields Institute in general and the NCCSE Thematic Year in particular can be found at http://www.fields.utoronto.ca and http://www.fields.utoronto.ca/numerical.html respectively. From owner-reliable_computing [at] interval [dot] louisiana.edu Mon Sep 10 21:52:18 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f8B2qId06762 for reliable_computing-outgoing; Mon, 10 Sep 2001 21:52:18 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f8B2qCd06757 for ; Mon, 10 Sep 2001 21:52:13 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id f8B2q8304479 for ; Mon, 10 Sep 2001 20:52:09 -0600 (MDT) Message-Id: <200109110252.f8B2q8304479 [at] cs [dot] utep.edu> Date: Mon, 10 Sep 2001 20:52:07 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: CFP: Imprecise and Indeterminate Probabilities in AI To: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: VC9l2R2QLJDX1VA7mLqp+g== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk ------------- Begin Forwarded Message ------------- Date: Fri, 7 Sep 2001 14:52:45 -0500 (CDT) X-Authentication-Warning: canopus.coginst.uwf.edu: teng set sender to cmteng [at] ai [dot] uwf.edu using -f From: cmteng [at] ai [dot] uwf.edu (Choh Man Teng) To: s-news [at] wubios [dot] wustl.edu, stat-l [at] vm1 [dot] mcgill.ca, ims_mail [at] archimedes [dot] math.uwm.edu, iasc [at] stat [dot] unipg.it, groupe_mas [at] paris [dot] polytechnique.fr, allstat [at] mailbase [dot] ac.uk, fuzzy-mail [at] dbai [dot] tuwien.ac.at, nsbayes [at] lists [dot] missouri.edu, interval [at] cs [dot] utep.edu, anzstat [at] qut [dot] edu.au, anzap-l [at] maths [dot] adelaide.edu.au Subject: CFP: Imprecise and Indeterminate Probabilities in AI ------------------------------------------------------------------------ Call for Papers Special Track on Imprecise and Indeterminate Probabilities in Artificial Intelligence FLAIRS 2002 The 15th International FLAIRS Conference Pensacola, Florida Crown Plaza Pensacola Grand Hotel May 16-18, 2002 In cooperation with AAAI ------------------------------------------------------------------------ Imprecise and indeterminate probabilities encompass the many mathematical models of uncertainty that cannot be given sharp numerical boundaries. This arises from information that is scare, vague, inconsistent, or incomplete. There is little reason to assume that we can always obtain exact point-valued probabilities, especially since we are modelling events that are inherently uncertain. Statements such as "the probability of a power outage is between 0.3 and 0.5" is more natural and realistic than their "exact" counterparts such as "the probability of a power outage is 0.39482." Research papers are solicited for the Special Track on Imprecise and Indeterminate Probabilities in Artificial Intelligence, as part of the FLAIRS-2002 conference. Topics of interest include, but are not limited to, * Modelling and representation of imprecise and indeterminate information, using for instance o Belief functions o Choquet capacities o Comparative probability orderings o Convex sets of probability measures o Bayes' nets with imprecise probabilities o Interval-valued probabilities o Upper and lower expectations or previsions * Inference and decision making using imprecise and indeterminate probabilities * Comparative analyses and integration of approaches * Extending standard techniques for imprecise and indeterminate information Paper Submission and Publication --------------------------------- Full papers of a maximum of 5 pages (AAAI style) will be reviewed. Formatting guidelines can be found at http://www.aaai.org/Publications/Author/authorinstructions.html Electronic submission (postscript or PDF files preferred) should be sent to Choh Man Teng at cmteng [at] ai [dot] uwf.edu. Please also include in a plain text message the following information: title, author(s), abstract, and a list of keywords. If electronic submission is not possible, hardcopies can be snail mailed to Choh Man Teng Institute for Human and Machine Cognition University of West Florida 40 South Alcaniz Street Pensacola FL 32501 USA The deadline for submission is October 28, 2001. Accepted papers will appear as regular papers in the FLAIRS-2002 conference proceedings published by AAAI Press. Selected papers will be considered for publication in a special issue of the International Journal of Pattern Recognition and Artificial Intelligence. Important Dates ---------------- Papers due: October 28, 2001 Notification of acceptance: January 3, 2002 Camera ready copies due: March 4, 2002 Conference: May 16-18, 2002 Organizing Committee --------------------- Fabio Cozman (University of Sao Paulo, Brazil) Gert de Cooman (Ghent University, Belgium) Henry Kyburg, Jr. (University of Rochester, USA) Isaac Levi (Columbia University, USA) Serafin Moral (University of Granada, Spain) Eric Neufeld (University of Saskatchewan, Canada) Choh Man Teng (University of West Florida, USA) For Further Information ------------------------ Conference web site: http://www.flairs.com Imprecise and indeterminate probabilities special track web site: http://www.coginst.uwf.edu/users/cmteng/flairs_iip.html ------------- End Forwarded Message ------------- From owner-reliable_computing [at] interval [dot] louisiana.edu Wed Sep 12 08:41:53 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f8CDfqL10582 for reliable_computing-outgoing; Wed, 12 Sep 2001 08:41:53 -0500 (CDT) Received: from imf02bis.bellsouth.net (mail102.mail.bellsouth.net [205.152.58.42]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f8CDfgd10577 for ; Wed, 12 Sep 2001 08:41:43 -0500 (CDT) Received: from u8174 ([65.81.240.160]) by imf02bis.bellsouth.net (InterMail vM.5.01.01.01 201-252-104) with SMTP id <20010912134229.YDOU14020.imf02bis.bellsouth.net@u8174> for ; Wed, 12 Sep 2001 09:42:29 -0400 Message-Id: <2.2.32.20010912133723.036ae70c [at] 130 [dot] 70.132.231> X-Sender: rbk5287 [at] 130 [dot] 70.132.231 X-Mailer: Windows Eudora Pro Version 2.2 (32) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Wed, 12 Sep 2001 08:37:23 -0500 To: reliable_computing [at] interval [dot] louisiana.edu From: "R. Baker Kearfott" Subject: Call for papers: SIAM Workshop on Validated Computing Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Validated Computing 2002 SIAM Workshop Toronto, Canada, May 23-25, 2002 (including a special session honoring Ray Moore) Immediately following the Seventh SIAM Conference on Optimization (May 20-23, 2002) (see http://www.siam.org/meetings/op02/index.htm) To be followed by a Fields Institute working group on optimization Call for Papers --------------- We invite submission of papers dealing with validated computing. Areas of interest include, but are not limited to, interval arithmetic and analysis, use of mathematical theory to assure reliable scientific computation, and fuzzy logic. We are especially interested in applications of these techniques and in tools that support the techniques. Submit an extended abstract of 2-3 pages to R. Baker Kearfott at rbk [at] louisiana [dot] edu by October 5. Submissions must be in Latex using ONLY the standard article style. Use psfig.sty if you include figures. The Program Committee will review the submissions contributed. Most papers will be presented as 30 minute talks. Depending on the number of submissions, 8-12 talks will be selected for 40 minute highlighted talks. A few talks may be selected for other special sessions. We invite proposals for minisymposia of 4-5 speakers coordinated to focus on a particular topic. Minisymposia proposals should include the extended abstracts of each speaker AND a one paragraph abstract for the session. Submit minisymposia proposals to R. Baker Kearfott at rbk [at] louisiana [dot] edu by October 5.Minisymposia will have the same visibility and length of talks as the contributed paper sessions. The Program Committee will attempt to arrange contributed papers into coherent sessions. The advantage of a minisymposium is that the minisymposium organizer and speakers are encouraged to communicate and coordinate their presentations to increase impact, use a common notation, and reduce duplications. Deadlines --------- October 5 Minisymposia proposals including extended abstracts of each speaker AND a one paragraph abstract for the session. October 5 Extended 2-3 page abstracts to be considered for highlighted talks October 30 Notification of accepted talks January 15 Extended 2-3 page abstracts for LATE submissions, which will be considered only as contributed talks February 15 Notification of accepted talks March 1 (tentative) End of early registration April 1 (tentative) Hotel reservations May 23-25 Workshop itself Speakers who have already accepted invitations ---------------------------------------------- Annie Cuyt William Edmonson Andreas Griewank Eldon Hansen Kaj Madsen Arnold Neumaier Linda Petzold Louis Rall Mark Stadtherr Special informal week --------------------- Participants in the workshop are invited to participate in a week of informal discussions at the Fields Institute at the University of Toronto, immediately following the workshop. This week is part of the Fields Institute's special thematic year on computational challenges in science and engineering. Depending on numbers, the Fields Institute can provide office space and meeting areas for this activity. For general information on the Fields Institute and the thematic year, see http://www.fields.utoronto.ca/programs/scientific/01-02/numerical/) Persons interested in this week at the Fields Institute should contact R. Baker Kearfott (rbk [at] louisiana [dot] edu) or or Tibor Csendes (csendes [at] inf [dot] u-szeged.hu) before October 5, 2001. You may express your interest when you submit your abstract. Web page: -------- A web-page with further information is forthcoming. Please expect its URL in an announcement to follow soon. Description and rationale ------------------------- Reliable computing is essential. There is no feasible alternative. Modern societies rely more and more on computer systems. Usually, our systems appear to work successfully, but there are sometimes serious, and often minor, errors. Ever increasing reliance on computer systems brings ever increasing need for reliability. Validated computing is one essential technology to achieve increased software reliability. Validated computing uses controlled rounding of computer arithmetic to guarantee that hypotheses of suitable mathematical theorems are (or are not) satisfied. Mathematical rigor in the computer arithmetic, in algorithm design, and in program execution allow us to guarantee that the stated problem has (or does not have) a solution in an enclosing interval we compute. If the enclosure is narrow, we are certain that we know the answer reliably and accurately. If the enclosing interval is wide, we have a clear warning that our uncertainty is large, and a closer study is demanded. Intervals capture uncertainly in modeling and problem formulation, in model parameter estimation, in algorithm truncation, in operation round off, and in model interpretation. The techniques of validated computing have proven their merits in many scientific and engineering applications. They help answer questions from, "How much irrigation water does a desert golf course return effectively unused to its bordering stream?" to "Will a near earth asteroid hit the earth, possibly ending life as we know it?". The techniques of validated computing rest on solid and interesting theoretical studies in mathematics and computer science. Contributions from fields including real, complex and functional analysis, semigroups, probability, statistics, fuzzy logic, automatic differentiation, computer hardware, operating systems, compiler construction, parallel processing, and software engineering are all essential. The major emphasis of the program is on applications. We will hear from many people who have used tools from validated computing to attack, and often solve, significant practical problems. Successful applications have included medical diagnosis and treatment, financial simulation, mechanical design, oil reservoir simulation, aeronautics, high energy particle accelerators, environmental engineering, chemical process simulation and control, computer graphics for motion picture special effects, astrophysics, and many more. Not all applications are as yet successful. We will also hear from people with challenging applications to which validated techniques have not yet been successfully applied. Hopefully, by encouraging experts in such applications to lay out their problems, we will foster long-term collaborations leading to significant advances in those fields. The workshop follows the SIAM Optimization meeting because global optimization is a major concern of both the optimization and the validated computing communities. By holding the meetings consecutively, we encourage validated computing researchers to become more involved in the wider optimization community, and we encourage people more interested in standard techniques of optimization to participate in interval discussions. We will have one special session and a conference banquet to honor Ray Moore. His 1966 book defined the field, he pioneered many applications, and he continues to contribute insights and papers. Most of the ideas in our interval algorithms of today directly trace their ancestry to Ray's 1966 and 1979 (from SIAM) books. In parallel with the traditional scientific program following SIAM's usual pattern of highlighted and contributed papers, we are considering half-day detailed workshops. Tentative topics include: 1. Jiri Rohn on complexity. This would follow up on his talk at SCAN 2000 in Karlsruhe "Finite Characterization of Some Linear Problems with Inexact Data." 2. Tutorial on validated techniques, interval arithmetic, and related tools. We would start at the beginning by defining directed rounding, and progress to a "Numerical Recipes" level view of several widely used algorithms, e.g., linear systems, interval Newton, global optimization, ordinary and partial differential equations. 3. Hands-on tools and demonstrations. Program Committee ----------------- R. Baker Kearfott University of Louisiana at Lafayette rbk [at] louisiana [dot] edu Vladik Kreinovich University of Texas at El Paso vladik [at] cs [dot] utep.edu George Corliss Marquette University George.Corliss [at] Marquette [dot] edu Weldon Lodwick University of Colorado at Denver wlodwick [at] carbon [dot] cudenver.edu Ken Jackson University of Toronto krj [at] cs [dot] toronto.edu Bill Walster Sun Microsystems Bill.Walster [at] eng [dot] sun.com --------------------------------------------------------------- R. Baker Kearfott, rbk [at] louisiana [dot] edu (337) 482-5346 (fax) (337) 482-5270 (work) (337) 981-9744 (home) URL: http://interval.louisiana.edu/kearfott.html Department of Mathematics, University of Louisiana at Lafayette Box 4-1010, Lafayette, LA 70504-1010, USA --------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] louisiana.edu Wed Sep 12 21:51:08 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f8D2p7W11953 for reliable_computing-outgoing; Wed, 12 Sep 2001 21:51:07 -0500 (CDT) Received: from imf01bis.bellsouth.net (mail301.mail.bellsouth.net [205.152.58.161]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f8D2p3d11948 for ; Wed, 12 Sep 2001 21:51:03 -0500 (CDT) Received: from u8174 ([65.81.240.160]) by imf01bis.bellsouth.net (InterMail vM.5.01.01.01 201-252-104) with SMTP id <20010913025153.GYYY18195.imf01bis.bellsouth.net@u8174> for ; Wed, 12 Sep 2001 22:51:53 -0400 Message-Id: <2.2.32.20010913024338.0076b52c [at] 130 [dot] 70.132.231> X-Sender: rbk5287 [at] 130 [dot] 70.132.231 X-Mailer: Windows Eudora Pro Version 2.2 (32) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Wed, 12 Sep 2001 21:43:38 -0500 To: reliable_computing [at] interval [dot] louisiana.edu From: "R. Baker Kearfott" Subject: Validated Computing 2002 -- Call for Papers Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Validated Computing 2002 SIAM Workshop Toronto, Canada, May 23-25, 2002 (including a special session honoring Ray Moore) Immediately following the Seventh SIAM Conference on Optimization (May 20-23, 2002) (see http://www.siam.org/meetings/op02/index.htm) To be followed by a Fields Institute working group on optimization Call for Papers --------------- We invite submission of papers dealing with validated computing. Areas of interest include, but are not limited to, interval arithmetic and analysis, use of mathematical theory to assure reliable scientific computation, and fuzzy logic. We are especially interested in applications of these techniques and in tools that support the techniques. Submit an extended abstract of 2-3 pages to R. Baker Kearfott at rbk [at] louisiana [dot] edu by October 5. Submissions must be in Latex using ONLY the standard article style. Use psfig.sty if you include figures. The Program Committee will review the submissions contributed. Most papers will be presented as 30 minute talks. Depending on the number of submissions, 8-12 talks will be selected for 40 minute highlighted talks. A few talks may be selected for other special sessions. We invite proposals for minisymposia of 4-5 speakers coordinated to focus on a particular topic. Minisymposia proposals should include the extended abstracts of each speaker AND a one paragraph abstract for the session. Submit minisymposia proposals to R. Baker Kearfott at rbk [at] louisiana [dot] edu by October 5.Minisymposia will have the same visibility and length of talks as the contributed paper sessions. The Program Committee will attempt to arrange contributed papers into coherent sessions. The advantage of a minisymposium is that the minisymposium organizer and speakers are encouraged to communicate and coordinate their presentations to increase impact, use a common notation, and reduce duplications. Deadlines --------- October 5 Minisymposia proposals including extended abstracts of each speaker AND a one paragraph abstract for the session. October 5 Extended 2-3 page abstracts to be considered for highlighted talks October 30 Notification of accepted talks January 15 Extended 2-3 page abstracts for LATE submissions, which will be considered only as contributed talks February 15 Notification of accepted talks March 1 (tentative) End of early registration April 1 (tentative) Hotel reservations May 23-25 Workshop itself Speakers who have already accepted invitations ---------------------------------------------- Annie Cuyt William Edmonson Andreas Griewank Eldon Hansen Kaj Madsen Arnold Neumaier Linda Petzold Louis Rall Mark Stadtherr Special informal week --------------------- Participants in the workshop are invited to participate in a week of informal discussions at the Fields Institute at the University of Toronto, immediately following the workshop. This week is part of the Fields Institute's special thematic year on computational challenges in science and engineering. Depending on numbers, the Fields Institute can provide office space and meeting areas for this activity. For general information on the Fields Institute and the thematic year, see http://www.fields.utoronto.ca/programs/scientific/01-02/numerical/) Persons interested in this week at the Fields Institute should contact R. Baker Kearfott (rbk [at] louisiana [dot] edu) or or Tibor Csendes (csendes [at] inf [dot] u-szeged.hu) before October 5, 2001. You may express your interest when you submit your abstract. Web page: -------- A web-page with this and other information is available at http://interval.louisiana.edu/conferences/Validated_computing_2002/html_notice.html. Description and rationale ------------------------- Reliable computing is essential. There is no feasible alternative. Modern societies rely more and more on computer systems. Usually, our systems appear to work successfully, but there are sometimes serious, and often minor, errors. Ever increasing reliance on computer systems brings ever increasing need for reliability. Validated computing is one essential technology to achieve increased software reliability. Validated computing uses controlled rounding of computer arithmetic to guarantee that hypotheses of suitable mathematical theorems are (or are not) satisfied. Mathematical rigor in the computer arithmetic, in algorithm design, and in program execution allow us to guarantee that the stated problem has (or does not have) a solution in an enclosing interval we compute. If the enclosure is narrow, we are certain that we know the answer reliably and accurately. If the enclosing interval is wide, we have a clear warning that our uncertainty is large, and a closer study is demanded. Intervals capture uncertainly in modeling and problem formulation, in model parameter estimation, in algorithm truncation, in operation round off, and in model interpretation. The techniques of validated computing have proven their merits in many scientific and engineering applications. They help answer questions from, "How much irrigation water does a desert golf course return effectively unused to its bordering stream?" to "Will a near earth asteroid hit the earth, possibly ending life as we know it?". The techniques of validated computing rest on solid and interesting theoretical studies in mathematics and computer science. Contributions from fields including real, complex and functional analysis, semigroups, probability, statistics, fuzzy logic, automatic differentiation, computer hardware, operating systems, compiler construction, parallel processing, and software engineering are all essential. The major emphasis of the program is on applications. We will hear from many people who have used tools from validated computing to attack, and often solve, significant practical problems. Successful applications have included medical diagnosis and treatment, financial simulation, mechanical design, oil reservoir simulation, aeronautics, high energy particle accelerators, environmental engineering, chemical process simulation and control, computer graphics for motion picture special effects, astrophysics, and many more. Not all applications are as yet successful. We will also hear from people with challenging applications to which validated techniques have not yet been successfully applied. Hopefully, by encouraging experts in such applications to lay out their problems, we will foster long-term collaborations leading to significant advances in those fields. The workshop follows the SIAM Optimization meeting because global optimization is a major concern of both the optimization and the validated computing communities. By holding the meetings consecutively, we encourage validated computing researchers to become more involved in the wider optimization community, and we encourage people more interested in standard techniques of optimization to participate in interval discussions. We will have one special session and a conference banquet to honor Ray Moore. His 1966 book defined the field, he pioneered many applications, and he continues to contribute insights and papers. Most of the ideas in our interval algorithms of today directly trace their ancestry to Ray's 1966 and 1979 (from SIAM) books. In parallel with the traditional scientific program following SIAM's usual pattern of highlighted and contributed papers, we are considering half-day detailed workshops. Tentative topics include: 1. Jiri Rohn on complexity. This would follow up on his talk at SCAN 2000 in Karlsruhe "Finite Characterization of Some Linear Problems with Inexact Data." 2. Tutorial on validated techniques, interval arithmetic, and related tools. We would start at the beginning by defining directed rounding, and progress to a "Numerical Recipes" level view of several widely used algorithms, e.g., linear systems, interval Newton, global optimization, ordinary and partial differential equations. 3. Hands-on tools and demonstrations. Program Committee ----------------- R. Baker Kearfott University of Louisiana at Lafayette rbk [at] louisiana [dot] edu Vladik Kreinovich University of Texas at El Paso vladik [at] cs [dot] utep.edu George Corliss Marquette University George.Corliss [at] Marquette [dot] edu Weldon Lodwick University of Colorado at Denver wlodwick [at] carbon [dot] cudenver.edu Ken Jackson University of Toronto krj [at] cs [dot] toronto.edu Bill Walster Sun Microsystems Bill.Walster [at] eng [dot] sun.com --------------------------------------------------------------- R. Baker Kearfott, rbk [at] louisiana [dot] edu (337) 482-5346 (fax) (337) 482-5270 (work) (337) 981-9744 (home) URL: http://interval.louisiana.edu/kearfott.html Department of Mathematics, University of Louisiana at Lafayette Box 4-1010, Lafayette, LA 70504-1010, USA --------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] louisiana.edu Thu Sep 20 10:11:00 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f8KFB0806799 for reliable_computing-outgoing; Thu, 20 Sep 2001 10:11:00 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f8KFAot06794 for ; Thu, 20 Sep 2001 10:10:53 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id f8KFAet21881; Thu, 20 Sep 2001 09:10:41 -0600 (MDT) Message-Id: <200109201510.f8KFAet21881 [at] cs [dot] utep.edu> Date: Thu, 20 Sep 2001 09:10:40 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: interval graduate course in Belgium in November 2001 To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu Cc: eric.walter [at] lss [dot] supelec.fr, luc.jaulin@univ-angers.fr, kieffer [at] lss [dot] supelec.fr MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: wVp+ugNXbbgRbsJPmCMszg== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear Friends, In November, Luc Jaulin, Michel Kieffer and Eric Walter, the authors of the recent book on Applied Interval Analysis, will teach a graduate course "Interval Analysis for Identification, State Estimation and Robust Control" (in English) based on this book. This course will be taught at a graduate school in systems and control in Belgium. Prof. P. Van Dooren, the director of the programme committee has made it clear that the graduate school is open to foreigners. Detailed information about this course and others organized by the school can be found at http://www.auto.ucl.ac.be/AUTO/graduate.html together with the application form. The link to this course has been added to the Courses part of the interval computations webpage http://www.cs.utep.edu/interval-comp From owner-reliable_computing [at] interval [dot] louisiana.edu Thu Sep 20 14:58:43 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f8KJwhp07309 for reliable_computing-outgoing; Thu, 20 Sep 2001 14:58:43 -0500 (CDT) Received: from bologna.vision.caltech.edu (bologna.vision.caltech.edu [131.215.134.19]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f8KJwVt07304 for ; Thu, 20 Sep 2001 14:58:32 -0500 (CDT) Received: from peking.vision.caltech.edu (peking [131.215.134.18]) by bologna.vision.caltech.edu (8.9.3/8.8.7) with ESMTP id MAA30789 for ; Thu, 20 Sep 2001 12:58:27 -0700 Received: (from arrigo@localhost) by peking.vision.caltech.edu (8.9.3+Sun/8.9.1) id MAA06790; Thu, 20 Sep 2001 12:58:21 -0700 (PDT) X-Authentication-Warning: peking.vision.caltech.edu: arrigo set sender to arrigo [at] vision [dot] caltech.edu using -f From: Arrigo Benedetti MIME-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Message-ID: <15274.19036.611087.852481 [at] gargle [dot] gargle.HOWL> Date: Thu, 20 Sep 2001 12:58:20 -0700 To: reliable_computing [at] interval [dot] louisiana.edu Subject: Interval Jacobi method X-Mailer: VM 6.92 under Emacs 20.4.1 Reply-To: arrigo [at] bologna [dot] vision.caltech.edu Content-Transfer-Encoding: 8bit X-MIME-Autoconverted: from quoted-printable to 8bit by interval.louisiana.edu id f8KJwet07305 Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear all, I have been looking for some time for algorithms able to find bounds for the eigenvalues of simmetric interval matrices. All the algorithms that I have found in the literature, however, either assume a constant sign pattern for the components of the eigenvectors or yield a single interval containing all the eigenvalues. What I am looking for instead is an algorithm producing distinct (and possibly overlapping) intervals for each eigenvalue. It seems that some work by D. Simic (references and abtracts are below) is a step in this direction. I have not been able to read these papers since they could not make it in the conference proceedings for some reason, however the author is kindly sending me copies. From the abstract it seems that the idea is to apply the well known 2x2 Jacobi othogonal rotations, i.e. Q^T A Q, which seek to annihilate off-diagonal terms. So my question is: is there any literature on this type of interval Jacobi methods? Once A is reduced to an "almost diagonal" form, the intervals bounding its eigenvalues can be found applying Gershgorin's theorem (Matrix computations, 3rd ed., pag. 395). Any comments? Thanks, -Arrigo Title: Interval Jacobi algorithm for symmetric eigenvalue problems Authors: SIMIC, DIANA (125756) Proceedings title: The Third International Congress on Industrial and Applied Mathematics Language: engleski Place: Hamburg, Njemačka Year: 1995 Pages: from 442 to 442 Meeting: The Third International Congress on Industrial and Applied Mathematics Held: from 07/03/95 to 07/07/95 Summary: Recent results on interval eigenvalue problem are applied to twodimensional interval symmetric matrices. This analysis has served as a basis for the construction of interval Jacobi method. The method does not converge always, but it always provides intervals containing the eigenvalues. Interval Jacobi method can be applied to both, interval symmetric and real symmetric matrices. In the latter case the final intervals result from the process of accommodating the impacts of rounding errors. The intervals obtained by numerical tests on real matrices comply with the theoretical error bounds, and the method never diverged. On interval matrices the method converges on smaller matrices even if lower and upper bounds of their elements agree in only 2--3 most significant digits. Keywords: symmetric eigenvalue problem, interval methods, Jacobi On twodimensional symmetric interval eigenvalue problem Authors: Simic, Diana Proceedings title: IMACS-GAMM International Symposium on Numerical Methods and Error-Bounds Language: engleski Place: Oldenburg, Germany Year: 1995 Pages: from 31 to 31 Meeting: International Symposium on Numerical Methods and Error-Bounds Held: from 07/09/95 to 07/12/95 Summary: Recent Delf's results on symmetric interval eigenvalue problem are applied to twodimensional interval symmetric matrices. For symmetric interval matrices of higher dimension the results apply only to eigenvalues belonging to eigenvectors with sign pattern constant over the interval matrix. Bounds on the width of the interval matrix sufficient for the invariance of eigenvector sign pattern are hard to verify. Constraining the symmetric interval matrices to subsets of symmetric point matrices is natural for many applications. When twodimensional symmetric interval matrix is constrained to is subset containing only symmetric point matrices, it is possible to characterize the sets of its eigenvalues and eigenvectors without bounding its width. These characteriyations are a basis for the construction of interval Jacobi method. -- Dr. Arrigo Benedetti e-mail: arrigo [at] vision [dot] caltech.edu Caltech, MS 136-93 phone: (626) 395-3129 Pasadena, CA 91125 fax: (626) 795-8649 From owner-reliable_computing [at] interval [dot] louisiana.edu Sun Sep 23 13:08:06 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f8NI86Y03454 for reliable_computing-outgoing; Sun, 23 Sep 2001 13:08:06 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f8NI7ui03449 for ; Sun, 23 Sep 2001 13:07:57 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id f8NI7rm10114; Sun, 23 Sep 2001 12:07:53 -0600 (MDT) Message-Id: <200109231807.f8NI7rm10114 [at] cs [dot] utep.edu> Date: Sun, 23 Sep 2001 12:07:53 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: Informal Working Group on Validated Methods for Optimization: from the webpage To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: Ns+Migwa03LZkbZNuPSnAA== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk http://www.fields.utoronto.ca/programs/scientific/01-02/numerical/optimization/ Informal Working Group on Validated Methods for Optimization May 26 to June 1, 2002, Toronto, Canada immediately following Validated Computing 2002 (a SIAM Workshop) - May 23 to May 25, 2002 in conjunction with the SIAM Conference on Optimization - May 20 to May 22, 2002 Organizers: George Corliss (Marquette University), Tibor Csendes (University of Szeged), Ken Jackson (University of Toronto), and R. Baker Kearfott (University of Louisiana at Lafayette) First Announcement We are organizing an informal working group on "Validated Optimization" as part of the Fields Institute Thematic Year on Computational Challenges in Science and Engineering. This meeting will allow researchers in the area to generate and exchange ideas to impact current research in the area, and to identify research priorities. We also hope to foster interaction and cross-fertilization between validated optimization experts and experts in "standard" optimization techniques. This will be primarily an informal, colleague-to-colleague meeting following the SIAM Optimization and Validated Computing 2002 programs, although we will be happy to schedule formal talks, as appropriate. The Fields Institute can provide office space and meeting rooms for these purposes. The meeting will be held in Toronto under the auspices of the Fields Institute Thematic Year on Computational Challenges in Science and Engineering. As an informal meeting, there will be no registration fee. Note also that the Fields Institute will not be able to offer financial assistance to participants. If you would like to participate please e-mail Tibor Csendes at csendes [at] inf [dot] u-szeged.hu or R. Baker Kearfott at rbk [at] louisiana [dot] edu Hotels and Housing We intend to finalize specific arrangements soon. One option is inexpensive dormitory rooms at the University of Toronto. For additional accommodation resources, please see the Fields Housing page (linked from the main page) for a listing of local hotels and inexpensive on-campus summer accommodation. For more details on the thematic year, see the Program Page http://www.fields.utoronto.ca/programs/scientific/01-02/numerical/ or contact numerical [at] fields [dot] utoronto.ca From owner-reliable_computing [at] interval [dot] louisiana.edu Sun Sep 23 13:32:53 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f8NIWqm03583 for reliable_computing-outgoing; Sun, 23 Sep 2001 13:32:52 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f8NIWhi03578 for ; Sun, 23 Sep 2001 13:32:43 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id f8NIWb910207; Sun, 23 Sep 2001 12:32:37 -0600 (MDT) Message-Id: <200109231832.f8NIWb910207 [at] cs [dot] utep.edu> Date: Sun, 23 Sep 2001 12:32:36 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: SIAM Conference on Optimization (right before our 2002 meeting) To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: qqInahShscMub0ExcAIL2w== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear Friends, Deadline for abstracts is November 1, deadline for minisymposia is October 1, very soon. Since many of us will be coming to the interval meeting right after it, we may organize some minis. If you are interested in organizing a mini this must be done ASAP. In particular, maybe Dan Berleant (if he is planning to be at SIAM Optimization too) can take a lead on intervals and probability mini? This is clearly an underrepresented area. Vladik ************************************************************************ From: http://www.siam.org/meetings/op02/index.htm SIAM Conference on Optimization, May 20-22, 2002, Westin Harbour Castle Hotel, Toronto, CA Sponsored by SIAM Activity Group on Optimization The field of optimization involves a powerful combination of theoretical analysis, algorithm and software development and scientific computing. The practical scope and utility of optimization continues to grow. The Seventh SIAM Conference on Optimization will address the most important recent advances in linear, nonlinear, and discrete optimization. The meeting will feature the latest research in algorithms and software for the solution of optimization problems. It will also feature important applications of optimization in control, networks, manufacturing, medicine, finance, aeronautical engineering, operations research, and other areas of science and engineering. The conference will bring together mathematicians, operations researchers, computer scientists, engineers, and software developers. The gathering will provide an excellent opportunity for sharing ideas and problems among specialists and users of optimization in academia, government, and industry. Short Courses Immediately preceding the conference, on Sunday May 19, 2002, there will be two concurrent short courses: + Numerical Optimization - Algorithms and Software Organizer: Robert Vanderbei, Princeton University Co-Instructors: Robert Vanderbei, Princeton University; David F. Shanno, Rutgers University; and Hande Y. Benson, Princeton University + Automatic Differentiation Organizer: Andreas Griewank, The Institute of Scientific Computing (IWR) Co-Instructors: Andreas Griewank, The Institute of Scientific Computing (IWR); Uwe Naumann, INRIA; and Andrea Walther, Technical University Dresden Conference Themes The themes of the conference include, but are not limited to: + Computational Science + Engineering Design + Enterprise Optimization + Derivative Free Methods + Automatic Differentiation + Semidefinite Programming + Combinatorial Optimization + Stochastic Optimization Organizers Thomas Coleman (Co-chair),Cornell University Ariela Sofer (Co-chair), George Mason University Masakazu Kojima, Tokyo Institute of Technology Trond Steihaug, University of Bergen Virginia Torczon, College of William and Mary David P. Williamson, IBM Almaden Research Center Henry Wolkowicz, University of Waterloo Get-Togethers Sunday, May 19 Don Goldfarb Day 5:15 PM-7:00 PM Technical Sessions 7:30 PM Banquet Chairs: Sanjay Mehrotra and Jorge Nocedal, Northwestern University Friends and colleagues of Professor Don Goldfarb are organizing a special one-day celebration, honoring his 60th birthday. The celebration will be held on Sunday, May 19, 2002, immediately preceeding the SIAM Conference on Optimization and will consist of 2 hours of technical presentations by former students and collaborators of Professor Goldfarb, followed by an evening banquet. All SIAM conference attendees are welcome to attend the technical sessions at no additional charge. All attendees, and their spouses or guests, are welcome to attend the banquet, but there will be a fee to cover costs. During the banquet, there will be an opportunity for toasts, tributes, and anecdotes. The organizers hope many conference attendees will join in this tribute to one of the leaders in the field of optimization. The organizers for this event are: Sanjay Mehrotra, Northwestern University Jorge Nocedal, Northwestern University Michael Overton, New York University Katya Scheinberg, IBM Registration information for the evening banquet on Sunday, May 19, will be forthcoming. SIAM Get-Togethers Monday, May 20 Welcoming Reception and Poster Session 7:15 PM- 9:00 PM Tuesday, May 21 SIAG/OPT Business Meeting 7:00 PM- 7:45 PM Invited Plenary Speakers SIAM and the Conference Organizing Committee are proud to announce that the following mathematicians and scientists have accepted their invitations to speak at the conference. Chris Bishof, Technical University of Aachen, Germany Ron Dembo, Algorithmics, Toronto, Canada Toshihide Ibaraki, Kyoto University, Japan Tim Kelley, North Carolina State University Anna Nagurney, University of Massachusetts John Straub, Boston University Eva Tardos, Cornell University Steve Wright, Argonne National Laboratory Invited Minisymposia A minisymposium is a two-hour session consisting of four presentations on a well-focused topic consistent with the conference themes. Minisymposium organizers are being invited by the Organizing Committee. A list of Minisymopsia Organizers is forthcoming at this location. Deadlines to Remember: Submit a Paper! Minisymposium Proposal October 1, 2001 Minisymposium paper abstracts and November 1, 2001 Contributed abstracts in lecture or poster format Audiovisual Requirement deadline April 19, 2002 URGENT! Please review the AV notice found at: http://www.siam.org/meetings/resources/avnotice.htm How to Participate You are invited to contribute a presentation for this conference in one of the following formats. Minisymposia A minisymposium consists of four 25-minute presentations, with an additional five minutes for discussion after each presentation. Prospective minisymposium organizers are asked to submit a proposal consisting of a title, a description (not to exceed 100 words), and a list of speakers and titles of their presentations using the Conference Management System available at: http://www.siam.org/meetings/op02/part.htm A minisymposium organizer may also be a speaker in his/her minisymposium, usually the first presenter to give an expository talk. It is recommended that the minisymposium organizer make the first talk as tutorial as possible. Each minisymposium speaker should submit a 75-word abstract. Contributed minisymposia will be refereed by the Organizing Committee. The number of minisymposia may be limited to retain an acceptable level of parallelism in the conference session. For further useful minisymposium organizer and participant information, please visit: http://www.siam.org/meetings/resources/miniguid.htm Deadline for submission of minisymposium proposals and minisymposium speakers' abstracts: October 1, 2001 Contributed Presentations in Lecture or Poster Format Contributed presentations in lecture or poster format are invited in all areas of optimization consistent with the conference themes. A lecture format involves a 15-minute oral presentation with an additional 5 minutes for discussion. A poster format involves the use of visual aids such as 8-1/2" x 11" sheets for mounting on a 4' x 6' poster board. A poster session is two hours long. Each contributor, either for a lecture or poster format, must submit a title and a brief abstract not to exceed 75 words. Please submit contributed presentations in lecture or poster format using the Conference Management System available at: http://www.siam.org/meetings/op02/part.htm Deadline for submission of contributed abstracts: November 1, 2001. Registration The meeting program and registration information will be available at this location by mid-January 2002. Exhibits Publishers, software and hardware suppliers, and service organizations, having products to offer to conference participants and attendees, are invited to participate in the exhibition. For additional information and exhibit fees, contact the SIAM Marketing Representative at marketing [at] siam [dot] org. Related Events Thematic Year Optimization Visitors to the Fields Institute There will be a group of visitors (in optimization) before/during/after the upcoming Seventh SIAM Conference on Optimization. The group will be visiting the Fields Institute. Toronto, Ontario. This is part of the Thematic Year on "Numerical and Computational Challenges in Science and Engineering" (NCCSE) from August 2001 to July 2002. General Information Information on SIAM publications, conferences, activity groups, and programs can be accessed from SIAM's Web site at www.siam.org. Information on SIAM membership can be accessed at www.siam.org/about/member.htm. Important Reminder: The Organizing Committee reserves the right to limit the number of presentations an individual speaker may present in contributed sessions or minisymposia. Any submission for a contributed presentation in lecture format received after the November 1, 2001 deadline will not be considered as such, but only as a poster presentation. ------------------------------------------------------------------------ ©2001 Society for Industrial & Applied Mathematics Designed by Donaghy's Web Consulting Created: 7/27/01; Last Updated 8/22/01 From owner-reliable_computing [at] interval [dot] louisiana.edu Mon Sep 24 08:42:37 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f8ODgbf05739 for reliable_computing-outgoing; Mon, 24 Sep 2001 08:42:37 -0500 (CDT) Received: from blueyonder.co.uk (pcow025o.blueyonder.co.uk [195.188.53.125]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f8ODgRi05734 for ; Mon, 24 Sep 2001 08:42:28 -0500 (CDT) Received: from mail pickup service by blueyonder.co.uk with Microsoft SMTPSVC; Mon, 24 Sep 2001 14:40:24 +0100 Received: from interval.louisiana.edu (unverified) by pcow058m.blueyonder.net (Content Technologies SMTPRS 4.2.5) with ESMTP id for ; Sun, 23 Sep 2001 18:34:01 +0000 Received: from localhost (daemon@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with SMTP id f8NIXG003612; Sun, 23 Sep 2001 13:33:16 -0500 (CDT) Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f8NIWqm03583 for reliable_computing-outgoing; Sun, 23 Sep 2001 13:32:52 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f8NIWhi03578 for ; Sun, 23 Sep 2001 13:32:43 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id f8NIWb910207; Sun, 23 Sep 2001 12:32:37 -0600 (MDT) Message-Id: <200109231832.f8NIWb910207 [at] cs [dot] utep.edu> Date: Sun, 23 Sep 2001 12:32:36 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: SIAM Conference on Optimization (right before our 2002 meeting) To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: qqInahShscMub0ExcAIL2w== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear Friends, Deadline for abstracts is November 1, deadline for minisymposia is October 1, very soon. Since many of us will be coming to the interval meeting right after it, we may organize some minis. If you are interested in organizing a mini this must be done ASAP. In particular, maybe Dan Berleant (if he is planning to be at SIAM Optimization too) can take a lead on intervals and probability mini? This is clearly an underrepresented area. Vladik ************************************************************************ From: http://www.siam.org/meetings/op02/index.htm SIAM Conference on Optimization, May 20-22, 2002, Westin Harbour Castle Hotel, Toronto, CA Sponsored by SIAM Activity Group on Optimization The field of optimization involves a powerful combination of theoretical analysis, algorithm and software development and scientific computing. The practical scope and utility of optimization continues to grow. The Seventh SIAM Conference on Optimization will address the most important recent advances in linear, nonlinear, and discrete optimization. The meeting will feature the latest research in algorithms and software for the solution of optimization problems. It will also feature important applications of optimization in control, networks, manufacturing, medicine, finance, aeronautical engineering, operations research, and other areas of science and engineering. The conference will bring together mathematicians, operations researchers, computer scientists, engineers, and software developers. The gathering will provide an excellent opportunity for sharing ideas and problems among specialists and users of optimization in academia, government, and industry. Short Courses Immediately preceding the conference, on Sunday May 19, 2002, there will be two concurrent short courses: + Numerical Optimization - Algorithms and Software Organizer: Robert Vanderbei, Princeton University Co-Instructors: Robert Vanderbei, Princeton University; David F. Shanno, Rutgers University; and Hande Y. Benson, Princeton University + Automatic Differentiation Organizer: Andreas Griewank, The Institute of Scientific Computing (IWR) Co-Instructors: Andreas Griewank, The Institute of Scientific Computing (IWR); Uwe Naumann, INRIA; and Andrea Walther, Technical University Dresden Conference Themes The themes of the conference include, but are not limited to: + Computational Science + Engineering Design + Enterprise Optimization + Derivative Free Methods + Automatic Differentiation + Semidefinite Programming + Combinatorial Optimization + Stochastic Optimization Organizers Thomas Coleman (Co-chair),Cornell University Ariela Sofer (Co-chair), George Mason University Masakazu Kojima, Tokyo Institute of Technology Trond Steihaug, University of Bergen Virginia Torczon, College of William and Mary David P. Williamson, IBM Almaden Research Center Henry Wolkowicz, University of Waterloo Get-Togethers Sunday, May 19 Don Goldfarb Day 5:15 PM-7:00 PM Technical Sessions 7:30 PM Banquet Chairs: Sanjay Mehrotra and Jorge Nocedal, Northwestern University Friends and colleagues of Professor Don Goldfarb are organizing a special one-day celebration, honoring his 60th birthday. The celebration will be held on Sunday, May 19, 2002, immediately preceeding the SIAM Conference on Optimization and will consist of 2 hours of technical presentations by former students and collaborators of Professor Goldfarb, followed by an evening banquet. All SIAM conference attendees are welcome to attend the technical sessions at no additional charge. All attendees, and their spouses or guests, are welcome to attend the banquet, but there will be a fee to cover costs. During the banquet, there will be an opportunity for toasts, tributes, and anecdotes. The organizers hope many conference attendees will join in this tribute to one of the leaders in the field of optimization. The organizers for this event are: Sanjay Mehrotra, Northwestern University Jorge Nocedal, Northwestern University Michael Overton, New York University Katya Scheinberg, IBM Registration information for the evening banquet on Sunday, May 19, will be forthcoming. SIAM Get-Togethers Monday, May 20 Welcoming Reception and Poster Session 7:15 PM- 9:00 PM Tuesday, May 21 SIAG/OPT Business Meeting 7:00 PM- 7:45 PM Invited Plenary Speakers SIAM and the Conference Organizing Committee are proud to announce that the following mathematicians and scientists have accepted their invitations to speak at the conference. Chris Bishof, Technical University of Aachen, Germany Ron Dembo, Algorithmics, Toronto, Canada Toshihide Ibaraki, Kyoto University, Japan Tim Kelley, North Carolina State University Anna Nagurney, University of Massachusetts John Straub, Boston University Eva Tardos, Cornell University Steve Wright, Argonne National Laboratory Invited Minisymposia A minisymposium is a two-hour session consisting of four presentations on a well-focused topic consistent with the conference themes. Minisymposium organizers are being invited by the Organizing Committee. A list of Minisymopsia Organizers is forthcoming at this location. Deadlines to Remember: Submit a Paper! Minisymposium Proposal October 1, 2001 Minisymposium paper abstracts and November 1, 2001 Contributed abstracts in lecture or poster format Audiovisual Requirement deadline April 19, 2002 URGENT! Please review the AV notice found at: http://www.siam.org/meetings/resources/avnotice.htm How to Participate You are invited to contribute a presentation for this conference in one of the following formats. Minisymposia A minisymposium consists of four 25-minute presentations, with an additional five minutes for discussion after each presentation. Prospective minisymposium organizers are asked to submit a proposal consisting of a title, a description (not to exceed 100 words), and a list of speakers and titles of their presentations using the Conference Management System available at: http://www.siam.org/meetings/op02/part.htm A minisymposium organizer may also be a speaker in his/her minisymposium, usually the first presenter to give an expository talk. It is recommended that the minisymposium organizer make the first talk as tutorial as possible. Each minisymposium speaker should submit a 75-word abstract. Contributed minisymposia will be refereed by the Organizing Committee. The number of minisymposia may be limited to retain an acceptable level of parallelism in the conference session. For further useful minisymposium organizer and participant information, please visit: http://www.siam.org/meetings/resources/miniguid.htm Deadline for submission of minisymposium proposals and minisymposium speakers' abstracts: October 1, 2001 Contributed Presentations in Lecture or Poster Format Contributed presentations in lecture or poster format are invited in all areas of optimization consistent with the conference themes. A lecture format involves a 15-minute oral presentation with an additional 5 minutes for discussion. A poster format involves the use of visual aids such as 8-1/2" x 11" sheets for mounting on a 4' x 6' poster board. A poster session is two hours long. Each contributor, either for a lecture or poster format, must submit a title and a brief abstract not to exceed 75 words. Please submit contributed presentations in lecture or poster format using the Conference Management System available at: http://www.siam.org/meetings/op02/part.htm Deadline for submission of contributed abstracts: November 1, 2001. Registration The meeting program and registration information will be available at this location by mid-January 2002. Exhibits Publishers, software and hardware suppliers, and service organizations, having products to offer to conference participants and attendees, are invited to participate in the exhibition. For additional information and exhibit fees, contact the SIAM Marketing Representative at marketing [at] siam [dot] org. Related Events Thematic Year Optimization Visitors to the Fields Institute There will be a group of visitors (in optimization) before/during/after the upcoming Seventh SIAM Conference on Optimization. The group will be visiting the Fields Institute. Toronto, Ontario. This is part of the Thematic Year on "Numerical and Computational Challenges in Science and Engineering" (NCCSE) from August 2001 to July 2002. General Information Information on SIAM publications, conferences, activity groups, and programs can be accessed from SIAM's Web site at www.siam.org. Information on SIAM membership can be accessed at www.siam.org/about/member.htm. Important Reminder: The Organizing Committee reserves the right to limit the number of presentations an individual speaker may present in contributed sessions or minisymposia. Any submission for a contributed presentation in lecture format received after the November 1, 2001 deadline will not be considered as such, but only as a poster presentation. ------------------------------------------------------------------------ ©2001 Society for Industrial & Applied Mathematics Designed by Donaghy's Web Consulting Created: 7/27/01; Last Updated 8/22/01 From owner-reliable_computing [at] interval [dot] louisiana.edu Tue Sep 25 08:48:05 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f8PDm5L08391 for reliable_computing-outgoing; Tue, 25 Sep 2001 08:48:05 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f8PDlxi08386 for ; Tue, 25 Sep 2001 08:48:00 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id f8PDlvp20834 for ; Tue, 25 Sep 2001 07:47:57 -0600 (MDT) Message-Id: <200109251347.f8PDlvp20834 [at] cs [dot] utep.edu> Date: Tue, 25 Sep 2001 07:47:55 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: interval methods for PDE: request forwarded to the list To: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: X7Ck9vNUS+D1nb3RZeHaLw== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk ------------- Begin Forwarded Message ------------- From: "Anguelov R" Dear Colleagues I am looking for papers reporting interval methods (methods producing guaranteed upper and lower bounds of the solution) for partial differential equations. Can you please send me some references if you have any. Best regards Roumen Anguelov ------------- End Forwarded Message ------------- From owner-reliable_computing [at] interval [dot] louisiana.edu Wed Sep 26 09:26:29 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f8QEQSV11062 for reliable_computing-outgoing; Wed, 26 Sep 2001 09:26:28 -0500 (CDT) Received: from lcyoung.math.wisc.edu (lcyoung.math.wisc.edu [144.92.166.90]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f8QEQLi11057 for ; Wed, 26 Sep 2001 09:26:23 -0500 (CDT) Received: from bing.math.wisc.edu (bing.math.wisc.edu [144.92.166.133]) by lcyoung.math.wisc.edu (8.11.4/8.11.4) with ESMTP id f8QEQIB15157; Wed, 26 Sep 2001 09:26:18 -0500 (CDT) Received: from localhost (hans@localhost) by bing.math.wisc.edu (8.9.3+Sun/8.9.3) with ESMTP id JAA13890; Wed, 26 Sep 2001 09:26:17 -0500 (CDT) X-Authentication-Warning: bing.math.wisc.edu: hans owned process doing -bs Date: Wed, 26 Sep 2001 09:26:17 -0500 (CDT) From: Hans Schneider To: NETS -- at-net , "Hershkowitz, Danny -- Hershkowitz Daniel" , Danny Hershkowitz , E-LETTER , "na.digest" , ipnet-digest [at] math [dot] msu.edu, wim@bell-labs.com, hjt [at] eos [dot] ncsu.edu, vkm [at] eedsp [dot] gatech.edu, reliable_computing [at] interval [dot] louisiana.edu Subject: LAA contents Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear Net Organizer: Please circulate the attached LAA contents over your net. Thanks hans ------------------------------------------------------------------------------ Hans Schneider hans [at] math [dot] wisc.edu. Department of Mathematics 608-262-1402 (Work) Van Vleck Hall 608-271-7252 (Home) 480 Lincoln Drive 608-263-8891 (Work FAX) University of Wisconsin-Madison 608-271-8477 (Home FAX) Madison WI 53706 USA http://www.math.wisc.edu/~hans (URL) ------------------------------------------------------------------------------ NOTE: ContentsDirect, which is automatically generated, lists the first author of each paper and the corresponding author (if different). Journal: Linear Algebra and its Applications ISSN : 0024-3795 Volume : 336 Issue : 1-3 Date : 15-Oct-2001 Visit the journal at http://www.elsevier.nl/locate/jnlnr/07738 wYou can access for FREE full text articles of Linear Algebra and Its Applications as well as 16 related journal titles from: http://www.mathformath.com. Simply send a blank email to mailto:join-mathformath-offer1 [at] lyris [dot] elsevier.nl . In return, you will receive the instructions for FREE access until 31st October 2001. pp 1-14 On the powers of matrices over a distributive lattice Y. Tan http://www.elsevier.nl/PII/S0024379500001683 pp 15-20 Finite rank harmonic operator-valued functions L. Smithies http://www.elsevier.nl/PII/S002437950100235X pp 21-27 Harnack's theorem for harmonic compact operator-valued functions P. Enflo, L. Smithies http://www.elsevier.nl/PII/S0024379501002452 pp 29-50 Linear preservers on upper triangular operator matrix algebras J. Cui, J. Hou, B. Li http://www.elsevier.nl/PII/S0024379501002889 pp 51-60 Discrete nodal domain theorems E. BrianDavies, G.L. Gladwell, J. Leydold, P.F. Stadler http://www.elsevier.nl/PII/S0024379501003135 pp 61-70 Perturbation analysis of the maximal solution of the matrix equation X+A^*X^-^1A=P S.-F. Xu http://www.elsevier.nl/PII/S0024379501003007 pp 71-98 Classes of normal matrices in indefinite inner products C. Mehl, L. Rodman http://www.elsevier.nl/PII/S0024379501002993 pp 99-118 Characteristic polynomials of graph bundles having voltages in a dihedral group J.H. Kwak, Y.S. Kwon http://www.elsevier.nl/PII/S0024379501003019 pp 119-130 On the norm property of G(c)-radii and Eaton triples M. Niezgoda, T.-Y. Tam http://www.elsevier.nl/PII/S002437950100310X pp 131-166 The real positive definite completion problem for a 4-cycle M. Othman Omran, W. Barrett http://www.elsevier.nl/PII/S0024379501003172 pp 167-180 Classification of (n-5)-filiform Lie algebras J.M. Ancochea Bermudez, O.R. Campoamor Stursberg http://www.elsevier.nl/PII/S0024379501003238 pp 181-190 Zeta functions of digraphs H. Mizuno, I. Sato http://www.elsevier.nl/PII/S0024379501003184 pp 191-200 Computing the elasticity of a Krull monoid S.T. Chapman, J.I. Garca-Garca, P.A. Garcia-Sanchez, J.C. Rosales http://www.elsevier.nl/PII/S0024379501003226 pp 201-204 Generalization of Vandermonde determinants S.-j. Yang, H.-z. Wu, Q.-b. Zhang http://www.elsevier.nl/PII/S0024379501003196 pp 205-218 Some applications of spectral theory of nonnegative matrices to input-output models L. Zeng http://www.elsevier.nl/PII/S002437950100324X pp 219-230 Primary ideals of finitely generated commutative cancellative monoids J.C. Rosales, J.I. Garcia-Garcia http://www.elsevier.nl/PII/S0024379501003214 pp 231-254 Perturbations in the Nevai matrix class of orthogonal matrix polynomials H.O. Yakhlef, F. Marcellan, M.A. Pinar http://www.elsevier.nl/PII/S0024379501003275 pp 255-260 On the orthogonal basis of the symmetry classes of tensors associated with certain characters M.R. Pournaki http://www.elsevier.nl/PII/S0024379501003299 pp 261-264 Boolean rank of Kronecker products V.L. Watts http://www.elsevier.nl/PII/S002437950100338X pp 265 Author index http://www.elsevier.nl/PII/S0024379501004591 --- *********************************** Journal: Linear Algebra and its Applications ISSN : 0024-3795 Volume : 337 Issue : 1-3 Date : 01-Nov-2001 Visit the journal at http://www.elsevier.nl/locate/jnlnr/07738 pp 1-20 Banded matrices and difference equations W. Kratz http://www.elsevier.nl/PII/S0024379501003287 pp 21-35 On the covering number of a matroid element R. Fernandes http://www.elsevier.nl/PII/S0024379501003329 pp 37-78 Spectral behavior of matrix sequences and discretized boundary value problems S. Serra Capizzano http://www.elsevier.nl/PII/S0024379501003354 pp 79-86 Range-kernel orthogonality of the elementary operator X->@?"i"="1^nA"iXB"i-X B.P. Duggal http://www.elsevier.nl/PII/S0024379501003391 pp 87-108 Transformation to versal deformations of matrices A.A. Mailybaev http://www.elsevier.nl/PII/S0024379501003469 pp 109-119 On star-centers of some generalized numerical ranges and diagonals of normal matrices G. Cheung, N.-K. Tsing http://www.elsevier.nl/PII/S0024379501003378 pp 121-138 On the kernel of the derivation operator R. Fernandes http://www.elsevier.nl/PII/S0024379501003445 pp 139-156 Transformations into optimal parallelism in euclidean spaces (or: how to explain the shape of the electron-density distribution inside a crystal) E. Behrends, F. Madler http://www.elsevier.nl/PII/S0024379501003408 pp 157-187 Perturbation analysis for the eigenproblem of periodic matrix pairs W.-W. Lin, J.-g. Sun http://www.elsevier.nl/PII/S0024379501003470 pp 189-235 Optimal angle reduction-a behavioral approach to linear system approximation B. Roorda, S. Weiland http://www.elsevier.nl/PII/S0024379501003482 pp 237-251 A copositivity probe W. Kaplan http://www.elsevier.nl/PII/S0024379501003512 pp 253-265 Almost principal minors of inverse M-matrices C.R. Johnson, R.L. Smith http://www.elsevier.nl/PII/S0024379501003524 pp 269 Author index http://www.elsevier.nl/PII/S0024379501004827 --- From owner-reliable_computing [at] interval [dot] louisiana.edu Wed Sep 26 09:45:58 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f8QEjwJ11182 for reliable_computing-outgoing; Wed, 26 Sep 2001 09:45:58 -0500 (CDT) Received: from cao.ise.ufl.edu (cao.ise.ufl.edu [128.227.216.90]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f8QEjji11177 for ; Wed, 26 Sep 2001 09:45:50 -0500 (CDT) Received: (from pardalos@localhost) by cao.ise.ufl.edu (8.9.1b+Sun/8.9.1) id KAA09680 for reliable_computing [at] interval [dot] louisiana.edu; Wed, 26 Sep 2001 10:22:39 -0400 (EDT) Date: Wed, 26 Sep 2001 10:22:39 -0400 (EDT) From: Dr Panos Pardalos Message-Id: <200109261422.KAA09680 [at] cao [dot] ise.ufl.edu> To: reliable_computing [at] interval [dot] louisiana.edu Subject: Global Optimization conference (June 2003) Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk -------------------------------------------------------------------------- INTERNATIONAL CONFERENCE ON FRONTIERS IN GLOBAL OPTIMIZATION Nomikos Conference Center SANTORINI, GREECE JUNE 8-12, 2003 Organizers : C.A. Floudas and P.M. Pardalos http://www.aegeanconferences.org/ The Fourth International Conference on "Frontiers In Global Optimization" will take place during June 8-12, 2003 in Santorini, Greece. The three previous conferences on "Recent Advances in Global Optimization", "State-of-the-Art in Global Optimization", and "Optimization in Computational Chemistry and Molecular Biology: Local and Global Approaches" took place at Princeton University in 1991, 1995, and 1999, respectively. Conference Goals ---------------- Bring together the most active researchers in theory, algorithms and applications of global optimization. Exchange ideas across discipline boundaries of applied mathematics, computer science, engineering, computational chemistry, molecular biology and bioinformatics. Main Conference Themes ---------------------- Conference topics include advances in: - Deterministic methods for global optimization - Stochastic methods for global optimization - Distributed computing methods in global optimization - Applications of global optimization in all branches of applied science and engineering, computer science, computational chemistry, structural biology, and bioinformatics Important Deadlines ------------------- DECEMBER 1, 2002: Submission of Abstracts and Pre-registration The abstract submission and the Pre-registration can be done on-line in: http://www.aegeanconferences.org/ Early pre-registration and abstract submission is recommended. JANUARY 15, 2003: Notification of Acceptance JANUARY 31, 2003: Hotel Registration and Conference Registration (On-Line) MARCH 15, 2003: Submission of manuscripts (4 copies) to one of the organizers. Early submissions are encouraged. Decisions will be promptly communicated to the authors by e-mail or FAX. Publications ------------ Submitted manuscripts will be regularly refereed and all accepted manuscripts will be published in one volume by "Kluwer Academic Publishers" in the book series "Nonconvex Optimization and Its Applications". A collection of manuscripts will be published in a special issue of the "Journal of Global Optimization". The manuscripts should use the style provided in the sample.tex file (see Publications section of the conference webpage): http://www.aegeanconferences.org/ Conference Format ----------------- The conference is organized following the general rules of Aegean Conferences and will feature : - a Welcome Reception on Sunday Evening (June 8, 2003), - presentations on Monday, Tuesday, Wednesday, and Thursday (8:00am-2:00pm) - an afternoon tour of Santorini Island (June 11, 2003), and - a Gala dinner on Thursday evening (June 12, 2003). The registration fee for participants and students will cover : - 5 nights hotel accommodation at Santorini Image Hotel - Welcome reception - All coffee breaks (4) - Lunches (4) - Dinners (June 9 and 10, 2003) - Afternoon Island Tour - Gala dinner A special registration fee for accompanying persons will cover : - 5 nights hotel accommodation at Santorini Image Hotel - Welcome reception - Dinners (June 9 and 10, 2003) - Afternoon Island Tour - Gala dinner Information on the Registration fees for participants and for accompanying persons, as well as On-line Registration will be available on : http://www.aegeanconferences.org/ Additional Information: ---------------------- Additional information can be obtained from the conference organizers: Professor C.A. Floudas Department of Chemical Engineering Princeton University Princeton, NJ 08544-5263 Tel.: (609) 258-4595 Fax : (609) 258-0211 e-mail: floudas [at] titan [dot] princeton.edu Professor P.M. Pardalos Department of Industrial and Systems Engineering Center for Applied Optimization University of Florida Gainesville, FL 32611 Tel : (352) 392-9011 Fax : (352) 392-3537 e-mail : pardalos [at] ufl [dot] edu ------------------------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] louisiana.edu Thu Sep 27 14:53:52 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f8RJrpk01016 for reliable_computing-outgoing; Thu, 27 Sep 2001 14:53:51 -0500 (CDT) Received: from mailhub-1.iastate.edu (mailhub-1.iastate.edu [129.186.140.3]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f8RJrkI01011 for ; Thu, 27 Sep 2001 14:53:46 -0500 (CDT) Received: from mx.eng.iastate.edu (mx.eng.iastate.edu [129.186.23.116]) by mailhub-1.iastate.edu (8.12.0/8.12.0) with ESMTP id f8RJrcmj030932; Thu, 27 Sep 2001 14:53:38 -0500 Received: by mx.eng.iastate.edu with Internet Mail Service (5.5.2653.19) id ; Thu, 27 Sep 2001 14:54:10 -0500 Message-ID: <873F9637C545D311A5C500902771C859015DC732 [at] mx [dot] eng.iastate.edu> From: "Berleant, D." To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu Subject: Probability and statistics researchers sought Date: Thu, 27 Sep 2001 14:54:09 -0500 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.5.2653.19) Content-Type: text/plain; charset="iso-8859-1" Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk To: Persons interested in imprecise probabilities, bounded probabilities, intervals and probabilities, related topics in statistics, and other related areas. Your presence is sought to represent these areas and for informal discussion with people with similar interests at Validated Computing 2002. Further discussions may also occur at the Informal Workshop following. Abstract deadline: Oct. 5. VALIDATED COMPUTING 2002 SIAM Workshop Toronto, Canada, May 23-25, 2002 (including a special session honoring Ray Moore) Immediately following the Seventh SIAM Conference on Optimization (May 20-23, 2002) (see http://www.siam.org/meetings/op02/index.htm) To be followed by a Fields Institute working group on optimization Call for Papers --------------- We invite submission of papers dealing with validated computing. Areas of interest include, but are not limited to, interval arithmetic and analysis, probability bounds and related statistical topics, use of mathematical theory to assure reliable scientific computation, and fuzzy logic. We are especially interested in applications of these techniques and in tools that support the techniques. Submit an extended abstract of 2-3 pages to R. Baker Kearfott at rbk [at] louisiana [dot] edu by October 5. Submissions must be in Latex using ONLY the standard article style. Use psfig.sty if you include figures. The Program Committee will review the submissions contributed. Most papers will be presented as 30 minute talks. Depending on the number of submissions, 8-12 talks will be selected for 40 minute highlighted talks. A few talks may be selected for other special sessions. We invite proposals for minisymposia of 4-5 speakers coordinated to focus on a particular topic. Minisymposia proposals should include the extended abstracts of each speaker AND a one paragraph abstract for the session. Submit minisymposia proposals to R. Baker Kearfott at rbk [at] louisiana [dot] edu by October 5.Minisymposia will have the same visibility and length of talks as the contributed paper sessions. The Program Committee will attempt to arrange contributed papers into coherent sessions. The advantage of a minisymposium is that the minisymposium organizer and speakers are encouraged to communicate and coordinate their presentations to increase impact, use a common notation, and reduce duplications. Deadlines --------- October 5 Minisymposia proposals including extended abstracts of each speaker AND a one paragraph abstract for the session. October 5 Extended 2-3 page abstracts to be considered for highlighted talks October 30 Notification of accepted talks January 15 Extended 2-3 page abstracts for LATE submissions, which will be considered only as contributed talks February 15 Notification of accepted talks March 1 (tentative) End of early registration April 1 (tentative) Hotel reservations May 23-25 Workshop itself Speakers who have already accepted invitations ---------------------------------------------- Annie Cuyt William Edmonson Andreas Griewank Eldon Hansen Kaj Madsen Arnold Neumaier Linda Petzold Louis Rall Mark Stadtherr Special informal week --------------------- Participants in the workshop are invited to participate in a week of informal discussions at the Fields Institute at the University of Toronto, immediately following the workshop. This week is part of the Fields Institute's special thematic year on computational challenges in science and engineering. Depending on numbers, the Fields Institute can provide office space and meeting areas for this activity. For general information on the Fields Institute and the thematic year, see http://www.fields.utoronto.ca/programs/scientific/01-02/numerical/) Persons interested in this week at the Fields Institute should contact R. Baker Kearfott (rbk [at] louisiana [dot] edu) or or Tibor Csendes (csendes [at] inf [dot] u-szeged.hu) before October 5, 2001. You may express your interest when you submit your abstract. Web page: -------- A web-page with this and other information is available at http://interval.louisiana.edu/conferences/Validated_computing_2002/html_noti ce.html. Description and rationale ------------------------- Reliable computing is essential. There is no feasible alternative. Modern societies rely more and more on computer systems. Usually, our systems appear to work successfully, but there are sometimes serious, and often minor, errors. Ever increasing reliance on computer systems brings ever increasing need for reliability. Validated computing is one essential technology to achieve increased software reliability. Validated computing uses controlled rounding of computer arithmetic to guarantee that hypotheses of suitable mathematical theorems are (or are not) satisfied. Mathematical rigor in the computer arithmetic, in algorithm design, and in program execution allow us to guarantee that the stated problem has (or does not have) a solution in an enclosing interval we compute. If the enclosure is narrow, we are certain that we know the answer reliably and accurately. If the enclosing interval is wide, we have a clear warning that our uncertainty is large, and a closer study is demanded. Intervals capture uncertainly in modeling and problem formulation, in model parameter estimation, in algorithm truncation, in operation round off, and in model interpretation. The techniques of validated computing have proven their merits in many scientific and engineering applications. They help answer questions from, "How much irrigation water does a desert golf course return effectively unused to its bordering stream?" to "Will a near earth asteroid hit the earth, possibly ending life as we know it?". The techniques of validated computing rest on solid and interesting theoretical studies in mathematics and computer science. Contributions from fields including real, complex and functional analysis, semigroups, probability, statistics, fuzzy logic, automatic differentiation, computer hardware, operating systems, compiler construction, parallel processing, and software engineering are all essential. The major emphasis of the program is on applications. We will hear from many people who have used tools from validated computing to attack, and often solve, significant practical problems. Successful applications have included medical diagnosis and treatment, financial simulation, mechanical design, oil reservoir simulation, aeronautics, high energy particle accelerators, environmental engineering, chemical process simulation and control, computer graphics for motion picture special effects, astrophysics, and many more. Not all applications are as yet successful. We will also hear from people with challenging applications to which validated techniques have not yet been successfully applied. Hopefully, by encouraging experts in such applications to lay out their problems, we will foster long-term collaborations leading to significant advances in those fields. The workshop follows the SIAM Optimization meeting because global optimization is a major concern of both the optimization and the validated computing communities. By holding the meetings consecutively, we encourage validated computing researchers to become more involved in the wider optimization community, and we encourage people more interested in standard techniques of optimization to participate in interval discussions. We will have one special session and a conference banquet to honor Ray Moore. His 1966 book defined the field, he pioneered many applications, and he continues to contribute insights and papers. Most of the ideas in our interval algorithms of today directly trace their ancestry to Ray's 1966 and 1979 (from SIAM) books. In parallel with the traditional scientific program following SIAM's usual pattern of highlighted and contributed papers, we are considering half-day detailed workshops. Tentative topics include: 1. Jiri Rohn on complexity. This would follow up on his talk at SCAN 2000 in Karlsruhe "Finite Characterization of Some Linear Problems with Inexact Data." 2. Tutorial on validated techniques, interval arithmetic, and related tools. We would start at the beginning by defining directed rounding, and progress to a "Numerical Recipes" level view of several widely used algorithms, e.g., linear systems, interval Newton, global optimization, ordinary and partial differential equations. 3. Hands-on tools and demonstrations. Program Committee ----------------- R. Baker Kearfott University of Louisiana at Lafayette rbk [at] louisiana [dot] edu Vladik Kreinovich University of Texas at El Paso vladik [at] cs [dot] utep.edu Daniel Berleant Iowa State University berleant [at] iastate [dot] edu George Corliss Marquette University George.Corliss [at] Marquette [dot] edu Weldon Lodwick University of Colorado at Denver wlodwick [at] carbon [dot] cudenver.edu Ken Jackson University of Toronto krj [at] cs [dot] toronto.edu Bill Walster Sun Microsystems Bill.Walster [at] eng [dot] sun.com From owner-reliable_computing [at] interval [dot] louisiana.edu Fri Sep 28 19:58:56 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f8T0wui04323 for reliable_computing-outgoing; Fri, 28 Sep 2001 19:58:56 -0500 (CDT) Received: from imf08bis.bellsouth.net (mail008.mail.bellsouth.net [205.152.58.28]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f8T0wqI04318 for ; Fri, 28 Sep 2001 19:58:52 -0500 (CDT) Received: from u8174 ([66.20.81.154]) by imf08bis.bellsouth.net (InterMail vM.5.01.01.01 201-252-104) with SMTP id <20010929005948.WYOP29407.imf08bis.bellsouth.net@u8174> for ; Fri, 28 Sep 2001 20:59:48 -0400 Message-Id: <2.2.32.20010929005651.036c262c [at] 130 [dot] 70.132.231> X-Sender: rbk5287 [at] 130 [dot] 70.132.231 X-Mailer: Windows Eudora Pro Version 2.2 (32) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Fri, 28 Sep 2001 19:56:51 -0500 To: reliable_computing [at] interval [dot] louisiana.edu From: "R. Baker Kearfott" Subject: Moore's early papers available electronically Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Colleagues, Bill Walster has collected the early works of Ray Moore and his colleagues, has scanned them into electronic form, and has obtained permission from the publishers to post them. (Sun has sponsored this endeavor, including paying copyright fees.) Eldon Hansen has written a short introduction, that I have converted to HTML. This HTML file contains links to the actual papers (in PDF format), that you can access and read. The collection is available at the address: http://interval.louisiana.edu/Moores_early_papers/bibliography.html Best regards, Baker --------------------------------------------------------------- R. Baker Kearfott, rbk [at] louisiana [dot] edu (337) 482-5346 (fax) (337) 482-5270 (work) (337) 981-9744 (home) URL: http://interval.louisiana.edu/kearfott.html Department of Mathematics, University of Louisiana at Lafayette Box 4-1010, Lafayette, LA 70504-1010, USA --------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] louisiana.edu Sat Sep 29 14:38:07 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f8TJc6X06458 for reliable_computing-outgoing; Sat, 29 Sep 2001 14:38:06 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f8TJc2I06453 for ; Sat, 29 Sep 2001 14:38:02 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id f8TJbx123450 for ; Sat, 29 Sep 2001 13:37:59 -0600 (MDT) Message-Id: <200109291937.f8TJbx123450 [at] cs [dot] utep.edu> Date: Sat, 29 Sep 2001 13:37:57 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: a letter our students wrote to the local newspaper To: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: HKeIEeyFvf3MND2E5mDIsw== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear Colleagues, I apologize for sending, to the interval mailing list, a letter that is somewhat off-topic for this list. This letter was send by our research students (many of whom are working on interval-related problems) to the local newspaper. I would like to share it with you, because, in my opinion, it nicely emphasizes the importance of scientific endeavor in general and interval computations in particular, not only to acquire more knowledge, but also to promote human understanding, tolerance, and good will. Vladik **************************************************************** Dear Friends, We are Computer Science students working with the Center for Theoretical Research and its Applications in Computer Science (TRACS) at the University of Texas at El Paso (http://tracs.cs.utep.edu) and alumni of this center. We are working on different projects related to satellite image processing, computer security, robotics, Artificial Intelligence, structural integrity of aerospace structures, neural networks, fuzzy logic, interval computations, quantum computing, and many other exciting areas. Our results have been published in international journals and in the proceedings of international conferences. Some of us had the opportunity to go and present these papers at the conferences in the USA and in countries around the world. Some of our alumni work for top companies (IBM, Nortel, etc.), some are professors at good universities (Texas Tech, New Mexico State University, ITESM (Mexico), University of Milan). We come from diverse backgrounds and cultures. Like probably most American universities, in addition to American students of different race and ethnicity, TRACS has had and still has students and faculty from all inhabitable continents: from North America (Mexico, Canada), from South America (Brazil, Colombia), from Africa (Nigeria), from Asia (China, India, Lebanon, Syria, Vietnam), from Australia, and from Europe (Bulgaria, Czech Republic, Germany, France, Italy, Montenegro, Poland, Portugal, Russia, Spain). In addition to the university, our financial support comes from NASA (via a multi-million Pan-American Center for Earth and Environmental Studies and several smaller grants), from the the National Science Foundation, from CONACYT (Mexican National Council for Science and Technology), from the United Space Alliance, and from many other agencies. We work on different projects, but we all work together. Several TRACS students from the USA have been working on grants from the National Security Agency related to detecting threatening messages in webpages. In this applications, they used algorithms developed by other students and faculty for more peaceful applications like geophysics-oriented satellite image processing. We work together, and we have fun together, even though we come from different cultural and religious backgrounds. Some of us are Christians, some Moslems, some Hindus, some Buddhists, some Jews. The local pizza place already knows that we need a lot of different toppings (veggie, without pork, etc.), to cater to different traditions. Working in TRACS and in other research groups is a great opportunity for us to use our potential, to bring our ideas together, to brainstorm. Our research not only benefits us, it helps in solving real-world problems ranging from computer security to Space Shuttle control. We are all different, we look differently, we eat different things, but we all work together on things that can benefit people all over the globe. Roberto Araiza, TRACS student coordinator Vick Alvarado, TRACS webmaster Jabel Morales, TRACS member, a Teaching Assistant and a student tutor with the Academic Center for Engineers and Scientists (ACES) Lakshmi Potluri, TRACS member, Computer Science student representative on the President's Women Advisory Council and 30 other TRACS students; Alessandro Provetti, TRACS alumnus, Professor at the University of Milan, Italy, and other TRACS alumni Mailing address: TRACS Center, Room 124 Department of Computer Science University of Texas at El Paso 500 W. University El Paso, TX 79968 emails: Roberto Araiza raraiza [at] cs [dot] utep.edu Vick Alvarado vick [at] cs [dot] utep.edu Jabel Moralez jabel [at] cs [dot] utep.edu Lakshmi Potluri lakshmi [at] cs [dot] utep.edu Alessandro Provetti provetti [at] gongolo [dot] usr.dsi.unimi.it Departmental phone number (915) 747-5480 From owner-reliable_computing [at] interval [dot] louisiana.edu Sat Sep 29 16:42:34 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f8TLgYp06844 for reliable_computing-outgoing; Sat, 29 Sep 2001 16:42:34 -0500 (CDT) Received: from imf05bis.bellsouth.net (mail205.mail.bellsouth.net [205.152.58.145]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f8TLgPI06839 for ; Sat, 29 Sep 2001 16:42:25 -0500 (CDT) Received: from u8174 ([66.20.81.154]) by imf05bis.bellsouth.net (InterMail vM.5.01.01.01 201-252-104) with SMTP id <20010929214320.RKSJ29611.imf05bis.bellsouth.net@u8174> for ; Sat, 29 Sep 2001 17:43:20 -0400 Message-Id: <2.2.32.20010929213754.036b18e8 [at] 130 [dot] 70.132.231> X-Sender: rbk5287 [at] 130 [dot] 70.132.231 X-Mailer: Windows Eudora Pro Version 2.2 (32) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Sat, 29 Sep 2001 16:37:54 -0500 To: reliable_computing [at] interval [dot] louisiana.edu From: "R. Baker Kearfott" Subject: Reminder: Validated Computing 2002 Abstracts Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Colleagues, This is a reminder to submit your abstracts to me soon for Validated Computing 2002, in May in Toronto. I have appended a copy of the call for papers, for your information. This call for papers is also available at http://interval.louisiana.edu/conferences/Validated_computing_2002/html_notice.html Best regards, Baker P.S. Please inform me if you need more time to prepare your abstract. It may be possible to have a little leeway on this. ===================================================================== Validated Computing 2002 SIAM Workshop Toronto, Canada, May 23-25, 2002 (including a special session honoring Ray Moore) Immediately following the Seventh SIAM Conference on Optimization (May 20-23, 2002) (see http://www.siam.org/meetings/op02/index.htm) To be followed by a Fields Institute working group on optimization Call for Papers --------------- We invite submission of papers dealing with validated computing. Areas of interest include, but are not limited to, interval arithmetic and analysis, use of mathematical theory to assure reliable scientific computation, and fuzzy logic. We are especially interested in applications of these techniques and in tools that support the techniques. Submit an extended abstract of 2-3 pages to R. Baker Kearfott at rbk [at] louisiana [dot] edu by October 5. Submissions must be in Latex using ONLY the standard article style. Use psfig.sty if you include figures. The Program Committee will review the submissions contributed. Most papers will be presented as 30 minute talks. Depending on the number of submissions, 8-12 talks will be selected for 40 minute highlighted talks. A few talks may be selected for other special sessions. We invite proposals for minisymposia of 4-5 speakers coordinated to focus on a particular topic. Minisymposia proposals should include the extended abstracts of each speaker AND a one paragraph abstract for the session. Submit minisymposia proposals to R. Baker Kearfott at rbk [at] louisiana [dot] edu by October 5.Minisymposia will have the same visibility and length of talks as the contributed paper sessions. The Program Committee will attempt to arrange contributed papers into coherent sessions. The advantage of a minisymposium is that the minisymposium organizer and speakers are encouraged to communicate and coordinate their presentations to increase impact, use a common notation, and reduce duplications. Deadlines --------- October 5 Minisymposia proposals including extended abstracts of each speaker AND a one paragraph abstract for the session. October 5 Extended 2-3 page abstracts to be considered for highlighted talks October 30 Notification of accepted talks January 15 Extended 2-3 page abstracts for LATE submissions, which will be considered only as contributed talks February 15 Notification of accepted talks March 1 (tentative) End of early registration April 1 (tentative) Hotel reservations May 23-25 Workshop itself Speakers who have already accepted invitations ---------------------------------------------- Goetz Alefeld Annie Cuyt William Edmonson Andreas Griewank Eldon Hansen Kaj Madsen Arnold Neumaier Linda Petzold Louis Rall Mark Stadtherr Special informal week --------------------- Participants in the workshop are invited to participate in a week of informal discussions at the Fields Institute at the University of Toronto, immediately following the workshop. This week is part of the Fields Institute's special thematic year on computational challenges in science and engineering. Depending on numbers, the Fields Institute can provide office space and meeting areas for this activity. For general information on the Fields Institute and the thematic year, see http://www.fields.utoronto.ca/programs/scientific/01-02/numerical/) Persons interested in this week at the Fields Institute should contact R. Baker Kearfott (rbk [at] louisiana [dot] edu) or or Tibor Csendes (csendes [at] inf [dot] u-szeged.hu) before October 5, 2001. You may express your interest when you submit your abstract. Web page: -------- A web-page with this and other information is available at http://interval.louisiana.edu/conferences/Validated_computing_2002/html_notice.html. Description and rationale ------------------------- Reliable computing is essential. There is no feasible alternative. Modern societies rely more and more on computer systems. Usually, our systems appear to work successfully, but there are sometimes serious, and often minor, errors. Ever increasing reliance on computer systems brings ever increasing need for reliability. Validated computing is one essential technology to achieve increased software reliability. Validated computing uses controlled rounding of computer arithmetic to guarantee that hypotheses of suitable mathematical theorems are (or are not) satisfied. Mathematical rigor in the computer arithmetic, in algorithm design, and in program execution allow us to guarantee that the stated problem has (or does not have) a solution in an enclosing interval we compute. If the enclosure is narrow, we are certain that we know the answer reliably and accurately. If the enclosing interval is wide, we have a clear warning that our uncertainty is large, and a closer study is demanded. Intervals capture uncertainly in modeling and problem formulation, in model parameter estimation, in algorithm truncation, in operation round off, and in model interpretation. The techniques of validated computing have proven their merits in many scientific and engineering applications. They help answer questions from, "How much irrigation water does a desert golf course return effectively unused to its bordering stream?" to "Will a near earth asteroid hit the earth, possibly ending life as we know it?". The techniques of validated computing rest on solid and interesting theoretical studies in mathematics and computer science. Contributions from fields including real, complex and functional analysis, semigroups, probability, statistics, fuzzy logic, automatic differentiation, computer hardware, operating systems, compiler construction, parallel processing, and software engineering are all essential. The major emphasis of the program is on applications. We will hear from many people who have used tools from validated computing to attack, and often solve, significant practical problems. Successful applications have included medical diagnosis and treatment, financial simulation, mechanical design, oil reservoir simulation, aeronautics, high energy particle accelerators, environmental engineering, chemical process simulation and control, computer graphics for motion picture special effects, astrophysics, and many more. Not all applications are as yet successful. We will also hear from people with challenging applications to which validated techniques have not yet been successfully applied. Hopefully, by encouraging experts in such applications to lay out their problems, we will foster long-term collaborations leading to significant advances in those fields. The workshop follows the SIAM Optimization meeting because global optimization is a major concern of both the optimization and the validated computing communities. By holding the meetings consecutively, we encourage validated computing researchers to become more involved in the wider optimization community, and we encourage people more interested in standard techniques of optimization to participate in interval discussions. We will have one special session and a conference banquet to honor Ray Moore. His 1966 book defined the field, he pioneered many applications, and he continues to contribute insights and papers. Most of the ideas in our interval algorithms of today directly trace their ancestry to Ray's 1966 and 1979 (from SIAM) books. In parallel with the traditional scientific program following SIAM's usual pattern of highlighted and contributed papers, we are considering half-day detailed workshops. Tentative topics include: 1. Jiri Rohn on complexity. This would follow up on his talk at SCAN 2000 in Karlsruhe "Finite Characterization of Some Linear Problems with Inexact Data." 2. Tutorial on validated techniques, interval arithmetic, and related tools. We would start at the beginning by defining directed rounding, and progress to a "Numerical Recipes" level view of several widely used algorithms, e.g., linear systems, interval Newton, global optimization, ordinary and partial differential equations. 3. Hands-on tools and demonstrations. Program Committee ----------------- R. Baker Kearfott University of Louisiana at Lafayette rbk [at] louisiana [dot] edu Vladik Kreinovich University of Texas at El Paso vladik [at] cs [dot] utep.edu George Corliss Marquette University George.Corliss [at] Marquette [dot] edu Weldon Lodwick University of Colorado at Denver wlodwick [at] carbon [dot] cudenver.edu Ken Jackson University of Toronto krj [at] cs [dot] toronto.edu Bill Walster Sun Microsystems Bill.Walster [at] eng [dot] sun.com --------------------------------------------------------------- R. Baker Kearfott, rbk [at] louisiana [dot] edu (337) 482-5346 (fax) (337) 482-5270 (work) (337) 981-9744 (home) URL: http://interval.louisiana.edu/kearfott.html Department of Mathematics, University of Louisiana at Lafayette Box 4-1010, Lafayette, LA 70504-1010, USA --------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] louisiana.edu Sat Sep 29 19:07:38 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f8U07bt07199 for reliable_computing-outgoing; Sat, 29 Sep 2001 19:07:37 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f8U07WI07193 for ; Sat, 29 Sep 2001 19:07:33 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id f8U07Rr24447; Sat, 29 Sep 2001 18:07:27 -0600 (MDT) Message-Id: <200109300007.f8U07Rr24447 [at] cs [dot] utep.edu> Date: Sat, 29 Sep 2001 18:07:26 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: CM-2002: First Announcement To: reliable_computing [at] interval [dot] louisiana.edu Cc: brumberg [at] quasar [dot] ipa.nw.ru MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: ogY+hi0iyfargDtQxm9UFg== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear Friends, * Since celestial mechanics was the first application area for Ray Moore, and * since there is a recent paper by Moore, Berz, and Hoefkens on the application of interval to celestial mechanics, and * since St. Petersburg has many interval folks, maybe we can organize an interest session there? What do you all think? Professor Brumberg sent me personally this email and I believe he would like us to participate. I am sending him a copy of this emails sent to the 400+ interval mailing list. Vladik ------------- Begin Forwarded Message ------------- X-Sender: brumberg [at] quasar [dot] ipa.nw.ru Date: Fri, 28 Sep 2001 20:46:46 +0400 To: "V.Ya.Kreinovich" International Workshop Celestial Mechanics -2002: Results and Prospects Institute of Applied Astronomy of Russian Academy of Sciences St. Petersburg, Russia, 10 -14 September 2002 First Announcement, September 2001 The Institute of Applied Astronomy (IPA) will hold a specialized celestial mechanics workshop "Celestial Mechanics - 2002: Results and Prospects" on 10-14 September 2002 in St.Petersburg. In the second half of the last century celestial mechanics survived a period of extensive development stimulated by new mathematical methods, space research, computer advances and rapid progress in the precision of astronomical observations. It seems reasonable to analyse the present state of art of celestial mechanics in anticipating new increase in the observation precision due to the future projects of space astrometry. This is one of the main motivations to arrange the proposed workshop. The organization of this workshop in IPA is to continue the tradition of the Institute of Theoretical Astronomy (ITA). After joining ITA to IPA the latter institute became the main scientific center in Russia designed for the elaboration and production of astronomical ephemerides. According to its title the scientific program of the workshop will cover the most various problems of celestial mechanics. The main attention will be focused on the following topics: 1) problems of celestial mechanics in the relativistic framework; 2) application of analytical and qualitative techniques in modern celestial mechanics; 3) models of the orbital motion and rotation of the solar system bodies adequate to high-precision observations; 4) high-precision astrometric observations for celestial mechanics purposes; 5) motion of the Earth's artificial satellites. The working languages of the workshop are Russian and English. Publication of abstracts and the workshop proceedings is planned in English. A very limited number of grants to facilitate the attendance of the workshop might be available. The preliminary registration form is given below. More details will be provided with the second announcement to be sent to those who return the attached preliminary registration form. The staff of the scientific organizing committee is as follows: Yu.V.Batrakov , IPA, St.Petersburg. T.V.Bordovitsyna, Tomsk University, Tomsk. P.Bretagnon, IMC, Paris, France. V.A.Brumberg - chairman, IPA, St.Petersburg. N.V.Emelianov, Sternberg Astronomical Institute, Moscow. S.Ferraz-Mello - co-chairman, University of Sao Paulo, Brazil. A.M.Finkelstein, IPA (director), St. Petersburg. T.Fukushima, NAO, Tokyo, Japan. G.Kaplan, USNO, Washington, USA. K.V.Kholshevnikov - vice-chairman, SPb University, St.Petersburg. G.A.Krasinsky, IPA, St.Petersburg. A.Milani, University of Pisa, Pisa, Italy. N.V.Shuigina - secretary, IPA, St.Petersburg. Contact address: N.V.Shuigina, CM-2002 SOC Secretary Institute of Applied Astronomy Kutuzov quay, 10, 191187 St.Petersburg, Russia fax: 7-812-275-1119 e-mail: nvf [at] quasar [dot] ipa.nw.ru Preliminary registration form International Workshop CM-2002 Institute of Applied Astronomy, St.Petersburg, Russia, 10-14 September 2002 Please complete and return this form to the SOC secretary by e-mail or fax not later than 15 November, 2001 Name: Institute: Address: Fax: E-mail: Topic of potential contribution: ------------- End Forwarded Message ------------- From owner-reliable_computing [at] interval [dot] louisiana.edu Sun Sep 30 13:01:26 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f8UI1Qh00365 for reliable_computing-outgoing; Sun, 30 Sep 2001 13:01:26 -0500 (CDT) Received: from imf09bis.bellsouth.net (mail209.mail.bellsouth.net [205.152.58.149]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f8UI1Kq00360 for ; Sun, 30 Sep 2001 13:01:21 -0500 (CDT) Received: from u8174 ([66.20.81.154]) by imf09bis.bellsouth.net (InterMail vM.5.01.01.01 201-252-104) with SMTP id <20010930180216.FHUF10309.imf09bis.bellsouth.net@u8174> for ; Sun, 30 Sep 2001 14:02:16 -0400 Message-Id: <2.2.32.20010930175040.036d8e90 [at] 130 [dot] 70.132.231> X-Sender: rbk5287 [at] 130 [dot] 70.132.231 X-Mailer: Windows Eudora Pro Version 2.2 (32) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Sun, 30 Sep 2001 12:50:40 -0500 To: reliable_computing [at] interval [dot] louisiana.edu From: "R. Baker Kearfott" Subject: test message -- please discard Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk This is a test; please discard. rbk --------------------------------------------------------------- R. Baker Kearfott, rbk [at] louisiana [dot] edu (337) 482-5346 (fax) (337) 482-5270 (work) (337) 981-9744 (home) URL: http://interval.louisiana.edu/kearfott.html Department of Mathematics, University of Louisiana at Lafayette Box 4-1010, Lafayette, LA 70504-1010, USA --------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] louisiana.edu Sun Sep 30 13:08:52 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f8UI8pe00501 for reliable_computing-outgoing; Sun, 30 Sep 2001 13:08:51 -0500 (CDT) Received: from imf05bis.bellsouth.net (mail205.mail.bellsouth.net [205.152.58.145]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f8UI8kq00496 for ; Sun, 30 Sep 2001 13:08:46 -0500 (CDT) Received: from u8174 ([66.20.81.154]) by imf05bis.bellsouth.net (InterMail vM.5.01.01.01 201-252-104) with SMTP id <20010930180942.FTIT29611.imf05bis.bellsouth.net@u8174> for ; Sun, 30 Sep 2001 14:09:42 -0400 Message-Id: <2.2.32.20010930175803.036ec860 [at] 130 [dot] 70.132.231> X-Sender: rbk5287 [at] 130 [dot] 70.132.231 X-Mailer: Windows Eudora Pro Version 2.2 (32) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Sun, 30 Sep 2001 12:58:03 -0500 To: reliable_computing [at] interval [dot] louisiana.edu From: "R. Baker Kearfott" Subject: Reminder: Validated Computing 2002 Abstracts Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Colleagues, This is a reminder to submit your abstracts to me soon for Validated Computing 2002, in May in Toronto. I have appended a copy of the call for papers, for your information. This call for papers is also available at http://interval.louisiana.edu/conferences/Validated_computing_2002/html_notice.html Best regards, Baker P.S. Please inform me if you need more time to prepare your abstract. It may be possible to have a little leeway on this. ===================================================================== Validated Computing 2002 SIAM Workshop Toronto, Canada, May 23-25, 2002 (including a special session honoring Ray Moore) Immediately following the Seventh SIAM Conference on Optimization (May 20-23, 2002) (see http://www.siam.org/meetings/op02/index.htm) To be followed by a Fields Institute working group on optimization Call for Papers --------------- We invite submission of papers dealing with validated computing. Areas of interest include, but are not limited to, interval arithmetic and analysis, use of mathematical theory to assure reliable scientific computation, and fuzzy logic. We are especially interested in applications of these techniques and in tools that support the techniques. Submit an extended abstract of 2-3 pages to R. Baker Kearfott at rbk [at] louisiana [dot] edu by October 5. Submissions must be in Latex using ONLY the standard article style. Use psfig.sty if you include figures. The Program Committee will review the submissions contributed. Most papers will be presented as 30 minute talks. Depending on the number of submissions, 8-12 talks will be selected for 40 minute highlighted talks. A few talks may be selected for other special sessions. We invite proposals for minisymposia of 4-5 speakers coordinated to focus on a particular topic. Minisymposia proposals should include the extended abstracts of each speaker AND a one paragraph abstract for the session. Submit minisymposia proposals to R. Baker Kearfott at rbk [at] louisiana [dot] edu by October 5.Minisymposia will have the same visibility and length of talks as the contributed paper sessions. The Program Committee will attempt to arrange contributed papers into coherent sessions. The advantage of a minisymposium is that the minisymposium organizer and speakers are encouraged to communicate and coordinate their presentations to increase impact, use a common notation, and reduce duplications. Deadlines --------- October 5 Minisymposia proposals including extended abstracts of each speaker AND a one paragraph abstract for the session. October 5 Extended 2-3 page abstracts to be considered for highlighted talks October 30 Notification of accepted talks January 15 Extended 2-3 page abstracts for LATE submissions, which will be considered only as contributed talks February 15 Notification of accepted talks March 1 (tentative) End of early registration April 1 (tentative) Hotel reservations May 23-25 Workshop itself Speakers who have already accepted invitations ---------------------------------------------- Goetz Alefeld Annie Cuyt William Edmonson Andreas Griewank Eldon Hansen Kaj Madsen Arnold Neumaier Linda Petzold Louis Rall Mark Stadtherr Special informal week --------------------- Participants in the workshop are invited to participate in a week of informal discussions at the Fields Institute at the University of Toronto, immediately following the workshop. This week is part of the Fields Institute's special thematic year on computational challenges in science and engineering. Depending on numbers, the Fields Institute can provide office space and meeting areas for this activity. For general information on the Fields Institute and the thematic year, see http://www.fields.utoronto.ca/programs/scientific/01-02/numerical/) Persons interested in this week at the Fields Institute should contact R. Baker Kearfott (rbk [at] louisiana [dot] edu) or or Tibor Csendes (csendes [at] inf [dot] u-szeged.hu) before October 5, 2001. You may express your interest when you submit your abstract. Web page: -------- A web-page with this and other information is available at http://interval.louisiana.edu/conferences/Validated_computing_2002/html_notice.html. Description and rationale ------------------------- Reliable computing is essential. There is no feasible alternative. Modern societies rely more and more on computer systems. Usually, our systems appear to work successfully, but there are sometimes serious, and often minor, errors. Ever increasing reliance on computer systems brings ever increasing need for reliability. Validated computing is one essential technology to achieve increased software reliability. Validated computing uses controlled rounding of computer arithmetic to guarantee that hypotheses of suitable mathematical theorems are (or are not) satisfied. Mathematical rigor in the computer arithmetic, in algorithm design, and in program execution allow us to guarantee that the stated problem has (or does not have) a solution in an enclosing interval we compute. If the enclosure is narrow, we are certain that we know the answer reliably and accurately. If the enclosing interval is wide, we have a clear warning that our uncertainty is large, and a closer study is demanded. Intervals capture uncertainly in modeling and problem formulation, in model parameter estimation, in algorithm truncation, in operation round off, and in model interpretation. The techniques of validated computing have proven their merits in many scientific and engineering applications. They help answer questions from, "How much irrigation water does a desert golf course return effectively unused to its bordering stream?" to "Will a near earth asteroid hit the earth, possibly ending life as we know it?". The techniques of validated computing rest on solid and interesting theoretical studies in mathematics and computer science. Contributions from fields including real, complex and functional analysis, semigroups, probability, statistics, fuzzy logic, automatic differentiation, computer hardware, operating systems, compiler construction, parallel processing, and software engineering are all essential. The major emphasis of the program is on applications. We will hear from many people who have used tools from validated computing to attack, and often solve, significant practical problems. Successful applications have included medical diagnosis and treatment, financial simulation, mechanical design, oil reservoir simulation, aeronautics, high energy particle accelerators, environmental engineering, chemical process simulation and control, computer graphics for motion picture special effects, astrophysics, and many more. Not all applications are as yet successful. We will also hear from people with challenging applications to which validated techniques have not yet been successfully applied. Hopefully, by encouraging experts in such applications to lay out their problems, we will foster long-term collaborations leading to significant advances in those fields. The workshop follows the SIAM Optimization meeting because global optimization is a major concern of both the optimization and the validated computing communities. By holding the meetings consecutively, we encourage validated computing researchers to become more involved in the wider optimization community, and we encourage people more interested in standard techniques of optimization to participate in interval discussions. We will have one special session and a conference banquet to honor Ray Moore. His 1966 book defined the field, he pioneered many applications, and he continues to contribute insights and papers. Most of the ideas in our interval algorithms of today directly trace their ancestry to Ray's 1966 and 1979 (from SIAM) books. In parallel with the traditional scientific program following SIAM's usual pattern of highlighted and contributed papers, we are considering half-day detailed workshops. Tentative topics include: 1. Jiri Rohn on complexity. This would follow up on his talk at SCAN 2000 in Karlsruhe "Finite Characterization of Some Linear Problems with Inexact Data." 2. Tutorial on validated techniques, interval arithmetic, and related tools. We would start at the beginning by defining directed rounding, and progress to a "Numerical Recipes" level view of several widely used algorithms, e.g., linear systems, interval Newton, global optimization, ordinary and partial differential equations. 3. Hands-on tools and demonstrations. Program Committee ----------------- R. Baker Kearfott University of Louisiana at Lafayette rbk [at] louisiana [dot] edu Vladik Kreinovich University of Texas at El Paso vladik [at] cs [dot] utep.edu George Corliss Marquette University George.Corliss [at] Marquette [dot] edu Weldon Lodwick University of Colorado at Denver wlodwick [at] carbon [dot] cudenver.edu Ken Jackson University of Toronto krj [at] cs [dot] toronto.edu Bill Walster Sun Microsystems Bill.Walster [at] eng [dot] sun.com ===================================================================== --------------------------------------------------------------- R. Baker Kearfott, rbk [at] louisiana [dot] edu (337) 482-5346 (fax) (337) 482-5270 (work) (337) 981-9744 (home) URL: http://interval.louisiana.edu/kearfott.html Department of Mathematics, University of Louisiana at Lafayette Box 4-1010, Lafayette, LA 70504-1010, USA --------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] louisiana.edu Sun Sep 30 13:57:10 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f8UIv9x00711 for reliable_computing-outgoing; Sun, 30 Sep 2001 13:57:09 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f8UIv4q00706 for ; Sun, 30 Sep 2001 13:57:04 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id f8UIv1x26255 for ; Sun, 30 Sep 2001 12:57:01 -0600 (MDT) Message-Id: <200109301857.f8UIv1x26255 [at] cs [dot] utep.edu> Date: Sun, 30 Sep 2001 12:57:00 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: a letter our students wrote to the local newspaper To: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: jvSjJOrpw1F7vVeTeMAq0w== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear Colleagues, I apologize for sending, to the interval mailing list, a letter that is somewhat off-topic for this list. This letter was send by our research students (many of whom are working on interval-related problems) to the local newspaper. I would like to share it with you, because, in my opinion, it nicely emphasizes the importance of scientific endeavor in general and interval computations in particular, not only to acquire more knowledge, but also to promote human understanding, tolerance, and good will. Vladik **************************************************************** Dear Friends, We are Computer Science students working with the Center for Theoretical Research and its Applications in Computer Science (TRACS) at the University of Texas at El Paso (http://tracs.cs.utep.edu) and alumni of this center. We are working on different projects related to satellite image processing, computer security, robotics, Artificial Intelligence, structural integrity of aerospace structures, neural networks, fuzzy logic, interval computations, quantum computing, and many other exciting areas. Our results have been published in international journals and in the proceedings of international conferences. Some of us had the opportunity to go and present these papers at the conferences in the USA and in countries around the world. Some of our alumni work for top companies (IBM, Nortel, etc.), some are professors at good universities (Texas Tech, New Mexico State University, ITESM (Mexico), University of Milan). We come from diverse backgrounds and cultures. Like probably most American universities, in addition to American students of different race and ethnicity, TRACS has had and still has students and faculty from all inhabitable continents: from North America (Mexico, Canada), from South America (Brazil, Colombia), from Africa (Nigeria), from Asia (China, India, Lebanon, Syria, Vietnam), from Australia, and from Europe (Bulgaria, Czech Republic, Germany, France, Italy, Montenegro, Poland, Portugal, Russia, Spain). In addition to the university, our financial support comes from NASA (via a multi-million Pan-American Center for Earth and Environmental Studies and several smaller grants), from the the National Science Foundation, from CONACYT (Mexican National Council for Science and Technology), from the United Space Alliance, and from many other agencies. We work on different projects, but we all work together. Several TRACS students from the USA have been working on grants from the National Security Agency related to detecting threatening messages in webpages. In this applications, they used algorithms developed by other students and faculty for more peaceful applications like geophysics-oriented satellite image processing. We work together, and we have fun together, even though we come from different cultural and religious backgrounds. Some of us are Christians, some Moslems, some Hindus, some Buddhists, some Jews. The local pizza place already knows that we need a lot of different toppings (veggie, without pork, etc.), to cater to different traditions. Working in TRACS and in other research groups is a great opportunity for us to use our potential, to bring our ideas together, to brainstorm. Our research not only benefits us, it helps in solving real-world problems ranging from computer security to Space Shuttle control. We are all different, we look differently, we eat different things, but we all work together on things that can benefit people all over the globe. Roberto Araiza, TRACS student coordinator Vick Alvarado, TRACS webmaster Jabel Morales, TRACS member, a Teaching Assistant and a student tutor with the Academic Center for Engineers and Scientists (ACES) Lakshmi Potluri, TRACS member, Computer Science student representative on the President's Women Advisory Council and 30 other TRACS students; Alessandro Provetti, TRACS alumnus, Professor at the University of Milan, Italy, and other TRACS alumni Mailing address: TRACS Center, Room 124 Department of Computer Science University of Texas at El Paso 500 W. University El Paso, TX 79968 emails: Roberto Araiza raraiza [at] cs [dot] utep.edu Vick Alvarado vick [at] cs [dot] utep.edu Jabel Moralez jabel [at] cs [dot] utep.edu Lakshmi Potluri lakshmi [at] cs [dot] utep.edu Alessandro Provetti provetti [at] gongolo [dot] usr.dsi.unimi.it Departmental phone number (915) 747-5480 From owner-reliable_computing [at] interval [dot] louisiana.edu Sun Sep 30 13:58:32 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f8UIwWx00798 for reliable_computing-outgoing; Sun, 30 Sep 2001 13:58:32 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f8UIwPq00793 for ; Sun, 30 Sep 2001 13:58:26 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id f8UIwNh26259; Sun, 30 Sep 2001 12:58:23 -0600 (MDT) Message-Id: <200109301858.f8UIwNh26259 [at] cs [dot] utep.edu> Date: Sun, 30 Sep 2001 12:58:22 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: CM-2002: First Announcement (re-sending) To: reliable_computing [at] interval [dot] louisiana.edu Cc: brumberg [at] quasar [dot] ipa.nw.ru MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: HKD6Y4+98H+ymCW+8/Bh+Q== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear Friends, * Since celestial mechanics was the first application area for Ray Moore, and * since there is a recent paper by Moore, Berz, and Hoefkens on the application of interval to celestial mechanics, and * since St. Petersburg has many interval folks, maybe we can organize an interest session there? What do you all think? Professor Brumberg sent me personally this email and I believe he would like us to participate. I am sending him a copy of this emails sent to the 400+ interval mailing list. Vladik ------------- Begin Forwarded Message ------------- X-Sender: brumberg [at] quasar [dot] ipa.nw.ru Date: Fri, 28 Sep 2001 20:46:46 +0400 To: "V.Ya.Kreinovich" International Workshop Celestial Mechanics -2002: Results and Prospects Institute of Applied Astronomy of Russian Academy of Sciences St. Petersburg, Russia, 10 -14 September 2002 First Announcement, September 2001 The Institute of Applied Astronomy (IPA) will hold a specialized celestial mechanics workshop "Celestial Mechanics - 2002: Results and Prospects" on 10-14 September 2002 in St.Petersburg. In the second half of the last century celestial mechanics survived a period of extensive development stimulated by new mathematical methods, space research, computer advances and rapid progress in the precision of astronomical observations. It seems reasonable to analyse the present state of art of celestial mechanics in anticipating new increase in the observation precision due to the future projects of space astrometry. This is one of the main motivations to arrange the proposed workshop. The organization of this workshop in IPA is to continue the tradition of the Institute of Theoretical Astronomy (ITA). After joining ITA to IPA the latter institute became the main scientific center in Russia designed for the elaboration and production of astronomical ephemerides. According to its title the scientific program of the workshop will cover the most various problems of celestial mechanics. The main attention will be focused on the following topics: 1) problems of celestial mechanics in the relativistic framework; 2) application of analytical and qualitative techniques in modern celestial mechanics; 3) models of the orbital motion and rotation of the solar system bodies adequate to high-precision observations; 4) high-precision astrometric observations for celestial mechanics purposes; 5) motion of the Earth's artificial satellites. The working languages of the workshop are Russian and English. Publication of abstracts and the workshop proceedings is planned in English. A very limited number of grants to facilitate the attendance of the workshop might be available. The preliminary registration form is given below. More details will be provided with the second announcement to be sent to those who return the attached preliminary registration form. The staff of the scientific organizing committee is as follows: Yu.V.Batrakov , IPA, St.Petersburg. T.V.Bordovitsyna, Tomsk University, Tomsk. P.Bretagnon, IMC, Paris, France. V.A.Brumberg - chairman, IPA, St.Petersburg. N.V.Emelianov, Sternberg Astronomical Institute, Moscow. S.Ferraz-Mello - co-chairman, University of Sao Paulo, Brazil. A.M.Finkelstein, IPA (director), St. Petersburg. T.Fukushima, NAO, Tokyo, Japan. G.Kaplan, USNO, Washington, USA. K.V.Kholshevnikov - vice-chairman, SPb University, St.Petersburg. G.A.Krasinsky, IPA, St.Petersburg. A.Milani, University of Pisa, Pisa, Italy. N.V.Shuigina - secretary, IPA, St.Petersburg. Contact address: N.V.Shuigina, CM-2002 SOC Secretary Institute of Applied Astronomy Kutuzov quay, 10, 191187 St.Petersburg, Russia fax: 7-812-275-1119 e-mail: nvf [at] quasar [dot] ipa.nw.ru Preliminary registration form International Workshop CM-2002 Institute of Applied Astronomy, St.Petersburg, Russia, 10-14 September 2002 Please complete and return this form to the SOC secretary by e-mail or fax not later than 15 November, 2001 Name: Institute: Address: Fax: E-mail: Topic of potential contribution: ------------- End Forwarded Message ------------- From owner-reliable_computing [at] interval [dot] louisiana.edu Sun Sep 30 17:01:50 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f8UM1op01184 for reliable_computing-outgoing; Sun, 30 Sep 2001 17:01:50 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f8UM1jq01179 for ; Sun, 30 Sep 2001 17:01:45 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.11.3/8.11.3) with SMTP id f8UM1gV26725; Sun, 30 Sep 2001 16:01:42 -0600 (MDT) Message-Id: <200109302201.f8UM1gV26725 [at] cs [dot] utep.edu> Date: Sun, 30 Sep 2001 16:01:42 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: Carol Walker selected as the 2001 Distinguished Alumna To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu Cc: hardy [at] nmsu [dot] edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: kPBzMvEREt2dsw+QXKWskw== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk CAROL WALKER SELECTED AS THE 2001 DISTINGUISHED ALUMNA The College of Arts and Sciences of the New Mexico State University has selected Carol Walker as the 2001 Distinguished Alumna. She has co-authored several textbooks and published many professional articles in different areas of algebra. In particular, since mid-1990s, one of her main areas of research is algebraic foundations of the theory and applications of interval-valued fuzzy sets. This is a research area closely related to interval computations, when a degree of confidence in an expert statement is represented by a subinterval of the interval [0,1], and logical operations transform intervals into intervals. Carol is one of the world leading specialists in this area. Her main related publications are: Mai Gehrke, Carol Walker, Elbert Walker, "A note on negations and nilpotent t-norms", International Journal of Approximate Reasoning, Volume 21 (1999) pages 137-155 Mai Gehrke, Carol Walker, Elbert Walker, "Algebraic aspects of fuzzy sets and fuzzy logic", Proceedings of the Workshop on Current Trends and Developments in Fuzzy Logic, Aristotle University of Thessaloniki, Greece, October 16-20, 1998 (1999) pages 101-170 Mai Gehrke, Carol Walker, Elbert Walker, "A mathematical setting for fuzzy logics", International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, Volume 5 (1997) pages 223-238 Mai Gehrke, Carol Walker, Elbert Walker, "Some comments on interval-valued fuzzy sets", International Journal of Intelligent Systems, Volume 11 (1996) pages 751-759 For more details, please visit her webpage at http://www.math.nmsu.edu/~hardy/ Congratulations to Carol! From owner-reliable_computing [at] interval [dot] louisiana.edu Sun Sep 30 19:03:35 2001 Received: (from root@localhost) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) id f9103YO01483 for reliable_computing-outgoing; Sun, 30 Sep 2001 19:03:34 -0500 (CDT) Received: from clmboh1-smtp3.columbus.rr.com (clmboh1-smtp3.columbus.rr.com [65.24.0.112]) by interval.louisiana.edu (8.11.3/8.11.3/ull-interval-math-majordomo-1.2) with ESMTP id f9103Pq01477 for ; Sun, 30 Sep 2001 19:03:26 -0500 (CDT) Received: from oemcomputer (dhcp065-024-174-102.columbus.rr.com [65.24.174.102]) by clmboh1-smtp3.columbus.rr.com (8.11.2/8.11.2) with SMTP id f8UNxKR14033; Sun, 30 Sep 2001 19:59:21 -0400 (EDT) Message-ID: <000601c14a0c$13139d00$66ae1841 [at] columbus [dot] rr.com> From: "Ramon Moore" To: "Vladik Kreinovich" Cc: References: <200109302201.f8UM1gV26725 [at] cs [dot] utep.edu> Subject: Re: Carol Walker selected as the 2001 Distinguished Alumna Date: Sun, 30 Sep 2001 20:00:25 -0400 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 5.50.4133.2400 X-MimeOLE: Produced By Microsoft MimeOLE V5.50.4133.2400 Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Vladik, thanks for telling us about this remarkable human being. I visited her web pages at http://www.math.nmsu.edu/~hardy/ Wow ! Ramon Moore ----- Original Message ----- From: "Vladik Kreinovich" To: ; Cc: Sent: Sunday, September 30, 2001 6:01 PM Subject: Carol Walker selected as the 2001 Distinguished Alumna > CAROL WALKER SELECTED AS THE 2001 DISTINGUISHED ALUMNA > > The College of Arts and Sciences of the New Mexico State University > has selected Carol Walker as the 2001 Distinguished Alumna. > She has co-authored several textbooks and published many professional > articles in different areas of algebra. In particular, since > mid-1990s, one of her main areas of research is algebraic foundations > of the theory and applications of interval-valued fuzzy sets. This is > a research area closely related to interval computations, when a degree of > confidence in an expert statement is represented by a subinterval of > the interval [0,1], and logical operations transform intervals into > intervals. > > Carol is one of the world leading specialists in this area. > Her main related publications are: > > Mai Gehrke, Carol Walker, Elbert Walker, > "A note on negations and nilpotent t-norms", > International Journal of Approximate Reasoning, > Volume 21 (1999) pages 137-155 > > Mai Gehrke, Carol Walker, Elbert Walker, > "Algebraic aspects of fuzzy sets and fuzzy logic", > Proceedings of the Workshop on Current Trends and Developments in > Fuzzy Logic, Aristotle University of Thessaloniki, Greece, > October 16-20, 1998 (1999) pages 101-170 > > Mai Gehrke, Carol Walker, Elbert Walker, > "A mathematical setting for fuzzy logics", > International Journal of Uncertainty, Fuzziness and Knowledge-Based > Systems, Volume 5 (1997) pages 223-238 > > Mai Gehrke, Carol Walker, Elbert Walker, > "Some comments on interval-valued fuzzy sets", > International Journal of Intelligent Systems, > Volume 11 (1996) pages 751-759 > > For more details, please visit her webpage at > http://www.math.nmsu.edu/~hardy/ > > Congratulations to Carol! > > > > > > > >