Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Edge Based”

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 73 records · Page 4

New multigrid approach for three-dimensional unstructured, adaptive grids

A new multigrid method with adaptive unstructured grids is presented. The three-dimensional Euler equations are solved on tetrahedral grids that are adaptively refined or coarsened locally. The multigrid method is employed to propagate the fine grid corrections more rapidly by redistributing the changes-in-time of the solution from the fine grid to the coarser grids to accelerate convergence. A new approach is employed that uses the parent cells of the fine grid cells in an adapted mesh to generate successively coaser levels of multigrid. This obviates the need for the generation of a sequence of independent, nonoverlapping grids as well as the relatively complicated operations that need to be performed to interpolate the solution and the residuals between the independent grids. The solver is an explicit, vertex-based, finite volume scheme that employs edge-based data structures and operations. Spatial discretization is of central-differencing type combined with a special upwind-like smoothing operators. Application cases include adaptive solutions obtained with multigrid acceleration for supersonic and subsonic flow over a bump in a channel, as well as transonic flow around the ONERA M6 wing. Two levels of multigrid resulted in reduction in the number of iterations by a factor of 5.

Parthasarathy, Vijayan↗

Three dimensional unstructured multigrid for the Euler equations

The three dimensional Euler equations are solved on unstructured tetrahedral meshes using a multigrid strategy. The driving algorithm consists of an explicit vertex-based finite element scheme, which employs an edge-based data structure to assemble the residuals. The multigrid approach employs a sequence of independently generated coarse and fine meshes to accelerate the convergence to steady-state of the fine grid solution. Variables, residuals and corrections are passed back and forth between the various grids of the sequence using linear interpolation. The addresses and weights for interpolation are determined in a preprocessing stage using linear interpolation. The addresses and weights for interpolation are determined in a preprocessing stage using an efficient graph traversal algorithm. The preprocessing operation is shown to require a negligible fraction of the CPU time required by the overall solution procedure, while gains in overall solution efficiencies greater than an order of magnitude are demonstrated on meshes containing up to 350,000 vertices. Solutions using globally regenerated fine meshes as well as adaptively refined meshes are given.

Mavriplis, D. J.↗

Superpixel edges for boundary detection

Various embodiments presented herein relate to identifying one or more edges in a synthetic aperture radar (SAR) image comprising a plurality of superpixels. Superpixels sharing an edge (or boundary) can be identified and one or more properties of the shared superpixels can be compared to determine whether the superpixels form the same or two different features. Where the superpixels form the same feature the edge is identified as an internal edge. Where the superpixels form two different features, the edge is identified as an external edge. Based upon classification of the superpixels, the external edge can be further determined to form part of a roof, wall, etc. The superpixels can be formed from a speckle-reduced SAR image product formed from a registered stack of SAR images, which is further segmented into a plurality of superpixels. The edge identification process is applied to the SAR image comprising the superpixels and edges.

47 OTHER INSTRUMENTATION↗

Three dimensional unstructured multigrid for the Euler equations

The three-dimensional Euler equations are solved on unstructured tetrahedral meshes using a multigrid strategy. The driving algorithm consists of an explicit vertex-based finite-element scheme, which employs an edge-based data-structure to assemble the residuals. The multigrid approach employs a sequence of independently generated coarse and fine meshes to accelerate the convergence to steady-state of the fine grid solution. Variables, residuals and corrections are passed back and forth between the various grids of the sequence using linear interpolation. The addresses and weights for interpolation are determined in a preprocessing stage using an efficient graph traversal algorithm. The preprocessing operation is shown to require a negligible fraction of the CPU time required by the overall solution procedure, while gains in overall solution efficiencies greater than an order of magnitude are demonstrated on meshes containing up to 350,000 vertices. Solutions using globally regenerated fine meshes as well as adaptively refined meshes are given.

Mavriplis, D. J.↗

Development of 3D electromagnetic modeling tools for airborne vehicles

