Search NASA⌕ Search

SEARCH · Search NASA

Results for “Dynamic clustering algorithm”

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 91 records · Page 5

Simulations of the dissociation of small helium clusters with ab initio molecular dynamics in electronically excited states

The dynamics resulting from electronic excitations of helium clusters were explored using ab initio molecular dynamics. The simulations were performed with configuration interaction singles and adiabatic classical dynamics coupled to a state-following algorithm. 100 different configurations of He{sub 7} were excited into the 2s and 2p manifold for a total of 2800 trajectories. While the most common outcome (90%) was complete fragmentation to 6 ground state atoms and 1 excited state atom, 3% of trajectories yielded bound, He {sub 2}{sup *}, and <0.5% yielded an excited helium trimer. The nature of the dynamics, kinetic energy release, and connections to experiments are discussed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Prediction of novel stable Fe-V-Si ternary phase

Genetic algorithm searches based on a cluster expansion model are performed to search for stable phases of Fe-V-Si ternary. Here, we identify a new thermodynamically, dynamically and mechanically stable ternary phase of Fe 5 V 2 Si with 2 formula units in a tetragonal unit cell. The formation energy of this new ternary phase is -36.9 meV/atom below the current ternary convex hull. The magnetic moment of Fe in the new structure varies from -0.30-2.52 μ B depending strongly on the number of Fe nearest neighbors. The total magnetic moment is 10.44 μ B /unit cell for new Fe 5 V 2 Si structure and the system is ordinarily metallic.

36 MATERIALS SCIENCE↗

Velocity dispersions of clusters in the Dark Energy Survey Y3 redMaPPer catalogue

ABSTRACT We measure the velocity dispersions of clusters of galaxies selected by the red-sequence Matched-filter Probabilistic Percolation (redMaPPer) algorithm in the first three years of data from the Dark Energy Survey (DES), allowing us to probe cluster selection and richness estimation, λ, in light of cluster dynamics. Our sample consists of 126 clusters with sufficient spectroscopy for individual velocity dispersion estimates. We examine the correlations between cluster velocity dispersion, richness, X-ray temperature, and luminosity, as well as central galaxy velocity offsets. The velocity dispersion–richness relation exhibits a bimodal distribution. The majority of clusters follow scaling relations between velocity dispersion, richness, and X-ray properties similar to those found for previous samples; however, there is a significant population of clusters with velocity dispersions that are high for their richness. These clusters account for roughly 22 per cent of the λ < 70 systems in our sample, but more than half (55 per cent) of λ < 70 clusters at z > 0.5. A couple of these systems are hot and X-ray bright as expected for massive clusters with richnesses that appear to have been underestimated, but most appear to have high velocity dispersions for their X-ray properties likely due to line-of-sight structure. These results suggest that projection effects contribute significantly to redMaPPer selection, particularly at higher redshifts and lower richnesses. The redMaPPer determined richnesses for the velocity dispersion outliers are consistent with their X-ray properties, but several are X-ray undetected and deeper data are needed to understand their nature.

79 ASTRONOMY AND ASTROPHYSICS↗

A COMPRESSED SENSING METHOD WITH ANALYTICAL RESULTS FOR LIDAR FEATURE CLASSIFICATION

We present an innovative way to autonomously classify LiDAR points into bare earth, building, vegetation, and other categories. One desirable product of LiDAR data is the automatic classification of the points in the scene. Our algorithm automatically classifies scene points using Compressed Sensing Methods via Orthogonal Matching Pursuit algorithms utilizing a generalized K-Means clustering algorithm to extract buildings and foliage from a Digital Surface Models (DSM). This technology reduces manual editing while being cost effective for large scale automated global scene modeling. Quantitative analyses are provided using Receiver Operating Characteristics (ROC) curves to show Probability of Detection and False Alarm of buildings vs. vegetation classification. Histograms are shown with sample size metrics. Our inpainting algorithms then fill the voids where buildings and vegetation were removed, utilizing Computational Fluid Dynamics (CFD) techniques and Partial Differential Equations (PDE) to create an accurate Digital Terrain Model (DTM) [6]. Inpainting preserves building height contour consistency and edge sharpness of identified inpainted regions. Qualitative results illustrate other benefits such as Terrain Inpainting s unique ability to minimize or eliminate undesirable terrain data artifacts. Keywords: Compressed Sensing, Sparsity, Data Dictionary, LiDAR, ROC, K-Means, Clustering, K-SVD, Orthogonal Matching Pursuit

