http://www.cse.nd.edu/seminars/ay2006/index.htmlDepartment of Computer Science and Engg. Seminar Seriesenseminars@cse.nd.eduCopyright 2007 Computer Science and Engg, University of Notre Dame2007-07-26T11:47:01-04:00 hourly 1 2000-01-01T12:00+00:00 Sun, 19 Aug 2007 00:54:15 -0400seminars@cse.nd.eduColloquium2007-07-26T11:47:01-04:00http://www.cse.nd.edu/seminars/ay2006/files/ab78f987a8e5630733c7d401d1bf4534-48.html#unique-entry-id-48http://www.cse.nd.edu/seminars/ay2006/files/ab78f987a8e5630733c7d401d1bf4534-48.html#unique-entry-id-48Abstract The storage group at Los Alamos National Lab is responsible for designing, deploying, and debugging the storage systems atached to our supercomputers. In this talk, we present some of the storage challenges that become apparent at large scales when thousands of processes simultaneously access a single terabyte-sized file. The talk will be introduced with a general discussion of supercomputing workloads and systems at the national labs and will include a more detailed description of the recent work done in bringing up the half-petabyte storage system attached to our new supercomputer, Roadrunner.]]>seminars@cse.nd.eduPh.D. Thesis2007-07-11T13:00:00-04:00http://www.cse.nd.edu/seminars/ay2006/files/d7e2720a7f05c19291cc83543ff7b78d-46.html#unique-entry-id-46http://www.cse.nd.edu/seminars/ay2006/files/d7e2720a7f05c19291cc83543ff7b78d-46.html#unique-entry-id-46seminars@cse.nd.eduPh.D. Thesis2007-07-06T10:30:00-04:00http://www.cse.nd.edu/seminars/ay2006/files/c65f037d9669bc6f513b6378bb78189f-47.html#unique-entry-id-47http://www.cse.nd.edu/seminars/ay2006/files/c65f037d9669bc6f513b6378bb78189f-47.html#unique-entry-id-47seminars@cse.nd.eduIBM Lecture Series2007-06-22T11:00:00-04:00http://www.cse.nd.edu/seminars/ay2006/files/dcbb9bbda07bddd73e744ee82ff95ab5-44.html#unique-entry-id-44http://www.cse.nd.edu/seminars/ay2006/files/dcbb9bbda07bddd73e744ee82ff95ab5-44.html#unique-entry-id-44seminars@cse.nd.eduPh.D. Thesis2007-06-07T13:00:00-05:00http://www.cse.nd.edu/seminars/ay2006/files/b6f6e5c113bebf5c8db9b30e82b5b284-45.html#unique-entry-id-45http://www.cse.nd.edu/seminars/ay2006/files/b6f6e5c113bebf5c8db9b30e82b5b284-45.html#unique-entry-id-45Abstract Intensity-modulated radiation therapy (IMRT) is a modern cancer treatment technique aiming to deliver a prescribed conformal radiation dose to a target tumor while sparing the surrounding normal tissues and critical structures. The prescribed radiation dose is specified by intensity maps (IM).In this thesis, we study a set of combinatorial and geometric problems that arise in IMRT planning and delivery: (1) the 3-D static leaf sequencing (SLS)problem, whose goal is to deliver the prescribed IMs in the minimum amount of time; (2)the 3-D static leaf sequencing with error control problem, which aims to deliver the prescribed IMs in the minimum amount of time subject to the constraint that no unnecessary machine delivery error is introduced; (3) the field splitting problems, which seek to split a large width, undeliverable IM into several deliverable sub-IMs of widths no larger than a given threshold value such that the total beam-on time during delivery is minimized; (4) the shape rectangularization problems, which are useful in simplifying a complicated continuous dose distribution into a deliverable discrete IM; (5) the coupled path planning problems, which are directly related to dynamic leaf sequencing and single-arc dose painting, an emerging IMRT delivery technique. Known algorithms for the above problems, both in commercial planning systems and in medical literature, either are heuristics that do not provide any quality guarantee of the solutions, or could handle only very special cases.]]>seminars@cse.nd.eduPh.D. Thesis2007-06-05T13:00:00-04:00http://www.cse.nd.edu/seminars/ay2006/files/a83fcb80cb756d08720228161632886d-43.html#unique-entry-id-43http://www.cse.nd.edu/seminars/ay2006/files/a83fcb80cb756d08720228161632886d-43.html#unique-entry-id-43