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 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
NASA NTRS1992

A balanced submatrix merging algorithm for multiprocessor architectures

In this article, a parallel algorithm which applies Givens rotations to selectively annihilate k(k + 1)/2 nonzero elements from two k x n(k not more than n) upper trapezoidal submatrices is described. The new algorithm is suitable for implementation on either a pair of directly connected local-memory processors or two clusters of multiple tightly-coupled processors. Analyses show that in both cases the proposed algorithms achieve optimal speed-up by balancing the work load distribution and masking interprocessor or intercluster communication by computation if k is much small than n. In the context of solving large scale least squares problems, this submatrix merging step is repetitively needed during the entire computation and, furthermore, there are usually many pairs of such submatrices to be merged with each submatrix stored in the memory of a processor or a cluster of processors. The proposed algorithm can be applied to each pair of submatrices concurrently, and thus parallelizes an important step in solving the least squares problems.

Chu, Eleanor↗
NASA NTRS1992

Possibilistic clustering for shape recognition

Clustering methods have been used extensively in computer vision and pattern recognition. Fuzzy clustering has been shown to be advantageous over crisp (or traditional) clustering in that total commitment of a vector to a given class is not required at each iteration. Recently fuzzy clustering methods have shown spectacular ability to detect not only hypervolume clusters, but also clusters which are actually 'thin shells', i.e., curves and surfaces. Most analytic fuzzy clustering approaches are derived from Bezdek's Fuzzy C-Means (FCM) algorithm. The FCM uses the probabilistic constraint that the memberships of a data point across classes sum to one. This constraint was used to generate the membership update equations for an iterative algorithm. Unfortunately, the memberships resulting from FCM and its derivatives do not correspond to the intuitive concept of degree of belonging, and moreover, the algorithms have considerable trouble in noisy environments. Recently, we cast the clustering problem into the framework of possibility theory. Our approach was radically different from the existing clustering methods in that the resulting partition of the data can be interpreted as a possibilistic partition, and the membership values may be interpreted as degrees of possibility of the points belonging to the classes. We constructed an appropriate objective function whose minimum will characterize a good possibilistic partition of the data, and we derived the membership and prototype update equations from necessary conditions for minimization of our criterion function. In this paper, we show the ability of this approach to detect linear and quartic curves in the presence of considerable noise.

Keller, James M.↗
NASA NTRS2008

NASA Tech Briefs, June 2008

Topics covered include: Charge-Control Unit for Testing Lithium-Ion Cells; Measuring Positions of Objects Using Two or More Cameras; Lidar System for Airborne Measurement of Clouds and Aerosols; Radiation-Insensitive Inverse Majority Gates; Reduced-Order Kalman Filtering for Processing Relative Measurements; Spaceborne Processor Array; Instrumentation System Diagnoses a Thermocouple; Chromatic Modulator for a High-Resolution CCD or APS; Commercial Product Activation Using RFID; Cup Cylindrical Waveguide Antenna; Aerobraking Maneuver (ABM) Report Generator; ABM Drag_Pass Report Generator; Transformation of OODT CAS to Perform Larger Tasks; Visualization Component of Vehicle Health Decision Support System; Mars Reconnaissance Orbiter Uplink Analysis Tool; Problem Reporting System; G-Guidance Interface Design for Small Body Mission Simulation; DSN Scheduling Engine; Replacement Sequence of Events Generator; Force-Control Algorithm for Surface Sampling; Tool for Merging Proposals Into DSN Schedules; Micromachined Slits for Imaging Spectrometers; Fabricating Nanodots Using Lift-Off of a Nanopore Template; Making Complex Electrically Conductive Patterns on Cloth; Special Polymer/Carbon Composite Films for Detecting SO2; Nickel-Based Superalloy Resists Embrittlement by Hydrogen; Chemical Passivation of Li+-Conducting Solid Electrolytes; Organic/Inorganic Polymeric Composites for Heat-Transfer Reduction; Composite Cathodes for Dual-Rate Li-Ion Batteries; Improved Descent-Rate Limiting Mechanism; Alignment-Insensitive Lower-Cost Telescope Architecture; Micro-Resistojet for Small Satellites; Using Piezoelectric Devices to Transmit Power through Walls; Miniature Latching Valve; Apparatus for Sampling Surface Contamination; Novel Species of Non-Spore-Forming Bacteria; Chamber for Aerosol Deposition of Bioparticles; Hyperspectral Sun Photometer for Atmospheric Characterization and Vicarious Calibrations; Dynamic Stability and Gravitational Balancing of Multiple Extended Bodies; Simulation of Stochastic Processes by Coupled ODE-PDE; Cluster Inter-Spacecraft Communications; Genetic Algorithm Optimizes Q-LAW Control Parameters; Low-Impact Mating System for Docking Spacecraft; Non-Destructive Evaluation of Materials via Ultraviolet Spectroscopy; Gold-on-Polymer-Based Sensing Films for Detection of Organic and Inorganic Analytes in the Air; and Quantum-Inspired Maximizer.