99 GENERAL AND MISCELLANEOUS↗

Influence of spin-orbit effects on structures and dielectric properties of neutral lead clusters

Combining molecular beam electric deflection experiments and global optimization techniques has proven to be a powerful tool for resolving equilibrium structures of neutral metal and semiconductor clusters. Herein, we present electric molecular beam deflection experiments on Pb{sub N} (N = 7–18) clusters. Promising structures are generated using the unbiased Birmingham Cluster Genetic Algorithm approach based on density functional theory. The structures are further relaxed within the framework of two-component density functional theory taking scalar relativistic and spin orbit effects into account. Quantum chemical results are used to model electric molecular beam deflection profiles based on molecular dynamics calculations. Comparison of measured and simulated beam profiles allows the assignment of equilibrium structures for the most cluster sizes in the examined range for the first time. Neutral lead clusters adopt mainly spherical geometries and resemble the structures of lead cluster cations apart from Pb{sub 10}. Their growth pattern deviates strongly from the one observed for tin and germanium clusters.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Energy-efficient mapping of large-scale workflows under deadline constraints in big data computing systems

Large-scale workflows for big data analytics have become a main consumer of energy in data centers where moldable parallel computing models such as MapReduce are widely applied to meet high computational demands with time-varying computing resources. The granularity of task partitioning in each moldable job of such big data workflows has a significant impact on energy efficiency, which remains largely unexplored. In this paper, we analyze the properties of moldable jobs and formulate a workflow mapping problem to minimize the dynamic energy consumption of a given workflow request under a deadline constraint in big data systems. Since this problem is strongly NP-hard, we design a fully polynomial-time approximation scheme (FPTAS) for a special case with a pipeline-structured workflow on a homogeneous cluster and a heuristic for the generalized problem with an arbitrary workflow on a heterogeneous cluster. The performance superiority of the proposed solution in terms of dynamic energy saving and deadline missing rate is illustrated by extensive simulation results in comparison with existing algorithms, and further validated by real-life workflow implementation and experimental results in Hadoop/YARN systems.

97 MATHEMATICS AND COMPUTING↗

Properties of coupled-cluster equations originating in excitation sub-algebras

In this paper we discuss properties of single-reference coupled cluster (CC) equations associated with the existence of nilpotent sub-algebras of excitations that allow one to represent CC equations in a hybrid fashion where the cluster amplitudes associated with these sub-algebras can be obtained by solving corresponding eigenvalue problem. For closed-shell formulations analyzed in this paper, the hybrid representation of CC equations provides a natural way for extending concepts behind actives-spaces and seniority numbers to provide more accurate description of electron correlation effects. Moreover, new representation can be utilized to re-define iterative algorithms used to solve CC equations, especially for though cases defined by the presence of strong static and dynamic correlation effects. We will also explore invariance properties associated with the nilpotent sub-algebras to define a new class of CC approximations referred in this paper to as the nilpotent-flow-based CC methods. We illustrate the performance of these methods on the example of ground- and excited-state calculations for commonly used small benchmark systems.

Kowalski, Karol↗

Improvement of machine learning enhanced genetic algorithm for nonlinear beam dynamics optimization

On top of the genetic algorithm enhanced by machine learning for nonlinear lattice optimization, as proposed in Li et al. (2018), an improved repopulation technique has been developed. Different weight coefficients for defining the “elite cluster” were compared to discern the fastest convergence in two classic optimization test problems. Additonally, the volume of the parameter space for generating potentially competitive candidates was further confined by repopulation in the vicinity of randomly selected “elite seeds”. The new repopulation technique significantly improves the quality of newly populated candidates by excluding the less competitive seeds introduced by the old repopulation algorithm. Finally, this technique has been validated, having a faster convergence for test problems first, and then applied to the nonlinear lattice optimization for the High Energy Photon Source storage ring.

36 MATERIALS SCIENCE↗

DEATH OF A CLUSTER: THE DESTRUCTION OF M67 AS SEEN BY THE SLOAN DIGITAL SKY SURVEY

