SearcharxivSearch

arXiv subjects

Suhyun Park

Publications and source records attributed to Suhyun Park.

3 recordsLinked to original sources

Peptide Structure Prediction Using Counter-Diabatic Quantum Approximate Optimization Algorithm (CD-QAOA)

In this study, we predicted the structure of the heptapeptide APRLRFY, a neuropeptide sequence, on a tetrahedral lattice using a Quantum Approximate Optimization Algorithm (QAOA). QAOA is based on the adiabatic approximation and has been successfully applied to a wide range of optimization problems. However, relatively slow convergence during ground-state searches has frequently been reported. To overcome this limitation, we employed the Counter-Diabatic Quantum Approximate Optimization Algorithm (CD-QAOA), which introduces an additional counter-diabatic driving term into the adiabatic framework to accelerate convergence toward the ground state during peptide structure prediction. In the heptapeptide structure prediction, intermolecular interactions were modeled using two different approaches. In the first approach, only the interaction between the second residue, proline (P), and the seventh residue, tyrosine (Y), was included in the optimization. In the second approach, all residue-residue interactions within the heptapeptide were modeled using the Miyazawa-Jernigan (MJ) interaction matrix. To validate the peptide structures predicted using CD-QAOA, we additionally employed several classical computational methods, including quantum chemistry-based Hartree-Fock (HF) calculation and Density Functional Theory (DFT) calculation, conventional molecular dynamics (MD) simulation, and Hamiltonian replica exchange molecular dynamics (H-REMD) simulation. The structural similarities among the conformations obtained from these different approaches were systematically analyzed. CD-QAOA is highly effective for predicting the structures of short peptides. In particular, we demonstrate that a quantum-classical hybrid framework can significantly improve both the efficiency and accuracy of peptide structure prediction.

q-bio.BM

CoCreatAR: Enhancing Authoring of Outdoor Augmented Reality Experiences Through Asymmetric Collaboration

Authoring site-specific outdoor augmented reality (AR) experiences requires a nuanced understanding of real-world context to create immersive and relevant content. Existing ex-situ authoring tools typically rely on static 3D models to represent spatial information. However, in our formative study (n=25), we identified key limitations of this approach: models are often outdated, incomplete, or insufficient for capturing critical factors such as safety considerations, user flow, and dynamic environmental changes. These issues necessitate frequent on-site visits and additional iterations, making the authoring process more time-consuming and resource-intensive. To mitigate these challenges, we introduce CoCreatAR, an asymmetric collaborative mixed reality authoring system that integrates the flexibility of ex-situ workflows with the immediate contextual awareness of in-situ authoring. We conducted an exploratory study (n=32) comparing CoCreatAR to an asynchronous workflow baseline, finding that it enhances engagement, creativity, and confidence in the authored output while also providing preliminary insights into its impact on task load. We conclude by discussing the implications of our findings for integrating real-world context into site-specific AR authoring systems.

cs.HC

Reinforcement Learning of Graph Neural Networks for Service Function Chaining

In the management of computer network systems, the service function chaining (SFC) modules play an important role by generating efficient paths for network traffic through physical servers with virtualized network functions (VNF). To provide the highest quality of services, the SFC module should generate a valid path quickly even in various network topology situations including dynamic VNF resources, various requests, and changes of topologies. The previous supervised learning method demonstrated that the network features can be represented by graph neural networks (GNNs) for the SFC task. However, the performance was limited to only the fixed topology with labeled data. In this paper, we apply reinforcement learning methods for training models on various network topologies with unlabeled data. In the experiments, compared to the previous supervised learning method, the proposed methods demonstrated remarkable flexibility in new topologies without re-designing and re-training, while preserving a similar level of performance.

cs.AI