Search NASA⌕ Search

Engineering topics

Rubel, Oliver

Publications and source records attributed to Rubel, Oliver.

Rotational Dynamics and Transition Mechanisms of Surface-Adsorbed Proteins

Assembly of biomolecules at solid-water interfaces requires molecules to traverse complex orientation-dependent energy landscapes through processes that are poorly understood, largely due to the dearth of in-situ single molecule measurements and statistical analyses of the rotational dynamics that define directional selection. Emerging capabilities in high-speed atomic force microscopy and machine learning have allowed us to directly determine the orientational energy landscape and observe and quantify the rotational dynamics for protein nanorods on the surface of muscovite mica under a variety of conditions. Comparisons with kinetic Monte Carlo simulations show that the transition rates between adjacent orientation-specific energetic minima can largely be understood through traditional models of in-plane Brownian rotation across a biased energy landscape, with resulting transition rates that are exponential in the energy-barriers between states. However, transitions between more distant angular states are decoupled from barrier height, with jump-size distributions showing a power-law decay that is characteristic of a non-classical Levy-flight random walk, indicating that large jumps are enabled by alternative modes of motion via activated states. The findings provide new insights into the dynamics of biomolecules at solid-liquid interfaces that lead to self-assembly, epitaxial matching and other orientationally anisotropic outcomes and define a general procedure for exploring such dynamics with implications for hybrid biomolecular-inorganic materials design.

Orientational energy landscapes, Rotational dynami↗

Optimization and Augmentation for Data Parallel Contour Trees

Contour trees are used for topological data analysis in scientific visualization. While originally computed with serial algorithms, recent work has introduced a vector-parallel algorithm. Furthermore, this algorithm is relatively slow for fully augmented contour trees which are needed for many practical data analysis tasks. We therefore introduce a representation called the hyperstructure that enables efficient searches through the contour tree and use it to construct a fully augmented contour tree in data parallel, with performance on average 6 times faster than the state-of-the-art parallel algorithm in the TTK topological toolkit.

97 MATHEMATICS AND COMPUTING↗