SEARCH · Search NASA

Results for “minimization”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 613 records · Page 34

All sources NASA NTRS DOE OSTI

NASA NTRS2002

Optimal Design of Functionally Graded Metallic Foam Insulations

The focus of our work has been on developing an insight into the physics that govern the optimum design of thermal insulation for use in thermal protection systems of launch vehicle. Of particular interest was to obtain optimality criteria for designing foam insulations that have density (or porosity) distributions through the thickness for optimum thermal performance. We investigate the optimum design of functionally graded thermal insulation for steady state heat transfer through the foam. We showed that the heat transfer in the foam has competing modes, of radiation and conduction. The problem assumed a fixed inside temperature of 400 K and varied the aerodynamic surface heating on the outside surface from 0.2 to 1.0 MW/sq m. The thermal insulation develops a high temperature gradient through the thickness. Investigation of the model developed for heat conduction in foams showed that at high temperatures (as on outside wall) intracellular radiation dominates the heat transfer in the foam. Minimizing radiation requires reducing the pore size, which increases the density of the foam. At low temperatures (as on the inside wall), intracellular conduction (of the metal and air) dominates the heat transfer. Minimizing conduction requires increasing the pore size. This indicated that for every temperature there was an optimum value of density that minimized the heat transfer coefficient. Two optimization studies were performed. One was to minimize the heat transmitted though a fixed thickness insulation by varying density profiles. The second was to obtain the minimum mass insulation for specified thickness. Analytical optimality criteria were derived for the cases considered. The optimality condition for minimum heat transfer required that at each temperature we find the density that minimizes the heat transfer coefficient. Once a relationship between the optimum heat transfer coefficient and the temperature was found, the design problem reduced to the solution of a simple nonlinear differential equation. Preliminary results of this work were presented at the American Society of Composites meeting, and the final version was submitted for publication in the AIAA Journal. In addition to minimizing the transmitted heat, we investigated the optimum design for minimum weight given an acceptable level of heat transmission through the insulation. The optimality criterion developed was different from that obtained for minimizing beat transfer coefficient. For minimum mass design, we had to find for a given temperature the optimum density, which minimized the logarithmic derivative of the insulation thermal conductivity with respect to its density. The logarithmic derivative is defined as the ratio of relative change in the dependent response (thermal conductivity) to the relative change in the independent variable (density). The results have been documented as a conference paper that will be presented at the upcoming AIAA.

Haftka, Raphael T.↗

NASA NTRSDate not supplied

An Improved Approach to the Predictability & Reliability of the Onset of Turbulence With Shocks

The construction of numerical schemes for (a) stable and accurate simulation of turbulence with strong shocks, and for (b) obtaining correct propagation speed of discontinuities in the presence of stiff source terms share one important ingredient – minimization of numerical dissipation while maintaining numerical stability. The dual requirements to achieve both numerical stability and minimal numerical dissipation are often conflicting since existing shock capturing schemes were designed mainly to be robust for rapidly developed turbulence-free flows and for shock waves without stiff source term. For the past two decades, Yee and collaborators have focused on an improved understanding of the nonlinear behavior of different high order shock-capturing methods. It was found that even very high order methods without proper nonlinear stability and numerical dissipation control can either numerically smear the onset of turbulence due to excess numerical dissipation, or induce (onset) numerical turbulence that is not physical turbulence due to lack of proper numerical dissipation to improve nonlinear stability for long time integration. Our approach is to combine (I) and (II) below for obtaining the physically correct onset of turbulence with shocks, including problems with stiff source terms: (I) Nonlinear dynamics is utilized to complement the traditional linearized stability theory (Yee & Sweby, Yee et al., Griffiths et al., Lafon & Yee, Yee, Wang et al., Kotov et al. 1990- 2015) in order to (i) Minimize numerically induced false transition to turbulence, (ii) Minimize numerical instability due to long time integration of turbulent flows, (iii) Minimize numerically induced standing wave solutions, and (iv) Minimize wrong propagation of speed of discontinuities due to the presence of stiff source terms. (II) Our recently developed physical preserving (structural preserving) high order methods with improved nonlinear stability & accuracy that are essential in minimizing spurious numerics are used.

HECC↗

NASA NTRS1995

The trellis complexity of convolutional codes

