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

Physical Sciences and Mathematics Commons

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

Articles 1 - 22 of 22

Full-Text Articles in Physical Sciences and Mathematics

Deep Hybrid Modeling Of Neuronal Dynamics Using Generative Adversarial Networks, Soheil Saghafi May 2023

Deep Hybrid Modeling Of Neuronal Dynamics Using Generative Adversarial Networks, Soheil Saghafi

Dissertations

Mechanistic modeling and machine learning methods are powerful techniques for approximating biological systems and making accurate predictions from data. However, when used in isolation these approaches suffer from distinct shortcomings: model and parameter uncertainty limit mechanistic modeling, whereas machine learning methods disregard the underlying biophysical mechanisms. This dissertation constructs Deep Hybrid Models that address these shortcomings by combining deep learning with mechanistic modeling. In particular, this dissertation uses Generative Adversarial Networks (GANs) to provide an inverse mapping of data to mechanistic models and identifies the distributions of mechanistic model parameters coherent to the data.

Chapter 1 provides background information on …


A Machine Learning Approach For Predicting Clinical Trial Patient Enrollment In Drug Development Portfolio Demand Planning, Ahmed Shoieb May 2023

A Machine Learning Approach For Predicting Clinical Trial Patient Enrollment In Drug Development Portfolio Demand Planning, Ahmed Shoieb

Masters Theses

One of the biggest challenges the clinical research industry currently faces is the accurate forecasting of patient enrollment (namely if and when a clinical trial will achieve full enrollment), as the stochastic behavior of enrollment can significantly contribute to delays in the development of new drugs, increases in duration and costs of clinical trials, and the over- or under- estimation of clinical supply. This study proposes a Machine Learning model using a Fully Convolutional Network (FCN) that is trained on a dataset of 100,000 patient enrollment data points including patient age, patient gender, patient disease, investigational product, study phase, blinded …


Loss Scaling And Step Size In Deep Learning Optimizatio, Nora Alosily Apr 2023

Loss Scaling And Step Size In Deep Learning Optimizatio, Nora Alosily

Dissertations

Deep learning training consumes ever-increasing time and resources, and that is
due to the complexity of the model, the number of updates taken to reach good
results, and both the amount and dimensionality of the data. In this dissertation,
we will focus on making the process of training more efficient by focusing on the
step size to reduce the number of computations for parameters in each update.
We achieved our objective in two new ways: we use loss scaling as a proxy for
the learning rate, and we use learnable layer-wise optimizers. Although our work
is perhaps not the first …


Peer-To-Peer Energy Trading In Smart Residential Environment With User Behavioral Modeling, Ashutosh Timilsina Jan 2023

Peer-To-Peer Energy Trading In Smart Residential Environment With User Behavioral Modeling, Ashutosh Timilsina

Theses and Dissertations--Computer Science

Electric power systems are transforming from a centralized unidirectional market to a decentralized open market. With this shift, the end-users have the possibility to actively participate in local energy exchanges, with or without the involvement of the main grid. Rapidly reducing prices for Renewable Energy Technologies (RETs), supported by their ease of installation and operation, with the facilitation of Electric Vehicles (EV) and Smart Grid (SG) technologies to make bidirectional flow of energy possible, has contributed to this changing landscape in the distribution side of the traditional power grid.

Trading energy among users in a decentralized fashion has been referred …


Design And Analysis Of Strategic Behavior In Networks, Sixie Yu Aug 2022

Design And Analysis Of Strategic Behavior In Networks, Sixie Yu

McKelvey School of Engineering Theses & Dissertations

Networks permeate every aspect of our social and professional life.A networked system with strategic individuals can represent a variety of real-world scenarios with socioeconomic origins. In such a system, the individuals' utilities are interdependent---one individual's decision influences the decisions of others and vice versa. In order to gain insights into the system, the highly complicated interactions necessitate some level of abstraction. To capture the otherwise complex interactions, I use a game theoretic model called Networked Public Goods (NPG) game. I develop a computational framework based on NPGs to understand strategic individuals' behavior in networked systems. The framework consists of three …


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

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 …


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

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 …


