Results 81 to 90 of about 107,087 (251)
Current Standards of Monitoring Models in Healthcare Settings
Advanced Intelligent Discovery, EarlyView.AI/ML‐enabled medical devices are entering clinical practice faster than monitoring standards mature. This review highlights gaps in postmarket surveillance, limited use of predetermined change‐control plans, and the need for ongoing performance tracking, drift detection, explainability, and workflow‐aware governance to support safer, more reliable ...
Alan Kay +5 more
wiley +1 more source
, 2020 Two methods for expanding graceful trees are introduced. In constructing a larger graceful trees, these methods are based on a collection of certain graceful trees and one graceful tree as the core of the produced graceful tree.
I Nengah Suparta, I Dewa M. Agus Ariawan
core +1 more source
Advanced Intelligent Systems, EarlyView.Origami turns a single silicone chamber into three different soft fluidic actuators. Crease angles alone decide whether it elongates, bends, or twists, and the fully folded chambers are cast monolithically in one day. Below 15 kPa, they reach 268% axial stretch, 72° bending, and 55° twist—no strain‐limiting layers, no rigid reinforcements, no vacuum ...
Alexia Le Gall +4 more
wiley +1 more source
Graceful coloring is computationally hard [PDF]
Given a (proper) vertex coloring $f$ of a graph $G$, say $f\colon V(G)\to \mathbb{N}$, the difference edge labelling induced by $f$ is a function $h\colon E(G)\to \mathbb{N}$ defined as $h(uv)=|f(u)-f(v)|$ for every edge $uv$ of $G$.
D., Laavanya +2 more
core +1 more source
On $k$-Super Graceful Labeling of Graphs
, 2018 Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $p$ and size $q$. For $k\ge 1$, a bijection $f: V(G)\cup E(G) \to \{k, k+1, k+2, \ldots, k+p+q-1\}$ such that $f(uv)= |f(u) - f(v)|$ for every edge $uv\in E(G)$ is said to be a $k$-super graceful labeling of $G$.
Lau, Gee-Choon +2 more
openaire +3 more sources
On the graceful conjecture for triangular cacti
, 2012 A graceful labelling of a graph with n edges is a vertex labelling where the induced set of edge weights is {1, . . . , n}. A near graceful labelling is almost the same, the difference being that the edge weights are {1, 2, . . . , n − 1, n + 1}. In both
Brenda Wicks +3 more
core
Obtention of solar cell parameters, through convergence of iterative cycles. Part 2: Application to experimental current-voltage measurements. [PDF]
Heliyon, 2022 Rangel-Kuoppa VT.
europepmc +1 more source
Wheat Ear Segmentation Based on a Multisensor System and Superpixel Classification. [PDF]
Plant Phenomics, 2022 Carlier A +3 more
europepmc +1 more source
On the application of graceful labelling in MPLS networks
, 2018 Рассмотрены графовые модели на основе грациозных разметок, используемых при решении оптимизационных задач в современных сетях передачи данных.Мета статті.
Семенюта, М.Ф. +1 more
core +1 more source
, 2016 [[abstract]]Let G be a undirected graph with a vertex set V and an edge set E. Given a nonnegative integer set D. A D-graceful labeling f of G is an injection f : V → D such that {|f(x) − f(y)| ¯¯ xy ∈ E} = {1, 2, 3, . . . , |E|}.
顏經和 +3 more
core