Puffer and porcupine fishes (families Diodontidae and Tetraodontidae, order Tetradontiformes) are known for their extraordinary ability to triple their body size by swallowing and retaining large amounts of seawater in their accommodating stomachs. This inflation mechanism provides a defence to predation; however, it is associated with the secondary loss of the stomach's digestive function. Ingestion of alkaline seawater during inflation would make acidification inefficient (a potential driver for the loss of gastric digestion), paralleled by the loss of acid–peptic genes. We tested the hypothesis of stomach inflation as a driver for the convergent evolution of stomach loss by investigating the gastric phenotype and genotype of four distantly related stomach inflating gnathostomes: sargassum fish, swellshark, bearded goby and the pygmy leatherjacket. Strikingly, unlike in the puffer/porcupine fishes, we found no evidence for the loss of stomach function in sargassum fish, swellshark and bearded goby. Only the pygmy leatherjacket (Monochanthidae, Tetraodontiformes) lacked the gastric phenotype and genotype. In conclusion, ingestion of seawater for inflation, associated with loss of gastric acid secretion, is restricted to the Tetraodontiformes and is not a selective pressure for gastric loss in other reported gastric inflating fishes.
more »
« less
Scheduling Dosage of Proton Pump Inhibitors Using Constrained Optimization With Gastric Acid Secretion Model
Dosage schedule of the Proton Pump Inhibitors (PPIs) is critical for gastric acid disorder treatment. In this paper, we develop a constrained optimization based approach for scheduling the PPIs dosage. In particular, we exploit a mathematical prediction model describing the gastric acid secretion, and use it within the optimization algorithm to predict the acid level. The dosage of the PPIs which is used to enforce acid level constraints is computed by solving a constrained optimization problem. Simulation results show that the proposed approach can successfully suppress the gastric acid level with less PPIs intake compared with the conventional fixed PPIs dosage regimen, which may reduce the long-term side effects of the PPIs.
more »
« less
- Award ID(s):
- 1904394
- PAR ID:
- 10521467
- Publisher / Repository:
- IFAC
- Date Published:
- Journal Name:
- IFAC-PapersOnLine
- Volume:
- 56
- Issue:
- 2
- ISSN:
- 2405-8963
- Page Range / eLocation ID:
- 6465 to 6470
- Subject(s) / Keyword(s):
- Decision support and control control of physiological and clinical variables gastric acid disorder treatment Proton Pump Inhibitors
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
The COVID-19 pandemic caused by SARS-CoV-2 has emphasized the importance of studying virus-host protein-protein interactions (PPIs) and drug-target interactions (DTIs) to discover effective antiviral drugs. While several computational algorithms have been developed for this purpose, most of them overlook the interplay pathways during infection along PPIs and DTIs. In this paper, we present a novel multipartite graph learning approach to uncover hidden binding affinities in PPIs and DTIs. Our method leverages a comprehensive biomolecular mechanism network that integrates protein-protein, genetic, and virus-host interactions, enabling us to learn a new graph that accurately captures the underlying connected components. Notably, our method identifies clustering structures directly from the new graph, eliminating the need for post-processing steps. To mitigate the detrimental effects of noisy or outlier data in sparse networks, we propose a robust objective function that incorporates the L2,p-norm and a constraint based on the pth-order Ky-Fan norm applied to the graph Laplacian matrix. Additionally, we present an efficient optimization method tailored to our framework. Experimental results demonstrate the superiority of our approach over existing state-of-the-art techniques, as it successfully identifies potential repurposable drugs for SARS-CoV-2, offering promising therapeutic options for COVID-19 treatment.more » « less
-
In this paper, we focus on simple bilevel optimization problems, where we minimize a convex smooth objective function over the optimal solution set of another convex smooth constrained optimization problem. We present a novel bilevel optimization method that locally approximates the solution set of the lower-level problem using a cutting plane approach and employs an accelerated gradient-based update to reduce the upper-level objective function over the approximated solution set. We measure the performance of our method in terms of suboptimality and infeasibility errors and provide non-asymptotic convergence guarantees for both error criteria. Specifically, when the feasible set is compact, we show that our method requires at most (max{1/ϵf‾‾√,1/ϵg}) iterations to find a solution that is ϵf-suboptimal and ϵg-infeasible. Moreover, under the additional assumption that the lower-level objective satisfies the r-th Hölderian error bound, we show that our method achieves an iteration complexity of (max{ϵ−2r−12rf,ϵ−2r−12rg}), which matches the optimal complexity of single-level convex constrained optimization when r=1.more » « less
-
Multi-objective Bayesian optimization has been widely adopted in scientific experiment design, including drug discovery and hyperparameter optimization. In practice, regulatory or safety concerns often impose additional thresholds on certain attributes of the experimental outcomes. Previous work has primarily focused on constrained single-objective optimization tasks or active search under constraints. The existing constrained multi-objective algorithms address the issue with heuristics and approximations, posing challenges to the analysis of the sample efficiency. We propose a novel constrained multi-objective Bayesian optimization algorithm COMBOO that balances active learning of the level-set defined on multiple unknowns with multi-objective optimization within the feasible region. We provide both theoretical analysis and empirical evidence, demonstrating the efficacy of our approach on various synthetic benchmarks and real-world applications.more » « less
-
Uncertainties from deepening penetration of renewable energy resources have posed critical challenges to the secure and reliable operations of future electric grids. Among various approaches for decision making in uncertain environments, this paper focuses on chance-constrained optimization, which provides explicit probabilistic guarantees on the feasibility of optimal solutions. Although quite a few methods have been proposed to solve chance-constrained optimization problems, there is a lack of comprehensive review and comparative analysis of the proposed methods. We first review three categories of existing methods to chance-constrained optimization: (1) scenario approach; (2) sample average approximation; and (3) robust optimization based methods. Data-driven methods, which are not constrained by any particular distributions of the underlying uncertainties, are of particular interest. Key results of the analytical reformulation approach for specific distributions are briefly discussed. We then provide a comprehensive review on the applications of chance-constrained optimization in power systems. Finally, this paper provides a critical comparison of existing methods based on numerical simulations, which are conducted on standard power system test cases.more » « less
An official website of the United States government

