Physical Sciences and Mathematics Commons^™

Deep Learning And Optimization In Visual Target Tracking, Mohammadreza Javanmardi

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

Visual tracking is the process of estimating states of a moving object in a dynamic frame sequence. It has been considered as one of the most paramount and challenging topics in computer vision. Although numerous tracking methods have been introduced, developing a robust algorithm that can handle different challenges still remains unsolved. In this dissertation, we introduce four different trackers and evaluate their performance in terms of tracking accuracy on challenging frame sequences. Each of these trackers aims to address the drawbacks of their peers. The first developed method is called a structured multi-task multi-view tracking (SMTMVT) method, which exploits …

Micro Grid Control Optimization With Load And Solar Prediction, Shaju Saha

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

Using renewable energy can save money and keep the environment cleaner. Installing a solar PV system is a one-time cost but it can generate energy for a lifetime. Solar PV does not generate carbon emissions while producing power. This thesis evaluates the value of being able to make accurate predictions in the use of solar energy. It uses predicted solar power and load for a system and a battery to store the energy for future use and calculates the operating cost or profit in several designed conditions. Various factors like a different place, tuning the capacity of sources, changing buy/sell …

Multi-Stop Routing Optimization: A Genetic Algorithm Approach, Abbas Hommadi

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

In this research, we investigate and propose new operators to improve Genetic Algorithm’s performance to solve the multi-stop routing problem. In a multi-stop route, a user starts at point x, visits all destinations exactly once, and then return to the same starting point. In this thesis, we are interested in two types of this problem. The first type is when the distance among destinations is fixed. In this case, it is called static traveling salesman problem. The second type is when the cost among destinations is affected by traffic congestion. Thus, the time among destinations changes during the day. In …

Optimizing Barrier Removal To Restore Connectivity In Utah’S Weber Basin, Maggi Kraft

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

River barriers, such as dams, culverts and diversions are important for water conveyance, but disrupt river ecosystems and hydrologic processes. River barrier removal is increasingly used to restore and improve river habitat and connectivity. Most past barrier removal projects prioritized individual barriers using score-and-rank techniques, neglecting the spatial structure and cumulative change from multiple barrier removals. Similarly, most water demand models satisfy human water uses or, only prioritize aquatic habitat, failing to include both human and environmental water use benefits. In this study, a dual objective optimization model identified in-stream barriers that impede quality-weighted aquatic habitat connectivity for Bonneville cutthroat …

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 …

Design Optimization Using Model Estimation Programming, Richard Kay Brimhall

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

Model estimation programming provides a method for obtaining extreme solutions subject to constraints. Functions which are continuous with continuous first and second derivatives in the neighborhood of the solution are approximated using quadratic polynomials (termed estimating functions) derived from computed or experimental data points. Using the estimating functions, an approximation problem is solved by a numerical adaptation of the method of Lagrange. The method is not limited by the concavity of the objective function.

Beginning with an initial array of data observations, an initial approximate solution is obtained. Using this approximate solution as a new datum point, the coefficients for …