The main goal of this project is to develop methodologies for scattering by airborne composite vehicles. Although our primary focus continues to be the development of a general purpose code for analyzing the entire structure as a single unit, a number of other tasks are also pursued in parallel with this effort. These tasks are important in testing the overall approach and in developing suitable models for materials coatings, junctions and, more generally, in assessing the effectiveness of the various parts comprising the final code. Here, we briefly discuss our progress on the five different tasks which were pursued during this period. Our progress on each of these tasks is described in the detailed reports (listed at the end of this report) and the memoranda included. The first task described below is, of course, the core of this project and deals with the development of the overall code. Undoubtedly, it is the outcome of the research which was funded by NASA-Ames and the Navy over the past three years. During this year we developed the first finite element code for scattering by structures of arbitrary shape and composition. The code employs a new absorbing boundary condition which allows termination of the finite element mesh only 0.3 lambda from the outer surface of the target. This leads to a remarkable reduction of the mesh size and is a unique feature of the code. Other unique features of this code include capabilities to model resistive sheets, impedance sheets and anisotropic materials. This last capability is the latest feature of the code and is still under development. The code has been extensively validated for a number of composite geometries and some examples are given. The validation of the code is still in progress for anisotropic and larger non-metallic geometries and cavities. The developed finite element code is based on a Galerkin's formulation and employs edge-based tetrahedral elements for discretizing the dielectric sections and the region between the target and the outer mesh termination boundary (ATB). This boundary is placed in conformity with the target's outer surface, thus resulting in additional reduction of the unknown count.

Volakis, John L.↗

Tetrahedral and Hexahedral Mesh Adaptation for CFD Problems

This paper presents two unstructured mesh adaptation schemes for problems in computational fluid dynamics. The procedures allow localized grid refinement and coarsening to efficiently capture aerodynamic flow features of interest. The first procedure is for purely tetrahedral grids; unfortunately, repeated anisotropic adaptation may significantly deteriorate the quality of the mesh. Hexahedral elements, on the other hand, can be subdivided anisotropically without mesh quality problems. Furthermore, hexahedral meshes yield more accurate solutions than their tetrahedral counterparts for the same number of edges. Both the tetrahedral and hexahedral mesh adaptation procedures use edge-based data structures that facilitate efficient subdivision by allowing individual edges to be marked for refinement or coarsening. However, for hexahedral adaptation, pyramids, prisms, and tetrahedra are used as buffer elements between refined and unrefined regions to eliminate hanging vertices. Computational results indicate that the hexahedral adaptation procedure is a viable alternative to adaptive tetrahedral schemes.

Biswas, Rupak↗

A new approach to enforcing discrete maximum principles in continuous Galerkin methods for convection-dominated transport equations

This work introduces a set of design principles and new algorithmic tools for enforcing maximum principles and/or positivity preservation in continuous finite element approximations to convection-dominated transport problems. Enabling a linear first-order advection equation as a model problem, we address the design of first-order artificial diffusion operators and their higherorder counterparts at the element matrix level. The proposed methodology leads to a nonlinear high-resolution scheme capable of resolving moving fronts and internal/boundary layers as sharp localized nonoscillatory features. The amount of numerical dissipation depends on the difference between the solution value at a given node and a local maximum or minimum. The shockcapturing numerical diffusion coefficient is designed to vanish as the nodal values approach a mass-weighted or linearity-preserving average. The universal applicability and simplicity of the element-based limiting procedure makes it an attractive alternative to edge-based algebraic flux correction.

Kuzmin, D.↗

An efficient formulation of the coupled finite element-integral equation technique for solving large 3D scattering problems

It is often desirable to calculate the electromagnetic fields inside and about a complicated system of scattering bodies, as well as in their far-field region. The finite element method (FE) is well suited to solving the interior problem, but the domain has to be limited to a manageable size. At the truncation of the FE mesh one can either impose approximate (absorbing) boundary conditions or set up an integral equation (IE) for the fields scattered from the bodies. The latter approach is preferable since it results in higher accuracy. Hence, the two techniques can be successfully combined by introducing a surface that encloses the scatterers, applying a FE model to the inner volume and setting up an IE for the tangential fields components on the surface. Here the continuity of the tangential fields is used bo obtain a consistent solution. A few coupled FE-IE methods have recently appeared in the literature. The approach presented here has the advantage of using edge-based finite elements, a type of finite elements with degrees of freedom associated with edges of the mesh. Because of their properties, they are better suited than the conventional node based elements to represent electromagnetic fields, particularly when inhomogeneous regions are modeled, since the node based elements impose an unnatural continuity of all field components across boundaries of mesh elements. Additionally, our approach is well suited to handle large size problems and lends itself to code parallelization. We will discuss the salient features that make our approach very efficient from the standpoint of numerical computation, and the fields and RCS of a few objects are illustrated as examples.

Cwik, T.↗

In-Flight Edge Response Measurements for High Spatial Resolution Remote Sensing Systems