Energy Planning Model Design For Forecasting The Final Energy Consumption Using Artificial Neural Networks, Haidy Eissa Dec 2021

Energy Planning Model Design For Forecasting The Final Energy Consumption Using Artificial Neural Networks, Haidy Eissa

Theses and Dissertations

“Energy Trilemma” has recently received an increasing concern among policy makers. The trilemma conceptual framework is based on three main dimensions: environmental sustainability, energy equity, and energy security. Energy security reflects a nation’s capability to meet current and future energy demand. Rational energy planning is thus a fundamental aspect to articulate energy policies. The energy system is huge and complex, accordingly in order to guarantee the availability of energy supply, it is necessary to implement strategies on the consumption side. Energy modeling is a tool that helps policy makers and researchers understand the fluctuations in the energy system. Over the …


Can Parallel Gravitational Search Algorithm Effectively Choose Parameters For Photovoltaic Cell Current Voltage Characteristics?, Alan Kirkpatrick May 2021

Can Parallel Gravitational Search Algorithm Effectively Choose Parameters For Photovoltaic Cell Current Voltage Characteristics?, Alan Kirkpatrick

Honors Projects

This study asks the question “Can parallel Gravitational Search Algorithm (GSA) effectively choose parameters for photovoltaic cell current voltage characteristics?” These parameters will be plugged into the Single Diode Model to create the IV curve. It will also investigate Particle Swarm Optimization (PSO) and a population based random search (PBRS) to see if GSA performs the search better and or more quickly than alternative algorithms


Machine Learning Models For Deciphering Regulatory Mechanisms And Morphological Variations In Cancer, Saman Farahmand May 2021

Machine Learning Models For Deciphering Regulatory Mechanisms And Morphological Variations In Cancer, Saman Farahmand

Graduate Doctoral Dissertations

The exponential growth of multi-omics biological datasets is resulting in an emerging paradigm shift in fundamental biological research. In recent years, imaging and transcriptomics datasets are increasingly incorporated into biological studies, pushing biology further into the domain of data-intensive-sciences. New approaches and tools from statistics, computer science, and data engineering are profoundly influencing biological research. Harnessing this ever-growing deluge of multi-omics biological data requires the development of novel and creative computational approaches. In parallel, fundamental research in data sciences and Artificial Intelligence (AI) has advanced tremendously, allowing the scientific community to generate a massive amount of knowledge from data. Advances …


Scheduling Allocation And Inventory Replenishment Problems Under Uncertainty: Applications In Managing Electric Vehicle And Drone Battery Swap Stations, Amin Asadi Jan 2021

Scheduling Allocation And Inventory Replenishment Problems Under Uncertainty: Applications In Managing Electric Vehicle And Drone Battery Swap Stations, Amin Asadi

Graduate Theses and Dissertations

In this dissertation, motivated by electric vehicle (EV) and drone application growth, we propose novel optimization problems and solution techniques for managing the operations at EV and drone battery swap stations. In Chapter 2, we introduce a novel class of stochastic scheduling allocation and inventory replenishment problems (SAIRP), which determines the recharging, discharging, and replacement decisions at a swap station over time to maximize the expected total profit. We use Markov Decision Process (MDP) to model SAIRPs facing uncertain demands, varying costs, and battery degradation. Considering battery degradation is crucial as it relaxes the assumption that charging/discharging batteries do not …


Catgame: A Tool For Problem Solving In Complex Dynamic Systems Using Game Theoretic Knowledge Distribution In Cultural Algorithms, And Its Application (Catneuro) To The Deep Learning Of Game Controller, Faisal Waris Jan 2020

Catgame: A Tool For Problem Solving In Complex Dynamic Systems Using Game Theoretic Knowledge Distribution In Cultural Algorithms, And Its Application (Catneuro) To The Deep Learning Of Game Controller, Faisal Waris

Wayne State University Dissertations

