Socially Competent Robot Navigation
Chris Mavrogiannis, Cornell University – Abstract: Crowded human environments such as pedestrian scenes constitute challenging domains for mobile robots, for a variety of reasons including the heterogeneity of pedestrians’ decision making mechanisms, the lack of universal formal rules regulating traffic, the lack of channels of…
From Runtime Failures to Patches: Study of Patch Generation in Production
Thomas Durieux, INRIA – Abstract: Patch creation is one of the most important actions in the life cycle of an application. Creating patches is a time-consuming task. Not only because it is difficult to create a sound and valid patch, but also because it requires…
Personalizing Personal Robots
Dan Grollman, Misty Robotics – Abstract: In this talk I’ll present some ideas on how to make your robot truly your own. Beyond sensing, thinking, and acting, robots need to feel and express their own unique interpretation of the world around them, and adapt themselves…
Timely, Reliable, and Cost-Effective Internet Transport Service using Structured Overlay Networks
Yair Amir, Johns Hopkins University – Abstract: Emerging applications such as remote manipulation and remote robotic surgery require communication that is both timely and reliable, but the Internet natively supports only communication that is either completely reliable with no timeliness guarantees (e.g. TCP) or timely…
Artificial sociality- modelling the social mind
Gert Jan Hofstede, Wageningen Universiteit – Abstract: Gert Jan will discuss ‘artificial sociality’, the subject for which he was recently appointed professor. It is about foundational conceptual models of human sociality based on social science, for use in agent-based models of complex systems in the…
HOOVER: Distributed, Flexible, and Scalable Streaming Graph Processing on OpenSHMEM
Max Grossman, RICE UNIVERSITY – Abstract: Many problems can benefit from being phrased as a graph processing or graph analytics problem: infectious disease modeling, insider threat detection, fraud prevention, social network analysis, and more. These problems all share a common property: the relationships between entities…
On the Self in Selfie
Christoph Kirsch, University of Salzburg – Abstract: Selfie is a self-contained 64-bit, 10-KLOC implementation of (1) a self-compiling compiler written in a tiny subset of C called C* targeting a tiny subset of 64-bit RISC-V called RISC-U, (2) a self-executing RISC-U emulator, (3) a self-hosting…
The Future of Cyber-autonomy
David Brumley, Carnegie Mellon University – Abstract: My vision is to automatically check and defend the world’s software from exploitable bugs. In order to achieve this vision, I am building technology, called Mayhem, that shifts the attack/defend game away from the current manual approaches for…
Improved Maximum Likelihood Decoding using sparse Parity-Check Matrices
Tobias Dietz, Technische Universität Kaiserslautern – Abstract: Maximum-likelihood decoding is an important and powerful tool in communications to obtain the optimal performance of a channel code. Unfortunately, simulating the maximum-likelihood performance of a code is a hard problem whose complexity grows exponentially with the blocklength…
Efficient paths in ordinal weighted graphs
Luca Schafer, Technische Universität Kaiserslautern – Abstract: We investigate the single-source-single-destination “shortest” paths problem in acyclic graphs with ordinal weighted arc costs. We define the concepts of ordinal dominance and efficiency for paths and their associated ordinal levels, respectively. Further, we show that the number…
