Physical Sciences and Mathematics Commons^™

Geometric Algorithms For Modeling Plant Roots From Images, Dan Zeng

McKelvey School of Engineering Graduate Student Theses & Dissertations

Roots, considered as the ”hidden half of the plant”, are essential to a plant’s health and pro- ductivity. Understanding root architecture has the potential to enhance efforts towards im- proving crop yield. In this dissertation we develop geometric approaches to non-destructively characterize the full architecture of the root system from 3D imaging while making com- putational advances in topological optimization. First, we develop a global optimization algorithm to remove topological noise, with applications in both root imaging and com- puter graphics. Second, we use our topology simplification algorithm, other methods from computer graphics, and customized algorithms to develop a high-throughput …

Debiasing Cyber Incidents – Correcting For Reporting Delays And Under-Reporting, Seema Sangari

Doctor of Data Science and Analytics Dissertations

This research addresses two key problems in the cyber insurance industry – reporting delays and under-reporting of cyber incidents. Both problems are important to understand the true picture of cyber incident rates. While reporting delays addresses the problem of delays in reporting due to delays in timely detection, under-reporting addresses the problem of cyber incidents frequently under-reported due to brand damage, reputation risk and eventual financial impacts.

The problem of reporting delays in cyber incidents is resolved by generating the distribution of reporting delays and fitting modeled parametric distributions on the given domain. The reporting delay distribution was found to …

Abm Simulation Model Of A Pandemic For Optimizing Vaccination Strategy, Gibeom Park

Theses and Dissertations

This study presents a process-oriented hybrid model for individuals' immune responses and interactions involving vaccination to describe the trend of contagious disease and estimate the future societal cost. The model considers "recovery" as a non-absorbing state and incorporates various infection stage states including two symptomatic states. To model contagiousness to be consistent with the current pandemic and include that the spread of a disease depends on the mobility of people, we developed an Agent-Based Simulator that fitted to the particular model used in this study and can test various what-if scenarios. We improved the simulator considerably by appying data structures …

Development Of A Reverse Engineered, Parameterized, And Structurally Validated Computational Model To Identify Design Parameters That Influence American Football Faceguard Performance, William Ferriell

All Dissertations

Traumatic brain injury (TBI) continues to have the greatest incidence among athletes participating in American football. The headgear design research community has focused on developing accurate computational and experimental analysis techniques to better assess the ability of headgear technology to attenuate impacts and protect athletes from TBI. Despite efforts to innovate the headgear system, minimal progress has been made to innovate the faceguard. Although the faceguard is not the primary component of the headgear system that contributes to impact attenuation, faceguard performance metrics, such as weight, structural stiffness, and visual field occlusions, have been linked to athlete safety. To improve …

Optimization Of Quantum Circuits Using Spin Bus Multiqubit Gates For Quantum Dots, Miguel Gonzalo Rodriguez

Open Access Theses & Dissertations

The current conventional method for designing quantum circuits is to employ a number of single- and two-qubit gates, which often necessitate a lengthy sequence, imposing severe constraints on quantum coherence and quantum circuit complexity. Coupling multiple spin qubits to a common spin chain can result in a generically multiqubit gate. It is demonstrated that the multiqubit gate can substantially reduce the depth of quantum circuits and establish multiqubit entanglement considerably more quickly.

Tempering The Adversary: An Exploration Into The Applications Of Game Theoretic Feature Selection And Regression, Stephen Mcgee

All Dissertations

Most modern machine learning algorithms tend to focus on an "average-case" approach, where every data point contributes the same amount of influence towards calculating the fit of a model. This "per-data point" error (or loss) is averaged together into an overall loss and typically minimized with an objective function. However, this can be insensitive to valuable outliers. Inspired by game theory, the goal of this work is to explore the utility of incorporating an optimally-playing adversary into feature selection and regression frameworks. The adversary assigns weights to the data elements so as to degrade the modeler's performance in an optimal …

Development Of A Hybrid System Based On Abc Algorithm For Selection Of Appropriate Parameters For Disease Diagnosis From Ecg Signals, Ersi̇n Ersoy, Gazi̇ Erkan Bostanci, Mehmet Serdar Güzel

