Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “regularity”

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 1,099 records · Page 61

Propagation Pattern for Moment Representation of the Lattice Boltzmann Method

A propagation pattern for the moment representation of the regularized lattice Boltzmann method (LBM) in three dimensions is presented. Using effectively lossless compression, the simulation state is stored as a set of moments of the lattice Boltzmann distribution function, instead of the distribution function itself. An efficient cache-aware propagation pattern for this moment representation has the effect of substantially reducing both the storage and memory bandwidth required for LBM simulations. This article extends recent work with the moment representation by expanding the performance analysis on central processing unit (CPU) architectures, considering how boundary conditions are implemented, and demonstrating the effectiveness of the moment representation on a graphics processing unit (GPU) architecture.

42 ENGINEERING↗

MemXCT: Design, Optimization, Scaling, and Reproducibility of X-Ray Tomography Imaging

Here, this work extends our previous research entitled "MemXCT: Memory-centric X-ray CT Reconstruction with Massive Parallelization" that was originally published at SC19 conference (Hidayetoglu et al., 2019) with reproducibility of the computational imaging performance. X-ray computed tomography (XCT) is regularly used at synchrotron light sources to study the internal morphology of materials at high resolution. However, experimental constraints, such as radiation sensitivity, can result in noisy or undersampled measurements. Further, depending on the resolution, sample size and data acquisition rates, the resulting noisy dataset can be in the order of terabytes. Advanced iterative reconstruction techniques can produce high-quality images from noisy measurements, but their computational requirements have made their use an exception rather than the rule. We propose a novel memory-centric approach that avoids redundant computations at the expense of additional memory complexity. We develop a memory-centric iterative reconstruction system, MemXCT, that uses an optimized SpMV implementation with two-level pseudo-Hilbert ordering and multi-stage input buffering. We evaluate MemXCT on various supercomputer architectures involving KNL and GPU. MemXCT can reconstruct a large (11Kx11K) mouse brain tomogram in 10 seconds using 4096 KNL nodes (256K cores). The results presented in our original article at the SC19 were based on large-scale supercomputing resources. The MemXCT application was selected for the Student Cluster Competition (SCC) Reproducibility Challenge and evaluated on a variety of cloud computing resources by universities around the world in the SC20 conference. We summarize the results of the top-ranked SCC Reproducibility Challenge teams and identify the most pertinent measures for ensuring the reproducibility of our experiments in this article.

47 OTHER INSTRUMENTATION↗

Optimizing Error-Bounded Lossy Compression for Scientific Data With Diverse Constraints

Vast volumes of data are produced by today's scientific simulations and advanced instruments. These data cannot be stored and transferred efficiently because of limited I/O bandwidth, network speed, and storage capacity. Error-bounded lossy compression can be an effective method for addressing these issues: not only can it significantly reduce data size, but it can also control the data distortion based on user-defined error bounds. In practice, many scientific applications have specific requirements or constraints for lossy compression, in order to guarantee that the reconstructed data are valid for post hoc analysis. For example, some datasets contain irrelevant data that should be isolated in particular and users often have intuition regarding value ranges, geospatial regions, and other data subsets that are crucial for subsequent analysis. Existing state-of-the-art error-bounded lossy compressors, however, do not consider these constraints during compression, resulting in inferior compression ratios with respect to user's post hoc analysis, due to the fact that the data itself provides little or no value for post hoc analysis. In this work we address this issue by proposing an optimized framework that can preserve diverse constraints during the error-bounded lossy compression, e.g., cleaning the irrelevant data, efficiently preserving different precision for multiple value intervals, and allowing users to set diverse precision over both regular and irregular regions. We perform our evaluation on a supercomputer with up to 2,100 cores. Experiments with six real-world applications show that our proposed diverse constraints based error-bounded lossy compressor can obtain a higher visual quality or data fidelity on reconstructed data with the same or even higher compression ratios compared with the traditional state-of-the-art compressor SZ. Furthermore, our experiments also demonstrate very good scalability in compression performance compared with the I/O throughput of the parallel file system.

97 MATHEMATICS AND COMPUTING↗

A Flexible Forwarding Scheme to Improve Latency-Bound Irregular P2P Communication in MPI

