Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “partitioned methods”

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 541 records · Page 30

Evaluation of fuzzy inference systems using fuzzy least squares

Efforts to develop evaluation methods for fuzzy inference systems which are not based on crisp, quantitative data or processes (i.e., where the phenomenon the system is built to describe or control is inherently fuzzy) are just beginning. This paper suggests that the method of fuzzy least squares can be used to perform such evaluations. Regressing the desired outputs onto the inferred outputs can provide both global and local measures of success. The global measures have some value in an absolute sense, but they are particularly useful when competing solutions (e.g., different numbers of rules, different fuzzy input partitions) are being compared. The local measure described here can be used to identify specific areas of poor fit where special measures (e.g., the use of emphatic or suppressive rules) can be applied. Several examples are discussed which illustrate the applicability of the method as an evaluation tool.

Barone, Joseph M.↗

Model Exploration of an Information-Based Healthcare Intervention Using Parallelization and Active Learning

This paper describes the application of a large-scale active learning method to characterize the parameter space of a computational agent-based model developed to investigate the impact of CommunityRx, a clinical information-based health intervention that provides patients with personalized information about local community resources to meet basic and self-care needs. Additionally, the diffusion of information about community resources and their use is modeled via networked interactions and their subsequent effect on agents' use of community resources across an urban population. A random forest model is iteratively fitted to model evaluations to characterize the model parameter space with respect to observed empirical data. We demonstrate the feasibility of using high-performance computing and active learning model exploration techniques to characterize large parameter spaces; by partitioning the parameter space into potentially viable and non-viable regions, we rule out regions of space where simulation output is implausible to observed empirical data. We argue that such methods are necessary to enable model exploration in complex computational models that incorporate increasingly available micro-level behavior data. We provide public access to the model and high-performance computing experimentation code.

97 MATHEMATICS AND COMPUTING↗

Development and testing of coarse-grained models for ultrasonic simulations of cast austenitic stainless steel

Ultrasonic inspection of cast austenitic stainless steel (CASS) in the nuclear industry is particularly challenging because of sound field scatter and attenuation caused by the coarse-grained microstructure. Modeling and simulation are important tools in ultrasonic testing, as they can be used to help address key aspects of inspections, such as developing new probe designs, predicting inspection reliability, and testing phased-array focal laws. However, developing a useful and reliable CASS model is challenging due to the many grain interfaces and crystalline orientations that must be captured. We demonstrate a method of creating a realistic CASS model that is usable in CIVA, a commercially available modeling and simulation software platform. Using polished and chemically etched sections, we generate models of a coarse-grained equiaxed specimen and a columnar specimen. We also test an alternative method of generating a coarse-grained model using Voronoi regions. We qualitatively compare sound field scatter and quantitatively compare sound field attenuation and beam partitioning in simulated sound fields to those of laboratory-measured sound fields. Results show that the Voronoi models perform as well as or better than the models based on actual grain morphology. Here we also show that model-to-model randomness in Voronoi grain structure can impact the magnitude of a simulated echo response by a factor of two or more. Although CASS models are potentially a good depiction of reality for a given scenario, they should not be considered representative since CASS morphology can change significantly from specimen to specimen or within the same specimen.

36 MATERIALS SCIENCE↗

Accelerating Embedding Potential Optimization by Reconstructing the Pseudo-Valence Electron Density

Density functional embedding theory (DFET) enables use of electronic structure methods with higher accuracy than density functional theory in a local region, with applications thus far ranging from (photo/electro)catalysis to reactions in solution. DFET partitions a large collection of atoms into smaller groups that interact via a shared embedding (interaction) potential V emb , determined via functional optimization. The optimized effective potential (OEP) process used to optimize V emb is time-consuming and becomes a computational bottleneck due to sharp, oscillating features of V emb near nuclei. Here, similar to pseudopotential theory, by reconstructing electron densities used in the OEP process from smoother pseudo-valence-only (PVO) electron densities as proxies for total densities of the full system and subsystems, we can retain accuracy in the embedded electronic structure calculations while potentially reducing the overhead of V emb construction, within the projector augmented-wave (PAW) formalism. We explore three different chemical reactions as exemplars to test PVO–DFET, namely, H 2 dissociative adsorption on a Cu(111) surface, H 2 O adsorption on a Pt(111) surface, and aqueous [Ca 2+ –SO 4 2– ] ion-pair formation. The PVO approximation works well for all three systems with minimal loss of accuracy (∼10–70 meV error relative to the original exact-derivative (ED) approach) while accelerating V emb generation for the Cu and Pt systems respectively by 20× and 5×. Given proper numerical convergence parameters, the spatial distributions of differences between PVO- and ED-based V emb outside the core regions are small, explaining the exceptional agreement between the two approaches. Finally, we anticipate that this more efficient PVO–DFET approximation will be useful whenever computation of V emb is much more expensive than subsequent embedded high-level electron correlation calculations.

