Nelson H. F. Beebe | 10 Feb 02:37
Picon
Favicon

[Reliable Computing] New papers and books on interval arithmetic

This new paper should be of interest to list readers:

@String{j-SIAM-J-MAT-ANA-APPL   = "SIAM Journal on Matrix Analysis and
                                  Applications"}
@Article{Rump:2012:VBL,
  author =       "Siegfried M. Rump",
  title =        "Verified Bounds for Least Squares Problems and
                 Underdetermined Linear Systems",
  journal =      j-SIAM-J-MAT-ANA-APPL,
  volume =       "33",
  number =       "1",
  pages =        "130--148",
  month =        "????",
  year =         "2012",
  CODEN =        "SJMAEL",
  DOI =          "http://dx.doi.org/10.1137/110840248",
  ISSN =         "0895-4798 (print), 1095-7162 (electronic)",
  ISSN-L =       "0895-4798",
  bibdate =      "Thu Feb 9 08:15:52 MST 2012",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toc/SIMAX/33/1;
                 http://www.math.utah.edu/pub/tex/bib/siamjmatanaappl.bib",
  URL =         "http://epubs.siam.org/simax/resource/1/sjmael/v33/i1/p130_s1",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Matrix Analysis and Applications",
  keywords =     "interval arithmetic",
  onlinedate =   "January 13, 2012",
}

In shorter form, here are pointers to some other recent (2011--date)
books and papers that I've recorded:
(Continue reading)

Kreinovich, Vladik | 9 Feb 17:01
Favicon

[Reliable Computing] FW: CDC'2012 invited session about "Robust estimation of uncertain systems"

FYI

-----Original Message-----
From: Tarek RAISSI [mailto:tarek.raissi@...] 

We are organizing an invited session about "Robust estimation of uncertain systems" in the 51th IEEE
Conference on Decision and Control (December 10-13, 2012, Grand Wailea, Maui, Hawaii).

Could you please forward the message belowon  the mailing list  of  "reliable  computing".

Best regards,

Tarek RAISSI

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

Dear Colleague,

We are organizing an invited session about "Robust estimation of uncertain systems" in the 51th IEEE
Conference on Decision and Control (December 10-13, 2012, Grand Wailea, Maui, Hawaii):

http://control.disp.uniroma2.it/cdc2012/index.php

This invited session addresses robust state and parameter estimation mainly with set-membsership techniques.
The attached file contains more information about this session.

If you are interested in participating in this invited session, please send a title of your paper before 1st
March 2012 to the organisers:

tarek.raissi@...,   or    denis.efimov@...
(Continue reading)

Picon
Favicon
Gravatar

[Reliable Computing] missing SCAN

Sergey, dear friends and colleagues
   You all noticed the invitation to the 15th SCAN meeting , and will 
hopefully come.
Just for fun, I tried to remember where the other meetings took place. I 
only found 13 predesessors,
then I counted your list on the webpage SCAN-XX indeed there are 13 entries!
  Why that?
Is there an overestimation in integer arithmethic 13+1=15?
That made me curious.
  The oldest announcement as "n^th Scan meeting was from the year 2000 
in Karlruhe with n=9. Counting from 9 you arrive perfectly at 15 in 
Novosibirsk. Hence the first 7 conferences pretend to be 8.!
  Ithink I found the solution: The SCAN meetings were preceded by some 
smaller meetings in Karlruhe,
that was mentioned in the first announcements, until in Vienna it found 
its way into the list of predesessors. Somebody tossed it out there, but 
forgot to adjust the number or didn't dare to change it.
So do I. My consequence out of this episode will be to organize the 16th 
SCAN 2014 in Würzburg and insert Karlsruhe before  the first.
take it easy
Jürgen

--

-- 
-                Prof. Dr. Juergen Wolff von Gudenberg
      o           Lehrstuhl fuer Informatik II
     / \          Universitaet Wuerzburg, Am Hubland, D-97074 Wuerzburg
InfoII o         Tel.: +49 931 / 31 86602 Fax ../31 86603
   / \  Uni       E-Mail:wolff@...
  o   o Wuerzburg

(Continue reading)

Kreinovich, Vladik | 9 Feb 05:00
Favicon

[Reliable Computing] FW: New URL for Computing Reviews: ComputingReviews.com

FYI

 

From: Annette Cords [mailto:service-j9mISXBebvpQGwSQIjy88FaTQe2KTcn/@public.gmane.org]

Computing Reviews is moving to a new URL:
ComputingReviews.com

This new URL is effective immediately, and will be the main URL for Computing Reviews after April 1, 2012.

Please update your bookmarks and links now.
For the Reader's area: www.ComputingReviews.com

Best regards,
Annette Cords

Marketing & Communications
Computing Reviews
service-j9mISXBebvpQGwSQIjy88FaTQe2KTcn/@public.gmane.org

 

Kreinovich, Vladik | 8 Feb 21:03
Favicon

[Reliable Computing] new ACM Fellows

The latest (February 2012) issue of Communications of the ACM, the main computer science professional
organization, has a list of new ACM Fellows. Some of the folks on this list are familiar to many of us in the
interval computations community. 

This list includes Christian S. Jensen, a specialist in, among other things, interval-valued temporal
reasoning and interval-valued temporal databases. 

It also included Linda Petzold, a specialist in numerical mathematics, especially on differential and
algebra-differential equations. Many of us may remember her invited talk at the 2002 SIAM Workshop on
Validated Computing 2002 in Toronto, Canada. 

Congratulations to the new Fellows! 

Favicon

klaus.havelund@...>]

