Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Vertex”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 487 records · Page 27

Measurements of B → J / ψ at forward rapidity in p + p collisions at s = 510 GeV

In this paper, we report the first measurement of the fraction of J / ψ mesons coming from Β-meson decay (F Β→ J / ψ ) in p + p collisions at s = 510 GeV . The measurement is performed using the forward silicon vertex detector and central vertex detector at PHENIX, which provide precise tracking and distance-of-closest-approach determinations, enabling the statistical separation of J / ψ due to Β-meson decays from prompt J / ψ . The measured value of F Β→ J / ψ is 8.1% ± 2.3%(stat) ± 1.9%(syst) for J / ψ with transverse momenta 0 < p T < 5 GeV / c and rapidity 1.2 < |y| < 2.2. The measured fraction F Β→ J / ψ at PHENIX is compared to values measured by other experiments at higher center of mass energies and to fixed-order-next-to-leading-logarithm and color-evaporation-model predictions. The bb cross section per unit rapidity [dσ / dy(pp → bb)] extracted from the obtained F Β→ J / ψ and the PHENIX inclusive J / ψ cross section measured at 200 GeV scaled with color-evaporation-model calculations, at the mean Β hadron rapidity y = ±1.7 in 510 GeV p + p collisions, is 3.63 +1.92 -1.70 μb. Finally, it is consistent with the fixed-order-next-to-leading-logarithm calculations.

74 ATOMIC AND MOLECULAR PHYSICS↗

Tensor network method for reversible classical computation

We develop a tensor network technique that can solve universal reversible classical computational problems, formulated as vertex models on a square lattice [Nat. Commun. 8, 15303 (2017)]. By encoding the truth table of each vertex constraint in a tensor, the total number of solutions compatible with partial inputs and outputs at the boundary can be represented as the full contraction of a tensor network. We introduce an iterative compression-decimation (ICD) scheme that performs this contraction efficiently. The ICD algorithm first propagates local constraints to longer ranges via repeated contraction-decomposition sweeps over all lattice bonds, thus achieving compression on a given length scale. It then decimates the lattice via coarse-graining tensor contractions. Repeated iterations of these two steps gradually collapse the tensor network and ultimately yield the exact tensor trace for large systems, without the need for manual control of tensor dimensions. Our protocol allows us to obtain the exact number of solutions for computations where a naive enumeration would take astronomically long times.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Phase Diagram and Critical End Point for Strongly Interacting Quarks

We introduce a method based on chiral susceptibility, which enables one to draw a phase diagram in the chemical-potential-temperature plane for strongly interacting quarks whose interactions are described by any reasonable gap equation, even if the diagrammatic content of the quark-gluon vertex is unknown. We locate a critical end point at ({mu}{sup E},T{sup E}){approx}(1.0,0.9)T{sub c}, where T{sub c} is the critical temperature for chiral-symmetry restoration at {mu}=0, and find that a domain of phase coexistence opens at the critical end point whose area increases as a confinement length scale grows.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Measurement of Muon Neutrino Quasielastic Scattering on a Hydrocarbon Target at E ν ~3.5 GeV

We report a study of ν μ charged-current quasielastic events in the segmented scintillator inner tracker of the MINERvA experiment running in the NuMI neutrino beam at Fermilab. The events were selected by requiring a μ⁻ and low calorimetric recoil energy separated from the interaction vertex. We measure the flux-averaged differential cross section, dσ/dQ², and study the low energy particle content of the final state. Deviations are found between the measured dσ/dQ² and the expectations of a model of independent nucleons in a relativistic Fermi gas. We also observe an excess of energy near the vertex consistent with multiple protons in the final state.

Fiorentini, G. A.↗

Predicting Phonon-Induced Spin Decoherence from First Principles: Colossal Spin Renormalization in Condensed Matter

