skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: A Modular NMF Matching Algorithm for Radiation Spectra.


Abstract not provided.

Publication Date:
Research Org.:
Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
Sponsoring Org.:
USDOE National Nuclear Security Administration (NNSA)
OSTI Identifier:
Report Number(s):
DOE Contract Number:
Resource Type:
Resource Relation:
Conference: Proposed for presentation at the 12th IEEE Workshop on Perception Beyond the Visible Spectrum held June 26, 2016 in Las Vegas, NV.
Country of Publication:
United States

Citation Formats

Koudelka, Melissa Linae, and Dorsey, Daniel J. A Modular NMF Matching Algorithm for Radiation Spectra.. United States: N. p., 2016. Web. doi:10.1109/CVPRW.2016.42.
Koudelka, Melissa Linae, & Dorsey, Daniel J. A Modular NMF Matching Algorithm for Radiation Spectra.. United States. doi:10.1109/CVPRW.2016.42.
Koudelka, Melissa Linae, and Dorsey, Daniel J. Fri . "A Modular NMF Matching Algorithm for Radiation Spectra.". United States. doi:10.1109/CVPRW.2016.42.
title = {A Modular NMF Matching Algorithm for Radiation Spectra.},
author = {Koudelka, Melissa Linae and Dorsey, Daniel J.},
abstractNote = {Abstract not provided.},
doi = {10.1109/CVPRW.2016.42},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Fri Jul 01 00:00:00 EDT 2016},
month = {Fri Jul 01 00:00:00 EDT 2016}

Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share:
  • Abstract not provided.
  • Abstract not provided.
  • An attributed directed graph model which is a combination of high-level Petri Nets and and/or graphs is described. This model provides a method for matching parallel algorithms to architectures or vice versa. The analysis of parallel computation using this model is described. Examples are given to demonstrate the descriptive power of this model and how it helps us to match an algorithm and an architecture. 18 references.
  • This paper describes a new algorithm for the 2-matching problem on an arbitrary graph based on an analysis of the cycle structure of the permutation representing the assignment problem relaxation of the symmetric cost matrix corresponding to the incidence matrix of the graph. The algorithm is recursive and O(n{sup 3}). Computational experiments with a first implementation show that the method performs favorably relative to Edmonds` augmenting path algorithm on random graphs of order up to 500.
  • Within a truncated determinant algorithm, two alternatives are discussed for including systematically the remaining ultraviolet modes. Evidence is presented that these modes are accurately described by an effective action involving only small Wilson loops.