Search NASA⌕ Search

SEARCH · Search NASA

Results for “Incremental Computing”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 91 records · Page 5

Frictional granular mechanics: A variational approach

The mechanical properties of a cohesionless granular material are evaluated from grain-scale simulations. Intergranular interactions, including friction and sliding, are modeled by a set of contact rules based on the theories of Hertz, Mindlin, and Deresiewicz. A computer generated, three-dimensional, irregular pack of spherical grains is loaded by incremental displacement of its boundaries. Deformation is described by a sequence of static equilibrium configurations of the pack. A variational approach is employed to find the equilibrium configurations by minimizing the total work against the intergranular loads. Effective elastic moduli are evaluated from the intergranular forces and the deformation of the pack. Good agreement between the computed and measured moduli, achieved with no adjustment of material parameters, establishes the physical soundness of the proposed model.

54 ENVIRONMENTAL SCIENCES↗

Interactive Machine Learning at Scale with CHISSL

We demonstrate CHISSL, a scalable client-server system for real-time interactive machine learning. Our system is capa- ble of incorporating user feedback incrementally and imme- diately without a structured or pre-defined prediction task. Computation is partitioned between a lightweight web-client and a heavyweight server. The server relies on representation learning and agglomerative clustering to learn a dendrogram, a hierarchical approximation of a representation space. The client uses only this dendrogram to incorporate user feedback into the model via transduction. Distances and predictions for each unlabeled instance are updated incrementally and deter- ministically, with O(n) space and time complexity. Our al- gorithm is implemented in a functional prototype, designed to be easy to use by non-experts. The prototype organizes the large amounts of data into recommendations. This allows the user to interact with actual instances by dragging and drop- ping to provide feedback in an intuitive manner. We applied CHISSL to several domains including cyber, social media, and geo-temporal analysis.

Arendt, Dustin L.↗

Properties of dark solitons under SBS in focused beams

Using the method of four-wave probing of the waist of the laser beam focused into the bulk of a short active medium (L || {tau}c, where L is the length of the active medium, {tau} is the pulse duration, and c is the speed of light), we have studied the dynamics of the behaviour of a dark soliton, appearing upon a jump of the input Stokes signal phase by about {pi} under SBS. The computer simulation has shown that when spontaneous noises with the gain increment {Gamma}, exceeding the self-reflection threshold by 2 - 3 times, are generated, the dark soliton propagates along the interaction region for the time t Almost-Equal-To T{sub 2}{Gamma}{sub th}/2, where T{sub 2} is the the lifetime of acoustic phonons, and {Gamma}{sub th} = 25 - 30 is the stationary threshold gain increment. (special issue devoted to the 90th anniversary of n.g. basov)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Systematic, Polynomial-Cost Approach to Exact Correlation Energies (Final Technical Report)

The full configuration interaction (FCI) wave function provides the exact solution to the Schrödinger equation in a given basis set. While FCI is intractable due to exponential computational costs, the many-body expansion (or the method of increments) can reduce scaling to a low-order polynomial with system size. This project entailed advances in the incremental FCI (iFCI) approach, designed to allow iFCI to reach larger system sizes and maintain its intrinsic high accuracy. This document describes advances in solvers for iFCI, strategies to treat multiple charge and spin states, and virtual state management methods to reduce memory requirements. Overall, this project allows iFCI to correlate (for the first time) 142 valence electrons in 444 orbitals in a realistic model of a transition metal complex.

74 ATOMIC AND MOLECULAR PHYSICS↗

GX-Means: A model-based divide and merge algorithm for geospatial image clustering

