Physical Sciences and Mathematics Commons^™

Optimal Irrigation Management For Sloping, Blocked-End Borders, Jorge Jose Escurra

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

A robust mathematical model of one-dimensional flow for sloping, blocked-end border irrigation was developed using the four-point implicit method to solve the Saint-Venant equations, the volume-balance solution method, and the implementation of new algorithms to avoid numerical instability and solution divergence. The model has the capability of successfully simulating all surface irrigation phases in blocked-end borders for a range of inflow rates (0.01 - 0.05 m³/s per m), longitudinal slopes (up to 1.00%), and border lengths (100 - 500 m).

To achieve numerical stability over the specified parameter ranges, the model was divided into three parts: (1) advance-phase …

Treatments Of Chlamydia Trachomatis And Neisseria Gonorrhoeae, Ken Kun Zhao

Mathematics Theses

Chlamydia Trachomatis and Neisseria Gonorrhoeae rank as the two most commonly reported sexually transmitted diseases (STDs) in the United States. Under limited budget, publicly funded clinics are not able to screen and treat the two diseases for all patients. They have to make a decision as to which group of population shall go through the procedure for screening and treating the two diseases. Therefore, we propose a cubic integer programming model on maximizing the number of units of cured diseases. At the same time, a two-step algorithm is established to solve the cubic integer program. We further develop a web-server, …

Approximations With Improving Error Bounds For Makespan Minimization In Batch Manufacturing, Whitney Samuel Weyerman

Theses and Dissertations

Multipurpose batch manufacturing systems allow a suite of job types to be processed with a fixed set of machines. These types of systems are commonly found in chemical processing, as well as in computer systems and the service industry. In this thesis we consider the problem of sequencing jobs entering the manufacturing system in order to minimize makespan, or total time to complete processing of the jobs. We formulate this problem as a dynamic programming problem and illustrate the computational difficulty of solving this problem. We give a method for simulation of the system by representing each machine in the …

Some Combinational Optimization Problems On Radio Network Communication And Machine Scheduling, Xin Wang

Dissertations

The combinatorial optimization problems coming from two areas are studied in this dissertation: network communication and machine scheduling.

In the network communication area, the complexity of distributed broadcasting and distributed gossiping is studied in the setting of random networks. Two different models are considered: one is random geometric networks, the main model used to study properties of sensor and ad-hoc networks, where ri points are randomly placed in a unit square and two points are connected by an edge if they are at most a certain fixed distance r from each other. The other model is the so-called line-of-sight networks, …

Evolutionary Methodology For Optimization Of Image Transforms Subject To Quantization Noise, Michael Ray Peterson

Browse all Theses and Dissertations

Lossy image compression algorithms sacrifice perfect imagereconstruction in favor of decreased storage requirements. Modelossy compression schemes, such as JPEG2000, rely upon the discrete wavelet transform (DWT) to achieve high levels of compression while minimizing the loss of information for image reconstruction. Some compression applications require higher levels of compression than those achieved through application of the DWT and entropy coding. In such lossy systems, quantization provides high compression rates at the cost of increased distortion. Unfortunately, as the amount of quantization increases, the performance of the DWT for accurate image reconstruction deteriorates. Previous research demonstrates that a genetic algorithm can …

Model-Driven Search-Based Loop Fusion Optimization For Handwritten Code, Pamela Bhattacharya

LSU Master's Theses

The Tensor Contraction Engine (TCE) is a compiler that translates high-level, mathematical tensor contraction expressions into efficient, parallel Fortran code. A pair of optimizations in the TCE, the fusion and tiling optimizations, have proven successful for minimizing disk-to-memory traffic for dense tensor computations. While other optimizations are specific to tensor contraction expressions, these two model-driven search-based optimization algorithms could also be useful for optimizing handwritten dense array computations to minimize disk to memory traffic. In this thesis, we show how to apply the loop fusion algorithm to handwritten code in a procedural language. While in the TCE the loop fusion …