Source record↗
NASA NTRS1990

Health Monitoring System for the SSME-fault detection algorithms

A Health Monitoring System (HMS) Framework for the Space Shuttle Main Engine (SSME) has been developed by United Technologies Corporation (UTC) for the NASA Lewis Research Center. As part of this effort, fault detection algorithms have been developed to detect the SSME faults with sufficient time to shutdown the engine. These algorithms have been designed to provide monitoring coverage during the startup, mainstage and shutdown phases of the SSME operation. The algorithms have the capability to detect multiple SSME faults, and are based on time series, regression and clustering techniques. This paper presents a discussion of candidate algorithms suitable for fault detection followed by a description of the algorithms selected for implementation in the HMS and the results of testing these algorithms with the SSME test stand data.

Tulpule, S.↗
NASA NTRS1988

The morphology of multiple-nucleus brightest cluster galaxies

The morphology of high SNR CCD images of 16 multiple-nucleus brightest cluster galaxies is studied using an algorithm that models images of the systems as the line-of-sight superposition of normal elliptical galaxies. The algorithm is applied initially to the classic multiple-nucleus cD galaxy in A2199. Evidence is found suggestive of deep interpenetrating high-speed encounters by its secondaries. The interactions effects studied include noncentric isophotes, brightness profile effects, excess light around primary galaxies, and dynamical friction wakes. The results show that in many cases multiple systems are interacting systems.

Lauer, Tod R.↗
NASA NTRS1996

Effect of Dust Coagulation Dynamics on the Geometry of Aggregates

Master equation gives a more fundamental description of stochastic coagulation processes rather than popular Smoluchowski's equation. In order to examine the effect of the dynamics on the geometry of resulting aggregates, we study Master equation with a rigorous Monte Carlo algorithm. It is found that Cluster-Cluster aggregation model is a good approximation of orderly growth and the aggregates have fluffy structures with a fractal dimension approx. 2. A scaling analysis of Smoluchowski's equation also supports this conclusion.

Nakamura, R.↗
NASA NTRS2005

Probabilisitc Geobiological Classification Using Elemental Abundance Distributions and Lossless Image Compression in Recent and Modern Organisms

Last year we presented techniques for the detection of fossils during robotic missions to Mars using both structural and chemical signatures[Storrie-Lombardi and Hoover, 2004]. Analyses included lossless compression of photographic images to estimate the relative complexity of a putative fossil compared to the rock matrix [Corsetti and Storrie-Lombardi, 2003] and elemental abundance distributions to provide mineralogical classification of the rock matrix [Storrie-Lombardi and Fisk, 2004]. We presented a classification strategy employing two exploratory classification algorithms (Principal Component Analysis and Hierarchical Cluster Analysis) and non-linear stochastic neural network to produce a Bayesian estimate of classification accuracy. We now present an extension of our previous experiments exploring putative fossil forms morphologically resembling cyanobacteria discovered in the Orgueil meteorite. Elemental abundances (C6, N7, O8, Na11, Mg12, Ai13, Si14, P15, S16, Cl17, K19, Ca20, Fe26) obtained for both extant cyanobacteria and fossil trilobites produce signatures readily distinguishing them from meteorite targets. When compared to elemental abundance signatures for extant cyanobacteria Orgueil structures exhibit decreased abundances for C6, N7, Na11, All3, P15, Cl17, K19, Ca20 and increases in Mg12, S16, Fe26. Diatoms and silicified portions of cyanobacterial sheaths exhibiting high levels of silicon and correspondingly low levels of carbon cluster more closely with terrestrial fossils than with extant cyanobacteria. Compression indices verify that variations in random and redundant textural patterns between perceived forms and the background matrix contribute significantly to morphological visual identification. The results provide a quantitative probabilistic methodology for discriminating putatitive fossils from the surrounding rock matrix and &om extant organisms using both structural and chemical information. The techniques described appear applicable to the geobiological analysis of meteoritic samples or in situ exploration of the Mars regolith. Keywords: cyanobacteria, microfossils, Mars, elemental abundances, complexity analysis, multifactor analysis, principal component analysis, hierarchical cluster analysis, artificial neural networks, paleo-biosignatures

