Search NASA⌕ Search

SEARCH · Search NASA

Results for “partitioning 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.

At least 721 records · Page 40

Signal and data processing of small targets 1989; Proceedings of the Meeting, Orlando, FL, Mar. 27-29, 1989

The present conference on digital signal processing, association and filtering techniques, and multiple-sensor/multiple-tracking techniques, discusses single-frame velocity estimation, efficient target extraction for laser radar imagery, precision target tracking for small extended objects, IR clutter partitioning for matched filter design, the maximum-likelihood approach to gamma circumvention, position estimation for optical point targets using staring detector arrays, and a multiple-scan signal processing technique for area-moving target indication. Also discussed are a proportional integral estimator, the prediction of track purity in tracking performance evaluations, synchronization and fault-tolerance in a distributed tracker, the benefits of soft sensors and probabilistic fusion, and testing track initiation algorithms fusing two-dimensional tracks.

Drummond, Oliver E.↗

The Effects of an Improved Dynamic Vegetation Phenology Representation in a Global Land Surface Model

Evapotranspiration (ET) is a major driver of the interaction between the land surface and the atmosphere through its component mechanisms, including plant transpiration (T) and soil evaporation. To accurately capture land-atmosphere interactions in global Earth System Models, it is thus critical that the underlying land surface models accurately model both the land hydrology as well as the dynamic response of vegetation to environmental drivers. In an effort to introduce a more realistic vegetation representation, the NASA Catchment land surface model, which is part of the Goddard Earth Observing System (GEOS), has previously been merged with the carbon and nitrogen physics modules of the Community Land Model version 4, resulting in the new Catchment-CN model. Catchment-CN has inherited the advanced treatment of land surface hydrology of Catchment, but is additionally able to dynamically model the response of vegetation to environmental drivers, in contrast to the fixed vegetation climatology that was prescribed in Catchment. Recently, the parameterization of Catchment-CN vegetation has been augmented to better account for variability of vegetation responses to external forcings within existing plant functional types, and vegetation parameters have been calibrated against Moderate Resolution Imaging Spectrometer observations of the fraction of absorbed photosynthetically radiation. These efforts have led to a significant reduction in the RMSE of modeled photosynthetic activity with respect to observations.This presentation investigates the effect of the improved vegetation representation on the partitioning of ET within Catchment-CN. Specifically, we compare global maps of the T:ET ratio across different temporal scales in (1) the original Catchment model, (2) the original Catchment-CN model, and (3) the augmented and calibrated Catchment-CN model. The modeled T and ET estimates are compared against a comprehensive set of ground observations from various field studies, as well as independent global T:ET estimates from different ET algorithms provided in the context of the Water Cycle Observation Multi-mission Strategy ? Evapotranspiration (WACMOS-ET) initiative.

Kolassa, J.↗

Zonal multigrid solution of compressible flow problems on unstructured and adaptive meshes

The simultaneous use of adaptive meshing techniques with a multigrid strategy for solving the 2-D Euler equations in the context of unstructured meshes is studied. To obtain optimal efficiency, methods capable of computing locally improved solutions without recourse to global recalculations are pursued. A method for locally refining an existing unstructured mesh, without regenerating a new global mesh is employed, and the domain is automatically partitioned into refined and unrefined regions. Two multigrid strategies are developed. In the first, time-stepping is performed on a global fine mesh covering the entire domain, and convergence acceleration is achieved through the use of zonal coarse grid accelerator meshes, which lie under the adaptively refined regions of the global fine mesh. Both schemes are shown to produce similar convergence rates to each other, and also with respect to a previously developed global multigrid algorithm, which performs time-stepping throughout the entire domain, on each mesh level. However, the present schemes exhibit higher computational efficiency due to the smaller number of operations on each level.

Mavriplis, Dimitri J.↗

A learning-based measurement framework for traffic matrix inference in software defined networks

