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-01-16T15:30:00-05:00 hourly 1 2000-01-01T12:00+00:00 Mon, 09 Jul 2007 09:00:20 -0400seminars@cse.nd.eduColloquium2007-01-16T15:30:00-05:00http://www.cse.nd.edu/seminars/ay2006/page2/files/b31b2d2a4b048fc45e39e4ca92f001c7-25.html#unique-entry-id-25http://www.cse.nd.edu/seminars/ay2006/page2/files/b31b2d2a4b048fc45e39e4ca92f001c7-25.html#unique-entry-id-25Abstract This presentation surveys several research projects that could serve as examples of Computer Science as a Problem Solving Discipline.... Problem domains addressed include environmental science, bioinformatics, emergency management systems, and a software engineering study of the open source software (OSS) development phenomenon. We develop a framework for viewing CS as a Problem Solving Discipline by extending the ideas of Fred Brooks presented in his acceptance lecture as the first recipient of ACM Allen Newell Award [1].]]>seminars@cse.nd.eduMS Thesis2007-01-15T18:37:32-05:00http://www.cse.nd.edu/seminars/ay2006/page2/files/6c3c83e87be267725516b4322b8ee811-26.html#unique-entry-id-26http://www.cse.nd.edu/seminars/ay2006/page2/files/6c3c83e87be267725516b4322b8ee811-26.html#unique-entry-id-26seminars@cse.nd.eduColloquium2007-01-15T13:17:27-05:00http://www.cse.nd.edu/seminars/ay2006/page2/files/234eefc0920eb90300760614b41c93de-27.html#unique-entry-id-27http://www.cse.nd.edu/seminars/ay2006/page2/files/234eefc0920eb90300760614b41c93de-27.html#unique-entry-id-27seminars@cse.nd.eduColloquium2007-01-12T15:00:30-05:00http://www.cse.nd.edu/seminars/ay2006/page2/files/5e216e05bb40549053f5416790307e58-29.html#unique-entry-id-29http://www.cse.nd.edu/seminars/ay2006/page2/files/5e216e05bb40549053f5416790307e58-29.html#unique-entry-id-29Abstract Plan synthesis is a problem in Artificial Intelligence that has been studied by both logicians and decision theorists.... Specifically, I will describe the adaptation of a popular data structure, called the planning graph, used for heuristic search guidance, from its origins in classical (deterministic) planning to deal with partially observable states and stochastic actions.

Bio

Daniel Bryce is a Ph.D. Candidate in the Computer Science Department at Arizona State University, where he is a member of the Yochan Research Group.]]>seminars@cse.nd.eduColloquium2007-01-12T14:57:48-05:00http://www.cse.nd.edu/seminars/ay2006/page2/files/eaa9db4964f4260106dbeb064ff46211-30.html#unique-entry-id-30http://www.cse.nd.edu/seminars/ay2006/page2/files/eaa9db4964f4260106dbeb064ff46211-30.html#unique-entry-id-30seminars@cse.nd.eduColloquium2007-01-10T15:30:00-05:00http://www.cse.nd.edu/seminars/ay2006/page2/files/c02740efcc77438eba20d5efd831f95b-23.html#unique-entry-id-23http://www.cse.nd.edu/seminars/ay2006/page2/files/c02740efcc77438eba20d5efd831f95b-23.html#unique-entry-id-23seminars@cse.nd.eduColloquium2007-01-10T14:50:00-05:00http://www.cse.nd.edu/seminars/ay2006/page2/files/4811f0db2754c51cb87a58e7a739848c-24.html#unique-entry-id-24http://www.cse.nd.edu/seminars/ay2006/page2/files/4811f0db2754c51cb87a58e7a739848c-24.html#unique-entry-id-24Abstract Timing analysis is one of the most important foundations of electronic design automation (EDA) tools.... With the advancement of IC technology and increasing complexity of contemporary integrated circuits, different timing requirements and characteristics emerge, which require timing calculation evolve accordingly.
This talk will cover the evolution process of timing calculation in EDA tools from two aspects, cell and net delays....

Bio