We propose an algorithm to efficiently perform latency-bound communication scenarios that consist of many small messages. In these parallel scenarios, processes typically pass around a lot of small-sized messages of a few KBs of size. Performing communication operations with P2P MPI routines or collective MPI routines (including neighborhood collectives) in such scenarios may not always yield the optimal results and may not resolve the latency bottleneck. To this end, we develop a regular structure called virtual process topology (VPT) on which the messages can be communicated in a structured and controlled manner. Using parameters of this topology, one can tune the rate of aggression in tackling the latency costs. We demonstrate that our communication algorithm is preferable to MPI P2P and collective routines for latency-bound communication and it can easily be adapted only by replacing calls to MPI routines in a parallel application. We show how to adapt existing topology-aware mapping heuristics to address the volume overhead due to communicating messages on the VPT. Moreover, we propose a novel swap-based mapping heuristic to address this overhead by optimizing the maximum volume handled by a process. Experiments on synthetic communication graphs as well as real-world applications such as parallel Canonical Polyadic sparse tensor decomposition and parallel sparse matrix-dense matrix multiplication show that our approach is a powerful way of overcoming the bottlenecks posed by sparse and latency-bound irregular communication.

communication algorithm↗

DC-Link Current Minimization Control for Current Source Converter-Based Solid-State Transformer

This article proposes a fast predictive control method and a small DC-link inductor to minimize the DC-link current in current-source converter (CSC)-based solid-state transformer. The DC-link current minimization can significantly reduce power loss and improve efficiency. The challenge of this problem is on improving both steady-state and dynamic performance. PI control methods and large DC-link inductors are conventionally used in the CSC but have limited dynamic performance. A model predictive control (MPC) method is proposed to achieve switching-cycle-level settling time, and the DC-link inductor is sized for 40% ripple to enable fast current change. Importantly, this article also proposes to minimize the DC-link current by varying the current even within a line cycle under single-phase load to improve the steady-state performance, in contrast with the reduction to a constant value in the literature. The proposed MPC features a constant switching frequency without weighting factors. The MPC does not have a high computational burden and is implemented in a regular digital controller for a prototype of soft-switching solid-state transformer (S4T) with reduced conduction loss. The effectiveness of the proposed method has been experimentally verified on the SiC S4T prototype during steady-state and dynamics under different multiport power flow conditions up to 2 kV peak. Here, the DC-link current in the experiments is close to the minimum current with a short zero-vector duration, which further verifies the performance of the proposed method.

14 SOLAR ENERGY↗

Prediction of DIII-D Pedestal Structure From Externally Controllable Parameters

The sharp increase of pressure at the edge of a high confinement mode (H-mode) plasma, the pedestal, strongly impacts overall plasma performance. Predicting the pedestal is a necessity to control and optimize tokamak operations. Here, an experimental data-driven machine learning (ML) approach is presented that predicts the pedestal heights and widths of electron density (n e ) and electron temperature (T e ) profiles as well as the separatrix ne from externally controllable parameters such as the plasma shape, heating method and power, and gas puff rate and integrated gas puff. The OMFIT framework was used with DIII-D data to efficiently, robustly, and automatically build a database of pedestal parameters to train machine learning models. Database creation was enabled by the search engine tool for DIII-D data, TokSearch, which parallelizes data fetching, enabling fast searches through basic signals of thousands of DIII-D shots and selection of relevant time intervals. Principal Component Analysis (PCA) separated the database into three clusters that represent classes of plasma shapes that are regularly used in DIII-D. The most important parameters for setting the pedestal structure were plasma current (I p ), toroidal magnetic field (B Φ ), neutral beam heating power (P NBI ) and shaping quantities. The Deep Jointly Informed Neural Networks (DJINN) algorithm was applied to identify suitable neural network (NN) architectures that appropriately capture the features of the pedestal database. Separate NNs were implemented for each pedestal parameter, and ensembling methods were used to improve the prediction accuracy and allowed estimation of the prediction uncertainty. The pedestal predictions of the test dataset lie within the measurement uncertainties of the pedestal parameters. The NN outperformed simple Linear Regression (LR) analysis, indicating non-linear dependencies in the pedestal structure. The presented achievements illustrate a promising path for future research, using feature extraction to infer experimental trends and thereby improve pedestal models as well as deploying NN for a fast pedestal prediction in DIII-D scenario development.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Bounds on Optimal Revisit Times in Persistent Monitoring Missions With a Distinct and Remote Service Station</strong

