BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Date iCal//NONSGML kigkonsult.se iCalcreator 2.20.2//
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:STANDARD
DTSTART:20181104T020000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20190310T020000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:calendar.193246.field_date.0@www.wpi.edu
DTSTAMP:20191208T175600Z
CREATED:20190213T163200Z
DESCRIPTION:Description of Event: \n\n\n\nRosemary Bailey\, University of S
t Andrews\n\n\n\nTITLE :Finding good designs for experiments\n\n\n\nABSTRA
CT: \n\n\n\nSuppose that there are N experimental units available for an e
xperiment to compare v treatments. The experimental units may be all alike
\, or they make be partitioned into blocks\, or there may be rows and colu
mns. The design is the function allocating treatments to units. It is said
to be optimal if it minimizes the average value of the variance of the es
timator of the difference between two treatments.\n\n\n\nHow should we fin
d an optimal design for any given situation\, with specified values of N a
nd v? There are some theorems that cover a few cases. These lead on to som
e general folklore that is not always correct. One combinatorial approach
is to make use of pretty patterns\, to find designs with high symmetry or
regularity. Another is to make a computer search. Sometimes a good design
is found by a lucky accident.
DTSTART;TZID=America/New_York:20190322T110000
DTEND;TZID=America/New_York:20190322T115000
LAST-MODIFIED:20190321T185640Z
LOCATION:Stratton Hall
SUMMARY:Mathematical Sciences - Colloquium - Rosemary Bailey\, (University
of St Andrews) 'Finding good designs for experiments'
URL;TYPE=URI:https://www.wpi.edu/news/calendar/events/mathematical-sciences
-colloquium-rosemary-bailey-university-st-andrews-finding
END:VEVENT
END:VCALENDAR