Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Edge 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 505 records · Page 28

Aeroelastic Simulation of Wind Tunnel Scale Aspect Ratio 13.5 Common Research Model with Trailing Edge Mini-Flaps

This paper presents a computation study of an aspect ratio 13.5 wind tunnel scale Common Research Model (CRM) with trailing edge mini-flaps using FUN3D. The aeroelastic simulations are conducted under free-air and inside wind tunnel conditions. The NASA Langley Research Center Transonic Dynamic Tunnel (TDT) is a closed circuit and slotted-test-section with a 16 ft ×16 ft test section. The structure mode shapes are extracted from the latest updated NASTRAN Finite-Element Model (FEM) model. A dynamic pressure sweep is performed to determine the control reversal boundary of the trailing edge mini-flaps. The wind tunnel wall interference effects on the mini-flap control derivatives are analyzed based on the simulations.

Aeroelastic↗

Low Size, Weight, and Power Neuromorphic Computing to Improve Combustion Engine Efficiency

Neuromorphic computing offers one path forward for AI at the edge. However, accessing and effectively utilizing a neuromorphic hardware platform is non-trivial. In this work, we present a complete pipeline for neuromorphic computing at the edge, including a small, inexpensive, low-power, FPGA-based neuromorphic hardware platform, a training algorithm for designing spiking neural networks for neuromorphic hardware, and a software framework for connecting those components. We demonstrate this pipeline on a real-world application, engine control for a spark-ignition internal combustion engine. We illustrate how we connect engine simulations with neuromorphic hardware simulations and training software to produce hardware-compatible spiking neural networks that perform engine control to improve fuel efficiency. We present initial results on the performance of these spiking neural networks and illustrate that they outperform open-loop engine control. We also give size, weight, and power estimates for a deployed solution of this type.

Schuman, Catherine↗

A Study of Grid Resolution, Transition and Turbulence Model Using the Transonic Simple Straked Delta Wing

Three-dimensional transonic flow over a delta wing is investigated using several turbulence models. The performance of linear eddy viscosity models and an explicit algebraic stress model is assessed at the start of vortex flow, and the results compared with experimental data. To assess the effect of transition location, computations that either fix transition aft of the leading edge or are fully turbulent are performed. These computations show that grid resolution, transition location and turbulence model significantly affect the 3D flowfield.

Bartels, Robert E.↗

Parallel processing of filtered queries in attributed semantic graphs

Execution of complex analytic queries on massive semantic graphs is a challenging problem in big-data analytics that requires high-performance parallel computing. In a semantic graph, vertices and edges carry attributes of various types and the analytic queries typically depend on the values of these attributes. Thus, the computation must view the graph through a filter that passes only those individual vertices and edges of interest. Previous investigations have developed Knowledge Discovery Toolbox (KDT), a sophisticated Python library for parallel graph computations. In KDT, the user can write custom graph algorithms by specifying operations between edges and vertices ( semiring operations ). The user can also customize existing graph algorithms by writing filters. While the high-level language for this customization enables domain scientists to productively express their graph analytics requirements, the customized queries perform poorly due to the overhead of having to call into the Python virtual machine for each vertex and edge. In this work, we use the Selective Embedded Just-In-Time Specialization (SEJITS) approach to automatically translate semiring operations and filters defined by programmers into a lower-level efficiency language, bypassing the upcall into Python. We evaluate our approach by comparing it with the high-performance Combinatorial BLAS engine and show that our approach combines the benefits of programming in a high-level language with executing in a low-level parallel environment. We increase the system's flexibility by developing techniques that provide users with the ability to define new vertex and edge types from Python. We also present a new Roofline model for graph traversals and show that we achieve performance that is significantly closer to the bounds suggested by the Roofline. Finally, to further understand the complex interaction with the underlying architecture, we present an analysis using performance counters that quantifies the improvement in hardware behavior in the context our SEJITS methodology. Comprehensively, we demonstrate the first known solution to the problem of obtaining high performance from a productivity language when applying graph algorithms selectively on semantic graphs with hundreds of millions of edges and scaling to thousands of processors for graphs.

97 MATHEMATICS AND COMPUTING↗

Evolution at the Edge: Real-Time Evolution for Neuromorphic Engine Control

Neuromorphic computing systems are attractive for real-time control at the edge because of their low power operation, real-time processing capabilities and their potential ability to do online learning. In this work, we describe an approach for performing real-time evolution of spiking neural networks for neuromorphic systems at the edge called Neuromorphic Optimization using Dynamic Evolutionary Systems or NODES. We apply this approach to real-time combustion engine control and develop an engine-specific hardware platform for NODES called FireBox. We demonstrate how the real-time evolution approach works in simulation and the performance of networks trained in simulation on the physical engine.