Storrie-Lombardi, Michael C.↗
NASA NTRSDate not supplied

A Study of Parallel Scalability and Dynamic Workload Balancing in GlennICE

The Glenn Icing Computational Environment (GlennICE) is a computational tool designed to calculate ice growth on complex three-dimensional geometries. It utilizes user-supplied computational fluid dynamics solutions for the geometry of interest. Key developments include advancements in convergence of collection efficiency, trajectory optimization, and refinement methodology. These improvements have significantly enhanced GlennICE’s efficiency for practical engineering applications. A recent study focused on benchmarking GlennICE’s scalability in a parallel environment using static scheduling. Findings indicated a potential twofold increase in efficiency through workload balance enhancements. This paper presents an analysis of the solver’s new workload balancing improvements, incorporating shared memory and dynamic scheduling routines. Results demonstrate a highly efficient and consistent algorithm across high-performance computing clusters.

Computational Icing↗
NASA NTRSDate not supplied

A Study of Parallel Scalability and Dynamic Workload Balancing in GlennICE

The Glenn Icing Computational Environment (GlennICE) is a computational tool designed to calculate ice growth on complex three-dimensional geometries. It utilizes user-supplied computational fluid dynamics solutions for the geometry of interest. Key developments include advancements in convergence of collection efficiency, trajectory optimization, and refinement methodology. These improvements have significantly enhanced GlennICE’s efficiency for practical engineering applications. A recent study focused on benchmarking GlennICE’s scalability in a parallel environment using static scheduling. Findings indicated a potential twofold increase in efficiency through workload balance enhancements. This paper presents an analysis of the solver’s new workload balancing improvements, incorporating shared memory and dynamic scheduling routines. Results demonstrate a highly efficient and consistent algorithm across high-performance computing clusters.

Computational Icing↗
NASA NTRS2024

SupportU: Smart UAS Program for the Population by Offering Resources and Tools to the Unhoused

Global warming, challenging economic conditions, the opioid epidemic, and other widespread problems, have impacted people globally, particularly over the past several years. Preventable diseases like the common cold and the effects of heat stroke have become increasingly prevalent due to these issues. It is estimated that 150 million people of the world’s population are unhoused globally, with many dwelling in unsafe and unsanitary conditions while lacking access to basic hygienic items and other essentials. Unsanitary conditions coupled with this lack of access exacerbates and prolongs health problems and harms quality of life. Traditional methods of aid, such as homeless shelters and meal programs, face numerous challenges such as having limited reach and resources. To address these problems, the Smart UAS Program for the Population by Offering Resources and Tools to the Unhoused (SUPPORT U) utilizes Uncrewed Aircraft Systems (UAS) to deliver resources to the unhoused and those in need of basic aid, prior to and during extreme temperature conditions, and after natural disasters in rural, suburban, and urban areas. The UA is envisioned to be an autonomous aircraft capable of efficiently distributing essential supplies, including blankets, water, food, and medicine. The UAS fleet relies on advanced navigation and communication technologies to accurately identify unhoused people and efficiently and safely distribute materials to them. This will be done through a machine learning algorithm. By focusing on identified “homeless clusters”, places where unhoused individuals are concentrated, the UAS network increases access to critical resources, thereby helping to mitigate some of the external risks to the health of unhoused individuals. The UA can also be used during crises, such as by transporting supplies to medical tents that are stationed in difficult-to-reach areas suffering from natural disasters.

Samuel Beard↗
NASA NTRS1993

Fast parallel algorithms that compute transitive closure of a fuzzy relation