Approved: iou14it
Received: from lists.nasa.gov (lists.nasa.gov [128.156.249.229])
	by interval.louisiana.edu (8.14.1/8.14.1/ull-interval-math-server-1.6) with ESMTP id q15JZoq3008182;
	Sun, 5 Feb 2012 13:35:55 -0600 (CST)
Received: from localhost (localhost [127.0.0.1])
	by lists.nasa.gov (Postfix) with ESMTP id 8EE26602BF7;
	Sun,  5 Feb 2012 14:35:48 -0500 (EST)
Received: from lists.nasa.gov ([127.0.0.1])
	by localhost (lists.nasa.gov [127.0.0.1]) (amavisd-new, port 10024)
	with ESMTP id IW9l5dUtDfmM; Sun,  5 Feb 2012 14:35:48 -0500 (EST)
Received: from lists.nasa.gov (localhost [127.0.0.1])
	by lists.nasa.gov (Postfix) with ESMTP id 1F2A2600D7D;
	Sun,  5 Feb 2012 14:35:48 -0500 (EST)
X-Original-To: fm-announcements@...
Delivered-To: fm-announcements@...
Received: from localhost (localhost [127.0.0.1])
	by lists.nasa.gov (Postfix) with ESMTP id 5C41A6011AF
	for <fm-announcements@...>;
	Sun,  5 Feb 2012 14:35:46 -0500 (EST)
Received: from lists.nasa.gov ([127.0.0.1])
	by localhost (lists.nasa.gov [127.0.0.1]) (amavisd-new, port 10024)
	with ESMTP id jcvt-SOVBhwi for <fm-announcements@...>;
	Sun,  5 Feb 2012 14:35:46 -0500 (EST)
Received: from mail.jpl.nasa.gov (sentrion2.jpl.nasa.gov [128.149.139.106])
	by lists.nasa.gov (Postfix) with ESMTP id F2B39600D7D
	for <fm-announcements@...>;
	Sun,  5 Feb 2012 14:35:45 -0500 (EST)
Received: from [192.168.0.7] (cpe-76-170-88-117.socal.res.rr.com
	[76.170.88.117]) (authenticated (0 bits))
	by smtp.jpl.nasa.gov (Switch-3.4.3/Switch-3.4.3) with ESMTP id
	q15JZgHb008047
	(using TLSv1/SSLv3 with cipher AES128-SHA (128 bits) verified NO)
	for <fm-announcements@...>; Sun, 5 Feb 2012 11:35:43 -0800
From: Klaus Havelund <klaus.havelund@...>
Content-Type: multipart/alternative; boundary=Apple-Mail-21-123506423
Date: Sun, 5 Feb 2012 11:35:40 -0800
Message-Id: <60617E4B-25C3-4665-A21B-2121ECF810BB@...>
To: fm-announcements@...
Mime-Version: 1.0 (Apple Message framework v1084)
X-Mailer: Apple Mail (2.1084)
X-Source-IP: cpe-76-170-88-117.socal.res.rr.com [76.170.88.117]
X-Source-Sender: klaus.havelund@...
X-Spamclassfication-Commtouch: not spam
X-SpamRefId: str=0001.0A090206.4F2EDA10.002E,ss=1,fgs=0
Subject: [fm-announcements] RV 2012 - 1st Call For Papers
X-BeenThere: fm-announcements@...
X-Mailman-Version: 2.1.14
Precedence: list
List-Id: NASA Formal Methods Announcements <fm-announcements.lists.nasa.gov>
List-Unsubscribe: <https://lists.nasa.gov/mailman/options/fm-announcements>,
	<mailto:fm-announcements-request@...?subject=unsubscribe>
List-Post: <mailto:fm-announcements@...>
List-Help: <mailto:fm-announcements-request@...?subject=help>
List-Subscribe: <https://lists.nasa.gov/mailman/listinfo/fm-announcements>,
	<mailto:fm-announcements-request@...?subject=subscribe>
Errors-To: fm-announcements-bounces@...
Sender: fm-announcements-bounces@...

--Apple-Mail-21-123506423
Content-Transfer-Encoding: 7bit
Content-Type: text/plain;
	charset=us-ascii