Turkish Journal of Electrical Engineering and Computer Sciences

The number of people who die due to cardiovascular diseases is quite high. In our study, ECG (electrocar-diogram) signals were divided into segments and waves based on temporal boundaries. Signal similarity methods such as convolution, correlation, covariance, signal peak to noise ratio (PNRS), structural similarity index (SSIM), one of the basic statistical parameters, arithmetic mean and entropy were applied to each of these sections. In addition, a square error-based new approach was applied and the difference of the signs from the mean sign was taken and used as a feature vector. The obtained feature vectors are used in the artificial …

Enhancing A Qubo Solver Via Data Driven Multi-Start And Its Application To Vehicle Routing Problem, Whei Yeap Suen, Matthieu Parizy, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Quadratic unconstrained binary optimization (QUBO) models have garnered growing interests as a strong alternative modelling framework for solving combinatorial optimization problems. A wide variety of optimization problems that are usually studied using conventional Operations Research approaches can be formulated as QUBO problems. However, QUBO solvers do not guarantee optimality when solving optimization problems. Instead, obtaining high quality solutions using QUBO solvers entails tuning of multiple parameters. Here in our work, we conjecture that the initial states adjustment method used in QUBO solvers can be improved, where careful tuning will yield overall better results. We propose a data-driven multi-start algorithm that …

Development Of Software Tools For Efficient And Sustainable Process Development And Improvement, Jake P. Stengel

Theses and Dissertations

Infrastructure is a key component in the well-being of our society that leads to its growth, development, and productive operations. A well-built infrastructure allows the community to be more competitive and promotes economic advancement. In 2021, the ASCE (American Society of Civil Engineers) ranked the American infrastructure as substandard, with an overall grade of C-. The overall ranking suffers when key infrastructure categories are not maintained according to the needs of the population. Therefore, there is a need to consider alternative methods to improve our infrastructure and make it more sustainable to enhance the overall grade. One of the challenges …

Comparing Learned Representations Between Unpruned And Pruned Deep Convolutional Neural Networks, Parker Mitchell

Master's Theses

While deep neural networks have shown impressive performance in computer vision tasks, natural language processing, and other domains, the sizes and inference times of these models can often prevent them from being used on resource-constrained systems. Furthermore, as these networks grow larger in size and complexity, it can become even harder to understand the learned representations of the input data that these networks form through training. These issues of growing network size, increasing complexity and runtime, and ambiguity in the understanding of internal representations serve as guiding points for this work.

In this thesis, we create a neural network that …

An Adaptive Search Equation-Based Artificial Bee Colony Algorithm For Transportation Energy Demand Forecasting, Durmuş Özdemi̇r, Safa Dörterler

Turkish Journal of Electrical Engineering and Computer Sciences

This study aimed to develop a new adaptive artificial bee colony (A-ABC) algorithm that can adaptively select an appropriate search equation to more accurately estimate transport energy demand (TED). Also, A-ABC and canonical artificial bee colony (C-ABC) algorithms were compared in terms of efficiency and performance. The input parameters used in the proposed TED model were the official economic indicators of Turkey, including gross domestic product (GDP), population, and total vehicle kilometer per year (TKM). Three mathematical models, linear (A-ABCL), exponential (A-ABCE), and quadratic (A-ABCQ) were developed and tested. Also, economic variables were generated using the "curve fitting" technique to …

Autonomous Eco-Driving With Traffic Light And Lead Vehicle Constraints: An Application Of Best Constrained Interpolation, Yara Hazem Mohamed Mahmoud

Masters Theses

Eco-Driving is a critical technology for improving automotive transportation efficiency. It is achieved by modifying the driving trajectory over a particular route to minimize required propulsion energy. Eco-Driving can be approached as an optimal control problem subject to driving constraints such as traffic lights and positions of other vehicles. Best interpolation in a strip is a problem in approximation theory and optimal control. The solution to this problem is a cubic spline. In this research we demonstrate the connection between Eco-Driving and best interpolation in the strip. By exploiting this connection, we are able to generate optimal Eco-Driving trajectories that …

An Optimization Model For Minimization Of Systemic Risk In Financial Portfolios, Zachary Alexander Gelber

