Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “matching problem”

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
All sourcesNASA NTRSDOE OSTI
NASA NTRS1987

Parallel processing for digital picture comparison

In picture processing an important problem is to identify two digital pictures of the same scene taken under different lighting conditions. This kind of problem can be found in remote sensing, satellite signal processing and the related areas. The identification can be done by transforming the gray levels so that the gray level histograms of the two pictures are closely matched. The transformation problem can be solved by using the packing method. Researchers propose a VLSI architecture consisting of m x n processing elements with extensive parallel and pipelining computation capabilities to speed up the transformation with the time complexity 0(max(m,n)), where m and n are the numbers of the gray levels of the input picture and the reference picture respectively. If using uniprocessor and a dynamic programming algorithm, the time complexity will be 0(m(3)xn). The algorithm partition problem, as an important issue in VLSI design, is discussed. Verification of the proposed architecture is also given.

Cheng, H. D.↗
NASA NTRS1979

Phase 2: Array automated assembly task low cost silicon solar array project

Several microwave systems for use in solar cell fabrication were developed and experimentally tested. The first system used a standing wave rectangular waveguide horn applicator. Satisfactory results were achieved with this system for impedance matching and wafer surface heating uniformity. The second system utilized a resonant TM sub 011 mode cylindrical cavity but could not be employed due to its poor energy coupling efficiency. The third and fourth microwave systems utilized a circular waveguide operating in the TM sub 01 and TM sub 11 but had problems with impedance matching, efficiency, and field uniformity.

Jones, G. T.↗
DOE OSTI2024

Streaming Matching and Edge Cover in Practice

Graph algorithms with polynomial space and time requirements often become infeasible for massive graphs with billions of edges or more. State-of-the-art approaches therefore employ approximate serial, parallel, and distributed algorithms to tackle these challenges. However, such approaches require storing the entire graph in memory and thus need access to costly computing resources such as clusters and supercomputers. In this paper, we present practical streaming approaches for solving massive graph problems using limited memory for two prototypical graph problems: maximum weighted matching and minimum weighted edge cover. For matching, we conduct a thorough computational study on two of the semi-streaming algorithms including a recent breakthrough result that achieves a $1/(2+\varepsilon)$-approximation of the weight while using $O( n \log W /\epsilon)$ memory (here $n$ is the number of vertices and $W$ is the maximum edge weight), designed by Paz and Schwartzman [SODA, 2017]. Empirically, we show that the semi-streaming algorithms produce matchings whose weight is close to the best $1/2$-approximate offline algorithm while requiring less time and an order-of-magnitude less memory. For minimum weighted edge cover, we develop three novel semi-streaming algorithms. Two of these algorithms require a single pass through the input graph, require $O(n \log n)$ memory, and provide a 2-approximation guarantee on the objective. We also leverage a relationship between approximate maximum weighted matching and approximate minimum weighted edge cover to develop a two-pass $3/2+\epsilon$-approximate algorithm with the memory requirement of Paz and Schwartzman's semi-streaming matching algorithm. These streaming approaches are compared against the state-of-the-art 3/2-approximate offline algorithm. The semi-streaming matching and the novel edge cover algorithms proposed in this paper can process graphs with several billions of edges in under 30 minutes using 6 GB of memory, which is at least an order of magnitude improvement from the offline (non-streaming) algorithms. For the largest graph, the best alternative offline parallel approximation algorithm (GPA+ROMA) could not finish in three hours even while employing hundreds of processors and 1 TB of memory. We also demonstrate an application of the semi-streaming algorithm by computing a matching using linearly bounded memory on item intersection graphs derived from three machine learning datasets, whereas the existing offline algorithms could not complete on one of these datasets since their memory requirements exceeded 1TB.

Ferdous, S M.↗
NASA NTRS1980

Minimum Bayes risk image correlation

In this paper, the problem of designing a matched filter for image correlation will be treated as a statistical pattern recognition problem. It is shown that, by minimizing a suitable criterion, a matched filter can be estimated which approximates the optimum Bayes discriminant function in a least-squares sense. It is well known that the use of the Bayes discriminant function in target classification minimizes the Bayes risk, which in turn directly minimizes the probability of a false fix. A fast Fourier implementation of the minimum Bayes risk correlation procedure is described.

Minter, T. C., Jr.↗
NASA NTRS1991

Fast Parallel Computation Of Manipulator Inverse Dynamics

Method for fast parallel computation of inverse dynamics problem, essential for real-time dynamic control and simulation of robot manipulators, undergoing development. Enables exploitation of high degree of parallelism and, achievement of significant computational efficiency, while minimizing various communication and synchronization overheads as well as complexity of required computer architecture. Universal real-time robotic controller and simulator (URRCS) consists of internal host processor and several SIMD processors with ring topology. Architecture modular and expandable: more SIMD processors added to match size of problem. Operate asynchronously and in MIMD fashion.

