Addressing failures in wireless sensor networks

Krasimira Kapitanova
University of Virginia

1:00pm Wednesday 28 March, 2012, ITE 325b, UMBC

Wireless sensor networks are now being used for a growing number of applications, from mission critical applications, including fire-fighting, emergency response, infrastructure monitoring, and medical application, to smart home applications, such as home automation, energy efficiency, and home security. These applications must operate reliably and continuously due to the high costs associated with system failure and maintenance. However, continuous and reliable operation of sensor networks is notoriously difficult to guarantee due to hardware degradation and environmental changes, which can cause operating conditions that were impossible for the original system designers to foresee. Recent studies have found that low-cost sensors suffer from many types of faults. Inexpensive nodes can break and battery-powered nodes lose power. Furthermore, sensor network installations suffer from a large number of non-fail-stop faults in which the sensor does not completely fail. Instead, it continues to report values, but the meaning of the values changes or becomes invalid. This talk will discuss a number of new run-time techniques that use application-level semantics to detect, assess, and adapt to sensor node failures.

Krasimira Kapitanova is a PhD candidate of Computer Science at the University of Virginia. Her research focuses on wireless sensor network, in particular using formal approaches for event description and detection. She is also interested in how testing and machine learning techniques can be used to improve the reliability of sensor network applications.

Host: Tim Finin

Full Title: UMBC Falls to Rhode Island, 9-1, on Third Day of UMBC Spring Classic

Suffix trees for very large strings

Dr. Marina Barsky
University of Illinois at Urbana-Champaign

1:00pm Friday, 30 March 2012, ITE 325b, UMBC

The seminar is dedicated to the construction of suffix trees in external memory. A suffix tree is a compact index of all substrings of a given text. While being asymptotically linear in the size of the input, in practice, suffix trees can easily be 50 times larger than the input. As such, suffix trees often exceed typical main memory sizes, even when the input does not. As most existing algorithms are designed for RAM, their performance severely degrades when the tree and/or input do not fit in main memory. So far, this has prevented the wide application of suffix trees for the analysis of massive string collections.

We will look at new advanced methods of suffix tree construction which circumvent memory concerns and allow us to construct suffix trees for inputs of any size using secondary storage (magnetic disks). We will also discuss how this disk-based index can be used for facilitating the pattern discovery in sequential data.

Dr. Marina Barsky is currently a Post-Doctoral fellow in the Department of Computer Science at the University of Illinois at Urbana-Champaign, IL. She received her PhD in Computer Science from the University of Victoria, British Columbia, Canada in 2010. A large part of her post-graduate research was dedicated to pattern discovery in string data, primarily in massive DNA databases. She is currently expanding her expertise in database systems to new areas such as index management and data mining. Her research interests include data mining of sequential data, information networks, and teaching of computer science through interactive interfaces.

Host: Richard Chang

viviandnguyen:

One and a half songs of fun. at UMBC. (March)

This was a great night!

UMBC students from  SOCY/HAPP 354, “The Social Basis of Community and Public Health,” regularly visit Baltimore’s Port Discovery Children’s Museum to discuss health issues with young visitors (ages 2-10) and their families. This semester, the students shared public health messages at Port Discovery’s March 3rd “Healthy First Saturday” (photos now online).

The course, taught by Andrea Kalfoglou, is part of UMBC’s Health Administration and Policy Program. It explores the history, major concepts and practice of public health in the U.S and abroad. Students also learn about health disparities and how government, the private sector, NGOs and social entrepreneurs address public health needs.

March 15, 2012
TO:  The UMBC Community
FR:  Freeman Hrabowski, President and Philip Rous, Provost
RE:   Your Support Vital for Higher Education Budget

As the Maryland General Assembly works to address a $1-billion State budget gap, legislators are considering a number of budget plans that would reduce Governor O’Malley’s proposed budget for the University System of Maryland (USM) and negatively impact USM campuses.  Budget cuts currently proposed for the System range from $5.3 million to nearly $20 million.

It is vital that faculty, staff, students, and alumni take time to urge legislators to continue the strong support they have shown higher education in the past.  Approving the Governor’s proposed budget for the USM would provide new resources enabling USM campuses to limit the FY-2013 tuition increase for in-state, undergraduate students to 3 percent.  At a time when budget cuts in many other states are forcing public campuses to raise tuition 10 to 15 percent, this support for higher education is exceptional.

Please email your legislators and urge their support for the Governor’s budget and access to high-quality, public higher education.  Go to: http://capwiz.com/usmd/home.  Click “Elected Officials” on the red tab at the top of the page to find your legislators.  Click “Take Action” in the middle of the page to compose a letter using the text provided by USM.

Thank you.