Open Access. Powered by Scholars. Published by Universities.®

Electrical and Computer Engineering Commons™

Open Access. Powered by Scholars. Published by Universities.®

Optimization

Discipline
Institution
Publication Year
Publication
Publication Type

Articles 331 - 343 of 343

Full-Text Articles in Electrical and Computer Engineering

Trigonometric Transforms For Image Reconstruction, Thomas M. Foltz Jun 1998

Trigonometric Transforms For Image Reconstruction, Thomas M. Foltz

Theses and Dissertations

This dissertation demonstrates how the symmetric convolution-multiplication property of discrete trigonometric transforms can be applied to traditional problems in image reconstruction with slightly better performance than Fourier techniques and increased savings in computational complexity for symmetric point spread functions. The fact that the discrete Fourier transform a circulant matrix provides an alternate way to derive the symmetric convolution-multiplication property for discrete trigonometric transforms. Derived in this manner, the symmetric convolution-multiplication property extends easily to multiple dimensions and generalizes to multidimensional asymmetric sequences. The symmetric convolution-multiplication property allows for linear filtering of degraded images via point-by-point multiplication in the transform domain …

Go to article

A Game-Theoretic Improvement Model For Stochastic Networks: Reliability Vs. Throughput, Jeffrey A. Schavland Mar 1998

A Game-Theoretic Improvement Model For Stochastic Networks: Reliability Vs. Throughput, Jeffrey A. Schavland

Theses and Dissertations

Prescriptive models used to allocate resources for network improvement traditionally have used reliability or flow as Measures of Effectiveness (MOEs). Such metrics do not give value to efforts which make a component more difficult to exploit. This study developed an entirely new MOE for stochastic network improvement, flow damage utility, which uses a two person, zero-sum, non-cooperative game to optimize a probabilistic network for an estimate of expected flow minus performance degradation after a worst case component loss. A multiple criteria optimization problem that uses flow damage utility and an analogous, previously developed metric for the reliability problem is used …

Go to article

A Comparative Analysis Of Networks Of Workstations And Massively Parallel Processors For Signal Processing, David C. Gindhart Dec 1997

A Comparative Analysis Of Networks Of Workstations And Massively Parallel Processors For Signal Processing, David C. Gindhart

Theses and Dissertations

The traditional approach to parallel processing has been to use Massively Parallel Processors (MPPs). An alternative design is commercial-off-the-shelf (COTS) workstations connected to high-speed networks. These networks of workstations (NOWs) typically have faster processors, heterogeneous environments, and most importantly, offer a lower per node cost. This thesis compares the performance of MPPs and NOWs for the two-dimensional fast Fourier transform (2-D FFT). Three original, high-performance, portable 2-D FFTs have been implemented: the vector-radix, row-column and pipeline. The performance of these algorithms was measured on the Intel Paragon, IBM SP2 and the AFIT NOW, which consists of 6 Sun Ultra workstations …

Go to article

Secondary Data Support And Non-Homogeneities In Space-Time Adaptive Processing, Todd B. Hale Dec 1997

Secondary Data Support And Non-Homogeneities In Space-Time Adaptive Processing, Todd B. Hale

Theses and Dissertations

One of the primary problems with the application of Space-Time Adaptive Processing (STAP) techniques is secondary data support for the interference plus noise covariance matrix estimate. Reed has shown the required secondary data support to achieve performance within 3 dB of optimal SINR is approximately equal to twice the degrees of freedom (DOF) used in the algorithm. Reed proved this rule for Sample Matrix Inversion (SMI) techniques. A concern arises when applying this rule to a newer class of reduced dimension STAP algorithms that do not fall under the SMI umbrella. This thesis focuses on the Cross Spectral Metric (CSM) …

Go to article

A Wire Antenna Designed For Space Wave Radiation Over The Earth Using A Genetic Algorithm, Brian S. Sandlin Dec 1997

A Wire Antenna Designed For Space Wave Radiation Over The Earth Using A Genetic Algorithm, Brian S. Sandlin

Theses and Dissertations

A wire antenna is designed for optimal performance at low elevation angles in the presence of a lossy half-space. A simple genetic algorithm (GA) and GENOCOP III software are each integrated with Numerical Electromagnetics Code Version 4.1 (NEC4.1) to optimize a wire antenna geometry for multiple objectives: power gain, azimuthal symmetry, and input impedance. The performance of the two versions of the integrated GA are compared. Several of the resulting antennas are analyzed, and an antenna is proposed for use in a Remote Intrusion Monitoring System (RIMS). Simulations suggest that the proposed antenna, which is well-matched, offers a significant increase …

Go to article

Effects Of Near-Field Scatterers On Space-Time Adaptive Processing, Jonathan W. Fitton Dec 1997

Effects Of Near-Field Scatterers On Space-Time Adaptive Processing, Jonathan W. Fitton

Theses and Dissertations

Near-field scatterers, such as the wing of an airplane, can affect the ability of the processor to null out clutter and jammer signals. The target, clutter, and jammer signals will reflect off the near-field scatterers into the array and appear to be coming from a direction different from their true sources. This thesis develops a theoretical model for the direct path and scattered path signals from the target, clutter, and jamming signals. The optimum weight vector, normally computed using the steering vector to the target and the covariance matrix of the undesired signals, must now include the effects of the …

Go to article

Adaptive Critic Designs, Danil V. Prokhorov, Donald C. Wunsch Sep 1997