We report persistent monitoring missions require an up-to-date knowledge of the changing state of the underlying environment. Unmannned aerial vehicles (UAVs) can be gainfully employed to continually visit a set of targets representing tasks (and locations) in the environment and collect data therein for long time periods. The enduring nature of these missions requires the UAV to be regularly recharged at a service station. In this article, we consider the case in which the service station is not colocated with any of the targets. An efficient monitoring requires the revisit time, defined as the maximum of the time elapsed between successive revisits to targets, to be minimized. Here, we consider the problem of determining UAV routes that lead to the minimum revisit time. The problem is NP-hard, and its computational difficulty increases with the fuel capacity of the UAV. We develop an algorithm to construct near-optimal solutions to the problem quickly when the fuel capacity exceeds a threshold. We also develop lower bounds to the optimal revisit time and use these bounds to demonstrate (through numerical simulations) that the constructed solutions are, on an average, at most 0.01% away from the optimum.

42 ENGINEERING↗

MPC-Based Local Voltage Control Strategy of DGs in Active Distribution Networks

The increasing penetration of distributed generators (DGs) exacerbates the voltage violations in active distribution networks (ADNs). The commonly used centralized voltage control may aggravate the burden of computation and communication. Local voltage control can realize fast response to frequent voltage fluctuations. However, effective local control for DGs still needs to be further investigated. In this paper, a model predictive control (MPC)-based local voltage control strategy of DGs is proposed to cope with voltage violation problems and enhance the adaptation to the DG volatility. DGs are regulated with local Q-V control curves to respond to voltage fluctuations rapidly. Based on the dynamic network partition, a unified control curve for DGs is set in the same area to realize efficient operation. To further improve the performance of voltage control, the parameter tuning of control curves is regularly conducted based on decentralized inter-area coordination with the rolling of the control horizon. Finally, case study is verified on the modified IEEE 33-node distribution system. The proposed local control strategy of DGs can effectively improve the voltage profile and reduce power losses of the whole network without high computation and communication burden.

active distribution network (ADN)↗

FTK: A Simplicial Spacetime Meshing Framework for Robust and Scalable Feature Tracking

In this work, we present the Feature Tracking Kit (FTK), a framework that simplifies, scales, and delivers various feature-tracking algorithms for scientific data. The key of FTK is our simplicial spacetime meshing scheme that generalizes both regular and unstructured spatial meshes to spacetime while tessellating spacetime mesh elements into simplices. The benefits of using simplicial spacetime meshes include (1) reducing ambiguity cases for feature extraction and tracking, (2) simplifying the handling of degeneracies using symbolic perturbations, and (3) enabling scalable and parallel processing. The use of simplicial spacetime meshing simplifies and improves the implementation of several feature-tracking algorithms for critical points, quantum vortices, and isosurfaces. As a software framework, FTK provides end users with VTK/ParaView filters, Python bindings, a command line interface, and programming interfaces for feature-tracking applications. We demonstrate use cases as well as scalability studies through both synthetic data and scientific applications including tokamak, fluid dynamics, and superconductivity simulations. We also conduct end-to-end performance studies on the Summit supercomputer. FTK is open sourced under the MIT license: https://github.com/hguo/ftk.

97 MATHEMATICS AND COMPUTING↗

UVCGAN: UNet Vision Transformer cycle-consistent GAN for unpaired image-to-image translation

Unpaired image-to-image translation has broad applications in art, design, and scientific simulations. One early breakthrough was CycleGAN that emphasizes one-to-one mappings between two unpaired image domains via generative-adversarial networks (GAN) coupled with the cycle-consistency constraint, while more recent works promote one-to-many mapping to boost diversity of the translated images. Motivated by scientific simulation and one-to-one needs, this work revisits the classic CycleGAN framework and boosts its performance to outperform more contemporary models without relaxing the cycle-consistency constraint. To achieve this, we equip the generator with a Vision Transformer (ViT) and employ necessary training and regularization techniques. Compared to previous best-performing models, our model performs better and retains a strong correlation between the original and translated image. An accompanying ablation study shows that both the gradient penalty and self-supervised pre-training are crucial to the improvement. To promote reproducibility and open science, the source code, hyperparameter configurations, and pre-trained model are available at https: //github.com/LS4GAN/uvcgan.

97 MATHEMATICS AND COMPUTING↗

Woodland wildfire enables fungal colonization of encroaching Douglas‐fir