3rd International Conference on Runtime Verification (RV 2012)
September 25 - 28, 2012
Istanbul, Turkey
at the Koc University Research Center for Anatolian Civilizations in Pera

http://rv2012.ku.edu.tr

SCOPE

Runtime verification is concerned with monitoring and analysis of
software and hardware system executions. Runtime verification
techniques are crucial for system correctness and reliability; they
are significantly more powerful and versatile than conventional
testing, and more practical than exhaustive formal
verification. Runtime verification can be used prior to deployment,
for verification and debugging purposes, and after deployment for
ensuring reliability, safety and security, and for providing fault
containment and recovery. Topics of interest to the conference
include:

- specification languages and formalisms for trace analysis
- specification mining - program instrumentation - monitor construction techniques
- logging, recording, and replay
- fault detection, localization, recovery and repair
- program steering and adaptation
- metrics and statistical information gathering - combination of static and dynamic analyses
- program execution visualization

Application areas of runtime verification include safety-critical
systems ranging from enterprise and systems software, to autonomous
and reactive control systems, to health management and diagnosis
systems, to security.

HISTORY

The RV series of events started in 2001, as an annual workshop. The
RV'01 to RV'05 proceedings were published in ENTCS. Since 2006, the RV
proceedings have been published in LNCS. In year 2010, RV became an
international conference. Links to past RV events can be found at the
permanent URL http://runtime-verification.org.

PAPER SUBMISSION

RV will have three paper categories: regular and short papers, and tool demonstration papers. Papers in
all categories will be reviewed by the conference Program Committee.

- Regular papers (up to 15 pages) should present original unpublished
results. Applications of runtime verification are particularly
welcome. A Best Paper Award will be offered.

- Short papers (up to 5 pages) may present novel but not necessarily
thoroughly worked out ideas, for example emerging runtime verification
techniques and applications, or techniques and applications that
establish relationships between runtime verification and other
domains. Accepted short papers will be presented in special short talk
(5-10 minutes) and poster sessions.

- Tool demonstration papers (up to 5 pages) should briefly introduce
the problem solved by the tool and give the outline of the
demonstration. A Best Tool Award will be offered.

All accepted papers, including short papers and tool papers, will appear in the LNCS proceedings.
Submitted papers must use the LNCS style. At least one author of each accepted paper must attend RV'12 to
present the paper. Papers must be submitted electronically using the EasyChair system. A link to the
electronic submission page will be made available on the
RV'12 web page.

IMPORTANT DATES

June 3, 2012 - Submission deadline
September 25, 2012 - Tutorial Day
September 26-28, 2012 - Conference

ORGANIZERS

General Chair:
Serdar Tasiran (Koc University, Istanbul, Turkey)

Program Chair:
Shaz Qadeer (Microsoft Research, Redmond, WA, USA)

PROGRAMME COMMITTEE

Howard Barringer, Manchester University
Saddek Bensalem, VERIMAG
Eric Bodden, EC SPRIDE
Cristian Cadar, Imperial College
Ylies Falcone, University of Grenoble
Bernd Finkbeiner, Saarland University
Stephen Freund, Williams College
Ganesh Gopalakrishnan, University of Utah
Wolfgang Grieskamp, Google
Sylvain Halle, Universite du Quebec a Chicoutimi
Klaus Havelund, NASA Jet Propulsion Laboratory
Suresh Jagannathan, Purdue University
Sarfraz Khurshid, University of Texas at Austin
Martin Leucker, University of Luebeck
Benjamin Livshits, Microsoft
Shan Lu, University of Wisconsin
Rupak Majumdar, MPI-SWS
Oded Maler, VERIMAG
Sharad Malik, Princeton University
Atif Memon, University of Maryland
Peter Muller, ETH Zurich
Shaz Qadeer, Microsoft
Venkatesh-Prasad Ranganath, Microsoft
Vivek Sarkar, Rice University
Koushik Sen, University of California at Berkeley
Oleg Sokolsky, University of Pennsylvania
Serdar Tasiran, Koc University
Stavros Tripakis, University of California at Berkeley
Martin Vechev, ETH Zurich
Willem Visser, Stellenbosch University
Zheng Zhang, Microsoft

--Apple-Mail-21-123506423
Content-Transfer-Encoding: quoted-printable
Content-Type: text/html;
	charset=us-ascii

