BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Non-collapsing Spacing-filling Designs for Bounded Regions - Dean\
 , A (SAS Institute\, Inc.)
DTSTART:20110906T153000Z
DTEND:20110906T160000Z
UID:TALK32674@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:Many physical processes can be described via mathematical mode
 ls implemented as computer codes.  Since a computer code may take hours or
  days to produce a single output\, a cheaper surrogate model (emulator) ma
 y be fitted for exploring the region of interest. The performance of the e
 mulator depends on the "space-filling" properties of the design\; that is\
 , how well the design points are spread throughout the experimental region
 . The output from many computer codes is deterministic\, in which case no 
 replications are required at\, or near\, any design point to estimate erro
 r variability.  In addition\, designs that do not replicate any value for 
 any single input ("non-collapsing" designs) are the most efficient when on
 e or more inputs turn out to have little effect on the response. An algori
 thm is described for constructing space-filling and non-collapsing designs
  for computer experiments when the input region is bounded.\n\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR