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

Wire Detection Algorithms for Navigation

In this research we addressed the problem of obstacle detection for low altitude rotorcraft flight. In particular, the problem of detecting thin wires in the presence of image clutter and noise was studied. Wires present a serious hazard to rotorcrafts. Since they are very thin, their detection early enough so that the pilot has enough time to take evasive action is difficult, as their images can be less than one or two pixels wide. Two approaches were explored for this purpose. The first approach involved a technique for sub-pixel edge detection and subsequent post processing, in order to reduce the false alarms. After reviewing the line detection literature, an algorithm for sub-pixel edge detection proposed by Steger was identified as having good potential to solve the considered task. The algorithm was tested using a set of images synthetically generated by combining real outdoor images with computer generated wire images. The performance of the algorithm was evaluated both, at the pixel and the wire levels. It was observed that the algorithm performs well, provided that the wires are not too thin (or distant) and that some post processing is performed to remove false alarms due to clutter. The second approach involved the use of an example-based learning scheme namely, Support Vector Machines. The purpose of this approach was to explore the feasibility of an example-based learning based approach for the task of detecting wires from their images. Support Vector Machines (SVMs) have emerged as a promising pattern classification tool and have been used in various applications. It was found that this approach is not suitable for very thin wires and of course, not suitable at all for sub-pixel thick wires. High dimensionality of the data as such does not present a major problem for SVMs. However it is desirable to have a large number of training examples especially for high dimensional data. The main difficulty in using SVMs (or any other example-based learning method) is the need for a very good set of positive and negative examples since the performance depends on the quality of the training set.

Kasturi, Rangachar↗

An Efficient Inverse Aerodynamic Design Method For Subsonic Flows

Computational Fluid Dynamics based design methods are maturing to the point that they are beginning to be used in the aircraft design process. Many design methods however have demonstrated deficiencies in the leading edge region of airfoil sections. The objective of the present research is to develop an efficient inverse design method which is valid in the leading edge region. The new design method is a streamline curvature method, and a new technique is presented for modeling the variation of the streamline curvature normal to the surface. The new design method allows the surface coordinates to move normal to the surface, and has been incorporated into the Constrained Direct Iterative Surface Curvature (CDISC) design method. The accuracy and efficiency of the design method is demonstrated using both two-dimensional and three-dimensional design cases.

Milholen, William E., II↗

Boundary-Layer Receptivity and Integrated Transition Prediction

The adjoint parabold stability equations (PSE) formulation is used to calculate the boundary layer receptivity to localized surface roughness and suction for compressible boundary layers. Receptivity efficiency functions predicted by the adjoint PSE approach agree well with results based on other nonparallel methods including linearized Navier-Stokes equations for both Tollmien-Schlichting waves and crossflow instability in swept wing boundary layers. The receptivity efficiency function can be regarded as the Green's function to the disturbance amplitude evolution in a nonparallel (growing) boundary layer. Given the Fourier transformed geometry factor distribution along the chordwise direction, the linear disturbance amplitude evolution for a finite size, distributed nonuniformity can be computed by evaluating the integral effects of both disturbance generation and linear amplification. The synergistic approach via the linear adjoint PSE for receptivity and nonlinear PSE for disturbance evolution downstream of the leading edge forms the basis for an integrated transition prediction tool. Eventually, such physics-based, high fidelity prediction methods could simulate the transition process from the disturbance generation through the nonlinear breakdown in a holistic manner.

Chang, Chau-Lyan↗

Contact Multigraph Routing: Overview and Implementation

