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…
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…
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…
Crypto-hardware design for secure applications
Erica Tena-Sánchez F. E. Potestad-Ordóñez , University of Seville – Abstract: Any electronic devices considered ‘secure’, and in fact any electronic device handling relevant information, make use of cryptographic services to ensure confidentiality, authentication and integrity of the processed data. These cryptographic engines implement mathematically…
Interactive Systems based on Electrical Muscle Stimulation
Pedro Lopes, University of Chicago – Abstract: How can interactive devices connect with users in the most immediate and intimate way? This question has driven interactive computing for decades. If we think back to the early days of computing, user and device were quite distant,…
Mathematics, Physics & Machine Learning Seminar Series (Online)
The Mathematics, Physics & Machine Learning seminar series has started on October 2020 and runs until March 2021.
The seminars aim to bring together mathematicians and physicists interested in machine learning (ML) with ML and AI experts interested in mathematics and physics, with the goal of introducing innovative Mathematics and Physics-inspired techniques in Machine Learning and, reciprocally, applying Machine Learning to problems in Mathematics and Physics.
Attendance is free but registration is required.
More information is available here.
IST /INESC-ID Distinguished Lecture – An Ethical Crisis in Computing?
Computer scientists think often of “Ender’s Game” these days. In this award-winning 1985 science-fiction novel by Orson Scott Card, Ender is being trained at Battle School, an institution designed to make young children into military commanders against an unspecified enemy. Ender’s team engages in a series of computer-simulated battles, eventually destroying the enemy’s planet, only to learn then that the battles were very real and a real planet has been destroyed.
The benefits of computing seemed intuitive to us. We truly believe that computing yields tremendous societal benefits; for example, the life-saving potential of driverless cars is enormous! Like Ender, however, we realized recently that computing is not a game–it is real–and it brings with it not only societal benefits, but also significant societal costs, such as labor polarization, disinformation, and smart-phone addiction.
The real issue is how to deal with technology’s impact on society.
Technology is driving the future, but who is doing the steering?
Moshe Y. Vardi is University Professor and the George Distinguished Service Professor in Computational Engineering at Rice University. He is the recipient of several awards, including the ACM SIGACT Goedel Prize, the ACM Kanellakis Award, the ACM SIGMOD Codd Award, the Blaise Pascal Medal, the IEEE Computer Society Goode Award, and the EATCS Distinguished Achievements Award.
He is the author and co-author of over 650 papers, as well as two books. He is a fellow of several societies, and a member of several academies, including the US National Academy of Engineering and National Academy of Science.
He holds seven honorary doctorates. He is a Senior Editor of the Communications of the ACM, the premier publication in computing.