Fijany, Amir↗
NASA NTRS1982

Applications of perturbation techniques

Two perturbation techniques were applied to two singular perturbation problems in heat transfer to obtain uniformly valid solutions which can serve as benchmarks for finite difference and finite element techniques. In the first problem, the method of strained parameters coupled with the application of a solvability condition is used to obtain a uniform solution for the problem of unsteady heat conduction in a long nearly circular cylinder. In the second problem, the method of matched asymptotic expansion coupled with Van Dyke's matching principle is used to obtain a uniform solution for the problem of one dimensional conduction-convection heat transfer of a uniform fluid flow.

Kandil, O. A.↗
NASA NTRS1974

Ground testing and simulation. II - Aerodynamic testing and simulation: Saving lives, time, and money

The present work discusses in general terms the various kinds of ground facilities, in particular, wind tunnels, which support aerodynamic testing. Since not all flight parameters can be simulated simultaneously, an important problem consists in matching parameters. It is pointed out that there is a lack of wind tunnels for a complete Reynolds-number simulation. Using a computer to simulate flow fields can result in considerable reduction of wind-tunnel hours required to develop a given flight vehicle.

Dayman, B., Jr.↗
NASA NTRS1977

Equations of state and impact-induced shock-wave attenuation on the moon

Equation of state formulations are considered in a framework that permits comparison with one-dimensional impedance match solutions. The problem considered is the peak pressures attained along the impact symmetry axis when a sphere impacts with a half-space. The regimes of melting and vaporization - in particular, incipiently melted, completely melted, incipiently vaporized, and completely vaporized states - are examined, and the pressures at which critical isentropes intersect the Hugoniots of iron and gabbroic anorthosite are considered. A means of representing the spatial attenuation of shock pressure along the impact axis by two regimes is introduced, and results for the near-field and far-field regime are presented. It is thought that the treatment can be used to obtain quantitative bounds on the impact velocity of the meteorite.

Ahrens, T. J.↗
NASA NTRS1978

Acceleration sensitivity compensation in high performance crystal oscillators

Two approaches to achieving reduced acceleration sensitivity of crystal oscillators are discussed. The first involves electronic compensation within the frequency control loop. The second utilizes two resonators of comparable acceleration sensitivity to compensate each other. Problems encountered in matching and tuning the resonators are discussed, as well as orientation symmetry of the frequency deviation patterns. Results on frequency stability which reflect an improved static sensitivity are presented.

Emmons, D. A.↗
NASA NTRS1990

Bridge feedback for active damping augmentation

A method is described for broadband damping augmentation of a structural system in which the active members (with feedback control) were developed such that their mechanical input impedance can be electrically adjusted to maximize the energy dissipation rate in the structural system. The active member consists of sensors, an actuator, and a control scheme. A mechanical/electrical analogy is described to model the passive structures and the active members in terms of their impedance representation. As a result, the problem of maximizing dissipative power is analogous to the problem of impedance matching in the electrical network. Closed-loop performance was demonstrated for single- and multiple-active-member controlled truss structure.

Chen, G.-S.↗
NASA NTRS1992

Planning, scheduling, and control for automatic telescopes

This paper presents an argument for the appropriateness of Entropy Reduction Engine (ERE) technology to the planning, scheduling, and control components of Automatic Photoelectric Telescope (APT) management. The paper is organized as follows. In the next section, we give a brief summary of the planning and scheduling requirements for APTs. Following this, in section 3, we give an ERE project precis, couched primarily in terms of project objectives. Section 4 gives a sketch of the match-up between problem and technology, and section 5 outlines where we want to go with this work.

Drummond, Mark↗
NASA NTRS1990

Mathematical theory of a relaxed design problem in structural optimization

Various attempts have been made to construct a rigorous mathematical theory of optimization for size, shape, and topology (i.e. layout) of an elastic structure. If these are represented by a finite number of parametric functions, as Armand described, it is possible to construct an existence theory of the optimum design using compactness argument in a finite dimensional design space or a closed admissible set of a finite dimensional design space. However, if the admissible design set is a subset of non-reflexive Banach space such as L(sup infinity)(Omega), construction of the existence theory of the optimum design becomes suddenly difficult and requires to extend (i.e. generalize) the design problem to much more wider class of design that is compatible to mechanics of structures in the sense of variational principle. Starting from the study by Cheng and Olhoff, Lurie, Cherkaev, and Fedorov introduced a new concept of convergence of design variables in a generalized sense and construct the 'G-Closure' theory of an extended (relaxed) optimum design problem. A similar attempt, but independent in large extent, can also be found in Kohn and Strang in which the shape and topology optimization problem is relaxed to allow to use of perforated composites rather than restricting it to usual solid structures. An identical idea is also stated in Murat and Tartar using the notion of the homogenization theory. That is, introducing possibility of micro-scale perforation together with the theory of homogenization, the optimum design problem is relaxed to construct its mathematical theory. It is also noted that this type of relaxed design problem is perfectly matched to the variational principle in structural mechanics.

