From owner-reliable_computing [at] interval [dot] usl.edu Sat Apr 1 07:38:39 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id HAA15309 for reliable_computing-outgoing; Sat, 1 Apr 2000 07:38:39 -0600 (CST) Received: from argo.bas.bg (root [at] argo [dot] bas.bg [195.96.224.7]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id HAA15304 for ; Sat, 1 Apr 2000 07:38:35 -0600 (CST) Received: from iph.bio.bas.bg (IDENT:0@bas-bio.lines.bas.bg [195.96.252.58]) by argo.bas.bg (8.9.3/8.9.3/Debian 8.9.3-6) with ESMTP id QAA08631; Sat, 1 Apr 2000 16:38:24 +0300 X-Authentication-Warning: argo.bas.bg: Host IDENT:0@bas-bio.lines.bas.bg [195.96.252.58] claimed to be iph.bio.bas.bg Received: from biomath.bio.bas.bg (biomath.bio.bas.bg [195.96.247.160]) by iph.bio.bas.bg (8.9.3/8.9.3) with SMTP id QAA24986; Sat, 1 Apr 2000 16:40:23 +0300 Message-Id: <200004011340.QAA24986 [at] iph [dot] bio.bas.bg> Comments: Authenticated sender is From: "Svetoslav Markov" Organization: Institute of Mathematics, BAS To: reliable_computing [at] interval [dot] usl.edu Date: Sat, 1 Apr 2000 15:42:35 +0200 Subject: (Fwd) Communication of last JCA Contents Reply-to: smarkov [at] iph [dot] bio.bas.bg CC: "Norbert Heldermann" Priority: normal X-mailer: Pegasus Mail for Windows (v2.23) Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear Colleagues, Intervals are special case of convex bodies (compact convex sets). There is a strong interrelation between interval analysis and convex analysis. I asked Prof. Heldermann, Editor of Journal of Convex Analysis (JCA) to communicate the contenst of JCA to our mailing list. Prof. Heldermann, please send next JCA contents directly to the RC mailing list. S. Markov ------- Forwarded Message Follows ------- Reply-to: "Norbert Heldermann" From: "Norbert Heldermann" To: Subject: Communication of last JCA Contents Date: Fri, 31 Mar 2000 22:53:25 +0200 Dear Prof. Markov, I thank you for your offer to communicate the contents of the Journal of Convex Analysis in the RC mailing list. Here is my last communication, concerning the publication of Volume 6 (1999), Number 2. The first issue of Volume 7 (2000) will be published in May 2000. You find the list of contents of this issue together with abstracts also on our web site: www.heldermann.de/jcacon.htm. Journal of Convex Analysis, Volume 6 (1999), Number 2: R. Molle, D. Passaseo: Variational Problems with Pointwise Constraints on the Derivatives, 215--234 T. Pennanen: Graph-Convex Mappings and K-Convex Functions, 235--266 M. El Jarroudi: Boundary Homogenization for a Quasi-Linear Elliptic Problem with Dirichlet Boundary Conditions Posed on Small Inclusions Distributed on the Boundary, 267--292 R. Dziri, J.-P. Zolesio: Dynamical Shape Control in Non-Cylindrical Navier- Stokes Equations, 293--318 L. M. Bregman, Y. Censor, S. Reich: Dykstra's Algorithm as the Nonlinear Extension of Bregman's Optimization Method, 319--334 K. E. Kim: Relationship Between Dynamic Programming and the Maximum Principle Under State Constraints, 335--348 G. Bellettini, G. Bouchitte, I. Fragala: BV Functions with Respect to a Measure and Relaxation of Metric Integral Functionals, 349--366 D. Pallaschke, R. Urbanski: Invariants of Pairs of Compact Convex Sets, 367--376 J. Morgan, R. Raucci: New Convergence Results for Nash Equilibria, 377--386 F. Huesseinov: A Note on the Closedness of the Convex Hull and Its Applications, 387--394 J. Bair, J. C. Dupin: The Barrier Cone of a Convex Set and the Closure of the Cover, 395--398 Forthcoming papers are listed on the page www.heldermann.de/jcafopa.htm. Communicated by Norbert Heldermann, Heldermann Verlag www.heldermann.de From owner-reliable_computing [at] interval [dot] usl.edu Sun Apr 2 15:40:10 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id PAA17726 for reliable_computing-outgoing; Sun, 2 Apr 2000 15:40:10 -0500 (CDT) Received: from relay.rhein-main.de (root [at] hermes [dot] rhein-main.de [195.37.8.6]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id PAA17721 for ; Sun, 2 Apr 2000 15:40:05 -0500 (CDT) Received: from menuett.rhein-main.de (menuett.rhein-main.de [195.37.9.79]) by relay.rhein-main.de (8.9.3/8.9.3) with ESMTP id WAA10639; Sun, 2 Apr 2000 22:31:59 +0200 Message-ID: <38E7AF96.40B3208E [at] menuett [dot] rhein-main.de> Date: Sun, 02 Apr 2000 22:37:42 +0200 From: Jens Maurer X-Mailer: Mozilla 4.7 [en] (X11; I; Linux 2.3.99-pre3 i686) X-Accept-Language: en MIME-Version: 1.0 To: "R. Baker Kearfott" CC: reliable_computing [at] interval [dot] louisiana.edu Subject: Re: New C++ Library for Interval Arithmetic References: <2.2.32.20000314225128.0074e188 [at] pop [dot] usl.edu> Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk "R. Baker Kearfott" wrote: [Explanation of Fortran situation] The C++ situation is different in that a "naturally" looking interval implementation is possible with existing language features (except for rounding mode control), thus there is not need for modifying the compilers. Of course, if compilers knew how to deal with rounding mode changes, performance would benefit. > I am hoping that we will all examine Sun's Fortran compiler. Since Sun's Fortran compiler is a commercial software package and I don't know any Fortran at all, this seems currently out of my reach. > The above has been the subject of some controversy. My perception > is that, in some contexts, you will want to throw an exception, > and, in others, you will want to continue. Ok, there's a need for a compile-time configuration flag. > Fortran does not have > user-defined exceptions. The reasons, as I understand them, > include efficiency. Fortran is a very good array-processing language, > and there are major questions about what to do if an exception > occurs in a component while an array operation is executing on > an advanced-architecture machine. By using templates, we can completely eliminate exceptions at compile-time if the application doesn't want any. > Can we race J{\"u}rgen's package and yours under similar conditions? I've performance-optimized my implementation for the basic arithmetic operations (trigonometric functions still have containment failures) and put it at the usual place at http://www.rhein-main.de/people/jmaurer/interval.tar.gz including the test program. There's a performance overview at http://www.rhein-main.de/people/jmaurer/interval_speed.html I have yet to see J\"urgen's code. > By the way, in developing template-like features in Fortran 200x, > a consideration of the standardization committee was "avoiding > performance hits as you see in C++". Several C++ experts believe that the C++ language features do not prohibit efficient implementations. However, current compilers may still be lacking. The template-based C++ linear algebra packages (blitz++ and MTL come to my mind) do compare themselves with Fortran and claim to outperform Fortran sometimes (both with decent compilers, of course). Jens Maurer. From owner-reliable_computing [at] interval [dot] usl.edu Sun Apr 2 16:10:10 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id QAA18070 for reliable_computing-outgoing; Sun, 2 Apr 2000 16:10:09 -0500 (CDT) Received: from marnier.ucs.usl.edu (root@ucs-gw.usl.edu [130.70.40.2]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id QAA18065 for ; Sun, 2 Apr 2000 16:10:07 -0500 (CDT) Received: from u8174 (rbk5287 [at] goedel [dot] usl.edu [130.70.49.203]) by marnier.ucs.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.3) with SMTP id QAA29661; Sun, 2 Apr 2000 16:09:50 -0500 (CDT) Message-Id: <2.2.32.20000402210810.00754cd8 [at] pop [dot] usl.edu> X-Sender: rbk5287 [at] pop [dot] usl.edu X-Mailer: Windows Eudora Pro Version 2.2 (32) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Sun, 02 Apr 2000 16:08:10 -0500 To: Jens Maurer From: "R. Baker Kearfott" Subject: Re: New C++ Library for Interval Arithmetic Cc: reliable_computing [at] interval [dot] louisiana.edu, Bill.Walster [at] Eng [dot] Sun.COM Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk At 10:37 PM 4/2/00 +0200, Jens Maurer wrote: > >"R. Baker Kearfott" wrote: >[Explanation of Fortran situation] > >The C++ situation is different in that a "naturally" looking interval >implementation is possible with existing language features (except for >rounding mode control), thus there is not need for modifying the >compilers. Of course, if compilers knew how to deal with rounding >mode changes, performance would benefit. > What do you mean by "natural-looking"? Operator overloading is possible in Fortran without compiler modification, but use of special symbols such as, say "[" and "]" to denote an interval [a,b], is not. Furthermore, good support for overloading I/O will be available, but not before the next Fortran standard is implemented, some time after 2004. Close ties to the computer rounding and also to the intrinsic function libraries are a major argument for having intrinsic compiler support for interval arithmetic. In fact, an efficiency factor of at least 5 is obtainable, even if the overloaded operations are in-lined. The observable factor with actual packages has been much higher than 5. I'd be interested in seeing what Bill Walster has to say about this. >> I am hoping that we will all examine Sun's Fortran compiler. > >Since Sun's Fortran compiler is a commercial software package >and I don't know any Fortran at all, this seems currently out of >my reach. Ah, yes. That, as I see it, is the strongest argument in favor of using C++. Namely, more computer professionals and commercial software houses are using it, especially outside of the large scale numerical computing core. An argument against C++ may be that the standard is in more of a state of flux, and it may be more difficult to write portable code. Is that true? >> Can we race J{\"u}rgen's package and yours under similar conditions? > >I've performance-optimized my implementation for the basic arithmetic >operations (trigonometric functions still have containment failures) >and put it at the usual place at >http://www.rhein-main.de/people/jmaurer/interval.tar.gz >including the test program. There's a performance overview at >http://www.rhein-main.de/people/jmaurer/interval_speed.html > >I have yet to see J\"urgen's code. Does someone volunteer to do the experiments? > >> By the way, in developing template-like features in Fortran 200x, >> a consideration of the standardization committee was "avoiding >> performance hits as you see in C++". > >Several C++ experts believe that the C++ language features do not >prohibit efficient implementations. However, current compilers may >still be lacking. The template-based C++ linear algebra packages >(blitz++ and MTL come to my mind) do compare themselves with Fortran >and claim to outperform Fortran sometimes (both with decent compilers, >of course). > It'll be interesting to see how this develops. Best regards, Baker --------------------------------------------------------------- R. Baker Kearfott, rbk [at] louisiana [dot] edu (337) 482-5346 (fax) (337) 482-5270 (work) (337) 981-9744 (home) URL: http://interval.louisiana.edu/kearfott.html Department of Mathematics, University of Louisiana at Lafayette Box 4-1010, Lafayette, LA 70504-1010, USA --------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] usl.edu Sun Apr 2 17:37:22 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id RAA18470 for reliable_computing-outgoing; Sun, 2 Apr 2000 17:37:22 -0500 (CDT) Received: from narech.irin.univ-nantes.fr (IDENT:root [at] narech [dot] irin.sciences.univ-nantes.fr [193.52.99.2]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id RAA18465 for ; Sun, 2 Apr 2000 17:37:19 -0500 (CDT) Received: from (goualard@localhost) by narech.irin.univ-nantes.fr (8.9.3/jtpda-5.3.2) id AAA26673 ; Mon, 3 Apr 2000 00:37:11 +0200 Date: Mon, 3 Apr 2000 00:37:11 +0200 From: Frederic.Goualard [at] irin [dot] univ-nantes.fr (Frederic Goualard) Message-Id: <200004022237.AAA26673 [at] narech [dot] irin.univ-nantes.fr> To: rbk [at] louisiana [dot] edu Subject: Re: New C++ Library for Interval Arithmetic Cc: jmaurer [at] menuett [dot] rhein-main.de, 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] usl.edu Precedence: bulk Dear Prof. Kearfott, >> >>> By the way, in developing template-like features in Fortran 200x, >>> a consideration of the standardization committee was "avoiding >>> performance hits as you see in C++". >> >>Several C++ experts believe that the C++ language features do not >>prohibit efficient implementations. However, current compilers may >>still be lacking. The template-based C++ linear algebra packages >>(blitz++ and MTL come to my mind) do compare themselves with Fortran >>and claim to outperform Fortran sometimes (both with decent compilers, >>of course). >> > >It'll be interesting to see how this develops. During my PhD thesis, I have developed a C++ interval library in both templated and non-templated versions. I have tested both versions for speed using g++ 1.1.2 on a SUN UltraSparc 1/167 MHz. Please find enclosed herein some timings for basic operations. As you may see, the templated version slightly outperforms the non-templated one. In my humble opinion, an explanation to this is that the compiler has more opportunities to inline the methods from the templated version since then, both the library and the program using it are compiled at the same moment. On the other hand, the compiling time for my benchmarks increases by a factor of about 2.7 when using templates. ------------------------------------------------- Time in milliseconds on a SUN UltraSparc 1/167 MHz with gcc 1.1.2 and -O2 optimization flag for: - 43,226,575 additions - 43,226,575 subtractions - 24,700,900 multiplications - 12,350,450 divisions templated non-templated ---------------------------------- Add: 19,204 34,445 Sub: 17,526 34,543 Mul: 17,220 29,709 Div: 33,105 39,561 Sincerely yours, Frédéric Goualard. From owner-reliable_computing [at] interval [dot] usl.edu Mon Apr 3 10:45:52 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA00508 for reliable_computing-outgoing; Mon, 3 Apr 2000 10:45:52 -0500 (CDT) Received: from lukla.Sun.COM (lukla.Sun.COM [192.18.98.31]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA00503 for ; Mon, 3 Apr 2000 10:45:48 -0500 (CDT) Received: from engmail1.Eng.Sun.COM ([129.146.1.13]) by lukla.Sun.COM (8.9.3+Sun/8.9.3) with ESMTP id JAA29747; Mon, 3 Apr 2000 09:45:42 -0600 (MDT) Received: from ha-sims.eng.sun.com (phys-thestorka.Eng.Sun.COM [129.146.1.231]) by engmail1.Eng.Sun.COM (8.9.1b+Sun/8.9.1/ENSMAIL,v1.6) with ESMTP id IAA14150; Mon, 3 Apr 2000 08:45:41 -0700 (PDT) Received: from gww (gww.Eng.Sun.COM [129.146.78.116]) by ha-sims.eng.sun.com (Sun Internet Mail Server sims.4.0.1999.06.13.00.20) with SMTP id <0FSG0020N6G466@ha-sims.eng.sun.com>; Mon, 3 Apr 2000 08:45:40 -0700 (PDT) Date: Mon, 03 Apr 2000 08:45:41 -0700 (PDT) From: William Walster Subject: Re: New C++ Library for Interval Arithmetic To: jmaurer [at] menuett [dot] rhein-main.de, rbk [at] louisiana [dot] edu Cc: reliable_computing [at] interval [dot] louisiana.edu, Bill.Walster [at] eng [dot] sun.com Reply-to: William Walster Message-id: <0FSG0020O6G466@ha-sims.eng.sun.com> MIME-version: 1.0 X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4m sparc Content-type: TEXT/plain; charset=us-ascii Content-MD5: khRgEi6B1pFdnZlT32hugw== Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk >Date: Sun, 02 Apr 2000 16:08:10 -0500 >From: "R. Baker Kearfott" >Subject: Re: New C++ Library for Interval Arithmetic >X-Sender: rbk5287 [at] pop [dot] usl.edu >To: Jens Maurer >Cc: reliable_computing [at] interval [dot] louisiana.edu, Bill.Walster [at] Eng [dot] Sun.COM >MIME-version: 1.0 > >At 10:37 PM 4/2/00 +0200, Jens Maurer wrote: >> >>"R. Baker Kearfott" wrote: >>[Explanation of Fortran situation] >> >>The C++ situation is different in that a "naturally" looking interval >>implementation is possible with existing language features (except for >>rounding mode control), thus there is not need for modifying the >>compilers. Of course, if compilers knew how to deal with rounding >>mode changes, performance would benefit. >> > >What do you mean by "natural-looking"? Operator overloading is >possible in Fortran without compiler modification, but use of >special symbols such as, say "[" and "]" to denote an interval >[a,b], is not. Furthermore, good support for overloading I/O >will be available, but not before the next Fortran standard is >implemented, some time after 2004. > >Close ties to the computer rounding and also to the intrinsic function >libraries are a major argument for having intrinsic compiler support >for interval arithmetic. In fact, an efficiency factor of at least 5 >is obtainable, even if the overloaded operations are in-lined. The >observable factor with actual packages has been much higher than 5. >I'd be interested in seeing what Bill Walster has to say about this. Baker and Jens, We also have a C++ class implementation that is currently being tested and will be released later this CY. It implements all of the features in the Fortran implementation that are not Fortran-specific. As much as possible, we have used the same spellings for intrinsic functions and operators. Your pointers to existing C++ classes are helpful for the purpose of doing some performance comparisons. We believe that the C++ and Fortran implementations should have similar runtime performance. They both use the same implementation libraries. The key is doing whatever is necessary to provide the interval infrastructure needed for independent software vendors (ISVs) to develop and produce commercial interval applications. Regards, Bill G. William (Bill) Walster, Ph.D. Interval Technology Engineering Manager Sun Microsystems, Inc. 16 Network Circle, MS UMPK16-304 Menlo Park, CA 94025 (650) 786-9004 Direct (650) 786-9551 Fax (800) 759-8888 Pager PIN 171-2423 bill.walster [at] eng [dot] sun.com From owner-reliable_computing [at] interval [dot] usl.edu Mon Apr 3 12:27:27 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id MAA01068 for reliable_computing-outgoing; Mon, 3 Apr 2000 12:27:27 -0500 (CDT) Received: from mailhost2.avanticorp.com (mailhost2.avanticorp.com [208.206.213.19]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id MAA01063 for ; Mon, 3 Apr 2000 12:27:23 -0500 (CDT) Received: from mailhost2.avanticorp.com (root@localhost [127.0.0.1]) by mailhost2.avanticorp.com (8.9.3/8.9.3) with ESMTP id KAA19468 for ; Mon, 3 Apr 2000 10:27:13 -0700 (PDT) Received: (from root@localhost) by mailhost2.avanticorp.com (8.9.3/8.9.3) id KAA19369; Mon, 3 Apr 2000 10:26:45 -0700 (PDT) Received: (from uucp@localhost) by mailhost2.avanticorp.com (8.9.3/8.9.3) id OAA04578 for ; Sun, 2 Apr 2000 14:10:53 -0700 (PDT) Received: from interval.usl.edu(130.70.43.77) via SMTP by asuras.avanticorp.com, id smtpdAAAa0017W; Sun Apr 2 14:10:50 2000 Received: from localhost (daemon@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with SMTP id QAA18113; Sun, 2 Apr 2000 16:10:34 -0500 (CDT) Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id QAA18070 for reliable_computing-outgoing; Sun, 2 Apr 2000 16:10:09 -0500 (CDT) Received: from marnier.ucs.usl.edu (root@ucs-gw.usl.edu [130.70.40.2]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id QAA18065 for ; Sun, 2 Apr 2000 16:10:07 -0500 (CDT) Received: from u8174 (rbk5287 [at] goedel [dot] usl.edu [130.70.49.203]) by marnier.ucs.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.3) with SMTP id QAA29661; Sun, 2 Apr 2000 16:09:50 -0500 (CDT) Message-Id: <2.2.32.20000402210810.00754cd8 [at] pop [dot] usl.edu> X-Sender: rbk5287 [at] pop [dot] usl.edu X-Mailer: Windows Eudora Pro Version 2.2 (32) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Sun, 02 Apr 2000 16:08:10 -0500 To: Jens Maurer From: "R. Baker Kearfott" Subject: Re: New C++ Library for Interval Arithmetic Cc: reliable_computing [at] interval [dot] louisiana.edu, Bill.Walster [at] Eng [dot] Sun.COM Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk From owner-reliable_computing [at] interval [dot] usl.edu Mon Apr 3 12:30:06 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id MAA01200 for reliable_computing-outgoing; Mon, 3 Apr 2000 12:30:06 -0500 (CDT) Received: from mailhost2.avanticorp.com (mailhost2.avanticorp.com [208.206.213.19]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id MAA01193 for ; Mon, 3 Apr 2000 12:30:00 -0500 (CDT) Received: from mailhost2.avanticorp.com (root@localhost [127.0.0.1]) by mailhost2.avanticorp.com (8.9.3/8.9.3) with ESMTP id KAA19931 for ; Mon, 3 Apr 2000 10:29:55 -0700 (PDT) Received: (from root@localhost) by mailhost2.avanticorp.com (8.9.3/8.9.3) id KAA19899; Mon, 3 Apr 2000 10:29:48 -0700 (PDT) Received: (from uucp@localhost) by mailhost2.avanticorp.com (8.9.3/8.9.3) id PAA04829 for ; Sun, 2 Apr 2000 15:41:25 -0700 (PDT) Received: from interval.usl.edu(130.70.43.77) via SMTP by asuras.avanticorp.com, id smtpdAAAa001BR; Sun Apr 2 15:41:24 2000 Received: from localhost (daemon@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with SMTP id RAA18513; Sun, 2 Apr 2000 17:37:44 -0500 (CDT) Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id RAA18470 for reliable_computing-outgoing; Sun, 2 Apr 2000 17:37:22 -0500 (CDT) Received: from narech.irin.univ-nantes.fr (IDENT:root [at] narech [dot] irin.sciences.univ-nantes.fr [193.52.99.2]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id RAA18465 for ; Sun, 2 Apr 2000 17:37:19 -0500 (CDT) Received: from (goualard@localhost) by narech.irin.univ-nantes.fr (8.9.3/jtpda-5.3.2) id AAA26673 ; Mon, 3 Apr 2000 00:37:11 +0200 Date: Mon, 3 Apr 2000 00:37:11 +0200 From: Frederic.Goualard [at] irin [dot] univ-nantes.fr (Frederic Goualard) Message-Id: <200004022237.AAA26673 [at] narech [dot] irin.univ-nantes.fr> To: rbk [at] louisiana [dot] edu Subject: Re: New C++ Library for Interval Arithmetic Cc: jmaurer [at] menuett [dot] rhein-main.de, reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 X-MIME-Autoconverted: from 8bit to quoted-printable by interval.usl.edu id RAA18513 Content-Transfer-Encoding: 8bit X-MIME-Autoconverted: from quoted-printable to 8bit by interval.usl.edu id MAA01196 Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk From owner-reliable_computing [at] interval [dot] usl.edu Mon Apr 3 12:36:08 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id MAA01520 for reliable_computing-outgoing; Mon, 3 Apr 2000 12:36:07 -0500 (CDT) Received: from zmit1.ippt.gov.pl (zmit1.ippt.gov.pl [148.81.53.8]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id MAA01509 for ; Mon, 3 Apr 2000 12:35:54 -0500 (CDT) Received: (from zkulpa@localhost) by zmit1.ippt.gov.pl (8.8.5/8.7.3-zmit) id TAA12043 for reliable_computing [at] interval [dot] louisiana.edu; Mon, 3 Apr 2000 19:35:27 +0200 (MET DST) Date: Mon, 3 Apr 2000 19:35:27 +0200 (MET DST) From: Zenon Kulpa Message-Id: <200004031735.TAA12043 [at] zmit1 [dot] ippt.gov.pl> To: reliable_computing [at] interval [dot] louisiana.edu Subject: Re: New C++ Library for Interval Arithmetic Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Hey, what is going on on the list? I have just received two messages with empty contents, see below... -- Zenon Kulpa ----- Begin Included Message ----- From owner-reliable_computing [at] interval [dot] usl.edu Mon Apr 3 19:31:05 2000 Date: Mon, 3 Apr 2000 00:37:11 +0200 From: Frederic.Goualard [at] irin [dot] univ-nantes.fr (Frederic Goualard) To: rbk [at] louisiana [dot] edu Subject: Re: New C++ Library for Interval Arithmetic Cc: jmaurer [at] menuett [dot] rhein-main.de, reliable_computing [at] interval [dot] louisiana.edu Sender: owner-reliable_computing [at] interval [dot] usl.edu Content-Length: 0 ----- End Included Message ----- ----- Begin Included Message ----- From owner-reliable_computing [at] interval [dot] usl.edu Mon Apr 3 19:28:16 2000 Date: Sun, 02 Apr 2000 16:08:10 -0500 To: Jens Maurer From: "R. Baker Kearfott" Subject: Re: New C++ Library for Interval Arithmetic Cc: reliable_computing [at] interval [dot] louisiana.edu, Bill.Walster [at] Eng [dot] Sun.COM Sender: owner-reliable_computing [at] interval [dot] usl.edu Content-Length: 0 ----- End Included Message ----- From owner-reliable_computing [at] interval [dot] usl.edu Mon Apr 3 15:06:33 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id PAA02258 for reliable_computing-outgoing; Mon, 3 Apr 2000 15:06:33 -0500 (CDT) Received: from marnier.ucs.usl.edu (root@ucs-gw.usl.edu [130.70.40.2]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id PAA02253 for ; Mon, 3 Apr 2000 15:06:30 -0500 (CDT) Received: from u8174 (rbk5287 [at] goedel [dot] usl.edu [130.70.49.203]) by marnier.ucs.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.3) with SMTP id PAA08499 for ; Mon, 3 Apr 2000 15:06:27 -0500 (CDT) Message-Id: <2.2.32.20000403200401.0076d7a8 [at] pop [dot] usl.edu> X-Sender: rbk5287 [at] pop [dot] usl.edu X-Mailer: Windows Eudora Pro Version 2.2 (32) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Mon, 03 Apr 2000 15:04:01 -0500 To: reliable_computing [at] interval [dot] louisiana.edu From: "R. Baker Kearfott" Subject: Re: empty messages from reliable_computing Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk List members: i'm not sure what caused this, but the list seems to be working now. There was a bad electrical storm here this morning, with a momentary outage. Perhaps an uninterruptible power supply on interval.louisiana.edu would help??? I'll be alert to see if this happens again. Baker At 07:35 PM 4/3/00 +0200, Zenon Kulpa wrote: >Hey, what is going on on the list? >I have just received two messages with empty contents, see below... > >-- Zenon Kulpa > >----- Begin Included Message ----- > >>From owner-reliable_computing [at] interval [dot] usl.edu Mon Apr 3 19:31:05 2000 >Date: Mon, 3 Apr 2000 00:37:11 +0200 >From: Frederic.Goualard [at] irin [dot] univ-nantes.fr (Frederic Goualard) >To: rbk [at] louisiana [dot] edu >Subject: Re: New C++ Library for Interval Arithmetic >Cc: jmaurer [at] menuett [dot] rhein-main.de, reliable_computing [at] interval [dot] louisiana.edu >Sender: owner-reliable_computing [at] interval [dot] usl.edu >Content-Length: 0 > >----- End Included Message ----- > > >----- Begin Included Message ----- > >>From owner-reliable_computing [at] interval [dot] usl.edu Mon Apr 3 19:28:16 2000 >Date: Sun, 02 Apr 2000 16:08:10 -0500 >To: Jens Maurer >From: "R. Baker Kearfott" >Subject: Re: New C++ Library for Interval Arithmetic >Cc: reliable_computing [at] interval [dot] louisiana.edu, Bill.Walster [at] Eng [dot] Sun.COM >Sender: owner-reliable_computing [at] interval [dot] usl.edu >Content-Length: 0 > >----- End Included Message ----- > --------------------------------------------------------------- R. Baker Kearfott, rbk [at] louisiana [dot] edu (337) 482-5346 (fax) (337) 482-5270 (work) (337) 981-9744 (home) URL: http://interval.louisiana.edu/kearfott.html Department of Mathematics, University of Louisiana at Lafayette Box 4-1010, Lafayette, LA 70504-1010, USA --------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] usl.edu Tue Apr 4 16:34:39 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id QAA05401 for reliable_computing-outgoing; Tue, 4 Apr 2000 16:34:39 -0500 (CDT) Received: from relay.rhein-main.de (root [at] hermes [dot] rhein-main.de [195.37.8.6]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id QAA05396 for ; Tue, 4 Apr 2000 16:34:33 -0500 (CDT) Received: from menuett.rhein-main.de (menuett.rhein-main.de [195.37.9.79]) by relay.rhein-main.de (8.9.3/8.9.3) with ESMTP id XAA06654; Tue, 4 Apr 2000 23:26:11 +0200 Message-ID: <38EA5FFA.B7D7B63C [at] menuett [dot] rhein-main.de> Date: Tue, 04 Apr 2000 23:34:50 +0200 From: Jens Maurer X-Mailer: Mozilla 4.7 [en] (X11; I; Linux 2.3.99-pre3 i686) X-Accept-Language: en MIME-Version: 1.0 To: "R. Baker Kearfott" CC: reliable_computing [at] interval [dot] louisiana.edu Subject: Re: New C++ Library for Interval Arithmetic References: <2.2.32.20000402210810.00754cd8 [at] pop [dot] usl.edu> Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk "R. Baker Kearfott" wrote: > What do you mean by "natural-looking"? Operator overloading is > possible in Fortran without compiler modification, This is where my ignorance shows off: I didn't know Fortran had operator overloading. > Furthermore, good support for overloading I/O > will be available, but not before the next Fortran standard is > implemented, some time after 2004. There, C++ has an advantage :-) [Please, no language flame-war.] > An argument against C++ may be that the > standard is in more of a state of flux, and it may be more difficult > to write portable code. Is that true? The C++ standard is approved as ISO 14882 since 1998. It is available for USD 18 at www.ansi.org. The standard itself is thus fixed except for a bunch of defect reports, mostly for non-essential library features. Writing portable code should therefore be easy, but it is still not natural have a compiler and library which is actually standards-compliant. Much to the grief of the community, the widely used Microsoft Visual C++ is lacking many features in its compiler which also prevents a standards-compliant library usable with MSVC from happening. I plan to make my interval implementation MSVC-compatible so that it is usable for a substantial audience. Actually, it should work as-is, but I haven't tested it with MSVC yet. > >I have yet to see J\"urgen's code. > > Does someone volunteer to do the experiments? I can do that, but without J"uergen's code, it's going to be somewhat difficult :-) Jens Maurer. From owner-reliable_computing [at] interval [dot] usl.edu Thu Apr 6 04:45:48 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id EAA09543 for reliable_computing-outgoing; Thu, 6 Apr 2000 04:45:48 -0500 (CDT) Received: from dimoni.upc.es (dimoni.upc.es [147.83.2.62]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id EAA09538 for ; Thu, 6 Apr 2000 04:45:33 -0500 (CDT) Received: from berlioz.upc.es (berlioz.upc.es [147.83.2.176]) by dimoni.upc.es (8.8.8+Sun/8.8.8) with ESMTP id LAA28443 for ; Thu, 6 Apr 2000 11:45:08 +0200 (MET DST) Received: from upc.es ([147.83.22.29]) by granados.upc.es (Lotus Domino Release 5.0.3 (Intl)) with ESMTP id 2000040611450630:794 ; Thu, 6 Apr 2000 11:45:06 +0200 Message-ID: <38EC5CA0.B514501C [at] upc [dot] es> Date: Thu, 06 Apr 2000 11:45:05 +0200 From: M Rosa Estela Carbonell X-Mailer: Mozilla 4.5 [es] (Win95; I) X-Accept-Language: es MIME-Version: 1.0 To: reliable_computing [at] interval [dot] usl.edu Subject: CLM-stability criterion X-MIMETrack: Itemize by SMTP Server on Granados/UPC(Release 5.0.3 (Intl)|21 March 2000) at 04/06/2000 11:45:06 AM, Serialize by Router on Berlioz/UPC(Release 5.0.3 (Intl)|21 March 2000) at 04/06/2000 11:45:12 AM, Serialize complete at 04/06/2000 11:45:12 AM Content-Transfer-Encoding: 7bit Content-Type: text/plain; charset=us-ascii Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear interval researchers, I'm interested to get the enunciated of the Cremer-Leonhard-Michailov (CLM)- stability criterion that appears in Unbehauen, H. Control Engineering (in German), 9th edition, Vieweg-Verlag, Braunschweig, (1997). Many thanks in advance. M.Rosa Estela Carbonell m.rosa.estela [at] upc [dot] es From owner-reliable_computing [at] interval [dot] usl.edu Wed Apr 12 19:42:35 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id TAA24049 for reliable_computing-outgoing; Wed, 12 Apr 2000 19:42:34 -0500 (CDT) Received: from kleene.math.wisc.edu (kleene.math.wisc.edu [144.92.166.90]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id TAA24044 for ; Wed, 12 Apr 2000 19:41:14 -0500 (CDT) Received: from forelli.math.wisc.edu (forelli.math.wisc.edu [144.92.166.70]) by kleene.math.wisc.edu (8.9.3/8.9.3) with SMTP id TAA23562; Wed, 12 Apr 2000 19:24:55 -0500 (CDT) Date: Wed, 12 Apr 2000 19:49:46 -0500 (CDT) From: Hans Schneider To: NETS -- at-net , "Hershkowitz, Danny -- Hershkowitz Daniel" , Danny Hershkowitz , E-LETTER , "na.digest" , ipnet-digest [at] math [dot] msu.edu, wim@bell-labs.com, hjt [at] eos [dot] ncsu.edu, vkm [at] eedsp [dot] gatech.edu, reliable_computing [at] interval [dot] louisiana.edu Subject: LAA contents Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear Net Organizer: Please circulate the attached LAA contents over your net. Thanks hans ------------------------------------------------------------------------------ Hans Schneider hans [at] math [dot] wisc.edu. Department of Mathematics 608-262-1402 (Work) Van Vleck Hall 608-271-7252 (Home) 480 Lincoln Drive 608-263-8891 (Work FAX) University of Wisconsin-Madison 608-271-8477 (Home FAX) Madison WI 53706 USA http://www.math.wisc.edu/~hans (URL) ------------------------------------------------------------------------------ ContentsDirect from Elsevier Science ===================================== URL: http://www.elsevier.nl/locate/jnlnr/07738 Journal: Linear Algebra and Its Applications ISSN : 0024-3795 Volume : 308 Issue : 1-3 Date : 13-Apr-2000 pp 1-29 Normal forms of generic triangular band matrices and Jordan forms of nilpotent completions MI Gekthman, L Rodman pp 31-64 Generalized-confluent Cauchy and Cauchy-Vandermonde matrices ZHENGHONG Yang pp 65-75 Pascal k-eliminated functional matrix and it's property M Bayat pp 77-84 Matrix young inequalities for the Hilbert-Schmidt norm O Hirzallah, F Kittaneh pp 85-107 Representation and approximation of the outer inverse A_T,S^(2) of a matrix A YONGLIN Chen pp 109-119 Metric projection and stratification of the Grassmannian M Finzel pp 121-137 Spectrally arbitrary patterns JH Drew, P Van Den Driessche pp 139-152 Decomposable numerical ranges on orthonormal tensors CK Li pp 153-161 Estimates for the spectrum near algebraic elements Y Chen, T Ransford pp 163-181 An extension problem for discrete- time almost periodically correlated stochastic processes D Alpay pp 183-202 Pade approximation for the exponential of a block triangular matrix L Diece pp 203-211 Notes on matrix arithmetic- geometric mean inequalities R Bhatia pp 217-217 Author index --- NOTE: ContentsDirect, which is automatically generated, lists the first author of each paper and the corresponding author (if different). From owner-reliable_computing [at] interval [dot] usl.edu Thu Apr 13 11:01:35 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id LAA26046 for reliable_computing-outgoing; Thu, 13 Apr 2000 11:01:34 -0500 (CDT) Received: from kleene.math.wisc.edu (kleene.math.wisc.edu [144.92.166.90]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id LAA26041 for ; Thu, 13 Apr 2000 11:01:11 -0500 (CDT) Received: from forelli.math.wisc.edu (forelli.math.wisc.edu [144.92.166.70]) by kleene.math.wisc.edu (8.9.3/8.9.3) with SMTP id KAA02761; Thu, 13 Apr 2000 10:44:53 -0500 (CDT) Date: Thu, 13 Apr 2000 11:09:49 -0500 (CDT) From: Hans Schneider To: NETS -- at-net , "Hershkowitz, Danny -- Hershkowitz Daniel" , Danny Hershkowitz , E-LETTER , "na.digest" , ipnet-digest [at] math [dot] msu.edu, wim@bell-labs.com, hjt [at] eos [dot] ncsu.edu, vkm [at] eedsp [dot] gatech.edu, reliable_computing [at] interval [dot] louisiana.edu Subject: LAA contents Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear Net Organizer: Please circulate the attached LAA contents over your net. Thanks hans --- ------------------------------------------------------------------------------ Hans Schneider hans [at] math [dot] wisc.edu. Department of Mathematics 608-262-1402 (Work) Van Vleck Hall 608-271-7252 (Home) 480 Lincoln Drive 608-263-8891 (Work FAX) University of Wisconsin-Madison 608-271-8477 (Home FAX) Madison WI 53706 USA http://www.math.wisc.edu/~hans (URL) ------------------------------------------------------------------------------ ContentsDirect from Elsevier Science ===================================== URL: http://www.elsevier.nl/locate/jnlnr/07738 Journal: Linear Algebra and Its Applications ISSN : 0024-3795 Volume : 309 Issue : 1-3 Date : 20-Apr-2000 Proceedings of the international worskhop on accurate solutions of eigenvalue problems Special editors: Jesse L. Barlow, Beresford N. Parlett, Kresimir Veslic pp 1-2 Preface: The Accurate solution of Eigenvalue Problems JL Barlow pp 3-18 Weyl-type relative perturbation bounds for eigenvalues of Hermitian matrices FM Dopico, JM Molera pp 19-43 Optimal perturbation bounds for the Hermitian eigenvalue problem JL Barlow pp 45-56 Absolute and relative perturbation bounds for invariant subspaces of matrices ICF Ipsen pp 57-72 Relative perturbation theory for hyperbolic eigenvalue problem I Slapnicar pp 73-83 Accuracy assessment for eigencomputations: variety of backward errors and pseudospectra F Chaitin-Chatelin, E Traviesas pp 85-102 Perturbation theory for the eigenvalues of factorised symmetric matrices K Veselic pp 103-119 Rounding-error and perturbation bounds for the indefinite QR factorization S Singer pp 121-151 Relatively robust representations of symmetric tridiagonals BN Parlett pp 153-174 QR factorization with complete pivoting and accurate computation of the SVD NJ Higham pp 175-190 Exponential splittings of products of matrices and accurately computing singular values of long products S Oliveira, DE Stewart pp 191-215 Approximate eigenvectors as preconditioner Z Drmac pp 217-259 An implementation of dqds algorithm (positive case) BN Parlett pp 261-287 Balancing sparse matrices for computing eigenvalues TY Chen, J Demmel pp 289-306 Large sparse symmetric eigenvalue problems with homogeneous linear constraints: the Lanczos process with inner-outer iterations GH Golub, H Zha pp 307-323 The influence of orthogonality on the Arnoldi method T Braconnier pp 325-337 The relative error in the Pruess method for Sturm-Liouville problems P Kosowski pp 339-361 Backward error and condition of polynomial eigenvalue problems F Tisseur pp 363-363 Author index --- NOTE: ContentsDirect, which is automatically generated, lists the first author of each paper and the corresponding author (if different). From owner-reliable_computing [at] interval [dot] usl.edu Sat Apr 15 21:15:16 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id VAA00505 for reliable_computing-outgoing; Sat, 15 Apr 2000 21:15:15 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id VAA00490 for ; Sat, 15 Apr 2000 21:15:08 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.10.1/8.10.1) with SMTP id e3FKm8125925; Sat, 15 Apr 2000 14:48:09 -0600 (MDT) Message-Id: <200004152048.e3FKm8125925 [at] cs [dot] utep.edu> Date: Sat, 15 Apr 2000 14:48:09 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: P.S. Conference in St. Petersburg To: reliable_computing [at] interval [dot] usl.edu, interval [at] cs [dot] utep.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: PquEBqJM+yZ8eXZd0FhnJA== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk In order to set up a program on time, Dr. Vasiliev, the general chair of the conference, would like to have the names and titles of almost all the speakers by May 1, 2000. Abstracts can still be submitted by May 15. From owner-reliable_computing [at] interval [dot] usl.edu Sat Apr 15 21:15:16 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id VAA00506 for reliable_computing-outgoing; Sat, 15 Apr 2000 21:15:15 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id VAA00492 for ; Sat, 15 Apr 2000 21:15:09 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.10.1/8.10.1) with SMTP id e3FLCQZ26183; Sat, 15 Apr 2000 15:12:26 -0600 (MDT) Message-Id: <200004152112.e3FLCQZ26183 [at] cs [dot] utep.edu> Date: Sat, 15 Apr 2000 15:12:27 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: SCI'2000: submission deadline extended to May 17 To: reliable_computing [at] interval [dot] usl.edu, interval [at] cs [dot] utep.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=ISO-8859-1 Content-MD5: b+dVV5bMOiAp7lUVpQq0ag== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc Content-Transfer-Encoding: 8bit X-MIME-Autoconverted: from QUOTED-PRINTABLE to 8bit by interval.usl.edu id VAA00495 Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk FYI: this is the conference about which Dr. Corliss suggested a few months ago that an interval presence may be beneficial. ------------- Begin Forwarded Message ------------- Date: Sat, 15 Apr 2000 15:12:38 -0400 From: Nagib Callaos Subject: 4th World Multiconference on Systemics, Cybernetics, and Informatics SCI'2000 Dear Colleague: Let me inform you that we extended the deadlines because the problems we had with the server, and because we achieved an agreement with proceedings printing shop that allows us to do it. The extended deadlines are as follow: ˇ May 17, 2000 ~ Submission of extended abstracts (500-1500 words) or paper Drafts (2000-5000 words) ˇ May 22, 2000 ~ Acceptance notifications ˇ June 19, 2000 ~ Submission of camera ready papers: hard copies and electronic versions If you need more time let us know about it, along with your paper title, topic or area, to examine if its potential reviewers would make it feasible for you. Additional information might be found at the conference web page www.iiis.org/isas/ Best Regards Nagib Callaos SCI2000 General Chair. ------------- End Forwarded Message ------------- From owner-reliable_computing [at] interval [dot] usl.edu Sat Apr 15 21:15:17 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id VAA00507 for reliable_computing-outgoing; Sat, 15 Apr 2000 21:15:16 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id VAA00496 for ; Sat, 15 Apr 2000 21:15:10 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.10.1/8.10.1) with SMTP id e3FKPox25649; Sat, 15 Apr 2000 14:25:50 -0600 (MDT) Message-Id: <200004152025.e3FKPox25649 [at] cs [dot] utep.edu> Date: Sat, 15 Apr 2000 14:25:51 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: conference in St. Petersburg: deadline extended to May 15 To: reliable_computing [at] interval [dot] usl.edu, interval [at] cs [dot] utep.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: wRFjVBzLasgfpiOfArblRg== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk FINAL CALL FOR PAPERS Special Session on INTERVAL AND COMPUTER-ALGEBRAIC METHODS IN SCIENCE AND ENGINEERING at the 6th International Conference on Applications of Computer Algebra IMACS-ACA'2000 June 25-28, 2000 Saint Petersburg, Russia PREAMBLE: There is a need to combine methods of computer algebra and of interval computations. First: * Most applications of computer algebra and symbolic computations, (in particular, most applications to control, dynamical system analysis, computer graphics, etc.), deal with situations in which we know the exact all the coefficients of the corresponding analytical expressions. * In many real-life situations, however, these coefficients have to be determined from measurements and observations. Since a measurement is never 100% accurate, after measuring a value x, we can only conclude that the actual (unknown) value of the measured coefficient lies within the interval [x-D,x+D], where D is the upper bound on the measurement error (guaranteed by the manufacturer of the measuring instrument). We therefore need to take this interval uncertainty into consideration. Second: * Most algorithms developed in computer algebra assume that all the coefficients are (exactly represented) real numbers. * In the computers, many real numbers can only be approximately represented. The resulting rounding errors lead to the inaccuracy of the coefficients in the final result. It is therefore desirable to estimate this inaccuracy. For this estimation, we can also use methods of interval computations. In recognition of this need, in 1994, an International Conference on Interval and Computer-Algebraic Methods in Science and Engineering (Interval'94) was held in St. Petersburg, Russia. This first conference of this type was a huge success. At this conference, more than 100 researchers from 18 countries presented their practical and theoretical results. Since 1994, there has been a tremendous progress both in computer algebra and in interval computations. This progress is largely due to the rapidly increasing computer processing speed, which makes previously theoretical algorithms of computer algebra practically feasible. In some cases, we can directly apply these algorithms; in most cases, however, there is a need for further fine-tuning, a need which leads to interesting challenging new theoretical problems whose solution, in its turn, results in new exciting applications. We believe that time is ripe for a new major meeting devoted to the relation between computer algebra and interval computations. This meeting will hopefully not only highlight the results, but it will also give a new boost to a much-needed combination of numerical and symbolic techniques. SCOPE: For this special session, we are soliciting papers in the following areas: * applications of combined interval-analytical techniques in science and engineering (and in other possible application areas); * special languages, software and hardware tools which either * combine interval techniques with techniques of computer algebra, or * enhance such a combination; * theoretical foundations for combining interval and symbolic algebra techniques, including (but not limited to): * the use of analytical transformations (and other techniques from computer algebra) in interval computations; * algebraic approach to interval mathematics (including interval-based formalisms of computer algebra); * computational complexity analysis of symbolic computation problems with interval uncertainty; * new semi-heuristic ideas on how interval and computer algebra methods can be combined (either in general, and with some specific application area in mind), and * new potential applications area for the combined interval-analytical techniques. In this solicitation, we are targeting researchers and practitioners from both communities: interval computations and computer algebra. To achieve a greater success, we are making this appeal as broad as possible: * It is OK to have a result which is mainly devoted to interval computations, but has some relation to computer algebra. * It is also OK to have a result which is mainly devoted to computer algebra, but has some relation to interval computations. Since this session is oriented towards two different communities, we encourage the authors to do their best to be understandable by researchers from both communities (even if this means adding extra phrases into the introduction which, e.g., for an interval computations community would not be necessary at all). SUBMISSION: A 2-page abstract in LaTeX format must be submitted by May 15, 2000 to both organizers (by email, if possible): V. M. Nesterov P. O. Box 52 St. Petersburg 256 195256 Russia email nest [at] into [dot] nit.spb.su Vladik Kreinovich Department of Computer Science University of Texas at El Paso El Paso, TX 79968, USA email vladik [at] cs [dot] utep.edu Abstracts will be published before the conference. We are also currently planning to publish refereed proceedings as a special issue of the "Reliable Computing" journal. If you are interested in coming, please let the organizers know ASAP, and, if possible, send a title (even preliminary title if necessary) of your submission ASAP. VENUE: St. Petersburg is a majestic old imperial capital of Russia. Numerous imperial palaces located in the city and in the suburbs attract millions of visitors every year. The main of these palaces - Winter Palace - hosts the Hermitage, one of the world largest art museums. Fortresses, churches, mansions, theaters, monasteries line up the beautiful streets and embankments of this city of 100+ islands nicknamed the Northern Venice. June is the most beautiful and romantic time to visit St. Petersburg, the time of the world-famous White Nights, when the sun hardly hides behind the horizon, and you can not find even the brightest stars in the night sky. All night long street musicians play traditional Russian music and new Russian rock, and love-struck young people roam the streets in which the palaces and bridges, barely visible in the dimmed light (and sometimes also shielded by fog and/or drizzle), create the magic atmosphere of unreal fairy tale. Although the city is located at the same latitude as Alaska, Gulf Stream makes it much warmer; in June, an average temperature is about 20 C (70 F). INFORMATION FOR PARTICIPANTS IMACS-ACA'2000 International Association for Mathematics and Computers in Simulation 6th International Conference on Applications of Computer Algebra June 25-28, 2000 Saint Petersburg, Russia 1. VISA APPLICATION Please note that nearly every foreign visitor to Russia will need to get a VISA from a Russian Consulate in any country, where he is staying. To do so, you will need a special invitation and in addition, your passport must not expire earlier than the end of September 2000. To issue the invitation, we need various data and a FAXed copy of the identification page from your passport (the page containing your name, passport number, passport expiration date and date of your birth). Please fill out the registration form below and send it to: aca2000 [at] eimi [dot] imi.ras.ru or fill out the registration form on our web page: http://www.pdmi.ras.ru/~aca00/form.html You can send us a copy of the identification page of your passport by fax: 7 812 234 5819 or 7 812 310 5377 (for Elena Novikova) or you can send a scaned copy of the identification page by email above. After receiving your data, we will send out an invitation within two/three weeks. If you come with accompanying persons, you will have to fill out a registration form for each of them and fax their passport pages as well. If you would like to visit Moscow or other places in Russia, please mention this in your registration form. 2. CONFERENCE FEE The conference fee is 200 USD for EARLY payment (up to May 10) 225 USD for LATE payment In the case of EARLY payment: Return completed registration form with payment to: ACA'00 Conference FAX: +1 (505) 277-5505 1801 Quincy, SE (VISA/MasterCard only) Albuquerque, New Mexico OR USA 87108-4427 Email: aca [at] math [dot] unm.edu (Make checks payable to "ACA") (VISA/MasterCard only) Please SEND A NOTE by email to aca [at] math [dot] unm.edu no matter how you send the payment as a confirmation!!! All registrations will be acknowledged by email. Note that credit card debits may be under the name "Cotopaxi" which is the company holding the ACA account. In the case of LATE payment: The LATE payment should be done at the conference site in cash. Please take into account that you can use your credit card in St. Petersburg (VISA, MasterCard) as well as travel check. The conference fee will cover the organizing expenses, a car from and to the airport, coffee breaks, cultural events, conference party. The accompanying persons could be involved in conference events, in this case a special conference fee for accompanying persons (100 USD) should be paid at the conference site. 3. SUPPORT The funds of the conference are very limited but we are awaiting for a certain financial support from INTAS and RFBR, which in particular will cover a part of expenses of participants involved in the INTAS projects and participants from Russia. The conference fee for young scientists would be reduced. 4. CONFERENCE SITE The conference will be located at an old palace on the Fontanka embankment, 21 (see red mark "X" on the map: http://www.pdmi.ras.ru/~aca/map2.jpg), near the Steklov Institute of Mathematics (address: Fontanka, 27). 5. HOTEL We have reserved the apartments in two hotels*** "Oktyabrskaya" and "Sovetskaya" for the participants to the conference. The "Oktyabrskaya" is in the center not far from the conference site at the Ploschad' (Square) Vosstaniya at a crossroads of Nevskiy prospekt (avenue) and Ligovskiy prospekt (see red mark "Y" on the map: http://www.pdmi.ras.ru/~aca/map2.jpg). Address: Ligovskiy prospekt (avenue), 41/45. The current rate is (with taxes without breakfast): single room: 925 rub (about 32 USD) or 1220 rub (about 42 USD) double room: 1160 rub (about 40 USD) or 1830 rub (about 63 USD) The more expensive rooms (for both hotels) have slightly higher quality furniture and wallpaper. The "Sovetskaya" is of more high level but not close to the conference site, at a crossroads of Rizhskiy prospekt and Lermontovskiy prospekt. Address: Lermontovskiy prospekt (avenue), 43/1 (see red mark "Z" on the map: http://www.pdmi.ras.ru/~aca/map3.jpg). The current rate is (with taxes and with breakfast): single room: 1170 rub (about 40 USD) double room: 1965 rub (about 70 USD) You should pay for the hotel on arrival. You can use VISA or MasterCard. Please write in your registration form or separately what hotel do you prefer, what price is acceptable and what kind of room do you need. ----------------------------------------------------------------- REGISTRATION FORM e-mail: aca2000 [at] eimi [dot] imi.ras.ru (You may also fill out the Registration Form on our web page: http://www.pdmi.ras.ru/~aca00/form.html) Family name (as in passport): First name(s) (as in passport): Affiliation: Position: Address (office): City: Postal code: Country: Fax (office): Phone (office): e-mail: I need a hotel: (yes/no) Arrival Date: Departure Date: Please, provide us details about the type of room you wish and the persons you wish to share the room with: (number of rooms/shared with/price per room/number of persons) I intend to give a talk: (yes/no) Session: Title: I need a Russian visa: (yes/no) If you need a visa, please, fill in the following VISA FORM: Date of arrival: Date of departure: Citizenship: Passport number: Passport expiration date: City (with a Russian Consulate) where you will apply for a visa: Date of birth: FAX number to send the invitation to: Mailing address to send the invitation to: City you want to visit besides St. Petersburg: IMPORTANT: You need to send us a copy of the identification page of your passport (the pages containing your name, passport number and passport expiration date) by fax to 7 812 234 5819 or 7 812 310 5377 (for Elena Novikova) You need to do likewise with the passports of all accompanying persons. I would like to come with accompanying person(s): (yes/no) If "yes", please, make a separate registration and visa form for each accompanying person: fill in the same fields for everyone. IMPORTANT: Please check that your medical insurance is valid in Russia. For Credit Card Payment: Early Registration fee: US$200 Card Type ____________________ # ________________________ Exp. Date ________ Card Holder Name (print) ___________________________________________________ Signature __________________________________________________________________ (Email registration is preferred and does not require a signature) ------------------------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] usl.edu Sun Apr 16 10:41:13 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA03074 for reliable_computing-outgoing; Sun, 16 Apr 2000 10:41:13 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA03069 for ; Sun, 16 Apr 2000 10:41:10 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.10.1/8.10.1) with SMTP id e3GFf7k29889 for ; Sun, 16 Apr 2000 09:41:07 -0600 (MDT) Message-Id: <200004161541.e3GFf7k29889 [at] cs [dot] utep.edu> Date: Sun, 16 Apr 2000 09:41:06 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: SCI'2000: submission deadline extended to May 17 To: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=ISO-8859-1 Content-MD5: aBgvkuq7IeVQvS0EQrmDAA== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc Content-Transfer-Encoding: 8bit X-MIME-Autoconverted: from QUOTED-PRINTABLE to 8bit by interval.usl.edu id KAA03070 Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk FYI: this is the conference about which Dr. Corliss suggested a few months ago that an interval presence may be beneficial. ------------- Begin Forwarded Message ------------- Date: Sat, 15 Apr 2000 15:12:38 -0400 From: Nagib Callaos Subject: 4th World Multiconference on Systemics, Cybernetics, and Informatics SCI'2000 Dear Colleague: Let me inform you that we extended the deadlines because the problems we had with the server, and because we achieved an agreement with proceedings printing shop that allows us to do it. The extended deadlines are as follow: ˇ May 17, 2000 ~ Submission of extended abstracts (500-1500 words) or paper Drafts (2000-5000 words) ˇ May 22, 2000 ~ Acceptance notifications ˇ June 19, 2000 ~ Submission of camera ready papers: hard copies and electronic versions If you need more time let us know about it, along with your paper title, topic or area, to examine if its potential reviewers would make it feasible for you. Additional information might be found at the conference web page www.iiis.org/isas/ Best Regards Nagib Callaos SCI2000 General Chair. ------------- End Forwarded Message ------------- ------------- End Forwarded Message ------------- From owner-reliable_computing [at] interval [dot] usl.edu Sun Apr 16 10:42:07 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA03123 for reliable_computing-outgoing; Sun, 16 Apr 2000 10:42:07 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA03114 for ; Sun, 16 Apr 2000 10:42:02 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.10.1/8.10.1) with SMTP id e3GFg1G29894 for ; Sun, 16 Apr 2000 09:42:01 -0600 (MDT) Message-Id: <200004161542.e3GFg1G29894 [at] cs [dot] utep.edu> Date: Sun, 16 Apr 2000 09:42:00 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: P.S. Conference in St. Petersburg To: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: KzWucP6RJw2KZEGxkJMb5w== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk In order to set up a program on time, Dr. Vasiliev, the general chair of the conference, would like to have the names and titles of almost all the speakers by May 1, 2000. Abstracts can still be submitted by May 15. From owner-reliable_computing [at] interval [dot] usl.edu Sun Apr 16 10:44:51 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA03264 for reliable_computing-outgoing; Sun, 16 Apr 2000 10:44:51 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA03259 for ; Sun, 16 Apr 2000 10:44:48 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.10.1/8.10.1) with SMTP id e3GFik329908 for ; Sun, 16 Apr 2000 09:44:46 -0600 (MDT) Message-Id: <200004161544.e3GFik329908 [at] cs [dot] utep.edu> Date: Sun, 16 Apr 2000 09:44:45 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: conference in St. Petersburg: deadline extended to May 15 To: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: IqdyQ+d4TF/vOHyDjUOY/Q== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk FINAL CALL FOR PAPERS Special Session on INTERVAL AND COMPUTER-ALGEBRAIC METHODS IN SCIENCE AND ENGINEERING at the 6th International Conference on Applications of Computer Algebra IMACS-ACA'2000 June 25-28, 2000 Saint Petersburg, Russia PREAMBLE: There is a need to combine methods of computer algebra and of interval computations. First: * Most applications of computer algebra and symbolic computations, (in particular, most applications to control, dynamical system analysis, computer graphics, etc.), deal with situations in which we know the exact all the coefficients of the corresponding analytical expressions. * In many real-life situations, however, these coefficients have to be determined from measurements and observations. Since a measurement is never 100% accurate, after measuring a value x, we can only conclude that the actual (unknown) value of the measured coefficient lies within the interval [x-D,x+D], where D is the upper bound on the measurement error (guaranteed by the manufacturer of the measuring instrument). We therefore need to take this interval uncertainty into consideration. Second: * Most algorithms developed in computer algebra assume that all the coefficients are (exactly represented) real numbers. * In the computers, many real numbers can only be approximately represented. The resulting rounding errors lead to the inaccuracy of the coefficients in the final result. It is therefore desirable to estimate this inaccuracy. For this estimation, we can also use methods of interval computations. In recognition of this need, in 1994, an International Conference on Interval and Computer-Algebraic Methods in Science and Engineering (Interval'94) was held in St. Petersburg, Russia. This first conference of this type was a huge success. At this conference, more than 100 researchers from 18 countries presented their practical and theoretical results. Since 1994, there has been a tremendous progress both in computer algebra and in interval computations. This progress is largely due to the rapidly increasing computer processing speed, which makes previously theoretical algorithms of computer algebra practically feasible. In some cases, we can directly apply these algorithms; in most cases, however, there is a need for further fine-tuning, a need which leads to interesting challenging new theoretical problems whose solution, in its turn, results in new exciting applications. We believe that time is ripe for a new major meeting devoted to the relation between computer algebra and interval computations. This meeting will hopefully not only highlight the results, but it will also give a new boost to a much-needed combination of numerical and symbolic techniques. SCOPE: For this special session, we are soliciting papers in the following areas: * applications of combined interval-analytical techniques in science and engineering (and in other possible application areas); * special languages, software and hardware tools which either * combine interval techniques with techniques of computer algebra, or * enhance such a combination; * theoretical foundations for combining interval and symbolic algebra techniques, including (but not limited to): * the use of analytical transformations (and other techniques from computer algebra) in interval computations; * algebraic approach to interval mathematics (including interval-based formalisms of computer algebra); * computational complexity analysis of symbolic computation problems with interval uncertainty; * new semi-heuristic ideas on how interval and computer algebra methods can be combined (either in general, and with some specific application area in mind), and * new potential applications area for the combined interval-analytical techniques. In this solicitation, we are targeting researchers and practitioners from both communities: interval computations and computer algebra. To achieve a greater success, we are making this appeal as broad as possible: * It is OK to have a result which is mainly devoted to interval computations, but has some relation to computer algebra. * It is also OK to have a result which is mainly devoted to computer algebra, but has some relation to interval computations. Since this session is oriented towards two different communities, we encourage the authors to do their best to be understandable by researchers from both communities (even if this means adding extra phrases into the introduction which, e.g., for an interval computations community would not be necessary at all). SUBMISSION: A 2-page abstract in LaTeX format must be submitted by May 15, 2000 to both organizers (by email, if possible): V. M. Nesterov P. O. Box 52 St. Petersburg 256 195256 Russia email nest [at] into [dot] nit.spb.su Vladik Kreinovich Department of Computer Science University of Texas at El Paso El Paso, TX 79968, USA email vladik [at] cs [dot] utep.edu Abstracts will be published before the conference. We are also currently planning to publish refereed proceedings as a special issue of the "Reliable Computing" journal. If you are interested in coming, please let the organizers know ASAP, and, if possible, send a title (even preliminary title if necessary) of your submission ASAP. VENUE: St. Petersburg is a majestic old imperial capital of Russia. Numerous imperial palaces located in the city and in the suburbs attract millions of visitors every year. The main of these palaces - Winter Palace - hosts the Hermitage, one of the world largest art museums. Fortresses, churches, mansions, theaters, monasteries line up the beautiful streets and embankments of this city of 100+ islands nicknamed the Northern Venice. June is the most beautiful and romantic time to visit St. Petersburg, the time of the world-famous White Nights, when the sun hardly hides behind the horizon, and you can not find even the brightest stars in the night sky. All night long street musicians play traditional Russian music and new Russian rock, and love-struck young people roam the streets in which the palaces and bridges, barely visible in the dimmed light (and sometimes also shielded by fog and/or drizzle), create the magic atmosphere of unreal fairy tale. Although the city is located at the same latitude as Alaska, Gulf Stream makes it much warmer; in June, an average temperature is about 20 C (70 F). INFORMATION FOR PARTICIPANTS IMACS-ACA'2000 International Association for Mathematics and Computers in Simulation 6th International Conference on Applications of Computer Algebra June 25-28, 2000 Saint Petersburg, Russia 1. VISA APPLICATION Please note that nearly every foreign visitor to Russia will need to get a VISA from a Russian Consulate in any country, where he is staying. To do so, you will need a special invitation and in addition, your passport must not expire earlier than the end of September 2000. To issue the invitation, we need various data and a FAXed copy of the identification page from your passport (the page containing your name, passport number, passport expiration date and date of your birth). Please fill out the registration form below and send it to: aca2000 [at] eimi [dot] imi.ras.ru or fill out the registration form on our web page: http://www.pdmi.ras.ru/~aca00/form.html You can send us a copy of the identification page of your passport by fax: 7 812 234 5819 or 7 812 310 5377 (for Elena Novikova) or you can send a scaned copy of the identification page by email above. After receiving your data, we will send out an invitation within two/three weeks. If you come with accompanying persons, you will have to fill out a registration form for each of them and fax their passport pages as well. If you would like to visit Moscow or other places in Russia, please mention this in your registration form. 2. CONFERENCE FEE The conference fee is 200 USD for EARLY payment (up to May 10) 225 USD for LATE payment In the case of EARLY payment: Return completed registration form with payment to: ACA'00 Conference FAX: +1 (505) 277-5505 1801 Quincy, SE (VISA/MasterCard only) Albuquerque, New Mexico OR USA 87108-4427 Email: aca [at] math [dot] unm.edu (Make checks payable to "ACA") (VISA/MasterCard only) Please SEND A NOTE by email to aca [at] math [dot] unm.edu no matter how you send the payment as a confirmation!!! All registrations will be acknowledged by email. Note that credit card debits may be under the name "Cotopaxi" which is the company holding the ACA account. In the case of LATE payment: The LATE payment should be done at the conference site in cash. Please take into account that you can use your credit card in St. Petersburg (VISA, MasterCard) as well as travel check. The conference fee will cover the organizing expenses, a car from and to the airport, coffee breaks, cultural events, conference party. The accompanying persons could be involved in conference events, in this case a special conference fee for accompanying persons (100 USD) should be paid at the conference site. 3. SUPPORT The funds of the conference are very limited but we are awaiting for a certain financial support from INTAS and RFBR, which in particular will cover a part of expenses of participants involved in the INTAS projects and participants from Russia. The conference fee for young scientists would be reduced. 4. CONFERENCE SITE The conference will be located at an old palace on the Fontanka embankment, 21 (see red mark "X" on the map: http://www.pdmi.ras.ru/~aca/map2.jpg), near the Steklov Institute of Mathematics (address: Fontanka, 27). 5. HOTEL We have reserved the apartments in two hotels*** "Oktyabrskaya" and "Sovetskaya" for the participants to the conference. The "Oktyabrskaya" is in the center not far from the conference site at the Ploschad' (Square) Vosstaniya at a crossroads of Nevskiy prospekt (avenue) and Ligovskiy prospekt (see red mark "Y" on the map: http://www.pdmi.ras.ru/~aca/map2.jpg). Address: Ligovskiy prospekt (avenue), 41/45. The current rate is (with taxes without breakfast): single room: 925 rub (about 32 USD) or 1220 rub (about 42 USD) double room: 1160 rub (about 40 USD) or 1830 rub (about 63 USD) The more expensive rooms (for both hotels) have slightly higher quality furniture and wallpaper. The "Sovetskaya" is of more high level but not close to the conference site, at a crossroads of Rizhskiy prospekt and Lermontovskiy prospekt. Address: Lermontovskiy prospekt (avenue), 43/1 (see red mark "Z" on the map: http://www.pdmi.ras.ru/~aca/map3.jpg). The current rate is (with taxes and with breakfast): single room: 1170 rub (about 40 USD) double room: 1965 rub (about 70 USD) You should pay for the hotel on arrival. You can use VISA or MasterCard. Please write in your registration form or separately what hotel do you prefer, what price is acceptable and what kind of room do you need. ----------------------------------------------------------------- REGISTRATION FORM e-mail: aca2000 [at] eimi [dot] imi.ras.ru (You may also fill out the Registration Form on our web page: http://www.pdmi.ras.ru/~aca00/form.html) Family name (as in passport): First name(s) (as in passport): Affiliation: Position: Address (office): City: Postal code: Country: Fax (office): Phone (office): e-mail: I need a hotel: (yes/no) Arrival Date: Departure Date: Please, provide us details about the type of room you wish and the persons you wish to share the room with: (number of rooms/shared with/price per room/number of persons) I intend to give a talk: (yes/no) Session: Title: I need a Russian visa: (yes/no) If you need a visa, please, fill in the following VISA FORM: Date of arrival: Date of departure: Citizenship: Passport number: Passport expiration date: City (with a Russian Consulate) where you will apply for a visa: Date of birth: FAX number to send the invitation to: Mailing address to send the invitation to: City you want to visit besides St. Petersburg: IMPORTANT: You need to send us a copy of the identification page of your passport (the pages containing your name, passport number and passport expiration date) by fax to 7 812 234 5819 or 7 812 310 5377 (for Elena Novikova) You need to do likewise with the passports of all accompanying persons. I would like to come with accompanying person(s): (yes/no) If "yes", please, make a separate registration and visa form for each accompanying person: fill in the same fields for everyone. IMPORTANT: Please check that your medical insurance is valid in Russia. For Credit Card Payment: Early Registration fee: US$200 Card Type ____________________ # ________________________ Exp. Date ________ Card Holder Name (print) ___________________________________________________ Signature __________________________________________________________________ (Email registration is preferred and does not require a signature) ------------------------------------------------------------------------------- ------------- End Forwarded Message ------------- From owner-reliable_computing [at] interval [dot] usl.edu Mon Apr 17 21:04:03 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id VAA06621 for reliable_computing-outgoing; Mon, 17 Apr 2000 21:04:03 -0500 (CDT) Received: from wombat.cs.rmit.edu.au (wombat.cs.rmit.edu.au [131.170.24.41]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id VAA06616 for ; Mon, 17 Apr 2000 21:03:42 -0500 (CDT) Received: from goanna.cs.rmit.edu.au (zahirt [at] goanna [dot] cs.rmit.edu.au [131.170.24.40]) by wombat.cs.rmit.edu.au (8.9.3/8.9.3/cshub) with ESMTP id MAA12705; Tue, 18 Apr 2000 12:03:18 +1000 (EST) Received: (from zahirt@localhost) by goanna.cs.rmit.edu.au (8.9.3/8.9.3/csnode) id MAA12541; Tue, 18 Apr 2000 12:02:55 +1000 (EST) Date: Tue, 18 Apr 2000 12:02:55 +1000 (EST) From: Zahir Tari Message-Id: <200004180202.MAA12541 [at] goanna [dot] cs.rmit.edu.au> To: Gi-FB5-L [at] aifb [dot] uni-karlsruhe.de, ISCA [at] ipass [dot] net, TOOLS_Europe_2000 [at] ulla [dot] irisa.fr, agents [at] cs [dot] umbc.edu, atrfyi [at] SHL [dot] COM, chisig [at] venus [dot] it.swin.edu.au, ckbs-int [at] cs [dot] keele.ac.uk, comsoc-chapters [at] ieee [dot] org, corba-patterns [at] cs [dot] uiuc.edu, csec-adm [at] sdl [dot] hitachi.co.jp, dasig [at] dsto [dot] defence.gov.au, distributed-ai-request [at] mailbase [dot] ac.uk, ecoop-info [at] ecoop [dot] org, edoc-info [at] iese [dot] fhg.de, interactif [at] lri [dot] fr, is-depts [at] fit [dot] qut.edu.au, isworld [at] listserv [dot] heanet.ie, it-announce [at] cs [dot] usyd.edu.au, javaCORBA [at] luke [dot] org, maamaw [at] cosmos [dot] imag.fr, mas-anwendungen [at] wirtschaft [dot] tu-ilmenau.de, odp [at] dstc [dot] edu.au, ontology [at] cs [dot] umbc.edu, open [at] it [dot] swin.edu.au, otug [at] rational [dot] com, pdcemail [at] ee [dot] uwa.edu.au, podc-post [at] bellcore [dot] com, reliable_computing [at] interval [dot] usl.edu, sb.all [at] ieee [dot] org, seminars [at] cs [dot] anu.edu.au, seworld [at] cs [dot] colorado.edu, softwarequalitaet@uni-koeln.de Subject: CFP for Distributed Objects and Applications Symposium Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk C A L L F O R P A P E R S ============================= ___ __ __ __ __ | | | | | | / | || | International Symposium on | | | | |--| | || | DISTRIBUTED OBJECTS AND APPLICATIONS _|_| |__| | | |__||__| Antwerp, Belgium, September 21-23, 2000 http://www.cs.rmit.edu.au/conf/doa/2000/ IMPORTANT DATES Electronic submission: May 1st, 2000 Notification of acceptance: June 10th, 2000 Camera-ready copies: June 30th, 2000 Symposium: September 21-23, 2000 OVERVIEW Are you building applications using distributed objects (DO)? Are you doing research in fundamental technology, methodology or new tools for DO? Are you using some of the existing distributed object systems? Consider contributing a practice report or a research paper to this innovative event, and to present, discuss and obtain feedback for your ideas among other practitioners and researchers active in the same area. During DOA'2000 Symposium we want attendees to be able to evaluate existing ORB middleware products; to analyze, and propose solutions to major limitations of existing products; and to indicate promising future research directions for distributed objects. We are particularly interested in the evaluation of existing distributed object systems and how they are used to design and to implement large scale industrial distributed applications. We are seeking theoretical as well as practical papers addressing innovative issues related to distributed objects. TOPICS OF INTEREST Distributed and mobile agents. Design patterns for distributed object design. Database services, in particular persistency, transaction, query. and replication services. Integration of distributed object and Web technologies. Integration with database systems and interfaces. Methodologies to develop distributed object applications. Reintegration of legacy systems in DO environments . Design of CORBA, COM- and Java-based broker applications. Multimedia distributed objects. Multicast protocols for distributed objects. Object caching. Reliability, fault-tolerance and recovery. Real-time ORB middleware. Reports on Best Practice. Security. Specification and enforcement of quality of service. Standardization of distributed objects. ... PROGRAM COMMITTEE Gustavo Alonso (ETH, Zurich). Bill Appelbe (RMIT, Australia). Sean Baker (IONA, Ireland) Carlos De Backer (University of Antwerp, Belgium). Jose Blakeley (Microsoft, USA). Gordon Blair (Lancaster University, UK). Anthony Bloesch (Visio Corp., USA). Omran Bukhres (Purdue University, USA). Akmal B. Chaudhri (Computer Associates, UK). Asuman Dogac (Middle East Technical University, Turkey). Chris Gokey (NASA, USA). Rachid Guerraoui (EPFL, Switzerland). Arno Jacobsen (Humboldt University, Germany). Dimitris Karagiannis (University of Vienna and B.O.C. GmbH, Austria). Roger King (University of Colorado, USA). Sacha Krakowiak (University of Grenoble, France). Bernd Kramer (FernUniversitat Hagen, Germany). Hong Va Leong (Hong Kong Polytechnic University, China). Ling Liu (Oregon Graduate Institute, USA). Frank Manola (USA). Sophie Monties (EPFL, Switzerland). Jishnu Mukerji (HP New Jersey Labs, USA). Tom Northcutt (NASA, USA). Kunio Ohno (INS Engineering Corporation, Japan). Tamer Ozsu (University of Alberta, Canada). Mike P. Papazoglou (Tilburg University, The Netherlands). Kerry Raymond (DSTC, Australia). Arnie Rosenthal (Mitre, USA). Richard Soley (OMG, USA). Marc H. Scholl (Universitat Konstanz, Germany). Jean-Bernard Stefani (France Telecom, France). Doug Schmidt (Washington Univ. at St. Louis, USA). Makoto Takizawa (Tokyo Denki University, Japan). Hakki Toroslu (Middle East Technical University, Turkey). Yu-Chee Tseng (National Central University, Taiwan). Wilfried Verachtert (MediaGenix, Belgium). Andreas Vogel (In Prise, USA). Guijun Wang (Boeing, USA). Andrew Watson (OMG, USA). Albert Zamoya (UWA, Australia). From owner-reliable_computing [at] interval [dot] usl.edu Tue Apr 18 13:37:15 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id NAA08813 for reliable_computing-outgoing; Tue, 18 Apr 2000 13:37:15 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id NAA08808 for ; Tue, 18 Apr 2000 13:37:01 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.10.1/8.10.1) with SMTP id e3IIafA09640 for ; Tue, 18 Apr 2000 12:36:44 -0600 (MDT) Message-Id: <200004181836.e3IIafA09640 [at] cs [dot] utep.edu> Date: Tue, 18 Apr 2000 12:36:42 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: CALCULEMUS-2000 Deadline Extension To: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: xXkH8Av22qYJcYA7u+w6lQ== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk ------------- Begin Forwarded Message ------------- Date: Tue, 18 Apr 2000 12:41:59 -0400 (EDT) From: Paulina Chin To: "Paulina Chin (physics)" , m.kerber [at] cs [dot] bham.ac.uk Subject: CALCULEMUS-2000 Deadline Extension MIME-Version: 1.0 Please send inquiries about CALCULEMUS-2000 to Manfred Kerber at M.Kerber [at] cs [dot] bham.ac.uk. Due to general demand, we extend the deadline for the Calculemus Symposium to 1 May 2000. DEADLINE EXTENSION 1 May 2000 CALCULEMUS-2000 Symposium on the Integration of Symbolic Computation and Mechanized Reasoning 6-7 August 2000 St Andrews, Scotland (collocated with ISSAC 2000) http://www.calculemus.net/meetings/standrews00/ SCOPE Both deduction systems and computer algebra systems are receiving growing attention from industry and academia. On the one hand, mathematical software systems have been commercially very successful. Their use is now wide-spread in industry, education, and scientific contexts. On the other hand, the use of formal methods in hardware and software development has made deduction systems indispensable not least because of the complexity and sheer size of the reasoning tasks involved. As many application domains fall outside the scope of existing deduction systems and computer algebra systems, there is still need for improvement and in particular need for the integration of computer algebra and deduction systems. The symposium is intended for researchers and developers interested in combining the reasoning capabilities of deduction systems and the computational power of computer algebra systems. TOPICS Topics of interest for the symposium include all aspects related to the combination of deduction systems and computer algebra systems. We explicitly encourage submissions of results from applications and case studies where such integration results are particularly important. FORMAT The symposium will feature invited talks, contributed presentations with ample time for discussion, and a panel session. Consistent with the tradition of the symposium as a lively forum for discussing controversial ideas, we expect and encourage contributed talks to present work in progress, rather than polished final results. INVITED SPEAKERS - Henk Barendregt, U. Nijmegen, Mathematics and Computer Science - Arjeh Cohen, Eindhoven University of Technology, Dept. Math. - Gaston Gonnet, ETH Z"urich, Institute for Scientific Computation SUBMISSION Authors are invited to submit papers in the following categories: - Full papers up to 15 pages describing original results not published elsewhere. - System descriptions of up to 5 pages describing new systems or significant upgrades of existing ones, especially including experiments. Authors of accepted full papers and system descriptions are expected to present their contribution at the symposium. Authors of system descriptions are expected to demonstrate their systems. The symposium will have published proceedings with A K Peters Publishers. Submissions details can be found at http://www.cs.bham.ac.uk/~mmk/events/calculemus00-submi.html IMPORTANT DATES Submission deadline: 1 May 2000 Notification of acceptance: 22 May 2000 Final versions for proceedings: 5 June 2000 Symposium: 6-7 August 2000 ISSAC: 7-9 August 2000 ORGANIZATION and PROGRAMME CHAIRS Manfred Kerber, U. Birmingham, Michael Kohlhase, U. Saarbr"ucken, LOCAL ORGANIZER Steve Linton, St. Andrews U. PROGRAMME COMMITTEE Alessandro Armando, U. Genova Michael Beeson, San Jose State U. Manuel Bronstein, INRIA Sophia Antipolis Bruno Buchberger, RISC, Linz Jaques Calmet, U. Karlsruhe Olga Caprotti, TU. Eindhoven Edmund Clarke, CMU Fausto Giunchiglia, IRST Therese Hardin, Paris VI John Harrison, Intel Corp. Tudor Jebelean, RISC, Linz Helene Kirchner, Nancy LORIA/INRIA Deepak Kapur, U. New Mexico, Albuquerque Steve Linton, St. Andrews U. Ursula Martin, St. Andrews U. Julian Richardson, U. Edinburgh J"org Siekmann, U. Saarbr"ucken Carolyn Talcott, Stanford U. Andrzej Trybulec, U. Bialystok ------------- End Forwarded Message ------------- From owner-reliable_computing [at] interval [dot] usl.edu Tue Apr 18 22:44:36 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id WAA09935 for reliable_computing-outgoing; Tue, 18 Apr 2000 22:44:35 -0500 (CDT) Received: from cse.unl.edu (root [at] cse [dot] unl.edu [129.93.33.1]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id WAA09930 for ; Tue, 18 Apr 2000 22:44:31 -0500 (CDT) Received: from localhost (fayad@localhost) by cse.unl.edu (8.9.1/8.9.1) with ESMTP id WAA5468840; Tue, 18 Apr 2000 22:36:58 -0500 (CDT) Date: Tue, 18 Apr 2000 22:36:58 -0500 From: Mohamed Fayad To: Undisclosed recipients: ; Subject: CFCs for S/W Arch., Components, and Frameworks In-Reply-To: <200004180202.MAA12541 [at] goanna [dot] cs.rmit.edu.au> Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Greetings, Apologies if you recieve multitple copies of this cfcs. Enclosed, please find a call for chapters and reviewers. Cheers, M. Fayad ---------------------- 3-volume book on Software Architectures, Components, and Frameworks Call for Chapters and Reviewers Authors and Editors: Dr. Mohamed Fayad: fayad [at] cse [dot] unl.edu, m.fayad [at] computer [dot] org, fayadm [at] acm [dot] org, URL: http://www.cse.unl.edu/~fayad Dr. David Garlan: garlan [at] cs [dot] cmu.edu URL: http://www.cs.cmu.edu/~garlan Professor Wolfgang Pree: pree [at] acm [dot] org URL: www.informatik.uni-konstanz.de/swe We are developing three-volume series of books on software architectures, components, and frameworks. If this is your area of interest/research, I would like to invite you to submit a chapter. This series of books will serve as a complete reference set for academics and practitioners. Volume 1: Software Architectures The working title of the first-volume is "Software Architectures." Architecture-based software engineering research has yielded an impressive array of technologies and demonstrations over the past decade. Using an architecture-based approach, applications have been built which: - Are understandable - Are expected to evolve - Exhibit remarkable flexibility - Demonstrate significant reuse of off-the-shelf components - Leverage experience from related applications in the same problem domain - Are analyzable earlier in their development than ever before - Are key milestones in software managerial and development processes Currently, there is relatively little guidance for software developers on how to develop software architectures. This volume addresses several topics crucial to the state of the art and practice of software architecture. The book presents a complete reference on how to develop a good software architecture and provides guidelines for resolving key software architecture issues, such as evolving software architectures, leveraging existing investment in software architecture artifacts, representing architecture description languages, introducing formal models for software architectures, addressing architectural analysis techniques & development methods, transitioning from software architecture to coding and surveying architectural design tools and environments. In addition, the book will include sections on: accessing of software architectures, testing and validating software architectures, improving software architecture quality, documenting software architectures, and many more. This is a pragmatic book that is specifically designed to help organizations develop software architectures for real projects in the real world. Comprehensive technical and management guidelines are thoroughly discussed, ranging from specifying software architecture elements and their behaviors, to the impact of software architecture on the job. Likewise, technical issues (such as documenting and utilizing software architectures) are discussed in detail. Volume 2: Product-Line Architectures The working title of the second-volume is "Product-Line Architectures". Software product lines are emerging as a new and important software development paradigm. A Product-Line Architecture (PLA) is a design for a family of related applications, and its motivation is to simplify the design and maintenance of program families and to address the needs of highly customizable applications in an economical manner. Companies are realizing that the practice of building sets of related systems from common assets can yield remarkable improvements in productivity, time to market, product quality and customer satisfaction. But these gains are only a part of the picture; organizational, technical and management issues are other factors that should be considered. Although there are encouraging research experiences with PLAs and some guidelines exist to help in the development process, some issues about component-based development in PLAs are still under study. The goal of this book is to examine the foundational concepts underlying product lines and address the essential activities developers should consider to apply a PLA to a number of lines of products. The book will include sections on: lessons learned in PLA-based development, architectural specification, tools and process for software development, core asset management, domain analysis, configuration management, evaluation methods, quality factors involved, implementation strategies, and many more. Volume 3: Component-Based Software Developments & Enterprise Frameworks The working title of the third-volume is "Component-Based Software Development and Enterprise Frameworks". Nowadays, software engineering is moving forward on an architecture-based development conception where systems are built by composing or assembling components that are often developed independently. The key to making a large variety of software products and reducing time to market is to build pieces of software where the development effort can serve in other products as well. Thus, large-grained components are becoming a practical part of an enterprise component strategy. Such generic components usually include interactions with other components, code, design models, design patterns and specifications. In addition, they must provide ways to be adaptable and customizable according with the client's needs. In this context, enterprise frameworks offer an appropriate base for waving the software architectures, components, and core requirements into one container that is adaptable, customizable, extensible, and reusable. The technology of component-based systems is quite well established, but it is not the same with the methods to develop them. The need of well-defined techniques, notations and architectural support is still pending. The book will cover all these issues. This book is intended to provide valuable, real world insight into successful development and/or adaptation of OO Enterprise Frameworks, by describing the problems with frameworks, explaining the issues related to the development and adaptation of enterprise frameworks, selecting the right methods and tools for building frameworks. The book will be derived from actual experiences, successes and failures, and is presented in a practical, easy to understand manner. This is information that readers can apply today. The key issues are: + What are the key enterprise-oriented framework issues? + How to develop enterprise frameworks and what are the framework design guidelines? + What kind of evolution does an Enterprise Framework undergo and how is it correlated with the enterprise life span? + How can the adaptation of OO enterprise framework be accomplished with minimum impact on the cost and schedule? + Understand make vs. buy decisions, selection guidelines, and how to select and adapt the right enterprise framework for the job. + Understand the implication of enterprise business requirements on the framework design. + How to use your large-scale enterprise framework and how to protect your investment. + How to deal with resource requirements, enterprise framework integration problems, framework reporting, and others. + What are the impacts of enterprise frameworks on the national and global economy? This volume helps organizations apply component-based technology effectively by citing examples from the real world. This book combines the actual experiences and lessons learned from developing and/or adapting component-based enterprise framework developments. Reviewers: Please e-mail your contact information and your area of interests to the lead author and editor. Authors: Please submit one electronic copy in RTF interchange or Microsoft Word document formats by August 1, 2000 or sooner to the lead author and editor: Dr. Mohamed E. Fayad J.D. Edwards Professor Computer Science & Engineering Dept., University of Nebraska, Lincoln 108 Ferguson Hall, P.O. Box 880115, Lincoln, NE 68588-0115 Ph: (402) 472-2615, Fax: (402) 472-7767 E-mail: fayad [at] cse [dot] unl.edu, m.fayad [at] computer [dot] org, fayadm [at] acm [dot] org URL: http://www.cse.unl.edu/~fayad Submissions: Submissions should be presented in a practical, easy to understand manner, providing information that readers can apply today. We seek original articles on specific practical and research issues related to software architectures, product-line architectures, component-based software developments and enterprise application frameworks. Chapters may be of any length, ranging from a few pages (2-3 pages or 1,200 words - sidebars) to a full treatment of substantial software architectures, components, or frameworks (ranging from 10 pages to say 40 pages or 25,000 words - Chapters), including illustrations. Submissions are peer-reviewed and are subject to editing for style, clarity, and space. We also encourage authors to submit supplement materials, such as documentation and portions of the detailed implementation of their frameworks or complete documentation or portions of the software architecture or product-line architecture. All submissions should identify a principal contact author by e-mail address and/or fax and/or telephone number and postal address. Please keep in mind that each volume will be the only complete work on this topic. We received excellent responses from most of the authors that we contacted for this project. We promise a high-quality and an extremely useful publication for the computer and software industries. Your chapter should have appendixes of annotated references, notation, process, and definitions. Each chapter will include the biographies of the authors. We will also ask you to perform a final review for two or three chapters, collect opinions from you related to the organization of each volume and keep you up-to-date about the progress of this project. If a chapter is accepted, the authors will be asked to provide the following sections: 1. Review questions, 2. Problem sets, and/or 3. Projects, and 4. Key solutions. We would like to finish the work related to this project in twelve to fifteen months. Currently, we have over 10 chapters for the first volume,10 papers for the second volume, and 5 papers for the third volume. All papers are under review. Questions regarding the suitability of a topic should be sent to: fayad [at] cse [dot] un1.edu, garlan [at] cs [dot] cmu.edu, or pree [at] acm [dot] org If you are considering submitting a chapter, I would like to receive the following information immediately for starting the review process for your chapter: 1. The title of your chapter 2. The list of authors and their contact information 3. The abstract 4. The point of contact For further information about this series of books, please contact me at , , or For detailed author guidelines, check the following web site: www.cse.unl.edu/~fayad Book Projects From owner-reliable_computing [at] interval [dot] usl.edu Wed Apr 19 21:31:28 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id VAA13034 for reliable_computing-outgoing; Wed, 19 Apr 2000 21:31:27 -0500 (CDT) Received: from apollon.ito.ecei.tohoku.ac.jp (apollon.ito.ecei.tohoku.ac.jp [130.34.197.37]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id VAA13029 for ; Wed, 19 Apr 2000 21:31:03 -0500 (CDT) Received: from localhost (micrus [130.34.197.15]) by apollon.ito.ecei.tohoku.ac.jp (8.8.8/3.6W-) with ESMTP id LAA19718; Thu, 20 Apr 2000 11:37:22 +0900 (JST) To: haskell [at] haskell [dot] org, csl [at] dbai [dot] tuwien.ac.at, prolog-vendors [at] sics [dot] se, papm [at] dcs [dot] ed.ac.uk, clp [at] comp [dot] nus.edu.sg, amast [at] cs [dot] utwente.nl, ikbs [at] caad [dot] ed.ac.uk, fsdm [at] it [dot] uq.edu.au, rewrting@ens-lyon.fr, skeletons [at] dcs [dot] ed.ac.uk, lprolog [at] cis [dot] upenn.edu, lics [at] research [dot] bell-labs.com, idss [at] socs [dot] uts.edu.au, forum [at] jsoftware [dot] com, dss [at] cs [dot] auc.dk, erlang-questions [at] erlang [dot] org, types [at] cis [dot] upenn.edu, brics-vip [at] daimi [dot] aau.dk, vdm-forum [at] mailbase [dot] ac.uk, nl-kr [at] cs [dot] rpi.edu, ecoopws [at] cui [dot] unige.ch, clean-list [at] cs [dot] kun.nl, reliable_computing [at] interval [dot] usl.edu, facs [at] lboro [dot] ac.uk, atp_alias [at] cs [dot] jcu.edu.au, prolog-pe [at] bach [dot] ces.cwru.edu, clp [at] cis [dot] ohio-state.edu cc: miyakawa [at] ito [dot] ecei.tohoku.ac.jp Subject: IFIP TCS2000 INFORMATION X-Mailer: Mew version 1.94.1 on XEmacs 20.4 (Emerald) Mime-Version: 1.0 Content-Type: Text/Plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-Id: <20000420113127Q.miyakawa [at] ito [dot] ecei.tohoku.ac.jp> Date: Thu, 20 Apr 2000 11:31:27 +0900 From: Shinya MIYAKAWA X-Dispatcher: imput version 990905(IM130) Lines: 650 Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk [Apologies for multiple copies] IFIP TCS2000 PRELIMINARY PROGRAM AND REGISTRATION INFORMATION ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ -------------------------------------------------------------------------- IFIP International Conference on Theoretical Computer Science (IFIP TCS2000) --- Exploring New Frontiers of Theoretical Informatics --- August 17 - 19, 2000 Aoba Memorial Bldg., Tohoku University, Sendai, Japan Further Information about IFIP TCS2000 can be obtained on the Web, at http://tcs2000.ito.ecei.tohoku.ac.jp/tcs2000/ Any inquiry on IFIP TCS2000 Program and Registration may be directed to TCS2000 [at] ito [dot] ecei.tohoku.ac.jp -------------------------------------------------------------------------- PRELIMINARY PROGRAM ^^^^^^^^^^^^^^^^^^^ [Outline] AUGUST 16: 15:00 Registration at Sendai Tokyu Hotel till 20:00 18:00 Welcome at Sendai Tokyu Hotel till 19:00 AUGUST 17: 9:30 Opening Session 10:00 Keynote Plenary Talk 1 ----------------------------------------- 11:10 - 17:30 TRACK (1) || TRACK (2) ----------------------------------------- AUGUST 18: 9:10 Keynote Plenary Talk 2 ----------------------------------------- 10:20 - 15:30 TRACK (1) || TRACK (2) ----------------------------------------- 15:50 Panel Discussion till 17:10 ----------------------------------------- 18:30 Banquet at Sendai Tokyu Hotel AUGUST 19: 9:10 Keynote Plenary Talk 3 ----------------------------------------- 10:20 - 14:20 TRACK (1) || TRACK (2) ----------------------------------------- 14:30 Closing Session till 14:40 ----------------------------------------- 15:00 Open Lectures till 17:00 ----------------------------------------- 18:30 Japanese Dinner Party till 20:00 ----------------------------------------- AUGUST 16 WEDNESDAY ^^^^^^^^^^^^^^^^^^^ 15:00 REGISTRATION at Sendai Tokyu Hotel till 20:00 18:00 WELCOME with light snack at Sendai Tokyu Hotel till 19:00 AUGUST 17 THURSDAY ^^^^^^^^^^^^^^^^^^ 9:30 OPENING SESSION Giorgio Ausiello (TC1 Chair and IFIP TCS2000 Co-Chair) Takayasu Ito (IFIP TCS2000 Co-Chair) 10:00 KEYNOTE PLENARY TALK Reconciling Two Views of Cryptography Martin Abadi (Bell Labs, Lucent) 10:50 Break [TRACK (1)] SESSION (1.1), 11:10 - 12:00 11:10 Approximation Algorithms for String Folding Problems Giancarlo Mauri, Giulio Pavesi 11:35 An Index for Two Dimensional String Matching Allowing Rotations Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen 12:00 Lunch Break SESSION (1.2), 13:30 - 14:20 13:30 Parallel Edge Coloring of a Tree on a Mesh Connected Computer Chang-Sung Jeong, Sung-Up Cho, Mi-Young Choi 13:55 Parallel Approximation Algorithms for Maximum Weighted Matching in General Graphs Ryuhei Uehara, Zhi-Zhong Chen 14:20 Break 14:40 TRACK (1) INVITED TALK It is on the Boundary: Complexity Considerations for Polynomial Ideals Ernst Mayr (TU Muenchen) 15:30 Break SESSION (1.3), 15:50 - 17:30 15:50 An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks Yoojin Chung, Kunsoo Park 16:15 Task Distributions on Multiprocessor Systems Evgeny V. Shchepin, Nodari Vakhania 16:40 Fast Interpolation using Kohonen Self-Organizing Neural Networks Olivier Sarzeaud, Yann Stephan 17:05 Steganography Using Modern Arts Galdi Clemente, Blundo Carlo 17:30 Break -----------// [TRACK (2)] SESSION (2.1), 11:10 - 12:00 11:10 Ambient Groups and Mobility Types Luca Cardelli, Giorgio Ghelli, Andrew D. Gordon 11:35 An Asynchronous, Distributed Implementation of Mobile Ambients Cedric Fournet, Jean-Jacques Levy, Alan Schmitt 12:00 Lunch Break 13:30 TRACK (2) INVITED TALK Type Systems for Concurrent Processes: From Deadlock-Freedom to Livelock-Freedom, Time-Boundedness Naoki Kobayashi (U. Tokyo) 14:20 Break SESSION (2.2), 14:40 - 15:30 14:40 Local pi-Calculus at Work: Mobile Objects as Mobile Processes Massimo Merro, Josva Kleist, Uwe Nestmann 15:05 An Interpretation of Typed Concurrent Objects in the Blue Calculus Silvano Dal-Zilio 15:30 Break SESSION (2.3), 15:50 - 17:30 15:50 A Higher-Order Specification of the pi-Calculus Joelle Despeyroux 16:15 Open Ended Systems, Dynamic Bisimulation, and Tile Logic Vladimiro Sassone 16:40 Fibred Models of Processes: Discrete, Continuous, and Hybrid Systems Marcelo Fiore 17:05 On the Complexity of Bisimulation Problems for Pushdown Automata Richard Mayr 17:30 Break AUGUST 18 FRIDAY ^^^^^^^^^^^^^^^^ 9:10 KEYNOTE PLENARY TALK Theory and Construction of Molecular Computers Masami Hagiya (U. Tokyo) 10:00 Break [TRACK (1)] SESSION (1.4), 10:20 - 12:00 10:20 Trade-offs between Density and Robustness in Random Interconnection Graphs P. Flajolet, K. Hatzis, S. Nikoletseas, P. Spirakis 10:45 The ($\sigma$+1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges Satoshi Taoka, Toshimasa Watababe 11:10 On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem Sounaka Mishra, Kripasindhu Sikdar 11:35 Maximum Clique and Minimum Clique Partition in Visibility Graphs Stephan Eidenbenz 12:00 Lunch Break SESSION (1.5), 13:30 - 14:20 13:30 Real-Time Language Recognition by Alternating Cellular Automata Thomas Buchholz, Andreas Klein, Martin Kutrib 13:55 Damage Spreading and $\mu$-Sensitivity on CA Bruno Martin 14:20 Break 14:40 TRACK (1) INVITED TALK Discrepancy Theory and its Applications to Finance Shu Tezuka (IBM Tokyo Research Lab) 15:30 Break -----------// [TRACK (2)] SESSION (2.4), 10:20 - 12:00 10:20 A Type-theoretic Study on Partial Continuations Yukiyoshi Kameyama 10:45 Partially Typed Terms between Church-Style and Curry-Style Ken-etsu Fujita, Aleksy Schubert 11:10 Alternating Automata and Logics over Infinite Words Christof Loeding, Wolfgang Thomas 11:35 Hypothesis Support for Information Integration in Four-Valued Logics Yann Loyer, Nicolas Spyratos, Daniel Stamate 12:00 Lunch Break 13:30 TRACK (2) INVITED TALK A Compositional Model of Time and Uncertainty Thomas Henzinger (UC Berkeley) 14:20 Break SESSION (2.5), 14:40 - 15:30 14:40 A Single Complete Refinement Rule for Demonic Specifications Karl Lermer, Paul Strooper 15:05 Reasoning about Composition using Property Transformers and their Conjugates Michel Charpentier, K. Mani Chandy 15:30 Break ----------------------- 15:50 PANEL DISCUSSION on "New Challenges for TCS" Panelists: Giorgio Ausiello (U. Roma "La Sapienza") Jozef Gruska (Masaryk U.) Ugo Montanari (U. Pisa) Takao Nishizeki (Tohoku U.) Yoshihito Toyama (Tohoku U.) Jiri Wiedermann (Inst. Informatics, Prague) 17:10 Break 18:30 BANQUET at Sendai Tokyu Hotel till 20:45 BANQUET SPEECH Non-Random Thoughts about Randomization Michael O. Rabin (Harvard U.) AUGUST 19 SATURDAY ^^^^^^^^^^^^^^^^^^ 9:10 KEYNOTE PLENARY TALK List Decoding: Algorithms and Applications Madhu Sudan (MIT) 10:00 Break [TRACK (1)] SESSION (1.6), 10:20 - 12:00 10:20 Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits Endre Boros, Toshihide Ibaraki, Kazuhisa Makino 10:45 Characterization of Optimal Key Set Protocols Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki 11:10 On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model Valentin E. Brimkov, Stefan S. Dantchev 11:35 On Logarithmic Simulated Annealing A. Albrecht, C.K. Wong 12:00 Lunch Break 13:30 TRACK (1) INVITED TALK Hierarchical State Machines Mihalis Yannakakis (Bell Labs, Lucent) 14:20 Break -----------// [TRACK (2)] 10:20 TRACK (2) INVITED TALK Some New Directions in the Syntax and Semantics of Formal Languages Gordon D. Plotkin (Edinburgh U.) 11:10 Break 11:20 DEMO SESSION (1) on Verification Tools 12:00 Lunch Break 13:30 DEMO SESSION (2) on Verification Tools 14:20 Break ------------------------ 14:30 CLOSING SESSION till 14:40 Giorgio Ausiello (TC1 Chair and IFIP TCS2000 Co-Chair) Takayasu Ito (IFIP TCS2000 Co-Chair) ------------------------ [OPEN LECTURES] 15:00 On the Power of Interactive Computing Jan van Leeuwen (U. Utrecht) 16:00 The Varieties of Programming Language Semantics Peter D. Mosses (U. Aarhus) 17:00 Break ------------------------ 18:30 JAPANESE DINNER PARTY till 20:00 ========================================================================== GENERAL INFORMATION ^^^^^^^^^^^^^^^^^^^ IFIP TCS2000 is the first International Conference on Theoretical Computer Science organized by IFIP TC1 on Foundations of Computer Science, and it consists of two tracks: TRACK (1) on Algorithms, Complexity and Models of Computation, and TRACK (2) on Logic, Semantics, Specification, and Verification. The conference proceedings will be published as a volume of Lecture Notes in Computer Science, Springer-Verlag. IFIP TCS2000 will be held on the campus of Tohoku University, Sendai, Japan. The invited talks and contributed talks will be presented at the Aoba Memorial Building and Engineering Conference Hall, Faculty of Engineering located on the Aoba Hill about 3 km west of downtown Sendai. The conference welcome reception and banquet will be held at Sendai Tokyu Hotel, located at downtown Sendai. Please, register and make reservations by returning the completed form by email and fax, following the instructions below. There will also be on-site registration at: * Sendai Tokyu Hotel, 15:00 - 20:00, August 16 * Aoba Memorial Bldg., Tohoku Univ., 9:00 - 17:00 on August 17 - 19. Transportation Conference participants arriving at the new Tokyo International (Narita) Airport are advised to take the JR Narita Express train from Narita Airport to Tokyo Station. Then, take the Yamabiko super express train of Tohoku Shinkansen (Tohoku Bullet Train) to Sendai from Tokyo Station. The Yamabiko runs every 20 - 30 min. and takes about 2 hours from Tokyo to Sendai. Making reservation at Narita Station for the Yamabiko is recommended, since it will be the summer tourist season. Those arriving at the new Osaka International Airport (Kansai Airport) can fly to Sendai Airport, and take Limousine Bus service to Sendai Station. The bus takes about 30 min. to go from the Airport to Sendai Station. You can also take a shuttle bus service from Kansai Airport to the Osaka-Itami Airport to fly from there to Sendai Airport. Alternatively, you can take a local train from the Kansai Airport to JR Shin Osaka Station, then take the Tokaido Shinkansen from Osaka to Tokyo Station and change at Tokyo Station to Tohoku Shinkansen. Some details on transportation will be available on the TCS2000 Web page, at http://tcs2000.ito.ecei.tohoku.ac.jp/tcs2000/ Note: (1) In Japan, mid-August is the busiest tourist time during summer, including domestic and international flights. (2) No flight service is available from Narita to Sendai Airport, since the train service is convenient. There is another train service from Narita Airport to downtown Tokyo (Ueno) by Skyliner of the Keisei-Narita Line. At Ueno you can take the Yamabiko super express of Tohoku Shinkansen to Sendai, but you have to walk about 10 min. from Keisei-Ueno Station to JR Ueno Station to take Tohoku Shinkansen. (3) If you are going to travel in Japan by JR lines before/after the IFIP TCS2000 conference, it will be convenient and economical to get a JR PASS before your departure. Contact your travel agent for more information on JR PASS (Japan Rail Pass). Hotels Two hotels are arranged to offer special discount rates to IFIP TCS2000 participants: Sendai Tokyu Hotel and Sendai Washington Hotel. They are 1.2 km west of Sendai Station and about 800 Yen by taxi from the station. These hotels are located within 5 min. walk from each other. The conference welcome reception and banquet will be held at Sendai Tokyu Hotel. Sendai and Climate Sendai is the largest city in the northern part of the Honshu Island of Japan, with a population of about a million. The City is known in Japan as "City of Trees". Sendai is a modern, safe city with a temperate climate blessed by four distinct seasons; even in mid August it is quite seldom that the highest temperature exceeds 30 C (86 F). Usually, the weather in mid August would be mostly sunny with temperatures ranging from 20 C (68 F) to 30 C (86 F), and rain, if any, would rarely be heavy. Note: Average temperatures in August at Sendai, Tokyo and Osaka are about 23.5 C, 26.5 C and 27.5, respectively. REGISTRATION AND RESERVATION INFORMATION ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ REGISTRATION FEES Registration fees cover attendance in all sessions, a copy of the proceedings, refreshments, the welcome reception and banquet, but not the Japanese dinner party on August 19. The reduced author rate applies to all authors of the accepted papers, and the reduced committee member rate applies to all TC1 members and to all members of the Program Committee and the Organizing Committee. The student rate applies to full time students. Registrants paying reduced rates have full privileges at the conference. The companion rate covers the reception and banquet only. Through July 1st, 2000 From July 2nd, 2000 Regular 40,000 Yen 50,000 Yen Author 30,000 Yen 40,000 Yen Committee Member 30,000 Yen 40,000 Yen Student 25,000 Yen 30,000 Yen Companion 5,000 Yen 7,000 Yen HOTELS Two convenient Western Style hotels offer special IFIP TCS2000 discount rates. Rates are per person, per night, and include service charge and tax (not including breakfast). Single Room Twin Room Sendai Tokyu Hotel 10,500 Yen 8,400 Yen Sendai Washington Hotel II 8,400 Yen 7,350 Yen Sendai Washington Hotel I 7,350 Yen --------- Note: Twin room reservations are available for two persons. No roommate matching service is available, so that twin room reservations remain the registrant's responsibility. JAPANESE DINNER PARTY A Japanese dinner party for participants from abroad will be arranged at SHOZANKAN in the evening of August 19. The invited speakers, some Steering Committee members, PC members and conference organizers will attend. A limited number of reservations will be available for this dinner party. The rates are as follows. Conference registrant: 10,000 Yen Companion: 7,000 Yen ============================================================================= Cut here to send your registration form after filling in the required items. ============================================================================= IFIP TCS2000 REGISTRATION AND RESERVATION FORM ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Please register and make reservations by completing the form below and returning it by email to tcs02 [at] thk [dot] jtb.co.jp Registrants are advised to email a copy of their completed form to TCS2000 [at] ito [dot] ecei.tohoku.ac.jp They are also encouraged to send a signed, printed copy of their completed form by fax to 022-262-5002 (domestic) +81-22-262-5002 (from abroad) which is the fax number of the following agent to take care of the conference registration and reservation. JTB (Japan Travel Bureau) Tohoku Communications Inc. Kotsukosha Bldg 3F, 3-6-Chuo Aoba-Ku, Sendai 980-0021, Japan (Fax) 022-262-5002 (domestic) +81-22-262-5002 (from abroad) (Phone) 022-262-5055 (domestic) +81-22-262-5055 (from abroad) (Email) tcs02 [at] thk [dot] jtb.co.jp Registration and reservations will be completed by your payment, whose method is described below. IMPORTANT NOTE: As described below, from the standpoint of the safety, registrants are advised to pay fees by Bank Transfer. When the payment is made by a credit card, they are advised to send the required information including Credit Card numbers by FAX; that is, do NOT send Credit Card numbers by email. REGISTRATION FOR IFIP TCS2000 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Last (Family) Name: First (Given) Name: Middle: Affiliation: Postal Address: City/State/Zip: Country: Phone: Fax: Email: Registration Status : Number of Companions: Companions' names (if applicable): (A) Total Registration Fee(s) in Yen: HOTEL RESERVATION Hotel First Choice: Hotel Second Choice: Number of Single Room(s): Number of Twin Room(s): Roommate's Name(s) for Twin Room(s): Check-in Date: Check-out Date: Number of Nights: Special Room or other Request: JAPANESE DINNER PARTY A limited number of reservations are available for the Japanese dinner party at SHOZANKAN on August 19 to be arranged for participants from abroad. (B) 10,000 Yen x [ ] conference registrant(s): (C) 7,000 Yen x [ ] companion(s): TOTAL FEE IN YEN (A) + (B) + (C): Signature (not needed for email): METHOD OF PAYMENT FOR IFIP TCS2000 From the standpoint of the safety and security, participants are encouraged to pay via Bank Transfer. When they pay via credit card, they are advised to send the required information (in particular, Credit Card numbers) by FAX; that is, do NOT send your Credit Card numbers by email. In credit card payment Visa card, MasterCard, and Diners card will be accepted. Personal checks cannot be accepted. All payments must be made in Japanese Yen. Indicate method of payment below: [ ] Bank Transfer to Bank: Tokyo Mitsubishi Bank, Sendai Branch Account Name: IFIP TCS2000 Chair Takayasu Ito Account No. 1108671 From : Date of transfer: Payer's name: Note: In Japan the bank number of Tokyo Mitsubishi Bank is 0005, and the number of its Sendai Branch is 320. [ ] Payment by Credit Card Credit Card Type : Card Number: Expiration Date: Signature (not needed for email): : When your payment is via Credit Card, send the above information by FAX to +81-22-262-5002, the fax no. of JTB Communications Inc. Even when you send the above form by fax, send it by EMAIL without filling in Credit Card number for safety. ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Registration and reservations will be confirmed upon receipt of payment. Refunds will be made upon written request received through July 31st, 2000 by JTB Tohoku Communications Inc. From owner-reliable_computing [at] interval [dot] usl.edu Thu Apr 20 19:10:10 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id TAA15581 for reliable_computing-outgoing; Thu, 20 Apr 2000 19:10:10 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id TAA15576 for ; Thu, 20 Apr 2000 19:10:06 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.10.1/8.10.1) with SMTP id e3L0A1728819; Thu, 20 Apr 2000 18:10:01 -0600 (MDT) Message-Id: <200004210010.e3L0A1728819 [at] cs [dot] utep.edu> Date: Thu, 20 Apr 2000 18:10:02 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: please express your interest by May 1 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: 2vMyhm8Z5fLqGEePsep+qw== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk URGENT !!! CALL FOR PAPERS Mini-track on INTERVAL COMPUTATIONS AND FUZZY TECHNIQUES at the Joint 9th IFSA World Congress and 20th NAFIPS International Conference of NAFIPS, the North American Fuzzy Information Processing Society and IFSA, the International Fuzzy Systems Association INTRODUCTION: FUZZY TECHNIQUES In many application are