Email us at nsbe@usc.edu]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=STU200911221830213000.000.005 Unlimited performance options " Instrument playing, mimicry, Dance, singing, Group performances allowed, magic show.\NTotal time available: 10 min per performance (Including setup time).

IPODs and other exciting prizes for all! Food will be served.

Sign up to perform at VGSA website.]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=SEM200911231230133000.000.004 http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=WOR200911230000000000.000.017 Reservations are required for Meet USC. This program occurs twice, once at 9:00 a.m. and again at 1:00 p.m. Please visit http://www.usc.edu/admission/undergraduate/visit/meet_usc.html to check availability and make an appointment. Be sure to list an Engineering major as your "intended major" on the webform!]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=SEM200911251300150000.000.006 The main objective of the dissertation is to develop multi-scale algorithms for continuum-atomistic problems. The focus is on sequential multi-scale simulations. In sequential multi-scale methods, the computations at the various scales are, in a sense, decoupled. This means, for example, that, for a continuum/atomistic simulation, large scale macroscopic continuum calculations rely on the results of fine scale computations and information obtained on an atomistic cell.

While the procedures developed in this thesis could be used in conjunction with a number of sequential multi-scale methods, the focus here is on the homogenization technique. As has been the case in traditional finite element applications of homogenization, one of the principal focuses in this thesis will be on the computation of macro scale constitutive parameters; but, in this case, these constitutive representations come from the atomistic calculations.

The thesis has four parts that develop various aspects of the theme of the work. The dissertation focuses on the following applications:

1. Problems involving mechanical loading of solids and structures under static load at zero temperature.

The focus is on creating multi-scale continuum/atomistic simulation methods which use the atomistic model to provide an improved material representation including the effects of material defects. This topic could be useful in modeling fracture and failure.

2. Computation of thermo-mechanical constitutive parameters at finite temperature conditions.

This procedure focuses on using the atomistic scale calculation to define constitutive parameters. It assumes that equilibrium conditions exist at the atomistic scale. It does not attempt to track, in a time history sense, the dynamics at the atomistic scale. It does require the solution of an atomistic free vibration problem with natural frequencies dependent on temperature. The procedure defines macroscopic thermo-mechanical constitutive parameters, like the specific heat and the coefficient of thermal expansion, as a function of temperature. These properties could be used directly in a macroscopic continuum finite element model which would be valid at the full range of temperatures.

3. Dynamic problems involving the simulation of the thermo-mechanical behavior of systems at finite temperature, with and without heat transfer.

This procedure focuses on using the atomistic scale calculation to define multi-scale, thermo-mechanical momentum and energy equations. It does attempt to track, in a time history sense, the dynamics at the atomistic scale. Energy equations are derived for both the scales based on first law of thermo-dynamics. Two types of application problems are used to demonstrate the theory. The first involves thermal stress analysis simulation in which the temperature has no time variability and, thus, no heat transfer occurs. The second involves simulations with time varying temperatures and include heat transfer effects.

4. Implicit time integrations algorithms for atomistic momentum equations that can be seamlessly coupled to macro models. \N]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=STU200911251830193001.000.005 nsbe@usc.edu\N]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=WOR200911250000000000.000.017 Reservations are required for Meet USC. This program occurs once at 9:00 a.m. Please visit http://www.usc.edu/admission/undergraduate/visit/meet_usc.html to check availability and make an appointment. Be sure to list an Engineering major as your "intended major" on the webform!]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=SEM200911300000000000.000.021 http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=SEM200911301230133000.000.004 http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=WOR200912090000000000.000.017 Reservations are required for Meet USC. This program occurs twice, once at 9:00 a.m. and again at 1:00 p.m. Please visit http://www.usc.edu/admission/undergraduate/visit/meet_usc.html to check availability and make an appointment. Be sure to list an Engineering major as your "intended major" on the webform!]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=SEM200912011600175000.000.007 Abstract:\N"It is not from the benevolence of the butcher, the brewer, or the baker, that we expect our dinner, but from their regard for their own interest."\NEach participant in a competitive economy is "led by an invisible hand to promote an end which was no part of his intention." Adam Smith, 1776.