Here, we propose an intelligent framework for Traffic Matrix (TM) inference in Software Defined Networks (SDN) where the Ternary Content Addressable Memory (TCAM) entries of switches are partitioned into two parts to: (1) effectively aggregate part of incoming flows for aggregate measurements, and (2) de-aggregate and directly measure the most informative flows for per-flow measurements. These measurements are then processed to effectively estimate the size of network flows. Under hard resource constraints of limited TCAM sizes, we show how to design the optimal and efficient-compressed flow aggregation matrices. We propose an optimal Multi-Armed Bandit (MAB) based algorithm to adaptively measure the most rewarding flows. We evaluate the performance of our framework using real traffic traces from different network environments and by considering two main applications: TM estimation and Heavy Hitter (HH) detection. Moreover, we have implemented a prototype of our framework in Mininet to demonstrate its effectiveness.

42 ENGINEERING↗

Real-time streamflow forecasting: AI vs. Hydrologic insights

In this paper, we propose a set of simple benchmarks for the evaluation of data-based models for real-time streamflow forecasting, such as those developed with sophisticated Artificial Intelligence (AI) algorithms. The benchmarks are also data-based and provide context to judge incremental improvements in the performance metrics from the more complicated approaches. The benchmarks include temporal and spatial persistence, persistence corrected for baseflow and streamflow, as well as river distance weighted runoff obtained from space-time distributed rainfall. In the development of the benchmarks, we use basic hydrologic insights such as flow aggregation by the river network, scale-dependence in basin response, streamflow partitioning into quick flow and baseflow, water travel time, and rainfall averaging by the basin width function. The study uses 140 streamflow gauges in Iowa that cover a range of basin scales between 7 and 37,000 km 2 . The data cover 17 years. This work demonstrates that the proposed benchmarks can provide good performance according to several commonly used metrics. For example, streamflow forecasting at half of the test locations across years achieves a Kling-Gupta Efficiency (KGE) score of 0.6 or higher at one-day ahead lead time, and 20% of cases reach the KGE of 0.8 or higher. The proposed benchmarks are easy to implement and should prove useful for developers of data-based as well as physics-based hydrologic models and real-time data assimilation techniques.

54 ENVIRONMENTAL SCIENCES↗

Investigation of particle and vapor wall-loss effects on controlled wood-smoke smog-chamber experiments

Here, smog chambers are extensively used to study processes that drive gas and particle evolution in the atmosphere. A limitation of these experiments is that particles and gas-phase species may be lost to chamber walls on shorter timescales than the timescales of the atmospheric processes being studied in the chamber experiments. These particle and vapor wall losses have been investigated in recent studies of secondary organic aerosol (SOA) formation, but they have not been systematically investigated in experiments of primary emissions from combustion. The semi-volatile nature of combustion emissions (e.g. from wood smoke) may complicate the behavior of particle and vapor wall deposition in the chamber over the course of the experiments due to the competition between gas/particle and gas/wall partitioning. Losses of vapors to the walls may impact particle evaporation in these experiments, and potential precursors for SOA formation from combustion may be lost to the walls, causing underestimations of aerosol yields. Here, we conduct simulations to determine how particle and gas-phase wall losses contributed to the observed evolution of the aerosol during experiments in the third Fire Lab At Missoula Experiment (FLAME III). We use the TwO-Moment Aerosol Sectional (TOMAS) microphysics algorithm coupled with the organic volatility basis set (VBS) and wall-loss formulations to examine the predicted extent of particle and vapor wall losses. We limit the scope of our study to the dark periods in the chamber before photo-oxidation to simplify the aerosol system for this initial study. Our model simulations suggest that over one-third of the initial particle-phase organic mass (41 %) was lost during the experiments, and over half of this particle-organic mass loss was from direct particle wall loss (65 % of the loss) with the remainder from evaporation of the particles driven by vapor losses to the walls (35 % of the loss). We perform a series of sensitivity tests to understand uncertainties in our simulations. Uncertainty in the initial wood-smoke volatility distribution contributes 18 % uncertainty to the final particle-organic mass remaining in the chamber (relative to base-assumption simulation). We show that the total mass loss may depend on the effective saturation concentration of vapor with respect to the walls as these values currently vary widely in the literature. The details of smoke dilution during the filling of smog chambers may influence the mass loss to the walls, and a dilution of ~ 25:1 during the experiments increased particle-organic mass loss by 33 % compared to a simulation where we assume the particles and vapors are initially in equilibrium in the chamber. Finally, we discuss how our findings may influence interpretations of emission factors and SOA production in wood-smoke smog-chamber experiments.