Cultural Algorithms (CA) are knowledge-intensive, population-based stochastic optimization methods that are modeled after human cultures and are suited to solving problems in complex environments. The CA Belief Space stores knowledge harvested from prior generations and re-distributes it to future generations via a knowledge distribution (KD) mechanism. Each of the population individuals is then guided through the search space via the associated knowledge. Previously, CA implementations have used only competitive KD mechanisms that have performed well for problems embedded in static environments. Relatively recently, CA research has evolved to encompass dynamic problem environments. Given increasing environmental complexity, a natural question arises …


Computational Model For Neural Architecture Search, Ram Deepak Gottapu Jan 2020

Computational Model For Neural Architecture Search, Ram Deepak Gottapu

Doctoral Dissertations

"A long-standing goal in Deep Learning (DL) research is to design efficient architectures for a given dataset that are both accurate and computationally inexpensive. At present, designing deep learning architectures for a real-world application requires both human expertise and considerable effort as they are either handcrafted by careful experimentation or modified from a handful of existing models. This method is inefficient as the process of architecture design is highly time-consuming and computationally expensive.

The research presents an approach to automate the process of deep learning architecture design through a modeling procedure. In particular, it first introduces a framework that treats …


Optimal Sampling Paths For Autonomous Vehicles In Uncertain Ocean Flows, Andrew J. De Stefan Aug 2019

Optimal Sampling Paths For Autonomous Vehicles In Uncertain Ocean Flows, Andrew J. De Stefan

Dissertations

Despite an extensive history of oceanic observation, researchers have only begun to build a complete picture of oceanic currents. Sparsity of instrumentation has created the need to maximize the information extracted from every source of data in building this picture. Within the last few decades, autonomous vehicles, or AVs, have been employed as tools to aid in this research initiative. Unmanned and self-propelled, AVs are capable of spending weeks, if not months, exploring and monitoring the oceans. However, the quality of data acquired by these vehicles is highly dependent on the paths along which they collect their observational data. The …


Gem-Pso: Particle Swarm Optimization Guided By Enhanced Memory, Kevin Fakai Chen May 2019

Gem-Pso: Particle Swarm Optimization Guided By Enhanced Memory, Kevin Fakai Chen

Honors Projects

Particle Swarm Optimization (PSO) is a widely-used nature-inspired optimization technique in which a swarm of virtual particles work together with limited communication to find a global minimum or optimum. PSO has has been successfully applied to a wide variety of practical problems, such as optimization in engineering fields, hybridization with other nature-inspired algorithms, or even general optimization problems. However, PSO suffers from a phenomenon known as premature convergence, in which the algorithm's particles all converge on a local optimum instead of the global optimum, and cannot improve their solution any further. We seek to improve upon the standard Particle Swarm …


Capso: A Multi-Objective Cultural Algorithm System To Predict Locations Of Ancient Sites, Samuel Dustin Stanley Jan 2019

Capso: A Multi-Objective Cultural Algorithm System To Predict Locations Of Ancient Sites, Samuel Dustin Stanley

Wayne State University Dissertations

ABSTRACT

CAPSO: A MULTI-OBJECTIVE CULTURAL ALGORITHM SYSTEM TO PREDICT LOCATIONS OF ANCIENT SITES

by

SAMUEL DUSTIN STANLEY

August 2019

Advisor: Dr. Robert Reynolds

Major: Computer Science

Degree: Doctor of Philosophy

The recent archaeological discovery by Dr. John O’Shea at University of Michigan of prehistoric caribou remains and Paleo-Indian structures underneath the Great Lakes has opened up an opportunity for Computer Scientists to develop dynamic systems modelling these ancient caribou routes and hunter-gatherer settlement systems as well as the prehistoric environments that they existed in. The Wayne State University Cultural Algorithm team has been interested assisting Dr. O’Shea’s archaeological team by …


Optimizing Tensegrity Gaits Using Bayesian Optimization, James Boggs Jun 2018

Optimizing Tensegrity Gaits Using Bayesian Optimization, James Boggs

Honors Theses

We design and implement a new, modular, more complex tensegrity robot featuring data collection and wireless communication and operation as well as necessary accompanying research infrastructure. We then utilize this new tensegrity to assess previous research on using Bayesian optimization to generate effective forward gaits for tensegrity robots. Ultimately, we affirm the conclusions of previous researchers, demonstrating that Bayesian optimization is statistically significantly (p < 0:05) more effective at discovering useful gaits than random search. We also identify several flaws in our new system and identify means of addressing them, paving the way for more effective future research.