Abstract Self‐reinforcing differences in fire frequency help closed‐canopy forests, which resist fire, and open woodlands, which naturally burn often, to co‐occur stably at landscape scales. Forest tree seedlings, which could otherwise encroach and overgrow woodlands, are killed by regular fire, yet fire has other effects that may also influence these feedbacks. In particular, many forest trees require symbiotic ectomycorrhizal fungi in order to establish. By restructuring soil fungal communities, fire might affect the availability of symbionts or the potential for symbiont sharing between encroaching trees and woodland vegetation. To investigate this possibility, we performed a soil bioassay experiment using inoculum from burned and unburned oak woodlands and Douglas‐fir forests. We examined how fire, ecosystem type, and neighboring heterospecific seedlings affect fungal root community assembly of Douglas‐firs and oaks. We asked whether heterospecific seedlings facilitated fungal colonization of seedling roots in non‐native soil, and if so, whether fire influenced this interaction. External fungal colonization of oak roots was more influenced by fire and ecosystem type than by the presence of a Douglas‐fir, and oaks increased the likelihood that Douglas‐fir roots would be colonized by fungi in oak woodland soil. Yet, fire increased colonization of Douglas‐fir in oak soil, diminishing the otherwise crucial role played by oak facilitation. Fire also strengthened the positive effect of Douglas‐firs on oak root‐associated fungal diversity in Douglas‐fir forest soil. Prior work shows that fire supports woodland ecosystems by stemming recruitment of encroaching seedlings. Here, we find evidence that it may contrastingly reduce fungal limitation of invasive seedling growth and establishment, otherwise relieved only by facilitation. Future work can investigate how these opposing effects might contribute to the net impact of changes in fire regime on landcover stability. Read the free Plain Language Summary for this article on the Journal blog.

54 ENVIRONMENTAL SCIENCES↗

Deep learning multiphysics network for imaging CO 2 saturation and estimating uncertainty in geological carbon storage

Multiphysics inversion exploits different types of geophysical data that often complement each other and aims to improve overall imaging resolution and reduce uncertainties in geophysical interpretation. Despite the advantages, traditional multiphysics inversion is challenging because it requires a large amount of computational time and intensive human interactions for preprocessing data and finding trade-off parameters. These issues make it nearly impossible for traditional multiphysics inversion to be applied as a real-time monitoring tool for geological carbon storage. In this paper, we present a deep learning (DL) multiphysics network for imaging CO 2 saturation in real time. The multiphysics network consists of three encoders for analysing seismic, electromagnetic and gravity data and shares one decoder for combining imaging capabilities of the different geophysical data for better predicting CO 2 saturation. The network is trained on pairs of CO 2 label models and multiphysics data so that it can directly image CO 2 saturation. Here we use the bootstrap aggregating method to enhance the imaging accuracy and estimate uncertainties associated with CO 2 saturation images. Using realistic CO 2 label models and multiphysics data derived from the Kimberlina CO 2 storage model, we evaluate the performance of the deep learning multiphysics network and compare its imaging results to those from the deep learning single-physics networks. Our modelling experiments show that the deep learning multiphysics network for seismic, electromagnetic, and gravity data not only improves the imaging accuracy but also reduces uncertainties associated with CO 2 saturation images. Our results also suggest that the deep learning multiphysics network for the non-seismic data (i.e., electromagnetic and gravity) can be used as an effective low-cost monitoring tool in between regular seismic monitoring.

58 GEOSCIENCES↗

Solving the sample size problem for resource selection functions

Abstract Sample size sufficiency is a critical consideration for estimating resource selection functions (RSFs) from GPS‐based animal telemetry. Cited thresholds for sufficiency include a number of captured animals and as many relocations per animal N as possible. These thresholds render many RSF‐based studies misleading if large sample sizes were truly insufficient, or unpublishable if small sample sizes were sufficient but failed to meet reviewer expectations. We provide the first comprehensive solution for RSF sample size by deriving closed‐form mathematical expressions for the number of animals M and the number of relocations per animal N required for model outputs to a given degree of precision. The sample sizes needed depend on just 3 biologically meaningful quantities: habitat selection strength, variation in individual selection and a novel measure of landscape complexity, which we define rigorously. The mathematical expressions are calculable for any environmental dataset at any spatial scale and are applicable to any study involving resource selection (including sessile organisms). We validate our analytical solutions using globally relevant empirical data including 5,678,623 GPS locations from 511 animals from 10 species (omnivores, carnivores and herbivores living in boreal, temperate and tropical forests, montane woodlands, swamps and Arctic tundra). Our analytic expressions show that the required M and N must decline with increasing selection strength and increasing landscape complexity, and this decline is insensitive to the definition of availability used in the analysis. Our results demonstrate that the most biologically relevant effects on the utilization distribution (i.e. those landscape conditions with the greatest absolute magnitude of resource selection) can often be estimated with much fewer than animals. We identify several critical steps in implementing these equations, including (a) a priori selection of expected model coefficients and (b) regular sampling of background (pseudoabsence) data within a given definition of availability. We discuss possible methods to identify a priori expectations for habitat selection coefficients, effects of scale on RSF estimation and caveats for rare species applications. We argue that these equations should be a mandatory component for all future RSF studies.