approximation↗

Towards developing robust algorithms for solving partial differential equations on MIMD machines

Methods for efficient computation of numerical algorithms on a wide variety of MIMD machines are proposed. These techniques reorganize the data dependency patterns to improve the processor utilization. The model problem finds the time-accurate solution to a parabolic partial differential equation discretized in space and implicitly marched forward in time. The algorithms are extensions of Jacobi and SOR. The extensions consist of iterating over a window of several timesteps, allowing efficient overlap of computation with communication. The methods increase the degree to which work can be performed while data are communicated between processors. The effect of the window size and of domain partitioning on the system performance is examined both by implementing the algorithm on a simulated multiprocessor system.

Saltz, J. H.↗

Towards developing robust algorithms for solving partial differential equations on MIMD machines

Methods for efficient computation of numerical algorithms on a wide variety of MIMD machines are proposed. These techniques reorganize the data dependency patterns to improve the processor utilization. The model problem finds the time-accurate solution to a parabolic partial differential equation discretized in space and implicitly marched forward in time. The algorithms are extensions of Jacobi and SOR. The extensions consist of iterating over a window of several timesteps, allowing efficient overlap of computation with communication. The methods increase the degree to which work can be performed while data are communicated between processors. The effect of the window size and of domain partitioning on the system performance is examined both by implementing the algorithm on a simulated multiprocessor system.

Saltz, Joel H.↗

Implementation of a partitioned algorithm for simulation of large CSI problems

The implementation of a partitioned numerical algorithm for determining the dynamic response of coupled structure/controller/estimator finite-dimensional systems is reviewed. The partitioned approach leads to a set of coupled first and second-order linear differential equations which are numerically integrated with extrapolation and implicit step methods. The present software implementation, ACSIS, utilizes parallel processing techniques at various levels to optimize performance on a shared-memory concurrent/vector processing system. A general procedure for the design of controller and filter gains is also implemented, which utilizes the vibration characteristics of the structure to be solved. Also presented are: example problems; a user's guide to the software; the procedures and algorithm scripts; a stability analysis for the algorithm; and the source code for the parallel implementation.

Alvin, Kenneth F.↗

Analyzing Recharge Dynamics and Storage in a Thick, Karstic Vadose Zone

Karst vadose zone heterogeneity creates complex transmission and storage dynamics that affect the timing and magnitude of aquifer recharge. Young, high-matrix permeability eogenetic karst aquifers may have significantly higher matrix storage than older, lower matrix permeability counterparts. In vulnerable and water-limited karst regions, the timescales of storage may be important for seasonal and sub-seasonal water resource management. We create a framework to quantify storage dynamics in karst aquifers using high-resolution precipitation and groundwater levels from the Northern Guam Lens Aquifer in the US territory of Guam. We estimate recharge using the Water Table Fluctuation method, and then develop transfer functions between precipitation and recharge to quantify storage and release of water from the vadose zone. The transfer functions are partitioned into different flow pathways including conduit, conduit/matrix, and slowly draining matrix. Probability distributions are fit to each pathway to determine the average travel times of infiltrated waters. The results show that aquifer recharge through secondary porosity features typically occurs within a few hours of a rainfall event, but this rapid recharge accounts for only 12%–28% of total recharge. The majority of aquifer recharge (>70%) occurs within a month of a contributing storm event. An additional 10% of recharge, on average, took longer than a month to reach the water table. The framework established can help improve the hydrological modeling and freshwater management for karst aquifers.

Patricia Spellman↗

Traceable Black-Box Watermarks For Federated Learning

