Search NASA⌕ Search

SEARCH · Search NASA

Results for “partitioned 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 325 records · Page 18

Quasi-Optimal Elimination Trees for 2D Grids with Singularities

We construct quasi-optimal elimination trees for 2D finite element meshes with singularities. These trees minimize the complexity of the solution of the discrete system. The computational cost estimates of the elimination process model the execution of the multifrontal algorithms in serial and in parallel shared-memory executions. Since the meshes considered are a subspace of all possible mesh partitions, we call these minimizers quasi-optimal. We minimize the cost functionals using dynamic programming. Finding these minimizers is more computationally expensive than solving the original algebraic system. Nevertheless, from the insights provided by the analysis of the dynamic programming minima, we propose a heuristic construction of the elimination trees that has cost O N e log ⁡ N e , where N e is the number of elements in the mesh. We show that this heuristic ordering has similar computational cost to the quasi-optimal elimination trees found with dynamic programming and outperforms state-of-the-art alternatives in our numerical experiments.

Paszyńska, A.↗

Radioactive Decay Computation with a Graph Approach for Solving a Linear Dynamic System

ABSTRACT: This article gives two graph-based algorithms for radioactive decay computation. The first algorithm identifies the connected components of the graph induced from the given radioactive decay dynamics to reduce the size of the problem. The solutions are derived over the precalculated connected components, respectively and independently. The second algorithm utilizes acyclic structure of radioactive decay dynamics. The algorithm evaluates the reachable vertices of the induced system graph from the initially activated vertices and finds the minimal set of starting vertices populating the entire reachable vertices. Then, the decay calculations are performed over the reachable vertices from the identified minimal starting vertices, respectively, with the partitioned initial value over the reachable vertices. A formal argument is given to show that the proposed graph inspired divide and conquer calculation methods perform the intended radioactive decay calculation. Empirical efforts comparing the proposed radioactive decay calculation algorithms are presented.

42 ENGINEERING↗

A Fast and Scalable Genetic Algorithm-Based Approach for Planning of Microgrids in Distribution Networks: Preprint

As a result of climate change, extreme weather events are occurring more frequently and with increasing impact. This trend poses a significant challenge for distribution utilities and system operators to ensure that there is uninterrupted power supply to critical loads in their networks; thus, the level of proactive preparation of the distribution system to be able to handle severe impacts of extreme weather events represents the system's resilience. One method that distribution systems use to prepare for extreme events is to form multiple microgrids and thereby isolate themselves from the grid supply by using local generation as much as possible to supply critical loads. But partitioning an existing system into multiple feasible islands capable of supporting critical loads is still challenging for distribution systems - first, because of the size of the graph partitioning problem and, second, because of the difficulty in properly formulating the desired attributes of such islands or microgrids. Therefore, this paper presents a genetic algorithmbased approach that facilitates incorporating multiple objectives for grid partitioning by formulating two types of problems - node allocation and edge elimination - and it considers multiple topological and resilience-enhancing objectives. The performance of the proposed genetic algorithm-based approach is numerically evaluated on multiple test systems as well as on a real distribution feeder in Colorado, USA.

edge elimination↗

Active Thermochemical Tables: The Partition Function of Hydroxymethyl (CH 2 OH) Revisited

The best currently available set of temperature-dependent non-rigid rotor anharmonic oscillator (NRRAO) thermochemical and thermophysical properties of hydroxymethyl radical is presented. The underlying partition function relies on a critically evaluated complement of accurate experimental and theoretical data, and is constructed using a two-pronged strategy that combines contributions from large amplitude motions obtained from direct counts, with contributions from the other internal modes of motion obtained from analytic NRRAO expressions. The contributions from the two strongly coupled large-amplitude motions of CH 2 OH, OH torsion and CH 2 wag, are based on energy levels obtained by solving the appropriate two-dimensional projection of a fully-dimensional potential energy surface that was recently obtained at the CCSD(T)/cc-pVTZ level of theory. The contributions of the remaining seven, more rigid, vibrational modes and of the external rotations are captured by NRRAO corrections to the standard rigid rotor harmonic oscillator (RRHO) treatment, which include corrections for vibrational anharmonicities, rotation-vibration interaction, Coriolis effects, and low-temperature. Here, the basic spectroscopic constants needed for the construction of the initial RRHO partition function rely on experimental ground-state rotational constants and the best available experimental fundamentals, additionally complemented by fundamentals obtained from the variational solution of the full-dimensional potential energy surface using a recently developed two-component multi-layer Lanczos algorithm.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

