Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 937 records · Page 52

Unsupervised Learning for Improved Gamma-Ray Spectrometry in Pixelated Cadmium Zinc Telluride (CZT) Detectors

Machine learning has been found to be ubiquitously useful across many industries, presenting an opportunity to improve radiation detection performance using data-driven algorithms. Improved detector resolution can aid in the detection, identification, and quantification of radionuclides. Here, in this work, a novel, data-driven, unsupervised learning approach is developed to improve detector spectral characteristics by learning, and subsequently rejecting, poorly performing regions of the pixelated detector. Feature engineering is used to fit individual characteristic photo peaks to a Doniach lineshape with a linear background model. Then, principal component analysis is used to learn a lower-dimension latent space representation of each photo peak where the pixels are clustered, and subsequently ranked, based on the cluster mean distance to an optimal point. Pixels within the worst cluster(s) are rejected to improve the full-width at half-maximum (FWHM) by 10% to 15% (relative to the bulk detector) at 50% net efficiency when applied to training data obtained from measurements of a 100 μCi 154 Eu source using a H3D M400i pixelated cadmium zinc telluride detector. These results compare well with, but do not outperform, a greedy algorithm that accumulates pixels in order of FWHM from lowest to highest used as a benchmark. In the future, this approach can be extended to include the detector energy and angular response. Finally, the model is applied to newly seen natural and enriched uranium spectra relevant for nuclear safeguards applications.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Towards Superior Software Portability with SHAD and HPX C++ Libraries

As hardware architectures and software stacks complexity grows, development productivity, performance and software portability, quickly evolve from desirable features to actual needs. SHAD, the Scalable High-performance Algorithms and Data-structures C++ library is designed to mitigate these issues: it provides general purpose building blocks as well as high-level custom utilities, and offers a shared-memory programming abstraction which facilitates the programming of complex systems, scaling up to High Performance Computing clusters. SHAD’s portability is achieved through an abstract runtime interface, which decouples the upper layers of the library and hides the low level details of the underlying architecture. This layer enables SHAD to interface with different runtime/threading systems, e.g. Intel TBB and Global Memory and Threading (GMT). However, current backends targeting distributed systems, rely on a centralized controller which may possibly limit scalability up to hundreds of nodes and creates a network hot spot due to all to one communication for synchronization, and possibly resulting in degraded performance at high process counts. In this research, we explore HPX, the C++ standard library for parallelism and concurrency, as an additional backend in support of the SHAD library, and present the methodologies in support of local and remote task executions in SHAD with respect to HPX. Finally, we evaluate the proposed system by comparing against existing backends of SHAD and analyzing their performance on C++ Standard Template Library algorithms.

Wu, Nanmiao↗

Multiscale Computer Simulation of Tensile and Compressive Strain in Polymer- Coated Silica Aerogels

While the low thermal conductivities of silica aerogels have made them of interest to the aerospace community as lightweight thermal insulation, the application of conformal polymer coatings to these gels increases their strength significantly, making them potentially useful as structural materials as well. In this work we perform multiscale computer simulations to investigate the tensile and compressive strain behavior of silica and polymer-coated silica aerogels. Aerogels are made up of clusters of interconnected particles of amorphous silica of less than bulk density. We simulate gel nanostructure using a Diffusion Limited Cluster Aggregation (DLCA) procedure, which produces aggregates that exhibit fractal dimensions similar to those observed in real aerogels. We have previously found that model gels obtained via DLCA exhibited stress-strain curves characteristic of the experimentally observed brittle failure. However, the strain energetics near the expected point of failure were not consistent with such failure. This shortcoming may be due to the fact that the DLCA process produces model gels that are lacking in closed-loop substructures, compared with real gels. Our model gels therefore contain an excess of dangling strands, which tend to unravel under tensile strain, producing non-brittle failure. To address this problem, we have incorporated a modification to the DLCA algorithm that specifically produces closed loops in the model gels. We obtain the strain energetics of interparticle connections via atomistic molecular statics, and abstract the collective energy of the atomic bonds into a Morse potential scaled to describe gel particle interactions. Polymer coatings are similarly described. We apply repeated small uniaxial strains to DLCA clusters, and allow relaxation of the center eighty percent of the cluster between strains. The simulations produce energetics and stress-strain curves for looped and nonlooped clusters, for a variety of densities and interaction parameters.

