Engineering Commons^™

Path-Choice-Constrained Bus Bridging Design Under Urban Rail Transit Disruptions, Yiyang Zhu, Jian Gang Jin, Hai Wang

Research Collection School Of Computing and Information Systems

Although urban rail transit systems play a crucial role in urban mobility, they frequently suffer from unexpected disruptions due to power loss, severe weather, equipment failure, and other factors that cause significant disruptions in passenger travel and, in turn, socioeconomic losses. To alleviate the inconvenience of affected passengers, bus bridging services are often provided when rail service has been suspended. Prior research has yielded various methodologies for effective bus bridging services; however, they are mainly based on the strong assumption that passengers must follow predetermined bus bridging routes. Less attention is paid to passengers’ path choice behaviors, which could affect …

Star-Based Reachability Analysis Of Binary Neural Networks On Continuous Input, Mykhailo Ivashchenko

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

Deep Neural Networks (DNNs) have become a popular instrument for solving various real-world problems. DNNs’ sophisticated structure allows them to learn complex representations and features. However, architecture specifics and floating-point number usage result in increased computational operations complexity. For this reason, a more lightweight type of neural networks is widely used when it comes to edge devices, such as microcomputers or microcontrollers – Binary Neural Networks (BNNs). Like other DNNs, BNNs are vulnerable to adversarial attacks; even a small perturbation to the input set may lead to an errant output. Unfortunately, only a few approaches have been proposed for verifying …

An Adaptive Large Neighborhood Search For The Multi-Vehicle Profitable Tour Problem With Flexible Compartments And Mandatory Customers, Vincent F. Yu, Nabila Yuraisyah Salsabila, Aldy Gunawan, Anggun Nurfitriani Handoko

Research Collection School Of Computing and Information Systems

The home-refill delivery system is a business model that addresses the concerns of plastic waste and its impact on the environment. It allows customers to pick up their household goods at their doorsteps and refill them into their own containers. However, the difficulty in accessing customers’ locations and product consolidations are undeniable challenges. To overcome these issues, we introduce a new variant of the Profitable Tour Problem, named the multi-vehicle profitable tour problem with flexible compartments and mandatory customers (MVPTPFC-MC). The objective is to maximize the difference between the total collected profit and the traveling cost. We model the proposed …

An Algorithm Based On Priority Rules For Solving A Multi-Drone Routing Problem In Hazardous Waste Collection, Youssef Harrath Dr., Jihene Kaabi Dr.

Research & Publications

This research investigates the problem of assigning pre-scheduled trips to multiple drones to collect hazardous waste from different sites in the minimum time. Each drone is subject to essential restrictions: maximum flying capacity and recharge operation. The goal is to assign the trips to the drones so that the waste is collected in the minimum time. This is done if the total flying time is equally distributed among the drones. An algorithm was developed to solve the problem. The algorithm is based on two main ideas: sort the trips according to a given priority rule and assign the current trip …

Optimal Algorithm For Managing On-Campus Student Transportation, Youssef Harrath Dr.

Research & Publications

This study analyzed the transportation issues at the University of Bahrain Sakhir campus, where a bus system with an unorganized and fixed number of buses allocated each semester was in place. Data was collected through a survey, on-site observations, and student schedules to estimate the number of buses needed. The study was limited to students who require to move between buildings for academic purposes and not those who choose to ride buses for other reasons. An algorithm was designed to calculate the optimal number of buses for each time slot, and for each day. This solution could improve transportation efficiency, …

Modeling Coupled Driving Behavior During Lane Change: A Multi-Agent Transformer Reinforcement Learning Approach, Hongyu Guo, Mehdi Keyvan-Ekbatani, Kun Xie

Civil & Environmental Engineering Faculty Publications

In a lane change (LC) scenario, the lane change vehicle interacts with surrounding vehicles. The interactions not only affect their driving behaviors but also influence the traffic flow. This study aims to model the coupled behavior of the lane changer and the follower in the target lane during LC. Large-scale real-world connected vehicle (CV) data from the Safety Pilot Model Deployment (SPMD) program are used to extract LCs and study vehicle interactions. A multi-agent Transformer-based deep deterministic policy gradient (MA-TDDPG) method is proposed to model the coupled behaviors during LC. The multi-agent framework can handle the multiple agents’ behaviors with …

Physics-Informed Deep Learning With Kalman Filter Mixture For Traffic State Prediction, Niharika Deshpande, Hyoshin (John) Park

Engineering Management & Systems Engineering Faculty Publications