HIV classification using coalescent theory

Algorithms for subtype classification and breakpoint detection of HIV-I sequences are based on a classification system of HIV-l. Hence, their quality highly depend on this system. Due to the history of creation of the current HIV-I nomenclature, the current one contains inconsistencies like: The phylogenetic distance between the subtype B and D is remarkably small compared with other pairs of subtypes. In fact, it is more like the distance of a pair of subsubtypes Robertson et al. (2000); Subtypes E and I do not exist any more since they were discovered to be composed of recombinants Robertson et al. (2000); It is currently discussed whether -- instead of CRF02 being a recombinant of subtype A and G -- subtype G should be designated as a circulating recombination form (CRF) nd CRF02 as a subtype Abecasis et al. (2007); There are 8 complete and over 400 partial HIV genomes in the LANL-database which belong neither to a subtype nor to a CRF (denoted by U). Moreover, the current classification system is somehow arbitrary like all complex classification systems that were created manually. To this end, it is desirable to deduce the classification system of HIV systematically by an algorithm. Of course, this problem is not restricted to HIV, but applies to all fast mutating and recombining viruses. Our work addresses the simpler subproblem to score classifications of given input sequences of some virus species (classification denotes a partition of the input sequences in several subtypes and CRFs). To this end, we reconstruct ancestral recombination graphs (ARG) of the input sequences under restrictions determined by the given classification. These restritions are imposed in order to ensure that the reconstructed ARGs do not contradict the classification under consideration. Then, we find the ARG with maximal probability by means of Markov Chain Monte Carlo methods. The probability of the most probable ARG is interpreted as a score for the classification. To our knowledge, this particular problem was not addressed up to now. The software package Lamarc Kuhner et al. (2000) allows for sampling ARGs, but it assumes that recombination events only involve one breakpoint. However, in HIV recombinants usually have more than one breakpoint. Moreover, Lamarc does not perform an explicit breakpoint detection, but tries to find them by chance. Although this approach is suitable for most situations, it will not lead to satisfying results in case of highly recombining viruses with multiple breakpoints.

59 BASIC BIOLOGICAL SCIENCES↗

A proximity‐based image‐processing algorithm for colloid assignment in segmented multiphase flow datasets

Summary Colloidal transport and deposition are of both environmental and engineering importance. Easier access to x‐ray microtomography (XMT) coupled with improved imaging resolution has made XMT a unique and viable tool for visualizing and quantifying these processes. Currently, there is scant information in the literature addressing colloid segmentation and analysis in saturated and unsaturated porous media, in particular related to spatial partitioning of colloids. To support this need, an approach to assign segmented colloidal particles and aggregates to different partitioning classes based on their proximity to different phases is presented here. The method uses different markers for each attachment site (e.g. wetting‐nonwetting phase interfaces). An example XMT dataset from a drainage experiment is used to demonstrate the efficacy of the image processing algorithms. Flow conditions, and fluid and colloid properties, can thus be compared to the behaviour of colloids within the porous medium. This algorithm can help elucidate colloidal deposition mechanisms and the importance of different attachment sites, explore the importance of fluid properties, as well as the arrangement and shape of the colloids.

BRUECK, C. L.↗

Insight into 3D micro-CT data: exploring segmentation algorithms through performance metrics