Good, Brian↗

Three-dimensional, shock-on-shock interaction problem

The unsteady, three-dimensional flowfield resulting from the interaction of a plane shock with a cone-shaped vehicle traveling supersonically is determined, using a second-order, shock-capturing, finite-difference approach. The time-dependent, inviscid gasdynamic equations are transformed to include the self-similar property of the flow, to align various coordinate surfaces with known shock waves, and to cluster points in the vicinity of the intersection of the transmitted incident shock and the surface of the vehicle. The governing partial differential equations in conservation-law form are then solved iteratively using MacCormack's (1969) algorithm.

Kutler, P.↗

Clustering of very luminous infrared galaxies and their environment

The IRAS survey reveals a class of ultraluminous infrared (IR) galaxies (ULIRG's) with IR luminosities comparable to the bolometric luminosities of quasars. The nature, origin, and evolution of ULIRG's are attracting more and more attention recently. Since galaxy morphology is certainly a function of environment, morphological observations show that ULIRG's are interacting/merging galaxies, and some ULIRG's might be the dust-enshrouded quasars (S88) or giant ellipticals, the study of ULIRG's environment and large scale clustering effects should be worthwhile. ULIRG's and very luminous IR galaxies have been selected from the 2Jy IRAS redshift survey. Meanwhile, a catalog of IRAS groups of galaxies has been constructed using a percolation-like algorithm. Therefore, whether ULIRG's and/or VLIRG's have a group environment can be checked immediately. Other aspects of the survey are discussed.

Gao, YU↗

Efficiency Improvements to the Displacement Based Multilevel Structural Optimization Algorithm

Multilevel Structural Optimization (MSO) continues to be an area of research interest in engineering optimization. In the present project, the weight optimization of beams and trusses using Displacement based Multilevel Structural Optimization (DMSO), a member of the MSO set of methodologies, is investigated. In the DMSO approach, the optimization task is subdivided into a single system and multiple subsystems level optimizations. The system level optimization minimizes the load unbalance resulting from the use of displacement functions to approximate the structural displacements. The function coefficients are then the design variables. Alternately, the system level optimization can be solved using the displacements themselves as design variables, as was shown in previous research. Both approaches ensure that the calculated loads match the applied loads. In the subsystems level, the weight of the structure is minimized using the element dimensions as design variables. The approach is expected to be very efficient for large structures, since parallel computing can be utilized in the different levels of the problem. In this paper, the method is applied to a one-dimensional beam and a large three-dimensional truss. The beam was tested to study possible simplifications to the system level optimization. In previous research, polynomials were used to approximate the global nodal displacements. The number of coefficients of the polynomials equally matched the number of degrees of freedom of the problem. Here it was desired to see if it is possible to only match a subset of the degrees of freedom in the system level. This would lead to a simplification of the system level, with a resulting increase in overall efficiency. However, the methods tested for this type of system level simplification did not yield positive results. The large truss was utilized to test further improvements in the efficiency of DMSO. In previous work, parallel processing was applied to the subsystems level, where the derivative verification feature of the optimizer NPSOL had been utilized in the optimizations. This resulted in large runtimes. In this paper, the optimizations were repeated without using the derivative verification, and the results are compared to those from the previous work. Also, the optimizations were run on both, a network of SUN workstations using the MPICH implementation of the Message Passing Interface (MPI) and on the faster Beowulf cluster at ICASE, NASA Langley Research Center, using the LAM implementation of UP]. The results on both systems were consistent and showed that it is not necessary to verify the derivatives and that this gives a large increase in efficiency of the DMSO algorithm.

Plunkett, C. L.↗

Using Fuzzy Clustering for Real-time Space Flight Safety