<html><head></head><body style=3D"word-wrap: break-word; =
-webkit-nbsp-mode: space; -webkit-line-break: after-white-space; =
"><div><font class=3D"Apple-style-span" face=3D"'Courier =
New'"><br></font></div><div><font class=3D"Apple-style-span" =
face=3D"'Courier New'"><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">3rd International Conference on Runtime =
Verification (RV 2012)</div><div style=3D"margin-top: 0px; margin-right: =
0px; margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">September 25 - 28, 2012</div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; =
">Istanbul, Turkey</div><div style=3D"margin-top: 0px; margin-right: =
0px; margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">at the Koc University Research Center for =
Anatolian Civilizations in Pera</div><div style=3D"margin-top: 0px; =
margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font: normal =
normal normal 13px/normal Courier; min-height: 16px; "><br></div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; "><a =
href=3D"http://rv2012.ku.edu.tr">http://rv2012.ku.edu.tr</a></div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; =
min-height: 16px; "><br></div><div style=3D"margin-top: 0px; =
margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font: normal =
normal normal 13px/normal Courier; min-height: 16px; "><br></div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; =
">SCOPE</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; min-height: 16px; "><br></div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; =
">Runtime verification is concerned with monitoring and analysis =
of</div><div style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: =
0px; margin-left: 0px; font: normal normal normal 13px/normal Courier; =
">software and hardware system executions. Runtime =
verification</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">techniques are crucial for system correctness and =
reliability; they</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">are significantly more powerful and versatile =
than conventional</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">testing, and more practical than exhaustive =
formal</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">verification. Runtime verification can be used =
prior to deployment,</div><div style=3D"margin-top: 0px; margin-right: =
0px; margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">for verification and debugging purposes, and =
after deployment for</div><div style=3D"margin-top: 0px; margin-right: =
0px; margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">ensuring reliability, safety and security, and =
for providing fault</div><div style=3D"margin-top: 0px; margin-right: =
0px; margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">containment and recovery. Topics of interest to =
the conference</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">include:</div><div style=3D"margin-top: 0px; =
margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font: normal =
normal normal 13px/normal Courier; min-height: 16px; "><br></div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; ">- =
specification languages and formalisms for trace analysis</div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; ">- =
specification mining&nbsp;</div><div style=3D"margin-top: 0px; =
margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font: normal =
normal normal 13px/normal Courier; ">- program =
instrumentation&nbsp;</div><div style=3D"margin-top: 0px; margin-right: =
0px; margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">- monitor construction techniques</div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; ">- =
logging, recording, and replay</div><div style=3D"margin-top: 0px; =
margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font: normal =
normal normal 13px/normal Courier; ">- fault detection, localization, =
recovery and repair</div><div style=3D"margin-top: 0px; margin-right: =
0px; margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">- program steering and adaptation</div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; ">- =
metrics and statistical information gathering&nbsp;</div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; ">- =
combination of static and dynamic analyses</div><div style=3D"margin-top: =
0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font: =
normal normal normal 13px/normal Courier; ">- program execution =
visualization</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; min-height: 16px; "><br></div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; =
">Application areas of runtime verification include =
safety-critical</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">systems ranging from enterprise and systems =
software, to autonomous</div><div style=3D"margin-top: 0px; =
margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font: normal =
normal normal 13px/normal Courier; ">and reactive control systems, to =
health management and diagnosis</div><div style=3D"margin-top: 0px; =
margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font: normal =
normal normal 13px/normal Courier; ">systems, to security.</div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; =
min-height: 16px; "><br></div><div style=3D"margin-top: 0px; =
margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font: normal =
normal normal 13px/normal Courier; min-height: 16px; "><br></div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; =
">HISTORY</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; min-height: 16px; "><br></div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; ">The =
RV series of events started in 2001, as an annual workshop. =
The</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">RV'01 to RV'05 proceedings were published in =
ENTCS. Since 2006, the RV</div><div style=3D"margin-top: 0px; =
margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font: normal =
normal normal 13px/normal Courier; ">proceedings have been published in =
LNCS. In year 2010, RV became an</div><div style=3D"margin-top: 0px; =
margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font: normal =
normal normal 13px/normal Courier; ">international conference. Links to =
past RV events can be found at the</div><div style=3D"margin-top: 0px; =
margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font: normal =
normal normal 13px/normal Courier; ">permanent URL <a =
href=3D"http://runtime-verification.org">http://runtime-verification.org</=
a>.</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; min-height: 16px; "><br></div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; =
min-height: 16px; "><br></div><div style=3D"margin-top: 0px; =
margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font: normal =
normal normal 13px/normal Courier; ">PAPER SUBMISSION</div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; =
min-height: 16px; "><br></div><div style=3D"margin-top: 0px; =
margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font: normal =
normal normal 13px/normal Courier; ">RV will have three paper =
categories: regular and short papers, and tool&nbsp;</div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; =
">demonstration papers. Papers in all categories will be reviewed by =
the&nbsp;</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">conference Program Committee.</div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; =
min-height: 16px; "><br></div><div style=3D"margin-top: 0px; =
margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font: normal =
normal normal 13px/normal Courier; ">- Regular papers (up to 15 pages) =
should present original unpublished</div><div style=3D"margin-top: 0px; =
margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font: normal =
normal normal 13px/normal Courier; ">results. Applications of runtime =
verification are particularly</div><div style=3D"margin-top: 0px; =
margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font: normal =
normal normal 13px/normal Courier; ">welcome. A Best Paper Award will be =
offered.</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; min-height: 16px; "><br></div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; ">- =
Short papers (up to 5 pages) may present novel but not =
necessarily</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">thoroughly worked out ideas, for example emerging =
runtime verification</div><div style=3D"margin-top: 0px; margin-right: =
0px; margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">techniques and applications, or techniques and =
applications that</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">establish relationships between runtime =
verification and other</div><div style=3D"margin-top: 0px; margin-right: =
0px; margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">domains. Accepted short papers will be presented =
in special short talk</div><div style=3D"margin-top: 0px; margin-right: =
0px; margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">(5-10 minutes) and poster sessions.</div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; =
min-height: 16px; "><br></div><div style=3D"margin-top: 0px; =
margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font: normal =
normal normal 13px/normal Courier; ">- Tool demonstration papers (up to =
5 pages) should briefly introduce</div><div style=3D"margin-top: 0px; =
margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font: normal =
normal normal 13px/normal Courier; ">the problem solved by the tool and =
give the outline of the</div><div style=3D"margin-top: 0px; =
margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font: normal =
normal normal 13px/normal Courier; ">demonstration. A Best Tool Award =
will be offered.</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; min-height: 16px; "><br></div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; ">All =
accepted papers, including short papers and tool papers, will =
appear&nbsp;</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">in the LNCS proceedings. Submitted papers must =
use the LNCS style. At&nbsp;</div><div style=3D"margin-top: 0px; =
margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font: normal =
normal normal 13px/normal Courier; ">least one author of each accepted =
paper must attend RV'12 to present the&nbsp;</div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; =
">paper. Papers must be submitted electronically using the EasyChair =
system.&nbsp;</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">A link to the electronic submission page will be =
made available on the</div><div style=3D"margin-top: 0px; margin-right: =
0px; margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">RV'12 web page.</div><div style=3D"margin-top: =
0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font: =
normal normal normal 13px/normal Courier; min-height: 16px; =
"><br></div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; min-height: 16px; "><br></div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; =
">IMPORTANT DATES</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; min-height: 16px; "><br></div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; ">June =
3, 2012 - Submission deadline</div><div style=3D"margin-top: 0px; =
margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font: normal =
normal normal 13px/normal Courier; ">September 25, 2012 - Tutorial =
Day</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">September 26-28, 2012 - Conference</div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; =
min-height: 16px; "><br></div><div style=3D"margin-top: 0px; =
margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font: normal =
normal normal 13px/normal Courier; min-height: 16px; "><br></div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; =
">ORGANIZERS</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; min-height: 16px; "><br></div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; =
">General Chair:</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">Serdar Tasiran (Koc University, Istanbul, =
Turkey)</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; min-height: 16px; "><br></div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; =
">Program Chair:</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">Shaz Qadeer (Microsoft Research, Redmond, WA, =
USA)</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; min-height: 16px; "><br></div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; =
min-height: 16px; "><br></div><div style=3D"margin-top: 0px; =
margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font: normal =
normal normal 13px/normal Courier; ">PROGRAMME COMMITTEE</div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; =
min-height: 16px; "><br></div><div style=3D"margin-top: 0px; =
margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font: normal =
normal normal 13px/normal Courier; ">Howard Barringer, Manchester =
University</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">Saddek Bensalem, VERIMAG</div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; ">Eric =
Bodden, EC SPRIDE</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">Cristian Cadar, Imperial College</div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; =
">Ylies Falcone, University of Grenoble</div><div style=3D"margin-top: =
0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font: =
normal normal normal 13px/normal Courier; ">Bernd Finkbeiner, Saarland =
University</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">Stephen Freund, Williams College</div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; =
">Ganesh Gopalakrishnan, University of Utah</div><div style=3D"margin-top:=
 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font: =