Three-dimensional (3D) micro-tomography (µ-CT) has proven to be an important imaging modality in industry and scientific domains. Understanding the properties of material structure and behavior has produced many scientific advances. An important component of the 3D µ-CT pipeline is image partitioning (or image segmentation), a step that is used to separate various phases or components in an image. Image partitioning schemes require specific rules for different scientific fields, but a common strategy consists of devising metrics to quantify performance and accuracy. The present article proposes a set of protocols to systematically analyze and compare the results of unsupervised classification methods used for segmentation of synchrotron-based data. Additionally, the proposed dataflow for Materials Segmentation and Metrics (MSM) provides 3D micro-tomography image segmentation algorithms, such as statistical region merging (SRM), k-means algorithm and parallel Markov random field (PMRF), while offering different metrics to evaluate segmentation quality, confidence and conformity with standards. Both experimental and synthetic data are assessed, illustrating quantitative results through the MSM dashboard, which can return sample information such as media porosity and permeability. The main contributions of this work are: (i) to deliver tools to improve material design and quality control; (ii) to provide datasets for benchmarking and reproducibility; (iii) to yield good practices in the absence of standards or ground-truth for ceramic composite analysis.

97 MATHEMATICS AND COMPUTING↗

A Scalable Space-Time Domain Decomposition Approach for Solving Large Scale Nonlinear Regularized Inverse Ill Posed Problems in 4D Variational Data Assimilation

We address the development of innovative algorithms designed to solve the strong-constraint Four Dimensional Variational Data Assimilation (4DVar DA) problems in large scale applications. We present a space-time decomposition approach which employs the whole domain decomposition, i.e. both along the spacial and temporal direction in the overlapping case, and the partitioning of both the solution and the operator. Starting from the global functional defined on the entire domain, we get to a sort of regularized local functionals on the set of sub domains providing the order reduction of both the predictive and the Data Assimilation models. The algorithm convergence is developed. Performance in terms of reduction of time complexity and algorithmic scalability is discussed on the Shallow Water Equations on the sphere. The number of state variables in the model, the number of observations in an assimilation cycle, as well as numerical parameters as the discretization step in time and in space domain are defined on the basis of discretization grid used by data available at repository Ocean Synthesis/Reanalysis Directory of Hamburg University.

97 MATHEMATICS AND COMPUTING↗

Scalable implementation of polynomial filtering for density functional theory calculation in PARSEC

In this work, we present an efficient implementation of polynomial filtering methods in PARSEC, a real-space pseudopotential based Kohn–Sham density functional theory solver. The implementation described here improves upon a Chebyshev-filtered subspace iteration algorithm used in the previous version of PARSEC. We present a hybrid polynomial filtering scheme that combines Chebyshev-filtered subspace iteration and a spectrum slicing method that partitions the spectrum into several spectral slices and uses bandpass-filtered subspace iteration to compute approximate eigenpairs within each interior slice simultaneously. We describe a procedure to partition a spectrum and construct polynomial filters. We also discuss a number of practical issues such as the use of appropriate data layouts for carrying out the computation on a two-dimensional process grid and how to achieve good load balance by allocating an appropriate number of process groups to each spectral slice. Numerical examples are presented to demonstrate the effectiveness of the hybrid polynomial filtering method as well as the superior parallel scalability of spectrum slicing in comparison to that of Chebyshev-filtered subspace iteration.

97 MATHEMATICS AND COMPUTING↗

Ensemble transfer learning for the prediction of anti-cancer drug response

Abstract Transfer learning, which transfers patterns learned on a source dataset to a related target dataset for constructing prediction models, has been shown effective in many applications. In this paper, we investigate whether transfer learning can be used to improve the performance of anti-cancer drug response prediction models. Previous transfer learning studies for drug response prediction focused on building models to predict the response of tumor cells to a specific drug treatment. We target the more challenging task of building general prediction models that can make predictions for both new tumor cells and new drugs. Uniquely, we investigate the power of transfer learning for three drug response prediction applications including drug repurposing, precision oncology, and new drug development, through different data partition schemes in cross-validation. We extend the classic transfer learning framework through ensemble and demonstrate its general utility with three representative prediction algorithms including a gradient boosting model and two deep neural networks. The ensemble transfer learning framework is tested on benchmark in vitro drug screening datasets. The results demonstrate that our framework broadly improves the prediction performance in all three drug response prediction applications with all three prediction algorithms.

