Algorithm for systematic peak extraction from atomic pair distribution functions
Abstract not provided
Granlund, L.↗
SEARCH · Search NASA
Results for “clustering algorithms”
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.
Automated Classification of Vehicle Movements at Signalized Intersections Using Vehicle Trajectories
Accurate vehicle movement classification through signalized intersections is of paramount importance to the analysis of intersection performance and the optimization of traffic control strategies. Conventional techniques for tracking vehicle turning movements depend on infrastructure-based strategies like human counts, loop detectors, and video analytics, all of which are costly, prone to errors, and spatially constrained. High-frequency trajectory data can be utilized to determine vehicle movement patterns in a scalable and infrastructure-independent method due to the adoption of connected vehicles (CVs). In recent years, several studies have utilized connected vehicle data to generate performance measures. Most of the trajectory-based performance measures approaches, however, require map matching-i.e., extracting geospatial references from maps to identify the movements that individual vehicles make at a signalized intersection. These approaches are often time-consuming and hinder scalability since geographic features need to be provided for an analysis to be conducted. Map matching methods are prone to errors as different map versions change these geographic features. This research presents a novel automatic classification pipeline that uses CV trajectory data to classify vehicle movements at signalized crossings, specifically pass-through left-turn and right-turn maneuvers. The process starts by filtering trips that cross a spatial bounding box that has been defined at the target intersection. Approach and departure headings for each trajectory crossing the boundary are computed and are clustered together to identify dominant movements. The proposed algorithm is used to classify the movement of vehicles at 10 intersections in the state of California, and the results indicate that the algorithm can classify movements at these intersections with varying traffic volumes and road network configurations, all in a map-less framework with no need for conflation of vehicle trajectories to a digital base map.
24 POWER TRANSMISSION AND DISTRIBUTION↗
redMaPPer II: X-ray and SZ performance benchmarks for the SDSS catalog
We evaluate the performance of the Sloan Digital Sky Survey (SDSS) DR8 redMaPPer photometric cluster catalog by comparing it to overlapping X-ray- and Sunyaev-Zeldovich (SZ)-selected catalogs from the literature. We confirm that the redMaPPer photometric redshifts are nearly unbiased ((Δz) ≤ 0.005), have low scatter (σ {sub z} ≈ 0.006-0.02, depending on redshift), and have a low catastrophic failure rate (≈1%). Both the T{sub X} -λ and M {sub gas}-λ scaling relations are consistent with a mass scatter of σ{sub ln} {sub M|λ} ≈ 25%, albeit with a ≈1% outlier rate due to projection effects (λ is the cluster richness estimated employed by redMaPPer). This failure rate is somewhat lower than that expected for the full cluster sample but is consistent with the additional selection effects introduced by our reliance on X-ray and SZ selected reference cluster samples. Where the redMaPPer DR8 catalog is volume-limited (z ≤ 0.35), the catalog is 100% complete above T{sub X} ≳ 3.5 keV, and L{sub X} ≳ 2 × 10{sup 44} erg s{sup –1}, decreasing to 90% completeness at L{sub X} ≈ 10{sup 43} erg s{sup –1}. All rich (λ ≳ 100), low-redshift (z ≲ 0.25) redMaPPer clusters are X-ray-detected in the ROSAT All Sky Survey, and 86% of the clusters are correctly centered. Compared to other SDSS photometric cluster catalogs, redMaPPer has the highest completeness and purity, and the best photometric redshift performance, though some algorithms do achieve comparable performance to redMaPPer in subsets of the above categories and/or in limited redshift ranges. The redMaPPer richness is clearly the one that best correlates with X-ray temperature and gas mass. Most algorithms (including redMaPPer) have very similar centering performance as tested by comparing against X-ray centers, with only one exception which performs worse.
79 ASTRONOMY AND ASTROPHYSICS↗
S-PLUS DR1 galaxy clusters and groups catalogue using PzWav
ABSTRACT We present a catalogue of 4499 groups and clusters of galaxies from the first data release of the multi-filter (5 broad, 7 narrow) Southern Photometric Local Universe Survey (S-PLUS). These groups and clusters are distributed over 273 deg2 in the Stripe 82 region. They are found using the PzWav algorithm, which identifies peaks in galaxy density maps that have been smoothed by a cluster scale difference-of-Gaussians kernel to isolate clusters and groups. Using a simulation-based mock catalogue, we estimate the purity and completeness of cluster detections: at S/N > 3.3, we define a catalogue that is 80 per cent pure and complete in the redshift range 0.1 < z < 0.4, for clusters with M200 > 1014 M⊙. We also assessed the accuracy of the catalogue in terms of central positions and redshifts, finding scatter of σR = 12 kpc and σz = 8.8 × 10−3, respectively. Moreover, less than 1 per cent of the sample suffers from fragmentation or overmerging. The S-PLUS cluster catalogue recovers ∼80 per cent of all known X-ray and Sunyaev-Zel’dovich selected clusters in this field. This fraction is very close to the estimated completeness, thus validating the mock data analysis and paving an efficient way to find new groups and clusters of galaxies using data from the ongoing S-PLUS project. When complete, S-PLUS will have surveyed 9300 deg2 of the sky, representing the widest uninterrupted areas with narrow-through-broad multi-band photometry for cluster follow-up studies.
Astronomy & Astrophysics↗
“Smarter” NICs for faster algorithms [Slides]
The basic building block of a distributed-memory cluster or supercomputer is a node. Each node includes a host, which is a processor (xPU) + memory hierarchy. The host can communicate with other hosts via its NIC (network interface controller). A network connects the nodes. The nodes may be arranged in some topology, which determines the network’s carrying capacity and cost.
97 MATHEMATICS AND COMPUTING↗
Estimation of breast percent density in raw and processed full field digital mammography images via adaptive fuzzy c-means clustering and support vector machine segmentation
Purpose: The amount of fibroglandular tissue content in the breast as estimated mammographically, commonly referred to as breast percent density (PD%), is one of the most significant risk factors for developing breast cancer. Approaches to quantify breast density commonly focus on either semiautomated methods or visual assessment, both of which are highly subjective. Furthermore, most studies published to date investigating computer-aided assessment of breast PD% have been performed using digitized screen-film mammograms, while digital mammography is increasingly replacing screen-film mammography in breast cancer screening protocols. Digital mammography imaging generates two types of images for analysis, raw (i.e., 'FOR PROCESSING') and vendor postprocessed (i.e., 'FOR PRESENTATION'), of which postprocessed images are commonly used in clinical practice. Development of an algorithm which effectively estimates breast PD% in both raw and postprocessed digital mammography images would be beneficial in terms of direct clinical application and retrospective analysis. Methods: This work proposes a new algorithm for fully automated quantification of breast PD% based on adaptive multiclass fuzzy c-means (FCM) clustering and support vector machine (SVM) classification, optimized for the imaging characteristics of both raw and processed digital mammography images as well as for individual patient and image characteristics. Our algorithm first delineates the breast region within the mammogram via an automated thresholding scheme to identify background air followed by a straight line Hough transform to extract the pectoral muscle region. The algorithm then applies adaptive FCM clustering based on an optimal number of clusters derived from image properties of the specific mammogram to subdivide the breast into regions of similar gray-level intensity. Finally, a SVM classifier is trained to identify which clusters within the breast tissue are likely fibroglandular, which are then aggregated into a final dense tissue segmentation that is used to compute breast PD%. Our method is validated on a group of 81 women for whom bilateral, mediolateral oblique, raw and processed screening digital mammograms were available, and agreement is assessed with both continuous and categorical density estimates made by a trained breast-imaging radiologist. Results: Strong association between algorithm-estimated and radiologist-provided breast PD% was detected for both raw (r= 0.82, p < 0.001) and processed (r= 0.85, p < 0.001) digital mammograms on a per-breast basis. Stronger agreement was found when overall breast density was assessed on a per-woman basis for both raw (r= 0.85, p < 0.001) and processed (0.89, p < 0.001) mammograms. Strong agreement between categorical density estimates was also seen (weighted Cohen's {kappa}{>=} 0.79). Repeated measures analysis of variance demonstrated no statistically significant differences between the PD% estimates (p > 0.1) due to either presentation of the image (raw vs processed) or method of PD% assessment (radiologist vs algorithm). Conclusions: The proposed fully automated algorithm was successful in estimating breast percent density from both raw and processed digital mammographic images. Accurate assessment of a woman's breast density is critical in order for the estimate to be incorporated into risk assessment models. These results show promise for the clinical application of the algorithm in quantifying breast density in a repeatable manner, both at time of imaging as well as in retrospective studies.
60 APPLIED LIFE SCIENCES↗
Open clusters in the Kepler field. II. NGC 6866
We have developed a maximum-likelihood procedure to fit theoretical isochrones to the observed cluster color-magnitude diagrams of NGC 6866, an open cluster in the Kepler spacecraft field of view. The Markov chain Monte Carlo algorithm permits exploration of the entire parameter space of a set of isochrones to find both the best solution and the statistical uncertainties. For clusters in the age range of NGC 6866 with few, if any, red giant members, a purely photometric determination of the cluster properties is not well-constrained. Nevertheless, based on our UBVRI photometry alone, we have derived the distance, reddening, age, and metallicity of the cluster and established estimates for the binary nature and membership probability of individual stars. We derive the following values for the cluster properties: (m – M) {sub V} = 10.98 ± 0.24, E(B – V) = 0.16 ± 0.04 (so the distance = 1250 pc), age =705 ± 170 Myr, and Z = 0.014 ± 0.005.
79 ASTRONOMY AND ASTROPHYSICS↗
Mapping Strain-rate Dependent Dislocation-Defect Interactions by Atomistic Simulations
Probing the mechanisms of defect-defect interactions at strain rates lower than 106 s-1 is an unresolved challenge to date to molecular dynamics (MD) techniques. Here we propose a novel atomistic approach based on transition state theory and the concept of a strain-dependent effective activation barrier that is capable of simulating the kinetics of dislocation-defect interactions at virtually any strain rate, exemplified within 10-7 to 107 s-1. We apply this approach to the problem of an edge dislocation colliding with a cluster of self-interstitial atoms (SIA) under shear deformation. Using an activation-relaxation algorithm (1), we uncover a unique strain-rate dependent trigger mechanism that allows the SIA cluster to be absorbed during the process leading to dislocation climb. Guided by this finding, we determine the activation barrier of the trigger mechanism as a function of shear strain, and use that in a coarse-graining rate equation formulation for constructing a mechanism map in the phase space of strain-rate and temperature. Our predictions of a crossover from a defect recovery at the low strain rate regime to defect absorption behavior in the high strain-rate regime are validated against our own independent, direct MD simulations at 105 to 107 s-1. Implications of the present approach for probing molecular-level mechanisms in strain-rate regimes previously considered inaccessible to atomistic simulations are discussed.
activation mecanism↗
Probability friends-of-friends (PFOF) group finder: Performance study and observational data applications on photometric surveys
In tandem with observational data sets, we utilize realistic mock catalogs, based on a semi-analytic galaxy formation model, constructed specifically for Pan-STARRS1 Medium Deep Surveys to assess the performance of the Probability Friends-of-Friends (PFOF) group finder, and aim to develop a grouping optimization method applicable to surveys like Pan-STARRS1. Producing mock PFOF group catalogs under a variety of photometric redshift accuracies (σ{sub Δz/(1+z{sub s)}}), we find that catalog purities and completenesses from 'good' (σ{sub Δz/(1+z{sub s)}}∼ 0.01) to 'poor' (σ{sub Δz/(1+z{sub s)}}∼ 0.07) photo-zs gradually degrade from 77% and 70% to 52% and 47%, respectively. A 'subset optimization' approach is developed by using spectroscopic-redshift group data from the target field to train the group finder for application to that field and demonstrated using zCOSMOS groups for PFOF searches within PS1 Medium Deep Field04 (PS1MD04) and DEEP2 EGS groups in PS1MD07. With four data sets spanning the photo-z accuracy range from 0.01 to 0.06, we find purities and completenesses agree with their mock analogs. Further tests are performed via matches to X-ray clusters. We find PFOF groups match ∼85% of X-ray clusters identified in COSMOS and PS1MD04, lending additional support to the reliability of the detection algorithm. In the end, we demonstrate, by separating red and blue group galaxies in the EGS and PS1MD07 group catalogs, that the algorithm is not biased with respect to specifically recovering galaxies by color. The analyses suggest the PFOF algorithm shows great promise as a reliable group finder for photometric galaxy surveys of varying depth and coverage.
79 ASTRONOMY AND ASTROPHYSICS↗
Interlaced coarse-graining for the dynamic cluster approximation
The dynamical cluster approximation (DCA) and its DCA + extension use coarse-graining of the momentum space to reduce the complexity of quantum many-body problems, thereby mapping the bulk lattice to a cluster embedded in a dynamical mean-field host. In this work, we introduce a new form of an interlaced coarse-graining and compare it with the traditional coarse-graining. While it gives a more localized self-energy for a given cluster size, we show that it leads to more controlled results with weaker cluster shape and smoother cluster size dependence, which converge to the results obtained from the standard coarse-graining with increasing cluster size. Most importantly, the new coarse-graining reduces the severity of the fermionic sign problem of the underlying quantum Monte Carlo cluster solver and thus allows for calculations on larger clusters. This enables the treatment of correlations longer ranged than those accessible with the standard coarse-graining and thus can allow for the evaluation of the exact infinite cluster size result via finite size scaling. As a demonstration, we study the hole-doped two-dimensional Hubbard model and show that the interlaced coarse-graining in combination with the extended DCA + algorithm permits the determination of the superconducting T c on cluster sizes for which the results can be fit with a Kosterlitz-Thouless scaling law.
75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
A NEW METHOD TO CORRECT FOR FIBER COLLISIONS IN GALAXY TWO-POINT STATISTICS
In fiber-fed galaxy redshift surveys, the finite size of the fiber plugs prevents two fibers from being placed too close to one another, limiting the ability to study galaxy clustering on all scales. We present a new method for correcting such fiber collision effects in galaxy clustering statistics based on spectroscopic observations. The target galaxy sample is divided into two distinct populations according to the targeting algorithm of fiber placement, one free of fiber collisions and the other consisting of collided galaxies. The clustering statistics are a combination of the contributions from these two populations. Our method makes use of observations in tile overlap regions to measure the contributions from the collided population, and to therefore recover the full clustering statistics. The method is rooted in solid theoretical ground and is tested extensively on mock galaxy catalogs. We demonstrate that our method can well recover the projected and the full three-dimensional (3D) redshift-space two-point correlation functions (2PCFs) on scales both below and above the fiber collision scale, superior to the commonly used nearest neighbor and angular correction methods. We discuss potential systematic effects in our method. The statistical correction accuracy of our method is only limited by sample variance, which scales down with (the square root of) the volume probed. For a sample similar to the final SDSS-III BOSS galaxy sample, the statistical correction error is expected to be at the level of 1% on scales {approx}0.1-30 h {sup -1} Mpc for the 2PCFs. The systematic error only occurs on small scales, caused by imperfect correction of collision multiplets, and its magnitude is expected to be smaller than 5%. Our correction method, which can be generalized to other clustering statistics as well, enables more accurate measurements of full 3D galaxy clustering on all scales with galaxy redshift surveys.
79 ASTRONOMY AND ASTROPHYSICS↗
Measuring Chemical Likeness of Stars with Relevant Scaled Component Analysis
Identification of chemically similar stars using elemental abundances is core to many pursuits within Galactic archeology. However, measuring the chemical likeness of stars using abundances directly is limited by systematic imprints of imperfect synthetic spectra in abundance derivation. We present a novel data-driven model that is capable of identifying chemically similar stars from spectra alone. We call this relevant scaled component analysis (RSCA). RSCA finds a mapping from stellar spectra to a representation that optimizes recovery of known open clusters. By design, RSCA amplifies factors of chemical abundance variation and minimizes those of nonchemical parameters, such as instrument systematics. The resultant representation of stellar spectra can therefore be used for precise measurements of chemical similarity between stars. We validate RSCA using 185 cluster stars in 22 open clusters in the Apache Point Observatory Galactic Evolution Experiment survey. We quantify our performance in measuring chemical similarity using a reference set of 151,145 field stars. We find that our representation identifies known stellar siblings more effectively than stellar-abundance measurements. Using RSCA, 1.8% of pairs of field stars are as similar as birth siblings, compared to 2.3% when using stellar-abundance labels. We find that almost all of the information within spectra leveraged by RSCA fits into a two-dimensional basis, which we link to [Fe/H] and α-element abundances. We conclude that chemical tagging of stars to their birth clusters remains prohibitive. However, using the spectra has noticeable gain, and our approach is poised to benefit from larger data sets and improved algorithm designs.
79 ASTRONOMY AND ASTROPHYSICS↗
Combining Spectroscopic and Imaging Galaxy Surveys for Improved Measurements of Large-Scale Structure
Galaxy imaging surveys represent a promising opportunity for testing cosmological models but suffer from significant challenges associated with galaxy redshift uncertainty. I present improved techniques for the use of spectroscopic redshifts for measurements of large-scale structure with galaxy imaging surveys. I additionally present the results of the application of these techniques to data from the Sloan Digital Sky Survey (SDSS) and the Dark Energy Survey (DES). The results of my work are photometric redshift measurements of the approximately 100 million galaxies comprising the the DES Year 3 Weak Lensing Source Galaxy Catalog, constraints on parameters of the Lambda-CDM cosmological model based on the gravitational lensing and clustering of the DES Year 3 source and lens galaxy catalogs, an algorithm for propagating uncertainties measured in simulations to analogous measurements on data, and measurements of the incidence of projection effects in optically detected clusters of galaxies. I argue that continued development of the methods I have worked on is a promising path toward a conclusive test of Lambda-CDM with galaxy surveys.
79 ASTRONOMY AND ASTROPHYSICS↗
Global Optimization of Chemical Cluster Structures: Methods, Applications, and Challenges
Chemical clusters are relevant to many applications in catalysis, separations, materials, and energy sciences. Experimentally, the structure of clusters is difficult to determine, but it is very important in understanding their chemistry and properties. Computational methods can be used to examine cluster structure, however finding the most stable structure is not simple, particularly as the cluster size increases. Global optimization techniques have long been used to tackle the problem of the most stable structure, but such approaches would have to look for a global minimum, while sampling local minima over the whole potential energy surface as well. In this review, the state-of-the-art theory of global optimization theory is summarized. First, the definition, significance, relation to experiments, and a brief history of global optimization is presented. We then discuss, in more detail, three versatile global optimization methods: the basin hopping, the artificial bee colony algorithm, and the genetic algorithm. We close with some representative application examples of global optimization of clusters since 2016 and the challenges, open questions and opportunities in this field.
Global optimization, Chemical clusters, Artificial↗
Domain-Specific Languages For Developing and Deploying Signature Discovery Workflows
Domain-agnostic Signature Discovery entails scientific investigation across multiple domains through the re-use of existing algorithms into workflows. The existing algorithms may be written in any programming language for various hardware architectures (e.g., desktops, commodity clusters, and specialized parallel hardware platforms). This raises an engineering issue in generating Web services for heterogeneous algorithms so that they can be composed into a scientific workflow environment (e.g., Taverna). In this paper, we present our software tool that defines two simple Domain-Specific Languages (DSLs) to automate these processes: SDL and WDL. Our Service Description Language (SDL) describes key elements of a signature discovery algorithm and generates the service code. The Workflow Description Language (WDL) describes the pipeline of services and generates deployable artifacts for the Taverna workflow management system. We demonstrate our tool with a landscape classification example that is represented by BLAST workflows composed of services that wrap original scripts.
Jacob, Ferosh↗
Symbol alphabets from plabic graphs
Symbol alphabets of n-particle amplitudes in N = 4 super-Yang-Mills theory are known to contain certain cluster variables of Gr(4, n) as well as certain algebraic functions of cluster variables. In this paper we suggest an algorithm for computing these symbol alphabets from plabic graphs by solving matrix equations of the form C ∙ Z = 0 to associate functions on Gr(m, n) to parameterizations of certain cells of Gr(k, n) indexed by plabic graphs. For m = 4 and n = 8 we show that this association precisely reproduces the 18 algebraic symbol letters of the two-loop NMHV eight-particle amplitude from four plabic graphs.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Development and Evaluation of HVAC Operation Schedule Detection Algorithm
Small- and medium-sized (<50,000 sf) commercial buildings (SMBs) represent over 94% of the U.S. commercial building stock and consume over 1018 kJ (~1015 Btus) of total site energy. Many of these buildings use rudimentary controls that are mostly manual, with limited scheduling capability and no monitoring or failure management. Therefore, many of them are operated inefficiently and consume excess energy. SMBs typically use packaged rooftop units (RTUs) that are controlled by an individual thermostat. Studies have shown that managing set points and schedules of the RTUs will result in up to 20% energy/cost savings. This paper is focused only on the detection of the occupancy schedule using the zone temperature. The paper describes the methodology to detect the occupancy schedule, the metric used to validate the algorithm and the validation results. The algorithm has been tested and validated using field data from a number of RTUs from six buildings in different climate locations. Overall, the algorithm was successful in detecting the occupancy schedule using a symbolic aggregate approximation (SAX) technique. The results showed that the occupancy schedule detection algorithm using the SAX method performs well under summer (hot) and winter (cold) weather conditions when energy use is the highest. The algorithm can also distinguish different schedules and generate clusters of occupancy scheduling based on zone temperature measurements alone.
Kim, Woohyun↗
Implementation of Parallel Dynamic Simulation on Shared-Memory vs. Distributed-Memory Environments
Power system dynamic simulation computes the system response to a sequence of large disturbance, such as sudden changes in generation or load, or a network short circuit followed by protective branch switching operation. It consists of a large set of differential and algebraic equations, which is computational intensive and challenging to solve using single-processor based dynamic simulation solution. High-performance computing (HPC) based parallel computing is a very promising technology to speed up the computation and facilitate the simulation process. This paper presents two different parallel implementations of power grid dynamic simulation using Open Multi-processing (OpenMP) on shared-memory platform, and Message Passing Interface (MPI) on distributed-memory clusters, respectively. The difference of the parallel simulation algorithms and architectures of the two HPC technologies are illustrated, and their performances for running parallel dynamic simulation are compared and demonstrated.
dynamic simulation↗