MOTIVATION Computationally generated non-native protein structure conformations (or decoys) are often used for designing protein folding simulation methods and force fields. However, almost all the decoy sets currently used in literature suffer from uneven root mean square deviation (RMSD) distribution with bias to non-protein like hydrogen-bonding and compactness patterns. Meanwhile, most prot...

Motivation: Computationally generated non-native protein structure conformations (or decoys) are often used for designing protein folding simulation methods and force fields. However, almost all the decoy sets currently used in literature suffer from uneven root mean square deviation (RMSD) distribution with bias to non-protein like hydrogen-bonding and compactness patterns. Meanwhile, most pro...

Consider a sequence of Riemannian manifolds $(M^n_i,g_i)$ with scalar curvatures and entropies bounded below by small constants $R_i,\mu_i \geq-\epsilon_i$. The goal this paper is to understand notions convergence the structure limits for such spaces. Even in seemingly rigid case $\epsilon_i\to 0$, we construct examples showing that may converge wildly Gromov-Hausdorff or Intrinsic Flat sense. ...

In this paper, the notions of countable S∗-compactness is introduced in L-topological spaces based on the notion of S∗-compactness. An S∗-compact L-set is countably S∗-compact. If L = [0, 1], then countable strong compactness implies countable S∗-compactness and countable S∗-compactness implies countable F-compactness, but each inverse is not true. The intersection of a countably S∗-compact L-s...