60 APPLIED LIFE SCIENCES↗

Automatic identification and classification of Palomar Transient Factory astrophysical objects in GLADE

Palomar Transient Factory (PTF) is a comprehensive detection system for the identification and classification of transient astrophysical objects. In this paper, we make two significant contributions to the PTF pipeline. First, we present an experimental study that evaluates a novel implementation of the real-time classifier in GLADE - a parallel data processing system that combines the efficiency of a database with the extensibility of map-reduce. We show how each stage in the classifier maps optimally into GLADE tasks by taking advantage of the unique features of the system - range-based data partitioning, columnar storage, multi-query execution, and in-database support for complex aggregate computation. Second, we introduce a novel parallel similarity join algorithm for advanced transient classification. In conclusion, we implement this algorithm in GLADE and execute it on a massive supercomputer with more than 3,000 threads, achieving more than three orders of magnitude improvement over the PostgreSQL solution.

79 ASTRONOMY AND ASTROPHYSICS↗

Enhancing segmentation fairness through curriculum learning and progressive loss: a centralized and federated perspective on radiograph analysis

Bias in medical image segmentation can lead to unequal performance across demographic subgroups, raising concerns about fairness and reliability in clinical AI systems. While deep learning models have achieved high segmentation accuracy, ensuring equitable performance across race and gender remains a significant challenge, particularly in privacy-sensitive healthcare environments. This study investigates fairness-aware medical image segmentation for hip and knee radiographs using deep learning models evaluated in both centralized and Federated Learning (FL) settings. We introduce Curriculum Learning (CL) strategies and Progressive Loss (PL) functions to regulate sample difficulty during training. In addition, we propose two novel fairness-oriented federated learning algorithms, Federated Intersection over Union (FedIoU) and Federated Intersection over Union with Outlier Analysis (FedIoUoutlier). Experiments are conducted using multiple segmentation backbones and simulated multi-site data partitions derived from the Osteoarthritis Initiative dataset. Model performance is evaluated using Intersection over Union (IoU), IoU standard deviation, Skewed Error Ratio (SER), and Min-Max Disparity across race and gender subgroups. Statistical significance was verified using paired t-tests to compare per-sample IoU performance against baseline configurations. Across both hip and knee segmentation tasks, curriculum learning and progressive loss strategies consistently improved segmentation accuracy and reduced demographic performance disparities in centralized training. In federated settings, fairness-aware aggregation further enhanced performance. Notably, FedIoUoutlier combined with balanced curriculum learning and tiered progressive loss achieved the highest mean IoU while yielding the lowest SER and Min-Max Disparity, indicating improved fairness without sacrificing accuracy. In several configurations, federated models matched or exceeded the performance of optimized centralized models, with statistically significant improvements in per-sample IoU over baseline configurations. The results demonstrate that structured training strategies and fairness-aware federated aggregation can jointly improve accuracy, stability, and demographic fairness in medical image segmentation. By integrating curriculum learning, progressive loss, and novel FL algorithms, this work provides a practical pathway toward equitable and privacy-preserving AI systems for medical imaging.

97 MATHEMATICS AND COMPUTING↗

Evaluation of cloudless-sky periods detected by shortwave and longwave algorithms using lidar measurements

Identifying cloud-free period is an important task as they are common references in cloud and aerosol radiative forcing studies. Their identification requires precise methods to distinguish condensed water from other aerosols (eg mineral or moist hydrophyle aerosols). In this study we combine analyses of wide field of view shortwave and longwave irradiances and lidar backscatter measurements to explore situations that are considered neither completely clear nor cloudy. We find that cloud-free periods detected by analysis of the broadband measurements are also identified as cloud free by the lidar in more than 60% of situations. Residual occurrences are composed of 90% high-altitude cirrus clouds, partitioned equally between subvisible and semi-transparent optical thickness classes.

54 ENVIRONMENTAL SCIENCES↗

MapReduce SVM Game