To ensure space flight safety, it is necessary to monitor myriad sensor readings on the ground and in flight. Since a space shuttle has many sensors, monitoring data and drawing conclusions from information contained within the data in real time is challenging. The nature of the information can be critical to the success of the mission and safety of the crew and therefore, must be processed with minimal data-processing time. Data analysis algorithms could be used to synthesize sensor readings and compare data associated with normal operation with the data obtained that contain fault patterns to draw conclusions. Detecting abnormal operation during early stages in the transition from safe to unsafe operation requires a large amount of historical data that can be categorized into different classes (non-risk, risk). Even though the 40 years of shuttle flight program has accumulated volumes of historical data, these data don t comprehensively represent all possible fault patterns since fault patterns are usually unknown before the fault occurs. This paper presents a method that uses a similarity measure between fuzzy clusters to detect possible faults in real time. A clustering technique based on a fuzzy equivalence relation is used to characterize temporal data. Data collected during an initial time period are separated into clusters. These clusters are characterized by their centroids. Clusters formed during subsequent time periods are either merged with an existing cluster or added to the cluster list. The resulting list of cluster centroids, called a cluster group, characterizes the behavior of a particular set of temporal data. The degree to which new clusters formed in a subsequent time period are similar to the cluster group is characterized by a similarity measure, q. This method is applied to downlink data from Columbia flights. The results show that this technique can detect an unexpected fault that has not been present in the training data set.

Lee, Charles↗

Adaptive grid methods for RLV environment assessment and nozzle analysis

Rapid access to highly accurate data about complex configurations is needed for multi-disciplinary optimization and design. In order to efficiently meet these requirements a closer coupling between the analysis algorithms and the discretization process is needed. In some cases, such as free surface, temporally varying geometries, and fluid structure interaction, the need is unavoidable. In other cases the need is to rapidly generate and modify high quality grids. Techniques such as unstructured and/or solution-adaptive methods can be used to speed the grid generation process and to automatically cluster mesh points in regions of interest. Global features of the flow can be significantly affected by isolated regions of inadequately resolved flow. These regions may not exhibit high gradients and can be difficult to detect. Thus excessive resolution in certain regions does not necessarily increase the accuracy of the overall solution. Several approaches have been employed for both structured and unstructured grid adaption. The most widely used involve grid point redistribution, local grid point enrichment/derefinement or local modification of the actual flow solver. However, the success of any one of these methods ultimately depends on the feature detection algorithm used to determine solution domain regions which require a fine mesh for their accurate representation. Typically, weight functions are constructed to mimic the local truncation error and may require substantial user input. Most problems of engineering interest involve multi-block grids and widely disparate length scales. Hence, it is desirable that the adaptive grid feature detection algorithm be developed to recognize flow structures of different type as well as differing intensity, and adequately address scaling and normalization across blocks. These weight functions can then be used to construct blending functions for algebraic redistribution, interpolation functions for unstructured grid generation, forcing functions to attract/repel points in an elliptic system, or to trigger local refinement, based upon application of an equidistribution principle. The popularity of solution-adaptive techniques is growing in tandem with unstructured methods. The difficultly of precisely controlling mesh densities and orientations with current unstructured grid generation systems has driven the use of solution-adaptive meshing. Use of derivatives of density or pressure are widely used for construction of such weight functions, and have been proven very successful for inviscid flows with shocks. However, less success has been realized for flowfields with viscous layers, vortices or shocks of disparate strength. It is difficult to maintain the appropriate mesh point spacing in the various regions which require a fine spacing for adequate resolution. Mesh points often migrate from important regions due to refinement of dominant features. An example of this is the well know tendency of adaptive methods to increase the resolution of shocks in the flowfield around airfoils, but in the incorrect location due to inadequate resolution of the stagnation region. This problem has been the motivation for this research.

Thornburg, Hugh J.↗

A Hardware-in-the-Loop Testbed for Spacecraft Formation Flying Applications