It has long been known that convolutional codes have a natural, regular trellis structure that facilitates the implementation of Viterbi's algorithm. It has gradually become apparent that linear block codes also have a natural, though not in general a regular, 'minimal' trellis structure, which allows them to be decoded with a Viterbi-like algorithm. In both cases, the complexity of the Viterbi decoding algorithm can be accurately estimated by the number of trellis edges per encoded bit. It would, therefore, appear that we are in a good position to make a fair comparison of the Viterbi decoding complexity of block and convolutional codes. Unfortunately, however, this comparison is somewhat muddled by the fact that some convolutional codes, the punctured convolutional codes, are known to have trellis representations that are significantly less complex than the conventional trellis. In other words, the conventional trellis representation for a convolutional code may not be the minimal trellis representation. Thus, ironically, at present we seem to know more about the minimal trellis representation for block than for convolutional codes. In this article, we provide a remedy, by developing a theory of minimal trellises for convolutional codes. (A similar theory has recently been given by Sidorenko and Zyablov). This allows us to make a direct performance-complexity comparison for block and convolutional codes. A by-product of our work is an algorithm for choosing, from among all generator matrices for a given convolutional code, what we call a trellis-minimal generator matrix, from which the minimal trellis for the code can be directly constructed. Another by-product is that, in the new theory, punctured convolutional codes no longer appear as a special class, but simply as high-rate convolutional codes whose trellis complexity is unexpectedly small.

Mceliece, R. J.↗

NASA NTRS1999

Optimized System Identification

In system identification, one usually cares most about finding a model whose outputs are as close as possible to the true system outputs when the same input is applied to both. However, most system identification algorithms do not minimize this output error. Often they minimize model equation error instead, as in typical least-squares fits using a finite-difference model, and it is seen here that this distinction is significant. Here, we develop a set of system identification algorithms that minimize output error for multi-input/multi-output and multi-input/single-output systems. This is done with sequential quadratic programming iterations on the nonlinear least-squares problems, with an eigendecomposition to handle indefinite second partials. This optimization minimizes a nonlinear function of many variables, and hence can converge to local minima. To handle this problem, we start the iterations from the OKID (Observer/Kalman Identification) algorithm result. Not only has OKID proved very effective in practice, it minimizes an output error of an observer which has the property that as the data set gets large, it converges to minimizing the criterion of interest here. Hence, it is a particularly good starting point for the nonlinear iterations here. Examples show that the methods developed here eliminate the bias that is often observed using any system identification methods of either over-estimating or under-estimating the damping of vibration modes in lightly damped structures.

Juang, Jer-Nan↗

NASA NTRS2002

Quadratic Optimization in the Problems of Active Control of Sound

We analyze the problem of suppressing the unwanted component of a time-harmonic acoustic field (noise) on a predetermined region of interest. The suppression is rendered by active means, i.e., by introducing the additional acoustic sources called controls that generate the appropriate anti-sound. Previously, we have obtained general solutions for active controls in both continuous and discrete formulations of the problem. We have also obtained optimal solutions that minimize the overall absolute acoustic source strength of active control sources. These optimal solutions happen to be particular layers of monopoles on the perimeter of the protected region. Mathematically, minimization of acoustic source strength is equivalent to minimization in the sense of L(sub 1). By contrast. in the current paper we formulate and study optimization problems that involve quadratic functions of merit. Specifically, we minimize the L(sub 2) norm of the control sources, and we consider both the unconstrained and constrained minimization. The unconstrained L(sub 2) minimization is certainly the easiest problem to address numerically. On the other hand, the constrained approach allows one to analyze sophisticated geometries. In a special case, we call compare our finite-difference optimal solutions to the continuous optimal solutions obtained previously using a semi-analytic technique. We also show that the optima obtained in the sense of L(sub 2) differ drastically from those obtained in the sense of L(sub 1).

Loncaric, J.↗

NASA NTRS2005

Biased Randomized Algorithm for Fast Model-Based Diagnosis

A biased randomized algorithm has been developed to enable the rapid computational solution of a propositional- satisfiability (SAT) problem equivalent to a diagnosis problem. The closest competing methods of automated diagnosis are described in the preceding article "Fast Algorithms for Model-Based Diagnosis" and "Two Methods of Efficient Solution of the Hitting-Set Problem" (NPO-30584), which appears elsewhere in this issue. It is necessary to recapitulate some of the information from the cited articles as a prerequisite to a description of the present method. As used here, "diagnosis" signifies, more precisely, a type of model-based diagnosis in which one explores any logical inconsistencies between the observed and expected behaviors of an engineering system. The function of each component and the interconnections among all the components of the engineering system are represented as a logical system. Hence, the expected behavior of the engineering system is represented as a set of logical consequences. Faulty components lead to inconsistency between the observed and expected behaviors of the system, represented by logical inconsistencies. Diagnosis - the task of finding the faulty components - reduces to finding the components, the abnormalities of which could explain all the logical inconsistencies. One seeks a minimal set of faulty components (denoted a minimal diagnosis), because the trivial solution, in which all components are deemed to be faulty, always explains all inconsistencies. In the methods of the cited articles, the minimal-diagnosis problem is treated as equivalent to a minimal-hitting-set problem, which is translated from a combinatorial to a computational problem by mapping it onto the Boolean-satisfiability and integer-programming problems. The integer-programming approach taken in one of the prior methods is complete (in the sense that it is guaranteed to find a solution if one exists) and slow and yields a lower bound on the size of the minimal diagnosis. In contrast, the present approach is incomplete and fast and yields an upper bound on the size of the minimal diagnosis.

Williams, Colin↗

NASA NTRS1972

Application of quadratic optimization to supersonic inlet control.

This paper describes the application of linear stochastic optimal control theory to the design of the control system for the air intake, the inlet, of a supersonic air-breathing propulsion system. The controls must maintain a stable inlet shock position in the presence of random airflow disturbances and prevent inlet unstart. Two different linear time invariant controllers are developed. One is designed to minimize a nonquadratic index, the expected frequency of inlet unstart, and the other is designed to minimize the mean square value of inlet shock motion. The quadratic equivalence principle is used to obtain a linear controller that minimizes the nonquadratic index. The two controllers are compared on the basis of unstart prevention, control effort requirements, and frequency response. It is concluded that while controls designed to minimize unstarts are desirable in that the index minimized is physically meaningful, computation time required is longer than for the minimum mean square shock position approach. The simpler minimum mean square shock position solution produced expected unstart frequency values which were not significantly larger than those of the nonquadratic solution.

Lehtinen, B.↗

NASA NTRS1979

An autonomous payload controller for the Space Shuttle

The Autonomous Payload Control (APC) system discussed in the present paper was designed on the basis of such criteria as minimal cost of implementation, minimal space required in the flight-deck area, simple operation with verification of the results, minimal additional weight, minimal impact on Orbiter design, and minimal impact on Orbiter payload integration. In its present configuration, the APC provides a means for the Orbiter crew to control as many as 31 autononous payloads. The avionics and human engineering aspects of the system are discussed.

Hudgins, J. I.↗

NASA NTRS1987

Optimal trajectories for aeroassisted, coplanar orbital transfer

Classical and minimax optimal control problems arising in the study of aeroassisted coplanar orbit transfer from a high planetary orbit to a low one are considered. Attention is given to (1) the minimization of the energy required for the maneuver; (2) minimization of the time integral of the heating rate; (3) minimization of the time of flight during the atmospheric portion of the trajectory; (4) maximization of the time of flight during the atmospheric portion of the trajectory; (5) minimization of the time integral of the path inclination; and (6) minimization of the sum of the squares of the entry and exit path inclinations.

Miele, A.↗

NASA NTRS1990

Influence of linear profile modification and loading conditions on the dynamic tooth load and stress of high contact ratio gears

A computer simulation for the dynamic response of high-contact-ratio spur gear transmissions is presented. High contact ratio gears have the potential to produce lower dynamic tooth loads and minimum root stress but they can be sensitive to tooth profile errors. The analysis presented examines various profile modifications under realistic loading conditions. The effect of these modifications on the dynamic load (force) between mating gear teeth and the dynamic root stress is presented. Since the contact stress is dependent on the dynamic load, minimizing dynamic loads will also minimize contact stresses. It is shown that the combination of profile modification and the applied load (torque) carried by a gear system has a significant influence on gear dynamics. The ideal modification at one value of applied load will not be the best solution for a different load. High-contact-ratio gears were found to require less modification than standard low-contact-ratio gears. High-contact-ratio gears are more adversely affected by excess modification than by under modification. In addition, the optimal profile modification required to minimize the dynamic load (hence the contact stress) on a gear tooth differs from the optimal modification required to minimize the dynamic root (bending) stress. Computer simulation can help find the design tradeoffs to determine the best profile modification to satisfy the conflicting constraints of minimizing both the load and root stress in gears which must operate over a range of applied loads.