Despite technological advances making computing devices faster, smaller, and more prevalent in today's age, data generation and collection has outpaced data processing capabilities. Simply having more compute platforms does not provide a means of addressing challenging problems in the big data era. Rather, alternative processing approaches are needed and the application of machine learning to big data is hugely important. The MapReduce programming paradigm is an alternative to conventional supercomputing approaches, and requires less stringent data passing constrained problem decompositions. Rather, MapReduce relies upon defining a means of partitioning the desired problem so that subsets may be computed independently and recom- bined to yield the net desired result. However, not all machine learning algorithms are amenable to such an approach. Game-theoretic algorithms are often innately distributed, consisting of local interactions between players without requiring a central authority and are iterative by nature rather than requiring extensive retraining. Effectively, a game-theoretic approach to machine learning is well suited for the MapReduce paradigm and provides a novel, alternative new perspective to addressing the big data problem. In this paper we present a variant of our Support Vector Machine (SVM) Game classifier which may be used in a distributed manner, and show an illustrative example of applying this algorithm.

97 MATHEMATICS AND COMPUTING↗

GronOR: Massively Parallel and GPU-Accelerated Non-Orthogonal Configuration Interaction for Large Molecular Systems

GronOR is a program package for non-orthogonal configuration interaction calculations for an electronic wave function built in terms of anti-symmetrized products of multi-configuration molecular fragment wave functions. The two-electron integrals that have to be processed may be expressed in terms of atomic orbitals or in terms of an orbital basis determined from the molecular orbitals of the fragments. The code has been specifically designed for execution on distributed memory massively parallel and Graphics Processing Unit (GPU)-accelerated computer architectures, using an MPI+OpenACC/OpenMP programming approach. The task-based execution model used in the implementation allows for linear scaling with the number of nodes on the largest pre-exascale architectures available, provides hardware fault resiliency, and enables effective execution on systems with distinct central processing unit-only and GPU-accelerated partitions. The code interfaces with existing multi-configuration electronic structure codes that provide optimized molecular fragment orbitals, configuration interaction coefficients, and the required integrals. Algorithm and implementation details, parallel and accelerated performance benchmarks, and an analysis of the sensitivity of the accuracy of results and computational performance to thresholds used in the calculations are presented.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DECREASING COMPUTING TIME WITH SYMPLECTIC CORRECTORS IN ADAPTIVE TIMESTEPPING ROUTINES

It has previously been shown that varying the numerical timestep during a symplectic orbital integration leads to a random walk in energy and angular momentum, destroying the phase space-conserving property of symplectic integrators. Here we show that when altering the timestep symplectic correctors can be used to reduce this error to a negligible level. Furthermore, these correctors can also be employed to avoid a large error introduction when changing the Hamiltonian's partitioning. We have constructed a numerical integrator using this technique that is nearly as accurate as widely used fixed-step routines. In addition, our algorithm is drastically faster for integrations of highly eccentricitic, large semimajor axis orbits, such as those found in the Oort Cloud.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Modeling of three-dimensional surfaces using high-level canonical piecewise-linear functions in cylindrical coordinates

In this paper, the potential application of the high-level canonical piecewise-linear model in the field of three-dimensional visualization is proposed. This idea emerges from the premise that a three-dimensional surface can be modeled by a continuous two-dimensional function. In this regard, the main contribution consists in providing a methodology for the construction of such function. For this purpose, the well-known algorithm used in the high-level canonical piecewise-linear model has been modified to achieve functions with greater graphing capability. One of the most notorious changes made with respect to the traditional methodology is the use of a new scheme of function domain partition. Contrary to the simplicial partitioning, in our proposal, an equally distributed angular partitioning is considered. With this, the resulting approximate function is expressed in cylindrical coordinates which overcome the typical limitation of graphs in Cartesian coordinates of only representing single-valued surfaces. Another remarkable change can be found in the range of evaluation of the function. Instead of using an open interval, in our approach, a closed interval from 0 to 2π is adopted. To support this proposal, illustrative case studies are reported. Numerical simulations demonstrate the effectiveness of this type of representation model not only in visual perception of three-dimensional surfaces, but also in more complex tasks like volume estimation.

97 MATHEMATICS AND COMPUTING↗