54 ENVIRONMENTAL SCIENCES↗

The all configuration mean energy multiconfiguration self-consistent-field method. I. Equal configuration weights

The All Configuration Mean Energy (ACME) conditions are a special case of state averaging for Multiconfigurational Self-Consistent-Field (MCSCF) orbital optimisation. The method is formulated using the Graphical Unitary Group Approach (GUGA) in which the Configuration State Function (CSF) basis is represented as walks within a Shavitt graph. This graphical formulation leads to efficient recursive algorithms for the energy and reduced density matrices (RDM) that are independent of the CSF dimension and that scale only as O(n2) where n is the number of occupied orbitals. The Hamiltonian matrix diagonalization step is obviated and the CSF expansion coefficients are neither referenced nor required. This allows MCSCF orbital optimisation to be performed for essentially unlimited numbers of active orbitals and arbitrarily large CSF expansions. The discussion includes various types of CSF expansion spaces, the partitioning of the essential and redundant orbital optimisation parameters, the computation of the spin-density, and the formulation of state-specific analytic gradients and nonadiabatic coupling for high-level electronic structure methods that use the ACME MCSCF orbitals.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Sensor Selection and Data Validation for Reliable Integrated System Health Management

For new access to space systems with challenging mission requirements, effective implementation of integrated system health management (ISHM) must be available early in the program to support the design of systems that are safe, reliable, highly autonomous. Early ISHM availability is also needed to promote design for affordable operations; increased knowledge of functional health provided by ISHM supports construction of more efficient operations infrastructure. Lack of early ISHM inclusion in the system design process could result in retrofitting health management systems to augment and expand operational and safety requirements; thereby increasing program cost and risk due to increased instrumentation and computational complexity. Having the right sensors generating the required data to perform condition assessment, such as fault detection and isolation, with a high degree of confidence is critical to reliable operation of ISHM. Also, the data being generated by the sensors needs to be qualified to ensure that the assessments made by the ISHM is not based on faulty data. NASA Glenn Research Center has been developing technologies for sensor selection and data validation as part of the FDDR (Fault Detection, Diagnosis, and Response) element of the Upper Stage project of the Ares 1 launch vehicle development. This presentation will provide an overview of the GRC approach to sensor selection and data quality validation and will present recent results from applications that are representative of the complexity of propulsion systems for access to space vehicles. A brief overview of the sensor selection and data quality validation approaches is provided below. The NASA GRC developed Systematic Sensor Selection Strategy (S4) is a model-based procedure for systematically and quantitatively selecting an optimal sensor suite to provide overall health assessment of a host system. S4 can be logically partitioned into three major subdivisions: the knowledge base, the down-select iteration, and the final selection analysis. The knowledge base required for productive use of S4 consists of system design information and heritage experience together with a focus on components with health implications. The sensor suite down-selection is an iterative process for identifying a group of sensors that provide good fault detection and isolation for targeted fault scenarios. In the final selection analysis, a statistical evaluation algorithm provides the final robustness test for each down-selected sensor suite. NASA GRC has developed an approach to sensor data qualification that applies empirical relationships, threshold detection techniques, and Bayesian belief theory to a network of sensors related by physics (i.e., analytical redundancy) in order to identify the failure of a given sensor within the network. This data quality validation approach extends the state-of-the-art, from red-lines and reasonableness checks that flag a sensor after it fails, to include analytical redundancy-based methods that can identify a sensor in the process of failing. The focus of this effort is on understanding the proper application of analytical redundancy-based data qualification methods for onboard use in monitoring Upper Stage sensors.

