Parity-violating and time-reversal-violating pion-nucleon couplings: Higher order chiral matching relations
Not Available
Seng, Chien-Yeah↗
SEARCH · Engineering Papers
Results for “matching”
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.
Multiscale Image Matching for Automated Calibration of UAV-Based Frame and Line Camera Systems
Not provided.
Engineering↗
Centroid stabilization for laser alignment to corner cubes: designing a matched filter
Automation of image-based alignment of National Ignition Facility high energy laser beams is providing the capability of executing multiple target shots per day. One important alignment is beam centration through the second and third harmonic generating crystals in the final optics assembly (FOA), which employs two retroreflecting corner cubes as centering references for each beam. Beam-to-beam variations and systematic beam changes over time in the FOA corner cube images can lead to a reduction in accuracy as well as increased convergence durations for the template-based position detector. A systematic approach is described that maintains FOA corner cube templates and guarantees stable position estimation.
42 ENGINEERING↗
Extension of water-window harmonic cutoff by laser defocusing-assisted phase matching
Not Available
Jin, Cheng (ORCID:0000000184452378)↗
Distributed matching scheme and a flexible deterministic matching algorithm for arbitrary systems
Abstract Not Provided
ACCSYS, COMP↗
Fuzzy Matching: Accelerating MPI Matching with Vector Comparisons Based on Partial Truth.
Abstract not provided.
Dosanjh, Matthew↗
SU-E-J-140: Availability of Using Diaphragm Matching in Stereotactic Body Radiotherapy (SBRT) at the Time in Breath-Holding SBRT for Liver Cancer
Purpose: IGRT based on the bone matching may produce a larger target positioning error in terms of the reproducibility of the expiration breath hold. Therefore, the feasibility of the 3D image matching between planning CT image and pretreatment CBCT image based on the diaphragm matching was investigated. Methods: In fifteen-nine liver SBRT cases, Lipiodol, uptake after TACE was outlined as the marker of the tumor. The relative coordinate of the isocenter obtained by the contrast matching was defined as the reference coordinate. The target positioning difference between diaphragm matching and bone matching were evaluated by the relative coordinate of the isocenter from the reference coordinate obtained by each matching technique. In addition, we evaluated PTV margins by van Herk setup margin formula. Results: The target positioning error by the diaphragm matching and the bone matching was 1.31±0.83 and 3.10±2.80 mm in the cranial-caudal(C-C) direction, 1.04±0.95 and 1.62±1.02 mm in the anterior-posterior(A-P) direction, 0.93±1.19 and 1.12±0.94 mm in the left-right(L-R) direction, respectively. The positioning error by the diaphragm matching was significantly smaller than the bone matching in the C-C direction (p<0.05). The setup margin of diaphragm matching and bone matching that we had calculated based on van Herk margin formula was 4.5mm and 6.2mm(C-C), and 3.6mm and 6.3mm(A-P), and 2.6mm and 4.5mm(L-R), respectively. Conclusion: IGRT based on a diaphragm matching could be one alternative image matching technique for the positioning of the patients with liver tumor.
60 APPLIED LIFE SCIENCES↗
Best Practices for NPT Transit Matching
Transit matching is the process for relating or matching reports of shipments and receipts submitted to the International Atomic Energy Agency (IAEA). Transit matching is a component used by the IAEA in drawing safeguards conclusions and performing investigative analysis. Transit matching is part of IAEA safeguards activities and the State evaluation process, and it is included in the annual Safeguards Implementation Report (SIR). Annually, the IAEA currently receives reports of ~900,000 nuclear material transactions, of which ~500,000 are for domestic and foreign transfers. Of these the IAEA software can automatically match (i.e., machine match) about 95% of the domestic transfers and 25% of the foreign transfers. Given the increasing demands upon IAEA resources, it is highly desirable for the machine-matching process to match as many transfers as possible. Researchers at Oak Ridge National Laboratory (ORNL) have conducted an investigation funded by the National Nuclear Security Administration through the Next Generation Safeguards Initiative to identify opportunities to strengthen IAEA transit matching. Successful matching, and more specifically machine matching, is contingent on quality data from the reporting States. In February 2016, ORNL hosted representatives from three States, the IAEA, and Euratom to share results from past studies and to discuss the processes, policies, and procedures associated with State reporting for transit matching. Drawing on each entity's experience and knowledge, ORNL developed a best practices document to be shared with the international safeguards community to strengthen transit matching. This paper shares the recommendations that resulted from this strategic meeting and the next steps being taken to strengthen transit matching.
98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗
Scalable Pattern Matching in Metadata Graphs via Constraint Checking
Pattern matching is a fundamental tool for answering complex graph queries. Unfortunately, existing solutions have limited capabilities: They do not scale to process large graphs and/or support only a restricted set of search templates or usage scenarios. Moreover, the algorithms at the core of the existing techniques are not suitable for today’s graph processing infrastructures relying on horizontal scalability and shared-nothing clusters, as most of these algorithms are inherently sequential and difficult to parallelize. In this article we present an algorithmic pipeline that bases pattern matching on constraint checking. The key intuition is that each vertex and edge participating in a match has to meet a set of constraints implicitly specified by the search template. These constraints can be verified independently and typically are less expensive to compute than searching the full template. The pipeline we propose generates these constraints and iterates over them to eliminate all the vertices and edges that do not participate in any match, thus reducing the background graph to a subgraph that is the union of all template matches—the complete set of all vertices and edges that participate in at least one match. Additional analysis can be performed on this annotated, reduced graph, such as full match enumeration, match counting, or computing vertex/edge centrality. Furthermore, a vertex-centric formulation for constraint checking algorithms exists, and this makes it possible to harness existing high-performance, vertex-centric graph processing frameworks. This technique (i) enables highly scalable pattern matching in metadata (labeled) graphs; (ii) supports arbitrary patterns with 100% precision; (iii) enables tradeoffs between precision and time-to-solution, while always selects all vertices and edges that participate in matches, thus offering 100% recall; and (iv) supports a set of popular data analytics scenarios. We implement our approach on top of HavoqGT, an open-source asynchronous graph processing framework, and demonstrate its advantages through strong and weak scaling experiments on massive scale real-world (up to 257 billion edges) and synthetic (up to 4.4 trillion edges) labeled graphs, respectively, and at scales (1,024 nodes / 36,864 cores), orders of magnitude larger than used in the past for similar problems. This article serves two purposes: First, it synthesises the knowledge accumulated during a long-term project. Second, it presents new system features, usage scenarios, optimizations, and comparisons with related work that strengthen the confidence that pattern matching based on iterative pruning via constraint checking is an effective and scalable approach in practice. The new contributions include the following: (i) We demonstrate the ability of the constraint checking approach to efficiently support two additional search scenarios that often emerge in practice, interactive incremental search and exploratory search. (ii) We empirically compare our solution with two additional state-of-the-art systems, Arabsque and TriAD. (iii) We show the ability of our solution to accommodate a more diverse range of datasets with varying properties, e.g., scale, skewness, label distribution, and match frequency. (iv) We introduce or extend a number of system features (e.g., work aggregation, load balancing, and the ability to cap the generated traffic) and design optimizations and demonstrate their advantages with respect to improving performance and scalability. (v) We present bottleneck analysis and insights into artifacts that influence performance. (vi) We present a theoretical complexity argument that motivates the performance gains we observe.
97 MATHEMATICS AND COMPUTING↗
Beam characteristics of energy-matched flattening filter free beams
Purpose: Flattening filter free (FFF) linear accelerators can increase treatment efficiency and plan quality. There are multiple methods of defining a FFF beam. The Elekta control system supports tuning of the delivered FFF beam energy to enable matching of the percentage depth-dose (PDD) of the flattened beam at 10 cm depth. This is compared to FFF beams where the linac control parameters are identical to those for the flattened beam. All beams were delivered on an Elekta Synergy accelerator with an Agility multi-leaf collimator installed and compared to the standard, flattened beam. The aim of this study is to compare “matched” FFF beams to both “unmatched” FFF beams and flattened beams to determine the benefits of matching beams. Methods: For the three modes of operation 6 MV flattened, 6 MV matched FFF, 6 MV unmatched FFF, 10 MV flattened, 10 MV matched FFF, and 10 MV unmatched FFF beam profiles were obtained using a plotting tank and were measured in steps of 0.1 mm in the penumbral region. Beam penumbra was defined as the distance between the 80% and 20% of the normalized dose when the inflection points of the unflattened and flattened profiles were normalized with the central axis dose of the flattened field set as 100%. PDD data was obtained at field sizes ranging from 3 cm × 3 cm to 40 cm × 40 cm. Radiation protection measurements were additionally performed to determine the head leakage and environmental monitoring through the maze and primary barriers. Results: No significant change is made to the beam penumbra for FFF beams with and without PDD matching, the maximum change in penumbra for a 10 cm × 10 cm field was within the experimental error of the study. The changes in the profile shape with increasing field size are most significant for the matched FFF beam, and both FFF beams showed less profile shape variation with increasing depth when compared to flattened beams, due to consistency in beam energy spectra across the radiation field. The PDDs of the FFF beams showed less variation with field size, the d{sub max} value was deeper for the matched FFF beam than the FFF beam and deeper than the flattened beam for field sizes greater than 5 cm × 5 cm. The head leakage when using the machine in FFF mode is less than half that for a flattened beam, but comparable for both FFF modes. The radiation protection dose-rate measurements show an increase of instantaneous dose-rates when operating the machines in FFF mode but that increase is less than the ratio of MU/min produced by the machine. Conclusions: The matching of a FFF beam to a flattened beam at a depth of 10 cm in water by increasing the FFF beam energy does not reduce any of the reported benefits of FFF beams. Conversely, there are a number of potential benefits resulting from matching the FFF beam; the depth of maximum dose is deeper, the out of field dose is potentially reduced, and the beam quality and penetration more closely resembles the flattened beams currently used in clinical practice, making dose distributions in water more alike. Highlighted in this work is the fact that some conventional specifications and methods for measurement of beam parameters such as penumbra are not relevant and further work is required to address this situation with respect to “matched” FFF beams and to determine methods of measurement that are not reliant on an associated flattened beam.
43 PARTICLE ACCELERATORS↗
Moving toward automated µFTIR spectra matching for microplastic identification: addressing false identifications and improving accuracy
Abstract Infrared spectroscopy is a widely used tool for studying microplastics and identifying microparticles. Researchers rely on spectral libraries to differentiate between synthetic and natural materials. Unfortunately, spectral library matching is not perfect, and best practices require researchers to use time consuming, manual peak matching to assess spectral matches. Moving toward automated matching requires increased confidence in the matching process. Using spectra matching software may increase the efficiency of particle identification, however some matching strategies may confuse natural materials such as cotton, silk, and plant matter with common classes of synthetics such as polyesters and polyamides. In this experiment, we prepared 22 pristine sample materials from natural and synthetic sources and measured micro-Fourier transform infrared (µFTIR) spectra in transmission mode for each sample using a Thermo Nicolet iN10 MX instrument. The collected spectra were then input into two spectral library matching systems (Omnic Picta and Open Specy), using a total of five identification routines. Next, we placed a subset of four pristine microplastic materials in a biologically active river system for two weeks to simulate environmental samples. These simulated environmental samples were processed using 10% hydrogen peroxide for 24 h to remove organic contamination and then identified using the strongest performing library. We found that libraries with fewer sample spectra produced lower correlation matches and that using derivative correction greatly reduced the number of inaccuracies in identifying materials as either natural or synthetic. We also found that environmental fouling reduced the correlation value of library matches when compared to pristine particles, however the effect was not consistent across the four materials tested. Overall, we found that the accuracy of automated library matching in the tested systems and processing routines varied from 64.1 to 98.0% for distinguishing between natural and synthetic materials, and that a high Hit Quality Index (HQI) did not always correlate with accuracy. These results are important for the microplastic field, demonstrating a need to rigorously test spectral libraries and processing routines with known materials to ensure identification accuracy.
Kozloski, Rachel↗
A Review of the Match Technique as Applied to AASE-2/EASOE and SOLVE/THESEO 2000
We apply the GSFC trajectory model with a series of ozonesondes to derive ozone loss rates in the lower stratosphere for the AASE-2/EASOE mission (January - March 1992) and for the SOLVE/THESEO 2000 mission (January - March 2000) in an approach similar to Match. Ozone loss rates are computed by comparing the ozone concentrations provided by ozonesondes launched at the beginning and end of the trajectories connecting the launches. We investigate the sensitivity of the Match results on the various parameters used to reject potential matches in the original Match technique and conclude that only a filter based on potential vorticity changes along the calculated back trajectory seems necessary. Our study also demonstrates that calculated ozone loss rates can vary by up to a factor of two depending upon the precise trajectory paths calculated for each trajectory. As a result an additional systematic error might need to be added to the statistical uncertainties published with previous Match results. The sensitivity to the trajectory path is particularly pronounced in the month of January, the month during which the largest ozone loss rate discrepancies between photochemical models and Match are found. For most of the two study periods, our ozone loss rates agree with those previously published. Notable exceptions are found for January 1992 at 475 K and late February/early March 2000 at 450 K, both periods during which we find less loss than the previous studies. Integrated ozone loss rates in both years compare well with those found in numerous other studies and in a potential vorticity/potential temperature approach shown previously and in this paper. Finally, we suggest an alternate approach to Match using trajectory mapping that appears to more accurately reflect the true uncertainties associated with Match and reduces the dependence upon filters that may bias the results of Match through the rejection of greater than or equal to 80% of the matched sonde pairs and >99% of matched observations.
Morris, Gary A.↗
Brachytherapy Improves Biochemical Failure–Free Survival in Low- and Intermediate-Risk Prostate Cancer Compared With Conventionally Fractionated External Beam Radiation Therapy: A Propensity Score Matched Analysis
Purpose: To compare, in a retrospective study, biochemical failure-free survival (bFFS) and overall survival (OS) in low-risk and intermediate-risk prostate cancer patients who received brachytherapy (BT) (either low-dose-rate brachytherapy [LDR-BT] or high-dose-rate brachytherapy with external beam radiation therapy [HDR-BT+EBRT]) versus external beam radiation therapy (EBRT) alone. Methods and Materials: Patient data were obtained from the ProCaRS database, which contains 7974 prostate cancer patients treated with primary radiation therapy at four Canadian cancer institutions from 1994 to 2010. Propensity score matching was used to obtain the following 3 matched cohorts with balanced baseline prognostic factors: (1) low-risk LDR-BT versus EBRT; (2) intermediate-risk LDR-BT versus EBRT; and (3) intermediate-risk HDR-BT+EBRT versus EBRT. Kaplan-Meier survival analysis was performed to compare differences in bFFS (primary endpoint) and OS in the 3 matched groups. Results: Propensity score matching created acceptable balance in the baseline prognostic factors in all matches. Final matches included 2 1:1 matches in the intermediate-risk cohorts, LDR-BT versus EBRT (total n=254) and HDR-BT+EBRT versus EBRT (total n=388), and one 4:1 match in the low-risk cohort (LDR-BT:EBRT, total n=400). Median follow-up ranged from 2.7 to 7.3 years for the 3 matched cohorts. Kaplan-Meier survival analysis showed that all BT treatment options were associated with statistically significant improvements in bFFS when compared with EBRT in all cohorts (intermediate-risk EBRT vs LDR-BT hazard ratio [HR] 4.58, P=.001; intermediate-risk EBRT vs HDR-BT+EBRT HR 2.08, P=.007; low-risk EBRT vs LDR-BT HR 2.90, P=.004). No significant difference in OS was found in all comparisons (intermediate-risk EBRT vs LDR-BT HR 1.27, P=.687; intermediate-risk EBRT vs HDR-BT+EBRT HR 1.55, P=.470; low-risk LDR-BT vs EBRT HR 1.41, P=.500). Conclusions: Propensity score matched analysis showed that BT options led to statistically significant improvements in bFFS in low- and intermediate-risk prostate cancer patient populations.
62 RADIOLOGY AND NUCLEAR MEDICINE↗
Using Simulation to Examine the Effect of MPI Message Matching Costs on Application Performance
Attaining high performance with MPI applications requires efficient message matching to minimize message processing overheads and the latency these overheads introduce into application communication. We use a validated simulation-based approach to examine the relationship between MPI message matching performance and application time-to-solution. Specifically, we examine how the performance of several important HPC workloads is affected by the time required for matching. Our analysis yields several important contributions: (i) the performance of current workloads is unlikely to be significantly affected by MPI matching unless match queue operations get much slower or match queues get much longer; (ii) match queue designs that provide sublinear performance as a function of queue length are unlikely to yield much benefit unless match queue lengths increase dramatically; and (iii) we provide guidance on how long the mean time per match attempt may be without significantly affecting application performance. The results and analysis in this paper provide valuable guidance on the design and development of MPI message match queues.
97 MATHEMATICS AND COMPUTING↗
WE-AB-303-01: FEATURED PRESENTATION: A Dual-Detector Phase-Matched Digital Tomosynthesis (DTS) Imaging Scheme Using Aggregated KV and MV Projections for Intra-Treatment Lung Tumor Tracking
Purpose: To develop a dual-detector phase-matched DTS technique for continuous and fast intra-treatment lung tumor localization. Methods: Tumor localization accuracy of limited-angle DTS imaging is affected by low inter-slice resolution. The dual-detector DTS technique aims to overcome this limitation through combining orthogonally acquired beam’s eye view MV projections and kV projections for intra-treatment DTS reconstruction and localization. To aggregate the kV and MV projections for reconstruction, the MV projections were linearly converted to synthesize corresponding kV projections. To further address the lung motion induced localization errors, this technique uses respiratory phase-matching to match the motion information between on-board DTS and reference DTS to offset the adverse effects of motion blurriness in tumor localization.A study was performed using the CIRS008A lung phantom to simulate different on-board target variation scenarios for localization. The intra-treatment kV and MV acquisition was achieved through the Varian TrueBeam Developer Mode. Four methods were compared for their localization accuracy: 1. the proposed dual-detector phase-matched DTS technique; 2. the single-detector phase-matched DTS technique; 3. the dual-detector 3D-DTS technique without phase-matching; and 4. the single-detector 3D-DTS technique without phase-matching. Results: For scan angles of 2.5°, 5°, 10°, 20° and 30°, the dual-detector phase-matched DTS technique localized the tumor with average(±standard deviations) errors of 0.4±0.3 mm, 0.5±0.3 mm, 0.6±0.2 mm, 0.9±0.4 mm and 1.0±0.3 mm, respectively. The corresponding values of single-detector phase-matched DTS technique were 4.0±2.5 mm, 2.7±1.1 mm, 1.7±1.2 mm, 2.2±0.9 mm and 1.5±0.8 mm, respectively. The values of dual-detector 3D-DTS technique were 6.2±1.7 mm, 6.3±1.2 mm, 5.3±1.3 mm, 2.0±2.2 mm and 1.5±0.5 mm, respectively. And the values of single-detector 3D-DTS technique were 9.7±8.9 mm, 9.8±8.8 mm, 10.0±9.7 mm, 3.9±2.7 mm and 2.2±1.3 mm, respectively. Conclusion: The dual-detector phase-matched DTS technique substantially improves the tumor localization accuracy, which can be applied to real-time intra-treatment lung tumor localization. The research was funded by the National Institutes of Health Grant No. R01-CA184173 and a grant from Varian Medical Systems.
60 APPLIED LIFE SCIENCES↗
Match-bounded String Rewriting Systems
We introduce a new class of automated proof methods for the termination of rewriting systems on strings. The basis of all these methods is to show that rewriting preserves regular languages. To this end, letters are annotated with natural numbers, called match heights. If the minimal height of all positions in a redex is h+1 then every position in the reduct will get height h+1. In a match-bounded system, match heights are globally bounded. Using recent results on deleting systems, we prove that rewriting by a match-bounded system preserves regular languages. Hence it is decidable whether a given rewriting system has a given match bound. We also provide a sufficient criterion for the abence of a match-bound. The problem of existence of a match-bound is still open. Match-boundedness for all strings can be used as an automated criterion for termination, for match-bounded systems are terminating. This criterion can be strengthened by requiring match-boundedness only for a restricted set of strings, for instance the set of right hand sides of forward closures.
Geser, Alfons↗
Characterizing MPI matching via trace-based simulation
With the increased scale expected on future leadership-class systems, detailed information about the resource usage and performance of MPI message matching provides important insights into how to maintain application performance on next-generation systems. However, obtaining MPI message matching performance data is often not possible without significant effort. A common approach is to instrument an MPI implementation to collect relevant statistics. While this approach can provide important data, collecting matching data at runtime perturbs the application's execution, including its matching performance, and is highly dependent on the MPI library's matchlist implementation. In this paper, we introduce a trace-based simulation approach to obtain detailed MPI message matching performance data for MPI applications without perturbing their execution. Using a number of key parallel workloads, we demonstrate that this simulator approach can rapidly and accurately characterize matching behavior. Specifically, we use our simulator to collect several important statistics about the operation of the MPI posted and unexpected queues. For example, we present data about search lengths and the duration that messages spend in the queues waiting to be matched. Here, data gathered using this simulation-based approach have significant potential to aid hardware designers in determining resource allocation for MPI matching functions and provide application and middleware developers with insight into the scalability issues associated with MPI message matching.
97 MATHEMATICS AND COMPUTING↗