{"60401":{"#nid":"60401","#data":{"type":"event","title":"Graph-based methods for efficiently constructing factorial designs","body":[{"value":"\u003Cp\u003E\u003Cstrong\u003ESIAC Seminar\u003C\/strong\u003E\u003C\/p\u003E\u003Cp\u003E\u003Cstrong\u003ETITLE:\u003C\/strong\u003E \u003Cstrong\u003E\u003Cstrong\u003EGraph-based methods for efficiently constructing\nfactorial designs\u003C\/strong\u003E\u003C\/strong\u003E\u003C\/p\u003E\u003Cp\u003E\u003Cstrong\u003ESPEAKER: Dr. Abhishek K. Shrivastava\u003C\/strong\u003E\u003C\/p\u003E\u003Cp\u003E\u003Cstrong\u003EABSTRACT:\u003C\/strong\u003E\u003C\/p\u003E\u003Cp\u003EFractional factorial designs are among the most popular\nclass of experimental designs among practitioners. Usually, a factorial design\nis selected after comparing all the designs in a catalog of designs for a given\nsize. Designs in these catalogs should be distinct under relabeling of factors,\nlevel labels and run order, i.e., they should be mutually non-isomorphic.\nTesting two designs for isomorphism is computationally hard, and construction\nof non-isomorphic catalogs is even tougher with the large number of designs\nthat need to be compared for isomorphism. In this talk, I will present a new\napproach for solving design isomorphism by representing designs as graphs. The\nresulting graph isomorphism problem can be efficiently solved using methods\navailable in literature. Further, in the case of regular designs, I will show\nhow these graph representations can be exploited for speeding up the efficiency\nof catalog construction by reducing the number of isomorphism tests. I will\ndemonstrate the gains from this approach by presenting results for 2-level regular\nfractional factorial and 2-level split-plot designs. \u003C\/p\u003E\n\n\u003Cp\u003E\u0026nbsp;\u003C\/p\u003E\n\n\u003Cp\u003E\u003Cstrong\u003EBio:\u003C\/strong\u003E\u003C\/p\u003E\n\n\u003Cp\u003EAbhishek K. Shrivastava is an Assistant Professor in the\nDepartment of Manufacturing Engineering and Engineering Management in City\nUniversity of Hong Kong, Hong Kong. He received his B. Tech. (Honors) in\nIndustrial Engineering from I.I.T. Kharagpur, India, in 2003, and his Ph.D. in\nIndustrial Engineering from Texas A\u0026amp;M University, College Station, USA, in\n2009. His research interests are in statistical modeling and analysis of\ncomplex systems, design of experiments and rare event detection. He is a member\nof INFORMS, IIE, ASA and IMS.\u003C\/p\u003E","summary":null,"format":"limited_html"}],"field_subtitle":"","field_summary":"","field_summary_sentence":[{"value":"Graph-based methods for efficiently constructing factorial designs"}],"uid":"27187","created_gmt":"2010-08-11 12:03:53","changed_gmt":"2016-10-08 01:52:07","author":"Anita Race","boilerplate_text":"","field_publication":"","field_article_url":"","field_event_time":{"event_time_start":"2010-08-26T13:00:00-04:00","event_time_end":"2010-08-26T14:30:00-04:00","event_time_end_last":"2010-08-26T14:30:00-04:00","gmt_time_start":"2010-08-26 17:00:00","gmt_time_end":"2010-08-26 18:30:00","gmt_time_end_last":"2010-08-26 18:30:00","rrule":null,"timezone":"America\/New_York"},"extras":[],"groups":[{"id":"1242","name":"School of Industrial and Systems Engineering (ISYE)"}],"categories":[],"keywords":[],"core_research_areas":[],"news_room_topics":[],"event_categories":[],"invited_audience":[],"affiliations":[],"classification":[],"areas_of_expertise":[],"news_and_recent_appearances":[],"phone":[],"contact":[],"email":[],"slides":[],"orientation":[],"userdata":""}}}