One of the practical issues in clustering is the specification of the appropriate number of clusters, which is not obvious when analyzing geospatial datasets, partly because they are huge (both in size and spatial extent) and high dimensional. In this paper we present a computationally efficient model-based split and merge clustering algorithm that incrementally finds model parameters and the number of clusters. Additionally, we attempt to provide insights into this problem and other data mining challenges that are encountered when clustering geospatial data. The basic algorithm we present is similar to the G-means and X-means algorithms; however, our proposed approach avoids certain limitations of these well-known clustering algorithms that are pertinent when dealing with geospatial data. We compare the performance of our approach with the G-means and X-means algorithms. Experimental evaluation on simulated data and on multispectral and hyperspectral remotely sensed image data demonstrates the effectiveness of our algorithm.

99 GENERAL AND MISCELLANEOUS↗

Scalable Plug-and-Play ADMM with Convergence Guarantees

Plug-and-play priors (PnP) is a broadly applicable methodology for solving inverse problems by exploiting statistical priors specified as denoisers. Recent work has reported the state-of-the-art performance of PnP algorithms using pre-trained deep neural nets as denoisers in a number of imaging applications. However, current PnP algorithms are impractical in large-scale settings due to their heavy computational and memory requirements. This work addresses this issue by proposing an incremental variant of the widely used PnP-ADMM algorithm, making it scalable to problems involving a large number measurements. Here, we theoretically analyze the convergence of the algorithm under a set of explicit assumptions, extending recent theoretical results in the area. Additionally, we show the effectiveness of our algorithm with nonsmooth data-fidelity terms and deep neural net priors, its fast convergence compared to existing PnP algorithms, and its scalability in terms of speed and memory.

97 MATHEMATICS AND COMPUTING↗

Incremental Threshold Scheme Enabled IoT Group Key Management

Cyber landscape evolves rapidly. Internet of Things (IoT) and Edge Computing (EC) have rapidly become an integral part of the modern computing infrastructure. It is expected that there will be more than 50 billion active and connected IoT devices by 2025 [1]. Pervasive IoT/EC creates unprecedented opportunities bridging the gap between previously segregated cyber and physical spaces. However, this progress also brings along new security challenges. IoT devices typically have limited computation, communication, and storage resources. This leads to security architecture designs such as using symmetric keys for group communication. While secure and efficient in stable network settings, symmetric key solutions are ill-adapted for IoT's highly dynamic device mobility behavior and frequent group membership turnover. Whenever IoT members leave a group, the known symmetric keys cannot be made forgotten, posing a serious vulnerability. This leads to frequent re-groupings that require expensive re-authentication, key regeneration, and key redistribution in order to maintain IoT/EC security. We present a novel symmetric key management framework that integrate an Incremental Threshold Scheme (ITS) cryptographical function into communication protocol's key rotation mechanism to allow for secure and efficient symmetric key communication group member node revocation. This ITS-enabled key management framework alleviates the need of frequent and expensive re-grouping and re-keying needed by today's large and dynamic IoT/EC operations. We further applied this ITS-enabled key management framework to a distributed IoT/EC-integrated publish and subscribe framework for applicability validation.

Li, Mingyan↗

An Incremental Gradient Method for Optimization Problems With Variational Inequality Constraints

We consider minimizing a sum of agent-specific nondifferentiable merely convex functions over the solution set of a variational inequality (VI) problem in that each agent is associated with a local monotone mapping. This problem finds an application in computation of the best equilibrium in nonlinear complementarity problems arising in transportation networks. We develop an iteratively regularized incremental gradient method where at each iteration, agents communicate over a directed cycle graph to update their solution iterates using their local information about the objective and the mapping. The proposed method is single-timescale in the sense that it does not involve any excessive hard-to-project computation per iteration. We derive nonasymptotic agent-wise convergence rates for the suboptimality of the global objective function and infeasibility of the VI constraints measured by a suitably defined dual gap function. Finally, the proposed method appears to be the first fully iterative scheme equipped with iteration complexity that can address distributed optimization problems with VI constraints over cycle graphs.

convergence↗

Ultralight Door Design, Development and Demonstration Project (Final Scientific Report)

