Constrained counting is a fundamental problem in artificial intelligence, with applications in probabilistic reasoning, inexact computing, and statistical physics. In today’s episode, we will learn about research at Rice which studies how graph decompositions and tensor network contraction can be used to solve constrained counting problems. Jeff Dudek is a Rice Ph.D. student working in the field of machine learning with Professor Moshe Vardi.  For more information, please visit CS. Rice.edu

The nested kernel architecture is a new OS organization that provides important security benefits to commodity operating systems that was retrofitted to an existing monolithic kernel. We will learn how the nested kernel architecture can efficiently support useful write-mediation policies, such as write-once and append-only, which OS developers can use to incorporate new security policies with very low performance overheads. Our guest today is Dr. Nathan Dautenhahn. More information: cs.rice.edu