We probe the spatial and dynamical structure of the old open cluster M67 using photometric data from the Sloan Digital Sky Survey's sixth data release. Making use of an optimal contrast, or matched filter, algorithm, we map the distribution of high probability members of M67. We find an extended and elongated halo of likely members to a radius of nearly 60'. Our measured core radius of R{sub core} = 8.'24 +- 0.'60 is somewhat larger than that of previous estimates. We attribute the larger core radius measurement to the SDSS probing lower mass main sequence stars than has been done before for similar studies of M67, and the exclusion of post-main-sequence M67 members in the SDSS sample. We estimate the number of M67 members in our SDSS sample to be 1385 +- 67 stars. A lower limit on the binary fraction in M67 is measured to be 45%. A higher fraction of binary stars is measured in the core as compared to the halo, and the luminosity function of the core is found to be more depleted of low-mass stars. Thus, the halo is consistent with mass segregation within the cluster. The galactic orbit of M67 is calculated from recent proper motion and radial velocity determinations. The elongated halo is roughly aligned to the proper motion of the cluster. This appears to be a result of mass segregation due to the galactic tidal field. Our algorithm is run on Two Micron All Sky Survey photometry to directly compare to previous studies of M67. Decreasing core radii is found for stars with greater masses. We test the accuracy of our algorithm using 1000 artificial cluster Monte Carlo simulations. It is found that the matched filter technique is suitable for recovering low-density spatial structures, as well as measuring the binary fraction of the cluster.

79 ASTRONOMY AND ASTROPHYSICS↗

Weighted Dynamic Time Warping for Time Series Classification

Dynamic time warping (DTW), which finds the minimum path by providing non-linear alignments between two time series, has been widely used as a distance measure for time series classification and clustering. However, DTW does not account for the relative importance regarding the phase difference between a reference point and a testing point. This may lead to misclassification especially in applications where the shape similarity between two sequences is a major consideration for an accurate recognition. Therefore, we propose a novel distance measure, called a weighted DTW (WDTW), which is a penalty-based DTW. Our approach penalizes points with higher phase difference between a reference point and a testing point in order to prevent minimum distance distortion caused by outliers. The rationale underlying the proposed distance measure is demonstrated with some illustrative examples. A new weight function, called the modified logistic weight function (MLWF), is also proposed to systematically assign weights as a function of the phase difference between a reference point and a testing point. By applying different weights to adjacent points, the proposed algorithm can enhance the detection of similarity between two time series. We show that some popular distance measures such as DTW and Euclidean distance are special cases of our proposed WDTW measure. We extend the proposed idea to other variants of DTW such as derivative dynamic time warping (DDTW) and propose the weighted version of DDTW. We have compared the performances of our proposed procedures with other popular approaches using public data sets available through the UCR Time Series Data Mining Archive for both time series classification and clustering problems. The experimental results indicate that the proposed approaches can achieve improved accuracy for time series classification and clustering problems.

99 GENERAL AND MISCELLANEOUS↗

Dynamic Mode Decomposition of Random Pressure Fields over Bluff Bodies

Fluctuating surface pressures on a bluff body exposed to a boundary layer flow generally are characterized as a spatiotemporally varying random field. In this paper, a dynamic mode decomposition (DMD) was applied to extract dominant features embedded in these random pressure fields. Utilizing an unsupervised machine learning algorithm, spatial modes and their temporal variations were grouped into different clusters at scales, e.g., macro, meso, and micro. A proper orthogonal decomposition (POD) of the experimental data was carried out to observe commonalities and distinctive perspectives each decomposition offers. Here, a comprehensive examination of the DMD/POD for their convergence criteria, data sufficiency, and modal components analysis was conducted. The physical interpretation of the spatiotemporal pressure field based on these decomposition schemes was discussed. At different scales, the DMD modes can capture the evolution of aerodynamic features, e.g., convection of vortices (or vortex tubes) and other structures. The distribution of energy among these three broad scales also reflects an energy cascade in pressure fluctuations akin to turbulence.

97 MATHEMATICS AND COMPUTING↗

SMALE: Enhancing Scalability of Machine Learning Algorithms on Extreme-Scale Computing Platforms