In Delay Tolerant Networking (DTN), the standard routing algorithm used to navigate time-varying networks has been Contact Graph Routing (CGR). In CGR, a globally distributed list of contacts, periods during which two DTN nodes may communicate, is used to construct a contact graph, in which contacts are vertices. A version of Dijkstra’s algorithm can then be used to find paths through this model of the timevarying network. However, since contact graphs may be large compared to the network, potentially growing with the square of the number of network nodes and linearly with the time interval represented, the resulting algorithm does not scale well with the size of the network or time. Any improvement to the routing algorithm will bring significant returns to scale. In a previous paper, we briefly introduced an alternative to the contact graph model for routing. This alternative model is based on a multigraph (a graph in which there may be multiple edges between a pair of vertices) where vertices represent network nodes instead of contacts. A version of Dijkstra’s algorithm in these multigraph models reduces the time needed to perform the same routing computations done in the existing CGR algorithm. Moreover, a modified version of Yen’s algorithm for multigraphs is included. Our variation of CGR, which we call Contact Multigraph Routing (CMR), provides an in-line replacement for the previously used pathfinding algorithms. This paper describes an implementation created based on the CMR approach, and experimental comparisons to traditional CGR are given. In addition, we explore some additional modifications to the routing pipeline traditionally assumed in CGR. These modifications range from the theoretical to the practical in terms of size and scope. We step forward our understanding of sheaftheoretic networking and describe how to model the routing pipeline using sheaves. We detail some enhanced route selection criteria that addresses some of the added complexity of DTNbased systems. We also include a future works section on future improvements and implementations that would be of service to the broader DTN community.

contact graph routing↗

Determination of Chlorophyll Content in Selected Grass Communities of Krkonoše Mts. Tundra Based on Laboratory Spectroscopy and Aerial Hyperspectral Data

The study focuses on the determination of chlorophyll content in four prevailing grasses in the relict arctic-alpine tundra located in the Krkonoše Mountains National Park, Czech Republic. We compared two methods for determination of leaf chlorophyll content (LCC) – spectrophotometric determination in the laboratory, and the LCC assessed by fluorescence portable chlorophyll meter CCM-300. Relationships were established between the LCCs and vegetation indices calculated from leaf spectra acquired with contact probe coupled with an ASD FieldSpec4 Wide-Res spectroradiometer. Canopy chlorophyll contents (CCC) were computed from the LCCs and green leaf area index (LAI), and modelled based on the field spectra measured by the spectroradiometer and the hyperspectral images acquired by Headwall Nano-Hyperspec® mounted on the DJI Matrice 600 Pro drone. The calculations are performed on datasets acquired in June, July and August 2020 together and separately for species and months. In general, the correlations based on June datasets work the best at both levels: median R 2 for all indices was 0.52 for all species together at leaf level and median R 2 = 0.47 at the canopy level (vegetation indices computed from field spectra). Canopy chlorophyll content map was created based on the results of stepwise multiple linear regression. The R 2 was 0.42 when using four wavelengths from the red and red edge spectral region. We attribute the weak model performance to a combination of several factors: leaf structure may bias LCC from laboratory measurements, effects of LAI variability on CCC, and the sampling design, probably not covering the whole phenology equally for all studied species.

L. Cervena↗

Heat Transfer on a Film-Cooled Rotating Blade Using a Two Equation Turbulence Model

A three-dimensional Navier-Stokes code has been used to compare the heat transfer coefficient on a film-cooled, rotating turbine blade. The blade chosen is the ACE rotor with five rows containing 93 film cooling holes covering the entire span. This is the only film-cooled rotating blade over which experimental data is available for comparison. Over 2.278 million grid points are used to compute the flow over the blade including the tip clearance region, using Coakley's q-omega turbulence model. Results are also compared with those obtained by Garg and Abhari (1997) using the zero-equation Baldwin-Lomax (B-L) model. A reasonably good comparison with the experimental data is obtained on the suction surface for both the turbulence models. At the leading edge, the B-L model yields a better comparison than the q-omega model. On the pressure surface, however, the comparison between the experimental data and the prediction from either turbulence model is poor. A potential reason for the discrepancy on the pressure surface could be the presence of unsteady effects due to stator-rotor interaction in the experiments which are not modeled in the present computations. Prediction using the two-equation model is in general poorer than that using the zero-equation model, while the former requires at least 40% more computational resources.

