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

Engineering Commons

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

Articles 1 - 4 of 4

Full-Text Articles in 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 …


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 …


An Airlift Hub-And-Spoke Location-Routing Model With Time Windows: Case Study Of The Conus-To-Korea Airlift Problem, David W. Cox Mar 1998

An Airlift Hub-And-Spoke Location-Routing Model With Time Windows: Case Study Of The Conus-To-Korea Airlift Problem, David W. Cox

Theses and Dissertations

Traditionally, the United States Air Force's Air Mobility Command (AMC) has used the concept of direct delivery to airlift cargo and passengers from a point of embarkation to a point of debarkation. This study develops an alternative hub-and-spoke combined location-routing integer linear programming prototype model, and uses this model to determine what advantages a hub-and-spoke system offers, and in which scenarios it is better-suited than the direct delivery method. Additionally, the analysis suggests that the C-17 may be better-suited, in certain airlift situations, for theater airlift versus strategic (direct delivery) airlift. The model features the following elements: time windows, cargo …


The Application Of Sequential Convex Programming To Large-Scale Structural Optimization Problems, Todd A. Sriver Mar 1998

The Application Of Sequential Convex Programming To Large-Scale Structural Optimization Problems, Todd A. Sriver

Theses and Dissertations

Structural design problems are often modeled using finite element methods. Such models are often characterized by constraint functions that are not explicitly defined in terms of the design variables. These functions are typically evaluated through numerical finite element analysis (FEA). Optimizing large-scale structural design models requires computationally expensive FEAs to obtain function and gradient values. An optimization approach which uses the SCP sequential convex programming algorithm of Zillober, integrated as the optimizer in the Automated Structural Optimization System (ASTROS), is tested. The traditional approach forms an explicitly defined approximate subproblem at each design iteration that is solved using the method …