Adaptive Critic Designs, Danil V. Prokhorov, Donald C. Wunsch

Electrical and Computer Engineering Faculty Research & Creative Works

We discuss a variety of adaptive critic designs (ACDs) for neurocontrol. These are suitable for learning in noisy, nonlinear, and nonstationary environments. They have common roots as generalizations of dynamic programming for neural reinforcement learning approaches. Our discussion of these origins leads to an explanation of three design families: heuristic dynamic programming, dual heuristic programming, and globalized dual heuristic programming (GDHP). The main emphasis is on DHP and GDHP as advanced ACDs. We suggest two new modifications of the original GDHP design that are currently the only working implementations of GDHP. They promise to be useful for many engineering applications …

Go to article

A Fuzzy Based Load Model For Power System Direct Load Control, K. Bhattacharyya, Mariesa Crow Sep 1995

A Fuzzy Based Load Model For Power System Direct Load Control, K. Bhattacharyya, Mariesa Crow

Electrical and Computer Engineering Faculty Research & Creative Works

Demand side management programs are strategies designed to alter the shape of the load curve. In order to successfully implement such a strategy, customer acceptance of the program is vital. It is thus desirable to design a model for direct load control which may accommodate customer preferences. This paper presents a methodology for optimizing both customer satisfaction and utility unit commitment savings, based on a fuzzy load model for the direct load control of appliances.

Go to article

Microwave Detection Optimization Of Disbond In Layered Dielectrics With Varying Thickness, Stoyan I. Ganchev, Nasser N. Qaddoumi, Emarit Ranu, R. Zoughi Apr 1995

Microwave Detection Optimization Of Disbond In Layered Dielectrics With Varying Thickness, Stoyan I. Ganchev, Nasser N. Qaddoumi, Emarit Ranu, R. Zoughi

Electrical and Computer Engineering Faculty Research & Creative Works

The detection sensitivity optimization of air disbond in layered dielectric composites, using an open-ended rectangular waveguide, is studied both theoretically and experimentally. The sensitivity of the disbond detection is strongly influenced by the proper choice of parameters such as the operating frequency and the layered composite geometry (conductor backed or terminated by an infinite half-space of air). The capability of optimizing the measurement system parameters to detect and estimate the thickness of a disbonded layer independent of some changes in the thickness of the dielectric coating is also demonstrated. The impact of the parameters influencing detection optimization is theoretically investigated …

Go to article

Applying Neural Networks To Find The Minimum-Cost Coverage Of A Boolean Function, Pong P. Chu Jan 1995

Applying Neural Networks To Find The Minimum-Cost Coverage Of A Boolean Function, Pong P. Chu

Electrical and Computer Engineering Faculty Publications

To find a minimal expression of a boolean function includes a step to select the minimum cost cover from a set of implicants. Since the selection process is an NP-complete problem, to find an optimal solution is impractical for large input data size. Neural network approach is used to solve this problem. We first formalize the problem, and then define an ''energy function'' and map it to a modified Hopfield network, which will automatically search for the minima. Simulation of simple examples shows the proposed neural network can obtain good solutions most of the time.

Go to article

The Application Of Neural Networks To Optimal Robot Trajectory Planning, Daniel J. Simon May 1993

The Application Of Neural Networks To Optimal Robot Trajectory Planning, Daniel J. Simon

Electrical and Computer Engineering Faculty Publications

Interpolation of minimum jerk robot joint trajectories through an arbitrary number of knots is realized using a hardwired neural network. Minimum jerk joint trajectories are desirable for their similarity to human joint movements and their amenability to accurate tracking. The resultant trajectories are numerical rather than analytic functions of time. This application formulates the interpolation problem as a constrained quadratic minimization problem over a continuous joint angle domain and a discrete time domain. Time is discretized according to the robot controller rate. The neuron outputs define the joint angles (one neuron for each discrete value of time) and the Lagrange …

Go to article

Optimized Cross Correlation Waveforms For First Order Correlation Loops, Kurt Louis Kosbar Sep 1990

Optimized Cross Correlation Waveforms For First Order Correlation Loops, Kurt Louis Kosbar

Electrical and Computer Engineering Faculty Research & Creative Works

In this work, the steady state mean square tracking error of first order correlation loops is minimized by varying the locally generated cross correlation function produced by the voltage controlled oscillator. This analysis should assist in the design of modified first order delay locked loops used for pseudonoise code synchronization in direct sequence spread spectrum receivers. The optimum cross correlation waveform is generated by filtering a replica of the originally transmitted signal. The optimal filter imposes a 90 degree phase shift at all frequencies and has an amplitude response that is a function of the channel signal to noise ratio. …

Go to article

Two-Step Optimal Thermal Generation Scheduling, B Fardanesh, F. Eugenio Villaseca May 1986

Two-Step Optimal Thermal Generation Scheduling, B Fardanesh, F. Eugenio Villaseca

Electrical and Computer Engineering Faculty Publications

A new approach to the solution of the optimal thermal generation scheduling problem is presented. The problem is solved in two steps. As a first step, the optimal production schedule for the next day is obtained based on a daily load forecast, reserve capacity requirements, and present status of generating units. The second-step algorithm uses the results of the first step and adjusts the previous schedule to meet new constraints developed during the course of the day. Variable truncation dynamic programming is proposed as a new method to reduce computation effort. To eliminate the need for solving the …

Go to article

First Prev