Results 91 to 100 of about 1,048,468 (267)
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
We present a method for contactless manipulation of multiple small objects in a plane using multiple air jets. When the objects are initially clustered as a group, the group's center of gravity is used as a representative point and the entire group ...
Tsubasa MATSUSHITA+4 more
doaj +1 more source
Computing Planarity in Computable Planar Graphs
A graph is computable if there is an algorithm which decides whether given vertices are adjacent. Having a procedure for deciding the edge set might not help compute other properties or features of the graph, however. The goal of this paper is to investigate the extent to which features related to the planarity of a graph might or might not be ...
Oscar Levin, Taylor McMillan
openaire +3 more sources
The simplicity of planar networks [PDF]
8 pages, 4 ...
Viana, Matheus P+3 more
openaire +5 more sources
Long‐term stability analysis of beam shape in a robotic radiosurgery system
Abstract Purpose This study aimed to investigate the long‐term stability of CyberKnife beam profile parameters and assess their compliance with existing quality assurance (QA) guidelines. We evaluated beam profiles in both standard and diagonal planes over 3.5 years post‐installation to detect potential issues and ensure consistent beam quality.
Ryoichi Hinoto+4 more
wiley +1 more source
The article presents the results of studies of the mechanism of the occurrence of axial vibrations in the mechanical system “electrospindle shaft with aerostatic bearings – cutting diamond disk – cuttable semiconductor wafer”. A mathematical model of the
Alexander E. Kovensky+2 more
doaj +1 more source
We study the computational complexity of planar valued constraint satisfaction problems (VCSPs), which require the incidence graph of the instance be planar. First, we show that intractable Boolean VCSPs have to be self-complementary to be tractable in the planar setting, thus extending a corresponding result of Dvorak and Kupec [ICALP'15] from CSPs to
Fulla, Peter, Živný, Stanislav
openaire +7 more sources
Abstract Purpose The aim of this work was to report on the optimization, commissioning, and validation of a beam model using a commercial independent dose verification software RadCalc version 7.2 (Lifeline Software Inc, Tyler, TX, USA), along with 4 years of experience employing RadCalc for offline and online monitor unit (MU) verification on the ...
Urszula Jelen+3 more
wiley +1 more source
Nilpotent graphs with crosscap at most two
Let be a commutative ring with identity. The nilpotent graph of , denoted by , is a graph with vertex set , and two vertices and are adjacent if and only if is nilpotent, where .
A. Mallika, R. Kala
doaj +1 more source
This article presents a compact, planar, quad-port ultra-wideband (UWB) multiple-input−multiple-output (MIMO) antenna with wide axial ratio bandwidth (ARBW).
Pawan Kumar+2 more
doaj +1 more source