Master's Theses

In this thesis, we study how sovereign credit default swaps are able to measure systemic risk as well as how they can be used to construct optimal portfolios to minimize risk. We define the clustering coefficient as a proxy for systemic risk and design an optimization problem with the goal of minimizing the mean absolute deviation of the clustering coefficient on a group of nine European countries. Additionally, we define a metric we call the diversity score that measures the diversification of any given portfolio. We solve this problem for a baseline set of parameters, then spend the remainder of …

Complete Neighbourhood Search Heuristic Algorithm For Portfolio Optimization, Collether John

Tanzania Journal of Engineering and Technology (TJET)

In portfolio optimization, the fundamental goal of an investor is to optimally allocate investments between different assets. Mean-variance optimization methods make unrealistic assumptions to solve the problem of optimal allocation. On the other hand, when realistic constraints like holding size and cardinality are introduced it leads to optimal asset allocation which differ from the mean variance optimization. The resulting optimization problem become quite complex as it exhibits multiple local extrema and discontinuities. Heuristic algorithms work well for the complex problem. Therefore, a heuristic algorithm is developed which is based on hill climbing complete (HC-C). It is utilized to solve the …

On Class Imbalanced Learning:Design Of Non-Parametricclassifiers, Performance Indices, And Deep Oversampling Strategies., Sankha Mullick Dr.

Doctoral Theses

The relevance of classification is almost endless in the everyday application of machine learning. However, the performance of a classifier is only limited to the fulfillment of the inherent assumptions it makes about the training examples. For example, to facilitate unbiased learning a classifier is expected to be trained with an equal number of labeled data instances from all of the classes. However, in a large number of practical applications such as anomaly detection, semantic segmentation, disease prediction, etc. it may not be possible to gather an equal number of diverse training points for all the classes. This results in …

A Surrogate Assisted Quantum-Behaved Algorithm For Well Placement Optimization, Jahedul Islam, Amril Nazir, Moinul Hossain, Hitmi Khalifa Alhitmi, Muhammad Ashad Kabir, Abdul-Halim Jallad

All Works

The oil and gas industry faces difficulties in optimizing well placement problems. These problems are multimodal, non-convex, and discontinuous in nature. Various traditional and non-traditional optimization algorithms have been developed to resolve these difficulties. Nevertheless, these techniques remain trapped in local optima and provide inconsistent performance for different reservoirs. This study thereby presents a Surrogate Assisted Quantum-behaved Algorithm to obtain a better solution for the well placement optimization problem. The proposed approach utilizes different metaheuristic optimization techniques such as the Quantum-inspired Particle Swarm Optimization and the Quantum-behaved Bat Algorithm in different implementation phases. Two complex reservoirs are used to investigate …

Multi-Agent Pathfinding In Mixed Discrete-Continuous Time And Space, Thayne T. Walker

Electronic Theses and Dissertations

In the multi-agent pathfinding (MAPF) problem, agents must move from their current locations to their individual destinations while avoiding collisions. Ideally, agents move to their destinations as quickly and efficiently as possible. MAPF has many real-world applications such as navigation, warehouse automation, package delivery and games. Coordination of agents is necessary in order to avoid conflicts, however, it can be very computationally expensive to find mutually conflict-free paths for multiple agents – especially as the number of agents is increased. Existing state-ofthe- art algorithms have been focused on simplified problems on grids where agents have no shape or volume, and …

Stochastic Models Of Jaya And Semi-Steady-State Jaya Algorithms, Uday Chakraborty

Computer Science Faculty Works

The Jaya algorithm and its variants have enjoyed great success in diverse application areas, but no theoretical analysis of the algorithm, to our knowledge, is available in the literature. In this paper we build stochastic models for analyzing Jaya and semi-steady-state Jaya algorithms. For these algorithms, the computational cost depends on how, at each iteration, the new individual fares against the existing individual. Costs must be incurred for any replacement of individuals and the subsequent update of the population-worst individual’s (and/or the population-best individual’s) index. We use the following two quantities as the main metrics for analysis: the expected number …

Finding Optimal Cayley Map Embeddings Using Genetic Algorithms, Jacob Buckelew

