Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Complexity”

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 217 records · Page 12

A new VLSI complex integer multiplier which uses a quadratic-polynomial residue system with Fermat numbers

A quadratic-polynomial Fermat residue number system (QFNS) has been used to compute complex integer multiplications. The advantage of such a QFNS is that a complex integer multiplication requires only two integer multiplications. In this article, a new type Fermat number multiplier is developed which eliminates the initialization condition of the previous method. It is shown that the new complex multiplier can be implemented on a single VLSI chip. Such a chip is designed and fabricated in CMOS-Pw technology.

Shyu, H. C.↗

The N2-P3 complex of the evoked potential and human performance

The N2-P3 complex and other endogenous components of human evoked potential provide a set of tools for the investigation of human perceptual and cognitive processes. These multidimensional measures of central nervous system bioelectrical activity respond to a variety of environmental and internal factors which have been experimentally characterized. Their application to the analysis of human performance in naturalistic task environments is just beginning. Converging evidence suggests that the N2-P3 complex reflects processes of stimulus evaluation, perceptual resource allocation, and decision making that proceed in parallel, rather than in series, with response generation. Utilization of these EP components may provide insights into the central nervous system mechanisms modulating task performance unavailable from behavioral measures alone. The sensitivity of the N2-P3 complex to neuropathology, psychopathology, and pharmacological manipulation suggests that these components might provide sensitive markers for the effects of environmental stressors on the human central nervous system.

Odonnell, Brian F.↗

10.7-cm solar radio flux and the magnetic complexity of active regions

During sunspot cycles 20 and 21, the maximum in smoothed 10.7-cm solar radio flux occurred about 1.5 yr after the maximum smoothed sunspot number, whereas during cycles 18 and 19 no lag was observed. Thus, although 10.7-cm radio flux and Zurich sunspot number are highly correlated, they are not interchangeable, especially near solar maximum. The 10.7-cm flux more closely follows the number of sunspots visible on the solar disk, while the Zurich sunspot number more closely follows the number of sunspot groups. The number of sunspots in an active region is one measure of the complexity of the magnetic structure of the region, and the coincidence in the maxima of radio flux and number of sunspots apparently reflects higher radio emission from active regions of greater magnetic complexity. The presence of a lag between sunspot-number maximum and radio-flux maximum in some cycles but not in others argues that some aspect of the average magnetic complexity near solar maximum must vary from cycle to cycle. A speculative possibility is that the radio-flux lag discriminates between long-period and short-period cycles, being another indicator that the solar cycle switches between long-period and short-period modes.

Wilson, Robert M.↗

Measurements of complex permittivity of microwave substrates in the 20 to 300 K temperature range from 26.5 to 40.0 GHz

A knowledge of the dielectric properties of microwave substrates at low temperatures is useful in the design of superconducting microwave circuits. Results are reported for a study of the complex permittivity of sapphire (Al2O3), magnesium oxide (MgO), silicon oxide (SiO2), lanthanum aluminate (LaAlO3), and zirconium oxide (ZrO2), in the 20 to 300 Kelvin temperature range, at frequencies from 26.5 to 40.0 GHz. The values of the real and imaginary parts of the complex permittivity were obtained from the scattering parameters, which were measured using a HP-8510 automatic network analyzer. For these measurements, the samples were mounted on the cold head of a helium gas closed cycle refrigerator, in a specially designed vacuum chamber. An arrangement of wave guides, with mica windows, was used to connect the cooling system to the network analyzer. A decrease in the value of the real part of the complex permittivity of these substrates, with decreasing temperature, was observed. For MgO and Al2O3, the decrease from room temperature to 20 K was of 7 and 15 percent, respectively. For LaAlO3, it decreased by 14 percent, for ZrO2 by 15 percent, and for SiO2 by 2 percent, in the above mentioned temperature range.

Miranda, Felix A.↗

Thermodynamic cost of computation, algorithmic complexity and the information metric

Algorithmic complexity is discussed as a computational counterpart to the second law of thermodynamics. It is shown that algorithmic complexity, which is a measure of randomness, sets limits on the thermodynamic cost of computations and casts a new light on the limitations of Maxwell's demon. Algorithmic complexity can also be used to define distance between binary strings.

Zurek, W. H.↗

