21.06.2014 Views

Annual Report 2008.pdf - SAMSI

Annual Report 2008.pdf - SAMSI

Annual Report 2008.pdf - SAMSI

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Jennifer Hoeting<br />

Colorado State Univeristy<br />

jah@lamar.colostate.edu<br />

“Bayesian Hierarchical Modeling”<br />

In this talk I will introduce the fundamentals of Bayesian hierarchical models. I will overview<br />

Markov chain Monte Carlo methods used for estimation in Bayesian statistics. I will also discuss<br />

the incorporation of mathematical (process) models into the hierarchy. Examples will be based<br />

on ecological problems. If time permits, more complex hierarchical models will be discussed.<br />

Ali Jadbabaie<br />

University of Pennsylvania<br />

jadbabai@seas.upenn.edu<br />

“From Distributed Coordination and Consensus in Multi-agent Systems to Coverage in Mobile<br />

sensor Networks”<br />

In this talk we provide a unified view of several distributed coordination and consensus<br />

algorithms which have appeared in various disciplines such as distributed systems, statistical<br />

physics, biology, computer graphics, robotics, and control theory over the past decade.<br />

These algorithms have been proposed as a mechanism for demonstrating emergence of a global<br />

collective behavior (such as social aggregation in animals, schooling, flocking and<br />

synchronization) using purely local interactions. Utilizing tools from spectral graph theory and<br />

control and dynamical systems, we provide an analysis of these algorithms. Next, we extend our<br />

results from graphs to simplicial complexes (objects of study in algebraic topology) to verify<br />

coverage in mobile sensor networks in a purely decentralized fashion. Simplicial complexes are<br />

combinatorial objects that generalize the proximity graphs formed from binary relations<br />

between agents to higher order relations, and their study will allow us to infer the coverage<br />

properties of mobile sensor networks with time-varying interconnections without localization.<br />

The proposed approach is based on distributed computation of sparse generators of homology<br />

groups of simplicial complexes using higher order Laplacian operators.<br />

Bill Kaiser<br />

University of California, Los Angeles<br />

kaiser@ee.ucla.edu<br />

“Sensor Network Platforms for Rapidly Deployable, Configurable, and Sustainable<br />

Observatories”<br />

Progress in the collaborative development of environmental science and sensor network<br />

technology has revealed previously unanticipated, critical demands and constraints along with<br />

new applications and results. This has led to the development of a new architecture that has now<br />

been proven in terrestrial ecosystem and water resource monitoring. First, ecological applications<br />

of sensor network systems require high precision sensor and instrument systems. For example,

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!