normal normal normal 13px/normal Courier; ">Wolfgang Grieskamp, =
Google</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">Sylvain Halle, Universite du Quebec a =
Chicoutimi</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">Klaus Havelund, NASA Jet Propulsion =
Laboratory</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">Suresh Jagannathan, Purdue University</div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; =
">Sarfraz Khurshid, University of Texas at Austin</div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; =
">Martin Leucker, University of Luebeck</div><div style=3D"margin-top: =
0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font: =
normal normal normal 13px/normal Courier; ">Benjamin Livshits, =
Microsoft</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">Shan Lu, University of Wisconsin</div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; =
">Rupak Majumdar, MPI-SWS</div><div style=3D"margin-top: 0px; =
margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font: normal =
normal normal 13px/normal Courier; ">Oded Maler, VERIMAG</div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; =
">Sharad Malik, Princeton University</div><div style=3D"margin-top: 0px; =
margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font: normal =
normal normal 13px/normal Courier; ">Atif Memon, University of =
Maryland</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">Peter Muller, ETH Zurich</div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; ">Shaz =
Qadeer, Microsoft</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">Venkatesh-Prasad Ranganath, Microsoft</div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; =
">Vivek Sarkar, Rice University</div><div style=3D"margin-top: 0px; =
margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font: normal =
normal normal 13px/normal Courier; ">Koushik Sen, University of =
California at Berkeley</div><div style=3D"margin-top: 0px; margin-right: =
0px; margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">Oleg Sokolsky, University of =
Pennsylvania</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">Serdar Tasiran, Koc University</div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; =
">Stavros Tripakis, University of California at Berkeley</div><div =
style=3D"margin-top: 0px; margin-right: 0px; margin-bottom: 0px; =
margin-left: 0px; font: normal normal normal 13px/normal Courier; =
">Martin Vechev, ETH Zurich</div><div style=3D"margin-top: 0px; =
margin-right: 0px; margin-bottom: 0px; margin-left: 0px; font: normal =
normal normal 13px/normal Courier; ">Willem Visser, Stellenbosch =
University</div><div style=3D"margin-top: 0px; margin-right: 0px; =
margin-bottom: 0px; margin-left: 0px; font: normal normal normal =
13px/normal Courier; ">Zheng Zhang, =
Microsoft</div><div><br></div></font></div></body></html>=