In-flight measurement of spatial resolution were conducted as part of the ASA Scientific Data Purchase (SDP) Validation and Verification (V&V) process. Characterization included remote sensing systems with ground sample distance (GSD) of 1 meter or less, such as the panchromatic imager on-board the ICONOS satellite and the airborne ADAR System 5500 multispectral instrument. Final image products were used to evaluate the effect of both the image acquisition system (e.g., optics, electronics, motion, jitter, atmosphere) and image post-processing (e.g., resampling, modulation trasfer function (MTF) compensator). Spatial resolution was characterized by full width at half maximum (FWHM) of an edge response-derived line spread function. This was found to be a more robust measure of spatial resolution than the value of NTF at Nyquist frequency The edge responses were analysed using the tilted-edge technique that ovecomes the spatial sampling limitations of the digital imaging systems. As an enhancement to existing algorithms, the slope of the edge response and the orientation of the edge target were determined by a single computational process. Adjacent black and white square panels, either painted on a flat surface or deployed as traps, formed the ground-based edge targets used in the tests. Orientation of the deployable tarps was optimized beforehand, based on simulations of the imaging system. Numerous edge target images were analyzed for each of the tested sensors. The effect of such factors as acquisition geometry, temporal variability, MTF compensation, and GSD on spatial resolution were investigated.

Blonski, Slawomir↗

Evaluating Dynamic Stall-Onset Criteria for Mixed and Trailing-Edge Stall

We evaluate two leading-edge-based dynamic stall-onset criteria (namely, the maximum magnitudes of the leading-edge suction parameter and the boundary enstrophy flux) for mixed and trailing-edge stall. These criteria have been shown to successfully predict the onset of leading-edge stall at Reynolds numbers of [Formula: see text], where the leading-edge suction drops abruptly. However, for mixed/trailing-edge stall, leading-edge suction tends to persist even when there is significant trailing-edge reversed flow and stall is underway, necessitating further investigation into the effectiveness of these criteria. Using wall-resolved large-eddy simulations and the unsteady Reynolds-averaged Navier–Stokes method, we simulate one leading-edge stall and three mixed/trailing-edge stall cases at Reynolds numbers of [Formula: see text] and [Formula: see text]. We contrast the progression of flow features such as trailing-edge separation and vortex formation across different stall types and evaluate the stall-onset criteria relative to critical points in the flow. We find that the criteria nearly coincide with the instance of leading-edge suction collapse and are reached in advance of dynamic stall vortex formation and lift stall for all four cases. We conclude that the two criteria effectively signal dynamic stall onset in cases where the dynamic stall vortex plays a prominent role.

Engineering↗

Learned adaptive properties for mitigation of weight perturbations in embedded spiking networks

Recent years have seen an increased importance of neural network inference in edge-based scenarios, which impose size and power constraints requiring novel computing devices. These same edge scenarios may require operating over long periods of time, or exposure to extreme environments, resulting in a drift of neural network weights that cause degraded performance. In searching for ways to develop neural network approaches that perform robustly under these conditions, we propose a biologically-inspired mechanism for the dynamic adaptation of within-neuron parameters that is guided by a global context signal carrying information about perturbations and variability in incoming stimuli. Specifically, we demonstrate that adaptive voltage thresholds or neuronal time constants, when informed by a global context signal, can enable network-level mechanisms to recover from perturbed synaptic weights. Consistent with prior literature, the context-modulated approach is effective for recurrent, but not feedforward networks, by modulating network level dynamics. We demonstrate this approach successfully recovers performance in image classification tasks and spatiotemporal tracking tasks under idealized and Gaussian noise as well as for realistic perturbations from a memristive device when exposed to ionizing radiation. Finally, we discuss how this approach enables the design of robust and energy-efficient neuromorphic systems that perform well, even in resource-constrained scenarios with extreme environments such as edge processing.

context modulation↗

Development of an unstructured solution adaptive method for the quasi-three-dimensional Euler and Navier-Stokes equations