Honors Program Theses

Genetic algorithms are a commonly used metaheuristic search method aimed at solving complex optimization problems in a variety of fields. These types of algorithms lend themselves to problems that can incorporate stochastic elements, which allows for a wider search across a search space. However, the nature of the genetic algorithm can often cause challenges regarding time-consumption. Although the genetic algorithm may be widely applicable to various domains, it is not guaranteed that the algorithm will outperform other traditional search methods in solving problems specific to particular domains. In this paper, we test the feasibility of genetic algorithms in solving a …

Optimized Cancer Detection On Various Magnified Histopathological Colon Imagesbased On Dwt Features And Fcm Clustering, Tina Babu, Tripty Singh, Deepa Gupta, Shahin Hameed

Turkish Journal of Electrical Engineering and Computer Sciences

Due to the morphological characteristics and other biological aspects in histopathological images, the computerized diagnosis of colon cancer in histopathology images has gained popularity. The images acquired using the histopathology microscope may differ for greater visibility by magnifications. This causes a change in morphological traits leading to intra and inter-observer variability. An automatic colon cancer diagnosis system for various magnification is therefore crucial. This work proposes a magnification independent segmentation approach based on the connected component area and double density dual tree DWT (discrete wavelet transform) coefficients are derived from the segmented region. The derived features are reduced further shortened …

The Use Of Calculus To Determine Efficient Fertilizer Levels For Crop Production, Cole Loadholtz

Undergraduate Journal of Mathematical Modeling: One + Two

For this project, I wanted to incorporate calculus into agriculture and environmental science methods. More in detail, the problem used asked for the maximum levels of nitrogen (N) and phosphorus (P) that would be best for a current crop yield. This allowed incorporating partial derivatives, and critical points to find the maximum values for the equation. The results show that in order to demonstrate maximum crop yield production, the levels of nitrogen (N) and phosphorus (P) were to be both at 2, with the correct corresponding units. The drawback from this problem is that although the problem showed effective nitrogen …

Development And Validation Of A New Rp-Hplc Method For Organic Explosive Compounds, Sali̇h Murat Ünsal, Emre Erkan

Turkish Journal of Chemistry

