A kinetic priority queue is a kinetic data structure which determines the largest element in a collection of continuously changing numbers subject to insertions and deletions. Due to its importance, many different constructions have been suggested in the literature, each with its pros and cons. We propose a simple construction that takes advantage of randomization to achieve optimal locality an...

This talk is concerned with decentralized control problems and their optimal solutions. Such problems are increasingly important, especially in the context of networked control systems. In this talk, we first provide a brief review on information structures in decentralized control, and their characterization and comparison. We establish the connections with classical stochastic control problem...

The cubic oxyhydride perovskite BaTiO3−xHx, where the well-known ferroelectric oxide BaTiO3 is partially hydridized, exhibits a variety of functions such as being catalyst and precursor for synthesis mixed-anion compounds by utilizing labile nature hydride anions. In this study, we present hexagonal version, BaTi(O3−xHx) (x < 0.6) with 6H-type structure, synthesized topochemical reaction usi...