A general solution adaptive scheme based on a remeshing technique is developed for solving the two-dimensional and quasi-three-dimensional Euler and Favre-averaged Navier-Stokes equations. The numerical scheme is formulated on an unstructured triangular mesh utilizing an edge-based pointer system which defines the edge connectivity of the mesh structure. Jameson's four-stage hybrid Runge-Kutta scheme is used to march the solution in time. The convergence rate is enhanced through the use of local time stepping and implicit residual averaging. As the solution evolves, the mesh is regenerated adaptively using flow field information. Mesh adaptation parameters are evaluated such that an estimated local numerical error is equally distributed over the whole domain. For inviscid flows, the present approach generates a complete unstructured triangular mesh using the advancing front method. For turbulent flows, the approach combines a local highly stretched structured triangular mesh in the boundary layer region with an unstructured mesh in the remaining regions to efficiently resolve the important flow features. One-equation and two-equation turbulence models are incorporated into the present unstructured approach. Results are presented for a wide range of flow problems including two-dimensional multi-element airfoils, two-dimensional cascades, and quasi-three-dimensional cascades. This approach is shown to gain flow resolution in the refined regions while achieving a great reduction in the computational effort and storage requirements since solution points are not wasted in regions where they are not required.

Jiang, Yi-Tsann↗

Development of an unstructured solution adaptive method for the quasi-three-dimensional Euler and Navier-Stokes equations

A general solution adaptive scheme-based on a remeshing technique is developed for solving the two-dimensional and quasi-three-dimensional Euler and Favre-averaged Navier-Stokes equations. The numerical scheme is formulated on an unstructured triangular mesh utilizing an edge-based pointer system which defines the edge connectivity of the mesh structure. Jameson's four-stage hybrid Runge-Kutta scheme is used to march the solution in time. The convergence rate is enhanced through the use of local time stepping and implicit residual averaging. As the solution evolves, the mesh is regenerated adaptively using flow field information. Mesh adaptation parameters are evaluated such that an estimated local numerical error is equally distributed over the whole domain. For inviscid flows, the present approach generates a complete unstructured triangular mesh using the advancing front method. For turbulent flows, the approach combines a local highly stretched structured triangular mesh in the boundary layer region with an unstructured mesh in the remaining regions to efficiently resolve the important flow features. One-equation and two-equation turbulence models are incorporated into the present unstructured approach. Results are presented for a wide range of flow problems including two-dimensional multi-element airfoils, two-dimensional cascades, and quasi-three-dimensional cascades. This approach is shown to gain flow resolution in the refined regions while achieving a great reduction in the computational effort and storage requirements since solution points are not wasted in regions where they are not required.

Jiang, Yi-Tsann↗

Radiation-Induced Noise Resilience of Neuromorphic Architectures

Neuromorphic event-based networks use asynchronous time-dependent information to extract features from input data that can allow for edge-based distributed applications such as object recognition. The noise resilience properties of such networks, especially in the context of space applications, are yet to be explored. In this paper, we use the hierarchy of time surfaces (HOTS) algorithm, which is one of the neuromorphic algorithms, to understand the least and most resilient modules in a neuromorphic network. The HOTS algorithm relies on the computing of time surfaces that maps the temporal delays between neighboring pixels into normalized features that involve many computations that are also found in other neuromorphic networks such as exponential decays, distance computations, etcetera. We implemented HOTS on a Digilent PYNQ board with a Xilinx Zynq 7020 system on a chip, and we subjected the boards running the HOTS network inference to neutron radiation at the Los Alamos Neutron Science Center. Furthermore, we used simulation models from our previous similar experiments on the event-based sensor to create a neutron induced noise model to quantify the effect of this noise on the overall performance of the network. This experiment provides the preliminary measurements of the reliability of the HOTS algorithm and proposes methods to create a more reliable HOTS architecture in future spacecraft missions.

Engineering↗

Investigation of a Wedge Adhesion Test for Edge Seals

Many photovoltaic (PV) technologies have been found to be sensitive to moisture that diffuses into a PV package. Even with the use of impermeable frontsheets and backsheets, moisture can penetrate from the edges of a module. To limit this moisture ingress pathway from occurring, manufacturers often use a low permeability polyisobutylene (PIB) based edge seal filled with desiccant to further restrict moisture ingress. Moisture ingress studies have shown that these materials are capable of blocking moisture for the 25-year life of a module; but to do so, they must remain well-adhered and free of cracks. This work focuses on adapting the Boeing Wedge test for use with edge seals laminated using glass substrates as part of a strategy to assess the long-term durability of edge seals. The advantage of this method is that it duplicates the residual stresses and strains that a glass/glass module may have when the lamination process results in some residual glass bending that puts the perimeter in tension. Additionally, this method allows one to simultaneously expose the material to thermal stress, humidity, mechanical stress, and ultraviolet radiation. The disadvantage of this method generally is that we are limited by the fracture toughness of the glass substrates that the edge seal is adhered to. However, the low toughness of typical uncrosslinked or sparsely crosslinked PIB makes them suitable for this technique. We present data obtained during the development of the wedge test for use with PV edge seal materials. This includes development of the measuring techniques and evaluation of the test method with relevant materials. We find consistent data within a given experiment, along with the theoretical independence of fracture toughness measurements with wedge thickness. This indicates that the test methodology is reproducible. However, even though individual experimental sets are consistent, the reproducibility between experimental sets is poor. We believe this may be due to inconsistencies in sample history, sample batch, or small changes in sample preparation/assembly from one month to the next. Because the fracture strength of typical edge seal materials is so low, they cannot be relied upon for mechanical strength. A small stress or strain on the edge seal is capable of promoting delamination or tearing causing the edge seal to fail. Because of this, edge seals are very dependent on the processing and construction parameters in the full size PV module such that any long term evaluation of their durability must be conducted on full size modules to be accurate.