Developing a microscopic understanding of spin decoherence is essential to advancing quantum technologies. Electron spin decoherence due to atomic vibrations (phonons) plays a special role as it sets an intrinsic limit to the performance of spin-based quantum devices. Two main sources of phonon-induced spin decoherence—the Elliott-Yafet and Dyakonov-Perel mechanisms—have distinct physical origins and theoretical treatments. Here, we show calculations that unify their modeling and enable accurate predictions of spin relaxation and precession in semiconductors. We compute the phonon-dressed vertex of the spin-spin correlation function with a treatment analogous to the calculation of the anomalous electron magnetic moment in QED. We find that the vertex correction provides a giant renormalization of the electron spin dynamics in solids, greater by many orders of magnitude than the corresponding correction from photons in vacuum. Finally, our Letter demonstrates a general approach for quantitative analysis of spin decoherence in materials, advancing the quest for spin-based quantum technologies.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

High resolution DEPFET active pixel sensors for the Belle II experiment

The new Belle II experiment at the SuperKEKB collider at KEK was launched in 2009 as a general upgrade of the previous successful Belle experiment. Important improvements in the Belle II detector are additional two pixel layers forming the innermost part of the vertex detector. This paper gives a short overview of the expected impact of the two inner pixel layers on the performance of Belle II based on simulations and current experimental knowledge of the DEPFET pixel detectors. The focus is on the expected performance of the thinned DEPFET pixel sensors in Belle II in terms of spatial resolution. The measurements and simulations of the current generation of DEPFET sensors in beam tests indicate that the design resolution requirements can be met. The dependence of the spatial resolution on the deposited energy was observed in beam tests and we simulated the effect for the Belle II detector type to estimate its magnitude. A short description of the readout and data acquisition chain of the Belle II pixel vertex detector is given. (authors)

43 PARTICLE ACCELERATORS↗

Runtime Scheduling Policies for Distributed Graph Algorithms

In this paper we explore scheduling and runtime system support for unordered distributed graph computations that rely on optimistic (speculative) execution. Performance of such algorithms is impacted by two competing trends: the higher degree of parallelism enabled by optimistic execution in turn requires substantial runtime support. To address the potentially high overhead and scheduling complexity introduced by the runtime, we investigate customizable scheduling policies that augment the scheduler of the underlying runtime to adapt it to a specific graph application. We present several implementations of Distributed Control (DC), a data-driven unordered approach with work prioritization and demonstrate that customizable scheduling policies result in the most efficient implementation, outperforming the well-known -stepping Single-Source Shortest Paths (SSSP) and Jones-Plassmann vertex-coloring algorithms. We apply two scheduling techniques, flow control and adaptive frequency of network progress, which allow application-level control over the balance of domain work and the runtime work. Experimental results show the benefit of such application-aware scheduling for irregular distributed graph algorithms.

Firoz, Jesun S.↗

Reduce Operations: Send Volume Balancing While Minimizing Latency

Communication hypergraph model was introduced in a two-phase setting for encapsulating multiple communication cost metrics (bandwidth and latency), which are proven to be important in parallelizing irregular applications. In the first phase, computational-task-to-processor assignment is performed with the objective of minimizing total volume while maintaining computational load balance. In the second phase, communication-task-to-processor assignment is performed with the objective of minimizing total number of messages while maintaining communication-volume balance. The reduce-communication hypergraph model suffers from failing to correctly encapsulate send-volume balancing. We propose a novel vertex weighting scheme that enables part weights to correctly encode send-volume loads of processors for send-volume balancing. The model also suffers from increasing the total communication volume during partitioning. To decrease this increase, we propose a method that utilizes the recursive bipartitioning framework and refines each bipartition by vertex swaps. For performance evaluation, we consider column-parallel SpMV, which is one of the most widely known applications in which the reduce-task assignment problem arises. Extensive experiments on 313 matrices show that, compared to the existing model, the proposed models achieve considerable improvements in all communication cost metrics. Furthermore, these improvements lead to an average decrease of 30% in parallel SpMV time on 512 processors for 70 matrices with high irregularity.

97 MATHEMATICS AND COMPUTING↗