Gradient Estimation For Attractor Networks, Thomas Flynn Feb 2018

Gradient Estimation For Attractor Networks, Thomas Flynn

Dissertations, Theses, and Capstone Projects

It has been hypothesized that neural network models with cyclic connectivity may be more powerful than their feed-forward counterparts. This thesis investigates this hypothesis in several ways. We study the gradient estimation and optimization procedures for several variants of these networks. We show how the convergence of the gradient estimation procedures are related to the properties of the networks. Then we consider how to tune the relative rates of gradient estimation and parameter adaptation to ensure successful optimization in these models. We also derive new gradient estimators for stochastic models. First, we port the forward sensitivity analysis method to the …


Investigating Genetic Algorithm Optimization Techniques In Video Games, Nathan Ambuehl Aug 2017

Investigating Genetic Algorithm Optimization Techniques In Video Games, Nathan Ambuehl

Undergraduate Honors Theses

Immersion is essential for player experience in video games. Artificial Intelligence serves as an agent that can generate human-like responses and intelligence to reinforce a player’s immersion into their environment. The most common strategy involved in video game AI is using decision trees to guide chosen actions. However, decision trees result in repetitive and robotic actions that reflect an unrealistic interaction. This experiment applies a genetic algorithm that explores selection, crossover, and mutation functions for genetic algorithm implementation in an isolated Super Mario Bros. pathfinding environment. An optimized pathfinding AI can be created by combining an elitist selection strategy with …


The Impact Of Increased Optimization Problem Dimensionality On Cultural Algorithm Performance, Yang Yang Jan 2015

The Impact Of Increased Optimization Problem Dimensionality On Cultural Algorithm Performance, Yang Yang

Wayne State University Theses

ABSTRACT

The Impact of Increased Optimization Problem Dimensionality on

Cultural Algorithm Performance

by

Yang Yang

August 2015

Advisor: Dr. Robert Reynolds

Major: Computer Science

Degree: Master of Science

In this thesis, we investigate the performance of Cultural Algorithms when dealing with the increasing dimensionality of optimization problems. The research is based on previous cultural algorithm approaches with the Cultural Algorithms Toolkit, CAT 2.0, which supports a variety of co-evolutionary features at both the knowledge and population levels. In this project, the system was applied to the solution of 60 randomly generated problems that ranged from 2-dimensional to 5-dimensional problem spaces. …


Query-Time Optimization Techniques For Structured Queries In Information Retrieval, Marc-Allen Cartright Sep 2013

Query-Time Optimization Techniques For Structured Queries In Information Retrieval, Marc-Allen Cartright

Open Access Dissertations

The use of information retrieval (IR) systems is evolving towards larger, more complicated queries. Both the IR industrial and research communities have generated significant evidence indicating that in order to continue improving retrieval effectiveness, increases in retrieval model complexity may be unavoidable. From an operational perspective, this translates into an increasing computational cost to generate the final ranked list in response to a query. Therefore we encounter an increasing tension in the trade-off between retrieval effectiveness (quality of result list) and efficiency (the speed at which the list is generated). This tension creates a strong need for optimization techniques to …


Artificial Immune Systems And Particle Swarm Optimization For Solutions To The General Adversarial Agents Problem, Jeremy Mange Apr 2013

Artificial Immune Systems And Particle Swarm Optimization For Solutions To The General Adversarial Agents Problem, Jeremy Mange

Dissertations

The general adversarial agents problem is an abstract problem description touching on the fields of Artificial Intelligence, machine learning, decision theory, and game theory. The goal of the problem is, given one or more mobile agents, each identified as either “friendly" or “enemy", along with a specified environment state, to choose an action or series of actions from all possible valid choices for the next “timestep" or series thereof, in order to lead toward a specified outcome or set of outcomes. This dissertation explores approaches to this problem utilizing Artificial Immune Systems, Particle Swarm Optimization, and hybrid approaches, along with …