Results 61 to 70 of about 1,370 (272)
In dynamic driving scenarios, the proposed approach ensures only temporally aligned sensor inputs to make driving decisions, preventing false activations. By enabling selective hardware‐level learning, it achieves fast, reliable responses under noisy conditions.
Kapil Bhardwaj +4 more
wiley +1 more source
Further results on independent double roman trees
A double Roman dominating function (DRDF) on a graph [Formula: see text] is a function [Formula: see text] such that every vertex u with f(u) = 0 is adjacent to at least one vertex assigned a 3 or to at least two vertices assigned a 2, and every vertex v
A. Rahmouni +3 more
doaj +1 more source
Bounds on the locating Roman dominating number in trees
A Roman dominating function (or just RDF) on a graph $ G = (V, E) $ is a function $ f : V \rightarrow \{ 0, 1, 2 \} $ satisfying the condition that every vertex $u$ for which $ f(u) = 0$ is adjacent to at least one vertex $v$ for which $f(v) = 2$.
Rahbani, Hadi +3 more
core +1 more source
Frailty definitions in Chinese‐language biomedical literature increasingly align with international frameworks, while retaining conceptual diversity, underscoring the need for multidimensional, cross‐cultural research and integration with traditional Chinese medicine for culturally sensitive clinical practice.
Haodong Wei +5 more
wiley +1 more source
Advanced Experiment Design Strategies for Drug Development
Wang et al. analyze 592 drug development studies published between 2020 and 2024 that applied design of experiments methodologies. The review surveys both classical and emerging approaches—including Bayesian optimization and active learning—and identifies a critical gap between advanced experimental strategies and their practical adoption in ...
Fanjin Wang +3 more
wiley +1 more source
The Signed Total Roman k-Domatic Number Of A Graph
Let k ≥ 1 be an integer. A signed total Roman k-dominating function on a graph G is a function f : V (G) → {−1, 1, 2} such that Ʃu2N(v) f(u) ≥ k for every v ∈ V (G), where N(v) is the neighborhood of v, and every vertex u ∈ V (G) for which f(u) = −1 is ...
Volkmann Lutz
doaj +1 more source
For a graph (Formula presented.), a Roman dominating function (Formula presented.) has the property that every vertex (Formula presented.) with (Formula presented.) has a neighbor (Formula presented.) with (Formula presented.).
Haynes, Teresa W. +4 more
core +1 more source
The hydration behavior of C3S in seawater‐relevant solutions is studied based on experiments, boundary nucleation and growth (BNG) modeling, and machine learning. The main ions included in seawater modify hydration mechanisms, with MgCl2 showing the strongest acceleration effect at the same concentration.
Yanjie Sun +6 more
wiley +1 more source
Extremal Graphs for a Bound on the Roman Domination Number
A Roman dominating function on a graph G = (V, E) is a function f:V (G) → {0, 1, 2} such that every vertex u for which f(u) = 0 is adjacent to at least one vertex v with f(v) = 2. The weight of a Roman dominating function is the value w(f) = Σu∈V(G)f(u).
Bouchou Ahmed +2 more
doaj +1 more source
Vascular Abnormalities in Hypermobile Ehlers–Danlos Syndrome: A Retrospective Cohort Study
ABSTRACT Hypermobile Ehlers–Danlos syndrome (hEDS), while generally free from severe vascular complications, may occasionally present with cardiac and vascular abnormalities that warrant specific investigation. While studies have been conducted on the prevalence of cardiac involvement, none have focused on vascular aspects. This retrospective study was
Thomas Gehin +4 more
wiley +1 more source