The project objectives associated with the Ultralight Door Project were to develop a lightweight driver's side door, 42.5% lighter than a current model year high-volume baseline door, at an incremental cost not to exceed $ \$ $ 5 per pound saved, while maintaining equivalent functionality, safety, corrosion, durability and sound transmission performance of the baseline vehicle. The project approach included the selection of a door architecture, development of a key performance target matrix and incremental cost model. Several unique door structures were developed and evaluated using computer-aided engineering (CAE) and cost modeling tools. The aluminum-intensive door structure was the only design capable of meeting both the performance and cost criteria objectives. The door module, glass, interior trim, latch and electrical subsystems were functionally integrated with the aluminum door structure, enabling additional mass reduction beyond material substitution. The lightweight door design was prototyped, integrated with baseline vehicles and tested to validate equivalent functionality and performance. The project results demonstrate a mass reduction of 15.2 kg (40%) at an incremental cost of $ \$ $2.81 per pound saved, while maintaining functionality and performance of the baseline door. The environmental benefit associated with the Ultralight Door enables a 6g CO 2 eq. per kilometer environmental benefit, for a 4-door vehicle powered by a downsized fuel injected gasoline combustion engine. The project results were presented and published in the 2018 SAE International Conference proceedings and in the Journal of Life Cycle Assessment.

36 MATERIALS SCIENCE↗

Optimization-based mesh correction with volume and convexity constraints

Here, we consider the problem of finding a mesh such that 1) it is the closest, with respect to a suitable metric, to a given source mesh having the same connectivity, and 2) the volumes of its cells match a set of prescribed positive values that are not necessarily equal to the cell volumes in the source mesh. Also, this volume correction problem arises in important simulation contexts, such as satisfying a discrete geometric conservation law and solving transport equations by incremental remapping or similar semi-Lagrangian transport schemes. In this paper we formulate volume correction as a constrained optimization problem in which the distance to the source mesh defines an optimization objective, while the prescribed cell volumes, mesh validity and/or cell convexity specify the constraints. We solve this problem numerically using a sequential quadratic programming (SQP) method whose performance scales with the mesh size. To achieve scalable performance we develop a specialized multigrid-based preconditioner for optimality systems that arise in the application of the SQP method to the volume correction problem. Numerical examples illustrate the importance of volume correction, and showcase the accuracy, robustness and scalability of our approach.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Energy dissipation via acoustic emission in ductile crack initiation

In this article, we present a modeling approach to estimate the energy release due to ductile crack initiation in conjunction to the energy dissipation associated with the formation and propagation of transient stress waves typically referred to as acoustic emission. To achieve this goal, a ductile fracture problem is investigated computationally using the finite element method based on a compact tension geometry under Mode I loading conditions. To quantify the energy dissipation associated with acoustic emission, a crack increment is produced given a pre-determined notch size in a 3D cohesive-based extended finite element model. The computational modeling methodology consists of defining a damage initiation state from static simulations and linking such state to a dynamic formulation used to evaluate wave propagation and related energy redistribution effects. The model relies on a custom traction separation law constructed using full field deformation measurements obtained experimentally using the digital image correlation method. The amount of energy release due to the investigated first crack increment is evaluated through three different approaches both for verification purposes and to produce an estimate of the portion of the energy that radiates away from the crack source in the form of transient waves. The results presented herein propose an upper bound for the energy dissipation associated to acoustic emission, which could assist the interpretation and implementation of relevant nondestructive evaluation methods and the further enrichment of the understanding of effects associated with fracture.

42 ENGINEERING↗

An Orthogonal Recursive Bisection (ORB) Based Time Advancement Algorithm for CFD-DEM Solvers