Lee, Chinwai↗

NASA NTRS1990

Properties of the optimal trajectories for coplanar, aeroassisted orbital transfer

The optimization of trajectories for coplaner, aeroassisted orbital transfer (AOT) from a high Earth orbit (HEO) to a low Earth orbit (LEO) is examined. In particular, HEO can be a geosynchronous Earth orbit (GEO). It is assumed that the initial and final orbits are circular, that the gravitational field is central and is governed by the inverse square law, and that two impulses are employed, one at HEO exit and one at LEO entry. During the atmospheric pass, the trajectory is controlled via the lift coefficient in such a way that the total characteristic velocity is minimized. First, an ideal optimal trajectory is determined analytically for lift coefficient unbounded. This trajectory is called grazing trajectory, because the atmospheric pass is made by flying at constant altitude along the edge of the atmosphere until the excess velocity is depleted. For the grazing trajectory, the lift coefficient varies in such a way that the lift, the centrifugal force due to the Earth's curvature, the weight, and the Coriolis force due to the Earth's rotation are in static balance. Also, the grazing trajectory minimizes the total characteristic velocity and simultaneously nearly minimizes the peak values of the altitude drop, dynamic pressure, and heating rate. Next, starting from the grazing trajectory results, a real optimal trajectory is determined numerically for the lift coefficient bounded from both below and above. This trajectory is characterized by atmospheric penetration with the smallest possible entry angle, followed by flight at the lift coefficient lower bound. Consistently with the grazing trajectory behavior, the real optimal trajectory minimizes the total characteristic velocity and simultaneously nearly minimizes the peak values of the altitude drop, the dynamic pressure, and the heating rate.

Miele, A.↗

NASA NTRS1990

Acoustic transducer apparatus with reduced thermal conduction

A horn is described for transmitting sound from a transducer to a heated chamber containing an object which is levitated by acoustic energy while it is heated to a molten state, which minimizes heat transfer to thereby minimize heating of the transducer, minimize temperature variation in the chamber, and minimize loss of heat from the chamber. The forward portion of the horn, which is the portion closest to the chamber, has holes that reduce its cross-sectional area to minimize the conduction of heat along the length of the horn, with the entire front portion of the horn being rigid and having an even front face to efficiently transfer high frequency acoustic energy to fluid in the chamber. In one arrangement, the horn has numerous rows of holes extending perpendicular to the length of horn, with alternate rows extending perpendicular to one another to form a sinuous path for the conduction of heat along the length of the horn.

Lierke, Ernst G.↗

NASA NTRS1991

Properties of the optimal trajectories for coplanar, aeroassisted orbital transfer

The optimization of trajectories for coplanar, aeroassisted orbital transfer (AOT) from a high earth orbit (HEO) to a low earth orbit (LEO) is examined. In particular, HEO can be a geosynchronous earth orbit (GEO). During the atmospheric pass, the trajectory is controlled via the lift coefficient in such a way that the total characteristic velocity is minimized. First, an ideal optimal trajectory is determined analytically for lift coefficient unbounded. This trajectory is called a grazing trajectory. For the grazing trajectory, the lift coefficient varies in such a way that the lift, the contrifugal force due to the earth's curvature, the weight, and the Coriolis force due to the earth's rotation are in static balance. Also, the grazing trajectory minimizes the total characteristic velocity and simultaneously nearly minimizes the peak values of the altitude drop, dynamic pressure, and heating rate. Next, starting from the grazing trajectory results, a real optimal trajectory is determined numerically for the lift coefficient bounded from both below and above. This trajectory is characterized by atmospheric penetration with the smallest possible entry angle, followed by flight at the lift coefficient lower bound. The real optimal trajectory minimizes the total characteristic velocity and simultaneously nearly minimizes the peak values of the altitude drop, the dynamic pressure, and the heating rate.

Miele, A.↗

