Subject: clustering
Date: Fri, 5 Feb 1999 15:16:54 +0100
MIME-Version: 1.0
Content-Type: multipart/alternative;
boundary="----=_NextPart_000_0006_01BE511A.909AB490"
X-Priority: 3
X-MSMail-Priority: Normal
X-Mailer: Microsoft Outlook Express 4.72.2106.4
X-MimeOLE: Produced By Microsoft MimeOLE V4.72.2106.4
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk
Messaggio a più sezioni in formato MIME.
------=_NextPart_000_0006_01BE511A.909AB490
Content-Type: text/plain;
charset="iso-8859-1"
Content-Transfer-Encoding: quoted-printable
Can anyone tell me something about the "clustering phenomenon" that can =
be found working with Interval Analysis Algorithms?
For example it can be found in some algorithms to solve non-linear =
system of equations, proposed by L.Kolev, in order to identify all the =
DC operating points of a resistive network.
Thanks.
Federico Bizzarri
------=_NextPart_000_0006_01BE511A.909AB490
Content-Type: text/html;
charset="iso-8859-1"
Content-Transfer-Encoding: quoted-printable
Can anyone tell me something about =
the =20
"clustering phenomenon" that can be found working with =
Interval=20
Analysis Algorithms?

For example it =
can be found=20
in some algorithms to solve non-linear system of equations, proposed by =
L.Kolev,=20
in order to identify all the DC operating points of a resistive=20
network.

Thanks.

Federico =
Bizzarri