Street, Garrett M.↗

Pursuing sources of heterogeneity in modeling clustered population

Abstract Researchers often have to deal with heterogeneous population with mixed regression relationships, increasingly so in the era of data explosion. In such problems, when there are many candidate predictors, it is not only of interest to identify the predictors that are associated with the outcome, but also to distinguish the true sources of heterogeneity , that is, to identify the predictors that have different effects among the clusters and thus are the true contributors to the formation of the clusters. We clarify the concepts of the source of heterogeneity that account for potential scale differences of the clusters and propose a regularized finite mixture effects regression to achieve heterogeneity pursuit and feature selection simultaneously. We develop an efficient algorithm and show that our approach can achieve both estimation and selection consistency. Simulation studies further demonstrate the effectiveness of our method under various practical scenarios. Three applications are presented, namely, an imaging genetics study for linking genetic factors and brain neuroimaging traits in Alzheimer's disease, a public health study for exploring the association between suicide risk among adolescents and their school district characteristics, and a sport analytics study for understanding how the salary levels of baseball players are associated with their performance and contractual status.

Li, Yan↗

Wassersplines for Neural Vector Field-Controlled Animation

Much of computer-generated animation is created by manipulating meshes with rigs. While this approach works well for animating articulated objects like animals, it has limited flexibility for animating less structured free-form objects. Here we introduce Wassersplines, a novel trajectory inference method for animating unstructured densities based on recent advances in continuous normalizing flows and optimal transport. The key idea is to train a neurally-parameterized velocity field that represents the motion between keyframes. Trajectories are then computed by advecting keyframes through the velocity field. We solve an additional Wasserstein barycenter interpolation problem to guarantee strict adherence to keyframes. Our tool can stylize trajectories through a variety of PDE-based regularizers to create different visual effects. We demonstrate our tool on various keyframe interpolation problems to produce temporally-coherent animations without meshing or rigging.

97 MATHEMATICS AND COMPUTING↗

State of the Art of Molecular Visualization in Immersive Virtual Environments

Abstract Visualization plays a crucial role in molecular and structural biology. It has been successfully applied to a variety of tasks, including structural analysis and interactive drug design. While some of the challenges in this area can be overcome with more advanced visualization and interaction techniques, others are challenging primarily due to the limitations of the hardware devices used to interact with the visualized content. Consequently, visualization researchers are increasingly trying to take advantage of new technologies to facilitate the work of domain scientists. Some typical problems associated with classic 2D interfaces, such as regular desktop computers, are a lack of natural spatial understanding and interaction, and a limited field of view. These problems could be solved by immersive virtual environments and corresponding hardware, such as virtual reality head‐mounted displays. Thus, researchers are investigating the potential of immersive virtual environments in the field of molecular visualization. There is already a body of work ranging from educational approaches to protein visualization to applications for collaborative drug design. This review focuses on molecular visualization in immersive virtual environments as a whole, aiming to cover this area comprehensively. We divide the existing papers into different groups based on their application areas, and types of tasks performed. Furthermore, we also include a list of available software tools. We conclude the report with a discussion of potential future research on molecular visualization in immersive environments.

97 MATHEMATICS AND COMPUTING↗

Novel genetic tools improve Penicillium expansum patulin synthase production in Aspergillus niger

Since the first CRISPR (clustered regularly interspaced short palindromic repeats)‐Cas (CRISPR‐associated) system was developed for creating double‐stranded DNA breaks, it has been adapted and improved for different biotechnological applications. In this issue of The FEBS Journal , Arentshorst et al . developed a novel approach to enhance transgene expression of a specific protein, patulin synthase (PatE) from Penicillium expansum , in the important industrial filamentous fungus Aspergillus niger . Their technique involved the disruption of selected genes with counter‐effects on targeted protein production and simultaneous integration of glucoamylase landing sites into the disrupted gene locus such as protease regulator ( prtT ) in an ATP‐dependent DNA helicase II subunit 1 ( kusA or ku70 ) ‐ deletion strain. Multiple copies of the PatE transgene expression cassette were introduced by CRISPR‐Cas9‐mediated insertion. The purified PatE was further used for structural and functional studies, and the technique laid the foundation for elevating the overall production of various proteins or chemicals in those industrially important fungi.

59 BASIC BIOLOGICAL SCIENCES↗