--Apple-Mail-21-123506423--

Kreinovich, Vladik | 3 Feb 23:30
Favicon

[Reliable Computing] FW: PARA 2012: Call for Papers extension and other updates

FYI, please note that there is an interval session organized by Dr. Kubica

-----Original Message-----
From: para-l@...
[mailto:para-l@...] On Behalf Of Pekka Manninen
Sent: Friday, January 27, 2012 3:19 AM
To: para-l@...
Subject: PARA 2012: Call for Papers extension and other updates

PARA 2012
Workshop on State-of-the-Art in Scientific and Parallel Computing

June 10-13, 2012
Helsinki, Finland
www.csc.fi/para12  

                       
CALL FOR PAPERS
===============

Scope
-----

The main theme of PARA12 is State of the Art in Scientific and Parallel Computing with a special theme
"Towards Exascale". Interesting topics include (but are not restricted to) algorithms, software,
tools, environments as well as applications for scientific computing, high-performance computing,
grid computing, cloud computing, and interactive visualization.

Important dates and deadlines
-----------------------------

 * Registration opens                             December    8, 2011
 * Deadline for minisymposium proposals           January    31, 2012
 * Deadline for abstracts (max 4 pages)           February   17, 2012
 * Notification of acceptance                     March      15, 2012
 * Early-bird fee ends                            March      30, 2012
 * Registration ends                              May        31, 2012
 * PARA12 Workshop                                June    10-13, 2012
 * Deadline for proceedings papers (10-15 pages)  October    15, 2012

Conference proceedings
----------------------

After the workshop, all contributors (with an approved abstract) are invited to submit a full article
(10-15 pages) to the conference proceedings, published in the Springer-Verlag series Lecture Notes in
Computer Science (LNCS). Submission of an abstract does not bind the author for contributing a full
article. The proceedings will include also a selection of extended abstracts (to provide the overview on
the state-of-the-art in scientific computing) as well as review articles on the minisymposia. The full
articles and the minisymposium review articles will be peer-reviewed. The minisymposium contributors
can also submit a full article to the proceedings, should they so desire.

Contributed talks and posters 
-----------------------------

The contributed talks are presented in nine parallel sessions or in plenary sessions and have duration of
either 30 min or 45 minutes. The oral contributions which are not selected can be converted into poster contributions.

There will be a poster session on Tuesday June 12. Poster contributions require an abstract as well.

The abstracts and the articles are submitted via the Springer Online Conference System. See the
instructions at www.csc.fi/para12 > Call for Papers.

Minisymposia
------------

There will be three parallel minisymposia on defined current topics (on Monday June 11), each with
duration of 5 hours.

The topics of two minisymposia have already been decided:

 * HPC Interval Methods, organized by Bartlomiej Kubica (B.Kubica@...du.pl)
 * CRESTA: Exascale Applications, organized by Jan Åstrom (jan.astrom <at> csc.fi)

Please contact directly these persons if you would like to contribute to either of these.

We still welcome suggestions for the third minisymposium. Person interested in organizing it proposes a
description of the minisymposium by email to para12@... and the program
committee selects the symposia to be realized. The organizer of a minisymposium commits to writing a
review article on the minisymposium, possibly with minisymposium speakers as co-authors. Speakers in
minisymposia are not requested to submit an abstract, but are of course free to do so. The organizer of the
minisymposium selects the contributions.

ABOUT PARA 2012 
===============

Keynotes
--------

We have confirmed two keynotes 

 * Björn Engquist, Coarse-Grained Communication in Scientific Computing
 * Mark Parsons, CRESTA: Collaborative Research into Exascale Systemware, Tools & Applications