Unbound molecular complexes in M33

The HI content of the nearby spiral galaxy M33 (d approx. 0.8 Mpc) has been the subject of many detailed studies (most recently Deul and van der Hulst 1987), but similar data on the molecular gas component has been lacking. This galaxy is currently undergoing vigorous high-mass star formation, as evidenced by the many OB associations and HII regions, and so is expected to possess at least some molecular gas. Interferometric studies have detected molecular clouds similar to Galactic Giant Molecular Clouds (GMCs) (Boulanger et al. 1988; Wilson et al. 1988). Researchers have recently mapped the nuclear region of M33 in the CO J=1-0 line with a 12 m telescope (half power beam width 55 inches approx. 210 pc) out to a radius of 3.5 minutes in order to trace the detailed distribution of the molecular gas. The resulting map reveals six large complexes with diameters of 200 to 400 pc. Interferometer observations of these regions have resolved them into individual molecular clouds similar to Galactic GMCs (Wilson et al. 1988). The complexes shown are much larger than individual Galactic GMCs (Sanders, Scoville, and Solomon 1985), but are somewhat smaller on average than the large associations seen in the grand-design spiral galaxy M51 (Rand and Kulkarni 1989). If we extend the velocity-diameter relation observed for Galactic GMCs to these larger structures, the predicted velocity widths are a factor of 1.5 to 3 times greater than the observed full-width half-maximum velocities (13 to 29 km (s-1). The peak brightness temperatures are approx. 0.2 K, at least a factor of 10 lower than what is observed for Galactic GMCs. If these large structures are made up of objects similar to Galactic GMCs, the area filling factor of the small clouds is roughly 10 percent. These results suggest that these complexes are not very large GMCs, but rather are associations of many individual GMCs or GMCs embedded in a diffuse gas component.

Wilson, Christine D.↗

Application of a solution adaptive grid scheme, SAGE, to complex three-dimensional flows

A new three-dimensional (3D) adaptive grid code based on the algebraic, solution-adaptive scheme of Nakahashi and Deiwert is developed and applied to a variety of problems. The new computer code, SAGE, is an extension of the same-named two-dimensional (2D) solution-adaptive program that has already proven to be a powerful tool in computational fluid dynamics applications. The new code has been applied to a range of complex three-dimensional, supersonic and hypersonic flows. Examples discussed are a tandem-slot fuel injector, the hypersonic forebody of the Aeroassist Flight Experiment (AFE), the 3D base flow behind the AFE, the supersonic flow around a 3D swept ramp and a generic, hypersonic, 3D nozzle-plume flow. The associated adapted grids and the solution enhancements resulting from the grid adaption are presented for these cases. Three-dimensional adaption is more complex than its 2D counterpart, and the complexities unique to the 3D problems are discussed.

Davies, Carol B.↗

Measurements of complex permittivity of microwave substrates in the 20 to 300 K temperature range from 26.5 to 40.0 GHz

A knowledge of the dielectric properties of microwve substrates at low temperatures is useful in the design of superconducting microwave circuits. Results are reported for a study of the complex permittivity of sapphire (Al2O3), magnesium oxide (MgO), silicon oxide (SiO2), lanthanum aluminate (LaAlO3), and zirconium oxide (ZrO2), in the 20 to 300 Kelvin temperature range, at frequencies from 26.5 to 40.0 GHz. The values of the real and imaginary parts of the complex permittivity were obtained from the scattering parameters, which were measured using an HP-8510 automatic network analyzer. For these measurements, the samples were mounted on the cold head of a helium gas closed cycle refrigerator, in a specially designated vacuum chamber. An arrangement of wave guides, with mica windows, was used to connect the cooling system to the network analyzer. A decrease in the value of the real part of the complex permittivity of these substrates, with decreasing temperature, was observed. For MgO and Al2O3, the decrease from room temperature to 20 K was of 7 and 15 percent, respectively. For LaAlO3, it decreased by 14 percent, for ZrO2 by 15 percent, and for SiO2 by 2 percent, in the above mentioned temperature range.

Miranda, Felix A.↗

Decision paths in complex tasks

Complex real world action and its prediction and control has escaped analysis by the classical methods of psychological research. The reason is that psychologists have no procedures to parse complex tasks into their constituents. Where such a division can be made, based say on expert judgment, there is no natural scale to measure the positive or negative values of the components. Even if we could assign numbers to task parts, we lack rules i.e., a theory, to combine them into a total task representation. We compare here two plausible theories for the amalgamation of the value of task components. Both of these theories require a numerical representation of motivation, for motivation is the primary variable that guides choice and action in well-learned tasks. We address this problem of motivational quantification and performance prediction by developing psychophysical scales of the desireability or aversiveness of task components based on utility scaling methods (Galanter 1990). We modify methods used originally to scale sensory magnitudes (Stevens and Galanter 1957), and that have been applied recently to the measure of task 'workload' by Gopher and Braune (1984). Our modification uses utility comparison scaling techniques which avoid the unnecessary assumptions made by Gopher and Braune. Formula for the utility of complex tasks based on the theoretical models are used to predict decision and choice of alternate paths to the same goal.

Galanter, Eugene↗

Estimation of full modal damping matrices from complex test modes

This paper describes the refinements of a previously published method for estimating a full modal damping matrix from complex test modes. It also documents application of the refined method to a structure where complex test modes were derived by the ERA method from multi-input random vibration test data. A numerical example based on simulated test data is presented to demonstrate the validity of the method. The application using real data was not successful, presumably because of noise in the small phase angles of the measured complex modes. Alternative test and data reduction procedures are suggested as possible remedies to the problem. A careful analysis of measurement and data processing errors should be made to examine basic feasibility before implementing the alternative procedures. The ability to estimate a full modal damping matrix is considered important for the preflight estimation of on-orbit damping, and for the synthesis of structural damping from substructure tests.

Hasselman, T. K.↗

Full complex modulation with two one-parameter SLMs

Although the action of a spatial light modulator (SLM) is usually restricted to certain locations on the operating curve of the complex plane, NASA is planning to use architectures that allow two continuously variable SLMs to function jointly so as to access the full interior of a closed curve in the complex plane. This paper describes three fundamental methods for attaining full complex modulation. The mathematics for two of these methods is presented, and signal decomposition in their terms is outlined.

Juday, Richard D.↗

Development and evaluation of a predictive algorithm for telerobotic task complexity

There is a wide range of complexity in the various telerobotic servicing tasks performed in subsea, space, and hazardous material handling environments. Experience with telerobotic servicing has evolved into a knowledge base used to design tasks to be 'telerobot friendly.' This knowledge base generally resides in a small group of people. Written documentation and requirements are limited in conveying this knowledge base to serviceable equipment designers and are subject to misinterpretation. A mathematical model of task complexity based on measurable task parameters and telerobot performance characteristics would be a valuable tool to designers and operational planners. Oceaneering Space Systems and TRW have performed an independent research and development project to develop such a tool for telerobotic orbital replacement unit (ORU) exchange. This algorithm was developed to predict an ORU exchange degree of difficulty rating (based on the Cooper-Harper rating used to assess piloted operations). It is based on measurable parameters of the ORU, attachment receptacle and quantifiable telerobotic performance characteristics (e.g., link length, joint ranges, positional accuracy, tool lengths, number of cameras, and locations). The resulting algorithm can be used to predict task complexity as the ORU parameters, receptacle parameters, and telerobotic characteristics are varied.

Gernhardt, M. L.↗

NASA/DOD Aerospace Knowledge Diffusion Research Project. Report 15: Technical uncertainty and project complexity as correlates of information use by US industry-affiliated aerospace engineers and scientists: Results of an exploratory investigation

An exploratory study was conducted that investigated the influence of technical uncertainty and project complexity on information use by U.S. industry-affiliated aerospace engineers and scientists. The study utilized survey research in the form of a self-administered mail questionnaire. U.S. aerospace engineers and scientists on the Society of Automotive Engineers (SAE) mailing list served as the study population. The adjusted response rate was 67 percent. The survey instrument is appendix C to this report. Statistically significant relationships were found to exist between technical uncertainty, project complexity, and information use. Statistically significant relationships were found to exist between technical uncertainty, project complexity, and the use of federally funded aerospace R&D. The results of this investigation are relevant to researchers investigating information-seeking behavior of aerospace engineers. They are also relevant to R&D managers and policy planners concerned with transferring the results of federally funded aerospace R&D to the U.S. aerospace industry.

Pinelli, Thomas E.↗

Single block three-dimensional volume grids about complex aerodynamic vehicles

This paper presents an alternate approach for the generation of volumetric grids for supersonic and hypersonic flows about complex configurations. The method uses parametric two dimensional block face grid definition within the framework of GRIDGEN2D. The incorporation of face decomposition reduces complex surfaces to simple shapes. These simple shapes are combined to obtain the final face definition. The advantages of this method include the reduction of overall grid generation time through the use of vectorized computer code, the elimination of the need to generate matching block faces, and the implementation of simplified boundary conditions. A simple axisymmetric grid is used to illustrate this method. In addition, volume grids for two complex configurations, the Langley Lifting Body (HL-20) and the Space Shuttle Orbiter, are shown.

Alter, Stephen J.↗

A programming environment for distributed complex computing. An overview of the Framework for Interdisciplinary Design Optimization (FIDO) project. NASA Langley TOPS exhibit H120b

The Framework for Interdisciplinary Design Optimization (FIDO) is a general programming environment for automating the distribution of complex computing tasks over a networked system of heterogeneous computers. For example, instead of manually passing a complex design problem between its diverse specialty disciplines, the FIDO system provides for automatic interactions between the discipline tasks and facilitates their communications. The FIDO system networks all the computers involved into a distributed heterogeneous computing system, so they have access to centralized data and can work on their parts of the total computation simultaneously in parallel whenever possible. Thus, each computational task can be done by the most appropriate computer. Results can be viewed as they are produced and variables changed manually for steering the process. The software is modular in order to ease migration to new problems: different codes can be substituted for each of the current code modules with little or no effect on the others. The potential for commercial use of FIDO rests in the capability it provides for automatically coordinating diverse computations on a networked system of workstations and computers. For example, FIDO could provide the coordination required for the design of vehicles or electronics or for modeling complex systems.

Townsend, James C.↗

Automatic blocking for complex three-dimensional configurations

A new blocking technique for complex three-dimensional configurations is described. This new technique is based upon the concept of an abstraction, or squared-up representation, of the configuration and the associated grid. By allowing the user to describe blocking requirements in natural terms (such as 'wrap a grid around this leading edge' or 'make all grid lines emanating from this wall orthogonal to it'), users can quickly generate complex grids around complex configurations, while still maintaining a high level of control where desired. An added advantage of the abstraction concept is that once a blocking is defined for a class of configurations, it can be automatically applied to other configurations of the same class, making the new technique particularly well suited for the parametric variations which typically occur during design processes. Grids have been generated for a variety of real-world, two- and three-dimensional configurations. In all cases, the time required to generate the grid, given just an electronic form of the configuration, was at most a few days. Hence with this new technique, the generation of a block-structured grid is only slightly more expensive than the generation of an unstructured grid for the same configuration.

Dannenhoffer, John F., III↗

Unstructured Cartesian/prismatic grid generation for complex geometries

The generation of a hybrid grid system for discretizing complex three dimensional (3D) geometries is described. The primary grid system is an unstructured Cartesian grid automatically generated using recursive cell subdivision. This grid system is sufficient for computing Euler solutions about extremely complex 3D geometries. A secondary grid system, using triangular-prismatic elements, may be added for resolving the boundary layer region of viscous flows near surfaces of solid bodies. This paper describes the grid generation processes used to generate each grid type. Several example grids are shown, demonstrating the ability of the method to discretize complex geometries, with very little pre-processing required by the user.

Karman, Steve L., Jr.↗

Trellis complexity bounds for decoding linear block codes

We consider the problem of finding a trellis for a linear block code that minimizes one or more measures of trellis complexity. The domain of optimization may be different permutations of the same code or different codes with the same parameters. Constraints on trellises, including relationships between the minimal trellis of a code and that of the dual code, are used to derive bounds on complexity. We define a partial ordering on trellises: If a trellis is optimum with respect to this partial ordering, if has the desirable property that it simultaneously minimizes all of the complexity measures examined. We examine properties of such optimal trellises and give examples of optimal permutations of codes, most notably the (48,24,12) quadratic residue code.

Kiely, A. B.↗