Grouper: A Compact, Streamable Triangle Mesh Data Structure

Here, we present Grouper: an all-in-one compact file format, random-access data structure, and streamable representation for large triangle meshes. Similarly to the recently published SQuad representation, Grouper represents the geometry and connectivity of a mesh by grouping vertices and triangles into fixed-size records, most of which store two adjacent triangles and a shared vertex. Unlike SQuad, however, Grouper interleaves geometry with connectivity and uses a new connectivity representation to ensure that vertices and triangles can be stored in a coherent order that enables memory-efficient sequential stream processing. We also present a linear-time construction algorithm that allows streaming out Grouper meshes using a small memory footprint while preserving the initial ordering of vertices. In this construction, we show how the problem of assigning vertices and triangles to groups reduces to a well-known NP-hard optimization problem, and present a simple yet effective heuristic solution that performs well in practice. Our array-based Grouper representation also doubles as a triangle mesh data structure that allows direct access to vertices and triangles. Storing only about two integer references per triangle-i.e., less than the three vertex references stored with each triangle in a conventional indexed mesh format-Grouper answers both incidence and adjacency queries in amortized constant time. Our compact representation enables data-parallel processing on multicore computers, instant partitioning and fast transmission for distributed processing, as well as efficient out-of-core access. We demonstrate the versatility and performance benefits of Grouper using a suite of example meshes and processing kernels.

97 MATHEMATICS AND COMPUTING↗

Topological Simplifications of Hypergraphs

Here we study hypergraph visualization via its topological simplification. We explore both vertex simplification and hyperedge simplification of hypergraphs using tools from topological data analysis. In particular, we transform a hypergraph into its graph representations, known as the line graph and clique expansion. A topological simplification of such a graph representation induces a simplification of the hypergraph. In simplifying a hypergraph, we allow vertices to be combined if they belong to almost the same set of hyperedges, and hyperedges to be merged if they share almost the same set of vertices. Our proposed approaches are general and mathematically justifiable, and put vertex simplification and hyperedge simplification in a unifying framework.

97 MATHEMATICS AND COMPUTING↗

Localized Evaluation for Constructing Discrete Vector Fields

Topological abstractions offer a method to summarize the behavior of vector fields, but computing them robustly can be challenging due to numerical precision issues. One alternative is to represent the vector field using a discrete approach, which constructs a collection of pairs of simplices in the input mesh that satisfies criteria introduced by Forman's discrete Morse theory. While numerous approaches exist to compute pairs in the restricted case of the gradient of a scalar field, state-of-the-art algorithms for the general case of vector fields require expensive optimization procedures. This paper introduces a fast, novel approach for pairing simplices of two-dimensional, triangulated vector fields that do not vary in time. The key insight of our approach is that we can employ a local evaluation, inspired by the approach used to construct a discrete gradient field, where every simplex in a mesh is considered by no more than one of its vertices. Specifically, we observe that for any edge in the input mesh, we can uniquely assign an outward direction of flow. We can further expand this consistent notion of outward flow at each vertex, which corresponds to the concept of a downhill flow in the case of scalar fields. Working with outward flow enables a linear-time algorithm that processes the (outward) neighborhoods of each vertex one-by-one, similar to the approach used for scalar fields. Here, we couple our approach to constructing discrete vector fields with a method to extract, simplify, and visualize topological features. Empirical results on analytic and simulation data demonstrate drastic improvements in running time, produce features similar to the current state-of-the-art, and show the application of simplification to large, complex flows.

97 MATHEMATICS AND COMPUTING↗

Improved Performance of Asymptotically Optimal Rapidly Exploring Random Trees