Garg, Sanjay↗

Enhancing scalability of a matrix-free eigensolver for studying many-body localization

We propose several techniques to enhance the parallel scalability of a matrix-free eigensolver designed for studying many-body localization (MBL) of quantum spin chain models with nearest-neighbor interactions and on-site disorder. This type of problem is computationally challenging because the dimension of the associated Hamiltonian matrix grows exponentially with respect to the number of spins L, and we need to average over different realizations of the random disorder to obtain relevant statistical behavior. For each disorder realization, we need to compute eigenvalues from different regions of the spectrum and their corresponding eigenvectors. In previous work, the interior eigenstates for a single eigenvalue problem are computed via the shift-and-invert Lanczos algorithm. Due to the extremely high memory footprint of the LU factorizations, this technique is not well suited for large L’s. For example, we need thousands of compute nodes on modern high performance computing infrastructures to go beyond L = 24. The matrix-free approach does not suffer from this memory bottleneck, however, its scalability is limited by a computation and communication load imbalance. To reduce this imbalance and to significantly enhance the scalability of the matrix-free eigensolver, we reorder the matrix and leverage the consistent space runtime, CSPACER. We also show its efficiency in managing irregular communication patterns at scale compared to optimized MPI non-blocking two-sided and one-sided RMA implementation variants. This effort enables us to study MBL for spin chains with a larger number of spins. The efficiency and effectiveness of the proposed algorithm is demonstrated by computing eigenstates on a massively parallel many-core high performance computer.

METIS↗

A natural partitioning scheme for parallel simulation of multibody systems

A parallel partitioning scheme based on physical-coordinate variables is presented to systematically eliminate system constraint forces and yield the equations of motion of multibody dynamics systems in terms of their independent coordinates. Key features of the present scheme include an explicit determination of the independent coordinates, a parallel construction of the null space matrix of the constraint Jacobian matrix, an easy incorporation of the previously developed two-stage staggered solution procedure, and Schur complement based parallel preconditioned conjugate gradient numerical algorithm.

Chiou, J. C.↗

Intelligent Partitioning based Fully Parallel AC Security-Constrained Optimal Power Flow

Today’s power grid is becoming more diverse and integrated with high-level distributed energy resources and smart control technologies that is creating a new set of grid management challenges in terms of large-scale, nonlinear, and non-convex problem modeling, complex and time-consuming computation, as well as difficult uncertainty handling. This project focused on solving a challenging multi-period security-constrained generation scheduling problem, which is of great importance for maximizing the social welfare of real-time dispatch, day-ahead market, as well as weekly planning of power systems. Our developed software explored parallel optimization algorithms for complex and realistic power system models, and develop fast, efficient, and robust grid optimization solutions on the high-performance computing platform that will enable increased grid economics, flexibility, resilience, as well as energy security in the United States.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Ab Initio Direct Dynamics

