Select a calendar:
Filter March Events by Event Type:
SUNMONTUEWEDTHUFRISAT
Events for March 05, 2013
-
Accelerating Image Reconstruction using Variable Splitting Methods
Tue, Mar 05, 2013 @ 02:00 PM - 03:00 PM
Ming Hsieh Department of Electrical and Computer Engineering
Conferences, Lectures, & Seminars
Speaker: Prof. Jeff Fessler, University of Michigan
Talk Title: Accelerating Image Reconstruction using Variable Splitting Methods
Abstract: Statistical image reconstruction methods have been used in PET and SPECT commercially for well over a decade and have recently begun to appear commercially in X-ray CT systems, offering the possibility of reducing X-ray dose. Iterative methods are also poised to impact clinical MRI. Computation time is a significant challenge for iterative image reconstruction methods, particularly in X-ray CT and MRI. This talk will describe new developments in accelerating optimization methods for image reconstruction.
Biography: Jeff Fessler received the BSEE degree from Purdue University in 1985, the MSEE degree from Stanford University in 1986, and the M.S. degree in Statistics from Stanford University in 1989. From 1985 to 1988 he was a National Science Foundation Graduate Fellow at Stanford, where he earned a Ph.D. in electrical engineering in 1990. He has worked at the University of Michigan since then. From 1991 to 1992 he was a Department of Energy Alexander Hollaender Post-Doctoral Fellow in the Division of Nuclear Medicine. From 1993 to 1995 he was an Assistant Professor in Nuclear Medicine and the Bioengineering Program. He is now a Professor in the Departments of Electrical Engineering and Computer Science, Radiology, and Biomedical Engineering. He became a Fellow of the IEEE in 2006, for contributions to the theory and practice of image reconstruction. He received the Francois Erbsmann award for his IPMI93 presentation. He has served as an associate editor for IEEE Transactions on Medical Imaging and the IEEE Signal Processing Letters, and is currently serving as an associate editor for the IEEE Transactions on Image Processing. He has chaired the IEEE T-MI Steering Committee and the ISBI Steering Committee. He was co-chair of the 1997 SPIE conference on Image Reconstruction and Restoration, technical program co-chair of the 2002 IEEE International Symposium on Biomedical Imaging (ISBI), and general chair of ISBI 2007. His research interests are in statistical aspects of imaging problems, and he has supervised doctoral research in PET, SPECT, X-ray CT, MRI, and optical imaging problems.
Host: Prof. Justin Haldar
Location: Hughes Aircraft Electrical Engineering Center (EEB) - 248
Audiences: Everyone Is Invited
Contact: Talyia Veal
-
Hierarchical processing and the neurobiology of language
Tue, Mar 05, 2013 @ 02:00 PM - 03:30 PM
Thomas Lord Department of Computer Science
Conferences, Lectures, & Seminars
Speaker: Ina Bornkessel-Schlesewsky and Matthias Schlesewsky, Department of Germanic Linguistics, University of Marburg, and Department of English and Linguistics, Johannes Gutenberg-University Mainz
Talk Title: Hierarchical processing and the neurobiology of language
Abstract: Hierarchical processing has been posited as a basic property of neurobiological organisation both in the visual (e.g. Felleman & Van Essen, 1991) and auditory (Rauschecker, 1998) systems. It is also an important characteristic of a recent neurobiological model of speech processing (Rauschecker & Scott, 2009), which builds upon insights from the auditory system of non-human primates. By contrast, long-standing neurocognitive assumptions about the organisation of language in the brain (e.g. the notion that Broca's region in left frontal cortex is crucial for grammatical processing) are often incompatible with the tenet of hierarchical processing. Here, we outline a new neurobiological approach to language processing which applies the principle of hierarchical organisation to sentence and discourse comprehension (Bornkessel- Schlesewsky & Schlesewsky, in press). We show how the architectural consequences of this basic design principle help to reconcile a number of theoretical and empirical puzzles within the existing literature on the neuroscience of language. Furthermore, they lead to novel and sometimes surprising hypotheses (e.g. regarding the neural bases for structuring sentences in time).
Biography: Ina Bornkessel-Schlesewsky
Department of Germanic Linguistics, University of Marburg
and Matthias Schlesewsky
Department of English and Linguistics, Johannes Gutenberg-University Mainz
Host: Michael Arbib
Location: Ray R. Irani Hall (RRI) - 101
Audiences: Everyone Is Invited
Contact: Assistant to CS chair
-
Big Data Analytics with Parallel Jobs
Tue, Mar 05, 2013 @ 03:30 PM - 05:00 PM
Thomas Lord Department of Computer Science
Conferences, Lectures, & Seminars
Speaker: Ganesh Ananthanarayanan, UC Berkeley
Talk Title: CS Colloquium: Ganesh Ananthanarayanan (UC Berkeley)
Series: CS Colloquium
Abstract: Extensive data analysis has become the enabler for diagnostics and decision making in many modern systems. These analyses have both competitive as well as social benefits. To cope with the deluge in data that is growing faster than Mooreââ¬â¢s law, computation frameworks have resorted to massive parallelization of analytics jobs into many fine-grained tasks. These frameworks promised to provide efficient and fault-tolerant execution of these tasks. However, meeting this promise in clusters spanning hundreds of thousands of machines is challenging and a key departure from earlier work on parallel computing.
A simple but key aspect of parallel jobs is the all-or-nothing property: unless all tasks of a job are provided equal improvement, there is no speedup in the completion of the job. This talk will demonstrate how the all-or-nothing property impacts replacement algorithms in distributed caches for parallel jobs. Our coordinated caching system, PACMan, makes global caching decisions and employs a provably optimal cache replacement algorithm. A highlight of our evaluation using workloads from Facebook and Bing datacenters is that PACManââ¬â¢s replacement algorithm outperforms even Beladyââ¬â¢s MIN (that uses an oracle) in speeding up jobs. Along the way, I will also describe how we broke the myth of disk-localityââ¬â¢s importance in datacenter computing and solutions to mitigate straggler tasks.
Biography: Ganesh Ananthanarayanan is a PhD candidate in the University of California at Berkeley, working with Prof. Ion Stoica in the AMP Lab. His research interests are in systems and networking, with a focus on cloud computing and large scale data analytics systems. Prior to joining Berkeley, he worked for two years at Microsoft Researchââ¬â¢s Bangalore office. More details about Ganeshââ¬â¢s work can be found here: http://www.cs.berkeley.edu/~ganesha/.
Host: Ramesh Govindan
Location: Seaver Science Library (SSL) - 150
Audiences: Everyone Is Invited
Contact: Assistant to CS chair
-
Epstein Institute / ISE 651 Seminar Series
Tue, Mar 05, 2013 @ 03:45 PM - 05:00 PM
Daniel J. Epstein Department of Industrial and Systems Engineering
Conferences, Lectures, & Seminars
Speaker: Simge Küçükyavuz, Associate Professor, Integrated Systems Engineering Department, Ohio State University
Talk Title: "Valid Inequalities and Formulations for a Dynamic Optimization Problem under a Chance Constraint"
Series: Epstein Institute Seminar Series
Abstract: We consider a finite-horizon stochastic mixed-integer program involving dynamic decisions under a constraint on the overall performance or reliability of the system. We formulate this problem as a multi-stage (dynamic) chance-constrained program, whose deterministic equivalent is a large-scale mixed-integer program. We study the structure of the formulation, and develop a branch-and-cut method for its solution. We illustrate the efficacy of the proposed model and method on a dynamic inventory control problem with stochastic demand in which a specific service level must be met over the entire planning horizon. We compare our dynamic model with a static chance-constrained model, a dynamic risk-averse optimization model, a robust optimization model, and a rolling horizon method, and show that significant cost savings can be achieved at high service levels using our model.
This is joint work with Minjiao Zhang and Saumya Goel.
Biography: Simge Küçükyavuz is an associate professor in the Integrated Systems Engineering Department at the Ohio State University. Prior to joining the faculty at Ohio State, Dr. Küçükyavuz was an assistant professor at the University of Arizona and a research associate at Hewlett-Packard Laboratories. She received her MSc and PhD degrees from the University of California, Berkeley, and BS degree from the Middle East Technical University in Turkey. Her interests are in mixed-integer programming, large-scale optimization, optimization under uncertainty, and their applications. Her research is supported by grants from the National Science Foundation, including the 2011 CAREER Award. She serves on the editorial boards of Computational Optimization and Applications, and Wiley Encyclopedia of Operations Research and Management Science. She is the treasurer and secretary of the INFORMS Computing Society.
Host: Daniel J. Epstein Department of Industrial and Systems Engineering
More Information: Seminar-Küçükyavuz.doc
Location: Von Kleinsmid Center For International & Public Affairs (VKC) - Room 100
Audiences: Everyone Is Invited
Contact: Georgia Lum
-
The Movie spOILed and Q&A with Director, Mark Mathis
Tue, Mar 05, 2013 @ 06:30 PM - 08:45 PM
Mork Family Department of Chemical Engineering and Materials Science
Receptions & Special Events
The USC SPE Student Chapter is proud to host a
screening of the movie spOILed with the director
Mark Mathis. It will be held at the Ronald Tutor
Campus Center ballroom on the USC campus,
Tuesday March 5th at 6:30 PM. Mark Mathis will stay
for a question and answer session after the movie to
continue a discussion. The event is free and was
made possible by Signal Hill Petroleum and the LA
Basin SPE chapter.More Information: spOILed MAR2013.pdf
Location: Ronald Tutor Campus Center (TCC) - Ballroom
Audiences: Everyone Is Invited
Contact: Juli Legat