Accurate traffic forecasting is crucial for understanding and managing congestion for efficient transportation planning. However, conventional approaches often neglect epistemic uncertainty, which arises from incomplete knowledge across different spatiotemporal scales. This study addresses this challenge by introducing a novel methodology to establish dynamic spatiotemporal correlations that captures the unobserved heterogeneity in travel time through distinct peaks in probability density functions, guided by physics-based principles. We propose an innovative approach to modifying both prediction and correction steps of the Kalman Filter (KF) algorithm by leveraging established spatiotemporal correlations. Central to our approach is the development of a novel deep learning model …

Abmscore: A Heuristic Algorithm For Forming Strategic Coalitions In Agent-Based Simulation, Andrew J. Collins, Gayane Grigoryan

Engineering Management & Systems Engineering Faculty Publications

Integrating human behavior into agent-based models has been challenging due to its diversity. An example is strategic coalition formation, which occurs when an individual decides to collaborate with others because it strategically benefits them, thereby increasing the expected utility of the situation. An algorithm called ABMSCORE was developed to help model strategic coalition formation in agent-based models. The ABMSCORE algorithm employs hedonic games from cooperative game theory and has been applied to various situations, including refugee egress and smallholder farming cooperatives. This paper discusses ABMSCORE, including its mechanism, requirements, limitations, and application. To demonstrate the potential of ABMSCORE, a new …

The Feasibility Of Motion Tracking Camera System For Magnetic Suspension Wind Tunnel Tests, Hisham M. Shehata, David Cox, Mark Schoenenberger, Colin Britcher, Eli Shellabarger, Timothy Schott, Brendan Mcgovern

Mechanical & Aerospace Engineering Faculty Publications

The Entry Systems Modeling (ESM) Program at NASA has actively participated in the re-development of the Magnetic Suspension Balance System (MSBS) at the six-inch subsonic wind tunnel at NASA Langley Research Center. This initiative aims to enhance the MSBS system's capabilities, enabling the testing of stingless entry vehicle models at supersonic speeds. To achieve this, control algorithms are required to ensure magnetic levitation control and stability for models during free-oscillation dynamic responses. Currently, the system relies on electromagnetic position sensors to provide real-time 3 degrees of freedom control of a rigid body. While this approach has proven successful for subsonic …

Using Feature Selection Enhancement To Evaluate Attack Detection In The Internet Of Things Environment, Khawlah Harahsheh, Rami Al-Naimat, Chung-Hao Chen

Electrical & Computer Engineering Faculty Publications

The rapid evolution of technology has given rise to a connected world where billions of devices interact seamlessly, forming what is known as the Internet of Things (IoT). While the IoT offers incredible convenience and efficiency, it presents a significant challenge to cybersecurity and is characterized by various power, capacity, and computational process limitations. Machine learning techniques, particularly those encompassing supervised classification techniques, offer a systematic approach to training models using labeled datasets. These techniques enable intrusion detection systems (IDSs) to discern patterns indicative of potential attacks amidst the vast amounts of IoT data. Our investigation delves into various aspects …

Adversarial Training Based Domain Adaptation Of Skin Cancer Images, Syed Qasim Gilani, Muhammad Umair, Maryam Naqvi, Oge Marques, Hee-Cheol Kim

Electrical & Computer Engineering Faculty Publications

Skin lesion datasets used in the research are highly imbalanced; Generative Adversarial Networks can generate synthetic skin lesion images to solve the class imbalance problem, but it can result in bias and domain shift. Domain shifts in skin lesion datasets can also occur if different instruments or imaging resolutions are used to capture skin lesion images. The deep learning models may not perform well in the presence of bias and domain shift in skin lesion datasets. This work presents a domain adaptation algorithm-based methodology for mitigating the effects of domain shift and bias in skin lesion datasets. Six experiments were …

Dl-Drl: A Double-Level Deep Reinforcement Learning Approach For Large-Scale Task Scheduling Of Multi-Uav, Xiao Mao, Guohua Wu, Mingfeng Fan, Zhiguang Cao, Witold Pedrycz

Research Collection School Of Computing and Information Systems

Exploiting unmanned aerial vehicles (UAVs) to execute tasks is gaining growing popularity recently. To address the underlying task scheduling problem, conventional exact and heuristic algorithms encounter challenges such as rapidly increasing computation time and heavy reliance on domain knowledge, particularly when dealing with large-scale problems. The deep reinforcement learning (DRL) based methods that learn useful patterns from massive data demonstrate notable advantages. However, their decision space will become prohibitively huge as the problem scales up, thus deteriorating the computation efficiency. To alleviate this issue, we propose a double-level deep reinforcement learning (DL-DRL) approach based on a divide and conquer framework …