The Formation Flying Test Bed (FFTB) at NASA Goddard Space Flight Center (GSFC) is being developed as a modular, hybrid dynamic simulation facility employed for end-to-end guidance, navigation, and control (GN&C) analysis and design for formation flying clusters and constellations of satellites. The FFTB will support critical hardware and software technology development to enable current and future missions for NASA, other government agencies, and external customers for a wide range of missions, particularly those involving distributed spacecraft operations. The initial capabilities of the FFTB are based upon an integration of high fidelity hardware and software simulation, emulation, and test platforms developed at GSFC in recent years; including a high-fidelity GPS simulator which has been a fundamental component of the Guidance, Navigation, and Control Center's GPS Test Facility. The FFTB will be continuously evolving over the next several years from a too[ with initial capabilities in GPS navigation hardware/software- in-the- loop analysis and closed loop GPS-based orbit control algorithm assessment to one with cross-link communications and relative navigation analysis and simulation capability. Eventually the FFT13 will provide full capability to support all aspects of multi-sensor, absolute and relative position determination and control, in all (attitude and orbit) degrees of freedom, as well as information management for satellite clusters and constellations. In this paper we focus on the architecture for the FFT13 as a general GN&C analysis environment for the spacecraft formation flying community inside and outside of NASA GSFC and we briefly reference some current and future activities which will drive the requirements and development.

Leitner, Jesse↗

Scalable molecular dynamics on CPU and GPU architectures with NAMD

NAMD is a molecular dynamics program designed for high-performance simulations of very large biological objects on CPU- and GPU-based architectures. NAMD offers scalable performance on petascale parallel supercomputers consisting of hundreds of thousands of cores, as well as on inexpensive commodity clusters commonly found in academic environments. It is written in C++ and leans on Charm++ parallel objects for optimal performance on low-latency architectures. NAMD is a versatile, multipurpose code that gathers state-of-the-art algorithms to carry out simulations in apt thermodynamic ensembles, using the widely popular CHARMM, AMBER, OPLS, and GROMOS biomolecular force fields. Here, we review the main features of NAMD that allow both equilibrium and enhanced-sampling molecular dynamics simulations with numerical efficiency. We describe the underlying concepts utilized by NAMD and their implementation, most notably for handling long-range electrostatics; controlling the temperature, pressure, and pH; applying external potentials on tailored grids; leveraging massively parallel resources in multiple-copy simulations; and hybrid quantum-mechanical/molecular-mechanical descriptions. We detail the variety of options offered by NAMD for enhanced-sampling simulations aimed at determining free-energy differences of either alchemical or geometrical transformations and outline their applicability to specific problems. Last, we discuss the roadmap for the development of NAMD and our current efforts toward achieving optimal performance on GPU-based architectures, for pushing back the limitations that have prevented biologically realistic billion-atom objects to be fruitfully simulated, and for making large-scale simulations less expensive and easier to set up, run, and analyze. NAMD is distributed free of charge with its source code at www.ks.uiuc.edu.

high-performance computing↗

CMB/kSZ and Compton-y Maps from 2500 deg 2 of SPT-SZ and Planck Survey Data

Abstract We present component-separated maps of the primary cosmic microwave background/kinematic Sunyaev–Zel’dovich (SZ) amplitude and the thermal SZ Compton- y parameter, created using data from the South Pole Telescope (SPT) and the Planck satellite. These maps, which cover the ∼2500 deg 2 of the southern sky imaged by the SPT-SZ survey, represent a significant improvement over previous such products available in this region by virtue of their higher angular resolution ( 1 .′ 25 for our highest-resolution Compton- y maps) and lower noise at small angular scales. In this work we detail the construction of these maps using linear combination techniques, including our method for limiting the correlation of our lowest-noise Compton- y map products with the cosmic infrared background. We perform a range of validation tests on these data products to test our sky modeling and combination algorithms, and we find good performance in all of these tests. Recognizing the potential utility of these data products for a wide range of astrophysical and cosmological analyses, including studies of the gas properties of galaxies, groups, and clusters, we make these products publicly available at http://pole.uchicago.edu/public/data/sptsz_ymap and on the NASA/LAMBDA website.

79 ASTRONOMY AND ASTROPHYSICS↗

Simulation of Guidance, Navigation, and Control Systems for Formation Flying Missions