With his treatise, The Wealth of Nations, 1776, Adam Smith initiated the field of economics, and his famous quote provided this field with its central guiding principle. The pioneering work of Walras (1874) gave a mathematical formulation for this statement, using his notion of market equilibrium, and opened up the possibility of a formal ratification.

Partial ratification came with the celebrated Arrow-Debreu Theorem (1954), which established existence of equilibrium in a very general model of the economy; however, an efficient mechanism for finding an equilibrium has remained elusive.

The latter question was taken up in the earnest within theoretical computer science a decade ago, and attention soon gravitated on markets under piecewise-linear, concave utility functions.\NAs it turned out, the recent resolution of this open problem did not yield the hoped-for mechanism; however, it did mark the end of the road for the current approach. It is now time to step back and plan a fresh attack, using the powerful tools of modern complexity theory and algorithms.

After providing a summary of key developments through the ages and a gist of the recent results, we will discuss some ways of moving forward.

(Based in part on recent work with Mihalis Yannakakis.)

Speaker Bio: \NVijay Vazirani got his Bachelor's degree from MIT in 1979, his Ph.D. from U.C. Berkeley in 1983, and is currently Professor of Computer Science at Georgia Tech.\NHis research career has been centered around the design of algorithms, together with work on complexity theory, cryptography, coding theory, and game theory.

He is best known for his work on efficient algorithms for the classical maximum matching problem (1980's), fundamental complexity-theoretic results obtained using randomization (1980's), approximation algorithms for basic NP-hard optimization problems (1990's), and efficient algorithms for computing market equilibria (current).

In 2001 he published what is widely viewed as the definitive book on approximation algorithms.\NThis book has been translated into Japanese, French and Polish, and Persian and Chinese translations are forthcoming. In 2005 he initiated work on a comprehensive volume on algorithmic game theory; the co-edited volume appeared in 2007.\N]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=STU200912151900210000.000.005 See you there!]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=WOR200912011800193000.000.015 For more detailed information please visit the Spotlight website at - http://viterbi.usc.edu/students/undergrad/fye/spotlight.htm\

Dinner is provided.

RSVP to viterbi.studentservices@usc.edu with subject line: "RSVP for Spotlight on 11/17".]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=SEM200912021400150000.000.006 ABSTRACT:

A Bayesian network (BN) is a directed acyclic probabilistic graph encoding the interdependence between a set of random variables. In application to seismic risk assessment of infrastructure systems, the variables may represent uncertain demands or capacities, or the states of the system and its components. Upon entering evidence (observations) on one or more variables, this information propagates throughout the BN, thus providing an up-to-date probabilistic characterization of the system state as the available information evolves. The BN can be augmented with utility and decision nodes to provide a tool for optimal decision making under uncertain and evolving information.

This talk will demonstrate the usefulness of the BN methodology for risk assessment and management of infrastructure systems that are subject to earthquake hazard. An application to the proposed California High Speed Rail system will be presented. \N]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=WOR200912090000000000.000.017 Reservations are required for Meet USC. This program occurs twice, once at 9:00 a.m. and again at 1:00 p.m. Please visit http://www.usc.edu/admission/undergraduate/visit/meet_usc.html to check availability and make an appointment. Be sure to list an Engineering major as your "intended major" on the webform!]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=WOR200912021215133000.000.015 http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=WOR200912021245134500.000.013 http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=SEM200912030000000000.000.009 University of Delaware

Abstract:TBA]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=SEM200912031600175000.000.007 Speaker: Dr. Liang Huang
Host: Prof. Paul Rosenbloom

Abstract: A major challenge in natural language research is how to deal with ambiguity. This is because ambiguity grows *exponentially* with sentence length (for example, consider the number of interpretations of a 60-word long sentence). This suggests that the common practice of a k-best list largely under-represents the whole search space. So is there a better way to efficiently represent and exploit the vast amount of ambiguities in human languages? The answer is "packed forest", a polynomial-space data-structure for representing exponentially many trees in a compact form by sharing common substructures. In this talk, I will apply this forest idea to both machine translation and syntactic parsing. In both tasks, we show that working with a forest encoding millions of trees improves the state-of-the-art accuracies by considering many more alternatives. This results in the best parsing performance reported on the Penn Treebank. More interestingly, translating a forest of 10 millions \Ntrees is even faster than translating 30 individual trees, thanks to dynamic programming.
(This talk is intended for a general CS audience.)\N