More to be announced shortly.

Interactive sessions
--------------------

Two interactive, informal sessions, Special Interest Group (SIG) meetings or Birds-of-a-Feather (BoF)
sessions will be organized on Tuesday June 12 in parallel. Their topics are proposed similarly with the
minisymposia. The SIG/BoF sessions will not contribute to the conference proceedings.

One interactive session topic has been already decided, there will be a BoF session on HPC Education and
Training, organized by Pekka Manninen (pekka.manninen@...). We still
welcome suggestions for another (and possibly third) session.

Tutorials
---------

On Sunday June 10 there will be tutorials on current topics in scientific computing. The tutorial day will
consist of one 6-hour and two 3-hour tutorials (in parallel, see www.csc.fi/para12 > Program). One
tutorial topic has been chosen: there will be a 6-hour tutorial on "Python for High-Performance and
Scientific Computing". We welcome suggestions for other tutorial topics, please send them to para12@...

Program
-------

June 10, 2012:     Tutorials
June 11-13, 2012:  PARA 2012 Workshop sessions 

The program has been updated. See www.csc.fi/para12 > Program for details!

There will be a reception on June 11 and a conference dinner on June 12. 
Social activities for accompanying persons will be offered.

Place
-----

Finlandia Hall, Helsinki.

Principal members of organizing and steering committees 
-------------------------------------------------------

Per Öster, CSC - IT Center for Science, Finland
Pekka Manninen, CSC - IT Center for Science, Finland
Jack Dongarra, University of Tennessee and Oak Ridge National Laboratory, USA
Jerzy Wasniewski, Danmarks Tekniske Universitet, Denmark  

Further information
-------------------

The conference page http://www.csc.fi/para12 will successively
be updated.

Contact information  

Email: para12@...
Tel: +358 50 3819 039 
Fax: +358 9 4572 302                   

PARA 2012
CSC - IT Center for Science
PO Box 405
FI-02101 Espoo
FINLAND

Kreinovich, Vladik | 3 Feb 20:48
Favicon

[Reliable Computing] Moore prize: extended call for nominations

Dear Friends, 

Please find below the extended call for nominations. 

The reason for this extension is as follows. In the past, we only asked for papers and dissertations,
because in the mathematics community, new results are usually published first in papers and/or
dissertations, and books are usually overviews of results published elsewhere. However, several
colleagues have raised an important issue: that we are interested in applications, not just in pure math,
and in many application areas, new results are often first published in books. We do not want to limit the
scope of applications, so we decided to add books to the list of things that can be nominated. 

Because of the increased scope, we decided to extend the deadline, so please submit your nominations by
February 29, 2012. 

Many thanks to those who have already submitted several excellent applications; if you have already
submitted, there is no need to re-submit.

Vladik

P.S. My apologies for the inconvenience. 

**********************************************************************************************************************

Dear Friends,

We seek nominations for the 2012 R. E. Moore Prize for Applications
of Interval Analysis.

R. E. MOORE PRIZE: HISTORY. In 2002, the Editorial Board of Reliable
Computing, an International Journal devoted to reliable mathematical
computations based on finite representations and guaranteed
accuracy, decided to set up a biannual Prize for Applications of
Interval Analysis, a prize that would be awarded at a major interval
meeting.

The first R. E. Moore Prize for Applications of Interval Analysis
was awarded in 2002 to Dr. Warwick Tucker, a mathematician from
Cornell University, who proved, using interval techniques, that the
renowned Lorenz equations do in fact possess a strange attractor.
This problem, Smale's 14th conjecture, is of particular note in
large part because the Lorenz model is widely recognized as
signaling the beginning of chaos theory. This prize was awarded at
the SIAM Validated Computing 2002 in Toronto.

The second prize was awarded in 2004 to Professor T. Hales for his
solution of the Kepler conjecture about the densest arrangement of
spheres in space. Dr. Hales solved this long-standing problem by
using interval arithmetic.

The third prize was awarded in 2008 to Dr. Kyoko Makino and 
Dr. Martin Berz for their paper "Suppression of the Wrapping Effect 
by Taylor Model-based Verified Integrators: Long-term Stabilization 
by Preconditioning".

REQUEST FOR NOMINATIONS. The awarding ceremony will be
held at the 15th GAMM-IMACS International Symposium on Scientific
Computing, Computer Arithmetic, and Verified Numerical Computations
SCAN'2012 (Novosibirsk, Russia, September 23-29, 2012). 

Please submit your nominations.

PRIZE COMMITTEE. Similarly to last R. E. Moore prizes, the prize
committee for the 2012 prize consists of the Editorial Board of the
Reliable Computing journal.

WHO IS ELIGIBLE TO BE NOMINATED. Dissertations, papers, and books that
appeared in 2008 and later may be nominated.

WHO CAN NOMINATE: everyone except for the members of the prize
committee.

