Adaptive Cloud Application Tuning with Enhanced Structural Bayesian Optimization

Author(s):  
Yuankun Shi ◽  
Ziyang Peng ◽  
Ren Wang ◽  
Zhaojuan Bian
2020 ◽  
Author(s):  
Jon Uranga ◽  
Lukas Hasecke ◽  
Jonny Proppe ◽  
Jan Fingerhut ◽  
Ricardo A. Mata

The 20S Proteasome is a macromolecule responsible for the chemical step in the ubiquitin-proteasome system of degrading unnecessary and unused proteins of the cell. It plays a central role both in the rapid growth of cancer cells as well as in viral infection cycles. Herein, we present a computational study of the acid-base equilibria in an active site of the human proteasome, an aspect which is often neglected despite the crucial role protons play in the catalysis. As example substrates, we take the inhibition by epoxy and boronic acid containing warheads. We have combined cluster quantum mechanical calculations, replica exchange molecular dynamics and Bayesian optimization of non-bonded potential terms in the inhibitors. In relation to the latter, we propose an easily scalable approach to the reevaluation of non-bonded potentials making use of QM/MM dynamics information. Our results show that coupled acid-base equilibria need to be considered when modeling the inhibition mechanism. The coupling between a neighboring lysine and the reacting threonine is not affected by the presence of the inhibitor.


2021 ◽  
pp. 027836492110333
Author(s):  
Gilhyun Ryou ◽  
Ezra Tal ◽  
Sertac Karaman

We consider the problem of generating a time-optimal quadrotor trajectory for highly maneuverable vehicles, such as quadrotor aircraft. The problem is challenging because the optimal trajectory is located on the boundary of the set of dynamically feasible trajectories. This boundary is hard to model as it involves limitations of the entire system, including complex aerodynamic and electromechanical phenomena, in agile high-speed flight. In this work, we propose a multi-fidelity Bayesian optimization framework that models the feasibility constraints based on analytical approximation, numerical simulation, and real-world flight experiments. By combining evaluations at different fidelities, trajectory time is optimized while the number of costly flight experiments is kept to a minimum. The algorithm is thoroughly evaluated for the trajectory generation problem in two different scenarios: (1) connecting predetermined waypoints; (2) planning in obstacle-rich environments. For each scenario, we conduct both simulation and real-world flight experiments at speeds up to 11 m/s. Resulting trajectories were found to be significantly faster than those obtained through minimum-snap trajectory planning.


Author(s):  
Lincan Fang ◽  
Esko Makkonen ◽  
Milica Todorović ◽  
Patrick Rinke ◽  
Xi Chen

Sign in / Sign up

Export Citation Format

Share Document