NASA NTRS1998

Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes

A code trellis is a graphical representation of a code, block or convolutional, in which every path represents a codeword (or a code sequence for a convolutional code). This representation makes it possible to implement Maximum Likelihood Decoding (MLD) of a code with reduced decoding complexity. The most well known trellis-based MLD algorithm is the Viterbi algorithm. The trellis representation was first introduced and used for convolutional codes [23]. This representation, together with the Viterbi decoding algorithm, has resulted in a wide range of applications of convolutional codes for error control in digital communications over the last two decades. There are two major reasons for this inactive period of research in this area. First, most coding theorists at that time believed that block codes did not have simple trellis structure like convolutional codes and maximum likelihood decoding of linear block codes using the Viterbi algorithm was practically impossible, except for very short block codes. Second, since almost all of the linear block codes are constructed algebraically or based on finite geometries, it was the belief of many coding theorists that algebraic decoding was the only way to decode these codes. These two reasons seriously hindered the development of efficient soft-decision decoding methods for linear block codes and their applications to error control in digital communications. This led to a general belief that block codes are inferior to convolutional codes and hence, that they were not useful. Chapter 2 gives a brief review of linear block codes. The goal is to provide the essential background material for the development of trellis structure and trellis-based decoding algorithms for linear block codes in the later chapters. Chapters 3 through 6 present the fundamental concepts, finite-state machine model, state space formulation, basic structural properties, state labeling, construction procedures, complexity, minimality, and sectionalization of trellises. Chapter 7 discusses trellis decomposition and subtrellises for low-weight codewords. Chapter 8 first presents well known methods for constructing long powerful codes from short component codes or component codes of smaller dimensions, and then provides methods for constructing their trellises which include Shannon and Cartesian product techniques. Chapter 9 deals with convolutional codes, puncturing, zero-tail termination and tail-biting.Chapters 10 through 13 present various trellis-based decoding algorithms, old and new. Chapter 10 first discusses the application of the well known Viterbi decoding algorithm to linear block codes, optimum sectionalization of a code trellis to minimize computation complexity, and design issues for IC (integrated circuit) implementation of a Viterbi decoder. Then it presents a new decoding algorithm for convolutional codes, named Differential Trellis Decoding (DTD) algorithm. Chapter 12 presents a suboptimum reliability-based iterative decoding algorithm with a low-weight trellis search for the most likely codeword. This decoding algorithm provides a good trade-off between error performance and decoding complexity. All the decoding algorithms presented in Chapters 10 through 12 are devised to minimize word error probability. Chapter 13 presents decoding algorithms that minimize bit error probability and provide the corresponding soft (reliability) information at the output of the decoder. Decoding algorithms presented are the MAP (maximum a posteriori probability) decoding algorithm and the Soft-Output Viterbi Algorithm (SOVA) algorithm. Finally, the minimization of bit error probability in trellis-based MLD is discussed.

Lin, Shu↗

NASA NTRS1996

The Newton Modified Barrier Method for QP Problems

The Modified Barrier Functions (MBF) have elements of both Classical Lagrangians (CL) and Classical Barrier Functions (CBF). The MBF methods find an unconstrained minimizer of some smooth barrier function in primal space and then update the Lagrange multipliers, while the barrier parameter either remains fixed or can be updated at each step. The numerical realization of the MBF method leads to the Newton MBF method, where the primal minimizer is found by using Newton's method. This minimizer is then used to update the Lagrange multipliers. In this paper, we examine the Newton MBF method for the Quadratic Programming (QP) problem. It will be shown that under standard second-order optimality conditions, there is a ball around the primal solution and a cut cone in the dual space such that for a set of Lagrange multipliers in this cut cone, the method converges quadratically to the primal minimizer from any point in the aforementioned ball, and continues to do so after each Lagrange multiplier update. The Lagrange multipliers remain within the cut cone and converge linearly to their optimal values. Any point in this ball will be called a "hot start". Starting at such a "hot start", at most Omicron(1n 1n epsilon(exp -1)) Newton steps are sufficient to perform the primal minimization which is necessary for the Lagrange multiplier update. Here, epsilon > 0 is the desired accuracy. Because of the linear convergence of the Lagrange multipliers, this means that only Omicron(1n epsilon(exp -1))omicron(ln 1n epsilon(exp-1)) Newton steps are required to reach an epsilon-approximation to the solution from any "hot start". In order to reach the "hot start", one has to perform Omicron(square root(m) 1n C) Newton steps, where m characterizes the size of the problem and C > 0 is the condition number of the QP problem. This condition number will be characterized explicitly in terms of key parameters of the QP problem, which in turn depend on the input data and the size of the problem.