Concepts for missions of distributed spacecraft flying in formation abound. From high resolution interferometry to spatially distributed in-situ measurements, these mission concepts levy a myriad of guidance, navigation, and control (GNC) requirements on the spacecraft/formation as a single system. A critical step toward assessing and meeting these challenges lies in realistically simulating distributed spacecraft systems. The Formation Flying TestBed (FFTB) at NASA Goddard Space Flight Center's (GSFC) Guidance, Navigation, and Control Center is a hardware-in-the-loop simulation and development facility focused on GNC issues relevant to formation flying systems. The FFTB provides a realistic simulation of the vehicle dynamics and control for formation flying missions in order to: (1) conduct feasibility analyses of mission requirements, (2) conduct and answer mission and spacecraft design trades, and (3) serve as a host for GNC software and hardware development and testing. The initial capabilities of the FFTB are based upon an integration of high fidelity hardware and software simulation, emulation, and test platforms developed or employed at GSFC in recent years, including a high-fidelity Global Positioning System (GPS) simulator which has been a fundamental component of the GNC Center's GPS Test Facility. The FFTB will be continuously evolving over the next several years from a tool with capabilities in GPS navigation hardware/software-in-the-loop analysis and closed loop GPS-based orbit control algorithm assessment. Eventually, it will include full capability to support all aspects of multi-sensor, absolute and relative state determination and control, in all (attitude and orbit) degrees of freedom, as well as information management for satellite clusters and constellations. A detailed description of the FFTB architecture is presented in the paper.

Burns, Rich↗

Diffusion Monte Carlo approaches for studying nuclear quantum effects in fluxional molecules

Abstract Diffusion quantum Monte Carlo (DMC) provides a powerful approach for obtaining the ground state energy and wave function of molecules, ions, and molecular clusters. The approach is uniquely well suited for studies of fluxional molecules, which undergo large amplitude vibrational motions even in their ground state. In contrast to the electronic structure problem, where the wave function must be antisymmetric with respect to exchange of any pair of electrons, the wave function for the ground vibrational state is nodeless. This greatly simplifies the application of DMC for vibrational problems. Because there is not a single potential function that can be used to describe the intramolecular and intermolecular interactions in all molecular systems, most methods that are used to describe nuclear quantum effects rely on a carefully chosen zero‐order description of the molecular vibrations. In contrast, DMC calculations can be performed in Cartesian coordinates, making the DMC algorithm easily transferable between different chemical systems. In this contribution, the theory that underlies DMC will be discussed along with important considerations for performing DMC calculations. Extensions for evaluating vibrationally excited states and molecular properties are also discussed. Insights that can be obtained from DMC calculations are illustrated in the context of the protonated water clusters. This article is categorized under: Molecular and Statistical Mechanics > Molecular Dynamics and Monte‐Carlo Methods Theoretical and Physical Chemistry > Spectroscopy

Chemistry↗

Personalized Tucker Decomposition: Modeling Commonality and Peculiarity on Tensor Data

In this paper, we propose a personalized Tucker decomposition (perTucker) to address the limitations of traditional tensor decomposition methods in capturing heterogeneity across different datasets. perTucker decomposes tensor data into shared global components and personalized local components. We introduce an order orthogonality assumption and develop a proximal gradient regularized block coordinate descent algorithm guaranteed to converge to a stationary point. The unique and common representations learned by perTucker reveal intrinsic statistical patterns in data and provide valuable information for a wide range of downstream analytics, including anomaly detection, source classification, and clustering. We demonstrate perTucker’s effectiveness through a simulation study and two case studies on solar flare detection and tonnage signal classification.

14 SOLAR ENERGY↗

Probing the Galactic halo with RR Lyrae stars – II. The substructures of the Milky Way