Kikuchi, Noboru↗
NASA NTRS2011

Stage Cylindrical Immersive Display

Panoramic images with a wide field of view intend to provide a better understanding of an environment by placing objects of the environment on one seamless image. However, understanding the sizes and relative positions of the objects in a panorama is not intuitive and prone to errors because the field of view is unnatural to human perception. Scientists are often faced with the difficult task of interpreting the sizes and relative positions of objects in an environment when viewing an image of the environment on computer monitors or prints. A panorama can display an object that appears to be to the right of the viewer when it is, in fact, behind the viewer. This misinterpretation can be very costly, especially when the environment is remote and/or only accessible by unmanned vehicles. A 270 cylindrical display has been developed that surrounds the viewer with carefully calibrated panoramic imagery that correctly engages their natural kinesthetic senses and provides a more accurate awareness of the environment. The cylindrical immersive display offers a more natural window to the environment than a standard cubic CAVE (Cave Automatic Virtual Environment), and the geometry allows multiple collocated users to simultaneously view data and share important decision-making tasks. A CAVE is an immersive virtual reality environment that allows one or more users to absorb themselves in a virtual environment. A common CAVE setup is a room-sized cube where the cube sides act as projection planes. By nature, all cubic CAVEs face a problem with edge matching at edges and corners of the display. Modern immersive displays have found ways to minimize seams by creating very tight edges, and rely on the user to ignore the seam. One significant deficiency of flat-walled CAVEs is that the sense of orientation and perspective within the scene is broken across adjacent walls. On any single wall, parallel lines properly converge at their vanishing point as they should, and the sense of perspective within the scene contained on only one wall has integrity. Unfortunately, parallel lines that lie on adjacent walls do not necessarily remain parallel. This results in inaccuracies in the scene that can distract the viewer and subtract from the immersive experience of the CAVE.

Abramyan, Lucy↗
NASA NTRS1972

Singular perturbations in the state regulator problem

Most of the results of singular perturbation theory have been concerned with initial value problems whereas optimal control problems are of two-point boundary value type. The portions of this theory applicable to the open loop state regulator problem are reviewed. For obtaining approximate solutions to the state regulator problem the method of matched asymptotic expansions is employed. This method has been developed in connection with certain fluid mechanics problems and is applicable to nonlinear as well as linear problems. It has been found in the past to be advantageous not to formulate this method generally but to apply it to each individual problem and this approach is adopted here. A general recipe for the method is given and its application is illustrated by using the method to obtain an approximate solution to a simple, specific state regulator problem.

Ardema, M. D.↗
NASA NTRS2004

Termination Proofs for String Rewriting Systems via Inverse Match-Bounds

Annotating a letter by a number, one can record information about its history during a reduction. A string rewriting system is called match-bounded if there is a global upper bound to these numbers. In earlier papers we established match-boundedness as a strong sufficient criterion for both termination and preservation of regular languages. We show now that the string rewriting system whose inverse (left and right hand sides exchanged) is match-bounded, also have exceptional properties, but slightly different ones. Inverse match-bounded systems effectively preserve context-free languages; their sets of normalized strings and their sets of immortal strings are effectively regular. These sets of strings can be used to decide the normalization, the termination and the uniform termination problems of inverse match-bounded systems. We also show that the termination problem is decidable in linear time, and that a certain strong reachability problem is deciable, thus solving two open problems of McNaughton's.

Butler, Ricky↗
NASA NTRS1988

Using AGNESS (A Generalized Network-based Expert System Shell) for matching images

The image correspondence problem is considered the most difficult step in both stereo and motion analysis. Stereo vision is useful in determining the 3-D positions of points on visible surface in a scene. Motion analysis is useful in determining the spatial and temporal relationships of objects in an environment. Besides stereo and motion analysis, there is the image correspondence problem. Most of this work is based on point or local area properties of the observed gray level values in 2-D images. A global and general approach to this problem is described by using a knowledge-based system. The knowledge it uses consists of both physical properties and spatial relationships of the edges and regions extracted from the given images. The physical component depends on features of the edge or region) in isolation. The spatial component involves the set of edges and regions adjacent to a given edge (or region) of the first image and the set of edges and regions adjacent to each potentially matching edge (or region) of the second image; thus the spatial context of each edge or region is considered. A computational network is used to represent this knowledge, it allows the computation of the likelihood of matching two edges or regions with logical and heuristic operators. An expert system shell called AGNESS (A Generalized Network-based Expert System Shell) is used to build a prototype system.

Pong, Ting-Chuen↗