Segac: Sample Efficient Generalized Actor Critic For The Stochastic On-Time Arrival Problem, Honglian Guo, Zhi He, Wenda Sheng, Zhiguang Cao, Yingjie Zhou, Weinan Gao

Research Collection School Of Computing and Information Systems

This paper studies the problem in transportation networks and introduces a novel reinforcement learning-based algorithm, namely. Different from almost all canonical sota solutions, which are usually computationally expensive and lack generalizability to unforeseen destination nodes, segac offers the following appealing characteristics. segac updates the ego vehicle’s navigation policy in a sample efficient manner, reduces the variance of both value network and policy network during training, and is automatically adaptive to new destinations. Furthermore, the pre-trained segac policy network enables its real-time decision-making ability within seconds, outperforming state-of-the-art sota algorithms in simulations across various transportation networks. We also successfully deploy segac …

A Chinese Power Text Classification Algorithm Based On Deep Active Learning, Song Deng, Qianliang Li, Renjie Dai, Siming Wei, Di Wu, Yi He, Xindong Wu

Computer Science Faculty Publications

The construction of knowledge graph is beneficial for grid production, electrical safety protection, fault diagnosis and traceability in an observable and controllable way. Highly-precision text classification algorithm is crucial to build a professional knowledge graph in power system. Unfortunately, there are a large number of poorly described and specialized texts in the power business system, and the amount of data containing valid labels in these texts is low. This will bring great challenges to improve the precision of text classification models. To offset the gap, we propose a classification algorithm for Chinese text in the power system based on deep …

Neural Airport Ground Handling, Yaoxin Wu, Jianan Zhou, Yunwen Xia, Xianli Zhang, Zhiguang Cao, Jie Zhang

Research Collection School Of Computing and Information Systems

Airport ground handling (AGH) offers necessary operations to flights during their turnarounds and is of great importance to the efficiency of airport management and the economics of aviation. Such a problem involves the interplay among the operations that leads to NP-hard problems with complex constraints. Hence, existing methods for AGH are usually designed with massive domain knowledge but still fail to yield high-quality solutions efficiently. In this paper, we aim to enhance the solution quality and computation efficiency for solving AGH. Particularly, we first model AGH as a multiple-fleet vehicle routing problem (VRP) with miscellaneous constraints including precedence, time windows, …

Closing The Gap: Leveraging Aes-Ni To Balance Adversarial Advantage And Honest User Performance In Argon2i, Nicholas Harrell, Nathaniel Krakauer

CERIAS Technical Reports

The challenge of providing data privacy and integrity while maintaining efficient performance for honest users is a persistent concern in cryptography. Attackers exploit advances in parallel hardware and custom circuit hardware to gain an advantage over regular users. One such method is the use of Application-Specific Integrated Circuits (ASICs) to optimize key derivation function (KDF) algorithms, giving adversaries a significant advantage in password guessing and recovery attacks. Other examples include using graphical processing units (GPUs) and field programmable gate arrays (FPGAs). We propose a focused approach to close the gap between adversarial advantage and honest user performance by leveraging the …

Motif-Cluster: A Spatial Clustering Package For Repetitive Motif Binding Patterns, Mengyuan Zhou

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

Previous efforts in using genome-wide analysis of transcription factor binding sites (TFBSs) have overlooked the importance of ranking potential significant regulatory regions, especially those with repetitive binding within a local region. Identifying these homogenous binding sites is critical because they have the potential to amplify the binding affinity and regulation activity of transcription factors, impacting gene expression and cellular functions. To address this issue, we developed an open-source tool Motif-Cluster that prioritizes and visualizes transcription factor regulatory regions by incorporating the idea of local motif clusters. Motif-Cluster can rank the significant transcription factor regulatory regions without the need for experimental …

Robust Maximum Capture Facility Location Under Random Utility Maximization Models, Tien Thanh Dam, Thuy Anh Ta, Tien Mai

Research Collection School Of Computing and Information Systems

We study a robust version of the maximum capture facility location problem in a competitive market, assuming that each customer chooses among all available facilities according to a random utility maximization (RUM) model. We employ the generalized extreme value (GEV) family of models and assume that the parameters of the RUM model are not given exactly but lie in convex uncertainty sets. The problem is to locate new facilities to maximize the worst-case captured user demand. We show that, interestingly, our robust model preserves the monotonicity and submodularity from its deterministic counterpart, implying that a simple greedy heuristic can guarantee …

