Results 61 to 70 of about 1,379,637 (289)
Journal of Applied Clinical Medical Physics, EarlyView.Abstract Purpose This study aims to evaluate how different gantry angles, breathing rates (BPM), cine image speeds, and tracking algorithms affect beam on/off latency and the subsequent impact on target dose for a 0.35T MR‐Linac with a 6 MV FFF beam.
Mateb Al Khalifa +4 more
wiley +1 more source
Light Graphs In Planar Graphs Of Large Girth
Discussiones Mathematicae Graph Theory, 2016 A graph H is defined to be light in a graph family 𝒢 if there exist finite numbers φ(H, 𝒢) and w(H, 𝒢) such that each G ∈ 𝒢 which contains H as a subgraph, also contains its isomorphic copy K with ΔG(K) ≤ φ(H, 𝒢) and ∑x∈V(K) degG(x) ≤ w(H, 𝒢).
Hudák Peter +3 more
doaj +1 more source
Radiotherapy medical physics in the Philippines: A contemporary overview
Journal of Applied Clinical Medical Physics, EarlyView.Abstract Purpose With cancer ranking as the third leading cause of death in the Philippines and a disparity in healthcare resources across regions, this research aimed to assess the state of radiotherapy medical physics in the country. Methodology The study utilized a comprehensive online survey with 94 structured questions answered by 19 clinics ...
John Paul C. Cabahug +4 more
wiley +1 more source
An Analogue of DP-Coloring for Variable Degeneracy and its Applications
Discussiones Mathematicae Graph Theory, 2022 A graph G is list vertex k-arborable if for every k-assignment L, one can choose f(v) ∈ L(v) for each vertex v so that vertices with the same color induce a forest. In [6], Borodin and Ivanova proved that every planar graph without 4-cycles adjacent to 3-
Sittitrai Pongpat, Nakprasit Kittikorn
doaj +1 more source
On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs
IEEE Annual Symposium on Foundations of Computer Science, 2017 There are numerous examples of the so-called "square root phenomenon" in the field of parameterized algorithms: many of the most fundamental graph problems, parameterized by some natural parameter k, become significantly simpler when restricted to planar
D. Marx +2 more
semanticscholar +1 more source
On the Neighbor Sum Distinguishing Index of Planar Graphs [PDF]
Journal of Graph Theory, 2014 Let c be a proper edge coloring of a graph G=(V,E) with integers 1,2,…,k . Then k≥Δ(G) , while Vizing's theorem guarantees that we can take k≤Δ(G)+1 .
Marthe Bonamy, J. Przybylo
semanticscholar +1 more source
International Journal of Adaptive Control and Signal Processing, EarlyView.Summary Data‐driven forecasting of ship motions in waves is investigated through feedforward and recurrent neural networks as well as dynamic mode decomposition. The goal is to predict future ship motion variables based on past data collected on the field, using equation‐free approaches.
Matteo Diez +2 more
wiley +1 more source
SOME PROPERTIES ON COPRIME GRAPH OF GENERALIZED QUATERNION GROUPS
Barekeng, 2023 A coprime graph is a representation of finite groups on graphs by defining the vertex graph as an element in a group and two vertices adjacent to each other's if and only if the order of the two elements is coprime.
Arif Munandar
doaj +1 more source
Advanced Engineering Materials, EarlyView.In this study, exciting new bi‐/multi‐linear elastic behavior of soft elastic composites that accompany the activation of wrinkling in the embedded interfacial layers is analyzed. The new features and performance of these composite materials, including dramatic enhancements in energy storage, can be tailored by the concentration of interfacial layers ...
Narges Kaynia +2 more
wiley +1 more source
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs [PDF]
Algorithmica, 2014 Fan-planar graphs were recently introduced as a generalization of 1-planar graphs. A graph is fan-planar if it can be embedded in the plane, such that each edge that is crossed more than once, is crossed by a bundle of two or more edges incident to a ...
M. Bekos +4 more
semanticscholar +1 more source