Garg, Vijay K.↗

Computer simulation of current collection in a plasma environment

The pattern of current collection by a biased strip of stainless steel placed in the plasma environment produced by a 30 cm Kaufman ion thruster is studied. Two positions of the collector relative to the ion source were used. Edge on, in which case currents were measured on both sides of the collector, and face on, in which case currents were again measured on both sides of the collector. In the latter case, the surface of the collector that faces the ion thruster is referred to as the front face, the other side as the back face. A qualitative summary of the experimental results is presented.

Zei, D.↗

Computation of Feedback Aeroacoustic System by the CE/SE Method

It is well known that due to vortex shedding in high speed flow over cutouts, cavities, and gaps, intense noise may be generated. Strong tonal oscillations occur in a feedback cycle in which the vortices shed from the upstream edge of the cavity convect downstream and impinge on the cavity lip, generating acoustic waves that propagate upstream to excite new vortices. Numerical simulation of such a complicated process requires a scheme that can: (1) resolve acoustic waves with low dispersion and numerical dissipation, (2) handle nonlinear and discontinuous waves (e.g. shocks), and (3) have an effective (near field) nonreflecting boundary condition (NRBC). The new space time conservation element and solution element method, or CE/SE for short, is a numerical method that meets the above requirements.

Loh, Ching Y.↗

Pretest Computational Assessment of Boundary Layer Transition in the NASA Juncture Flow Model with an NACA 0015-Based Wing

The first two phases of the NASA Juncture Flow experiment were carried out on a DLR-F6 swept-wing model and were designed to provide “CFD validation-quality” data toward the assessment and improvement of existing CFD turbulence models in predicting onset and extent of three-dimensional separated flow near the wing-juncture trailing-edge region. The next phase of experiments will involve an NACA 0015-based swept wing, as prior risk reduction experiments had indicated that this wing shape resulted in reduced separation near the juncture region than the DLR-F6 wing, thus providing a better option to evaluate the ability of CFD models to predict incipient turbulent separation. The NACA 0015 measurements will also include IR thermography to infer the variation of transition front with respect to an increasing angle of attack. The primary objective of this work is to computationally make a preliminary assessment of the transition front on both surfaces of the NACA 0015 wing at a crank-chord-based Reynolds number of 2.4 x 106 for four different angles of attack, (0°, 2.5°, 5°, and 7.5°) and to determine the dominant mechanisms responsible for transition. This assessment includes both RANS-based transition models from NASA’s OVERFLOW 2.3b flow solver and linear parabolized stability equations (PSE) stability analysis based on the Langley Stability and Transition Analysis code, LASTRAC. Linear PSE results indicate that the upper surface of the wing is dominated by Tollmien- Schlichting (TS) instabilities, and that the laminar flow region shrinks from about 50% chord to a very small region just downstream of the attachment line as the angle of attack is increased from 0° to 7.5°. Consequently, the transition fronts predicted by the Spalart- Allmaras-based amplification factor transport (AFT-2017b) equation model (which accounts for the TS instabilities alone) and the Menter’s shear-stress transport equation (SST2003)- based Langtry-Menter transition model with ability to account for both TS and crossflow effects (LM2015) compare well with those predicted using linear PSE. On the lower surface of the wing, stationary crossflow (CF) instabilities begin to appear on the inboard portion of the wing in addition to the TS-instabilities for the larger angles of attack (5° and 7.5°), further reducing the laminar flow extent within the inboard region. The LM2015 model that accounts for CF effects is able to replicate this trend but appears to predict a slightly earlier transition. The outcome of this effort will inform the experiment and, when the actual experimental data become available, provide further opportunity to assess and improve the various transition models.

CFD modeling↗

An analysis method for two-dimensional transonic viscous flow