Bio: Liang Huang is currently a Research Scientist at ISI. He received his PhD from the University of Pennsylvania in 2008, and worked as a Research Scientist at Google before moving back to ISI where he had two internships. He is mainly interested in the theoretical aspects of computational linguistics, in particular, efficient algorithms in parsing and machine translation, generic dynamic programming, and formal properties of synchronous grammars. His work received an Outstanding Paper Award at ACL 2008, and Best Paper Nominations at ACL 2007 and EMNLP 2008. He also loves teaching, and won a University \NTeaching Award at Penn in 2005. He is currently teaching CS 562, Empirical Methods in Natural Language Processing.
http://www.isi.edu/~lhuang\Nhttp://www.cis.upenn.edu/~lhuang3\N]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=SEM200912031800193000.000.005 http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=WOR200912180000000000.000.017 Reservations are required for Meet USC. This program occurs twice, once at 9:00 a.m. and again at 12:00 p.m. Please visit http://www.usc.edu/admission/undergraduate/visit/meet_usc.html to check availability and make an appointment. Be sure to list an Engineering major as your "intended major" on the webform!]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=SEM200912070000000000.000.021 http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=WOR200912090000000000.000.017 Reservations are required for Meet USC. This program occurs twice, once at 9:00 a.m. and again at 1:00 p.m. Please visit http://www.usc.edu/admission/undergraduate/visit/meet_usc.html to check availability and make an appointment. Be sure to list an Engineering major as your "intended major" on the webform!]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=WOR200912082200170000.000.015 Fall Study Day will be held on Tuesday, Dec 8th in Ronald Tutor Hall.

•10am-1pm: \NStudy sessions will be held for: \NAME 201, BME 101, EE 150, Math 125, 126, 226, and Phys 151, 152.

Upper class study partners will be on hand to answer questions.

•1pm-5pm: \NStudy space available throughout second floor of RTH

•Snacks and care packages will be provided to participants.

Just come to the lobby of RTH with your books, notes, and a desire to study for finals.

Stop by VARC, CED, or the WIE office for more information! \N]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=WOR200912090000000000.000.017 Reservations are required for Meet USC. This program occurs twice, once at 9:00 a.m. and again at 1:00 p.m. Please visit http://www.usc.edu/admission/undergraduate/visit/meet_usc.html to check availability and make an appointment. Be sure to list an Engineering major as your "intended major" on the webform!]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=SEM200912101400150000.000.006 Speaker: Dr. Geraldine Knatz, Executive Director, The Port of Los Angeles.

Women in Science & Engineering Seminar Speaker in Celebration of the WISE 10th Anniversary

Abstract:

From its early beginning as a merchant port serving the needs of Spanish traders, to what it is now – America's premier gateway for goods and services – the Port of Los Angeles has changed in many ways. Certainly, one of the major challenges is the precarious balancing act between expansion and environment. As the Port grew over the decades, so did its pollution. Lawsuits ensued, regulations changed and -- coupled with California's every-stringent criteria regarding coastal development of any kind -- the Port of Los Angeles was at an impasse between profits and pollution.

Which would ultimately win? Under the leadership of Executive Director Dr. Geraldine Knatz, the answer is both. With her background in biology and environmental studies, coupled with a pragmatic view of how the world works financially, Dr. Knatz is leading the way to create a new era in major port operations where the needs of commerce go hand-in-hand with the needs of the environment. The result is a series of operational breakthroughs that are not only improving the regional environment, but are setting new standards for port operators the world over.