Three algorithms that improve the performance of the asymptotically optimal Rapidly exploring Random Tree (RRT*) are presented here. First, we introduce the Goal Tree (GT) algorithm for motion planning in dynamic environments where unexpected obstacles appear sporadically. The GT reuses the previous RRT* by pruning the affected area and then extending the tree by drawing samples from a shadow set. The shadow is the subset of the free configuration space containing all configurations that have geodesics ending at the goal and are in conflict with the new obstacle. Smaller, well defined, sampling regions are considered for Euclidean metric spaces and Dubins' vehicles. Next, the Focused-Refinement (FR) algorithm, which samples with some probability around the first path found by an RRT*, is defined. The third improvement is the Grandparent-Connection (GP) algorithm, which attempts to connect an added vertex directly to its grandparent vertex instead of parent. The GT and GP algorithms are both proven to be asymptotically optimal. Finally, the three algorithms are simulated and compared for a Euclidean metric robot, a Dubins' vehicle, and a seven degrees-of-freedom manipulator.

42 ENGINEERING↗

A conceptual design of rotating board technique for delivering total skin electron therapy

Purpose: This study presents a novel technique in which a uniform radiation dose to the whole body, soles, and scalp vertex can be achieved in one electron beam treatment fraction. Methods: The patient was treated at a machine with a home-made rotating board. The patients were treated in two groups in the prone and supine positions by leaning onto an inner rotational board in the prone and supine positions. Each group can further be separated into two subgroups using tilting and rotational positions for treatment. Results: One of the beams was directed 15.5 deg. upward and 15.5 deg. downward from the horizontal axis to provide a field size of as large as 200 cm in height and 140 cm in width. An incline angle of 31.5 deg. anteriorly (forward) or posteriorly (backward) of the outer frame at an angle rotated 60 deg. clockwise or counterclockwise to the inner frame was found to be most appropriate. The output for the rotating board total skin electron therapy (RB-TSET) was 0.046 cGy/MU at ISD of 350 cm. The beam characteristics of the RB-TSET depth dose curves were R{sub 50}=2.48 cm, d{sub max}=0.7 cm, E{sub 0}=5.78 MeV, and R{sub p}=3.4 cm. Conclusions: The RB-TSET technique presented in this study is able to deliver a uniform radiation dose to the patient's skin surface, the scalp vertex, and soles of the feet all at one time, eliminating the trouble of having to further irradiate these two regions separately when using the Stanford six field technique.

61 RADIATION PROTECTION AND DOSIMETRY↗

SU-F-BRF-09: A Non-Rigid Point Matching Method for Accurate Bladder Dose Summation in Cervical Cancer HDR Brachytherapy

Purpose: To propose and validate a deformable point matching scheme for surface deformation to facilitate accurate bladder dose summation for fractionated HDR cervical cancer treatment. Method: A deformable point matching scheme based on the thin plate spline robust point matching (TPSRPM) algorithm is proposed for bladder surface registration. The surface of bladders segmented from fractional CT images is extracted and discretized with triangular surface mesh. Deformation between the two bladder surfaces are obtained by matching the two meshes' vertices via the TPS-RPM algorithm, and the deformation vector fields (DVFs) characteristic of this deformation is estimated by B-spline approximation. Numerically, the algorithm is quantitatively compared with the Demons algorithm using five clinical cervical cancer cases by several metrics: vertex-to-vertex distance (VVD), Hausdorff distance (HD), percent error (PE), and conformity index (CI). Experimentally, the algorithm is validated on a balloon phantom with 12 surface fiducial markers. The balloon is inflated with different amount of water, and the displacement of fiducial markers is benchmarked as ground truth to study TPS-RPM calculated DVFs' accuracy. Results: In numerical evaluation, the mean VVD is 3.7(±2.0) mm after Demons, and 1.3(±0.9) mm after TPS-RPM. The mean HD is 14.4 mm after Demons, and 5.3mm after TPS-RPM. The mean PE is 101.7% after Demons and decreases to 18.7% after TPS-RPM. The mean CI is 0.63 after Demons, and increases to 0.90 after TPS-RPM. In the phantom study, the mean Euclidean distance of the fiducials is 7.4±3.0mm and 4.2±1.8mm after Demons and TPS-RPM, respectively. Conclusions: The bladder wall deformation is more accurate using the feature-based TPS-RPM algorithm than the intensity-based Demons algorithm, indicating that TPS-RPM has the potential for accurate bladder dose deformation and dose summation for multi-fractional cervical HDR brachytherapy. This work is supported in part by the National Natural ScienceFoundation of China (no 30970866 and no 81301940)

