From owner-reliable_computing [at] interval [dot] louisiana.edu Fri Jul 1 13:55:25 2005 Received: from interval.louisiana.edu (daemon@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j61ItOaw028736 for ; Fri, 1 Jul 2005 13:55:24 -0500 (CDT) Received: (from daemon@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j61ItOes028735 for reliable_computing-outgoing; Fri, 1 Jul 2005 13:55:24 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j61ItGbj028731 for ; Fri, 1 Jul 2005 13:55:21 -0500 (CDT) Received: from aragorn (aragorn [129.108.5.35]) by cs.utep.edu (8.11.7/8.11.7) with SMTP id j61IsJ520204; Fri, 1 Jul 2005 12:54:29 -0600 (MDT) Message-Id: <200507011854.j61IsJ520204 [at] cs [dot] utep.edu> Date: Fri, 1 Jul 2005 12:54:29 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: conference of interest to interval researchers To: reliable_computing [at] interval [dot] louisiana.edu Cc: an [at] ifel [dot] ru MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: /xvCqmRNxTGH4ZYPWI0B+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, This conference may be of interest to our community. At a similar 2004 conference, interval mathematics was one of the topics of interest, and it will be one of the topis of interest at this conference as well. Vladik ************************************************************************ http://fsscef.narod.ru/index.html International Conference on Fuzzy Sets and Soft Computing in Economics and Finance FSSCEF'06 June 25-28, 2006, St. Petersburg, Russia Call for Papers will be issued ASAP Contact person: Dr. Alexey Nedosekin, an [at] ifel [dot] ru ------------- End Forwarded Message ------------- From owner-reliable_computing [at] interval [dot] louisiana.edu Fri Jul 1 17:20:41 2005 Received: from interval.louisiana.edu (daemon@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j61MKfwd028924 for ; Fri, 1 Jul 2005 17:20:41 -0500 (CDT) Received: (from daemon@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j61MKfEn028923 for reliable_computing-outgoing; Fri, 1 Jul 2005 17:20:41 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j61MKWtV028919 for ; Fri, 1 Jul 2005 17:20:38 -0500 (CDT) Received: from aragorn (aragorn [129.108.5.35]) by cs.utep.edu (8.11.7/8.11.7) with SMTP id j61MJjh21534; Fri, 1 Jul 2005 16:19:55 -0600 (MDT) Message-Id: <200507012219.j61MJjh21534 [at] cs [dot] utep.edu> Date: Fri, 1 Jul 2005 16:19:57 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: Re: GAMM Conference on Optimization Under Uncertainties COUCH'05, Heidelberg, Germany, September 28-30, 2005 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: dJnVjH6LZ3A1Ep8etuL4Ug== 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, I am forwarding an email from Dr. Kostina, the organizer of GAMM Conference on Optimization Under Uncertainties COUCH'05, Heidelberg, Germany, September 28-30, 2005, http://couch2005.uni-hd.de/ She will welcome an interval session if there is enough interest. Please do not hesitate to contact her if you are interested. Vladik P.S. I myself will most probably not be able to attend. ------------- Begin Forwarded Message ------------- From: Ekaterina Kostina ... would you consider a session with 4-6 speakers on interval computations at the conference? ekaterina ------------- End Forwarded Message ------------- From owner-reliable_computing [at] interval [dot] louisiana.edu Mon Jul 4 14:11:46 2005 Received: from interval.louisiana.edu (daemon@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j64JBjef006484 for ; Mon, 4 Jul 2005 14:11:45 -0500 (CDT) Received: (from daemon@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j64JBjj1006483 for reliable_computing-outgoing; Mon, 4 Jul 2005 14:11:45 -0500 (CDT) Received: from interval.louisiana.edu (rbk5287@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j64JBfeE006479 for ; Mon, 4 Jul 2005 14:11:41 -0500 (CDT) Received: (from rbk5287@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j64JBeeg006478 for reliable_computing [at] interval [dot] louisiana.edu; Mon, 4 Jul 2005 14:11:40 -0500 (CDT) Received: from lcyoung.math.wisc.edu (lcyoung.math.wisc.edu [144.92.166.90]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j63JM0PB003924 for ; Sun, 3 Jul 2005 14:22:06 -0500 (CDT) Received: from erdos.math.wisc.edu (erdos.math.wisc.edu [144.92.166.25]) by lcyoung.math.wisc.edu (8.11.7/8.11.7) with ESMTP id j63JCmw22737; Sun, 3 Jul 2005 14:12:48 -0500 (CDT) Date: Sun, 3 Jul 2005 14:12:44 -0500 (CDT) From: Hans Schneider To: NETS -- at-net , E-LETTER , Pradeep Misra , Shaun Fallat , "na.digest" , ipnet-digest [at] math [dot] msu.edu, Michael.Unser [at] epfl [dot] ch, SIAGLA-DIGEST , hjt [at] eos [dot] ncsu.edu, SMBnet [at] smb [dot] org, vkm [at] eedsp [dot] gatech.edu, reliable_computing [at] interval [dot] louisiana.edu Subject: LAA contents Message-ID: MIME-Version: 1.0 Content-Type: MULTIPART/MIXED; BOUNDARY="1552947622-282390194-1120417964=:19731" X-UWMath-MailScanner: Found to be clean Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk This message is in MIME format. The first part should be readable text, while the remaining parts are likely unreadable without MIME-aware tools. --1552947622-282390194-1120417964=:19731 Content-Type: TEXT/PLAIN; charset=iso-8859-1; format=flowed Content-Transfer-Encoding: QUOTED-PRINTABLE * Linear Algebra and its Applications Volume 405, Pages 1-328 (1 August 2005) http://www.sciencedirect.com/science/issue/5653-2005-995949999-600626 TABLE OF CONTENTS 1) Editorial board Pages ii-iii 2) Eigenstructure of order-one-quasiseparable matrices. Three-term and two-= term recurrence relations Pages 1-40 Y. Eidelman, I. Gohberg and Vadim Olshevsky 3) A limit result concerning the QR factorization of banded Toeplitz matric= es Pages 41-44 Samir Karaa 4) Ordering trees by their Laplacian spectral radii Pages 45-59 Aimei Yu, Mei Lu and Feng Tian 5) Eigenvalues of Hadamard powers of large symmetric Pascal matrices Pages 60-66 Ashkan Ashrafi and Peter M. Gibson 6) On semigroups of matrices with eigenvalue 1 in small dimensions Pages 67-73 Janez Bernik and Jan Okni=FF=FFski 7) When are dynamic and static feedback equivalent? Pages 74-82 J.A. Hermida Alonso, M.M. L=F3pez-Cabeceira and M.T. Trobajo 8) Tensor algebras and displacement structure. IV. Invariant kernels Pages 83-103 T. Banks, T. Constantinescu and Nermine El-Sissi 9) On some perfect codes with respect to Lee metric Pages 104-120 Sapna Jain, Ki-Bong Nam and Ki-Suk Lee 10) Feedback invariants of matrices with prescribed rows Pages 121-154 Marija Dodig 11) Involutions in incidence algebras Pages 155-162 E. Spiegel 12) A construction technique for generalized complex orthogonal designs and= applications to wireless communications Pages 163-176 Jennifer Seberry, Sarah A. Spence and Tadeusz A. Wysocki 13) -Aluthge transforms and Schatten ideals Pages 177-199 Jorge Antezana, Pedro Massey and Demetrio Stojanoff 14) Fundamental gaps of numerical semigroups generated by two elements Pages 200-208 J.C. Rosales 15) Stability of polytopes of matrices via affine parameter-dependent Lyapu= nov functions: Asymptotically exact LMI conditions Pages 209-228 Ricardo C.L.F. Oliveira and Pedro L.D. Peres 16) Weyl=FF=FFs theorem for analytically hyponormal operators Pages 229-238 Xiaohong Cao 17) On factor width and symmetric H -matrices Pages 239-248 Erik G. Boman, Doron Chen, Ojas Parekh and Sivan Toledo 18) The isometries of certain maximum norms Pages 249-263 Boris Lavri=FF=FF 19) Numerical computation of minimal polynomial bases: A generalized result= ant approach Pages 264-278 E.N. Antoniou, A.I.G. Vardulakis and S. Vologiannidis 20) Steinberg unitary Leibniz algebras Pages 279-303 Dong Liu and Naihong Hu 21) A geometric estimate on the norm of product of functionals Pages 304-310 M=E1t=E9 Matolcsi 22) Adjacency preserving maps on the space of symmetric operators Pages 311-324 Runling An, Jinchuan Hou and Liankuo Zhao 23) Special Issue devoted to papers presented at the Aveiro Workshop on=20 Graph Spectra, 10-12 April 2006 Page 325 24) Author index Pages 327-328 --1552947622-282390194-1120417964=:19731-- From owner-reliable_computing [at] interval [dot] louisiana.edu Tue Jul 5 07:32:01 2005 Received: from interval.louisiana.edu (daemon@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j65CW1hm008049 for ; Tue, 5 Jul 2005 07:32:01 -0500 (CDT) Received: (from daemon@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j65CW0fK008048 for reliable_computing-outgoing; Tue, 5 Jul 2005 07:32:00 -0500 (CDT) Received: from sunshine.math.utah.edu (IDENT:zCt2owvYljLA9rN90vluw3Ms4DaVugwb [at] sunshine [dot] math.utah.edu [128.110.198.2]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j65CVlPB008044 for ; Tue, 5 Jul 2005 07:31:57 -0500 (CDT) Received: from psi.math.utah.edu (IDENT:qRC2spCDTtZTQ+/lCpus52URtgSeJ4Km [at] psi [dot] math.utah.edu [155.101.96.19]) by sunshine.math.utah.edu (8.13.4/8.13.4) with ESMTP id j65CVgt6014343; Tue, 5 Jul 2005 06:31:42 -0600 (MDT) Received: from psi.math.utah.edu (IDENT:BW+4f221qENvT1XheqnwSjf9HwSttm8b@localhost [127.0.0.1]) by psi.math.utah.edu (8.13.4/8.13.4) with ESMTP id j65CVfrd029726; Tue, 5 Jul 2005 06:31:41 -0600 (MDT) Received: (from beebe@localhost) by psi.math.utah.edu (8.13.4/8.13.4/Submit) id j65CVfnx029725; Tue, 5 Jul 2005 06:31:41 -0600 (MDT) Date: Tue, 5 Jul 2005 06:31:41 -0600 (MDT) From: "Nelson H. F. Beebe" To: reliable_computing [at] interval [dot] louisiana.edu Cc: beebe [at] math [dot] utah.edu X-US-Mail: "Department of Mathematics, 110 LCB, University of Utah, 155 S 1400 E RM 233, Salt Lake City, UT 84112-0090, USA" X-Telephone: +1 801 581 5254 X-FAX: +1 801 585 1640, +1 801 581 4148 X-URL: http://www.math.utah.edu/~beebe Subject: New paper using interval analysis for plotting of 2-D curves Message-ID: X-Greylist: Sender IP whitelisted, not delayed by milter-greylist-2.0 (sunshine.math.utah.edu [128.110.198.2]); Tue, 05 Jul 2005 06:31:42 -0600 (MDT) Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk This new paper may be of interest to some list readers; the DOI and URL address lead to fulltext, which may or may not be accessible to you, depending on whether your institution is a journal subscriber: @String{j-INT-J-IMAGE-GRAPHICS = "International Journal of Image and Graphics (IJIG)"} @Article{Ratschek:2005:SHM, author = "Helmut Ratschek and Jon Rokne", title = "{SCCI}-Hybrid Methods for {$2$D} Curve Tracing", journal = j-INT-J-IMAGE-GRAPHICS, volume = "5", number = "3", pages = "447--479", month = jul, year = "2005", CODEN = "????", DOI = "http://dx.doi.org/10.1142/S0219467805001859", ISSN = "0219-4678", bibdate = "Tue Jul 5 06:13:03 MDT 2005", bibsource = "http://ejournals.wspc.com.sg/ijig/ijig.shtml", URL = "http://ejournals.wspc.com.sg/ijig/05/preserved-docs/0503/S0219467805001859.pdf", abstract = "A hybrid method for plotting 2-dimensional curves, defined implicitly by equations of the form f(x,y) = 0 is presented. The method is extremely robust and reliable and consists of Space Covering techniques, Continuation principles and Interval analysis (i.e. SCCI). The space covering, based on iterated subdivision, guarantees that no curve branches or isolated curve parts or even points are lost (which can happen if grid methods are used). The continuation method is initiated in a subarea as soon as it is proven that the subarea contains only one smooth curve. Such a subarea does not need to be subdivided further so that the computation is accelerated as far as possible with respect to the subdivision process. The novelty of the SCCI-hybrid method is the intense use of the implicit function theorem for controlling the steps of the method. Although the implicit function theorem has a rather local nature, it is empowered with global properties by evaluating it in an interval environment. This means that the theorem can provide global information about the curve in a subarea such as existence, non-existence, uniqueness of the curve or even the presence of singular points. The information gained allows the above-mentioned control of the subarea and the decision of its further processing, i.e. deleting it, subdividing it, switching to the continuation method or preparing the plotting of the curve in this subarea. The curves can be processed mathematically in such a manner, that the derivation of the plotted curve from the exact curve is as small as desired (modulo the screen resolution).", acknowledgement = ack-nhfb, keywords = "SCCI (Space Covering techniques, Continuation principles and Interval analysis)", } ------------------------------------------------------------------------------- - Nelson H. F. Beebe Tel: +1 801 581 5254 - - University of Utah FAX: +1 801 581 4148 - - Department of Mathematics, 110 LCB Internet e-mail: beebe [at] math [dot] utah.edu - - 155 S 1400 E RM 233 beebe [at] acm [dot] org beebe [at] computer [dot] org - - Salt Lake City, UT 84112-0090, USA URL: http://www.math.utah.edu/~beebe - ------------------------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] louisiana.edu Tue Jul 5 11:05:01 2005 Received: from interval.louisiana.edu (daemon@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j65G51EN008356 for ; Tue, 5 Jul 2005 11:05:01 -0500 (CDT) Received: (from daemon@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j65G5100008355 for reliable_computing-outgoing; Tue, 5 Jul 2005 11:05:01 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j65G4qhu008351 for ; Tue, 5 Jul 2005 11:04:58 -0500 (CDT) Received: from aragorn (aragorn [129.108.5.35]) by cs.utep.edu (8.11.7/8.11.7) with SMTP id j65G3na15888; Tue, 5 Jul 2005 10:03:59 -0600 (MDT) Message-Id: <200507051603.j65G3na15888 [at] cs [dot] utep.edu> Date: Tue, 5 Jul 2005 10:04:03 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: PARA06, June 18-21, 2006, Umea, SWEDEN To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu Cc: jw [at] imm [dot] dtu.dk MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: bd7cMJwRKuMnup4ElxBiRw== 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, Forwarding. Last PARA conference had a large interval session, we may want to have aone at this conference as well. Vladik ------------- Begin Forwarded Message ------------- Mailing-List: contact para-l-help [at] net [dot] uni-c.dk; run by ezmlm Delivered-To: mailing list para-l [at] net [dot] uni-c.dk Date: Tue, 5 Jul 2005 16:02:57 +0200 (METDST) From: Jerzy Wasniewski To: para-l [at] net [dot] uni-c.dk Subject: PARA06, June 18-21, 2006, Umea, SWEDEN MIME-Version: 1.0 PARA06 WORKSHOP ON STATE-OF-THE-ART IN SCIENTIFIC AND PARALLEL COMPUTING June 18-21, 2006 First Announcement ------------------------------------------------- ORGANIZERS: Bo Kagstrom (Chairman), Umea University, Sweden Erik Elmroth (Coordinator), Umea University, Sweden Jack Dongarra, Univ. of Tennessee and Oak Ridge Nat. Lab., USA Jerzy Wasniewski, Technical University of Denmark DATES: June 18, 2006: Tutorial (topics to be announced) June 19-21, 2006: PARA06 Workshop sessions PLACE: Umea University, SE-901 87 Umea, SWEDEN SCOPE: The main theme of PARA06 is State of the Art in Scientific and Parallel Computing. Interesting topics include (but are not restricted to) algorithms, software, tools, environments as well as applications for Scientific Computing, High Performance Computing, Parallel Computing, Grid Computing, and Interactive Visualization. Key lectures, topical minisymposia, a limited number of contributed talks, and poster sessions will be selected for the workshop. DEADLINES: Extended abstracts (at most 4 pages): January 31, 2006 Notification of acceptance: March 15, 2006 The PARA06 Workshop: June 18-21, 2006 Proceedings papers (at most 10 pages): September 15, 2006 CONFERENCE PROCEEDINGS: The extended abstracts will be handed out at the beginning of the workshop. After the workshop, full papers will be included (after peer-reviewing) in the workshop proceedings, published in the Springer Verlag series Lecture Notes in Computer Science (LNCS). FURTHER INFORMATION: The PARA06 URL: http://www.hpc2n.umu.se/para06/ will successively be updated. It will contain all the necessary information. The extra announcements will, from time to time, be distributed by the para-l mailing list. Mailing list: To subscribe, send a dummy message to para-l-subscribe [at] net [dot] uni-c.dk To discontinue, send a dummy message to para-l-unsubscribe [at] net [dot] uni-c.dk Inquiries: PARA06, HPC2N, MIT-huset SE-901 87 Umea, SWEDEN Attn: Lena Hellman Email: para06 [at] hpc2n [dot] umu.se Tel: +46 (0)90 786 7666 Fax: +46 (0)90 786 6126 SOCIAL EVENTS: A reception June 18 and a conference dinner on June 20 are planned. Social activities for accompanying persons will be offered. ------------- End Forwarded Message ------------- From owner-reliable_computing [at] interval [dot] louisiana.edu Tue Jul 5 10:59:51 2005 Received: from interval.louisiana.edu (daemon@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j65Fxplb008339 for ; Tue, 5 Jul 2005 10:59:51 -0500 (CDT) Received: (from daemon@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j65Fxp3k008338 for reliable_computing-outgoing; Tue, 5 Jul 2005 10:59:51 -0500 (CDT) Received: from sunshine.math.utah.edu (IDENT:dOP3gBODysOauhnFrS/LLwR5IODTSuMm [at] sunshine [dot] math.utah.edu [128.110.198.2]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j65FxbpE008334 for ; Tue, 5 Jul 2005 10:59:48 -0500 (CDT) Received: from psi.math.utah.edu (IDENT:Aku8WdPkQK5GQaz8UunM1jpIgBUCBpXs [at] psi [dot] math.utah.edu [155.101.96.19]) by sunshine.math.utah.edu (8.13.4/8.13.4) with ESMTP id j65FxXBn021990; Tue, 5 Jul 2005 09:59:33 -0600 (MDT) Received: from psi.math.utah.edu (IDENT:SDVKBUK6bHsb6YNNWyY1KIteYd+i+8Ju@localhost [127.0.0.1]) by psi.math.utah.edu (8.13.4/8.13.4) with ESMTP id j65FxXtX008919; Tue, 5 Jul 2005 09:59:33 -0600 (MDT) Received: (from beebe@localhost) by psi.math.utah.edu (8.13.4/8.13.4/Submit) id j65FxWGQ008917; Tue, 5 Jul 2005 09:59:32 -0600 (MDT) Date: Tue, 5 Jul 2005 09:59:32 -0600 (MDT) From: "Nelson H. F. Beebe" To: reliable_computing [at] interval [dot] louisiana.edu Cc: beebe [at] math [dot] utah.edu X-US-Mail: "Department of Mathematics, 110 LCB, University of Utah, 155 S 1400 E RM 233, Salt Lake City, UT 84112-0090, USA" X-Telephone: +1 801 581 5254 X-FAX: +1 801 585 1640, +1 801 581 4148 X-URL: http://www.math.utah.edu/~beebe Subject: Another new paper on interval analysis Message-ID: X-Greylist: Sender IP whitelisted, not delayed by milter-greylist-2.0 (sunshine.math.utah.edu [128.110.198.2]); Tue, 05 Jul 2005 09:59:33 -0600 (MDT) Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk This new paper may be of interest to some list readers; the DOI and URL address may allow you to retrieve a PDF file of the article: @String{j-COMPUTING = "Computing"} @Article{Verdonk:2005:BSI, author = "B. Verdonk and J. Vervloet and A. Cuyt", title = "Blending Set and Interval Arithmetic for Maximal Reliability", journal = j-COMPUTING, volume = "74", number = "1", pages = "41--65", month = feb, year = "2005", CODEN = "CMPTA2", DOI = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/s00607-004-0090-2", ISSN = "0010-485X (print), 1436-5057 (electronic)", bibdate = "Tue Jul 5 09:25:15 MDT 2005", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0010-485X&volume=74&issue=1", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0010-485X&volume=74&issue=1&spage=41", abstract = "In both [3] and [8], the authors review the implementation of the basic operations in interval arithmetic, and in particular discuss the different approaches given in the literature for interval division when the divisor interval contains zero. In these papers, and in the references therein, the basic operations are defined for real or extended real interval operands.\par Division by an interval containing zero is a special case of an interval function for which the input arguments contain points outside the domain of the underlying point function. A number of approaches exist in the literature, [7], [12], to remove restrictions on the domain of interval functions and hence obtain a closed, exception-free interval system.\par In this paper, we present an alternative approach to remove restrictions on the domain of interval functions and to guarantee the inclusion property in all situations, even when some input intervals contain points that lie outside the domain of the underlying point function. To achieve this, we allow for the (efficient) set-based representation of non-real results. The computed intervals are sharp, yet contain more information and the resulting interval system is closed and exception-free. We also show how the presented ideas can be implemented in an interval arithmetic library. The performance overhead is negligible compared to the fact that the implementation using the new approach offers 100\% reliability in return.\par The structure of the paper is as follows. We set off with a motivating example in Sect. 1. In Sect. 2, we review various approaches to interval division and then introduce vset-division of real intervals, based on the newly introduced concept of value set or vset. In Sect. 3, we give a formal definition of real vset-intervals and arithmetic on these intervals. We prove a number of essential properties and point out the likenesses and differences with other approaches. Finally, in Sect. 4, we discuss the implementation of vset-interval arithmetic in a floating-point context.", acknowledgement = ack-nhfb, keywords = "Interval arithmetic; inclusion property", } ------------------------------------------------------------------------------- - Nelson H. F. Beebe Tel: +1 801 581 5254 - - University of Utah FAX: +1 801 581 4148 - - Department of Mathematics, 110 LCB Internet e-mail: beebe [at] math [dot] utah.edu - - 155 S 1400 E RM 233 beebe [at] acm [dot] org beebe [at] computer [dot] org - - Salt Lake City, UT 84112-0090, USA URL: http://www.math.utah.edu/~beebe - ------------------------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] louisiana.edu Thu Jul 7 10:23:40 2005 Received: from interval.louisiana.edu (daemon@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j67FNeV4012591 for ; Thu, 7 Jul 2005 10:23:40 -0500 (CDT) Received: (from daemon@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j67FNdkT012590 for reliable_computing-outgoing; Thu, 7 Jul 2005 10:23:39 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j67FNVNf012586 for ; Thu, 7 Jul 2005 10:23:37 -0500 (CDT) Received: from aragorn (aragorn [129.108.5.35]) by cs.utep.edu (8.11.7/8.11.7) with SMTP id j67FMKR02578; Thu, 7 Jul 2005 09:22:30 -0600 (MDT) Message-Id: <200507071522.j67FMKR02578 [at] cs [dot] utep.edu> Date: Thu, 7 Jul 2005 09:22:36 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: summer school of interest to interval researchers and practitioners To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu Cc: isabelle.braems [at] lemhe [dot] u-psud.fr MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: wV+ooso1fMesAXsS6s0H3Q== 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 Forwarding. Vladik ******************************************************** Grenoble Control Summer School GUARANTEED SET COMPUTATION, WITH APPLICATIONS IN IDENTIFICATION, OBSERVATION, CONTROL AND ROBOTICS 12-16 September 2005, Grenoble, France Scientific coordinators : Luc JAULIN - Eric WALTER Laboratoire E3I2 - ENSIETA - Brest Laboratoire des Signaux et Systemes CNRS - SUPELEC - Univ. Paris-Sud XI - Gif-sur-Yvette Program 1st day Set computation Set theory. Computing with ellipsoids, with intervals and subpavings. Inclusion functions. Contractors and constraint propagation. Practical work. 2nd day Set solvers Computing direct images of sets. Computing reciprocal images of sets. Solving linear and nonlinear sets of equations. Global optimisation (including minimax). Integrating differential equations. Practical work. 3rd day Set estimation Estimating parameters (via the minimization of a cost function or, in a bounded-error context, by ellipsoids or by subpavings). Estimating state variables by set filtering in a bounded-error context (by ellipsoids or by subpavings). State estimation via constraint propagation. Joint parameter and state estimation Practical work. 4th day Robust control Analysing the stability of uncertain systems. Computing stability domains and margins. Delay systems. Designing robust controllers. Practical work. 5th day Complements Guaranteed computation with floating point numbers. Automatic differentiation. 5th day Robotics Computing all possible configurations of a Stewart-Gough platform. Calibrating robots. Localization and tracking of a vehicle from distance measurements. Trajectory planning. SIG Calcul ensembliste of the GdR MACS. Assessment of the summer school. Main speakers Laurent GRANVILLIERS, Associate Professor, Universite de Nantes Luc JAULIN , Professor, ENSIETA, Brest Michel KIEFFER, Associate Professor, Universite Paris-Sud XI, Orsay Suzanne LESECQ, Associate Professor, Universite Joseph Fourier, Grenoble Nacim RAMDANI, Associate Professor, Universite Paris XII, Creteil Eric WALTER, Directeur de Recherche at CNRS Person in charge of the Grenoble Summer Schools Alina Voda Laboratoire d'Automatique de Grenoble, INPG, ENSIEG, Grenoble Audience Firstly, those in control who want to learn and use set computation and especially interval computation. Secondly, computer scientists and interval analysis who are interested by control as an application field for the techniques and solvers that they develop. Prerequisite Basic knowledge of control (transfer function, state space representation, mathematics (set theory, matrix computation) and scientific computing (MATLAB). Organisation The course will consist of a series of talks and opportunities to practice on computers (mainly in MATLAB, but those interested may also learn how to use a C++ library for interval computation). Each participant will receive the book Applied Interval Analysis by L. Jaulin, M . Kieffer, O. Didrit and E. Walter (Springer, London, 2001), copies of the talks and non commercial software will also be provided. Registration Please contact Mrs. Marie-Therese DESCOTES-GENON Laboratoire d'Automatique de Grenoble, B.P. 46, 38402 - Saint-Martin-d'Heres-cedex - France Tel : 33(0)4.76.82.62.44 , Fax : 33(0)4.76.82.63.88 Email : Marie-Therese.Descotes-Genon [at] inpg [dot] fr Web : http://ecole-ete-auto.lag.ensieg.inpg.fr/index_uk.html Registration fees (in Euros) Industry 780 CNRS free Academia 450 Students 230 (includes five lunches, the documentation and the welcome cocktail) Venue The 2005 edition will take place at the Ecole Nationale Superieure d'Ingenieurs Electriciens de Grenoble (in the Institut National Polytechnique de Grenoble), rue de la Houille Blanche - Domaine Universitaire - Saint-Martin-d'Heres - Isere (15 minutes from Grenoble center by tramway). Transportation Three hours from Paris by train. The most convenient airports for arrival are Lyon St-Exupery and Grenoble St-Geoirs. From owner-reliable_computing [at] interval [dot] louisiana.edu Mon Jul 11 06:34:51 2005 Received: from interval.louisiana.edu (daemon@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6BBYoBc025078 for ; Mon, 11 Jul 2005 06:34:50 -0500 (CDT) Received: (from daemon@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j6BBYoAd025077 for reliable_computing-outgoing; Mon, 11 Jul 2005 06:34:50 -0500 (CDT) Received: from interval.louisiana.edu (rbk5287@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6BBYYTc025073 for ; Mon, 11 Jul 2005 06:34:34 -0500 (CDT) Received: (from rbk5287@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j6BBYYNK025072 for reliable_computing [at] interval [dot] louisiana.edu; Mon, 11 Jul 2005 06:34:34 -0500 (CDT) Received: from pandora.cs.kun.nl (root [at] pandora [dot] cs.kun.nl [131.174.33.4]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j66BFEnu010136 for ; Wed, 6 Jul 2005 06:15:21 -0500 (CDT) Received: from n032176.cs.kun.nl [131.174.32.176] (helo=n032176.cs.kun.nl) by pandora.cs.kun.nl (8.12.10/5.2) with ESMTP id j66BEIIS015908; Wed, 6 Jul 2005 13:14:18 +0200 (MEST) From: Bas Spitters Subject: CfP: Workshop: Constructive analysis, types and exact real numbers User-Agent: KMail/1.7.2 To: coq-club [at] pauillac [dot] inria.fr, TYPES , Map [at] mozart [dot] ujf-grenoble.fr, fom [at] cs [dot] nyu.edu, isabelle-users [at] cl [dot] cam.ac.uk, cca-list@fernuni-hagen.de, coalgebras [at] iti [dot] cs.tu-bs.de, comprox [at] doc [dot] ic.ac.uk, reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Disposition: inline X-UID: 4503 X-Length: 3530 Date: Wed, 6 Jul 2005 13:13:31 +0200 Message-Id: <200507061312.42108.B.Spitters [at] cs [dot] ru.nl> Content-Type: text/plain; charset="iso-8859-1" X-Spam-Score: -1.665 () BAYES_00 X-Scanned-By: MIMEDefang 2.48 on 131.174.33.4 Content-Transfer-Encoding: 8bit X-MIME-Autoconverted: from quoted-printable to 8bit by interval.louisiana.edu id j66BFMnu010138 Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Call for presentations/ participation: Small TYPES workshop "Constructive analysis, types and exact real numbers." 3/4 October 2005 Nijmegen, the Netherlands Deadline for registration: September 1st 2005. * Call for Papers: Special issue of Mathematical structures in computer science. * Call for Participation: Many digits competition for exact real arithmetic ============================================================ The workshop will be held at the campus of the Radboud University Nijmegen (formerly known as University of Nijmegen or Catholic University of Nijmegen). This workshop is part of the TYPES project (http://www.cs.chalmers.se/Cs/Research/Logic/Types/) Topics include, but are not limited to: * the development of constructive analysis in type theory * program extraction from such developments * exact real number computation * co-inductive methods for continuous structures * semantics for real computations (e.g. domain theory, formal topology) Invited speakers: Martín Escardó and Norbert Müller Homepage: http://www.cs.ru.nl/fnds/typesreal/ Deadline for registration: September 1st 2005. Organizers: Herman Geuvers Nicole Messink Milad Niqui Bas Spitters Freek Wiedijk ========================================================== Special issue of Mathematical Structures in Computer Science There will be a special issue of the MSCS on the topic of the workshop. The proceedings will, of course, be fully refereed according to the standards of MSCS. Submission is not limited to the participants of the workshop. Schedule: 1 December 2005 Deadline for submission 1 April 2006 Notification of acceptance 1 June 2006 The final versions of the papers are due. Guest editors: Herman Geuvers Milad Niqui Bas Spitters Freek Wiedijk Please contact Bas Spitters (spitters [at] cs [dot] ru.nl) if you need more information. ========================================================== The "many digits" friendly competition on exact real arithmetic will be held in conjunction with the above mentioned workshop. See http://www.cs.ru.nl/~milad/manydigits/ for more information. From owner-reliable_computing [at] interval [dot] louisiana.edu Mon Jul 11 06:34:06 2005 Received: from interval.louisiana.edu (daemon@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6BBY6sY025057 for ; Mon, 11 Jul 2005 06:34:06 -0500 (CDT) Received: (from daemon@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j6BBY6Mn025056 for reliable_computing-outgoing; Mon, 11 Jul 2005 06:34:06 -0500 (CDT) Received: from interval.louisiana.edu (rbk5287@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6BBY3R6025051 for ; Mon, 11 Jul 2005 06:34:03 -0500 (CDT) Received: (from rbk5287@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j6BBY3vq025050 for reliable_computing [at] interval [dot] louisiana.edu; Mon, 11 Jul 2005 06:34:03 -0500 (CDT) Received: from ensieta.fr (auvergne.ensieta.fr [193.52.45.6]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j67DR3Gg012467 for ; Thu, 7 Jul 2005 08:27:09 -0500 (CDT) Received: from ensieta.fr (localhost [127.0.0.1]) by ensieta.fr (8.9.3/jtpda-5.3.1) with ESMTP id PAA28220 for ; Thu, 7 Jul 2005 15:27:02 +0200 (CEST) Received: from strauss.ensieta.ecole (strauss [172.20.1.12]) by ensieta.fr (8.9.3/jtpda-5.3.1) with ESMTP id PAA28181 for ; Thu, 7 Jul 2005 15:27:01 +0200 (CEST) To: reliable_computing [at] interval [dot] louisiana.edu Cc: Luc JAULIN , Ali KHENCHAF Subject: Interval Control Summer School, September 2005, Grenoble, France MIME-Version: 1.0 X-Mailer: Lotus Notes Release 6.5.3 September 14, 2004 Message-ID: From: Luc JAULIN Date: Thu, 7 Jul 2005 15:26:14 +0200 X-MIMETrack: Serialize by Router on TEAM/ENSIETA(Release 6.5.3FP1 | December 22, 2004) at 07/07/2005 15:26:49, Serialize complete at 07/07/2005 15:26:49 Content-Type: text/plain; charset="ISO-8859-1" Content-Transfer-Encoding: 8bit X-MIME-Autoconverted: from quoted-printable to 8bit by interval.louisiana.edu id j67DRAGg012472 Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear colleagues, Please find below the program of a Control Summer School that will take place on 12-16 September 2005, in Grenoble, France. This school is about the application of interval analysis and constraint propagation to identification, control and robotics. It is open to graduate students, researchers or engineers who want to learn the concepts of interval computation, to understand why constraint propagation is essential to deal with problems involving many variables, and to find realistic applications where interval methods are needed. The lessons will be in english. No prior knowledge on control, robotics or interval analysis is required. More information about this summer shool can be found at http://ecole-ete-auto.lag.ensieg.inpg.fr/index_uk.html. The deadline has actually been extended, so you should not hesitate to register even after the end of July. We hope to see you in Grenoble, Luc Jaulin and Eric Walter. ********************************************************************** Grenoble Control Summer School GUARANTEED SET COMPUTATION, WITH APPLICATIONS IN IDENTIFICATION, OBSERVATION, CONTROL AND ROBOTICS 12-16 September 2005, Grenoble, France Scientific coordinators : Luc JAULIN and Eric WALTER Laboratoire E3I2, ENSIETA, Brest Laboratoire des Signaux et Systemes CNRS - SUPELEC - Univ. Paris-Sud Gif-sur-Yvette Main speakers Laurent GRANVILLIERS, Professor, University of Nantes Luc JAULIN , Professor, ENSIETA, Brest Michel KIEFFER, Associate Professor, University Paris-Sud XI, Orsay Suzanne LESECQ, Associate Professor, University Joseph Fourier, Grenoble Nacim RAMDANI, Associate Professor, University Paris XII, Creteil Eric WALTER, Directeur de Recherche at CNRS Program 1st day Set computation Set theory. Computing with ellipsoids, with intervals and subpavings. Inclusion functions. Contractors and constraint propagation. Practical work. 2nd day Set solvers Computing direct images of sets. Computing reciprocal images of sets. Solving linear and nonlinear sets of equations. Global optimisation (including minimax). Integrating differential equations. Practical work. 3rd day Set estimation Estimating parameters (via the minimization of a cost function or, in a bounded-error context by ellipsoids or by subpavings). Estimating state variables by set filtering in a bounded-error context (by ellipsoids or by subpavings). State estimation via constraint propagation. Joint parameter and state estimation Practical work. 4th day Robust control Analysing the stability of uncertain systems. Computing stability domains and margins. Delay systems. Designing robust controllers. Practical work. 5th day Complements Guaranteed computation with floating point numbers. Automatic differentiation. 5th day Robotics Computing all possible configurations of a Stewart-Gough platform. Calibrating robots. Localization and tracking of a vehicle from distance measurements. Trajectory planning. SIG Calcul ensembliste of the GdR MACS. Luc Jaulin, Bureau D214, Laboratoire E3I2, ENSIETA 2, rue François Verny, 29806 Brest, Cedex 9 Web : http://www.ensieta.fr/e3i2/Jaulin/ Tel : +33 (0)2 98 34 89 10 Fax : +33 (0)2 98 34 87 50 From owner-reliable_computing [at] interval [dot] louisiana.edu Mon Jul 11 07:32:25 2005 Received: from interval.louisiana.edu (daemon@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6BCWP3s025234 for ; Mon, 11 Jul 2005 07:32:25 -0500 (CDT) Received: (from daemon@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j6BCWOCB025233 for reliable_computing-outgoing; Mon, 11 Jul 2005 07:32:25 -0500 (CDT) Received: from marnier.ucs.louisiana.edu (root [at] marnier [dot] ucs.louisiana.edu [130.70.132.233]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6BCWGhQ025229 for ; Mon, 11 Jul 2005 07:32:21 -0500 (CDT) Received: from Liberty (h158065.louisiana.edu [130.70.158.65]) by marnier.ucs.louisiana.edu (8.13.1/8.13.1/ull-ucs-mx-host_1.9) with SMTP id j6BCW7h8012308; Mon, 11 Jul 2005 07:32:12 -0500 (CDT) Message-Id: <2.2.32.20050711123215.00940d2c [at] pop [dot] louisiana.edu> X-Sender: rbk5287 [at] pop [dot] louisiana.edu X-Mailer: Windows Eudora Pro Version 2.2 (32) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Mon, 11 Jul 2005 07:32:15 -0500 To: giuseppe , reliable_computing [at] interval [dot] louisiana.edu From: "R. Baker Kearfott" Subject: Re: midpoint of a matrix X-Virus-Scanned: ClamAV 0.86/976/Mon Jul 11 05:09:22 2005 on marnier.ucs.louisiana.edu X-Virus-Status: Clean Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Guiseppe, The midpoint of a matrix is that matrix whose (i,j)-th element is the midpoint of the (i,j)-th element of the corresponding interval matrix. Generally, even if the interval matrix is represented exactly in the machine, the elements of the midpoint matrix are not exactly representable. However, this usually does not cause a problem in the contexts where the midpoint matrix is used. For example, an approximate inverse of the midpoint matrix is commonly used to precondition linear systems of equations with interval coefficients that are relatively narrow. Rigor is not lost by using an approximation, although, for rigor, interval arithmetic should be used in applying the preconditioner (approximate or not). Sincerely, R. Baker Kearfott At 06:24 PM 7/8/2005 +0900, giuseppe wrote: >what is the midpoint af a matrix? > From papers on the web I really understand (and I haven't the books) >G > >-- >---------------------- >---------------------- >Giuseppe De Marco, Ph.D. > >Dipartimento di Ingegneria >dell'Informazione e Ingegneria Elettrica >DIIIE, University of Salerno >via ponte don Melillo 1, Fisciano, Salerno >tel: +39 089 964012 >email: gdemarco [at] unisa [dot] it > >Department of Information and >Communication Engineering >Faculty of Information Engineering >Fukuoka Institute of Technology (FIT) >3-30-1 Wajiro-Higashi, Higashi-ku, Fukuoka 811-0295 >Japan >email: demarco [at] fit [dot] ac.jp >-------------------- > > --------------------------------------------------------------- R. Baker Kearfott, rbk [at] louisiana [dot] edu (337) 482-5346 (fax) (337) 482-5270 (work) (337) 993-1827 (home) URL: http://interval.louisiana.edu/kearfott.html Department of Mathematics, University of Louisiana at Lafayette (Room 217 Maxim D. Doucet Hall, 1403 Johnston Street) Box 4-1010, Lafayette, LA 70504-1010, USA --------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] louisiana.edu Mon Jul 11 06:34:22 2005 Received: from interval.louisiana.edu (daemon@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6BBYM9i025068 for ; Mon, 11 Jul 2005 06:34:22 -0500 (CDT) Received: (from daemon@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j6BBYLHU025067 for reliable_computing-outgoing; Mon, 11 Jul 2005 06:34:21 -0500 (CDT) Received: from interval.louisiana.edu (rbk5287@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6BBYJ0a025063 for ; Mon, 11 Jul 2005 06:34:19 -0500 (CDT) Received: (from rbk5287@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j6BBYI6P025062 for reliable_computing [at] interval [dot] louisiana.edu; Mon, 11 Jul 2005 06:34:18 -0500 (CDT) Received: from dontaku.fit.ac.jp (dontaku.fit.ac.jp [150.43.1.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j689TGeq015607 for ; Fri, 8 Jul 2005 04:29:22 -0500 (CDT) Received: from dontaku.fit.ac.jp (localhost.localdomain [127.0.0.1]) by localhost.fit.ac.jp (Postfix) with ESMTP id EB9F714C01D for ; Fri, 8 Jul 2005 18:29:08 +0900 (JST) Received: from [150.43.233.162] (nausica.ce.fit.ac.jp [150.43.233.162]) by dontaku.fit.ac.jp (Postfix) with ESMTP id D99F814C018 for ; Fri, 8 Jul 2005 18:29:08 +0900 (JST) Message-ID: <42CE4653.6020409 [at] fit [dot] ac.jp> Date: Fri, 08 Jul 2005 18:24:35 +0900 From: giuseppe User-Agent: Mozilla/5.0 (X11; U; Linux i686; en-US; rv:1.7.8) Gecko/20050511 X-Accept-Language: en-us, en MIME-Version: 1.0 To: reliable_computing [at] interval [dot] louisiana.edu Subject: (no subject) Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk what is the midpoint af a matrix? From papers on the web I really understand (and I haven't the books) G -- ---------------------- ---------------------- Giuseppe De Marco, Ph.D. Dipartimento di Ingegneria dell'Informazione e Ingegneria Elettrica DIIIE, University of Salerno via ponte don Melillo 1, Fisciano, Salerno tel: +39 089 964012 email: gdemarco [at] unisa [dot] it Department of Information and Communication Engineering Faculty of Information Engineering Fukuoka Institute of Technology (FIT) 3-30-1 Wajiro-Higashi, Higashi-ku, Fukuoka 811-0295 Japan email: demarco [at] fit [dot] ac.jp -------------------- From owner-reliable_computing [at] interval [dot] louisiana.edu Mon Jul 11 10:07:32 2005 Received: from interval.louisiana.edu (daemon@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6BF7WrY025484 for ; Mon, 11 Jul 2005 10:07:32 -0500 (CDT) Received: (from daemon@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j6BF7V8x025483 for reliable_computing-outgoing; Mon, 11 Jul 2005 10:07:31 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6BF7Ne9025479 for ; Mon, 11 Jul 2005 10:07:29 -0500 (CDT) Received: from aragorn (aragorn [129.108.5.35]) by cs.utep.edu (8.11.7/8.11.7) with SMTP id j6BF6Fc29682; Mon, 11 Jul 2005 09:06:25 -0600 (MDT) Message-Id: <200507111506.j6BF6Fc29682 [at] cs [dot] utep.edu> Date: Mon, 11 Jul 2005 09:06:35 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: Invitation to Info-Gap workshop: forwarding To: reliable_computing [at] interval [dot] louisiana.edu, interval [at] cs [dot] utep.edu Cc: jim.hall [at] newcastle [dot] ac.uk MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: lnV6oOgOT4S1y69s8C2S/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 forwarding. Vladik ------------- Begin Forwarded Message ------------- From: jim.hall [at] newcastle [dot] ac.uk Applications are invited for participation in a workshop on: INFO-GAP ANALYSIS OF ENGINEERING SYSTEMS: ROBUST DECISIONS UNDER SEVERE UNCERTAINTY to be held on 29-30th September 2005 University of Newcastle-upon-Tyne Organisers: Prof Jim Hall, University of Newcastle-upon-Tyne Prof Keith Worden, University of Sheffield Dr Nick Alexander, University of Bristol This workshop will bring together international researchers who have been progressing info-gap applications, in most cases independently of one another, and ask them to present demonstrations of the maturing theory and reflect upon future challenges. They will be joined by selected participants working in uncertainty analysis of engineering systems that have potential for application of info-gap theory. Each member of this latter group will be invited to present a poster summarising their current work and identifying potential info-gap applications to be discussed during the workshop. The purpose of the workshop is: i. to share experiences of application on info-gap to a range of engineering applications, and ii. to identify and examine future opportunities and challenges for info-gap. This will be achieved by a combination of * presentations by leading exponents of info-gap theory followed by plenary discussion, and * a poster session to address open problems raised by other participants in the workshop and to develop potential info-gap applications. The main speakers are (subject to confirmation): 1. Prof Yakov Ben-Haim (Yitzhak Moda'i Chair in Technology and Economics Faculty of Mechanical Engineering, Technion - Israel Institute of Technology) 2. Dr. Francois Hemez (Engineering Sciences and Applications, Los Alamos National Laboratory, USA) 3. Dr. Scott Cogan (Faculte des Sciences, Laboratoire de Mecanique Appliquee, Universite de Franche-Comte, France) 4. Prof. Yoshihiro Kanno (Dept. of Urban and Environmental Engineering, Kyoto University, Japan) 5. Prof. Chris Pantelides (Department of Civil and Environmental Engineering, University of Utah, USA) 6. Dr Miriam Zacksenhouse (Faculty of Mechanical Engineering, Technion - Israel Institute of Technology) 7. Prof. Jim Hall (Professor of Earth Systems Engineering, School of Civil Engineering and Geosciences, University of Newcastle-upon-Tyne, UK) 8. Prof. Keith Worden (Professor of dynamical systems, Department of Mechanical Engineering, University of Sheffield, UK) 9. Dr Gareth Pierce (Research Associate, Department of Mechanical Engineering, University of Sheffield, UK) INVITATION TO PARTICIPANTS There are places for between fifteen and twenty participants at the workshop, in addition to the main speakers. No prior experience of info-gap analysis is necessary but each participant will be expected to present a poster summarising aspects of their current work and identifying key areas of uncertainty that have potential for info-gap analysis. We are able to pay the registration fees as well as accommodation and dinner on the night of Thursday 29 September for each participant. We cannot contribute to travel expenses. If you would like to attend, please contact Meg Buckley by 29 July 2005 with your name, full contact details, affiliation, current position and a short summary of the proposed contents of your poster. In selecting applicants we will seek a balance between industrial and university participants and between academic staff and graduate students. Participants from outside the UK are welcome. We will notify successful applicants by 8 August 2005. BACKGROUND TO INFO-GAP ANALYSIS Design and planning decisions often employ quantitative models of various phenomena. Typically, these phenomena are complex and poorly understood, so these models are accompanied by tremendous uncertainty. This uncertainty is of two sorts: aleatoric and epistemic. Aleatoric uncertainty is randomness which is usually modelled by probability distributions. Epistemic uncertainty is a knowledge gap: our understanding of the phenomena is incomplete or erroneous, so models of the phenomena are uncertain. Often the random (aleatoric) elements of the phenomena are poorly understood, so probability models are themselves subject to epistemic uncertainty as well. Info-gap theory is a method for modelling epistemic uncertainty and for evaluating and selecting between plans and designs in terms of effectiveness and robustness to both aleatoric and epistemic uncertainties. Information-gap decision theory was initiated and developed by Prof Yakov Ben-Haim and has its origins in the early 1980s in convex modelling of materials, mechanical and dynamical problems. A system model is parameterised so that system response to loading is represented by nested sets containing excursions of system behaviour. Of particular interest is the level at which system behaviour exceeds some failure criterion. In work with Isaac Elishakoff, Ben-Haim demonstrated how diligently applied probabilistic methods can result in disturbingly inaccurate estimates of the probability of failure of safety-critical systems, whilst convex analysis identified more reliable bounds on system behaviour (Ben-Haim and Elishakoff, 1990). This work was cultivated into a theory of non-probabilistic robust reliability (Ben-Haim, 1996) and subsequently into a complete theory of decision-making under severe uncertainty (Ben-Haim, 2001, 2005). An info-gap analysis has three components: a system model, an info-gap uncertainty model and performance requirements. The system model describes the structure and behaviour of the system in question, using as much information as is reasonably available. The system model may, for example, be in the form of a set of partial differential equations, a network model, or indeed a probabilistic model such as a Poisson process. The uncertainty in the system model is parameterised with an uncertainty parameter \alpha (a positive real number), which defines a family of nested sets that bound regions or clusters of system behaviour. When \alpha = 0 the prediction from the system model converges to a point, which is the anticipated system behaviour, given current available information. However, it is recognised that the system model is incomplete so there will be a range of variation around the nominal behaviour. Uncertainty, as defined by the parameter \alpha, is therefore a range of variation of the actual around the nominal. No further commitment is made to the structure of uncertainty. \alpha is not normalised and has no betting interpretation, so is clearly distinct from a probability. Next, two contrasting consequences of uncertainty are introduced: 'catastrophic failure' and 'windfall success'. Two immunity functions, a robustness function and an opportunity function, describe the variation of \alpha with the magnitude of the unfavourable and favourable consequences. Info gap theory therefore seeks to gain from favourable excursions in uncertain system behaviour as well as developing robust strategies that guard against the effects of unfavourable excursions. Excessive emphasis on failure can result in a loss of opportunity, but the two are not always mutually exclusive. Analysis of robustness and development of strategies for robust-decision-making under severe uncertainty are now amongst the most pressing problems in the management of engineering systems. Recent events, from terrorist attacks to the Asian tsunamis illustrate the importance of designing systems that are robust to unexpected loadings. This is a concept that is straightforward at an intuitive level, but formalising a theory that can deal with truly unexpected loads and states of near total ignorance (situations where probabilistic approaches falter or fail completely) is certainly non-trivial. Info-gap theory shows great promise yet needs to be tested and applied in order to prove its fitness for purpose. The proposed workshop aims to contribute to the evaluation of info-gap theory in practice and the definition of problems that have to be overcome if info-gap is to gain widespread acceptance in engineering practice. Ben-Haim, Y. and Elishakoff, I. Convex Models of Uncertainty in Applied Mechanics. Elesevier, Amsterdam, 1990. Ben-Haim, Y. Robust Reliability in the Mechanical Sciences, Springer-Verlag, Berlin, 1996. Ben-Haim, Y. Information-gap Decision Theory: Decisions Under Severe Uncertainty, Academic Press, San Diego. 2001, Ben-Haim, Y. Info-gap Decision Theory For Engineering Design. Or: Why 'Good' is Preferable to 'Best', appearing as chapter 11 in Engineering Design Reliability Handbook, Edited by Efstratios Nikolaidis, Dan M.Ghiocel and Surendra Singhal, CRC Press, Boca Raton, 2005. ------------- End Forwarded Message ------------- From owner-reliable_computing [at] interval [dot] louisiana.edu Wed Jul 20 07:33:52 2005 Received: from interval.louisiana.edu (daemon@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6KCXqgd018795 for ; Wed, 20 Jul 2005 07:33:52 -0500 (CDT) Received: (from daemon@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j6KCXpr8018794 for reliable_computing-outgoing; Wed, 20 Jul 2005 07:33:51 -0500 (CDT) Received: from GreenSrv.rz.unibw-muenchen.de ([137.193.10.35]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6KCXZSx018790 for ; Wed, 20 Jul 2005 07:33:47 -0500 (CDT) Received: from localhost (GreenSrv [127.0.0.1]) by GreenSrv.rz.unibw-muenchen.de (8.12.8/8.12.8) with ESMTP id j6KCT7Ct008022; Wed, 20 Jul 2005 14:29:07 +0200 Received: from GreenSrv.rz.unibw-muenchen.de ([127.0.0.1]) by localhost (GreenSrv [127.0.0.1]) (amavisd-new, port 10024) with LMTP id 07967-02; Wed, 20 Jul 2005 14:29:03 +0200 (CEST) Received: from informatik.unibw-muenchen.de (riemann.Informatik.UniBw-Muenchen.de [137.193.61.36]) by GreenSrv.rz.unibw-muenchen.de (8.12.8/8.12.8) with ESMTP id j6KCSsDW008003 (version=TLSv1/SSLv3 cipher=RC4-MD5 bits=128 verify=NO); Wed, 20 Jul 2005 14:28:54 +0200 X-Remarks: If SPAM is relayed via GreenSrv.rz.unibw-muenchen.de to outside of unibw-muenchen.de, please report it to abuse@unibw-muenchen.de Message-ID: <42DE4380.4060909 [at] informatik [dot] unibw-muenchen.de> Date: Wed, 20 Jul 2005 14:28:48 +0200 From: Peter Hertling User-Agent: Mozilla/5.0 (Windows; U; Windows NT 5.1; de-DE; rv:1.0.1) Gecko/20020823 Netscape/7.0 X-Accept-Language: de-de, de MIME-Version: 1.0 To: cca-list@fernuni-hagen.de, COMP-THY [at] LISTSERV [dot] ND.EDU, fom [at] cs [dot] nyu.edu, comprox [at] doc [dot] ic.ac.uk, reliable_computing [at] interval [dot] louisiana.edu, na.digest@na-net.ornl.gov, THEORYNT [at] LISTSERV [dot] NODAK.EDU Subject: CCA 2005: Call for Participation Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: 8bit X-Virus-Scanned: by amavisd-new at GreenSrv.rz.unibw-muenchen.de Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk ________________________________________________________________ Call for Participation ________________________________________________________________ C C A 2 0 0 5 Second International Conference on Computability and Complexity in Analysis August 25-29, 2005, Kyoto, Japan 25-26: Satellite seminars 27-29: Main conference http://cca-net.de/cca2005 ________________________________________________________________ Program The program can be found on the webpage of the conference: http://cca-net.de/cca2005/cca2005-program.pdf Registration If you wish to participate in the main conference, please register until August 2, 2005, via http://www.i.h.kyoto-u.ac.jp/cca2005/ No registration is required for visiting the satellite seminars. Invited talks 1. Vasco Brattka (Cape Town, South Africa) Some Aspects of Computable Functional Analysis 2. Masami Hagiya (Tokyo, Japan) Molecular Computing and Real Number Computing 3. Daisuke Takahashi (Waseda, Japan) Low Temperature Limit of Equations - Hidden Discrete Structure Contributed talks 1. Yohji Akama and Shinji Iizuka Real Number Representations of Graph-Directed IFS Attractors 2. Andrej Bauer and Paul Taylor The Dedekind Reals in Abstract Stone Duality 3. Douglas Bridges, Robin Havea, and Peter Schuster: Ideals in Constructive Banach Algebra Theory 4. Douglas Bridges and Luminita Vita An Extension Theorem for Ultraweakly Continuous Linear Functionals on B(X,Y) 5. Douglas Bridges and Luminita Vita Proximal onnectedness 6. Santiago Figueira, Frank Stephan, and Guohua Wu: Randomness and Universal Machines 7. Tanja Grubba and Klaus Weihrauch A Computable Version of Dini's Theorem for Topological Spaces 8. Peter Hertling A Sequentially Computable Function that is not Effectively Continuous at any Point 9. Hiroyasu Kamo Computability and Computable Uniqueness of Urysohn's Universal Metric Space 10. Tien D. Kieu Mathematical Computability Questions for some Classes of Linear and Non-Linear Differential Equations Originated from Hilbert's Tenth Problem 11. Branimir Lambov RealLib: an Efficient Implementation of Exact Real Arithmetic 12. Takakazu Mori, Yoshiki Tsujii, and Mariko Yasugi Fine Computable Functions and Effective Fine Convergence 13. Robert Rettinger and Xizhong Zheng: A Hierarchy of Turing Degrees for Divergence Bounded Computable Real Numbers 14. Matthias Schröder and Alex Simpson Representing Probability Measures using Probabilistic Processes 15. Paul Taylor A Lambda Calculus for Real Analysis 16. Klaus Weihrauch Multi-Functions on Multi-Represented Sets are Closed under Flowchart Programming 17. Mariko Yasugi, Takakazu Mori, and Yoshiki Tsujii Effective Sequence of Uniformities and its Effective Limit 18. Satoru Yoshida Generalized Functions with Pseudobounded Support in Constructive Mathematics 19. Fuxiang Yu, Arthur Chou, and Ker-I Ko On the Complexity of Finding Circumscribed Rectangles for a Two-Dimensional Domain 20. Martin Ziegler Effectively Open Real Functions Satellite Seminars: Before the main conference there will be satellite seminars that will consist of introductory lectures to CCA and related areas: 1. Andrej Bauer Realizability as Connection between Constructive and Computable Mathematics 2. Martín Escardó Compactness in Topology and Computation 3. Peter Hertling Computable Analysis via Representations 4. Norbert Müller Implementing Exact Real Numbers Efficiently 5. Hideyuki Suzuki Computation in Neural Systems 6. Mariko Yasugi, Atsushi Yoshikawa Computable Versions of Basic Theorems in Functional Analysis Scientific Program Committee: Vasco Brattka (Cape Town, South Africa) Peter Hertling, chair (Munich, Germany) Hajime Ishihara (Ishikawa, Japan) Iraj Kalantari (Macomb, USA) Ker-I Ko (Stony Brook, USA) Vladik Kreinovich (El Paso, USA) Jack H. Lutz (Ames, USA) Joseph S. Miller (Bloomington, USA) Robert Rettinger (Hagen, Germany) Matthias Schröder (Edinburgh, Scotland) Alex Simpson (Edinburgh, Scotland) Klaus Weihrauch (Hagen, Germany) Atsushi Yoshikawa (Kyushu, Japan) Xizhong Zheng (Cottbus, Germany) Ning Zhong (Cincinnati, USA) Martin Ziegler (Odense, Denmark) Organizing Committee Hiroyasu Kamo (Nara, Japan) Takakazu Mori (Kyoto, Japan) Izumi Takeuti (Toho, Japan) Hideki Tsuiki, chair (Kyoto, Japan) Yoshiki Tsujii (Kyoto, Japan) Mariko Yasugi (Kyoto, Japan) Support The conference is supported by the Graduate School of Human and Environmental Studies, Kyoto University. ________________________________________________________________ From owner-reliable_computing [at] interval [dot] louisiana.edu Wed Jul 20 10:23:55 2005 Received: from interval.louisiana.edu (daemon@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6KFNtuC019143 for ; Wed, 20 Jul 2005 10:23:55 -0500 (CDT) Received: (from daemon@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j6KFNsWx019142 for reliable_computing-outgoing; Wed, 20 Jul 2005 10:23:54 -0500 (CDT) Received: from interval.louisiana.edu (rbk5287@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6KFNqMc019137 for ; Wed, 20 Jul 2005 10:23:52 -0500 (CDT) Received: (from rbk5287@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j6KFNplR019136 for reliable_computing [at] interval [dot] louisiana.edu; Wed, 20 Jul 2005 10:23:51 -0500 (CDT) Received: from itdsrvmail01.utep.edu (itdsrvmail01.utep.edu [129.108.0.82]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6J3SV5l014946 for ; Mon, 18 Jul 2005 22:28:37 -0500 (CDT) X-MimeOLE: Produced By Microsoft Exchange V6.5.7226.0 Content-class: urn:content-classes:message MIME-Version: 1.0 Content-Type: multipart/alternative; boundary="----_=_NextPart_001_01C58C11.ED2ED6F5" Subject: Date: Mon, 18 Jul 2005 21:28:27 -0600 Message-ID: <77B4C8824930004AAC10E1B01576254A603641 [at] itdsrvmail01 [dot] utep.edu> X-MS-Has-Attach: X-MS-TNEF-Correlator: Thread-Index: AcWMEe0eyM+5ReyeRC67N/ZyUI5aZA== From: "Kreinovich, Vladik" To: Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk This is a multi-part message in MIME format. ------_=_NextPart_001_01C58C11.ED2ED6F5 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable Dear Friends, =20 I have just learned that Professor G. Randy Keller from the Department of Geological Sciences of the University of Texas at El Paso has been elected a Foreign Member of the Polish Academy of Sciences. =20 In his geophysical research, Professor Keller has used interval techniques. His paper "Eliminating Duplicates Under Interval and Fuzzy Uncertainty: An Asymptotically Optimal Algorithm and Its Geospatial Applications" appeared in Kluwer-published international journal Reliable Computing (2004, Vol. 10, No. 5, pp. 401-422). =20 He co-authored several interval-related papers in the conference proceedings, including the proceedings of the 2004 NSF Conference on Reliable Engineering Computing in Savannah, Georgia. =20 Congratulations to Randy Keller! =20 Vladik ------_=_NextPart_001_01C58C11.ED2ED6F5 Content-Type: text/html; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable
Dear Friends,
=0A=
 
=0A=
I have just learned = that Professor G. =0A= Randy Keller from the
Department of Geological Sciences of the = University of =0A= Texas at El
Paso has been elected a Foreign Member of the Polish = Academy =0A= of
Sciences.
=0A=
 
=0A=
In his geophysical = research, =0A= Professor Keller has used interval
techniques. His paper "Eliminating =0A= Duplicates
  Under Interval and Fuzzy Uncertainty: An =0A= Asymptotically
  Optimal Algorithm and Its Geospatial =0A= Applications"
appeared in Kluwer-published international = journal
  =0A= Reliable Computing (2004, Vol. 10, No. 5, pp. 401-422).
=0A=
 
=0A=
He co-authored several =0A= interval-related papers in the conference
proceedings, including the =0A= proceedings of the 2004 NSF Conference
on Reliable Engineering = Computing in =0A= Savannah, Georgia.
=0A=
 
=0A=
Congratulations to Randy Keller!
=0A=
 
=0A=
Vladik
------_=_NextPart_001_01C58C11.ED2ED6F5-- From owner-reliable_computing [at] interval [dot] louisiana.edu Wed Jul 20 10:22:01 2005 Received: from interval.louisiana.edu (daemon@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6KFM1VL019102 for ; Wed, 20 Jul 2005 10:22:01 -0500 (CDT) Received: (from daemon@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j6KFM1ag019101 for reliable_computing-outgoing; Wed, 20 Jul 2005 10:22:01 -0500 (CDT) Received: from interval.louisiana.edu (rbk5287@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6KFLsvX019096 for ; Wed, 20 Jul 2005 10:21:54 -0500 (CDT) Received: (from rbk5287@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j6KFLrB5019095 for reliable_computing [at] interval [dot] louisiana.edu; Wed, 20 Jul 2005 10:21:53 -0500 (CDT) Received: from pandora.cs.kun.nl (root [at] pandora [dot] cs.kun.nl [131.174.33.4]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6FIvLKB008008 for ; Fri, 15 Jul 2005 13:57:28 -0500 (CDT) Received: from zoroaster.cs.kun.nl [131.174.33.82] (helo=localhost.localdomain) by pandora.cs.kun.nl (8.12.10/5.2) with ESMTP id j6FIuokt012211; Fri, 15 Jul 2005 20:56:50 +0200 (MEST) To: cca-list@fernuni-hagen.de, comprox [at] doc [dot] ic.ac.uk, gmp-discuss [at] swox [dot] com, ipalist [at] listserver [dot] tue.nl, Map [at] mozart [dot] ujf-grenoble.fr, na.digest@na-net.ornl.gov, reliable_computing [at] interval [dot] louisiana.edu, types [at] lists [dot] chalmers.se Subject: "Many Digits" Friendly Competition 2005 : Call for Participation From: Milad Niqui X-No-Archive: Yes Reply-To: manydigits [at] cs [dot] ru.nl Date: Fri, 15 Jul 2005 20:57:26 +0200 Message-ID: <87vf3baodl.fsf [at] cs [dot] ru.nl> User-Agent: Gnus/5.1007 (Gnus v5.10.7) XEmacs/21.4 (Jumbo Shrimp, linux) MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Spam-Score: -0.01 () BAYES_40,FORGED_RCVD_HELO X-Scanned-By: MIMEDefang 2.48 on 131.174.33.4 Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk THE "MANY DIGITS" FRIENDLY COMPETITION 2005 4 October 2005 Radboud University, Nijmegen, The Netherlands Call For Participation In the Institute for Computing and Information Sciences at Radboud University Nijmegen we will organise a friendly competition/benchmark session for investigating the state of the art in the various implementations of exact real arithmetic. The event will be held on October 4th 2005, in conjunction with the Small TYPES workshop on Constructive analysis, types and exact real numbers . The event will be akin to those held in CCA00 and CCA2002 . All the interactive software packages capable of handling arbitrary precision arithmetic on elementary functions are invited to participate. Moreover all libraries for handling arbitrary precision arithmetic in any programming language are welcome to participate provided that the participant writes a suitable interface/program. The participants can choose to attend the event at Nijmegen, or they can choose to participate remotely via Internet. Friendly Competition The friendly competition consists of giving a solution to a set of problems that are posed by the organisers shortly (few hours) before the event. The problems cover the minimum abilities of a system capable of handling the elementary real functions and are expected to ask for a large (>=10,000) number of digits. An example of a problem that might be in this set is to calculate the first 10,000 digits of sin(sin(1)). A set of `practice problems' can be found on the website of the competition . The solutions consist of the input needed to generate the answers to the problems plus the answers themselves. The competition criteria will be the accuracy (correctness) of the solution and the time needed for producing the solution. Apart from this, we will also compare the other aspects of the solutions (such as memory usage and readability and length of the input code) to give a better comparison. On the day of the competition the solutions will be executed by participants on one specific machine at the event site, under either Debian/GNU Linux or Windows XP. A more detailed description of the setup and format of the competition can be found on the website of the competition . The outcome of this friendly competition is expected to give a comparison in performance of the systems that chose to participate for the selected problems. Remote Participation In case of remote participation, the participants will receive the set of problems by email. Then they will be given the opportunity to log into our local machine and perform their solution. Systems, Packages and Libraries Those who wish to participate in the Friendly Competition are expected to provide the software necessary for their solutions, so it can be run on the machine used for the competition. Schedule * August 26th deadline for registering for the competition * August 29th final list of registered participants on the web * September 23rd timings of the practice problems for the registered participants posted on the web * October 4th competition Registration If you are interested in participating in the event we will be happy to hear from you: 1.Team name, name and email of contact person(s) and the platform your system needs to run (GNU Linux or Windows XP). 2.Whether you plan to come to the meeting or whether you would like to participate remotely. We would prefer that participants (especially those whose system requires Windows) to send their intention to participate before August 26th, 2005. Please register by sending mail to . Best Regards, Local Organisers: Milad Niqui and Freek Wiedijk From owner-reliable_computing [at] interval [dot] louisiana.edu Wed Jul 20 10:23:14 2005 Received: from interval.louisiana.edu (daemon@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6KFND5a019122 for ; Wed, 20 Jul 2005 10:23:14 -0500 (CDT) Received: (from daemon@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j6KFND90019121 for reliable_computing-outgoing; Wed, 20 Jul 2005 10:23:13 -0500 (CDT) Received: from interval.louisiana.edu (rbk5287@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6KFMjQ9019117 for ; Wed, 20 Jul 2005 10:22:46 -0500 (CDT) Received: (from rbk5287@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j6KFMjs7019116 for reliable_computing [at] interval [dot] louisiana.edu; Wed, 20 Jul 2005 10:22:45 -0500 (CDT) Received: from itdsrvmail01.utep.edu (itdsrvmail01.utep.edu [129.108.0.82]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6ILlPPL014514 for ; Mon, 18 Jul 2005 16:47:34 -0500 (CDT) X-MimeOLE: Produced By Microsoft Exchange V6.5.7226.0 Content-class: urn:content-classes:message MIME-Version: 1.0 Content-Type: multipart/alternative; boundary="----_=_NextPart_001_01C58BE2.461831EB" Subject: FW: Intech 2005 Call for Papers : Extend full paper submission deadline Date: Mon, 18 Jul 2005 15:45:55 -0600 Message-ID: <77B4C8824930004AAC10E1B01576254A603614 [at] itdsrvmail01 [dot] utep.edu> X-MS-Has-Attach: X-MS-TNEF-Correlator: Thread-Topic: Intech 2005 Call for Papers : Extend full paper submission deadline Thread-Index: AcWIORnrlpSlFitwSRWruxwWyM6qmQDqPlXr From: "Kreinovich, Vladik" To: , Cc: Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk This is a multi-part message in MIME format. ------_=_NextPart_001_01C58BE2.461831EB Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable FYI. Vladik =20 The organizers have always welcomed interval-related papers.=20 ________________________________ From: intech [at] scitech [dot] au.edu [mailto:intech [at] scitech [dot] au.edu] /************************************************************************= ******************** Extend: Full paper submission deadline July 31st, = 2005 *************************************************************************= *******************/ Call For Papers The Sixth International Conference on Intelligent Technologies ( InTech'05) Venue: Phuket, Thailand December 14th - 16th, 2005 Organized by: Assumption University, Thailand General chair: Pratit Santiprabhob (Thailand) Publicity Co-chairs : Vilasinee Srisarkun (Thailand), Dan Ralescu (USA) Honorary General Chairs: Supavadee Nontakao (Thailand), Hung T Nguyen (USA) Organizing Committee chair : Thotsapon Sortrakul (Thailand) International Program Committee Co-Chairs: Jirapun Daengdej (Thailand), Vladik Kreinovich (USA) Technical Chair : Thitipong Tanprasert (Thailand) International Committee: Atonio Dinola (Italy), Baoding Liu (China), Berlin Wu (Taiwan), Bernadette Bouchon-Meunier (France), Carol Walker (USA), Claude Langrand (France), CW Tao (Taiwan), Dan Ralescu (USA), Elbert Walker (USA), Fred Hadaegh (USA), Hepu Deng (Australia), Hung T. Nguyen (USA), K.Hirota (Japan), Liya Ding (Macau), Maria Angeles Gill (Spain), Michel Grabisch (France), Michio Sugeno (Japan), Nipon Auephanwiriyakul (Thailand), Peter Klement (Austria), Richard Alo (USA), Ron Yager (USA), Shoumei Li (China), Sohrab Mobasser (USA), Sompong hompongsa (Thailand), Sansanee Auephanwiriyakul (Thailand), Tim Ross (USA) Vilem Novak (Czeck Republic) Vladik Kreinovich (US), Yeung Yam (Hongkong) InTech'05 Programme InTech'05 will comprise of plenary sessions, oral and poster presentations, exhibitions and excursions. The events will open to all participants. The main objectives of the conference are: * Bring together researchers and practitioners in order to exchange = their ideas and discuss issues occurred when implementing intelligent and = fuzzy technologies in real-world environment. * Provide a forum for discussion of new research areas, results and = issues. * Encourage international researches in intelligent and fuzzy = technologies. Topics of InTech'05 include but not limited to: * Mathematical Foundations of Intelligent Technologies * Traditional Artificial Intelligent Techniques * Uncertainty Processing and Methods of Soft Computing * Learning/Adaptive Systems/Data Mining * Applications of Intelligent Technologies * Intelligent Data Analysis * Control and Decision Science A special event at InTech'05 : Professor Michio SUGENO will be honored = for his pioneering and fundamental works in Fuzzy Theory and Its = Applications at InTech'05. Proceedings: Proceedings will be distributed to participants during the conference. Selected, extended and revised papers from InTech'05 will be published = in a Special issue of the International Journal of Advanced Computational Intelligence and that of the Pacific Journal on Intelligent Technologies and Applied Statistics. Paper Submissions: Papers related to both theoretical and real-world applications in the areas listed above are welcome. The maximum number of pages is 10 pages including all tables, figures and references. Over-length and late submission papers will be rejected without review. Conference Fees: By Sep. 6, 2005 (Early-bird Registration): 250 USD (General = Participant), 150 USD (Student), 100 USD (Guest) Ater Sep. 6, 2005 - Dec. 2,2005 (Regular Registration): 300 USD (General Participant), 200 USD (Student), 150 USD (Guest) On Site Registration: 400 USD (General Participant), 300 USD (Student), 250 USD (Guest) Important Dates: Full paper submission deadline July 31st, 2005 Acceptance notification August 29th, 2005 Camera-ready deadline October 3rd, 2005 Early-bird registration deadline September 6th, 2005 Proceedings: Faculty of Science and Technology Assumption University Hua Mak, Bangkapi Bangkok, 10240, Thailand Tel: +66 2719 1515, Fax: +66 2719 1639 URL: http://www.intech.scitech.au.edu E-mail: intech [at] scitech [dot] au.edu. Phuket Overview: An island of contrasts, Phuket has much to offer its visitors. White = sandy beaches abound the west coast and mangrove lined shores, the east. A = range of hills runs down her back from north to south, dividing the island in half. Waterfalls, especially in the 'wet' season spill into rock pools, scattered down the slopes. In the distance, islands rear out of the Andaman Sea, waiting to be explored. For more information, please visit: www.clubandaman.com ------_=_NextPart_001_01C58BE2.461831EB Content-Type: text/html; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable =0A= =0A= =0A= =0A= =0A= =0A= Intech 2005 Call for Papers : Extend full paper submission = deadline =0A= =0A= =0A=
=0A=
FYI. =0A= Vladik
=0A=
 
=0A=
The organizers have always welcomed interval-related = papers.
=0A=
=0A= From: intech [at] scitech [dot] au.edu =0A= [mailto:intech [at] scitech [dot] au.edu]
=0A=
=0A=

/***************************************************************= *****************************
      &nbs= p;     =0A= Extend: Full paper submission = deadline        =0A= July 31st, =0A= 2005
*****************************************************************= ***************************/


Call =0A= For Papers

The Sixth International Conference on Intelligent = Technologies =0A= (
InTech’05)
Venue: Phuket, Thailand
December 14th = – 16th, =0A= 2005


Organized by:
Assumption University, =0A= Thailand


General chair:
Pratit Santiprabhob =0A= (Thailand)

Publicity Co-chairs :
Vilasinee Srisarkun = (Thailand), Dan =0A= Ralescu (USA)

Honorary General Chairs:
Supavadee Nontakao = (Thailand), =0A= Hung T Nguyen (USA)

Organizing  Committee chair = :
Thotsapon =0A= Sortrakul (Thailand)

International Program Committee =0A= Co-Chairs:
Jirapun Daengdej (Thailand), Vladik Kreinovich =0A= (USA)

Technical Chair :
Thitipong Tanprasert =0A= (Thailand)


International Committee:

Atonio Dinola =0A= (Italy),
Baoding Liu (China),
Berlin Wu (Taiwan),
Bernadette =0A= Bouchon-Meunier (France),
Carol Walker (USA),
Claude Langrand =0A= (France),
CW Tao (Taiwan),
Dan Ralescu (USA),
Elbert Walker =0A= (USA),

Fred Hadaegh (USA),
Hepu Deng (Australia),
Hung T. = Nguyen =0A= (USA),
K.Hirota (Japan),
Liya Ding (Macau),
Maria Angeles Gill =0A= (Spain),
Michel Grabisch (France),
Michio Sugeno (Japan),
Nipon =0A= Auephanwiriyakul (Thailand),
Peter Klement (Austria),

Richard = Alo =0A= (USA),
Ron Yager (USA),
Shoumei Li (China),
Sohrab Mobasser =0A= (USA),
Sompong hompongsa (Thailand),
Sansanee Auephanwiriyakul =0A= (Thailand),
Tim Ross (USA)
Vilem Novak (Czeck Republic)
Vladik =0A= Kreinovich (US),
Yeung Yam (Hongkong)



InTech'05 =0A= Programme

InTech'05 will comprise of plenary sessions, oral and =0A= poster
presentations, exhibitions and excursions. The events will = open to =0A= all
participants. The main objectives of the conference are:
* = Bring =0A= together researchers and practitioners in order to exchange = their
ideas and =0A= discuss issues occurred when implementing intelligent and = fuzzy
technologies =0A= in real-world environment.
* Provide a forum for discussion of new = research =0A= areas, results and issues.
* Encourage international researches in =0A= intelligent and fuzzy technologies.


Topics of InTech'05 = include but =0A= not limited to:
* Mathematical Foundations of Intelligent = Technologies
* =0A= Traditional Artificial Intelligent Techniques
* Uncertainty = Processing and =0A= Methods of Soft Computing
* Learning/Adaptive Systems/Data = Mining
* =0A= Applications of Intelligent Technologies
* Intelligent Data = Analysis
* =0A= Control and Decision Science


A special event at InTech'05 : = Professor =0A= Michio SUGENO will be honored for
his pioneering and fundamental = works in =0A= Fuzzy Theory and Its Applications
at =0A= InTech'05.


Proceedings:
Proceedings will be distributed to =0A= participants during the conference.
Selected, extended and revised = papers =0A= from InTech'05 will be published in
a Special issue of the = International =0A= Journal of Advanced Computational
Intelligence and that of the = Pacific =0A= Journal on Intelligent Technologies
and Applied = Statistics.


Paper =0A= Submissions:
Papers related to both theoretical and real-world = applications =0A= in the
areas listed above are welcome. The maximum number of pages is = 10 =0A= pages
including all tables, figures and references. Over-length and =0A= late
submission papers will be rejected without = review.


Conference =0A= Fees:

By Sep. 6, 2005 (Early-bird Registration): 250 USD (General =0A= Participant),
150 USD (Student), 100 USD (Guest)
Ater Sep. 6, 2005 = - Dec. =0A= 2,2005 (Regular Registration): 300 USD (General
Participant), 200 USD =0A= (Student), 150 USD (Guest)
On Site Registration: 400 USD (General =0A= Participant), 300 USD (Student),
250 USD (Guest)

Important =0A= Dates:
Full paper submission =0A= deadline        July 31st, = 2005
Acceptance =0A= notification          &= nbsp;        =0A= August 29th, 2005
Camera-ready =0A= deadline           = ;        =0A= October 3rd, 2005
Early-bird registration =0A= deadline        September 6th, =0A= 2005


Proceedings:

Faculty of Science and =0A= Technology
Assumption University
Hua Mak, Bangkapi Bangkok, 10240, =0A= Thailand
Tel: +66 2719 1515, Fax: +66 2719 1639
URL: http://www.intech.scitech.au.ed= u
E-mail: =0A= intech [at] scitech [dot] au.edu.


Phuket Overview:

An island of =0A= contrasts, Phuket has much to offer its visitors. White sandy
beaches = abound =0A= the west coast and mangrove lined shores, the east. A range
of hills = runs =0A= down her back from north to south, dividing the island in
half. = Waterfalls, =0A= especially in the ‘wet’ season spill into rock = pools,
scattered down the =0A= slopes. In the distance, islands rear out of the
Andaman Sea, waiting = to be =0A= explored. For more information, please =0A= visit:
www.clubandaman.com

=0A= =0A= =0A= ------_=_NextPart_001_01C58BE2.461831EB-- From owner-reliable_computing [at] interval [dot] louisiana.edu Wed Jul 20 10:23:33 2005 Received: from interval.louisiana.edu (daemon@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6KFNXOE019132 for ; Wed, 20 Jul 2005 10:23:33 -0500 (CDT) Received: (from daemon@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j6KFNX4C019131 for reliable_computing-outgoing; Wed, 20 Jul 2005 10:23:33 -0500 (CDT) Received: from interval.louisiana.edu (rbk5287@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6KFNU4a019127 for ; Wed, 20 Jul 2005 10:23:30 -0500 (CDT) Received: (from rbk5287@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j6KFNT1s019126 for reliable_computing [at] interval [dot] louisiana.edu; Wed, 20 Jul 2005 10:23:29 -0500 (CDT) Received: from itdsrvmail01.utep.edu (itdsrvmail01.utep.edu [129.108.0.82]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6ILp8MT014525 for ; Mon, 18 Jul 2005 16:51:14 -0500 (CDT) X-MimeOLE: Produced By Microsoft Exchange V6.5.7226.0 Content-class: urn:content-classes:message MIME-Version: 1.0 Content-Type: multipart/alternative; boundary="----_=_NextPart_001_01C58BE2.CB33A1EF" Subject: my email Date: Mon, 18 Jul 2005 15:51:03 -0600 Message-ID: <77B4C8824930004AAC10E1B01576254A603615 [at] itdsrvmail01 [dot] utep.edu> X-MS-Has-Attach: X-MS-TNEF-Correlator: Thread-Topic: my email Thread-Index: AcWL4ssx7QisyY0JTiajF3hw6KDPmQ== From: "Kreinovich, Vladik" To: Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk This is a multi-part message in MIME format. ------_=_NextPart_001_01C58BE2.CB33A1EF Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable Dear Friends, We have had trouble with cs.utep.edu emails. =20 My new email is vladik [at] utep [dot] edu =20 Most emails sent to my previous email vladik [at] cs [dot] utep.edu have been = forwarded to me, but some may have been lost.=20 =20 The mailing list interval [at] cs [dot] utep.edu is not functioning right now, the = system administrator is working on it, we may have to move it to a new = server. =20 My apologies for the inconvenience.=20 =20 Vladik ------_=_NextPart_001_01C58BE2.CB33A1EF Content-Type: text/html; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable
Dear Friends, We have had trouble with = cs.utep.edu emails.
=0A=
 
=0A= =0A=
 
=0A=
Most emails sent to my previous email = vladik [at] cs [dot] utep.edu have been = forwarded to =0A= me, but some may have been lost.
=0A=
 
=0A=
The mailing list interval [at] cs [dot] utep.edu is not = functioning =0A= right now, the system administrator is working on it, we may have to = move it to =0A= a new server.
=0A=
 
=0A=
My apologies for the inconvenience. =
=0A=
 
=0A=
Vladik
------_=_NextPart_001_01C58BE2.CB33A1EF-- From owner-reliable_computing [at] interval [dot] louisiana.edu Wed Jul 20 10:22:32 2005 Received: from interval.louisiana.edu (daemon@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6KFMVQp019112 for ; Wed, 20 Jul 2005 10:22:31 -0500 (CDT) Received: (from daemon@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j6KFMVfj019111 for reliable_computing-outgoing; Wed, 20 Jul 2005 10:22:31 -0500 (CDT) Received: from interval.louisiana.edu (rbk5287@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6KFMPH1019106 for ; Wed, 20 Jul 2005 10:22:25 -0500 (CDT) Received: (from rbk5287@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j6KFMPlp019105 for reliable_computing [at] interval [dot] louisiana.edu; Wed, 20 Jul 2005 10:22:25 -0500 (CDT) Received: from mta1.math.wisc.edu (mta1.math.wisc.edu [144.92.166.194]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6CJ8owE028011 for ; Tue, 12 Jul 2005 14:08:55 -0500 (CDT) Received: from localhost (localhost.localdomain [127.0.0.1]) by mta1.math.wisc.edu (Postfix) with ESMTP id 28A0D741E2; Tue, 12 Jul 2005 14:08:44 -0500 (CDT) Received: from mta1.math.wisc.edu ([127.0.0.1]) by localhost (mta1 [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id 21157-11; Tue, 12 Jul 2005 14:08:43 -0500 (CDT) Received: from mailhost.math.wisc.edu (lcyoung.math.wisc.edu [144.92.166.90]) by mta1.math.wisc.edu (Postfix) with ESMTP id 0A53E740C1; Tue, 12 Jul 2005 14:08:43 -0500 (CDT) Received: from erdos.math.wisc.edu (erdos.math.wisc.edu [144.92.166.25]) by mailhost.math.wisc.edu (Postfix) with ESMTP id BC03B100451; Tue, 12 Jul 2005 14:08:42 -0500 (CDT) Date: Tue, 12 Jul 2005 14:08:42 -0500 (CDT) From: Hans Schneider To: NETS -- at-net , E-LETTER , Pradeep Misra , Shaun Fallat , "na.digest" , ipnet-digest [at] math [dot] msu.edu, Michael.Unser [at] epfl [dot] ch, SIAGLA-DIGEST , hjt [at] eos [dot] ncsu.edu, SMBnet [at] smb [dot] org, vkm [at] eedsp [dot] gatech.edu, reliable_computing [at] interval [dot] louisiana.edu cc: "Richard A. Brualdi" , Volker Mehrmann Subject: LAA special issue Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII; format=flowed X-UWMath-MailScanner: amavisd-new at math.wisc.edu Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk LINEAR ALGEBRA AND ITS APPLICATIONS Special Issue in honor of Paul Fuhrmann Linear Algebra and its Applications is pleased to announce a special issue in honor of Professor Paul Fuhrmann on the occasion of his 70th birthday on 5 August 2007 in recognition of his many important and fundamental contributions to linear algebra and control theory. We solicit papers for the special issue within the entire scope of LAA or the research interests of Paul Fuhrmann. We welcome papers within system and control theory and operator theory; in particular in * algebraic systems theory * approximation, identification and interpolation * behavioral theory * coding theory with relations to systems theory * functional models * geometric control * hybrid and discrete event systems * matrix-valued and operator-valued functions * model reduction * multidimensional systems * numerical and computational aspects * operators, systems, and linear algebra * polynomial methods in systems theory * robust and optimal control * spectral factorizations * stability theory * system structure * uncertain systems * Wiener-Hopf factorizations The deadline for submission of papers is 31 March 2006. Papers for submission should be sent to any of the five special editors, preferably pdf files as attachments in email, and will be subject to normal refereeing procedures according to LAA standards: Athanasios C. Antoulas. Department of Electrical & Computer Engineering Rice University P.O. Box 1892 - MS 380 Houston, Texas 77251-1892, USA aca [at] rice [dot] edu Uwe Helmke Department of Mathmematics University of Wuerzburg Am Hubland 97074 Wuerzburg, Germany helmke [at] mathematik [dot] uni-wuerzburg.de Joachim Rosenthal Mathematics Institute University of Zurich Winterthurerstr 190 CH-8057 Zurich, Switzerland rosenthal [at] math [dot] unizh.ch Victor Vinnikov Department of Mathematics Ben Gurion University of the Negev 84105 Beer-Sheva, Israel vinnikov [at] math [dot] bgu.ac.il Eva Zerz Department of Mathematics University of Kaiserslautern Erwin-Schroedinger-Str. 48 67663 Kaiserslautern, Germany zerz [at] mathematik [dot] uni-kl.de The editor-in-chief responsible for this special issue is Hans Schneider. From owner-reliable_computing [at] interval [dot] louisiana.edu Thu Jul 21 02:38:50 2005 Received: from interval.louisiana.edu (daemon@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6L7cowh020443 for ; Thu, 21 Jul 2005 02:38:50 -0500 (CDT) Received: (from daemon@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j6L7coSx020442 for reliable_computing-outgoing; Thu, 21 Jul 2005 02:38:50 -0500 (CDT) Received: from web52305.mail.yahoo.com (web52305.mail.yahoo.com [206.190.48.148]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with SMTP id j6L7cf75020438 for ; Thu, 21 Jul 2005 02:38:47 -0500 (CDT) Received: (qmail 57093 invoked by uid 60001); 21 Jul 2005 07:38:35 -0000 DomainKey-Signature: a=rsa-sha1; q=dns; c=nofws; s=s1024; d=yahoo.com; h=Message-ID:Received:Date:From:Subject:To:MIME-Version:Content-Type:Content-Transfer-Encoding; b=iWTTYO5MQ1Z6osZ3X0CAQHZZSXpvvXb2uWxrWLGxuO61hrtBIrBZpNwvwNCASwgQwAGytYmF67o8RG24HlDxXK7OCiiNaQnicfvfm3PxWUjbKkuJ9Mg+cxpi4wQ/uw28kFN7s+G3NQAa19tNcImgRj7EYQ4tug4opWS4Wr2M36Y= ; Message-ID: <20050721073835.57090.qmail [at] web52305 [dot] mail.yahoo.com> Received: from [218.248.0.6] by web52305.mail.yahoo.com via HTTP; Thu, 21 Jul 2005 00:38:35 PDT Date: Thu, 21 Jul 2005 00:38:35 -0700 (PDT) From: "M.V.Rama Rao" Subject: Hello To: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: multipart/alternative; boundary="0-1940699993-1121931515=:57043" Content-Transfer-Encoding: 8bit Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk --0-1940699993-1121931515=:57043 Content-Type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: 8bit Dear Colleagues, I am happy to inform you that I was awarded Ph.D degree for my thesis entitled "Analysis of Cable-stayed bridges by fuzzy finite element modelling" by Osmania university, Hyderabad, India. I was immensly benfitted by the help received from the members of this mailing list. I received help from many researchers of the interval community from time to time via e-mail correspondence. In particular, I recieved a great deal of help from Prof. Rafi Muhanna and Dr Andrejz Pownuk. I am ever grateful to them. I sincerely hope that the discussions and information on this mailing list continue to inspire and help many more researchers worldwide. With warm regards Dr. M.V.Rama Rao Asst. Professor in Civil Engineering, Vasavi College of Engineering, Hyderabad -500 031 INDIA Ph : +91- 40- 2351 1938 --------------------------------- Yahoo! Mail for Mobile Take Yahoo! Mail with you! Check email on your mobile phone. --0-1940699993-1121931515=:57043 Content-Type: text/html; charset=iso-8859-1 Content-Transfer-Encoding: 8bit
Dear Colleagues,
I am happy to inform you that I was awarded Ph.D degree for my thesis entitled "Analysis of Cable-stayed bridges by fuzzy finite element modelling" by Osmania university, Hyderabad, India.
I was immensly benfitted by the help received from the members of this mailing list. I received help from many researchers of the interval community from time to time via e-mail correspondence.
In particular, I recieved a great deal of help from Prof. Rafi Muhanna and Dr Andrejz Pownuk. I am ever grateful to them.
I sincerely hope that the discussions and information on this mailing list continue to inspire and help many more researchers worldwide.
With warm regards
 
Dr. M.V.Rama Rao
Asst. Professor in Civil Engineering,
Vasavi College of Engineering,
Hyderabad -500 031 INDIA
Ph : +91- 40- 2351 1938


Yahoo! Mail for Mobile
Take Yahoo! Mail with you! Check email on your mobile phone. --0-1940699993-1121931515=:57043-- From owner-reliable_computing [at] interval [dot] louisiana.edu Thu Jul 21 06:45:19 2005 Received: from interval.louisiana.edu (daemon@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6LBjJDj021078 for ; Thu, 21 Jul 2005 06:45:19 -0500 (CDT) Received: (from daemon@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j6LBjJqk021077 for reliable_computing-outgoing; Thu, 21 Jul 2005 06:45:19 -0500 (CDT) Received: from ms-smtp-01-eri0.ohiordc.rr.com (ms-smtp-01-smtplb.ohiordc.rr.com [65.24.5.135]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6LBjAum021072 for ; Thu, 21 Jul 2005 06:45:16 -0500 (CDT) Received: from Moore (cpe-204-210-226-96.columbus.res.rr.com [204.210.226.96]) by ms-smtp-01-eri0.ohiordc.rr.com (8.12.10/8.12.7) with SMTP id j6LBj6Wa029987 for ; Thu, 21 Jul 2005 07:45:07 -0400 (EDT) Message-ID: <005001c58de9$a43091b0$0202a8c0@Moore> From: "Ray Moore" To: "reliable computing" Subject: Fredholm-second kind Date: Thu, 21 Jul 2005 07:45:06 -0400 MIME-Version: 1.0 Content-Type: multipart/alternative; boundary="----=_NextPart_000_004D_01C58DC8.1CDC4360" X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 6.00.2900.2180 X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2900.2180 X-Virus-Scanned: Symantec AntiVirus Scan Engine Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk This is a multi-part message in MIME format. ------=_NextPart_000_004D_01C58DC8.1CDC4360 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable Dear All, Is there any published work on interval methods for Fredholm integral = equations of the second kind ? If you know of such work, I would very much appreciate your emailing me = references. Thanks ! Ramon Moore ------=_NextPart_000_004D_01C58DC8.1CDC4360 Content-Type: text/html; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable
Dear All,
 
Is there any published work on interval = methods for=20 Fredholm integral equations of the second kind ?
If you know of such = work, I would=20 very much appreciate your emailing me references.
 
Thanks !
 
Ramon Moore
 
 
------=_NextPart_000_004D_01C58DC8.1CDC4360-- From owner-reliable_computing [at] interval [dot] louisiana.edu Thu Jul 21 07:33:52 2005 Received: from interval.louisiana.edu (daemon@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6LCXqpQ021196 for ; Thu, 21 Jul 2005 07:33:52 -0500 (CDT) Received: (from daemon@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j6LCXqxS021195 for reliable_computing-outgoing; Thu, 21 Jul 2005 07:33:52 -0500 (CDT) Received: from interval.louisiana.edu (rbk5287@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6LCXnV4021191 for ; Thu, 21 Jul 2005 07:33:49 -0500 (CDT) Received: (from rbk5287@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j6LCXnkY021190 for reliable_computing [at] interval [dot] louisiana.edu; Thu, 21 Jul 2005 07:33:49 -0500 (CDT) Received: from web30203.mail.mud.yahoo.com (web30203.mail.mud.yahoo.com [68.142.200.86]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with SMTP id j6L4if2q020207 for ; Wed, 20 Jul 2005 23:44:47 -0500 (CDT) Received: (qmail 56915 invoked by uid 60001); 21 Jul 2005 04:44:19 -0000 DomainKey-Signature: a=rsa-sha1; q=dns; c=nofws; s=s1024; d=yahoo.com; h=Message-ID:Received:Date:From:Subject:To:MIME-Version:Content-Type:Content-Transfer-Encoding; b=sjOnamC2b7kpnEGDfPw80FSL4GYLTtjY00x/P15IG4XFa+cUnSQZ1s69HHSAeddPrnOdm+ksBQCQdJoI8DL2M2++7wM2TjZu/tTbdm0vhV/+jqKCeQXtLVhsrxMmUjWaSpVcjLOWRHauNOmTG0Wgd6iwI3F1NT5Uv8JS3EVj9Xw= ; Message-ID: <20050721044419.56913.qmail [at] web30203 [dot] mail.mud.yahoo.com> Received: from [203.144.160.246] by web30203.mail.mud.yahoo.com via HTTP; Wed, 20 Jul 2005 21:44:19 PDT Date: Wed, 20 Jul 2005 21:44:19 -0700 (PDT) From: Tanin Na Nakorn Subject: Please help me. I need an interval distribution. To: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: 8bit Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Hello sir, I need "interval distribution". for example, there are d intervals is the system. and i want to know probability of there situations. 1) all of intervals are overlap. 2) there are k intervals overlap. 3) no intervals are overlap. and more ... about overlapping. Is there any formula or study about distribution of interval data? Please help me. Thank you very much. PS. I'm not good at English. Please forgive me for miuse of English. Tanin Na Nakorn __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com From owner-reliable_computing [at] interval [dot] louisiana.edu Thu Jul 21 14:21:40 2005 Received: from interval.louisiana.edu (daemon@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6LJLeKm021798 for ; Thu, 21 Jul 2005 14:21:40 -0500 (CDT) Received: (from daemon@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j6LJLeEg021797 for reliable_computing-outgoing; Thu, 21 Jul 2005 14:21:40 -0500 (CDT) Received: from vms044pub.verizon.net (vms044pub.verizon.net [206.46.252.44]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6LJLVMY021793 for ; Thu, 21 Jul 2005 14:21:37 -0500 (CDT) Received: from [192.0.0.24] ([68.236.164.14]) by vms044.mailsrvcs.net (Sun Java System Messaging Server 6.2 HotFix 0.04 (built Dec 24 2004)) with ESMTPA id <0IJZ00JDZSFAL721 [at] vms044 [dot] mailsrvcs.net> for reliable_computing [at] interval [dot] louisiana.edu; Thu, 21 Jul 2005 14:21:11 -0500 (CDT) Date: Thu, 21 Jul 2005 15:14:16 -0400 From: Scott Ferson Subject: Re: Please help me. I need an interval distribution. In-reply-to: <20050721044419.56913.qmail [at] web30203 [dot] mail.mud.yahoo.com> To: Tanin Na Nakorn , reliable_computing [at] interval [dot] louisiana.edu Message-id: <42DFF408.20403 [at] ramas [dot] com> MIME-version: 1.0 Content-type: text/plain; charset=ISO-8859-1; format=flowed Content-transfer-encoding: 7bit X-Accept-Language: en-us, en References: <20050721044419.56913.qmail [at] web30203 [dot] mail.mud.yahoo.com> User-Agent: Mozilla Thunderbird 1.0.2 (Windows/20050317) Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear Tanin Na Nakorn: We're currently working on a report on interval statistics, or statistics for data sets which contain intervals rather than only point estimates. Maybe that will be interesting to you. I can send you an early draft in a couple of days. If you give me your postal address, I'll put you on the distribution list as well. Perhaps when you see the report, you can suggest what statistics in particular you might be interested in. Scott Ferson Applied Biomathematics Tanin Na Nakorn wrote: >Hello sir, > >I need "interval distribution". > >for example, > >there are d intervals is the system. and i want to >know probability of there situations. > >1) all of intervals are overlap. >2) there are k intervals overlap. >3) no intervals are overlap. >and more ... about overlapping. > >Is there any formula or study about distribution of >interval data? > >Please help me. > >Thank you very much. > >PS. I'm not good at English. Please forgive me for >miuse of English. > >Tanin Na Nakorn > >__________________________________________________ >Do You Yahoo!? >Tired of spam? Yahoo! Mail has the best spam protection around >http://mail.yahoo.com > > > From owner-reliable_computing [at] interval [dot] louisiana.edu Fri Jul 22 15:00:40 2005 Received: from interval.louisiana.edu (daemon@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6MK0e5i023827 for ; Fri, 22 Jul 2005 15:00:40 -0500 (CDT) Received: (from daemon@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j6MK0ekQ023826 for reliable_computing-outgoing; Fri, 22 Jul 2005 15:00:40 -0500 (CDT) Received: from interval.louisiana.edu (rbk5287@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6MK0bFo023822 for ; Fri, 22 Jul 2005 15:00:37 -0500 (CDT) Received: (from rbk5287@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j6MK0at5023821 for reliable_computing [at] interval [dot] louisiana.edu; Fri, 22 Jul 2005 15:00:36 -0500 (CDT) Received: from wminf0.math.uni-wuppertal.de (wminf0.math.uni-wuppertal.de [132.195.94.17]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6LH5EPc021685 for ; Thu, 21 Jul 2005 12:05:20 -0500 (CDT) Received: from math.uni-wuppertal.de (wmwr3.math.uni-wuppertal.de [132.195.95.67]) by wminf0.math.uni-wuppertal.de (8.9.3+Sun/8.9.3) with ESMTP id TAA07455; Thu, 21 Jul 2005 19:05:07 +0200 (MEST) Message-ID: <42DFD5C3.9030806 [at] math [dot] uni-wuppertal.de> Date: Thu, 21 Jul 2005 19:05:07 +0200 From: Markus Grimmer User-Agent: Mozilla/5.0 (X11; U; SunOS sun4u; en-US; rv:0.9.4.1) Gecko/20020518 Netscape6/6.2.3 X-Accept-Language: en-us MIME-Version: 1.0 To: reliable_computing [at] interval [dot] louisiana.edu CC: Ray Moore Subject: Re: Fredholm-second kind References: <005001c58de9$a43091b0$0202a8c0@Moore> Content-Type: text/html; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk Dear Mr Moore

I can contribute the following references.

Klein, Wolfram
Zur Einschließung der Lösung von linearen und nichtlinearen Fredholmschen Integralgleichungssystemen zweiter Art / von Wolfram Klein, 1990. Karlsruhe, Univ., Diss., 1990

This dissertation is in German, but there's a summarizing article in English the following book:

Scientific computing with automatic result verification / ed. by E. Adams ... - Boston : Academic Press, 1993. -
(Mathematics in science and engineering ; 189)
ISBN: 0-12-044210-8

In the same volume, there's also an article by Hans-Juergen Dobner on different kinds of integral equations.


Best regards
Markus Grimmer


Ray Moore wrote:
Dear All,
 
Is there any published work on interval methods for Fredholm integral equations of the second kind ?
If you know of such work, I would very much appreciate your emailing me references.
 
Thanks !
 
Ramon Moore
 
 

-- 
---------------------------------------------------------------------------
Markus Grimmer

Scientific Computing / Software Engineering
Faculty of Mathematics and Natural Sciences
University of Wuppertal
Gaussstr. 20 (G.15.29), 42097 Wuppertal, Germany

Phone +49-202-439-3136
Email markus.grimmer [at] math [dot] uni-wuppertal.de
Web   http://www.math.uni-wuppertal.de/wrswt
---------------------------------------------------------------------------


From owner-reliable_computing [at] interval [dot] louisiana.edu Mon Jul 25 15:11:12 2005 Received: from interval.louisiana.edu (daemon@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6PKBBf7000234 for ; Mon, 25 Jul 2005 15:11:11 -0500 (CDT) Received: (from daemon@localhost) by interval.louisiana.edu (8.13.1/8.13.1/Submit) id j6PKBBm7000233 for reliable_computing-outgoing; Mon, 25 Jul 2005 15:11:11 -0500 (CDT) Received: from itdsrvmail01.utep.edu (itdsrvmail01.utep.edu [129.108.0.82]) by interval.louisiana.edu (8.13.1/8.13.1/ull-interval-math-majordomo-1.5) with ESMTP id j6PKB1O9000229 for ; Mon, 25 Jul 2005 15:11:07 -0500 (CDT) X-MimeOLE: Produced By Microsoft Exchange V6.5.7226.0 Content-class: urn:content-classes:message MIME-Version: 1.0 Content-Type: multipart/alternative; boundary="----_=_NextPart_001_01C59154.F79553A2" Subject: RCA'06: deadline extended: forwarding Date: Mon, 25 Jul 2005 14:10:56 -0600 Message-ID: <77B4C8824930004AAC10E1B01576254A603670 [at] itdsrvmail01 [dot] utep.edu> X-MS-Has-Attach: X-MS-TNEF-Correlator: Thread-Topic: RCA'06: deadline extended: forwarding Thread-Index: AcWRVPeQHY0Fj4sWS9u8KTREqh58nQ== From: "Kreinovich, Vladik" To: Cc: "Ceberio, Martine" Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk This is a multi-part message in MIME format. ------_=_NextPart_001_01C59154.F79553A2 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable Please note that submission is now electronic ******************************************************************=09 =09 Technical track on: Reliable Computations and their Applications (RCA'06) =20 RCA'06 is the second edition of this technical track, on Reliable Computations and their Applications, with a particular emphasis on combining interval and constraint satisfaction techniques. It will be held at SAC'06 between April 23 and 27, in Dijon (France). http://www.cs.utep.edu/mceberio/Research/Conferences/RCA06/ =20 NEWS! Deadline extended to September, 1st, 2005 Read again the submission guidelines =20 SAC'2006 =20 For the past twenty years, the ACM Symposium on Applied Computing (SAC) has been a primary gathering forum for applied computer scientists, computer engineers, software engineers, and application developers from around the world. SAC 2006 is sponsored by the ACM Special Interest Group on Applied Computing, hosted by the University of Bourgogne, and held in Dijon, France. =20 Overview of RCA'06: =20 Many numerical computations, be they solutions to systems of differential equations or optimization problems coming from applied areas like protein folding, do not provide us with guaranteed computation results. In many situations, we have numerical solutions, we may even have a theorem guaranteeing that, eventually, this numerical solution tends to the actual precise one, but the algorithm itself does not provide us with guaranteed bounds on the difference between the numerical approximate solution and the desired actual one. =20 Therefore, in some practical situations, numerical solutions are much farther from the actual (unknown) precise solutions than the users assume. As a result, we often end up with inefficient local maxima for practical optimization problems like chemical engineering - or even with a mission failure if we are planning, e.g., a spaceship trajectory. For some such algorithms, researchers have found such guaranteed bounds, but producing such a bound for each algorithm requires a lot of work. =20 It is therefore desirable to develop a methodology that would provide algorithms with automatic result verification, i.e., with automatically generated upper bound on the difference between the actual and the numerical solution. In other words, we need computation techniques that produce reliable (guaranteed) results. =20 This problem was recognized already in the 1950s. The corresponding techniques, largely developed by Ramon E. Moore, were later applied in guaranteeing trajectories of spaceflights and in other practical problems where deviations from the target are of critical importance. The main idea behind these techniques is that at any intermediate step of the computations, instead of the exact number, we keep an interval of possible values. For inputs (that usually come from measurements), we have an interval because measurements are never 100% accurate; if the manufacturer of the measuring instrument guarantees that the measurement error is D or smaller, then the measuring result X means that the actual value is in the interval [X-D,X+D]. At each elementary computational step, we apply interval arithmetic to the corresponding intervals and produce the interval for the result; e.g., [a,b]+[c,d] leads to [a+c,b+d]. Of course, this "straightforward interval computation", that does not take dependence between intermediate results into consideration, does not always lead to efficient estimates. However, in the last 40+ years, efficient interval computations methods have been developed based on this original idea. There are a lot of interesting applications of interval computations, there is a lot of potential, but there are still a lot of open problems, situations where new techniques are needed. =20 Of course, this "straightforward interval computation", that does not take dependence between intermediate results into consideration, does not always lead to efficient estimates. However, in the last 40+ years, efficient interval computations methods have been developed based on this original idea. There are a lot of interesting applications of interval computations, there is a lot of potential, but there are still a lot of open problems, situations where new techniques are needed. =20 Let us emphasize that, besides handling the uncertainty due to measurements, intervals also prove to be very convenient and useful when it comes to performing computations with inherent uncertainty. This is the case for instance when a quantity is not known precisely (e.g., the length of a mechanic component only known to lie between 12 and 13 cm). Intervals enable to take this kind of incomplete knowledge into account, which other approaches mainly fail to handle. =20 One such technique that has also been used to provide guaranteed bounds is the technique of constraint propagation. This technique originated in logical AI problems, and it has been lately successfully applied to numerical problems, often in conjunction with interval methods. For example, one of the latest textbooks on interval computations, by Jaulin et al., contains robot-related practical examples of combining these two techniques. This combination has started, it is the object of interest by many researchers, it has already led to interesting and efficient packages like Numerica, but there is still a lot of room for potential improvement. =20 Scope of RCA'06: =20 We hope that our track, with an emphasis on such a combination, will bring together not only algorithm developers but also practitioners whose practical needs will help guide researchers in the proper directions. =20 Authors are invited to submit original papers in all areas related to the track's topics.=20 =20 Possible submissions fall into the following categories:=20 =20 Original and unpublished research work =20 Report of innovative computing applications in the arts, sciences, engineering, and business areas=20 =20 Report of successful technology transfer to new problem domains =20 Report of industrial experience and demos of new innovative systems=20 =20 We encourage in particular the submission of work in progress, of work on very specialized aspects of interval computations and/or interval constraint propagation, and of work emphasizing real applications of/need for reliable computations. =20 The authors should send their papers electronically to Martine Ceberio. Peer groups with expertise in the track focus area will blindly review submissions to that track. Therefore the authors should submit anonymous versions of their paper(s). Accepted papers will be published in the annual conference proceedings. Submission guidelines will be posted on SAC 2006 Website. =20 Submission: =20 The deadline for submission is September 1st, 2005. Prospective authors should send their papers electronically to Martine Ceberio, with "[RCA'06] Submission" as the subject of the e-mail. In addition, the paper should be: no more than 5 pages long; submitted in postscript or pdf format; without the authors' names; formatted using the IEEE style (for information, you can find here, the zip files of the instruction to Authors of SAC'05; updated information will be posted here as soon as available). =20 IMPORTANT INFORMATION: Every author must ALSO register their paper(s) and submit the abstract(s) before the abstract submission deadline date (September 1, 2005). In order to register the paper, the author must submit the electronic form, available at the webpage. =20 Abstract Submission Guidelines: Authors must register their intent to submit a paper by submitting an electronic abstract (in text format) of a maximum length of 200 words by the due date prior to the actual submission and obtain a paper identification number. Prior to submitting the abstract, authors will be required to register as users on the system. Once an author has submitted an abstract, he/she will receive a confirmation email with instructions on submitting the paper. The format of the submitted paper must be PDF or Postscript. =20 Let us also recall the prospective authors that the acceptance rate at SAC is set to 33 to 36%. Therefore, we strongly encourage authors not to hesitate to submit several articles. =20 Important dates: =20 Paper Submission deadline September, 1st Notification of acceptance October, 15th Camera-ready version deadline November, 5th =20 Conference venue: =20 Dijon, former capital of the Dukes of Burgundy, is a town steeped in history, proud heir to a rich architectural legacy. Dijon is one of the first sectors safeguarded in France; Dijon accounts for 97 ha of nationally classed monuments very well preserved. Lying at the gates of the famous vineyards of the C=F4te de Nuits, Dijon is also one of the glories of the French gastronomic tradition, known throughout the world for its mustard, blackcurrant liqueur, gingerbread, etc. It is also a university town, a business and cultural centre boasting a wide and varied choice of hotels, an auditorium and extensive reception facilities capable of hosting all kinds of events. =20 For more information, please visit either of the following websites: Office de tourisme: here Dijon maps and visitor information: here Sightseeing in Dijon: here The best of Dijon: here =20 Organizing committee: Martine Ceberio (Primary contact) University of Texas at El Paso - USA e-mail: mceberio [at] cs [dot] utep.edu url: http://www.cs.utep.edu/mceberio Vladik Kreinovich University of Texas at El Paso - USA e-mail: vladik [at] cs [dot] utep.edu http://www.cs.utep.edu/vladik Michel Rueher e-mail: rueher [at] essi [dot] fr http://www.essi.fr/~rueher =20 ------_=_NextPart_001_01C59154.F79553A2 Content-Type: text/html; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable =0A=
Please note that submission is now electronic
=0A=
=0A= =0A= =0A= =0A= =0A= =0A=
*********************************************************= *********
=0A=
Technical track on: Reliable Computations and their =0A= Applications
(RCA'06)
=0A=
 
=0A=
RCA'06 is the second edition of this technical track, on =0A= Reliable
Computations and their Applications, with a particular = emphasis =0A= on
combining interval and constraint satisfaction techniques. It = will
be =0A= held at SAC'06 between April 23 and 27, in Dijon = (France).
=0A= =0A=
 
=0A=
NEWS! Deadline extended to September, 1st, 2005 Read again =0A= the
submission guidelines
=0A=
 
=0A=
SAC'2006
=0A=
 
=0A=
For the past twenty years, the ACM Symposium on Applied = Computing
(SAC) =0A= has been a primary gathering forum for applied computer
scientists, = computer =0A= engineers, software engineers, and
application developers from around = the =0A= world. SAC 2006 is
sponsored by the ACM Special Interest Group on = Applied =0A= Computing,
hosted by the University of Bourgogne, and held in Dijon, =0A= France.
=0A=
 
=0A=
Overview of RCA'06:
=0A=
 
=0A=
Many numerical computations, be they solutions to systems =0A= of
differential equations or optimization problems coming = from
applied =0A= areas like protein folding, do not provide us with
guaranteed = computation =0A= results. In many situations, we have
numerical solutions, we may even = have a =0A= theorem guaranteeing that,
eventually, this numerical solution tends = to the =0A= actual precise
one, but the algorithm itself does not provide us with =0A= guaranteed
bounds on the difference between the numerical =0A= approximate
solution and the desired actual one.
=0A=
 
=0A=
Therefore, in some practical situations, numerical solutions = are
much =0A= farther from the actual (unknown) precise solutions than the
users = assume. As =0A= a result, we often end up with inefficient local
maxima for practical =0A= optimization problems like chemical
engineering - or even with a = mission =0A= failure if we are planning,
e.g., a spaceship trajectory. For some = such =0A= algorithms,
researchers have found such guaranteed bounds, but = producing =0A= such
a bound for each algorithm requires a lot of work.
=0A=
 
=0A=
It is therefore desirable to develop a methodology that = would
provide =0A= algorithms with automatic result verification, i.e., = with
automatically =0A= generated upper bound on the difference between the
actual and the = numerical =0A= solution. In other words, we need
computation techniques that produce =0A= reliable (guaranteed) results.
=0A=
 
=0A=
This problem was recognized already in the 1950s. The =0A= corresponding
techniques, largely developed by Ramon E. Moore, were = later =0A= applied
in guaranteeing trajectories of spaceflights and in other =0A= practical
problems where deviations from the target are of critical =0A= importance.
=0A=
The main idea behind these techniques is that at any = intermediate
step =0A= of the computations, instead of the exact number, we keep an
interval = of =0A= possible values. For inputs (that usually come from
measurements), we = have an =0A= interval because measurements are never
100% accurate; if the = manufacturer of =0A= the measuring instrument
guarantees that the measurement error is D = or =0A= smaller, then the
measuring result X means that the actual value is = in the =0A= interval
[X-D,X+D]. At each elementary computational step, we apply =0A= interval
arithmetic to the corresponding intervals and produce the =0A= interval
for the result; e.g., [a,b]+[c,d] leads to [a+c,b+d]. Of =0A= course,
this "straightforward interval computation", that does not =0A= take
dependence between intermediate results into consideration, = does
not =0A= always lead to efficient estimates. However, in the last 40+
years, = efficient =0A= interval computations methods have been developed
based on this = original =0A= idea. There are a lot of interesting
applications of interval = computations, =0A= there is a lot of potential,
but there are still a lot of open = problems, =0A= situations where new
techniques are needed.
=0A=
 
=0A=
Of course, this "straightforward interval computation", that = does
not =0A= take dependence between intermediate results into
consideration, does = not =0A= always lead to efficient estimates.
However, in the last 40+ years, = efficient =0A= interval computations
methods have been developed based on this = original =0A= idea. There are
a lot of interesting applications of interval = computations, =0A= there
is a lot of potential, but there are still a lot of open =0A= problems,
situations where new techniques are needed.
=0A=
 
=0A=
Let us emphasize that, besides handling the uncertainty due =0A= to
measurements, intervals also prove to be very convenient = and
useful =0A= when it comes to performing computations with inherent
uncertainty. = This is =0A= the case for instance when a quantity is not
known precisely (e.g., = the =0A= length of a mechanic component only
known to lie between 12 and 13 = cm). =0A= Intervals enable to take this
kind of incomplete knowledge into = account, =0A= which other approaches
mainly fail to handle.
=0A=
 
=0A=
One such technique that has also been used to provide = guaranteed
bounds =0A= is the technique of constraint propagation. This technique
originated = in =0A= logical AI problems, and it has been lately
successfully applied to = numerical =0A= problems, often in conjunction
with interval methods. For example, = one of the =0A= latest textbooks on
interval computations, by Jaulin et al., contains =0A= robot-related
practical examples of combining these two techniques. =0A= This
combination has started, it is the object of interest by =0A= many
researchers, it has already led to interesting and = efficient
packages =0A= like Numerica, but there is still a lot of room for
potential =0A= improvement.
=0A=
 
=0A=
Scope of RCA'06:
=0A=
 
=0A=
We hope that our track, with an emphasis on such a = combination,
will =0A= bring together not only algorithm developers but also
practitioners = whose =0A= practical needs will help guide researchers in
the proper = directions.
=0A=
 
=0A=
 Authors are invited to submit original
papers in all areas = related =0A= to the track's topics.
=0A=
 
=0A=
Possible
submissions fall into the following categories:
=0A=
 
=0A=
Original and
unpublished research work
=0A=
 
=0A=
 Report of innovative computing
applications in the arts, = sciences, =0A= engineering, and business
areas
=0A=
 
=0A=
Report of successful technology transfer to new = problem
domains
=0A=
 
=0A=
 Report of industrial experience and demos of = new
innovative =0A= systems
=0A=
 
=0A=
We encourage in particular the submission of
work in progress, = of work =0A= on very specialized aspects of interval
computations and/or interval =0A= constraint propagation, and of work
emphasizing real applications = of/need for =0A= reliable computations.
=0A=
 
=0A=
The authors should send their papers electronically to = Martine
Ceberio. =0A= Peer groups with expertise in the track focus area will
blindly = review =0A= submissions to that track. Therefore the authors
should submit = anonymous =0A= versions of their paper(s). Accepted
papers will be published in the = annual =0A= conference proceedings.
=0A=
Submission guidelines will be posted on SAC 2006 Website.
=0A=
 
=0A=
Submission:
=0A=
 
=0A=
The deadline for submission is September 1st, 2005. = Prospective
authors =0A= should send their papers electronically to Martine
Ceberio, with = "[RCA'06] =0A= Submission" as the subject of the e-mail.
=0A=
In addition, the paper should be:
=0A=
no more than 5 pages long; submitted in postscript or pdf =0A= format;
without the authors' names; formatted using the IEEE style =0A= (for
information, you can find here, the zip files of the = instruction
to =0A= Authors of SAC'05; updated information will be posted here as
soon as =0A= available).
=0A=
 
=0A=
IMPORTANT INFORMATION: Every author must ALSO register = their
paper(s) =0A= and submit the abstract(s) before the abstract submission
deadline = date =0A= (September 1, 2005). In order to register the paper,
the author must = submit =0A= the electronic form, available at the webpage.
=0A=
 
=0A=
Abstract Submission Guidelines: Authors must register their = intent
to =0A= submit a paper by submitting an electronic abstract (in text
format) = of a =0A= maximum length of 200 words by the due date prior to
the actual = submission =0A= and obtain a paper identification number.
=0A=
Prior to submitting the abstract, authors will be required = to
register =0A= as users on the system. Once an author has submitted an
abstract, = he/she will =0A= receive a confirmation email with
instructions on submitting the = paper. The =0A= format of the submitted
paper must be PDF or Postscript.
=0A=
 
=0A=
Let us also recall the prospective authors that the acceptance = rate
at =0A= SAC is set to 33 to 36%. Therefore, we strongly encourage
authors not = to =0A= hesitate to submit several articles.
=0A=
 
=0A=
Important dates:
=0A=
 
=0A=
 Paper Submission deadline
 September, = 1st
Notification of =0A= acceptance
 October, 15th
Camera-ready version =0A= deadline
 November, 5th
=0A=
 
=0A=
Conference venue:
=0A=
 
=0A=
Dijon, former capital of the Dukes of Burgundy, is a town = steeped
in =0A= history, proud heir to a rich architectural legacy. Dijon is
one of = the first =0A= sectors safeguarded in France; Dijon accounts for
97 ha of nationally = classed =0A= monuments very well preserved. Lying
at the gates of the famous = vineyards of =0A= the C=F4te de Nuits, Dijon
is also one of the glories of the French = gastronomic =0A= tradition,
known throughout the world for its mustard, blackcurrant =0A= liqueur,
gingerbread, etc. It is also a university town, a business =0A= and
cultural centre boasting a wide and varied choice of hotels, =0A= an
auditorium and extensive reception facilities capable of = hosting
all =0A= kinds of events.
=0A=
 
=0A=
For more information, please visit either of the = following
websites: =0A= Office de tourisme: here Dijon maps and visitor
information: here = Sightseeing =0A= in Dijon: here The best of Dijon:
here
=0A=
 
=0A=
Organizing committee:
=0A=

Martine Ceberio (Primary contact) University of Texas at El = Paso =0A= -
USA e-mail: mceberio [at] cs [dot] utep.edu =0A= url:
http://www.cs.utep.edu/mceberio<= /A>
=0A=

Vladik Kreinovich University of Texas at El Paso - USA = e-mail:
vladik [at] cs [dot] utep.edu http://www.cs.utep.edu/vladik<= /DIV>=0A= =0A=
 
------_=_NextPart_001_01C59154.F79553A2-- From owner-reliable_computing [at] interval [dot] louisiana.edu Wed Jul 27 10:33:07 2005 Received: from interval.louisiana.edu (daemon@localhost [127.0.0.1]) by interval.louisiana.edu (8.13.1/8.13.4/ull-interval-math-majordomo-1.5) with ESMTP id j6REIDVc004023 for ; Wed, 27 Jul 2005 09:18:13 -0500 (CDT) Received: (from daemon@localhost) by interval.louisiana.edu (8.13.1/8.13.4/Submit) id j6REIDGE004022 for reliable_computing-outgoing; Wed, 27 Jul 2005 09:18:13 -0500 (CDT) Received: from imap1u.univie.ac.at (imap1.unet.univie.ac.at [131.130.1.182]) by interval.louisiana.edu (8.13.1/8.13.4/ull-interval-math-majordomo-1.5) with ESMTP id j6REI3VZ004018 for ; Wed, 27 Jul 2005 09:18:10 -0500 (CDT) Received: from [131.130.16.23] (theseus.mat.univie.ac.at [131.130.16.23]) (authenticated bits=0) by imap1u.univie.ac.at (8.12.10/8.12.10) with ESMTP id j6REHOhO067353 (version=TLSv1/SSLv3 cipher=DHE-RSA-AES256-SHA bits=256 verify=NO); Wed, 27 Jul 2005 16:17:26 +0200 (CEST) Message-ID: <42E79774.4080202 [at] univie [dot] ac.at> Date: Wed, 27 Jul 2005 16:17:24 +0200 From: Arnold Neumaier Organization: University of Vienna User-Agent: Mozilla Thunderbird 1.0.6-1.1.fc3 (X11/20050720) X-Accept-Language: en-us, en MIME-Version: 1.0 To: reliable computing , John.Busch [at] sun [dot] com Subject: Re: Sun interval patents References: In-Reply-To: Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: 7bit X-DCC-ZID-Univie-Metrics: mx9.univie.ac.at 4248; Body=3 Fuz1=3 Fuz2=3 Sender: owner-reliable_computing [at] interval [dot] louisiana.edu Precedence: bulk George Corliss wrote: > Suppose Bill had agreed with my perspective and told his boss, "There is > nothing new here." How does he look? Further, suppose that instead of Sun, > someone else, say from a few hundred miles further north, submitted exactly > the same patent applications as Sun did. That firm almost surely would have > forced Sun to remove intervals from their Fortran, C++, and other software > (and probably hardware). If it would have forced the powerful Sun to remove intervals from their software, how much more will it force us to the same step now that Sun has already done what you pictured only as a ficticious scenario. Thus if Sun felt threatened by the prospect of someone possibly issue patents, shouldn't we feel even more threatened by Sun actually having issued patents??! > Scenario 1: You have a great idea. You publish it. You go to a company and > propose they commercialize it. They decline, because their competitor can > read your article and bring the same product to market. Neither does their > competitor see an opportunity for competitive advantage. Result: Your great > idea counts for tenure. Period. > > Scenario 2: You have a great idea. You file for patent protection. You > publish it. You go to a company and propose they commercialize it. Now, > you can offer them a guaranteed monopoly in the market, giving them a > potential competitive advantage. Result: Your great idea counts for tenure, > AND it generates revenue to fund continued research. Scenario 3: Others have great ideas and publish them. You file for patent protection... This is what Sun did. > The goal of the interval research community has long been to get practicing > scientists and engineers to use our work. We want people to use our stuff? > Then we are offended when Sun thinks there might be some commercial value > and competitive advantage? Hello!? We are threatened not by commercial exploitation of our ideas, nor by having patented their own ideas, but by having patented the existing state of the art and thus threatening to force us to pay for publicly long available ideas... > > Sun is our ally. They are offer major vendor support for intervals in their > compilers, and they are aggressively promoting intervals to their customers. Sun is our threat. They now have (and are the only ones with) legal power to put an end to the use of interval software outside Sun's reach. > In short, I see multiple sides. I wish the world were simpler, but it is > not, and wishing does not make it so. > WE NEED SIGNIFICANT APPLICATIONS, AND WE NEED TO COMMUNICATE > THEM TO PRACTICING SCIENTISTS AND ENGINEERS. It would be foolish to communicate them to Sun. They would patent them like they patented interval multiplication and other things... In view of Sun's policy it becomes wisdom to be secretive. The scientific world of interval computations has become a worse place because of them. Arnold Neumaier ============================================================================== Ray Moore wrote: > > As a result of my previous email to this group, I have been contacted by > John Busch of Sun Microsystems, and informed that anyone with specific > concerns about Sun's interval patents should contact him at > John.Busch [at] sun [dot] com > > best regards, > > Ray Moore