Deployment and execution of machine learning tasks on extreme-scale computing platforms face several significant technical challenges: 1) High computing cost incurred by dense networks – The computing workload of deep networks with densely-connected topology increases rapidly with the network size, imposing a non-scalable computing model of extreme-scale computing platforms; 2) Non-optimized workload distribution – Many advanced deep learning algorithms, e.g., sparsification and irregular net-work topology, produce very unbalanced workload distribution on extreme-scale computing platforms. The computation efficiency is greatly hindered by the incurred data and computation redundancies as well as long tails of the node with extensive workload; 3) Constraints in data movement and I/O bottle-neck – Inter-node data movement in extreme-scale computing platforms are associated with high energy and latency costs, and subject to the constraints of I/O bandwidth; and 4) Generalization of algorithm realization and acceleration on computing platforms – The large varieties of machine learning algorithms and structures of extreme-scale computing platforms make the derivation of a generalized algorithm realization and acceleration method very challenging, which, however, is the requirement by domain scientists and interested users. We call the above challenges Smale’s Problems in Machine Learning and Understanding for High-Performance Computing Scientific Discovery. The objective of our three-year research project is to develop a holistic innovation set at structure, assembly, and acceleration layers of machine learning algorithms to address the above challenges in algorithm deployment and execution. Three tasks are particularly performed, including: At the algorithm structure level, we investigate the techniques that can structurally sparsify on the topology of deep networks for computing workload reduction. We also study clustering and pruning techniques that can optimize the workload distributions over the extreme-scale computing platforms; At the algorithm assembly level, we derive a unified learning framework for unsupervised transfer learning and dynamic growing capabilities. Novel training methods are also exploited to enhance the training efficiency of the proposed framework; At the algorithm acceleration level, we will develop a series of techniques that can accelerate the computation of sparse matrix operations, which are one of the core executions in deep learning and optimize memory access of the concerned platforms. Our proposed techniques attack the fundamental problems in machine learning algorithms running on extreme-scale computing platforms by vertically integrating the solutions at three closely entangled layers, paving the long-term scaling path of machine learning applications under DOE context. Three tasks corresponding to the above respective research orientations are performed during the three-year project period with our collaborators at ORNL. The outcome of the proposed project is anticipated to form a holistic solution set of novel algorithms and network topologies, efficient training techniques, and fast acceleration methods to promote the computing scalability of the machine learning applications of particular interest to DOE.

97 MATHEMATICS AND COMPUTING↗

Stacking caustic masses from galaxy clusters

Ongoing and future spectroscopic surveys will measure numerous galaxy redshifts within tens of thousands of galaxy clusters. However, the sampling within these clusters will be low, 15 1000 galaxies per ensemble phase space, the escape-velocity edge becomes readily identifiable and the presence of interloping galaxies is minimized. We develop and test an algorithm to trace the projected phase-space surface directly, which results in minimally biased dynamical mass estimates. We then quantify how binning and sampling affect the phase-space-based mass estimates when using an observational proxy that incorporates realistic mass scatter, like richness, and find the added uncertainty in the binning procedure has minimal influence on the resulting bias and scatter of the stacked mass estimates.

79 ASTRONOMY AND ASTROPHYSICS↗

Accelerating error correction in tomographic reconstruction

Abstract Spurred by recent advances in detector technology and X-ray optics, upgrades to scanning-probe-based tomographic imaging have led to an exponential growth in the amount and complexity of experimental data and have created a clear opportunity for tomographic imaging to approach single-atom sensitivity. The improved spatial resolution, however, is highly susceptible to systematic and random experimental errors, such as center of rotation drifts, which may lead to imaging artifacts and prevent reliable data extraction. Here, we present a model-based approach that simultaneously optimizes the reconstructed specimen and sinogram alignment as a single optimization problem for tomographic reconstruction with center of rotation error correction. Our algorithm utilizes an adaptive regularizer that is dynamically adjusted at each alternating iteration step. Furthermore, we describe its implementation in a software package targeting high-throughput workflows for execution on distributed-memory clusters. We demonstrate the performance of our solver on large-scale synthetic problems and show that it is robust to a wide range of noise and experimental drifts with near-ideal throughput.

Ali, Sajid (ORCID:0000000321864636)↗

Hierarchical Petascale Simulation Framework For Stress Corrosion Cracking

A number of major accomplishments resulted from the project. These include: • Data Structures, Algorithms, and Numerical Methods for Reactive Molecular Dynamics. We have developed a range of novel data structures, algorithms, and solvers (amortized ILU, Spike) for use with ReaxFF and charge equilibration. • Parallel Formulations of ReactiveMD (Purdue ReactiveMolecular Dynamics Package, PuReMD, PuReMD-GPU, and PG-PuReMD) for Messaging, GPU, and GPU Cluster Platforms. We have developed efficient serial, parallel (MPI), GPU (Cuda), and GPU Cluster (MPI/Cuda) implementations. Our implementations have been demonstrated to be significantly better than the state of the art, both in terms of performance and scalability. • Comprehensive Validation in the Context of Diverse Applications. We have demonstrated the use of our software in diverse systems, including silica-water, silicon-germanium nanorods, and as part of other projects, extended it to applications ranging from explosives (RDX) to lipid bilayers (biomembranes under oxidative stress). • Open Source Software Packages for Reactive Molecular Dynamics. All versions of our soft- ware have been released over the public domain. There are over 100 major research groups worldwide using our software. • Implementation into the Department of Energy LAMMPS Software Package. We have also integrated our software into the Department of Energy LAMMPS software package.