60 APPLIED LIFE SCIENCES↗

WE-AB-BRA-05: Fully Automatic Segmentation of Male Pelvic Organs On CT Without Manual Intervention

Purpose: We aim to develop a fully automatic tool for accurate contouring of major male pelvic organs in CT images for radiotherapy without any manual initialization, yet still achieving superior performance than the existing tools. Methods: A learning-based 3D deformable shape model was developed for automatic contouring. Specifically, we utilized a recent machine learning method, random forest, to jointly learn both image regressor and classifier for each organ. In particular, the image regressor is trained to predict the 3D displacement from each vertex of the 3D shape model towards the organ boundary based on the local image appearance around the location of this vertex. The predicted 3D displacements are then used to drive the 3D shape model towards the target organ. Once the shape model is deformed close to the target organ, it is further refined by an organ likelihood map estimated by the learned classifier. As the organ likelihood map provides good guideline for the organ boundary, the precise contouring Result could be achieved, by deforming the 3D shape model locally to fit boundaries in the organ likelihood map. Results: We applied our method to 29 previously-treated prostate cancer patients, each with one planning CT scan. Compared with manually delineated pelvic organs, our method obtains overlap ratios of 85.2%±3.74% for the prostate, 94.9%±1.62% for the bladder, and 84.7%±1.97% for the rectum, respectively. Conclusion: This work demonstrated feasibility of a novel machine-learning based approach for accurate and automatic contouring of major male pelvic organs. It shows the potential to replace the time-consuming and inconsistent manual contouring in the clinic. Also, compared with the existing works, our method is more accurate and also efficient since it does not require any manual intervention, such as manual landmark placement. Moreover, our method obtained very similar contouring results as the clinical experts. Project is partially support by a grant from NCI 1R01CA140413.

60 APPLIED LIFE SCIENCES↗

SIS epidemiological model for adaptive RT: Forecasting the parotid glands shrinkage during tomotherapy treatment

Purpose: A susceptible-infected-susceptible (SIS) epidemic model was applied to radiation therapy (RT) treatments to predict morphological variations in head and neck (H&N) anatomy. Methods: 360 daily MVCT images of 12 H&N patients treated by tomotherapy were analyzed in this retrospective study. Deformable image registration (DIR) algorithms, mesh grids, and structure recontouring, implemented in the RayStation treatment planning system (TPS), were applied to assess the daily organ warping. The parotid’s warping was evaluated using the epidemiological approach considering each vertex as a single subject and its deformed vector field (DVF) as an infection. Dedicated IronPython scripts were developed to export daily coordinates and displacements of the region of interest (ROI) from the TPS. MATLAB tools were implemented to simulate the SIS modeling. Finally, the fully trained model was applied to a new patient. Results: A QUASAR phantom was used to validate the model. The patients’ validation was obtained setting 0.4 cm of vertex displacement as threshold and splitting susceptible (S) and infectious (I) cases. The correlation between the epidemiological model and the parotids’ trend for further optimization of alpha and beta was carried out by Euclidean and dynamic time warping (DTW) distances. The best fit with experimental conditions across all patients (Euclidean distance of 4.09 ± 1.12 and DTW distance of 2.39 ± 0.66) was obtained setting the contact rate at 7.55 ± 0.69 and the recovery rate at 2.45 ± 0.26; birth rate was disregarded in this constant population. Conclusions: Combining an epidemiological model with adaptive RT (ART), the authors’ novel approach could support image-guided radiation therapy (IGRT) to validate daily setup and to forecast anatomical variations. The SIS-ART model developed could support clinical decisions in order to optimize timing of replanning achieving personalized treatments.

60 APPLIED LIFE SCIENCES↗