The votes are in! We have a winning design and color- Wanna check it out and/or request one for under $5 (It's looking like it will be around $1-2 right now)? Check it out here: tinyurl.com/cwitshirt2011 Please request on before Thursday 11/17!

Take a break from studying for a few hours and join in on some fun. We've organized a trip to Shadowland THIS FRIDAY at 8:30pm and subsidized the cost- so it will only be about $7.50 for 2 games!

If you are able to carpool, please fill out the form here: http://goo.gl/8UJfN

If you need someone to drive you, see the form results here: http://goo.gl/wTx93

Our next restaurant night will be at Ledo's! More details to come soon!

Coffee Talk: Homelessness and Hunger Panel Discussion

EE Graduate Seminar

Stochastic Graph Grammars

Prof. Tim Oates
Associate Professor of Computer Science
Computer Science and Electrical Engineering, UMBC

11:30am Friday November 11, ITE 231, UMBC

Many important domains are naturally described relationally, often using graphs in which nodes correspond to entities and edges to relations. Stochastic graph grammars compactly represent probability distributions over graphs and can be learned from data, such as a set of graphs corresponding to proteins that have the same function.

In this talk we consider the problem of learning the parameters (i.e., the production probabilities) of stochastic graph grammars and the structure of the grammar (i.e., the productions) given a representative sample of graphs taken from the underlying distribution. We also present efficient algorithms for computing properties of the distribution over graphs defined by a graph grammar such as expectations of graph size, node degree, and number of edges.

Dr. Tim Oates is an Associate Professor in the CSEE Department at UMBC. He received B.S. degrees in Computer Science and Electrical Engineering from North Carolina State University in 1989, and M.S. and PhD degrees from the Univ of Massachusetts Amherst in 1997 and 2000, respectively. Prior to coming to UMBC in Fall 2001, Prof. Oates spent a year as a postdoc in the Artificial Intelligence Lab at MIT.

Host: Prof. Joel M. Morris

EE Graduate Seminar

Stochastic Graph Grammars

Prof. Tim Oates
Associate Professor of Computer Science
Computer Science and Electrical Engineering, UMBC

11:30am Friday November 11, ITE 231, UMBC

Many important domains are naturally described relationally, often using graphs in which nodes correspond to entities and edges to relations. Stochastic graph grammars compactly represent probability distributions over graphs and can be learned from data, such as a set of graphs corresponding to proteins that have the same function.

In this talk we consider the problem of learning the parameters (i.e., the production probabilities) of stochastic graph grammars and the structure of the grammar (i.e., the productions) given a representative sample of graphs taken from the underlying distribution. We also present efficient algorithms for computing properties of the distribution over graphs defined by a graph grammar such as expectations of graph size, node degree, and number of edges.

Dr. Tim Oates is an Associate Professor in the CSEE Department at UMBC. He received B.S. degrees in Computer Science and Electrical Engineering from North Carolina State University in 1989, and M.S. and PhD degrees from the Univ of Massachusetts Amherst in 1997 and 2000, respectively. Prior to coming to UMBC in Fall 2001, Prof. Oates spent a year as a postdoc in the Artificial Intelligence Lab at MIT.

Host: Prof. Joel M. Morris

The Team for Research in Ubiquitous Secure Technology (TRUST) will sponsor 20 undergraduate students from diverse backgrounds and cultures, to participate in the Summer Undergraduate Research Experience located at TRUST partner campuses: UC Berkeley, Cornell University, Stanford University, Vanderbilt University. These students will work with graduate student and faculty mentors throughout the summer performing research and supporting activities in the area of information technology and TRUST related topics. The program will run from June 3 to July 27, 2012 and provide room and board, a travel allowance and a $4,000 stipend. Apply by February 17. See the flyer for more information and the Trust REU site for details and to apply.

The Team for Research in Ubiquitous Secure Technology (TRUST) will sponsor 20 undergraduate students from diverse backgrounds and cultures, to participate in the Summer Undergraduate Research Experience located at TRUST partner campuses: UC Berkeley, Cornell University, Stanford University, Vanderbilt University. These students will work with graduate student and faculty mentors throughout the summer performing research and supporting activities in the area of information technology and TRUST related topics. The program will run from June 3 to July 27, 2012 and provide room and board, a travel allowance and a $4,000 stipend. Apply by February 17. See the flyer for more information and the Trust REU site for details and to apply.