A method for the approximate calculation of transonic flow over airfoils, including shock waves and viscous effects, is described. Numerical solutions are obtained by use of a computer program which is discussed in the appendix. The importance of including the boundary layer in the analysis is clearly demonstrated, as well as the need to improve on existing procedures near the trailing edge. Comparisons between calculations and experimental data are presented for both conventional and supercritical airfoils, emphasis being on the surface pressure distribution, and good agreement is indicated.

Bavitz, P. C.↗

Obstacle detection by rapid estimation scheme with data scaling

A data scaling technique is proposed to improve the performance of a rapid estimation scheme for analyzing rover rangefinder data in the specific area of obstacle outline characterization. The scaling transformation involves multiplying the measured beam length times a scale factor and taking the logarithm in a certain base. Although analysis shows that introducing the scaling transformation has no primary effect on the detection ability and that there is no apparent signal-to-noise ratio improvement, computer simulations show a reduction in the number of false jumps. In the 40-m range the use of data scaling cleared the foreground of obstacles of noise and obtained definition of the near edge of a crater.

Marynowski, R. C.↗

Fast generation of three-dimensional computational boundary-conforming periodic grids of C-type

A fast computer program, GRID3C, was developed to generate multilevel three dimensional, C type, periodic, boundary conforming grids for the calculation of realistic turbomachinery and propeller flow fields. The technique is based on two analytic functions that conformally map a cascade of semi-infinite slits to a cascade of doubly infinite strips on different Riemann sheets. Up to four consecutively refined three dimensional grids are automatically generated and permanently stored on four different computer tapes. Grid nonorthogonality is introduced by a separate coordinate shearing and stretching performed in each of three coordinate directions. The grids are easily clustered closer to the blade surface, the trailing and leading edges and the hub or shroud regions by changing appropriate input parameters. Hub and duct (or outer free boundary) have different axisymmetric shapes. A vortex sheet of arbitrary thickness emanating smoothly from the blade trailing edge is generated automatically by GRID3C. Blade cross sectional shape, chord length, twist angle, sweep angle, and dihedral angle can vary in an arbitrary smooth fashion in the spanwise direction.

Dulikravich, D. S.↗

Aerodynamic heating environment definition/thermal protection system selection for the HL-20

Definition of the aerothermal environment is critical to any vehicle such as the HL-20 Personnel Launch System that operates within the hypersonic flight regime. Selection of an appropriate thermal protection system design is highly dependent on the accuracy of the heating-environment prediction. It is demonstrated that the entry environment determines the thermal protection system design for this vehicle. The methods used to predict the thermal environment for the HL-20 Personnel Launch System vehicle are described. Comparisons of the engineering solutions with computational fluid dynamic predictions, as well as wind-tunnel test results, show good agreement. The aeroheating predictions over several critical regions of the vehicle, including the stagnation areas of the nose and leading edges, windward centerline and wing surfaces, and leeward surfaces, are discussed. Results of predictions based on the engineering methods found within the MINIVER aerodynamic heating code are used in conjunction with the results of the extensive wind-tunnel tests on this configuration to define a flight thermal environment. Finally, the selection of the thermal protection system based on these predictions and current technology is described.

Wurster, K. E.↗

ACE: A distributed system to manage large data archives

Competitive pressures in the oil and gas industry are requiring a much tighter integration of technical data into E and P business processes. The development of new systems to accommodate this business need must comprehend the significant numbers of large, complex data objects which the industry generates. The life cycle of the data objects is a four phase progression from data acquisition, to data processing, through data interpretation, and ending finally with data archival. In order to implement a cost effect system which provides an efficient conversion from data to information and allows effective use of this information, an organization must consider the technical data management requirements in all four phases. A set of technical issues which may differ in each phase must be addressed to insure an overall successful development strategy. The technical issues include standardized data formats and media for data acquisition, data management during processing, plus networks, applications software, and GUI's for interpretation of the processed data. Mass storage hardware and software is required to provide cost effective storage and retrieval during the latter three stages as well as long term archival. Mobil Oil Corporation's Exploration and Producing Technical Center (MEPTEC) has addressed the technical and cost issues of designing, building, and implementing an Advanced Computing Environment (ACE) to support the petroleum E and P function, which is critical to the corporation's continued success. Mobile views ACE as a cost effective solution which can give Mobile a competitive edge as well as a viable technical solution.