Melman, A.↗

NASA NTRS2000

Novel Integrated Radial and Axial Magnetic Bearing

Typically, fully active magnetically suspended systems require one axial and two radial magnetic bearings. Combining radial and axial functions into a single device allows for more compact and elegant packaging. Furthermore, in the case of high-speed devices such as energy storage flywheels, it is beneficial to minimize shaft length to keep rotor mode frequencies as high as possible. Attempts have been made to combine radial and axial functionality, but with certain drawbacks. One approach requires magnetic control flux to flow through a bias magnet reducing control effectiveness, thus resulting in increased resistive losses. This approach also requires axial force producing magnetic flux to flow in a direction into the rotor laminate that is undesirable for minimizing eddy-current losses resulting in rotational losses. Another approach applies a conical rotor shape to what otherwise would be a radial heteropolar magnetic bearing configuration. However, positional non-linear effects are introduced with this scheme and the same windings are used for bias, radial, and axial control adding complexity to the controller and electronics. For this approach, the amount of axial capability must be limited. It would be desirable for an integrated radial and axial magnetic bearing to have the following characteristics, separate inputs for radial and axial control for electronics and control simplicity, all magnetic control fluxes should only flow through their respective air gaps and should not flow through any bias magnets for minimal resistive losses, be of a homopolar design to minimize rotational losses, position related non-linear effects should be minimized, and dependent upon the design parameters, be able to achieve any radial/axial force or power ratio as desired. The integrated radial and axial magnetic bearing described in this paper exhibits all these characteristics. Magnetic circuit design, design equations, and analysis results will be presented.

Blumenstock, Kenneth A.↗

NASA NTRS2000

Novel Integration Radial and Axial Magnetic Bearing

Typically, fully active magnetically suspended systems require one axial and two radial magnetic bearings. Combining radial and axial functions into a single device allows for more compact and elegant packaging. Furthermore, in the case of high-speed devices such as energy storage flywheels, it is beneficial to minimize shaft length to keep rotor mode frequencies as high as possible. Attempts have been made to combine radial and axial functionality, but with certain drawbacks. One approach requires magnetic control flux to flow through a bias magnet reducing control effectiveness, thus resulting in increased resistive losses. This approach also requires axial force producing magnetic flux to flow in a direction into the rotor laminate that is undesirable for minimizing eddy-current losses resulting in rotational losses. Another approach applies a conical rotor shape to what otherwise would be a radial heteropolar magnetic bearing configuration. However, positional non-linear effects are introduced with this scheme and the same windings are used for bias, radial, and axial control adding complexity to the controller and electronics. For this approach, the amount of axial capability must be limited. It would be desirable for an integrated radial and axial magnetic bearing to have the following characteristics; separate inputs for radial and axial control for electronics and control simplicity, all magnetic control fluxes should only flow through their respective air gaps and should not flow through any bias magnets for minimal resistive losses, be of a homopolar design to minimize rotational losses, position related non-linear effects should be minimized, and dependent upon the design parameters, be able to achieve any radial/axial force or power ratio as desired. The integrated radial and axial magnetic bearing described in this paper exhibits all these characteristics. Magnetic circuit design, design equations, and magnetic field modeling results will be presented.

Blumenstock, Kenneth↗

NASA NTRS1961

Noise Considerations in the Design and Operation of V/STOL Aircraft

Available propulsion-system noise data have been applied to the problems of design and operation of V/STOL aircraft. In particular, considerations have been given to minimizing adverse community reaction for operations between airports and to minimizing detection due to noise for special missions. For minimizing adverse community reaction, configurations incorporating low-blade-loading rotors, low-tip-speed propellers, or turbofan-type engines are judged to be most satisfactory. For minimizing detection, consideration must be given to minimizing the noise of the generating airplane, having maximum background noise in the vicinity of the observer, and operating the aircraft at minimum altitude.

Maglieri, Domenic J.↗