Results 61 to 70 of about 1,611,510 (293)

Beam model development and clinical experience with RadCalc for treatment plan quality assurance in online adaptive workflow with an MR‐linac

Journal of Applied Clinical Medical Physics, EarlyView.
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, Zoë Moutrie, Jack D Aylward, Michael G Jameson   +3 more
wiley   +1 more source

Localization accuracy of 6‐second CBCT for lung IGRT with various breathing patterns

Journal of Applied Clinical Medical Physics, EarlyView.
Abstract Purpose The 6‐second cone beam computed tomography (CBCT) acquisition of the Ethos HyperSight (Varian Medical Systems, Inc. Palo Alto, CA, USA) on‐board imaging system offers benefits, but could be too fast to accurately capture an average target position in a free‐breathing lung cancer patient. This study aimed to ascertain whether a 6‐second
Jihye Koo, Gage Redler, Vladimir Semenenko, Stephen A. Rosenberg, Emily Keit, Jacqueline M. Andreozzi   +5 more
wiley   +1 more source

Histone Deacetylase 6 Brain PET in Amyotrophic Lateral Sclerosis‐Frontotemporal Spectrum Disorder

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective [18F]EKZ‐001 is a positron emission tomography (PET) tracer targeting histone deacetylase 6 (HDAC6), an enzyme responsible for intracellular transport and clearance of misfolded proteins. HDAC6 modulation is a promising treatment strategy in neurodegenerative disorders, including amyotrophic lateral sclerosis (ALS).
Greet Vanderlinden, Charles Carron, Donatienne Van Weehaeghe, Joke De Vocht, Fouke Ombelet, Pegah Masrori, Caro De Weerdt, Rebecca E. James, Lauren T. Evans, Frederick A. Schroeder, Jacob M. Hooker, Michel Koole, Janice E. Kranz, Tonya M. Gilbert, Philip Van Damme, Koen Van Laere   +15 more
wiley   +1 more source

Programming and Testing a Two-Tree Algorithm [PDF]

, 2013
ACM Computing Classification System (1998): G.2.2, F.2.2.Recently, Markov, Vassilev and Manev [2] proposed an algorithm for finding the longest path in 2-trees. In this paper, we describe an implementation of the algorithm.
Ammerlaan, Joanna, Vassilev, Tzvetalin
core  

Dissecting Soft Radiation with Factorization [PDF]

, 2014
An essential part of high-energy hadronic collisions is the soft hadronic activity that underlies the primary hard interaction. It includes soft radiation from the primary hard partons, secondary multiple parton interactions (MPI), and factorization ...
Stewart, Iain W., Tackmann, Frank J., Waalewijn, Wouter J.   +2 more
core   +3 more sources

New results on connected dominating structures in graphs

Acta Universitatis Sapientiae: Informatica, 2019
A set of vertices in a graph is a dominating set if every vertex not in the set is adjacent to at least one vertex in the set. A dominating structure is a subgraph induced by the dominating set.
Samuel Libin Chacko, Joseph Mayamma
doaj   +1 more source

The Impact of Diabetes and Metabolic Syndrome Burden on Pain, Neuropathy Severity and Fiber Type

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Determine the association between diabetes and metabolic syndrome (MetS) burden (number of MetS criteria fulfilled) and pain, neuropathy severity, and fiber type involvement in individuals with established polyneuropathy. Methods The Peripheral Neuropathy Research Registry was queried for individuals with type 1 and type 2 diabetes ...
Long Davalos, Brian C. Callaghan, Lavanya Muthukumar, Simone Thomas, Evan L. Reynolds, A. Gordon Smith, J. Robinson Singleton, Ahmet Höke, Senda Ajroud‐Driss, Mazen M. Dimachkie, Stefanie Geisler, David M. Simpson, PNRR Study Group, Amro M. Stino   +13 more
wiley   +1 more source

The Wiener, Eccentric Connectivity and Zagreb Indices of the Hierarchical Product of Graphs [PDF]

, 2012
Let G1 = (V1, E1) and G2 = (V2, E2) be two graphs having a distinguished or root vertex, labeled 0. The hierarchical product G2 ⊓ G1 of G2 and G1 is a graph with vertex set V2 × V1. Two vertices y2y1 and x2x1 are adjacent if and only if y1x1 ∈ E1 and y2 =
Ashrafi, A., Hamzeh, A., Hossein-Zadeh, S.   +2 more
core  

Tripartite graphs with given degree set

Acta Universitatis Sapientiae: Informatica, 2015
If k ≥ 1, then the global degree set of a k-partite graph G = (V1, V2, . . . , Vk, E) is the set of the distinct degrees of the vertices of G, while if k ≥ 2, then the distributed degree set of G is the family of the k degree sets of the vertices of the ...
Iványi Antal, Pirzada Shariefuddin, Dar Farooq A.   +2 more
doaj   +1 more source

Precision‐Optimised Post‐Stroke Prognoses

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Background Current medicine cannot confidently predict who will recover from post‐stroke impairments. Researchers have sought to bridge this gap by treating the post‐stroke prognostic problem as a machine learning problem, reporting prediction error metrics across samples of patients whose outcomes are known.
Thomas M. H. Hope, Howard Bowman, Rachel M. Bruce, Alex P. Leff, Cathy J. Price   +4 more
wiley   +1 more source