Dr. Knatz will discuss these "green growth" challenges first hand and detail the specific initiatives that are making the Port of Los Angeles a true success story.

]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=STU200912101700190000.000.005 See you there!]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=WOR200912180000000000.000.017 Reservations are required for Meet USC. This program occurs twice, once at 9:00 a.m. and again at 12:00 p.m. Please visit http://www.usc.edu/admission/undergraduate/visit/meet_usc.html to check availability and make an appointment. Be sure to list an Engineering major as your "intended major" on the webform!]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=WOR200912140000000000.000.017 Reservations are required for Meet USC. This program occurs twice, once at 9:00 a.m. and again at 1:00 p.m. Please visit http://www.usc.edu/admission/undergraduate/visit/meet_usc.html to check availability and make an appointment. Be sure to list an Engineering major as your "intended major" on the webform!]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=STU200912151900210000.000.005 See you there!]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=WOR200912180000000000.000.017 Reservations are required for Meet USC. This program occurs twice, once at 9:00 a.m. and again at 12:00 p.m. Please visit http://www.usc.edu/admission/undergraduate/visit/meet_usc.html to check availability and make an appointment. Be sure to list an Engineering major as your "intended major" on the webform!]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=WOR200912230000000000.000.017 Reservations are required for Meet USC. This program occurs twice, once at 9:00 a.m. and again at 1:00 p.m. Please visit http://www.usc.edu/admission/undergraduate/visit/meet_usc.html to check availability and make an appointment. Be sure to list an Engineering major as your "intended major" on the webform!]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=WOR200912230000000000.000.017 Reservations are required for Meet USC. This program occurs twice, once at 9:00 a.m. and again at 1:00 p.m. Please visit http://www.usc.edu/admission/undergraduate/visit/meet_usc.html to check availability and make an appointment. Be sure to list an Engineering major as your "intended major" on the webform!]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=OTH201001090700100000.000.025 http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=SEM201001140000000000.000.009 Presents

Gary Pope

Abstract:TBA]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=SEM201001141600175000.000.007 http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=SEM201001191600175000.000.007 http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=SEM201001210000000000.000.007 Title: Quantitative System Design

Speaker: Prof. Mary Vernon (University of Wisconsin)

Host: Prof. Leana Golubchik]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=SEM201001240000000001.000.015 Undergraduate Viterbi students learn more about their personal leadership style, how to work in teams, and enjoy connecting with other Viterbi students in a fun, relaxed environment.

To learn more about KIUEL, visit the website at viterbi.usc.edu/KIUEL.]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=WOR201001220900160000.000.017 http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=SEM201001240000000001.000.015 Undergraduate Viterbi students learn more about their personal leadership style, how to work in teams, and enjoy connecting with other Viterbi students in a fun, relaxed environment.

To learn more about KIUEL, visit the website at viterbi.usc.edu/KIUEL.]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=SEM201001240000000001.000.015 Undergraduate Viterbi students learn more about their personal leadership style, how to work in teams, and enjoy connecting with other Viterbi students in a fun, relaxed environment.

To learn more about KIUEL, visit the website at viterbi.usc.edu/KIUEL.]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=SEM201001280000000000.000.009 Presents

Christina D. Smolke

Caltech

Abstract:TBA]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=SEM201002110000000000.000.009 Presents

Benny D. Freeman

University of Texas at Austin

Abstract:TBA]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=SEM201002111600175000.000.007 Talk title: Design and Algorithms for Modern Kidney Exchanges

Speaker: Prof. Tuomas Sandholm (Carnegie Mellon University)

Host: Prof. Milind Tambe]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=SEM201002250000000000.000.009 Presents

Z. L. Wang

Georgia Institute of Technology

Abstract:TBA]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=SEM201003021600175000.000.007 http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=SEM201003110000000000.000.009 Presents

Sally Benson

Stanford University

Abstract:TBA]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=SEM201003250000000000.000.009 Presents

Matthew DeLisa

University of Cornell

Abstract:TBA]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=SEM201004061600175000.000.007 Talk Title: "Computer science theory to support research in the information age"

Speaker: Prof. John Hopcroft - Cornell University

Hosts: Prof. Shang-Hua Teng / Prof. Michael Arbib \N]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=SEM201004080000000000.000.009 Presents

Mike Harold

University of Houston

Abstract:TBA]]> http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=SEM201005200800120000.000.024 http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=SEM201005200800120000.000.024 http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=SEM201005200800120000.000.024 http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=SEM201005200800120000.000.024 http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=SEM201006080800170000.000.024 http://viterbi.usc.edu/cgi-bin/cal_make.pl?p1=SEM201006080800170000.000.024