Maldonado Puente, Bryan [ORNL] (ORCID:000000033880↗

Calculation of the 3-D viscous flow at the endwall leading edge region of an axial annular turbine cascade

A three-dimensional viscous computer code (VANS/MD) was employed to calculate the turbulent flow field at the end wall leading edge region of a 20 inch axial annular turbine cascade. The initial boundary layer roll-up and formation of the end wall vortices were computed at the vane leading edge. The calculated flow field was found to be periodic with a frequency of approximately 1600 Hz. The calculated size of the separation region for the hub endwall vortex compared favorably with measured endwall oil traces. In an effort to determine the effects of the turbulence model on the calculated unsteadiness, a laminar calculation was made. The periodic nature of the calculated flow field persisted with the frequency essentially unchanged.

Walitt, L.↗

Simulation of iced wing aerodynamics

The sectional and total aerodynamic load characteristics of moderate aspect ratio wings with and without simulated glaze leading edge ice were studied both computationally, using a three dimensional, compressible Navier-Stokes solver, and experimentally. The wing has an untwisted, untapered planform shape with NACA 0012 airfoil section. The wing has an unswept and swept configuration with aspect ratios of 4.06 and 5.0. Comparisons of computed surface pressures and sectional loads with experimental data for identical configurations are given. The abrupt decrease in stall angle of attack for the wing, as a result of the leading edge ice formation, was demonstrated numerically and experimentally.

Potapczuk, M. G.↗

Simulation of iced wing aerodynamics

The sectional and total aerodynamic load characteristics of moderate aspect ratio wings with and without simulated glaze leading edge ice were studied both computationally, using a three dimensional, compressible Navier-Stokes solver, and experimentally. The wing has an untwisted, untapered planform shape with NACA 0012 airfoil section. The wing has an unswept and swept configuration with aspect ratios of 4.06 and 5.0. Comparisons of computed surface pressures and sectional loads with experimental data for identical configurations are given. The abrupt decrease in stall angle of attack for the wing, as a result of the leading edge ice formation, was demonstrated numerically and experimentally.

Potapczuk, M. G.↗

5G Energy FRAME: The Design and Implementation of Data, Model, and Use Case (Year 2 Report)

This report summarizes the Year 2 work of Pacific Northwest National Laboratory’s (PNNL’s) 5G Fabricated Resource and Asset Management Encompassment for energy infrastructure (Energy FRAME) project funded by the Department of Energy Office of Science’s Advanced Scientific Computing Research (ASCR) Program. In this report, newest 5G equipment testing results are presented, along with two 5G-enabled AI/ML examples for grid applications; in addition, the work flow of grid edge, cloud, and High Performance Computing (HPC) platform is introduced, to support and interface the cross-domain simulation for power system transmission, distribution, and communication networks. Last but not least, the outlook for Year 3 work and the overarching impact of 5G Energy FRAME work to a multitude of stakeholders are provided. Additional 5G performance data now is shared through the publicly available weblink, https://www.pnnl.gov/projects/5g-energy-frame/publications

24 POWER TRANSMISSION AND DISTRIBUTION↗

Using the D-Wave 2X Quantum Computer to Explore the Formation of Global Terrorist Networks

Social networks with signed edges (+/-) play an important role in an area of social network theory called structural balance. In these networks, edges represent relationships that are labeled as either friendly (+) or hostile (-). A signed social network is balanced only if all cycles of three or more nodes in the graph have an odd number of hostile edges. A fundamental property of a balanced network is that it can be cleanly divided into 2 factions, where all relationships within each faction are friendly, and all relationships between members of different factions are hostile. The more unbalanced a network is, the more edges will fail to adhere to this rule, making factions more ambiguous. Social theory suggests unbalanced networks should be unstable, a finding that has been supported by research on gangs, which shows that unbalanced relationships are associated with greater violence, possibly due to this increased ambiguity about factional allegiances (Nakamura et al). One way to estimate the imbalance in a network, if only edge relationships are known, is to assign nodes to factions that minimize the number of violations of the edge rule described above. This problem is known to be computationally NP-hard. However, Facchetti et al. have pointed out that it is equivalent to an Ising model with a Hamiltonian that effectively counts the number of edge rule violations. Therefore, finding the assignment of factions that minimizes energy of the equivalent Ising system yields an estimate of the imbalance in the network. Based on the Ising model equivalence of the signed-social network balance problem, we have used the D-Wave 2X quantum annealing computer to explore some aspects of signed social networks. Because connectivity in the D-Wave computer is limited to its particular native topology, arbitrary networks cannot be represented directly. Rather, they must be “embedded” using a technique in which multiple qubits are chained together with special weights to simulate a collection of nodes with the required connectivity. This limits the size of a fully connected network in the D-Wave to about 50 simulated nodes, using all of the approximately 1150 qubits in the machine. In order to keep within this limitation, while exploring a problem of potential social relevance, we constructed time series of historical network snapshots from Stanford’s Mapping Militants Project, where nodes represent militant organizations, and edges represent either alliances or rivalries between organizations. We constructed two series from different theaters – Iraq and Syria – spanning timelines from about 2000 to 2016, each with networks whose maximum size was in the 20-30 node range. Computationally, our experience suggests D-Wave technology is promising, providing fast, nearly constant scaling of computational effort in the main part of the calculation that relies on the quantum annealing cycle. However, the cost of embedding an arbitrary network of interest in the D-Wave native topology scales poorly. If the embedding cost can be amortized relative to the annealing cycle, it may be possible to gain a substantial advantage over classical computing methods, provided a large enough network can be accommodated by partitioning into subnetworks or some similar strategy. In terms of our application to networks of militant organizations, we found a rise in network imbalance in the Syrian theater that appears to correspond roughly with the entrance of the Islamic State into a milieu already populated with other groups, a phenomenon we plan to explore in more detail. In these very preliminary results, we also noticed that during at least one period where both the size and imbalance of the network increased substantially, the imbalance per edge seemed to remain fairly steady. This may suggest some adaptive behavior among the participating factions, which may also warrant further exploration.

97 MATHEMATICS AND COMPUTING↗

Synchronous Photodiode-Signal Sampler

Synchronous sampling circuit increases signal-to-noise ratio of measurements of chopped signal of known phase and frequency in presence of low-frequency or dc background noise. Used with linear array of photoelectric sensors for locating edge of metal plate. Multiplexing circuit cycles through 16 light-emitting-diode/photodiode pairs, under computer control. Synchronized with multiplexer so edge detector makes one background-subtracted signal measurement per emitter/detector pair in turn.

Primus, Howard K.↗

Detection of edges using local geometry

Researchers described a new representation, the local geometry, for early visual processing which is motivated by results from biological vision. This representation is richer than is often used in image processing. It extracts more of the local structure available at each pixel in the image by using receptive fields that can be continuously rotated and that go to third order spatial variation. Early visual processing algorithms such as edge detectors and ridge detectors can be written in terms of various local geometries and are computationally tractable. For example, Canny's edge detector has been implemented in terms of a local geometry of order two, and a ridge detector in terms of a local geometry of order three. The edge detector in local geometry was applied to synthetic and real images and it was shown using simple interpolation schemes that sufficient information is available to locate edges with sub-pixel accuracy (to a resolution increase of at least a factor of five). This is reasonable even for noisy images because the local geometry fits a smooth surface - the Taylor series - to the discrete image data. Only local processing was used in the implementation so it can readily be implemented on parallel mesh machines such as the MPP. Researchers expect that other early visual algorithms, such as region growing, inflection point detection, and segmentation can also be implemented in terms of the local geometry and will provide sufficiently rich and robust representations for subsequent visual processing.

Gualtieri, J. A.↗

Numerical simulation of the leading-edge separation vortex for a wing and strake-wing configuration

In the present investigation, the 'thin layer' Navier-Stokes equations are used to compute the flow about a delta wing and a strake-delta wing configuration. Both configurations possess blunt noses and rounded leading edges. The computational grid about these configurations is generated using a newly developed three-dimensional grid-generation code which solves a set of Poisson equations with spherical coordinate variables using an alternating direction implicit (ADI) scheme. Computational results are obtained for an isolated wing with 60 deg sweep and a strake-wing configuration with 80-60 deg sweep. Computations for angles of attack in the range from 6 to 30 deg are presented. Attention is given to the effect of the angle of attack, the Mach number, and the Reynolds number. Theoretical results are compared with experimental data.

Fujii, K.↗

Navier Stokes computation of the flow field over delta wings with spanwise leading edge blowing

The concept of spanwise leading edge blowing, a means of controlling the position and strength of leading edge vortices, is analyzed by numerical solutions of the three-dimensional Thin-Layer Navier Stokes equations. The leading edge jet is simulated by defining a permeable boundary, corresponding to the jet slot, where suitable boundary conditions are implemented. Numerical results agree favorably with experimental measurements. It is found that the use of spanwise leading edge blowing not only magnifies the size and strength of the leading edge vortices, but also moves the vortex cores outboard and upward. As a result, the increase in lift comes primarily from the greater nonlinear vortex lift. The presence of the leading edge jet stream displaces the flow outboard, thereby increasing the effective aspect ratio of the delta wing. However, blowing causes earlier vortex breakdown, thus decreasing the stall angle.

Yeh, David T.↗

Progress report for FACETS (Framework Application for Core-Edge Transport Simulations): C.S. SAP

The mission of the Computer Science Scientific Application Partnership (C.S. SAP) at LLNL is to develop and apply leading-edge scientific component technology to FACETS software. Contributions from LLNL's fusion energy program staff towards the underlying physics modules are described in a separate report. FACETS uses component technology to combine selectively multiple physics and solver software modules written in different languages by different institutions together in an tightly-integrated, parallel computing framework for Tokamak reactor modeling. In the past fiscal year, the C.S. SAP has focused on two primary tasks: applying Babel to connect UEDGE into the FACETS framework through UEDGE's existing Python interface and developing a next generation componentization strategy for UEDGE which avoids the use of Python. The FACETS project uses Babel to solve its language interoperability challenges. Specific accomplishments for the year include: (1) Refined SIDL interfaces for UEDGE to meet satisfy the standard interfaces required by FACETS for all physics modules. This required consensus building between framework and UEDGE developers. (2) Wrote prototype C++ driver for UEDGE to demonstrate how UEDGE can be called from C++ using Babel. (3) Supported the FACETS project by adding new features to Babel such as release number tagging, porting to new machines, and adding new configuration options. Babel modifications were delivered to FACETS by testing and publishing development snapshots in the projects software repository. (4) Assisted Tech-X Corporation in testing and debugging of a high level build system for the complete FACETS tool chain--the complete list of third-party software libraries that FACETS depends on directly or indirectly (e.g., MPI, HDF5, PACT, etc.). (5) Designed and implemented a new approach to wrapping UEDGE as a FACETS component without requiring Python. To get simulation results as soon as possible, our initial connection from the FACETS framework to UEDGE uses a Forthon-generated Python layer that sits on top of the UEDGE Fortran code. To run on leadership class machines that do not support shared libraries such as Franklin (NERSCS) and Jaguar (ORNL), FACETS requires a more direct connection to the UEDGE Fortran that eliminates the Python layer. We designed and developed an extension for Forthon to provide a direct connection from C++ to the UEDGE Fortran using Babel. This also required added annotations to the Forthon '.v' input files to indicate how function parameters are used.

99 GENERAL AND MISCELLANEOUS↗

An exact and efficient first passage time algorithm for reaction–diffusion processes on a 2D-lattice

We present an exact and efficient algorithm for reaction–diffusion–nucleation processes on a 2D-lattice. The algorithm makes use of first passage time (FPT) to replace the computationally intensive simulation of diffusion hops in KMC by larger jumps when particles are far away from step-edges or other particles. Our approach computes exact probability distributions of jump times and target locations in a closed-form formula, based on the eigenvectors and eigenvalues of the corresponding 1D transition matrix, maintaining atomic-scale resolution of resulting shapes of deposit islands. We have applied our method to three different test cases of electrodeposition: pure diffusional aggregation for large ranges of diffusivity rates and for simulation domain sizes of up to 4096×4096 sites, the effect of diffusivity on island shapes and sizes in combination with a KMC edge diffusion, and the calculation of an exclusion zone in front of a step-edge, confirming statistical equivalence to standard KMC simulations. The algorithm achieves significant speedup compared to standard KMC for cases where particles diffuse over long distances before nucleating with other particles or being captured by larger islands.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SciDAC Center for Plasma Edge Simulation

This project with a total funding of $592,998 for six years has partially supported four postdoctoral researchers at the University of California, Irvine (UCI). The UCI team has formulated electrostatic and electromagnetic global gyrokinetic particle simulation models with kinetic electrons, implemented these models in the edge code XGC1, performed benchmark between GTC and XGC1, developed computational tools for gyrokinetic particle simulation in tokamak edge geometry, and initiated preparatory study of edge turbulence using GTC code. The research results has been published in 12 papers and presented at many international and national conferences.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