Results 81 to 90 of about 15,952 (266)
A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs [PDF]
We present a coordinate ascent method for a class of semidefinite programming problems that arise in non-convex quadratic integer optimization. These semidefinite programs are characterized by a small total number of active constraints and by low-rank constraint matrices.
Buchheim, Christoph +2 more
openaire +2 more sources
We retrospectively analyzed clinical data from patients who underwent hepatectomy for hepatocellular carcinoma (HCC) using LCA‐based grading system. These findings provide a new risk stratification framework for the design of precision surgery to treat patients with HCC.
Ling Liu +5 more
wiley +1 more source
Robust stabilization of discrete model-reference control systems on integer grid coordinates [PDF]
This paper describes a robust stabilization problem of discrete model-reference control systems on integer grid coordinates. Currently, all feedback control systems are realized using discretized signals. However, the analysis and design of discrete-time and discrete-value (point-to-point) control systems has not been established.
openaire +1 more source
A multiscale Bayesian optimization framework for process and material codesign
Abstract The simultaneous design of processes and enabling materials such as solvents, catalysts, and adsorbents is challenging because molecular‐ and process‐level decisions are strongly interdependent. Sequential approaches often yield suboptimal results since improvements in material properties may not translate into superior process performance. We
Michael Baldea
wiley +1 more source
Counting rational points on quadric surfaces
Counting rational points on quadric surfaces, Discrete Analysis 2018:15, 29 pp. A _quadric hypersurface_ of dimension $D$ is the zero set of a quadratic form $Q$ in $D+2$ variables. If $Q(x_1,\dots,x_{D+2})=0$, then $Q(\lambda x_1,\dots,\lambda x_{D+2})=
Tim Browning, Roger Heath-Brown
doaj +1 more source
Graph‐based imitation and reinforcement learning for efficient Benders decomposition
Abstract This work introduces an end‐to‐end graph‐based agent for accelerating the computational efficiency of Benders Decomposition. The agent's policy is parameterized by a graph neural network, which takes as input a bipartite graph representation of the master problem and proposes a candidate solution.
Bernard T. Agyeman +3 more
wiley +1 more source
Domain‐Aware Implicit Network for Arbitrary‐Scale Remote Sensing Image Super‐Resolution
Although existing arbitrary‐scale image super‐resolution methods are flexible to reconstruct images with arbitrary scales, the characteristic of training distribution is neglected that there exists domain shift between samples of various scales. In this work, a Domain‐Aware Implicit Network (DAIN) is proposed to handle it from the perspective of domain
Xiaoxuan Ren +6 more
wiley +1 more source
Machine learning predicts activation energies for key steps in the water‐gas shift reaction on 92 MXenes. Random Forest is identified as the most accurate model. Reaction energy and reactant LogP emerge as key descriptors. The approach provides a predictive framework for catalyst design, grounded in density functional theory data and validated through ...
Kais Iben Nassar +3 more
wiley +1 more source
Titanium silicalite‐1 (TS‐1), used in industrial selective oxidation processes, depends on specific, yet still unresolved Ti sites, dispersed within the framework of an MFI‐zeolite. Applying high field (28.2 T) 47/49Ti NMR and 17O NMR spectroscopy for an array of TS‐1 catalysts enables the development of an NMR crystallography protocol and the ...
Christoph J. Kaul +14 more
wiley +2 more sources