The reactivity and dynamics of molecular systems can be explored computationally by classical trajectory calculations. The traditional approach involves fitting a functional form of a potential energy surface (PES) to the energies from a large number of electronic structure calculations and then integrating numerous trajectories on this fitted PES to model the molecular dynamics. The ever-decreasing cost of computing and continuing advances in computational chemistry software have made it possible to use electronic structure calculations directly in molecular dynamics simulations without first having to construct a fitted PES. In this “on-the-fly” approach, every time the energy and its derivatives are needed for the integration of the equations of motion, they are obtained directly from quantum chemical calculations. This approach started to become practical in the mid-1990s as a result of increased availability of inexpensive computer resources and improved computational chemistry software. The application of direct dynamics calculations has grown rapidly over the last 25 years and would require a lengthy review article. The present Account is limited to some of our contributions to methods development and various applications. To improve the efficiency of direct dynamics calculations, we developed a Hessian-based predictor-corrector algorithm for integrating classical trajectories. Hessian updating made this even more efficient. Furthermore, this approach was also used to improve algorithms for following the steepest descent reaction paths. For larger molecular systems, we developed an extended Lagrangian approach in which the electronic structure is propagated along with the molecular structure. Strong field chemistry is a rapidly growing area, and to improve the accuracy of molecular dynamics in intense laser fields, we included the time-varying electric field in a novel predictor-corrector trajectory integration algorithm. Since intense laser fields can excite and ionize molecules, we extended our studies to include electron dynamics. Specifically, we developed code for time-dependent configuration interaction electron dynamics to simulate strong field ionization by intense laser pulses. Our initial application of ab initio direct dynamics in 1994 was to CH 2 O → H 2 + CO; the calculated vibrational distributions in the products were in very good agreement with experiment. In the intervening years, we have used direct dynamics to explore energy partitioning in various dissociation reactions, unimolecular dissociations yielding three fragments, reactions with branching after the transition state, nonstatistical dynamics of chemically activated molecules, dynamics of molecular fragmentation by intense infrared laser pulses, selective activation of specific dissociation channels by aligned intense infrared laser fields, angular dependence of strong field ionization, and simulation of sequential double ionization.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A natural partitioning scheme for parallel simulation of multibody systems

A parallel partitioning scheme based on physical-co-ordinate variables is presented to systematically eliminate system constraint forces and yield the equations of motion of multibody dynamics systems in terms of their independent coordinates. Key features of the present scheme include an explicit determination of the independent coordinates, a parallel construction of the null space matrix of the constraint Jacobian matrix, an easy incorporation of the previously developed two-stage staggered solution procedure and a Schur complement based parallel preconditioned conjugate gradient numerical algorithm.

Chiou, J. C.↗

A Domain-Decomposed Multi-Level Method for Adaptively Refined Cartesian Grids with Embedded Boundaries

The work presents a new method for on-the-fly domain decomposition technique for mapping grids and solution algorithms to parallel machines, and is applicable to both shared-memory and message-passing architectures. It will be demonstrated on the Cray T3E, HP Exemplar, and SGI Origin 2000. Computing time has been secured on all these platforms. The decomposition technique is an outgrowth of techniques used in computational physics for simulations of N-body problems and the event horizons of black holes, and has not been previously used by the CFD community. Since the technique offers on-the-fly partitioning, it offers a substantial increase in flexibility for computing in heterogeneous environments, where the number of available processors may not be known at the time of job submission. In addition, since it is dynamic it permits the job to be repartitioned without global communication in cases where additional processors become available after the simulation has begun, or in cases where dynamic mesh adaptation changes the mesh size during the course of a simulation. The platform for this partitioning strategy is a completely new Cartesian Euler solver tarcreted at parallel machines which may be used in conjunction with Ames' "Cart3D" arbitrary geometry simulation package.

Aftosmis, M. J.↗

Compression of echocardiographic scan line data using wavelet packet transform

An efficient compression strategy is indispensable for digital echocardiography. Previous work has suggested improved results utilizing wavelet transforms in the compression of 2D echocardiographic images. Set partitioning in hierarchical trees (SPIHT) was modified to compress echocardiographic scanline data based on the wavelet packet transform. A compression ratio of at least 94:1 resulted in preserved image quality.

Non-NASA Center↗

Comment on 'Modeling of Convective-Stratiform Precipitation Processes: Sensitivity to Partitioning Methods' by Matthias Steiner

Despite the obvious notion that the presence of hail or graupel is a good indication of convection, the model results show this does not provide an objective benchmark partly due to the unrealistic presence of small amounts of hail or graupel throughout the anvil in the model but mainly because of the significant amounts of hail or graupel, especially in the tropical TOGA COARE simulation, in the transition zone. Without use of a "transition" category, it is open to debate as how this region should best be defined, as stratiform or as convective. So, the presence of significant hail or graupel contents in this zone significantly degrades its use an objective benchmark for convection. The separation algorithm comparison was done in the context of a cloud-resolving model. These models are widely used and serve a variety of purposes especially with regard to retrieving information that cannot be directly measured by providing synthetic data sets that are consistent and complete. Separation algorithms are regularly applied in these models. However, as with any modeling system, these types 'of models are constantly being improved to overcome any known deficiencies and make them more accurate representations of observed systems. The presence of hail and graupel in the anvil and the bias towards heavy rainfall rates are two such examples of areas that need improvement. Since, both of these can effect the perceived performance of the separation algorithms, the Lang et al. (2003) study did not want to overstate the relative performance of any specific algorithms.