The notion of a transitive closure of a fuzzy relation is very useful for clustering in pattern recognition, for fuzzy databases, etc. The original algorithm proposed by L. Zadeh (1971) requires the computation time O(n(sup 4)), where n is the number of elements in the relation. In 1974, J. C. Dunn proposed a O(n(sup 2)) algorithm. Since we must compute n(n-1)/2 different values s(a, b) (a not equal to b) that represent the fuzzy relation, and we need at least one computational step to compute each of these values, we cannot compute all of them in less than O(n(sup 2)) steps. So, Dunn's algorithm is in this sense optimal. For small n, it is ok. However, for big n (e.g., for big databases), it is still a lot, so it would be desirable to decrease the computation time (this problem was formulated by J. Bezdek). Since this decrease cannot be done on a sequential computer, the only way to do it is to use a computer with several processors working in parallel. We show that on a parallel computer, transitive closure can be computed in time O((log(sub 2)(n))2).

Kreinovich, Vladik YA.↗
NASA NTRS1995

Fast Multipole Methods for Three-Dimensional N-body Problems

We are developing computational tools for the simulations of three-dimensional flows past bodies undergoing arbitrary motions. High resolution viscous vortex methods have been developed that allow for extended simulations of two-dimensional configurations such as vortex generators. Our objective is to extend this methodology to three dimensions and develop a robust computational scheme for the simulation of such flows. A fundamental issue in the use of vortex methods is the ability of employing efficiently large numbers of computational elements to resolve the large range of scales that exist in complex flows. The traditional cost of the method scales as Omicron (N(sup 2)) as the N computational elements/particles induce velocities at each other, making the method unacceptable for simulations involving more than a few tens of thousands of particles. In the last decade fast methods have been developed that have operation counts of Omicron (N log N) or Omicron (N) (referred to as BH and GR respectively) depending on the details of the algorithm. These methods are based on the observation that the effect of a cluster of particles at a certain distance may be approximated by a finite series expansion. In order to exploit this observation we need to decompose the element population spatially into clusters of particles and build a hierarchy of clusters (a tree data structure) - smaller neighboring clusters combine to form a cluster of the next size up in the hierarchy and so on. This hierarchy of clusters allows one to determine efficiently when the approximation is valid. This algorithm is an N-body solver that appears in many fields of engineering and science. Some examples of its diverse use are in astrophysics, molecular dynamics, micro-magnetics, boundary element simulations of electromagnetic problems, and computer animation. More recently these N-body solvers have been implemented and applied in simulations involving vortex methods. Koumoutsakos and Leonard (1995) implemented the GR scheme in two dimensions for vector computer architectures allowing for simulations of bluff body flows using millions of particles. Winckelmans presented three-dimensional, viscous simulations of interacting vortex rings, using vortons and an implementation of a BH scheme for parallel computer architectures. Bhatt presented a vortex filament method to perform inviscid vortex ring interactions, with an alternative implementation of a BH scheme for a Connection Machine parallel computer architecture.

Koumoutsakos, P.↗
NASA NTRS2005

At-Least Version of the Generalized Minimum Spanning Tree Problem: Optimization Through Ant Colony System and Genetic Algorithms

The At-Least version of the Generalized Minimum Spanning Tree Problem (L-GMST) is a problem in which the optimal solution connects all defined clusters of nodes in a given network at a minimum cost. The L-GMST is NPHard; therefore, metaheuristic algorithms have been used to find reasonable solutions to the problem as opposed to computationally feasible exact algorithms, which many believe do not exist for such a problem. One such metaheuristic uses a swarm-intelligent Ant Colony System (ACS) algorithm, in which agents converge on a solution through the weighing of local heuristics, such as the shortest available path and the number of agents that recently used a given path. However, in a network using a solution derived from the ACS algorithm, some nodes may move around to different clusters and cause small changes in the network makeup. Rerunning the algorithm from the start would be somewhat inefficient due to the significance of the changes, so a genetic algorithm based on the top few solutions found in the ACS algorithm is proposed to quickly and efficiently adapt the network to these small changes.

Janich, Karl W.↗
NASA NTRS2002

Distant Cluster Hunting: A Comparison of X-Ray and Optical Cluster Detection Techniques and Catalogs from the ROSAT Optical X-Ray Survey - II