HOW TO SUBMIT. To nominate a paper or dissertation (including your
own), send either an electronic copy (Postscript, PDF, or portable
LaTeX), or a URL (web address) from where such an electronic copy
can be downloaded, to vladik@...

If such an electronic copy is not available, a complete citation to
a commonly available public journal may be emailed to
vladik@... If that is a problem, a printed copy may be mailed
to:

  Vladik Kreinovich
  Attention: R. E. Moore Prize
  Department of Computer Science
  University of Texas at El Paso
  500 W. University
  El Paso, TX 79968, USA

WHEN TO SUBMIT. Make sure the materials are nominated before February 
29, 2012. (If you need more time to collect the materials, let me
know ASAP).

PRIVACY. Please rest assured that the names of the nominees will be
kept absolutely secret and they will only be accessible to the
members of the prize committee.

Thanks a lot.

Vladik

P.S. CONFLICT OF INTEREST. To avoid potential conflict of interest,
members of the prize committee will not participate in evaluating
their own work or work of their students.

APPPENDIX
The R. E. Moore Prize for Applications of Interval Analysis:
Description and Rationale
(from http://interval.louisiana.edu/Moore_prize.html)

By the late 1950's, with exponentially
increasing use of digital electronic computers for mathematical
computations, interval arithmetic was a concept whose time had come.
With his 1962 dissertation "Interval Arithmetic and Automatic Error
Analysis in Digital Computing," encouraged by George Forsythe, Prof.
Ramon Moore was one of the first to develop the underlying
principles of interval arithmetic in their modern form. Prof. Moore
subsequently dedicated much of his life to furthering the subject.
This includes guidance of seven Ph.D. students, interaction with
other prominent figures in the area such as Eldon Hansen, Louis
Rall, and Bill Walster, and publication of the seminal work
"Interval Analysis" (Prentice Hall, 1966) and its update "Methods
and Applications of Interval Analysis" (SIAM, 1979). In addition,
Prof. Moore published a related book "Computational Functional
Analysis" (Horwood, 1985), and organized the conference with
proceedings Reliability in Computing (Academic Press, 1988). This
latter conference was a major catalyst for renewed interest in the
subject. It is safe to say that these accomplishments of Professor
Moore have made interval analysis what it is today. To continue and
further this tradition, in 2002, we decided to dedicate to Prof.
Moore a biennial prize for the best dissertation or paper in
applications of interval analysis.

Note:  By "applications" we intend primarily applications in
engineering and the sciences that will bring further recognition to
the power of interval computations. However, we do not wish to rule
out significant and widely recognized "pure" applications. The
editorial board of the journal "Reliable Computing"  will judge
this.

Kreinovich, Vladik | 2 Feb 03:45
Favicon

[Reliable Computing] FW: CFP for an international conference on intuitionistic fuzzy sets

Dear Friends, This may be of interest to some of us since so-called intuitionistic fuzzy sets are closely
related to interval-valued ones. 

Kreinovich, Vladik | 31 Jan 17:58
Favicon

[Reliable Computing] FW: interval talks (ideally biomed-related) welcome at a meeting in Bulgaria

FYI, deadline for abstract submission 31 March 2012.

-----Original Message-----
From: Svetoslav Markov [mailto:smarkov@...] 

...

we are organizing a conference on biomathematics
URL:  http://www.biomath.bg/2012
in Sofia in the period: 17 june - 22 june 2012.

On the 22nd of June we are organizing a special session 
on mathematical methods and applications (not necessarily
in biology) honoring Prof Bl. Sendov's 80th anniversary. As you know
Prof Sendov has important contributions to interval
analysis, so any talk related to interval analysis is welcome.
Of course, if there is a hint on bio-medical applications, still better.

 Prof. Svetoslav Markov, DSci, PhD, Assoc. Member,
 Dept.  "Biomathematics",                         phone: +359-2-979-2876
 Inst. of Mathematics and Informatics,       fax: +359-2-971-3649
 Bulgarian Academy of Sciences,              e-mail: smarkov@...
 "Acad. G. Bonchev" st., block 8,       
 BG-1113 Sofia,  BULGARIA                      mobile (gsm): 0885 8715 84
URL: http://www.math.bas.bg/~bio/
URL:  http://www.biomath.bg/

Evgenija D. Popova | 27 Jan 09:52
Picon
Gravatar

[Reliable Computing] Interval session at ACA'12

Interaction Between Computer Algebra and Interval Computations

Special Session at

18th International Conference on Applications of Computer Algebra 
(ACA 2012)

June 25–28, 2012, Sofia, Bulgaria 

http://www.math.bas.bg/ACA2012/

Organizers: W. Kraemer (BU Wuppertal), E. Popova (IMI-BAS, Sofia)

DEADLINE for abstract submission: April 30, 2012

See the conference and the session websites for more details: 
http://www.math.bas.bg/~epopova/ACA2012/


Gmane