------=_NextPart_000_0006_01BE511A.909AB490--
From owner-reliable_computing [at] interval [dot] usl.edu Fri Feb 5 11:06:14 1999
Received: by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id LAA13279
for reliable_computing-outgoing; Fri, 5 Feb 1999 11:06:14 -0600 (CST)
Received: from balin.ap.univie.ac.at (balin.ap.univie.ac.at [131.130.11.50])
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with SMTP id LAA13274
for ; Fri, 5 Feb 1999 11:06:08 -0600 (CST)
Received: from homer.mat.univie.ac.at by balin.ap.univie.ac.at (5.65v4.0/1.1.10.5/01Feb99-0627PM)
id AA03971; Fri, 5 Feb 1999 18:06:04 +0100
Received: by homer.mat.univie.ac.at (5.65v3.2/1.1.10.5/19Mar97-1148AM)
id AA13748; Fri, 5 Feb 1999 18:06:04 +0100
Date: Fri, 5 Feb 1999 18:06:04 +0100
From: Arnold Neumaier
Message-Id: <9902051706.AA13748 [at] homer [dot] mat.univie.ac.at>
To: bizet [at] linuxmail [dot] dibe.unige.it, reliable_computing [at] interval [dot] usl.edu
Subject: Re: clustering
Cc: neum [at] cma [dot] univie.ac.at
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk
>>Can anyone tell me something about the "clustering phenomenon" that can =
be found working with Interval Analysis Algorithms?<<
I think, Baker kearfott and his group has published about this...
Arnold Neumaier
From owner-reliable_computing [at] interval [dot] usl.edu Fri Feb 5 13:43:20 1999
Received: by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id NAA13666
for reliable_computing-outgoing; Fri, 5 Feb 1999 13:43:20 -0600 (CST)
Received: from suze.ucs.usl.edu (root [at] smh138s [dot] ucs.usl.edu [130.70.40.60])
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id NAA13661
for ; Fri, 5 Feb 1999 13:43:19 -0600 (CST)
Received: from bp.usl.edu (liberty.usl.edu [130.70.46.171])
by suze.ucs.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with SMTP id NAA21727;
Fri, 5 Feb 1999 13:43:11 -0600 (CST)
Message-Id: <2.2.32.19990205193943.00682180 [at] pop [dot] usl.edu>
X-Sender: rbk5287 [at] pop [dot] usl.edu
X-Mailer: Windows Eudora Pro Version 2.2 (32)
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Date: Fri, 05 Feb 1999 13:39:43 -0600
To: reliable_computing [at] interval [dot] usl.edu
From: "R. Baker Kearfott"
Subject: Re: clustering
Cc: bizet [at] linuxmail [dot] dibe.unige.it
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk
Yes. Check out my home page at
http://interval.usl.edu/kearfott.html
by clicking on "preprints". The papers you want are
The Cluster Problem in Global Optimization: The Univariate case, joint with K. Du, in Computing (Suppl.) 9, pp. 117-127 (1992).
and
The Cluster Problem in Multivariate Global Optimization, joint with K. Du, in
the Journal of Global Optimization 5, pp. 253-265 (1994).
Preprints are available in Postscript and DVI form from the above-mentioned
web site.
The above do not tell the whole story about the "Cluster" problem. There
are other reasons for it in practical implementations. I am presently
writing up something about that.
Best regards,
Baker
At 06:06 PM 2/5/99 +0100, Arnold Neumaier wrote:
>>>Can anyone tell me something about the "clustering phenomenon" that can =
>be found working with Interval Analysis Algorithms?<<
>
>I think, Baker kearfott and his group has published about this...
>
>Arnold Neumaier
>
>
---------------------------------------------------------------
R. Baker Kearfott, rbk [at] usl [dot] edu (318) 482-5346 (fax)
(318) 482-5270 (work) (318) 981-9744 (home)
URL: http://interval.usl.edu/kearfott.html
Department of Mathematics, University of Southwestern Louisiana
USL Box 4-1010, Lafayette, LA 70504-1010, USA
---------------------------------------------------------------
From owner-reliable_computing [at] interval [dot] usl.edu Sun Feb 7 21:35:27 1999
Received: (from daemon@localhost)
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id VAA15773
for reliable_computing-outgoing; Sun, 7 Feb 1999 21:35:27 -0600 (CST)
Received: from mscs.mu.edu (studsys.mscs.mu.edu [134.48.4.25])
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with SMTP id VAA15768
for ; Sun, 7 Feb 1999 21:35:23 -0600 (CST)
Received: (qmail 26155 invoked from network); 8 Feb 1999 03:35:20 -0000
Received: from ppp108.csd.mu.edu (HELO taylor) (134.48.24.8)
by studsys.mscs.mu.edu with SMTP; 8 Feb 1999 03:35:20 -0000
Message-ID: <001e01be5314$208522c0$08183086@taylor>
From: "George Corliss"
To: "reliable_computing"
Subject: Tighter bounds for Taylor coefficients?
Date: Sun, 7 Feb 1999 21:35:50 -0600
MIME-Version: 1.0
Content-Type: text/plain;
charset="iso-8859-1"
Content-Transfer-Encoding: 7bit
X-Priority: 3
X-MSMail-Priority: Normal
X-Mailer: Microsoft Outlook Express 4.72.3155.0
X-MimeOLE: Produced By Microsoft MimeOLE V4.72.3155.0
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk
Interval Taylor Coefficients Solve a System
George F. Corliss, georgec [at] mscs [dot] mu.edu
Marquette University
07 Feb 1999
For many years, I have suggested using nonlinear system tools to
tighten enclosures for Taylor series coefficients generated by
recurrence relations. This message outlines the approach and why
it DOES NOT WORK.
For example, consider the Lorenz system
x' = sigma * (y(t) - x(t))
y' = r * x(t) - y(t) - x(t) * z(t)
z' = x(t) * y(t) - b * z(t),
with sigma = 10, b = 8/3, and r = 28, and interval-valued initial
conditions. Taylor coefficients are given by recurrence relations
X[2] := sigma*(Y[1] - X[1]) * h;
Y[2] := (r*X[1] - Y[1] - X[1]*Z[1]) * h;
Z[2] := (X[1]*Y[1] - (b*Z[1])) * h;
for k from 3 to Order do
X[k] := sigma*(Y[k-1] - X[k-1]) * h / (k-1);
Y[k] := (r*X[k-1] - Y[k-1] - sum(X[n]*Z[k-n-1], n = 1..k-1)) * h / (k-1);
Z[k] := (sum(X[n]*Y[k-n-1], n = 1..k-1) - b*Z[k-1]) * h / (k-1);
od;
Low order terms appear many times in the computation of the high order
terms, so the dependency effects lead to large over-estimations, which
force an ODE solver to take much smaller steps than should be required.
Suppose we view the recurrence relations as defining a system of
equations for the unknowns X[2], Y[2], Z[2], ... Forward substitution
solves the system, but an interval Newton, constraint propagation, or
other technique might give tighter enclosures.
The interval Newton system for this example (and in general, for h small)
has diagonal elements 1
is sparse, lower triangular, and strictly diagonally dominant
has modest condition number
A Gauss-Seidel iterative solution to the interval Newton system is
EXACTLY the same as a centered mean value evaluation of the forward
recurrences. Hence one Newtion iteration and Gauss-Seidel iteration
are sufficient, but NEITHER OFFER AN APPRECIABLE IMPROVEMENT OVER
NAIVE INTERVAL EVALUATION of the recurrence relations, although they
take far more CPU time.
Reformulating recurrence relations as a system DOES NOT HELP because
the dependence of high order terms on multiple copies of low order
terms is genuine. Tricky evaluation does not remove it.
On the other hand, by using Maple to express symbolically high order
terms as expressions in initial conditions X[1], Y[1], and Z[1],
arranging those expressions carefully, and evaluating in as naive
interval arithmetic DOES give bounds tighter than evaluating the
recurrence relations directly.
To me, this points to the insight and power of the approach of Martin
Berz (see www.mscs.mu.edu/~globsol/13Berz/). He expands the solutions
x(t), y(t), and z(t) as a floating-point valued truncated Taylor
series in terms of the INITIAL CONDITIONS, and adds a constant interval
enclosure of round-off and truncation errors.
I do not care to write a journal article on this great idea that did
not work, so I'll let this message communicate the negative results.
If anyone cares for details, please e-mail me, and I can send a
sequence of Maple worksheets. Otherwise, I recommend Berz's papers
at http://bt.nscl.msu.edu/cosy/index.htm See [COSY References] link.
From owner-reliable_computing [at] interval [dot] usl.edu Mon Feb 8 16:13:30 1999
Received: by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id QAA16785
for reliable_computing-outgoing; Mon, 8 Feb 1999 16:13:30 -0600 (CST)
Received: from cs.utep.edu (cs.utep.edu [129.108.1.41])
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with SMTP id QAA16780
for ; Mon, 8 Feb 1999 16:13:23 -0600 (CST)
Received: from saturn.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1)
id AA14355; Mon, 8 Feb 99 15:13:18 MST
Date: Mon, 8 Feb 99 15:13:18 MST
From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich)
Message-Id: <9902082213.AA14355 [at] cs [dot] utep.edu>
To: reliable_computing [at] interval [dot] usl.edu, interval [at] cs [dot] utep.edu
Subject: New Journal, Optimization and Engineering
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk
>From NA Digest:
Call for papers for the new journal
OPTIMIZATION AND ENGINEERING
The first issue is due to be published by
Kluwer Academic Publishers in early 2000 in early 2000
AIMS and SCOPE:
Optimization and Engineering is a multidisciplinary journal. Its primary
goal is to promote the application of optimization methods in the general
area of engineering sciences. This includes facilitating the development
of advanced optimization methods for direct or indirect use in engineering
sciences. The journal provides a forum in which engineering scientists
obtain information about recent advances of optimization sciences, and
researchers in mathematical optimization learn about the needs of
engineering sciences and successful applications of optimization methods.
Its aim is to close the gap between optimization theory and the practice
of engineering.
All optimization methods of relevance to applications in engineering sciences
will be considered: deterministic and stochastic, continuous, mixed integer
and discrete, when they are relevant for applications in engineering sciences.
The journal also strives to publish successful applications of optimization
in various engineering areas.
The scope of the journal includes the following:
OPTIMIZATION:
All mathematical methods and algorithms of mathematical optimization.
Numerical and implementation issues, optimization software, bench-marking.
Specifically:
Linear and convex optimization, general nonlinear and nonlinear mixed-
integer optimization, combinatorial optimization, equilibrium, multilevel
and multi-objective optimization, stochastic optimization.
ENGINEERING SCIENCES:
Electrical engineering, VLSI design, robotics, mechanical and
structural engineering, geophysical engineering, civil engineering,
industrial engineering, chemical and process engineering,
aerospace engineering, water management, environmental and
bio-engineering, transportation and communication sciences.
SUBMISSIONS:
Papers submitted for publication in OPTIMIZATION AND ENGINEERING
should be sent to the editor in chief
Tamas Terlaky
Dept SSOR, Facylty ITS/TWI
Delft University of Technology
P.O. Box 5031, 2600 GA Delft, The Netherlands
Tel.: +31 15 2782547 Fax: +31 15 2787255
E-mail: T.Terlaky [at] twi [dot] tudelft.nl
URL address: http://ssor.twi.tudelft.nl/~terlaky
Electronic submission of papers is strongly encouraged.
For more information look at:
http://ssor.twi.tudelft.nl/~terlaky/OPTE/call-for-papers.opte
From owner-reliable_computing [at] interval [dot] usl.edu Sun Feb 14 15:52:51 1999
Received: (from daemon@localhost)
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id PAA22022
for reliable_computing-outgoing; Sun, 14 Feb 1999 15:52:51 -0600 (CST)
Received: from cs.utep.edu ([129.108.5.2])
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with SMTP id PAA22017
for ; Sun, 14 Feb 1999 15:52:47 -0600 (CST)
Received: from saturn.cs.utep.edu by cs.utep.edu (4.1/SMI-4.1)
id AA01689; Sun, 14 Feb 99 14:52:45 MST
Date: Sun, 14 Feb 99 14:52:45 MST
From: vladik [at] cs [dot] utep.edu (Vladik Kreinovich)
Message-Id: <9902142152.AA01689 [at] cs [dot] utep.edu>
To: reliable_computing [at] interval [dot] usl.edu
Subject: from NA Digest; interval linear algebra
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk
From: Jack Dongarra
Date: Thu, 11 Feb 1999 11:40:23 -0500
Subject: BLAS Technical Forum
BLAS TECHNICAL FORUM, March 16-18, 1998, Oak Ridge, TN
We are planning a BLAS Technical Forum meeting on March 16-18, 1999.
The meeting will be hosted by the University of Tennessee and will be
held at the Ramada Inn & Suites in Oak Ridge, TN:
Ramada Inn & Suites
420 S. Illinois Avenue
Oak Ridge, TN 37830
(423) 483-4371
The Forum has been established to consider expanding the Basic Linear
Algebra Subprograms (BLAS) in a number of directions in the light of
modern software, language, and hardware developments. The first meeting
of the Forum was held in Nashville on February 19-20, 1996.
We strongly urge and encourage attendance at the meeting
so that we can make tangible progress towards much needed standards.
Wide input is needed to help ensure that emerging proposals are useful
and acceptable to the community.
It is appreciated that it is not easy for everyone to attend the
meetings of the Forum, but we would nevertheless welcome your input
since we wish the discussion to be as open as possible, and the results
to reflect consensus from the community at large.
The tentative schedule for the meeting will be:
9am-5pm: Tues, March 16
9am-5pm: Wed, March 17
9am-1pm: Thurs, March 18
Morning and afternoon snacks will be provided, but you're on-your-own
for lunches.
A rough agenda for the meeting follows:
* Second/third reading of the following chapters:
Chapter 1: Introduction
Chapter 2: Dense and Banded BLAS
Chapter 3: Sparse BLAS
Chapter 4: Extended and Mixed Precision BLAS
Chapter 5: Interval BLAS
* Discussion of model implementations and test suites.
Please send us items you would like to see on the agenda
or that you would like to discuss.
For more information see:
http://www.netlib.org/blas/blast-forum/blast-forum.html
Jack Dongarra and Sven Hammarling
From owner-reliable_computing [at] interval [dot] usl.edu Thu Feb 18 17:25:20 1999
Received: (from daemon@localhost)
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id RAA25937
for reliable_computing-outgoing; Thu, 18 Feb 1999 17:25:20 -0600 (CST)
Received: from mercury.Sun.COM (mercury.Sun.COM [192.9.25.1])
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with SMTP id RAA25932
for ; Thu, 18 Feb 1999 17:25:12 -0600 (CST)
Received: from Eng.Sun.COM (engmail4 [129.144.134.6]) by mercury.Sun.COM (SMI-8.6/mail.byaddr) with SMTP id PAA12990 for ; Thu, 18 Feb 1999 15:24:38 -0800
Received: from ha-sims.eng.sun.com (phys-thestorka.Eng.Sun.COM [129.146.1.231])
by Eng.Sun.COM (8.8.8+Sun/SMI-5.3) with ESMTP id PAA05426
for ; Thu, 18 Feb 1999 15:24:37 -0800 (PST)
Received: from gww (gww.Eng.Sun.COM)
by ha-sims.eng.sun.com (Sun Internet Mail Server sims.3.5.1998.09.21.23.34)
with SMTP id <0F7D00CFPIBANM@ha-sims.eng.sun.com> for
reliable_computing [at] interval [dot] usl.edu; Thu, 18 Feb 1999 15:23:34 -0800 (PST)
Date: Thu, 18 Feb 1999 15:24:36 -0800 (PST)
From: William Walster
Subject: HPCN99-Early-Registration-Deadline
To: reliable_computing [at] interval [dot] usl.edu
Reply-to: William Walster
Message-id: <0F7D00CFQIBANM@ha-sims.eng.sun.com>
MIME-version: 1.0
X-Mailer: dtmail 1.2.1 CDE Version 1.2.1 SunOS 5.6 sun4m sparc
Content-type: TEXT/plain; charset=us-ascii
Content-MD5: AY+r4qkwkh8SFXnJNFeXwQ==
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk
***********************************************************************
* *
* HPCN Europe 99 *
* *
* RAI Conference Center Amsterdam, April 12-14, 1999 *
* *
************************************************************************
Early registration deadline FEBRUARY 28 !
REGISTER NOW! http://www.wins.uva.nl/events/HPCN99/registration.html
The Organisation of the HPCN Europe '99 event is proud to announce the
HPCN Europe '99 Program.
For the detailed program see: http://www.wins.uva.nl/events/HPCN99/
HPCN Europe '99 covers a multi-workshop and conference event:
- HPCN Conference:
- Industrial and General Applications
- Computational Science
- Computer Science
- Workshops:
- Virtual Reality
- Distributed and MetaComputing
- Java in HPC
- EuroTools Workshop on Performance Prediction and Measurement
- High Performance Numerical Computations with Applications
- High Performance Computing on Very Large Data Sets
- Enabling Technology, Hard- and Software
- High Performance Data Mining for Large Scale Data Sets
- The Hospital of the Future: European Technology Transfer
- Applications in Finance
- 1355 Interconnect and Routing
- Traffic Simulation
- International mini Conference on Telemedical Information Society IEEE
EMBS ITIS-ITAB '99
HPCN Europe 99 has six (!) parallel tracks.
- 4 tracks with 13 (!) thematic workshops presenting (invited) papers
- 2 conference tracks presenting 84 selected papers as well as
- 2 poster sessions, presenting a total of 54 selected papers.
Finally, HPCN Europe '99 presents three renowned keynote speakers:
- R. Gruber from EPFL, Switzerland
'Parallel Computer Architectures for Commodity Computing'
- C. Kesselman from the California Institute of Technology, USA
'Life on the Grid: Adventures in High Performance Distributed
Computing Using the Globus Computational Grid Toolkit'
- P. Adriaans from Syllogic BV, The Netherlands
'Fuzzy Logic'
Come and join us at HPCN Europe 99 !
All information can be found on:
*******************************************
* *
* http://www.wins.uva.nl/events/HPCN99/ *
* *
*******************************************
From owner-reliable_computing [at] interval [dot] usl.edu Sat Feb 20 16:02:57 1999
Received: by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id QAA27733
for reliable_computing-outgoing; Sat, 20 Feb 1999 16:02:57 -0600 (CST)
Received: from kleene.math.wisc.edu (kleene.math.wisc.edu [144.92.166.90])
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id QAA27728
for ; Sat, 20 Feb 1999 16:02:53 -0600 (CST)
Received: from riemann.math.wisc.edu (riemann.math.wisc.edu [144.92.166.103])
by kleene.math.wisc.edu (8.9.1a/8.9.1) with ESMTP id PAA02872
for ; Sat, 20 Feb 1999 15:57:54 -0600 (CST)
From: Lou Rall
Received: (from rall@localhost)
by riemann.math.wisc.edu (8.8.8/8.8.8) id QAA16592
for reliable_computing [at] interval [dot] usl.edu; Sat, 20 Feb 1999 16:01:25 -0600 (CST)
Date: Sat, 20 Feb 1999 16:01:25 -0600 (CST)
Message-Id: <199902202201.QAA16592 [at] riemann [dot] math.wisc.edu>
To: reliable_computing [at] interval [dot] usl.edu
Subject: Freiburger Intervall-Berichte
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk
I have duplicate copies of complete volumes and individual
numbers of the Freiburger Intervall-Berichte, other
intervalabilia, and books on Pascal-SC and Pascal-XSC that
I would like to dispose of at reasonable prices. If you're
interested, contact me and I'll send you a list of what's
available and prices.
rall [at] math [dot] wisc.edu (Louis Rall)
From owner-reliable_computing [at] interval [dot] usl.edu Wed Feb 24 16:15:38 1999
Received: (from daemon@localhost)
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id QAA01388
for reliable_computing-outgoing; Wed, 24 Feb 1999 16:15:38 -0600 (CST)
Received: from london.eiffel.com (outback.eiffel.com [198.68.147.2])
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id QAA01383
for ; Wed, 24 Feb 1999 16:15:31 -0600 (CST)
Received: from dublin.eiffel.com (dublin.eiffel.com [89.9.200.6])
by london.eiffel.com (8.8.8/8.8.8) with SMTP id OAB20891
for ; Wed, 24 Feb 1999 14:08:53 -0800 (PST)
Received: from lannion.eiffel.com by dublin.eiffel.com (4.1/SMI-4.1)
id AA26830; Wed, 24 Feb 99 14:14:39 PST
Received: by lannion.eiffel.com (SMI-8.6/SMI-SVR4)
id OAA25987; Wed, 24 Feb 1999 14:14:13 -0800
Date: Wed, 24 Feb 1999 14:14:13 -0800
Message-Id: <199902242214.OAA25987 [at] lannion [dot] eiffel.com>
From: "Karen Ouellette"
To: reliable_computing [at] interval [dot] usl.edu
Subject: TOOLS USA '99 - Last Call for Submissions
Reply-To: karen [at] tools [dot] com
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk
[apologies if you receive multiple copies of this announcement]
**************************************************************
LAST CALL FOR SUBMISSIONS
TOOLS USA '99
Technology of Object-Oriented Languages and Systems
"DELIVERING QUALITY SOFTWARE"
Santa Barbara, Calif., August 1-5, 1999
Fess Parker's Double Tree Resort
http://www.tools.com/usa
**************************************************************
Program Chair: Donald Firesmith, Storage Technology Corp., USA
Tutorial Chair: Richard Riehle, AdaWorks, USA
Workshop & Panel Chair: Gilda Pour, San Jose State University, USA
Conference Chair: Bertrand Meyer, ISE, USA
PROGRAM COMMITTEE
Nadia Adhami, Countrywide, USA
Vasu Alagar, Concordia University, Canada
Jan Bosch, University of Karlskrona/Ronneby, Sweden
Benjamin Brosgol, Aonix, USA
Alistair Cockburn, Humans and Technology, USA
Derek Coleman, Hewlett-Packard, USA
Raimund K. Ege, Florida International University, USA
Martin Griss, Hewlett-Packard Laboratories, USA
Brian Henderson-Sellers, University of Sydney, Australia
Laura Hill, Sun Microsystems, USA
Eric Jul, University of Copenhagen, Denmark
Stuart Kent, University of Brighton, UK
Reto Kramer, Cambridge Technology Partners, Switzerland
Qiaoyun Li, Sony Electronics Inc., USA
Robert Marcus, General Motors, USA
John McGregor, Software Architects, USA
James C. McKim, Rensselaer at Hartford, USA
Christine Mingins, Monash University, Australia
Michael Philippsen, University of Karlsruhe, Germany
Reinhold Ploesch, Johannes Kepler University, Austria
Bran Selic, ObjecTime Limited, Canada
Frank Tip, IBM T.J. Watson Research Center, USA
Jeffrey Voas, RST Corporation, USA
TECHNICAL PAPERS
===================
TOOLS USA '99 is now soliciting papers on all aspects of object-oriented
technology. All submitted papers will be refereed and judged by
the International Program Committee, not only according to standards of
technical quality but also on their usefulness to practitioners and applied
researchers. TOOLS USA '99 will feature a special emphasis on issues
relating to the challenges of ensuring the quality of delivered
applications. Technical papers that report and assess advances and
experiences in this area are expressly sought.
A non-exhaustive list of topics includes:
- Ensuring the quality of delivered applications throughout the life cycle
- OO verification and testing techniques
- Specification and modeling methods and techniques
- Components, frameworks, and reuse
- Distributed and intelligent objects and agents
- Standardization of languages and methods
- Management, migration, and training issues
- Experience reports with OO technology
In the first phase, an abstract of the paper must be submitted by electronic
mail to tools-usa-abstracts [at] tools [dot] com no later than February 26, 1999.
Subsequently, the full paper, in the range of 10 to 20 double-spaced
pages (10,000 to 20,000 words), should be submitted electronically
to tools-usa-submissions [at] tools [dot] com or in hard copy, to arrive no
later than March 5, 1999.
The proceedings of the 30th TOOLS Conference will be published by IEEE
Computer Society Press. Final camera-ready versions of accepted papers will
therefore be required to adhere to the IEEE publication format (guidelines
available soon), and will contain no more than 10 pages.
IMPORTANT DATES:
Electronic abstract submission: February 26, 1999
Manuscript (electronic or hard-copy) submission: March 5, 1999
Notification of acceptance: April 12, 1999
Camera-ready papers due at IEEE: May 7, 1999
PROPOSALS SHOULD BE SUBMITTED TO:
Donald Firesmith
TOOLS USA '99 Program Chair
Storage Technology Corporation
2270 South 88th Street
Louisville, Colorado 80028-5210 USA
Phone: +1-303-661-5943
Donald_Firesmith [at] stortek [dot] com (for contact only, see above for
electronic submission addresses)
TUTORIALS
===========
TOOLS USA '99 now is soliciting proposals for high quality tutorials. Topics
of high potential interest in the OO field, and not yet covered in other
conferences, are particularly sought for presentation at TOOL USA '99.
Tutorials should be innovative, with a strong practical content, or based on
significant industrial developments, and be of interest to a significant
part of the software community. Tutorials are normally one half-day (three
and a half hours including one break).
Tutorial presenters are entitled to submit an article of a related topic (up
to 10 pages), for inclusion in the TOOLS 30 Conference Proceedings,
published by the IEEE Computer Society (upon Chair's approval). Please note
that you must prepare tutorial notes for the participants.
IMPORTANT DATES:
Tutorial submission deadline: February 26, 1999
Notification of acceptance: March 22, 1999
Camera-ready article: May 7, 1999
Camera-ready notes: June 25, 1999
PROPOSALS SHOULD BE SUBMITTED TO:
Richard Riehle
TOOLS USA '99 Tutorial Chair
AdaWorks, USA
tools-usa-tutorials [at] tools [dot] com
WORKSHOPS
============
The purpose of a workshop is to provide a forum for researchers and
practitioners to meet and discuss focused issues that defy the object
technology field today, in an atmosphere that encourages interaction,
brainstorming, exchange of ideas, and problem solving. A workshop should
have a well-defined theme, and a clearly defined target audience. All
topics related to object technology are potential candidates for workshops.
Workshops addressing the theme of "Quality Software" will be given special
consideration. Workshops can be half-day (3 hours) or full-day (6 hours) in
length. Position papers will be included (upon Chair's approval) in the
IEEE-published TOOLS Conference Proceedings.
IMPORTANT DATES:
Workshop submission deadline: February 26, 1999
Notification of acceptance: March 22, 1999
Camera-ready papers due at IEEE: May 7, 1999
PROPOSALS SHOULD BE SUBMITTED TO:
Gilda Pour
TOOLS USA '99 Workshop & Panel Chair
San Jose State University, USA
gpour [at] email [dot] sjsu.edu
PANELS
========
The objective of a panel is to stimulate discussion about ideas and issues
of importance and interest to the object technology community today. A panel
session will usually last 90 minutes and can be organized in various
formats. It should involve 4-5 panelists, presenting before the TOOLS
audience, their various viewpoints on a certain issue, followed by a
question and answer period. Position papers will be included (upon Chair's
approval) in the IEEE-published TOOLS Conference Proceedings.
IMPORTANT DATES:
Panel submission deadline: March 5, 1999
Notification of acceptance: March 19, 1999
Camera-ready papers due at IEEE: May 7, 1999
PROPOSALS SHOULD BE SUBMITTED TO:
Gilda Pour
TOOLS USA '99 Workshop & Panel Chair
San Jose State University, USA
gpour [at] email [dot] sjsu.edu
** See the complete online submission guidelines at:
http://www.tools.com/usa/submissions.html **
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
FOR MORE INFORMATION ON TOOLS USA '99 OR ANY OTHER
EVENTS IN THE TOOLS CONFERENCE SERIES,
VISIT OUR WEB SITE AT http://www.tools.com
OR CONTACT US AT tools [at] tools [dot] com
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
From owner-reliable_computing [at] interval [dot] usl.edu Thu Feb 25 18:15:33 1999
Received: by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id SAA02654
for reliable_computing-outgoing; Thu, 25 Feb 1999 18:15:33 -0600 (CST)
Received: from cdam.me.washington.edu (cdam.me.washington.edu [128.95.34.158])
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id SAA02649
for ; Thu, 25 Feb 1999 18:15:28 -0600 (CST)
Received: from localhost (chang@localhost)
by cdam.me.washington.edu (8.8.7/8.8.7) with ESMTP id RAA17631
for ; Thu, 25 Feb 1999 17:17:16 -0800
X-Authentication-Warning: cdam.me.washington.edu: chang owned process doing -bs
Date: Thu, 25 Feb 1999 17:17:16 -0800 (PST)
From: Jack Chang
X-Sender: chang [at] cdam [dot] me.washington.edu
To: "'reliable_computing'"
Subject: general interval arithmetic reports by Kahan and Hanson
Message-ID:
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk
Hi,
I should be very grateful if somebody can give me a copy of two reports
about general interval arithmetic. One is by Kahan: "A more complete
interval arithmetic, lecture notes for a summer course at U of Michigan
(1968)". The other one is by Hanson: "Interval arithmetic as a closed
arithmetic system on a computer, Jet propulsion Laboratory report 197".
I have tried to locate these two reports from JPL, U of Toronto, and U of
Michigan but with no luck. I am very willing to pay for all the trouble
you might have for giving me a copy of these two reports.
Thank you very much for your help,
Jack Chang
MEB 117-1, ME Dept, U of Washington
Seattle, WA 98195
(206)543-2657
From owner-reliable_computing [at] interval [dot] usl.edu Thu Feb 25 23:47:25 1999
Received: (from daemon@localhost)
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id XAA03097
for reliable_computing-outgoing; Thu, 25 Feb 1999 23:47:25 -0600 (CST)
Received: from mercury.Sun.COM (mercury.Sun.COM [192.9.25.1])
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with SMTP id XAA03092
for ; Thu, 25 Feb 1999 23:47:23 -0600 (CST)
From: bill.walster [at] Eng [dot] Sun.COM
Received: from Eng.Sun.COM (engmail2 [129.146.1.25]) by mercury.Sun.COM (SMI-8.6/mail.byaddr) with SMTP id VAA06436; Thu, 25 Feb 1999 21:46:48 -0800
Received: from ha-sims.eng.sun.com (phys-thestorka.Eng.Sun.COM [129.146.1.231])
by Eng.Sun.COM (8.8.8+Sun/SMI-5.3) with ESMTP id VAA07553;
Thu, 25 Feb 1999 21:46:45 -0800 (PST)
Received: from ha-sims.eng.sun.com (westapp.EBay.Sun.COM)
by ha-sims.eng.sun.com (Sun Internet Mail Server sims.3.5.1998.09.21.23.34)
with ESMTP id <0F7Q00C3OYNRNG@ha-sims.eng.sun.com>; Thu,
25 Feb 1999 21:45:40 -0800 (PST)
Date: Thu, 25 Feb 1999 22:00:22 -0800
Subject: Re: general interval arithmetic reports by Kahan and Hanson
To: Jack Chang ,
"'reliable_computing'"
Reply-to: bill.walster [at] Eng [dot] Sun.COM
Message-id: <0F7Q00C3PYNVNG@ha-sims.eng.sun.com>
MIME-version: 1.0
X-Mailer: Sun NetMail 2.2.5
Content-type: text/plain; charset="US-ASCII"
Content-transfer-encoding: 7bit
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk
Jack,
I have them both. Send me your fax numbe and I will fax them to you
on next Monday. I will be out of the office till then.
Regards,
Bill
"Jack Chang" wrote:
Date: Thu, 25 Feb 1999 17:17:16 -0800 (PST)
Hi,
I should be very grateful if somebody can give me a copy of two reports
about general interval arithmetic. One is by Kahan: "A more complete
interval arithmetic, lecture notes for a summer course at U of Michigan
(1968)". The other one is by Hanson: "Interval arithmetic as a closed
arithmetic system on a computer, Jet propulsion Laboratory report 197".
I have tried to locate these two reports from JPL, U of Toronto, and U of
Michigan but with no luck. I am very willing to pay for all the trouble
you might have for giving me a copy of these two reports.
Thank you very much for your help,
Jack Chang
MEB 117-1, ME Dept, U of Washington
Seattle, WA 98195
(206)543-2657
From owner-reliable_computing [at] interval [dot] usl.edu Fri Feb 26 23:19:29 1999
Received: by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) id XAA04308
for reliable_computing-outgoing; Fri, 26 Feb 1999 23:19:29 -0600 (CST)
Received: from tempest.ocis.temple.edu (root [at] tempest [dot] ocis.temple.edu [155.247.166.120])
by interval.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.2) with ESMTP id XAA04303
for ; Fri, 26 Feb 1999 23:19:27 -0600 (CST)
Received: from unix.temple.edu (091064-2.dorm.temple.edu [155.247.154.52])
by tempest.ocis.temple.edu (8.8.8/8.8.8) with ESMTP id AAA21313;
Sat, 27 Feb 1999 00:19:19 -0500 (EST)
Message-ID: <36D77FD7.2E3362EE [at] unix [dot] temple.edu>
Date: Sat, 27 Feb 1999 00:17:11 -0500
From: "Angel L. Pereira"
Organization: Temple University
X-Mailer: Mozilla 4.06 [en] (Win98; I)
MIME-Version: 1.0
To: reliable_computing [at] interval [dot] usl.edu,
Angel Pereira
Subject: Javascript codes
Content-Type: multipart/mixed; boundary="------------21AFCD04667189B0161E68F2"
Sender: owner-reliable_computing [at] interval [dot] usl.edu
Precedence: bulk
This is a multi-part message in MIME format.
--------------21AFCD04667189B0161E68F2
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Hi,
I'm trying to create a javascript interval calculator abd I'm having
problem comming with a Sin,Tan,Cos code that works with an input form.
Can any body help me find or give me any ideas of how I can create or
find a good code for this purpose. The main problem is that it won't let
me use the functions more than once at the same time. Thank you.
Angel L. Pereira
apereira [at] unix [dot] temple.edu
--------------21AFCD04667189B0161E68F2
Content-Type: text/x-vcard; charset=us-ascii; name="vcard.vcf"
Content-Transfer-Encoding: 7bit
Content-Description: Card for Angel Pereira
Content-Disposition: attachment; filename="vcard.vcf"
begin: vcard
fn: Angel Pereira
n: Pereira;Angel
org: Temple University
adr: 2029 N. broad St.;;1064 Hardwick Hall;Philadelphia;Pa;19122;US
email;internet: apereira [at] unix [dot] temple.edu
title: Student
tel;home: (215) 204.4822
x-mozilla-cpt: ;0
x-mozilla-html: FALSE
version: 2.1
end: vcard
--------------21AFCD04667189B0161E68F2--