The time integration of the granular phase in coupled computational fluid dynamics (CFD) – discrete element method (DEM) simulations presents a unique computational challenge brought about by the large variations in particle collisional time scales. Particles in the dilute regions of the computational domain can be advanced with large time steps while dense regions require much smaller time increments. However, the time step size in most solvers is globally set as the limit for accuracy and stability imposed by the collisions and is typically orders of magnitude less than that required away from collisions. This work addresses this precise issue and provides a strategy to avoid the use of a global conservative small time step size for the entire set of particles.A novel time stepping algorithm for CFD-DEM solvers using a partitioning approach using orthogonal recursive bisection (ORB) that allows for variable time steps among particles is described and its computational performance is compared against baseline explicit methods, typically used in several CFD-DEM solvers. ORB has advantages of being relatively quick and easy to update incrementally and has the required heuristic behavior (i.e., it will split the region in half with a cluster on each side) when groups of particles are well separated (clustered). The algorithm presented in this work uses a local time stepping approach to resolve collisional time scales for subsets of particles that are present at the leaves of the ORB, thereby resulting in substantial reduction of computational cost. The parallel implementation of this method where a ``knapsack” algorithm is used in tandem with ORB for effective load-balancing is also presented, where a best possible partitioning is obtained based on number of particles and local time-stepping costs. The algorithm is tested against benchmark problems with varying particle distributions that include fluidized bed and riser flow scenarios. Preliminary results indicate that the approach is 2-3X faster than traditional explicit methods for problems that involve both dense and dilute regions, while maintaining the same level of accuracy.

adaptive timestepping↗

Computationally-efficient stochastic cluster dynamics method for modeling damage accumulation in irradiated materials

An improved version of a recently developed stochastic cluster dynamics (SCD) method (Marian and Bulatov, 2012) [6] is introduced as an alternative to rate theory (RT) methods for solving coupled ordinary differential equation (ODE) systems for irradiation damage simulations. SCD circumvents by design the curse of dimensionality of the variable space that renders traditional ODE-based RT approaches inefficient when handling complex defect population comprised of multiple (more than two) defect species. Several improvements introduced here enable efficient and accurate simulations of irradiated materials up to realistic (high) damage doses characteristic of next-generation nuclear systems. The first improvement is a procedure for efficiently updating the defect reaction-network and event selection in the context of a dynamically expanding reaction-network. Next is a novel implementation of the τ-leaping method that speeds up SCD simulations by advancing the state of the reaction network in large time increments when appropriate. Lastly, a volume rescaling procedure is introduced to control the computational complexity of the expanding reaction-network through occasional reductions of the defect population while maintaining accurate statistics. The enhanced SCD method is then applied to model defect cluster accumulation in iron thin films subjected to triple ion-beam (Fe{sup 3+}, He{sup +} and H{sup +}) irradiations, for which standard RT or spatially-resolved kinetic Monte Carlo simulations are prohibitively expensive.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Generation of Reversible C++ Code for Optimistic Parallel Discrete Event Simulation

The reversible execution of C/C++ code has been a target of research and engineering for more than a decade as reversible computation has become a central notion in large-scale parallel discrete event simulation (PDES). The simulation models that are implemented for PDES are of increasing complexity and size and require various language features to support abstraction, encapsulation, and composition when building a simulation model. In this paper, we focus on parallel simulation models that are written with user-defined C++ abstractions and abstractions of the C++ Standard Library. We present an approach based on incremental state saving for establishing reversibility of C++ and an evaluation for a kinetic Monte-Carlo simulation implemented in C++. Although a significant runtime overhead is introduced with our technique, it is an enormous win that it allows using the entire C++ language, and has that code automatically transformed into reversible code to enable parallel execution with the Rensselaer’s optimistic simulation system (ROSS).

97 MATHEMATICS AND COMPUTING↗

Fracture Shearing in the Eau Claire Formation

This data set consists of Computed Tomographic (CT) data for five sheared Eau Claire Formation core samples with complex and heterogeneous lithology. Each sample was prefractured, housed in a specially adapted core holder, and sheared in incremental fashion. CT scans were taken before and after each shearing event.

Computed Tomography↗

A Real-Time Vehicle-Specific Eco-Routing Model for On-Board Navigation Applications Capturing Transient Vehicle Behavior

