Enabling legged robots to perform acrobatic maneuvers   Professor Hae-Won Park’s research team has designed a novel control algorithm that will enable acrobatic maneuvers by legged robots in three-dimensional (3D) space by utilizing Lie group theory. This result was published in the 2020 International Conference on Intelligent Robots and Systems (IROS) Proceedings, and the team won the Ro...

Development of efficient and stable double layer tandem solar cells   An international research team has developed efficient and stable perovskite-silicon tandem solar cells via an anion-engineering method.   Article | Spring 2021     New emerging perovskite solar cells convert light into energy, but they can be inefficient and vulnerable to the environment, degrading with, ironically, too...

Mobile Clinic Module: Inflatable Isolation Ward for Infectious Disease Patients   A Mobile Clinic Module (MCM) is a negative pressure isolation ward that can be effectively transported, built, and stored in a short period of time. Through a combination of air tents, frames, and functional panels, it is possible to rapidly build various medical facilities in an infectious disease outbreak.   Article ...

  Revamping Storage Class Memory with a Hardware-Automated Memory-over-Storage Solution   Hardware-Automated Memory-over-Storage serves terabyte-scale memory size and persistency by aggregating the storage capacities of non-volatile memory and high-performance SSD (Solid-state drive) into a single large memory space. It is likely to meet HPC (High-performance computer)’s expectations for high...

  T-GPS: Trillion-scale Graph Processing Simulation in a Single Computer   Graph processing simulation is a new technological concept that enables a graph processing engine to process a graph algorithm on a large-scale graph without storing the graph in the main memory or disks. It can process a graph having a trillion edges only using a single computer.   Article | Fall 2021     Gra...

One-size-fits-all memory recycling algorithm for parallel programming   PEBR (Pointer- and Epoch-Based Reclamation) is a new memory recycling algorithm for parallel programming that satisfies all the desired properties for the first time: it is fast, robust, compact, self-contained, and widely applicable.   Article | Fall 2021     Multi-core processors are widely deployed in modern compute...