Daily, Mike I.↗

Understanding the Scalability of Bayesian Network Inference using Clique Tree Growth Curves

Bayesian networks (BNs) are used to represent and efficiently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to perform computation in BNs is clique tree clustering and propagation. In this approach, BN computation consists of propagation in a clique tree compiled from a Bayesian network. There is a lack of understanding of how clique tree computation time, and BN computation time in more general, depends on variations in BN size and structure. On the one hand, complexity results tell us that many interesting BN queries are NP-hard or worse to answer, and it is not hard to find application BNs where the clique tree approach in practice cannot be used. On the other hand, it is well-known that tree-structured BNs can be used to answer probabilistic queries in polynomial time. In this article, we develop an approach to characterizing clique tree growth as a function of parameters that can be computed in polynomial time from BNs, specifically: (i) the ratio of the number of a BN's non-root nodes to the number of root nodes, or (ii) the expected number of moral edges in their moral graphs. Our approach is based on combining analytical and experimental results. Analytically, we partition the set of cliques in a clique tree into different sets, and introduce a growth curve for each set. For the special case of bipartite BNs, we consequently have two growth curves, a mixed clique growth curve and a root clique growth curve. In experiments, we systematically increase the degree of the root nodes in bipartite Bayesian networks, and find that root clique growth is well-approximated by Gompertz growth curves. It is believed that this research improves the understanding of the scaling behavior of clique tree clustering, provides a foundation for benchmarking and developing improved BN inference and machine learning algorithms, and presents an aid for analytical trade-off studies of clique tree clustering using growth curves.

Mengshoel, Ole Jakob↗

Understanding the Scalability of Bayesian Network Inference Using Clique Tree Growth Curves

One of the main approaches to performing computation in Bayesian networks (BNs) is clique tree clustering and propagation. The clique tree approach consists of propagation in a clique tree compiled from a Bayesian network, and while it was introduced in the 1980s, there is still a lack of understanding of how clique tree computation time depends on variations in BN size and structure. In this article, we improve this understanding by developing an approach to characterizing clique tree growth as a function of parameters that can be computed in polynomial time from BNs, specifically: (i) the ratio of the number of a BN s non-root nodes to the number of root nodes, and (ii) the expected number of moral edges in their moral graphs. Analytically, we partition the set of cliques in a clique tree into different sets, and introduce a growth curve for the total size of each set. For the special case of bipartite BNs, there are two sets and two growth curves, a mixed clique growth curve and a root clique growth curve. In experiments, where random bipartite BNs generated using the BPART algorithm are studied, we systematically increase the out-degree of the root nodes in bipartite Bayesian networks, by increasing the number of leaf nodes. Surprisingly, root clique growth is well-approximated by Gompertz growth curves, an S-shaped family of curves that has previously been used to describe growth processes in biology, medicine, and neuroscience. We believe that this research improves the understanding of the scaling behavior of clique tree clustering for a certain class of Bayesian networks; presents an aid for trade-off studies of clique tree clustering using growth curves; and ultimately provides a foundation for benchmarking and developing improved BN inference and machine learning algorithms.

Mengshoel, Ole J.↗

Prediction of in-depth oxidation distribution of reinforced carbon-carbon materials for Space Shuttle leading edges

A method was developed for predicting oxidation distribution through the thickness of reinforced carbon-carbon material in an earth atmospheric entry environment. A mathematical model was developed which describes oxygen diffusion and reaction rates within material pores. Pertinent rate constants were derived, and material mass loss was computed for a range of temperatures and pressures. Results indicate that both temperature and pressure have an important effect on mass loss distribution. Analytical results were quite consistent with results of ground oxidation tests.

Medford, J. E.↗