Joint Location And Cost Planning In Maximum Capture Facility Location Under Random Utilities, Ngan H. Duong, Tien Thanh Dam, Thuy Anh Ta, Tien Mai

Research Collection School Of Computing and Information Systems

We study a joint facility location and cost planning problem in a competitive market under random utility maximization (RUM) models. The objective is to locate new facilities and make decisions on the costs (or budgets) to spend on the new facilities, aiming to maximize an expected captured customer demand, assuming that customers choose a facility among all available facilities according to a RUM model. We examine two RUM frameworks in the discrete choice literature, namely, the additive and multiplicative RUM. While the former has been widely used in facility location problems, we are the first to explore the latter in …

Grasp Solution Approach For The E-Waste Collection Problem, Aldy Gunawan, Dang Viet Anh Nguyen, Pham Kien Minh Nguyen, Pieter Vansteenwegen

Research Collection School Of Computing and Information Systems

The digital economy has brought significant advancements in electronic devices, increasing convenience and comfort in people’s lives. However, this progress has also led to a shorter life cycle for these devices due to rapid advancements in hardware and software technology. As a result, e-waste collection and recycling have become vital for protecting the environment and people’s health. From the operations research perspective, the e-waste collection problem can be modeled as the Heterogeneous Vehicle Routing Problem with Multiple Time Windows (HVRP-MTW). This study proposes a metaheuristic based on the Greedy Randomized Adaptive Search Procedure complemented by Path Relinking (GRASP-PR) to solve …

Learning To Send Reinforcements: Coordinating Multi-Agent Dynamic Police Patrol Dispatching And Rescheduling Via Reinforcement Learning, Waldy Joe, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

We address the problem of coordinating multiple agents in a dynamic police patrol scheduling via a Reinforcement Learning (RL) approach. Our approach utilizes Multi-Agent Value Function Approximation (MAVFA) with a rescheduling heuristic to learn dispatching and rescheduling policies jointly. Often, police operations are divided into multiple sectors for more effective and efficient operations. In a dynamic setting, incidents occur throughout the day across different sectors, disrupting initially-planned patrol schedules. To maximize policing effectiveness, police agents from different sectors cooperate by sending reinforcements to support one another in their incident response and even routine patrol. This poses an interesting research challenge …

Grasp Based Metaheuristic To Solve The Mixed Fleet E-Waste Collection Route Planning Problem, Aldy Gunawan, Dang V.A. Nguyen, Pham K.M. Nguyen, Pieter. Vansteenwegen

Research Collection School Of Computing and Information Systems

The digital economy has brought significant advancements in electronic devices, increasing convenience and comfort in people’s lives. However, this progress has also led to a shorter life cycle for these devices due to rapid advancements in hardware and software technology. As a result, e-waste collection and recycling have become vital for protecting the environment and people’s health. From the operations research perspective, the e-waste collection problem can be modeled as the Heterogeneous Vehicle Routing Problem with Multiple Time Windows (HVRP-MTW). This study proposes a metaheuristic based on the Greedy Randomized Adaptive Search Procedure complemented by Path Relinking (GRASP-PR) to solve …

Estimation Of Recursive Route Choice Models With Incomplete Trip Observations, Tien Mai, The Viet Bui, Quoc Phong Nguyen, Tho V. Le

Research Collection School Of Computing and Information Systems

This work concerns the estimation of recursive route choice models in the situation that the trip observations are incomplete, i.e., there are unconnected links (or nodes) in the observations. A direct approach to handle this issue could be intractable because enumerating all paths between unconnected links (or nodes) in a real network is typically not possible. We exploit an expectation–maximization (EM) method that allows dealing with the missing-data issue by alternatively performing two steps of sampling the missing segments in the observations and solving maximum likelihood estimation problems. Moreover, observing that the EM method could be expensive, we propose a …

Enabling Third Layer Bitcoin Applications Using Lightning Network, Ahmet Kurt

FIU Electronic Theses and Dissertations

When Bitcoin was introduced in 2009, it created a big sensation in the world as it was first of its kind. Since then, a lot of different cryptocurrencies were proposed. Today, cryptocurrencies can be used to pay for goods and services similar to using cash or credit cards. However, none of them could replace or supersede Bitcoin in usage or market capitalization. Current market conditions still imply that it will stay the same way. However, Bitcoin suffers from very low transaction per second (TPS) which limits its usability on large scale. There have been numerous proposals to increase its scalability …