We present and analyze the optical and X-ray catalogs of moderate-redshift cluster candidates from the ROSA TOptical X-Ray Survey, or ROXS. The survey covers the sky area contained in the fields of view of 23 deep archival ROSA T PSPC pointings, 4.8 square degrees. The cross-correlated cluster catalogs were con- structed by comparing two independent catalogs extracted from the optical and X-ray bandpasses, using a matched-filter technique for the optical data and a wavelet technique for the X-ray data. We cross-identified cluster candidates in each catalog. As reported in Paper 1, the matched-filter technique found optical counter- parts for at least 60% (26 out of 43) of the X-ray cluster candidates; the estimated redshifts from the matched filter algorithm agree with at least 7 of 1 1 spectroscopic confirmations (Az 5 0.10). The matched filter technique. with an imaging sensitivity of ml N 23, identified approximately 3 times the number of candidates (155 candidates, 142 with a detection confidence >3 u) found in the X-ray survey of nearly the same area. There are 57 X-ray candidates, 43 of which are unobscured by scattered light or bright stars in the optical images. Twenty-six of these have fairly secure optical counterparts. We find that the matched filter algorithm, when applied to images with galaxy flux sensitivities of mI N 23, is fairly well-matched to discovering z 5 1 clusters detected by wavelets in ROSAT PSPC exposures of 8000-60,000 s. The difference in the spurious fractions between the optical and X-ray (30%) and IO%, respectively) cannot account for the difference in source number. In Paper I, we compared the optical and X-ray cluster luminosity functions and we found that the luminosity functions are consistent if the relationship between X-ray and optical luminosities is steep (Lx o( L&f). Here, in Paper 11, we present the cluster catalogs and a numerical simulation of the ROXS. We also present color-magnitude plots for several of the cluster candidates, and examine the prominence of the red sequence in each. We find that the X-ray clusters in our survey do not all have a prominent red sequence. We conclude that while the red sequence may be a distinct feature in the color-magnitude plots for virialized massive clusters, it may be less distinct in lower mass clusters of galaxies at even moderate redshifts. Multiple, complementary methods of selecting and defining clusters may be essential, particularly at high redshift where all methods start to run into completeness limits, incomplete understanding of physical evolution, and projection effects.

Donahue, Megan↗
NASA NTRS2008

Hail Size Distribution Mapping

A 3-D weather radar visualization software program was developed and implemented as part of an experimental Launch Pad 39 Hail Monitor System. 3DRadPlot, a radar plotting program, is one of several software modules that form building blocks of the hail data processing and analysis system (the complete software processing system under development). The spatial and temporal mapping algorithms were originally developed through research at the University of Central Florida, funded by NASA s Tropical Rainfall Measurement Mission (TRMM), where the goal was to merge National Weather Service (NWS) Next-Generation Weather Radar (NEXRAD) volume reflectivity data with drop size distribution data acquired from a cluster of raindrop disdrometers. In this current work, we adapted these algorithms to process data from a cluster of hail disdrometers positioned around Launch Pads 39A or 39B, along with the corresponding NWS radar data. Radar data from all NWS NEXRAD sites is archived at the National Climatic Data Center (NCDC). That data can be readily accessed at . 3DRadPlot plots Level III reflectivity data at four scan elevations (this software is available at Open Channel Software, ). By using spatial and temporal interpolation/extrapolation based on hydrometeor fall dynamics, we can merge the hail disdrometer array data coupled with local Weather Surveillance Radar-1988, Doppler (WSR-88D) radial velocity and reflectivity data into a 4-D (3-D space and time) picture of hail size distributions. Hail flux maps can then be generated and used for damage prediction and assessment over specific surfaces corresponding to structures within the disdrometer array volume. Immediately following a hail storm, specific damage areas and degree of damage can be identified for inspection crews.

Source record↗
NASA NTRS1990

Matrix elements in the coupled-cluster approach - With application to low-lying states in Li

A procedure is suggested for evaluating matrix elements of an operator between wavefunctions in the coupled-cluster form. The use of the exponential ansatz leads to compact exponential expressions also for matrix elements. Algorithms are developed for summing all effects of one-particle clusters and certain chains of two-particle clusters (containing the well-known random-phase approximation as a subset). The treatment of one-particle perturbations in single valence states is investigated in detail. As examples the oscillator strength for the 2s-2p transition in Li as well as the hyperfine structure for the two states are studied and compared to earlier work.

Martensson-Pendrill, Ann-Marie↗