Due to the distributed nature of Federated Learning (FL) systems, each local client has access to the global model, which poses a critical risk of model leakage. Existing works have explored injecting watermarks into local models to enable intellectual property protection. However, these methods either focus on non-traceable watermarks or traceable but white-box watermarks. We identify a gap in the literature regarding the formal definition of traceable black-box watermarking and the formulation of the problem of injecting such watermarks into FL systems. In this work, we first formalize the problem of injecting traceable black-box watermarks into FL. Based on the problem, we propose a novel server-side watermarking method, TraMark, which creates a traceable watermarked model for each client, enabling verification of model leakage in black-box settings. To achieve this, TraMark partitions the model parameter space into two distinct regions: the main task region and the watermarking region. Subsequently, a personalized global model is constructed for each client by aggregating only the main task region while preserving the watermarking region. Each model then learns a unique watermark exclusively within the watermarking region using a distinct watermark dataset before being sent back to the local client. Extensive results across various FL systems demonstrate that TraMark ensures the traceability of all watermarked models while preserving their main task performance.

Xu, Jiahao [University of Nevada, Reno]↗

Solvent‐free Synthesis of Multi‐Module Pore‐Space‐Partitioned Metal‐Organic Frameworks for Gas Separation

Abstract Multi‐module design of framework materials with multiple distinct building blocks has attracted much attention because such materials are more amenable to compositional and geometrical tuning and thus offer more opportunities for property optimization. Few examples are known that use environmentally friendly and cost‐effective solvent‐free method to synthesize such materials. Here, we report the use of solvent‐free method (also modulator‐free) to synthesize a series of multi‐module MOFs with high stability and separation property for C 2 H 2 /CO 2 . The synthesis only requires simple mixing of reactants and short reaction time (2 h). Highly porous and stable materials can be made without any post‐synthetic activation. The success of solvent‐free synthesis of multi‐module MOFs reflects the synergy between different modules, resulting in stable pore‐partitioned materials, despite the fact that other competitive crystallization pathways with simpler framework compositions also exist.

Xiao, Yuchen↗

Parallel Methods on Large-Scale Structural Analysis and Physics Applications; Symposium, Hampton, VA, Feb. 5, 6, 1991, Selected Papers

Recent advances in parallel methods and algorithms integrated into large-scale codes are presented. Consideration is given to problem decomposition (substructuring), efficient matrix solution algorithms for shared memory architectures, dynamic and transient analysis algorithms for shared memory architectures, and algorithms for distributed and massively parallel architectures. Particular attention is given to partitioning of unstructured problems for parallel processing, parallel-vector computation for linear-structural analysis and nonlinear unconstraint optimization problems, a parallel-vector equation solver for unsymmetric matrices on supercomputers, parallel nonlinear finite element dynamic response, multigrid algorithms for solving structural mechanics problems on supercomputers, structural analysis on massively parallel computers, explicit finite element methods with contact-impact on SIMD computers, and the impact of mapping and sparsity on parallelized finite element method modules.

Storaasli, Olaf O.↗

Direct Monte Carlo Simulations of Chemical Equilibrium Composition of Molecular Fluid Mixtures Under Shock Conditions

A new Monte Carlo simulation method is implemented which holds the number and kind of atoms constant rather than the number and kind of molecules for a molecular fluid mixture. Chemical reactions are allowed as a correlated move of atoms such as an interchange of atoms between molecules. Equilibrium chemical composition is determined as an average over the simulation along with equation of state quantities. Results are presented for N 2 + O 2 → 2NO at 30GPa and 3000K. The equilibrium composition is shown to be sensitive to the potentials between unlike species.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

An algorithm for computing the number of distinct spectral vectors in thematic mapper data

A computationally efficient method was developed to compute the number of distinct spectral vectors and their frequency of occurrence in Landsat-4 Thematic Mapper (TM) data. The algorithm first partitions the image into spectrally disjoint subsets and then computes the frequency distribution of distinct spectral vectors within each subset from a multidimensional histogram. The overall frequency distribution is tabulated by accumulating the results from each subset. The number of distinct spectral vectors could be used as a measure of potential storage compaction of alternate data representations for data compression, or as a measure of information content in the comparison of spectral band combinations and/or spatial resolutions for an image. Results from processing three 512 x 512 pixel Landsat-4 TM images and one Landsat-4 Multispectral Scanner (MSS) image are presented as examples. An algorithm for computing the frequency distribution of distinct spectral vectors in MSS data is given in the Appendix.

