BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:Europe/Stockholm
X-LIC-LOCATION:Europe/Stockholm
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20190719T085754Z
LOCATION:HG D 3.2
DTSTART;TZID=Europe/Stockholm:20190614T103000
DTEND;TZID=Europe/Stockholm:20190614T123000
UID:submissions.pasc-conference.org_PASC19_sess112@linklings.com
SUMMARY:MS46 - HPUQ: High Performance Uncertainty Quantification - Portabl
 e Frameworks for General Applications
DESCRIPTION:Minisymposium\nComputer Science and Applied Mathematics, Emerg
 ing Application Domains, Engineering\n\nCalibration of Stochastic Models w
 ith SPUX, a Flexible and Portable Framework with Multilevel Task-Based Par
 allelization\n\nBacci, Šukys\n\nCalibration of models and propagation of u
 ncertainties are ubiquitous problems in computational science. The SPUX so
 ftware package is a recent effort devoted to two main goals. The first one
  is to offer a problem-agnostic solution for stochastic model calibration 
 and uncertainty quantification. The ...\n\n---------------------\nStatisti
 cs for Natural Science in the Age of Supercomputers\n\nDutta\n\nTo explain
  the fascinating phenomena of nature, natural scientists develop complex m
 odels which can simulate these phenomena almost close to reality. But the 
 hard question is how to calibrate these models given the real world observ
 ations. Traditional statistical methods are handicapped in this setu...\n\
 n---------------------\ntorc_py: Supporting Task-Based Parallelism in Pyth
 on\n\nChatzidoukas\n\nTask-based parallelism has been established as one o
 f the main forms of code parallelization, where asynchronous tasks are lau
 nched and distributed across the processing units of a local machine, a cl
 uster or a supercomputer. The tasks can be either completely decoupled, co
 rresponding to a set of in...\n\n---------------------\nAcceleration of Pa
 rallel Methods for Stochastic Elliptic Equations: A Domain Decomposition A
 pproach\n\nReis, Congedo, Le Maître\n\nThe resolution of stochastic ellipt
 ic equations with random coefficients, using Monte Carlo methods (MC), can
  be very costly as they routinely require to solve thousands of samples to
  obtain converged statistics. The availability of efficient solvers is the
 n crucial. We use domain decomposition meth...\n
END:VEVENT
END:VCALENDAR

