Results 91 to 100 of about 399,469 (371)
PAIR: Reconstructing Single‐Cell Open‐Chromatin Landscapes for Transcription Factor Regulome Mapping
scATAC‐seq analysis is often constrained by limited sequencing depth, extreme sparsity, and pervasive technical missingness. PAIR is a probabilistic framework that restores scATAC‐seq accessibility profiles by directly modeling the native cell–peak bipartite structure of chromatin accessibility.
Yanchi Su +7 more
wiley +1 more source
Optimizing Dynamic Evacuation Using Mixed-Integer Linear Programming
This study presents a new approach to optimize the dynamic evacuation process through a dynamic traffic assignment model formulated using mixed-integer linear programming (MILP).
Hamoud Bin Obaid +4 more
doaj +1 more source
Buried Unstrained Germanium Channels: A Lattice‐Matched Platform for Quantum Technology
ABSTRACT Strained germanium (ε$\varepsilon$‐Ge) and strained silicon (ε$\varepsilon$‐Si) buried quantum wells have enabled advanced spin‐qubit quantum processors. However, in the absence of suitable lattice‐matched substrates, ε$\varepsilon$‐Ge and ε$\varepsilon$‐Si are deposited on defective, metamorphic SiGe buffers, which may impact device ...
Davide Costa +10 more
wiley +1 more source
A multi-step mixed integer programming heuristic for warehouse layout optimization
Warehouse layout optimization is critical to inventory and logistics management in organizations. In many instances, limited warehouse space is a constraint and a barrier to expanding operations and increasing demand.
Sanjaya Mayadunne +2 more
doaj +1 more source
On optimizing over lift-and-project closures [PDF]
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by computing all mixed integer Gomory cuts read from all tableau's corresponding
Bonami, Pierre
core +2 more sources
A Status Report on Conflict Analysis in Mixed Integer Nonlinear Programming
Mixed integer nonlinear programs (MINLPs) are arguably among the hardest optimization problems, with a wide range of applications. MINLP solvers that are based on linear relaxations and spatial branching work similar as mixed integer programming (MIP ...
A Forsgren +37 more
core +1 more source
Scenario-based cuts for structured two-stage stochastic and distributionally robust p-order conic mixed integer programs [PDF]
Manish Bansal, Yingqiu Zhang
openalex +1 more source
This study achieves the synergistic integration of self‐powered sensing and edge AI acceleration to establish a real‐time fault diagnosis system. The proposed TENG‐based self‐powered bearing sensor (NSE‐TBS) and FPGA‐accelerated edge AI framework fundamentally break through the inherent limitations of conventional monitoring systems, including complex ...
Kehui Zhu +7 more
wiley +1 more source
Some lower bounds on sparse outer approximations of polytopes [PDF]
Motivated by the need to better understand the properties of sparse cutting-planes used in mixed integer programming solvers, the paper [2] studied the idealized problem of how well a polytope is approximated by the use of sparse valid inequalities.
Dey, Santanu S. +2 more
core
Conformal Reconfigurable Intelligent Surfaces: A Cylindrical Geometry Perspective
Cylindrical reconfigurable intelligent surfaces are explored for low‐complexity beam steering using one‐bit meta‐atoms. A multi‐level modeling approach, including optimization‐based synthesis, demonstrates that even minimal hardware can support directive scattering.
Filippo Pepe +4 more
wiley +1 more source