14 SOLAR ENERGY↗

O3BNN: An Out-Of-Order Architecture for High-Performance Binarized Neural Network Inference with Fine-Grained Pruning

In this work, we demonstrate that the highly-condensed BNN model can be shrunk significantly further by dynamically pruning irregular redundant edges. Based on two new observations on BNN-specific properties, our out-of-order (OoO) architecture – O3BNN, can curtail remaining edge evaluation in cases where the binary output of a neuron can be determined early. Similar to Instruction-Level-Parallelism (ILP), these fine-grained, irregular, runtime pruning opportunities are traditionally presumed to be di cult to exploit. We evaluate our design on an FPGA platform using three well-known networks, including VggNet-16, AlexNet for ImageNet, and a VGG-like network for Cifar-10. Results show that our out-of-order approach can prune 27%, 16%, and 42% of the operations for the three networks respectively, without any accuracy loss, leading to at least 1.7×, 1.5×, and 2.1× speedups over state-of-the-art implementations on FPGA/GPU/CPU BNN implementations. Our approach is inference runtime pruning, so no retrain or fine-tuning is needed. We demonstrate our design on an FPGA platform. However, this is only for showcasing the method; the approach does not rely on any FPGA-specific features and can thus be adopted by other devices as well.

Geng, Tong↗

O3BNN-R: An Out-Of-Order Architecture for High-Performance and Regularized BNN Inference

Binarized Neural Networks (BNN) have drawn tremendous attention due to significantly reduced computational complexity and memory demand. They have especially shown great potential in cost- and power-restricted domains, such as IoT and smart edge-devices, where reaching a certain accuracy bar is often sufficient, and real-time is highly desired.In this work, we demonstrate that the highly-condensed BNN model can be shrunk significantly further by dynamically pruning irregular redundant edges. Based on two new observations on BNN-specific properties, an out-of-order (OoO) architecture – O3BNN-R, can curtail edge evaluation in cases where the binary output of a neuron can be determined early. Similar to Instruction-Level-Parallelism(ILP), these fine-grained, irregular, runtime pruning opportunities are traditionally presumed to be difficult to exploit. In order to increase the pruning opportunities, we also optimize the training process by adding 2 regularization items in the loss function (1) for pooling pruning and (2) for threshold pruning. We evaluate our design on an FPGA platform using three well-known networks, including VggNet-16, AlexNet for ImageNet, and a VGG-like network for Cifar-10.

Geng, Tong↗

Capacitively Stabilized Etalon Technology for Spaceborne Wind Lidar Application

Global monitoring by satellites is important for many types of environmental studies. Among these, the wind field is the single most important atmospheric state variable required for understanding atmospheric motion and predicting weather. Studies indicate that a global determination of the tropospheric wind field to an accuracy of 1-5 m/sec is critical for improved numerical weather forecasting. This measurement could be carried out with a spaceborne lidar system sensing the Doppler shift of a laser signal backscattered from the atmosphere. Over the past four years we have developed a ground-based Edge Technique lidar system and demonstrated wind measurements through the troposphere with high accuracy (1-6 m/s) and high spatial resolution. Recently, we began the design of a shuttle based wind measurement system for technology demonstration as part of the Zephyr program. In this paper, we present the characteristics of the high spectral resolution etalon filter technology for lidar wind measurement with the Edge Technique. In conclusion, a spacecraft motion compensation method has been discussed. We demonstrated experimentally that the etalon can be tuned to compensate for any satellite induced Doppler shift to an accuracy of better than 0.6 m/s over a time period of 2.5 ms.

Li, Steven X.↗