ABSTRACT We identify substructures of the Galactic halo using 3003 type ab RR Lyrae stars with six-dimensional position–velocity information from the Sloan Digital Sky Survey, the Large Sky Area Multi-Object Fiber Spectroscopic Telescope and the Gaia Early Data Release 3. Based on this information, we define the separation of any two of the stars in the integrals of motion space and we identify substructures by utilizing the friends-of-friends algorithm. We identify members belonging to several known substructures: the Sagittarius stream, the Gaia-Enceladus-Sausage (GES), the Sequoia and the Helmi streams. In addition to these known substructures, there are three other substructures possibly associated with globular clusters NGC 5272, 6656 and 5024, respectively. Finally, we also find three remaining unknown substructures, one of which has large angular momentum and a mean metallicity −2.13 dex, which may be a new substructure. As for the GES, we find that it accounts for a large part of substructures in the inner halo and the apocentre distance is in the range 10–34 kpc, which suggests that the GES is mainly distributed in the inner halo. The near one-third proportion of the GES and the peak value of 20 kpc of the apocentre distance suggest that the GES could account for the break in the density profile of the Galactic halo at the Galactocentric distance ~20–25 kpc. The similarity when comparing the kinematic properties of the GES with the Hercules–Aquila Cloud and Virgo Overdensity suggests that the three substructures may have similar origins.

79 ASTRONOMY AND ASTROPHYSICS↗

Anomaly Detection in Large Sets of High-Dimensional Symbol Sequences

This paper addresses the problem of detecting and describing anomalies in large sets of high-dimensional symbol sequences. The approach taken uses unsupervised clustering of sequences using the normalized longest common subsequence (LCS) as a similarity measure, followed by detailed analysis of outliers to detect anomalies. As the LCS measure is expensive to compute, the first part of the paper discusses existing algorithms, such as the Hunt-Szymanski algorithm, that have low time-complexity. We then discuss why these algorithms often do not work well in practice and present a new hybrid algorithm for computing the LCS that, in our tests, outperforms the Hunt-Szymanski algorithm by a factor of five. The second part of the paper presents new algorithms for outlier analysis that provide comprehensible indicators as to why a particular sequence was deemed to be an outlier. The algorithms provide a coherent description to an analyst of the anomalies in the sequence, compared to more normal sequences. The algorithms we present are general and domain-independent, so we discuss applications in related areas such as anomaly detection.

Budalakoti, Suratna↗

Parallel algorithms for hyperdynamics and local hyperdynamics

Hyperdynamics (HD) is a method for accelerating the timescale of standard molecular dynamics (MD). It can be used for simulations of systems with an energy potential landscape that is a collection of basins, separated by barriers, where transitions between basins are infrequent. HD enables the system to escape from a basin more quickly while enabling a statistically accurate renormalization of the simulation time, thus effectively boosting the timescale of the simulation. In [Kim, Perez, Voter, J Chem Phys, 139:144110, 2013)1, a local version of HD was formulated, which exploits the intrinsic locality characteristic typical of most systems to mitigate the poor scaling properties of standard HD as the system size is increased. In this paper, we discuss how both HD and local HD can be formulated to run efficiently in parallel. We have implemented these ideas in the LAMMPS MD code, which means HD can be used with any interatomic potential LAMMPS supports. Together, these parallel methods allow simulations of any size to achieve the time acceleration offered by HD (which can be orders of magnitude), at a cost 3-5x that of standard MD. As examples, we performed two simulations of a million-atom system to model the diffusion and clustering of Pt adatoms on a large patch of Pt(100) surface for 80 and 160 μs.

74 ATOMIC AND MOLECULAR PHYSICS↗

Autonomous Experiments in Scanning Probe Microscopy and Spectroscopy: Choosing Where to Explore Polarization Dynamics in Ferroelectrics

Polarization dynamics in ferroelectric materials are explored via automated experiment in piezoresponse force microscopy/spectroscopy (PFM/S). A Bayesian optimization (BO) framework for imaging is developed, and its performance for a variety of acquisition and pathfinding functions is explored using previously acquired data. The optimized algorithm is then deployed on an operational scanning probe microscope (SPM) for finding areas of large electromechanical response in a thin film of PbTiO 3 , with results showing that, with just 20% of the area sampled, most high-response clusters were captured. Furthermore, this approach can allow performing more complex spectroscopies in SPM that were previously not possible due to time constraints and sample stability. Improvements to the framework to enable the incorporation of more prior information and improve efficiency further are modeled and discussed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