Lang, Steve↗

An asynchronous traversal engine for graph-based rich metadata management

Rich metadata in high-performance computing (HPC) systems contains extended information about users, jobs, data files, and their relationships. Property graphs are a promising data model to represent heterogeneous rich metadata flexibly. Specifically, a property graph can use vertices to represent different entities and edges to record the relationships between vertices with unique annotations. The high-volume HPC use case, with millions of entities and relationships, naturally requires an out-of-core distributed property graph database, which must support live updates (to ingest production information in real time), low-latency point queries (for frequent metadata operations such as permission checking), and large-scale traversals (for provenance data mining). Among these needs, large-scale property graph traversals are particularly challenging for distributed graph storage systems. Most existing graph systems implement a "level synchronous" breadth-first search algorithm that relies on global synchronization in each traversal step. This performs well in many problem domains; but a rich metadata management system is characterized by imbalanced graphs, long traversal lengths, and concurrent workloads, each of which has the potential to introduce or exacerbate stragglers (i.e., abnormally slow steps or servers in a graph traversal) that lead to low overall throughput for synchronous traversal algorithms. Previous research indicated that the straggler problem can be mitigated by using asynchronous traversal algorithms, and many graph-processing frameworks have successfully demonstrated this approach. Such systems require the graph to be loaded into a separate batch-processing framework instead of being iteratively accessed, however. In this work, we investigate a general asynchronous graph traversal engine that can operate atop a rich metadata graph in its native format. We outline a traversal-aware query language and key optimizations (traversal-affiliate caching and execution merging) necessary for efficient performance. We further explore the effect of different graph partitioning strategies on the traversal performance for both synchronous and asynchronous traversal engines. Our experiments show that the asynchronous graph traversal engine is more efficient than its synchronous counterpart in the case of HPC rich metadata processing, where more servers are involved and larger traversals are needed. Furthermore, the asynchronous traversal engine is more adaptive to different graph partitioning strategies.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Risk of Distant Metastasis in Parathyroid Carcinoma and Its Effect on Survival: A Retrospective Review from a High-Volume Center

Background: Development of distant metastases (DM) is associated with markedly decreased survival in parathyroid carcinoma (PC). We sought to identify factors associated with development of DM and to quantify the effect that development of DM had on overall survival (OS). Methods: Patients with surgically resected local/regional PC treated or surveilled at a tertiary-referral cancer hospital from 1980 to 2017 were included. We assessed the association between biochemical and clinicopathologic factors (preoperative parathyroid hormone (PTH) levels, sex, race, age, preoperative serum calcium levels, serum calcium levels at 6 months postop, tumor size, and extent of resection) with the development of DM. We also assessed the effect of development of DM on OS. Results: Seventy-five patients with PC were assessed; 17 (22.7%) developed DM at a median follow-up of 77 months. The cumulative incidence of DM in the cohort was 20, 30, and 38% at 5, 10, and 20 years respectively. Tumor size > 3.2 cm based on recursive partitioning analysis was the only significant predictor for development of DM (hazard ratio (HR) = 3.51; 95% confidence interval [CI] 1.04–11.91; p = 0.04). Median OS for the entire cohort was 17 years compared with 40 months for the cohort who developed DM. The HR for death after distant metastasis was 9.6 (95% CI 4.2–22.3; p < 0.0001). Conclusions: Development of distant metastasis during surveillance is associated with decreased OS, including late recurrences. Primary tumor size should be considered in future interval surveillance and development of treatment algorithms.

62 RADIOLOGY AND NUCLEAR MEDICINE↗