Bren Chair and Professor of Computer Science Ramesh Jain co-authored a book with former Ph.D. student Vivek Singh titled Situation Recognition Using EventShop. Published in May 2016 by Springer International Publishing, the 140-page book presents a framework for converting multitudes of data streams into actionable insights based on situation recognition by using an open-source, web-based system called EventShop that doesn’t require programming expertise. According to the authors, the book is useful for both practitioners and researchers working in situation-aware computing: “It acts as a primer for data-enthusiasts and information professionals interested in harnessing the value of heterogeneous big data for building diverse situation-based applications. It also can be used as a reference text by researchers working in areas as varied as database design, multimodel concept recognition, and middle-ware and ubiquitous computing to design and develop frameworks that allow users to create their own situation recognition frameworks.”
Archives for August 2016
Chancellor’s Professor of Computer Science David Eppstein was awarded two National Science Foundation (NSF) grants totaling $575,881 in support of his research projects “Collaborative Research: Efficient Algorithms for Cycles on Surfaces” and “Sparse Geometric Graph Algorithms.” The grant period for both projects is set to run between August 2016 and July 2019.
Many real-world problems can be modeled by geometric graphs. For instance, road networks may be represented by vertices as intersections or junctions of roads, while the edges represent the segments of road between two consecutive intersections. Eppstein’s research will cover a broad range of topics within computational geometry and graph algorithms. Eppstein is the sole PI for both NSF projects, which will work to solve common real-world problems in graph applications. “Collaborative Research: Efficient Algorithms for Cycles on Surfaces” will focus on developing accurate and efficient methods for simplifying surfaces related to “cut-graph” problems, as well as for other closely related complications. “Sparse Geometric Graph Algorithms” will concentrate on issues related to geometric graphs, such as the large collection of problems from application areas where sparse geometric graphs naturally arise.