Results 181 to 190 of about 29,758 (265)
Robust biexciton preparation for entangled photon-pair generation by single-shot Floquet driving. [PDF]
Yan JY +14 more
europepmc +1 more source
High‐Q superscar modes in growth‐defined triangular GaN micro‐prism resonators enable strong exciton–photon coupling and room‐temperature polariton condensation, offering a scalable platform for integrated III‐nitride polariton devices. ABSTRACT Group III‐nitride semiconductors are regarded as key materials for realizing polariton devices operating at ...
Chan‐Young Sung +4 more
wiley +1 more source
ABSTRACT In the present investigation, a mathematical model with vaccination, treatment, and environmental impact under real data is presented. Initially, we present the model without any interventions, followed by an examination of its equilibrium points.
Bashir Al‐Hdaibat +4 more
wiley +1 more source
Linear Mechatronic Modeling of Rectangular Tank Sloshing Dynamics
ABSTRACT Sloshing dynamics in partially filled tanks can strongly influence system‐level behavior when fluid motion couples with rigid‐body dynamics. This paper presents a linear and acausal two‐dimensional sloshing model for rectangular tanks, based on the reformulation of established sloshing theory within a modular, multi‐domain modeling framework ...
Magnus Steinstø, Eilif Pedersen
wiley +1 more source
Branch‐and‐Cut POPMUSIC for the Electric Vehicle Routing Problem With Time Windows
ABSTRACT Advancements in computer hardware and commercial software have enabled the use of branch‐and‐cut (BC) methodologies to address medium‐scale vehicle routing problems (VRPs). Despite the introduction of efficient heuristics in the literature, tailoring these approaches to suit various VRP variants, such as the electric vehicle routing problem ...
Lelisa Kebena Bijiga +2 more
wiley +1 more source
A Supervised Learning Framework for Accelerating Solvers and Metaheuristics in Routing Problems
ABSTRACT Routing problems such as the traveling salesman problem (TSP) and the capacitated vehicle routing problem (CVRP) are computationally challenging due to the exponential growth of their feasible solution spaces with increasing instance size.
Johannes Gückel +2 more
wiley +1 more source
ABSTRACT The Traveling Salesman problem with pickup, delivery, and ride‐time constraints (TSPPD‐RT) requires a depot‐based vehicle to visit multiple known requests. Each request specifies a pickup vertex, corresponding delivery vertex, and maximum travel time between them (ride‐time). The goal is to find a tour that (i) starts and finishes at the depot,
Xinbo Zhang, Roberto Baldacci
wiley +1 more source
On Variants of the Group Steiner Tree Problem: Considering Connected Groups of Vertices or Edges
ABSTRACT The min‐cost group Steiner tree problem (GSTP) is a well‐known problem in graph theory, not only being NP‐complete but also not admitting a constant‐factor approximation even under strong restrictions. Given a graph G$$ G $$ and groups of vertices in G$$ G $$, the problem GSTP asks for a minimum‐cost subtree of G$$ G $$ that contains at least ...
Christoph Geis, Sven O. Krumke
wiley +1 more source
Functional traits allow ecologists to synthesise general rules of community assembly. In joint species distribution modelling, traits are increasingly used to explain species–environment relationships, with the intention of being able to generalise predictions to other species in other systems.
Hao Ran Lai +4 more
wiley +1 more source
Abstract Patients with recurrent high‐grade glioma (rHGG) have a poor prognosis with median progression‐free survival (PFS) of <7 months. Responses to treatment are heterogenous, suggesting a clinical need for prognostic models. Bayesian data analysis can exploit individual patient follow‐up imaging studies to adaptively predict the risk of progression.
Daniel J. Glazar +5 more
wiley +1 more source