Wharton, S. W.↗

A computational procedure for large rotational motions in multibody dynamics

A computational procedure suitable for the solution of equations of motion for multibody systems is presented. The present procedure adopts a differential partitioning of the translational motions and the rotational motions. The translational equations of motion are then treated by either a conventional explicit or implicit direct integration method. A principal feature of this procedure is a nonlinearly implicit algorithm for updating rotations via the Euler four-parameter representation. This procedure is applied to the rolling of a sphere through a specific trajectory, which shows that it yields robust solutions.

Park, K. C.↗

Adaptive control of space based robot manipulators

For space based robots in which the base is free to move, motion planning and control is complicated by uncertainties in the inertial properties of the manipulator and its load. A new adaptive control method is presented for space based robots which achieves globally stable trajectory tracking in the presence of uncertainties in the inertial parameters of the system. A partition is made of the fifteen degree of freedom system dynamics into two parts: a nine degree of freedom invertible portion and a six degree of freedom noninvertible portion. The controller is then designed to achieve trajectory tracking of the invertible portion of the system. This portion consist of the manipulator joint positions and the orientation of the base. The motion of the noninvertible portion is bounded, but unpredictable. This portion consist of the position of the robot's base and the position of the reaction wheel.

Walker, Michael W.↗

Propulsion system performance resulting from an Integrated Flight/Propulsion Control design

Propulsion system specific results are presented from the application of the Integrated Methodology for Propulsion and Airframe Control (IMPAC) design approach to Integrated Flight/Propulsion Control design for a STOVL aircraft in transition flight. The IMPAC method is briefly discussed and the propulsion system specifications for the integrated control design are examined. The structure of a linear engine controller that results from partitioning a linear centralized controller is discussed. The details of a nonlinear propulsion control system are presented, including a scheme to protect the engine operational limits: the fan surge margin and the acceleration/deceleration schedule which limits the fuel flow. Also, a simple but effective multivariable integrator windup protection scheme is investigated. Nonlinear closed-loop simulation results are presented for two typical pilot commands for transition flight: acceleration while maintaining flight path angle and a change in flight path angle while maintaining airspeed. The simulation nonlinearities include the airframe/engine coupling, the actuator and sensor dynamics and limits, the protection scheme for the engine operational limits, and the integrator windup protection. Satisfactory performance of the total airframe plus engine system for transition flight, as defined by the specifications, is maintained during the limit operation of the closed-loop engine subsystem.

Mattern, Duane↗

Propulsion system performance resulting from an integrated flight/propulsion control design

Propulsion-system-specific results are presented from the application of the integrated methodology for propulsion and airframe control (IMPAC) design approach to integrated flight/propulsion control design for a 'short takeoff and vertical landing' (STOVL) aircraft in transition flight. The IMPAC method is briefly discussed and the propulsion system specifications for the integrated control design are examined. The structure of a linear engine controller that results from partitioning a linear centralized controller is discussed. The details of a nonlinear propulsion control system are presented, including a scheme to protect the engine operational limits: the fan surge margin and the acceleration/deceleration schedule that limits the fuel flow. Also, a simple but effective multivariable integrator windup protection scheme is examined. Nonlinear closed-loop simulation results are presented for two typical pilot commands for transition flight: acceleration while maintaining flightpath angle and a change in flightpath angle while maintaining airspeed. The simulation nonlinearities include the airframe/engine coupling, the actuator and sensor dynamics and limits, the protection scheme for the engine operational limits, and the integrator windup protection. Satisfactory performance of the total airframe plus engine system for transition flight, as defined by the specifications, was maintained during the limit operation of the closed-loop engine subsystem.

Mattern, Duane↗

Runtime support and compilation methods for user-specified data distributions

This paper describes two new ideas by which an HPF compiler can deal with irregular computations effectively. The first mechanism invokes a user specified mapping procedure via a set of compiler directives. The directives allow use of program arrays to describe graph connectivity, spatial location of array elements, and computational load. The second mechanism is a simple conservative method that in many cases enables a compiler to recognize that it is possible to reuse previously computed information from inspectors (e.g. communication schedules, loop iteration partitions, information that associates off-processor data copies with on-processor buffer locations). We present performance results for these mechanisms from a Fortran 90D compiler implementation.

Ponnusamy, Ravi↗