Optimal Domain-Partitioning Algorithm For Real-Life Transportation Networks And Finite Element Meshes, Jimesh Bhagatji, Sharanabasaweshwara Asundi, Eric Thompson, Duc T. Nguyen

Civil & Environmental Engineering Faculty Publications

For large-scale engineering problems, it has been generally accepted that domain-partitioning algorithms are highly desirable for general-purpose finite element analysis (FEA). This paper presents a heuristic numerical algorithm that can efficiently partition any transportation network (or any finite element mesh) into a specified number of subdomains (usually depending on the number of parallel processors available on a computer), which will result in “minimising the total number of system BOUNDARY nodes” (as a primary criterion) and achieve “balancing work loads” amongst the subdomains (as a secondary criterion). The proposed seven-step heuristic algorithm (with enhancement features) is based on engineering common sense …

Investigating The Use Of Recurrent Neural Networks In Modeling Guitar Distortion Effects, Caleb Koch, Scott Hawley, Andrew Fyfe

Belmont University Research Symposium (BURS)

Guitar players have been modifying their guitar tone with audio effects ever since the mid-20th century. Traditionally, these effects have been achieved by passing a guitar signal through a series of electronic circuits which modify the signal to produce the desired audio effect. With advances in computer technology, audio “plugins” have been created to produce audio effects digitally through programming algorithms. More recently, machine learning researchers have been exploring the use of neural networks to replicate and produce audio effects initially created by analog and digital effects units. Recurrent Neural Networks have proven to be exceptional at modeling audio effects …

Nftdisk: Visual Detection Of Wash Trading In Nft Markets, Xiaolin Wen, Yong Wang, Xuanwu Yue, Feida Zhu, Min Zhu

Research Collection School Of Computing and Information Systems

With the growing popularity of Non-Fungible Tokens (NFT), a new type of digital assets, various fraudulent activities have appeared in NFT markets. Among them, wash trading has become one of the most common frauds in NFT markets, which attempts to mislead investors by creating fake trading volumes. Due to the sophisticated patterns of wash trading, only a subset of them can be detected by automatic algorithms, and manual inspection is usually required. We propose NFTDisk, a novel visualization for investors to identify wash trading activities in NFT markets, where two linked visualization modules are presented: a radial visualization module with …

Chatgpt As Metamorphosis Designer For The Future Of Artificial Intelligence (Ai): A Conceptual Investigation, Amarjit Kumar Singh (Library Assistant), Dr. Pankaj Mathur (Deputy Librarian)

Library Philosophy and Practice (e-journal)

Abstract

Purpose: The purpose of this research paper is to explore ChatGPT’s potential as an innovative designer tool for the future development of artificial intelligence. Specifically, this conceptual investigation aims to analyze ChatGPT’s capabilities as a tool for designing and developing near about human intelligent systems for futuristic used and developed in the field of Artificial Intelligence (AI). Also with the helps of this paper, researchers are analyzed the strengths and weaknesses of ChatGPT as a tool, and identify possible areas for improvement in its development and implementation. This investigation focused on the various features and functions of ChatGPT that …

Ant Colony-Based Approach For Solving An Unmanned Aerial Vehicle Routing Problem, Youssef Harrath Dr., Jihene Kaabi Dr.

Research & Publications

Waste management issues are affecting the economic and environmental aspects of modern societies. Thus, growing the interest of academic and industrial research and development in optimizing the process of waste management. As these issues greatly impact human health and environmental aspects and impose a threat, hazardous waste management requires even much more attention. The problem studied in this research is a variant of the vehicle routing problem using an unmanned aerial vehicle (UAV). The focus of this research is on planning the routes for waste collection and disposal using a UAV. The aim is to collect all the waste as …

Efficient Maritime Object Detection And Validation For Enhancing Safety Of Uncrewed Marine Systems, Ahmed Saglam, Yiannis Papelis

VMASC Publications

Safe operation of uncrewed maritime systems is a major concern in the presence of other vehicles or obstacles. Typically, perception algorithms utilize sensor data to identify obstacles that must be avoided, and AI algorithms are used to interpret raw sensor data for use in navigation and object avoidance algorithms. However, perception algorithms are typically computationally expensive. In this paper, we present an efficient method for detecting obstacles using raw lidar data in the form of range or Point Cloud, employing computationally efficient techniques that do not depend on trained models or AI matching. The approach
converts the sensor readings into …