36 MATERIALS SCIENCE↗

Subhalos in Galaxy Clusters: Coherent Accretion and Internal Orbits

Subhalo dynamics in galaxy cluster host halos govern the observed distribution and properties of cluster member galaxies. We use the IllustrisTNG simulation to investigate the accretion and orbits of subhalos found in cluster-size halos. We find that the median change in the major axis direction of cluster-size host halos is approximately 80° between a ∼ 0.1 and the present day. We identify coherent regions in the angular distribution of subhalo accretion, and ∼68% of accreted subhalos enter their host halo through ∼38% of the surface area at the virial radius. The majority of galaxy clusters in the sample have ∼2 such coherent regions. We further measure angular orbits of subhalos with respect to the host major axis and use a clustering algorithm to identify distinct orbit modes with varying oscillation timescales. The orbit modes correlate with subhalo accretion conditions. Subhalos in orbit modes with shorter oscillations tend to have lower peak masses and accretion directions somewhat more aligned with the major axis. One orbit mode, exhibiting the least oscillatory behavior, largely consists of subhalos that accrete near the plane perpendicular to the host halo major axis. Our findings are consistent with expectations from inflow from major filament structures and internal dynamical friction: most subhalos accrete through coherent regions, and more massive subhalos experience fewer orbits after accretion. Our work offers a unique quantification of subhalo dynamics that can be connected to how the intracluster medium strips and quenches cluster galaxies.

galaxy clusters↗

Tidal stripping stellar substructures around four metal-poor globular clusters in the galactic bulge

We investigate the spatial density configuration of stars around four metal-poor globular clusters (NGC 6266, NGC 6626, NGC 6642, and NGC 6723) in the Galactic bulge region using wide-field deep J, H, and K imaging data obtained with the Wide Field Camera near-infrared array on the United Kingdom Infrared Telescope. A statistical weighted filtering algorithm for the stars on the color–magnitude diagram is applied in order to sort cluster member candidates from the field star contamination. In two-dimensional isodensity contour maps of the clusters, we find that all four of the globular clusters exhibit strong evidence of tidally stripped stellar features beyond the tidal radius in the form of tidal tails or small density lobes/chunks. The orientations of the extended stellar substructures are likely to be associated with the effect of dynamic interaction with the Galaxy and the cluster's space motion. The observed radial density profiles of the four globular clusters also describe the extended substructures; they depart from theoretical King and Wilson models and have an overdensity feature with a break in the slope of the profile at the outer region of clusters. The observed results could imply that four globular clusters in the Galactic bulge region have experienced strong environmental effects such as tidal forces or bulge/disk shocks of the Galaxy during the dynamical evolution of globular clusters. These observational results provide further details which add to our understanding of the evolution of clusters in the Galactic bulge region as well as the formation of the Galaxy.

79 ASTRONOMY AND ASTROPHYSICS↗

Adaptive pruning-based optimization of parameterized quantum circuits

Abstract Variational hybrid quantum–classical algorithms are powerful tools to maximize the use of noisy intermediate-scale quantum devices. While past studies have developed powerful and expressive ansatze, their near-term applications have been limited by the difficulty of optimizing in the vast parameter space. In this work, we propose a heuristic optimization strategy for such ansatze used in variational quantum algorithms, which we call ‘parameter-efficient circuit training (PECT)’. Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms, in which each iteration of the algorithm activates and optimizes a subset of the total parameter set. To update the parameter subset between iterations, we adapt the Dynamic Sparse Reparameterization scheme which was originally proposed for training deep convolutional neural networks. We demonstrate PECT for the Variational Quantum Eigensolver, in which we benchmark unitary coupled-cluster ansatze including UCCSD and k -UpCCGSD, as well as the Low-Depth Circuit Ansatz (LDCA), to estimate ground state energies of molecular systems. We additionally use a layerwise variant of PECT to optimize a hardware-efficient circuit for the Sycamore processor to estimate the ground state energy densities of the one-dimensional Fermi-Hubbard model. From our numerical data, we find that PECT can enable optimizations of certain ansatze that were previously difficult to converge and more generally can improve the performance of variational algorithms by reducing the optimization runtime and/or the depth of circuits that encode the solution candidate(s).

Physics↗