A new RP-HPLC method was developed and validated to achieve the separation and quantification of the organic explosive compounds such as pentaerythritol tetranitrate (PETN), 1-methyl-2,4,6-trinitro toluen (TNT), picric acid, 1,3,5,7-tetrazocine (HMX), cyclorimethylenetrinitramine (RDX), 2,4,6 Tri nitro phenyl methyl nitramine (Tetryl), 1-methyl-2,4-dinitro toluen (DNT), ethylene glycol dinitrate (EGDN), and trinitroglycerine (TNG) in this study. The mobile phase composition (IPA percentage in water) and the flow rate was optimized for the separation of the organic explosive compounds. Theoretical plate number (N), capacity factor (k'), resolution (Rs) were used to determine the optimum chromatographic conditions. The most favorable conditions were detected as 22% …

Variational Data Assimilation For Two Interface Problems, Xuejian Li

Doctoral Dissertations

“Variational data assimilation (VDA) is a process that uses optimization techniques to determine an initial condition of a dynamical system such that its evolution best fits the observed data. In this dissertation, we develop and analyze the variational data assimilation method with finite element discretization for two interface problems, including the Parabolic Interface equation and the Stokes-Darcy equation with the Beavers-Joseph interface condition. By using Tikhonov regularization and formulating the VDA into an optimization problem, we establish the existence, uniqueness and stability of the optimal solution for each concerned case. Based on weak formulations of the Parabolic Interface equation and …

Residential Demand Side Management Model, Optimization And Future Perspective: A Review, Subhasis Panda, Sarthak Mohanty, Pravat Kumar Rout, Binod Kumar Sahu, Mohit Bajaj, Dr Hossam Zawbaa, Salah Kamel

Articles

The residential load sector plays a vital role in terms of its impact on overall power balance, stability, and efficient power management. However, the load dynamics of the energy demand of residential users are always nonlinear, uncontrollable, and inelastic concerning power grid regulation and management. The integration of distributed generations (DGs) and advancement of information and communication technology (ICT) even though handles the related issues and challenges up to some extent, till the flexibility, energy management and scheduling with better planning are necessary for the residential sector to achieve better grid stability and efficiency. To address these issues, it is …

Distributed Wireless Sensor Node Localization Based On Penguin Searchoptimization, Md Al Shayokh, Soo Young Shin

Turkish Journal of Electrical Engineering and Computer Sciences

Wireless sensor networks (WSNs) have become popular for sensing areas-of-interest and performing assigned tasks based on information on the location of sensor devices. Localization in WSNs is aimed at designating distinct geographical information to the inordinate nodes within a search area. Biologically inspired algorithms are being applied extensively in WSN localization to determine inordinate nodes more precisely while consuming minimal computation time. An optimization algorithm belonging to the metaheuristic class and named penguin search optimization (PeSOA) is presented in this paper. It utilizes the hunting approaches in a collaborative manner to determine the inordinate nodes within an area of interest. …

Genetic Algorighm Representation Selection Impact On Binary Classification Problems, Stephen V. Maldonado

Honors Undergraduate Theses

In this thesis, we explore the impact of problem representation on the ability for the genetic algorithms (GA) to evolve a binary prediction model to predict whether a physical therapist is paid above or below the median amount from Medicare. We explore three different problem representations, the vector GA (VGA), the binary GA (BGA), and the proportional GA (PGA). We find that all three representations can produce models with high accuracy and low loss that are better than Scikit-Learn’s logistic regression model and that all three representations select the same features; however, the PGA representation tends to create lower weights …

Particle Swarm Optimization For Critical Experiment Design, Cole Michael Kostelac

Masters Theses

“Critical experiments are used by nuclear data evaluators and criticality safety engineers to validate nuclear data and computational methods. Many of these experiments are designed to maximize the sensitivity to a certain nuclide-reaction pair in an energy range of interest. Traditionally, a parameter sweep is conducted over a set of experimental variables to find a configuration that is critical and maximally sensitive. As additional variables are added, the total number of configurations increases exponentially and quickly becomes prohibitively computationally expensive to calculate, especially using Monte Carlo methods.

This work presents the development of a particle swarm optimization algorithm to design …

Dynamic Nonlinear Gaussian Model For Inferring A Graph Structure On Time Series, Abhinuv Uppal

CMC Senior Theses

In many applications of graph analytics, the optimal graph construction is not always straightforward. I propose a novel algorithm to dynamically infer a graph structure on multiple time series by first imposing a state evolution equation on the graph and deriving the necessary equations to convert it into a maximum likelihood optimization problem. The state evolution equation guarantees that edge weights contain predictive power by construction. After running experiments on simulated data, it appears the required optimization is likely non-convex and does not generally produce results significantly better than randomly tweaking parameters, so it is not feasible to use in …

Parallel Algorithms For Steiner Forest, Laleh Ghalami

Wayne State University Dissertations

The Steiner Forest Problem is one of the fundamental combinatorial optimization problemsin operations research and computer science. Its applications range from network design to computational biology. Given an undirected graph with non-negative weights for edges and a set of pairs of vertices called terminals, the Steiner Forest Problem is to find the minimum cost subgraph that connects each of the terminal pairs together. The Steiner Forest Problem is APX-hard and NP-hard to approximate within 96/95. Several heuristic and approximation algorithms, with different approximation guarantees, have been proposed for the Steiner Forest Problem. Despite the several research in designing sequential and …

Design, Analysis, And Optimization Of Traffic Engineering For Software Defined Networks, Mohammed Ibrahim Salman

Browse all Theses and Dissertations

Network traffic has been growing exponentially due to the rapid development of applications and communications technologies. Conventional routing protocols, such as Open-Shortest Path First (OSPF), do not provide optimal routing and result in weak network resources. Optimal traffic engineering (TE) is not applicable in practice due to operational constraints such as limited memory on the forwarding devices and routes oscillation. Recently, a new way of centralized management of networks enabled by Software-Defined Networking (SDN) made it easy to apply most traffic engineering ideas in practice. \par Toward creating an applicable traffic engineering system, we created a TE simulator for experimenting …