Zhong Wang graduated from the Department of Computer Science & Engineering from the University of Notre Dame in 2003.]]>seminars@cse.nd.eduColloquium2007-01-10T13:30:03-05:00http://www.cse.nd.edu/seminars/ay2006/page2/files/f64342599f3c47683d4855d323357be5-34.html#unique-entry-id-34http://www.cse.nd.edu/seminars/ay2006/page2/files/f64342599f3c47683d4855d323357be5-34.html#unique-entry-id-34seminars@cse.nd.eduColloquium2007-01-10T12:01:13-05:00http://www.cse.nd.edu/seminars/ay2006/page2/files/6642e72f2f1ce9c9a3d83160b6c10f8f-31.html#unique-entry-id-31http://www.cse.nd.edu/seminars/ay2006/page2/files/6642e72f2f1ce9c9a3d83160b6c10f8f-31.html#unique-entry-id-31Abstract While only refrigerator-sized, the 1,024 node CyBlue BlueGene/L at Iowa State University can perform 5.7 trillion floating point operations per second. ...We present a method that uses efficient algorithms and BlueGene/L to solve these large "puzzles"; CyBlue currently can process over 3.2 million complex maize genomic sequences in less than 2 hours. ...Hence, the coupling of BlueGene and 454 technologies could be invaluable for upcoming plant genome sequencing and annotation including U.S. biofuel-related projects such as switchgrass and Brachypodium.]]>seminars@cse.nd.eduPh.D. Thesis2007-01-08T14:00:00-05:00http://www.cse.nd.edu/seminars/ay2006/page2/files/8c4442c4d27132bf8d189accb3321a59-36.html#unique-entry-id-36http://www.cse.nd.edu/seminars/ay2006/page2/files/8c4442c4d27132bf8d189accb3321a59-36.html#unique-entry-id-36Abstract The success of Open Source Software (OSS) has attracted increased interests in many research areas.... Based on our mining results, we model the OSS community as a social network, one which can be further modeled as a project network and a developer network, and study properties of these networks.... To study the organization and backbones of the OSS community, we conduct the identification of the community structure on the SourceForge project network and explore possible reasons for the formation of those groups by examining assortative mixing coefficients for projects categories.]]>seminars@cse.nd.eduColloquium2007-01-07T15:00:00-05:00http://www.cse.nd.edu/seminars/ay2006/page2/files/b10ad9cbd3a873bf36325cf00e73235e-28.html#unique-entry-id-28http://www.cse.nd.edu/seminars/ay2006/page2/files/b10ad9cbd3a873bf36325cf00e73235e-28.html#unique-entry-id-28Abstract In a hierarchical access control system, users are divided into a number of disjoint classes, called security classes, which are organized in a hierarchy.... Its main goal is efficiency: the number of keys a user obtains, computation a user performs, and amount of information the server stores should be minimized.
In this talk, we present a fully-dynamic and very efficient solution to the key assignment problem that is also provably secure for a strong notion of security. We then show how the model can be extended to time-based policies where users obtain access rights only for a specific duration of time, and subsequently present our time-based key assignment scheme.]]>seminars@cse.nd.eduColloquium2007-01-06T14:00:00-05:00http://www.cse.nd.edu/seminars/ay2006/page2/files/711a4e3beb791d2bb6bc1fc3726e1494-35.html#unique-entry-id-35http://www.cse.nd.edu/seminars/ay2006/page2/files/711a4e3beb791d2bb6bc1fc3726e1494-35.html#unique-entry-id-35Abstract I will give an overview of Machine Learning and Data Mining research at Accenture Technology Labs and talk about some recent projects that focus on business applications of Machine Learning and Data Mining. These projects include using Semi-Supervised & Active Learning for Information Extraction to extract product attributes from text descriptions, predicting end-price of online auctions to offer auction price insurance, learning individual consumer models for personalized pricing and retail promotions, and probabilistic belief propagation algorithms for sensor fusion. More information about these projects is available at http://www.accenture.com/techlabs/ghani .]]>seminars@cse.nd.eduColloquium2007-01-05T15:31:00-05:00http://www.cse.nd.edu/seminars/ay2006/page2/files/18ece196f47629441119a81788682fa3-37.html#unique-entry-id-37http://www.cse.nd.edu/seminars/ay2006/page2/files/18ece196f47629441119a81788682fa3-37.html#unique-entry-id-37Bio James Tuck is a Ph.D. candidate in the Department of Computer Science at the University of Illinois at Urbana-Champaign (UIUC).]]>seminars@cse.nd.eduPh.D. Thesis2007-01-05T15:30:40-05:00http://www.cse.nd.edu/seminars/ay2006/page2/files/829e54d561c026bf7f57d347dcb78d06-38.html#unique-entry-id-38http://www.cse.nd.edu/seminars/ay2006/page2/files/829e54d561c026bf7f57d347dcb78d06-38.html#unique-entry-id-38Abstract Service oriented architecture (SOA) is a new paradigm that originated in industry for future distributed computing.... Since their introduction, semanitc web and web services technologies are increasingly gaining interest in the implementation of e-Science infrastructures.... We present a practical experiment of building a service-oriented system for data integration and analysis using current web services technologies and bioinformatics middleware.]]>seminars@cse.nd.eduColloquium2007-01-05T15:30:00-05:00http://www.cse.nd.edu/seminars/ay2006/page2/files/36698b011f188521832cbb7489f9b7d8-33.html#unique-entry-id-33http://www.cse.nd.edu/seminars/ay2006/page2/files/36698b011f188521832cbb7489f9b7d8-33.html#unique-entry-id-33seminars@cse.nd.eduMS Thesis2007-01-04T16:39:47-05:00http://www.cse.nd.edu/seminars/ay2006/page2/files/025f5e48b98315d5bb40e039967e4a97-41.html#unique-entry-id-41http://www.cse.nd.edu/seminars/ay2006/page2/files/025f5e48b98315d5bb40e039967e4a97-41.html#unique-entry-id-41seminars@cse.nd.eduMS Thesis2007-01-04T15:31:41-05:00http://www.cse.nd.edu/seminars/ay2006/page2/files/0830825f2a8560becc2c7f5fc675f513-39.html#unique-entry-id-39http://www.cse.nd.edu/seminars/ay2006/page2/files/0830825f2a8560becc2c7f5fc675f513-39.html#unique-entry-id-39seminars@cse.nd.eduColloquium2007-01-04T15:30:00-05:00http://www.cse.nd.edu/seminars/ay2006/page2/files/1494156a442ecbd049876e79f3c8cb63-32.html#unique-entry-id-32http://www.cse.nd.edu/seminars/ay2006/page2/files/1494156a442ecbd049876e79f3c8cb63-32.html#unique-entry-id-32seminars@cse.nd.eduMS Thesis2007-01-04T10:25:35-05:00http://www.cse.nd.edu/seminars/ay2006/page2/files/b4e625f04a866e270b52c62df729f26e-40.html#unique-entry-id-40http://www.cse.nd.edu/seminars/ay2006/page2/files/b4e625f04a866e270b52c62df729f26e-40.html#unique-entry-id-40Abstract Object storage has traditionally been seen only in low level interfaces, visible only to kernels and filesystem code.... The layer of indirection allows for filesystems larger than any single disk, permits multiple filesystems to share common objects, and enables users to create and manage private namespaces. Experimentally, this work demonstrates that the overhead of indirection is low, a single client can write faster than disk speed, and multiple clients can harness aggregate disk throughput.]]>seminars@cse.nd.eduColloquium2007-01-03T15:30:00-05:00http://www.cse.nd.edu/seminars/ay2006/page2/files/37a13461b8c5f56afdce977748499e02-20.html#unique-entry-id-20http://www.cse.nd.edu/seminars/ay2006/page2/files/37a13461b8c5f56afdce977748499e02-20.html#unique-entry-id-20seminars@cse.nd.eduColloquium2007-01-02T15:30:00-05:00http://www.cse.nd.edu/seminars/ay2006/page2/files/9b0097fc116f802f317d4f31ddc1f716-19.html#unique-entry-id-19http://www.cse.nd.edu/seminars/ay2006/page2/files/9b0097fc116f802f317d4f31ddc1f716-19.html#unique-entry-id-19Abstract There has been an exponential growth of applications that rely on diverse types of embedded end-systems and devices, such as cell phones, handheld entertainment devices, home appliances, consumer and industrial electronics, smart sensors and actuators. ...Shin is the Kevin and Nancy O'Connor Professor of Computer Science and Founding Director of the Real-Time Computing Laboratory in the Department of Electrical Engineering and Computer Science, The University of Michigan, Ann Arbor, Michigan.... He has supervised the completion of 56 PhD theses, and authored/coauthored more than 650 technical papers and numerous book chapters in the areas of distributed real-time computing and control, computer networking, fault-tolerant computing, and intelligent manufacturing.]]>seminars@cse.nd.eduIBM Lecture Series2007-01-01T15:30:00-05:00http://www.cse.nd.edu/seminars/ay2006/page2/files/19a1d88716c70c6d7512ebd5ecc08c2e-22.html#unique-entry-id-22http://www.cse.nd.edu/seminars/ay2006/page2/files/19a1d88716c70c6d7512ebd5ecc08c2e-22.html#unique-entry-id-22Abstract This talk will explore principles of unsupervised learning and how they relate to face recognition from the perspective of both machine vision and human visual perception.... Finally, the talk will review perceptual studies suggesting that dependency learning is relevant to human face perception as well, and present an information maximization account of perceptual effects such as the other-race effect and and face adaptation aftereffects. ...Dr. Bartlett is Associate Editor for Neurocomputing, and she is also actively involved in the NSF Igert program on learning and vision in humans and machines at UCSD, as well as the NSF Science of Learning Center at UCSD on the temporal dynamics of learning.]]>