The paper develops a real-time vehicle-specific eco-routing model for use in on-board navigation systems for both conventional fuel- and battery-powered electric vehicles. The model uses a novel link cost function that retains all microscopic transient behavior along a link by capturing within-link speed, acceleration, and road grade variations. Specifically, eight vehicle-agnostic link-specific variables are transmitted to the cloud and fused with information received from other connected vehicles. The fused data are then sent back to the connected vehicles and used to compute vehicle-specific eco-routes (edge computing). The solution produces an energy-efficient dynamic user-equilibrium traffic assignment that is solved incrementally. A numerical experiment is first designed to test the model, demonstrating the benefits associated with vehicle-specific eco-routes compared to those produced by traditional models. The model is then implemented in a micro-simulation framework to evaluate the network-wide impacts of the proposed energy-efficient user-optimum incremental traffic assignment for different traffic demand levels. Results demonstrate that the proposed model produces lower network-wide energy consumption levels compared to traditional energy-efficient and travel time user-optimum traffic assignment methods for both conventional fuel and electric vehicles. Conventional fuel savings relative to travel time routing decrease with increasing traffic demand levels, while electric power savings do not vary monotonically with congestion levels. Energy savings relative to traditional eco-routing are also demonstrated to not vary monotonically with demand levels. Results of the study also demonstrate that the transportation network layout significantly affects the eco-routing system performance. Finally, the feasibility of the proposed model in real-world applications is discussed and presented.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

An efficient computational approach to model statistical correlations in photon counting x-ray detectors

Purpose: To introduce and evaluate an increment matrix approach (IMA) describing the signal statistics of energy-selective photon counting detectors including spatial–spectral correlations between energy bins of neighboring detector pixels. The importance of the occurring correlations for image-based material decomposition is studied. Methods: An IMA describing the counter increase patterns in a photon counting detector is proposed. This IMA has the potential to decrease the number of required random numbers compared to Monte Carlo simulations by pursuing an approach based on convolutions. To validate and demonstrate the IMA, an approximate semirealistic detector model is provided, simulating a photon counting detector in a simplified manner, e.g., by neglecting count rate-dependent effects. In this way, the spatial–spectral correlations on the detector level are obtained and fed into the IMA. The importance of these correlations in reconstructed energy bin images and the corresponding detector performance in image-based material decomposition is evaluated using a statistically optimal decomposition algorithm. Results: The results of IMA together with the semirealistic detector model were compared to other models and measurements using the spectral response and the energy bin sensitivity, finding a good agreement. Correlations between the different reconstructed energy bin images could be observed, and turned out to be of weak nature. These correlations were found to be not relevant in image-based material decomposition. An even simpler simulation procedure based on the energy bin sensitivity was tested instead and yielded similar results for the image-based material decomposition task, as long as the fact that one incident photon can increase multiple counters across neighboring detector pixels is taken into account. Conclusions: The IMA is computationally efficient as it required about 10{sup 2} random numbers per ray incident on a detector pixel instead of an estimated 10{sup 8} random numbers per ray as Monte Carlo approaches would need. The spatial–spectral correlations as described by IMA are not important for the studied image-based material decomposition task. Respecting the absolute photon counts and thus the multiple counter increases by a single x-ray photon, the same material decomposition performance could be obtained with a simpler detector description using the energy bin sensitivity.

60 APPLIED LIFE SCIENCES↗

Scalable Prediction of Energy Consumption using Incremental Time Series Clustering

Time series datasets are a canonical form of high velocity Big Data, and often generated by pervasive sensors, such as found in smart infrastructure. Performing predictive analytics on time series data can be computationally complex, and requires approximation techniques. In this paper, we motivate this problem using a real application from the smart grid domain. We propose an incremental clustering technique, along with a novel affinity score for determining cluster similarity, which help reduce the prediction error for cumulative time series within a cluster. We evaluate this technique, along with optimizations, using real datasets from smart meters, totaling ~700,000 data points, and show the efficacy of our techniques in improving the prediction error of time series data within polynomial time.

Simmhan, Yogesh↗