Theory and Algorithms Commons^™

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 …

Quantifying Taxi Drivers' Behaviors With Behavioral Game Theory, Mengyu Ji, Yuhong Xu, Shih-Fen Cheng

Research Collection School Of Computing and Information Systems

With their flexibility and convenience, taxis play a vital role in urban transportation systems. Understanding how human drivers make decisions in a context of uncertainty and competition is crucial for taxi fleets that depend on drivers to provide their services. As part of this paper, we propose modeling taxi drivers’ behaviors based on behavioral game theory. Based on real-world data, we demonstrate that the behavioral game theory model we select is superior to state-of-the-art baselines. These results provide a solid foundation for improving taxi fleet efficiency in the future.

Models And Algorithms For Promoting Diverse And Fair Query Results, Md Mouinul Islam

Dissertations

Ensuring fairness and diversity in search results are two key concerns in compelling search and recommendation applications. This work explicitly studies these two aspects given multiple users' preferences as inputs, in an effort to create a single ranking or top-k result set that satisfies different fairness and diversity criteria. From group fairness standpoint, it adapts demographic parity like group fairness criteria and proposes new models that are suitable for ranking or producing top-k set of results. This dissertation also studies equitable exposure of individual search results in long tail data, a concept related to individual fairness. First, the dissertation focuses …

Human-Ai Complex Task Planning, Sepideh Nikookar

Dissertations

The process of complex task planning is ubiquitous and arises in a variety of compelling applications. A few leading examples include designing a personalized course plan or trip plan, designing music playlists/work sessions in web applications, or even planning routes of naval assets to collaboratively discover an unknown destination. For all of these aforementioned applications, creating a plan requires satisfying a basic construct, i.e., composing a sequence of sub-tasks (or items) that optimizes several criteria and satisfies constraints. For instance, in course planning, sub-tasks or items are core and elective courses, and degree requirements capture their complex dependencies as constraints. …

How I Read An Article That Uses Machine Learning Methods, Aziz Nazha, Olivier Elemento, Shannon Mcweeney, Moses Miles, Torsten Haferlach

Kimmel Cancer Center Faculty Papers

No abstract provided.

Signings Of Graphs And Sign-Symmetric Signed Graphs, Ahmad Asiri

Theses and Dissertations

In this dissertation, we investigate various aspects of signed graphs, with a particular focus on signings and sign-symmetric signed graphs. We begin by examining the complete graph on six vertices with one edge deleted ($K_6$\textbackslash e) and explore the different ways of signing this graph up to switching isomorphism. We determine the frustration index (number) of these signings and investigate the existence of sign-symmetric signed graphs. We then extend our study to the $K_6$\textbackslash 2e graph and the McGee graph with exactly two negative edges. We investigate the distinct ways of signing these graphs up to switching isomorphism and demonstrate …

Application Of Machine Learning Algorithms For Elucidation Of Biological Networks From Time Series Gene Expression Data, Krupa Nagori

Computational and Data Sciences (PhD) Dissertations

This dissertation provides a deep dive into understanding gene expression, interaction, regulation, and the intricate mechanisms behind heliotropism and phototropism. Additionally, the research accentuates the significance of machine learning techniques, specifically for gene regulatory networks (GRNs).

Chapter 1 offers an exhaustive benchmarking of GRN methodologies, furthering our comprehension of machine-learning models relevant to GRNs. The evaluation revealed that GRNTE, SWING, and BiXGBoost emerged as top-performing methods in GRN inference. The suitability of these models varies depending on specific research criteria such as computational needs, dataset dimensions, and performance metric emphasis. An innovation of this chapter was the introduction of Colab …

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 …

Document-Level Relation Extraction Via Separate Relation Representation And Logical Reasoning, Heyan Huang, Changsen Yuan, Qian Liu, Yixin Cao

Research Collection School Of Computing and Information Systems

Document-level relation extraction (RE) extends the identification of entity/mentions’ relation from the single sentence to the long document. It is more realistic and poses new challenges to relation representation and reasoning skills. In this article, we propose a novel model, SRLR, using Separate Relation Representation and Logical Reasoning considering the indirect relation representation and complex reasoning of evidence sentence problems. Specifically, we first expand the judgment of relational facts from the entity-level to the mention-level, highlighting fine-grained information to capture the relation representation for the entity pair. Second, we propose a logical reasoning module to identify evidence sentences and conduct …

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 …

Survey On Sentiment Analysis: Evolution Of Research Methods And Topics, Jingfeng Cui, Zhaoxia Wang, Seng-Beng Ho, Erik Cambria

Research Collection School Of Computing and Information Systems

Sentiment analysis, one of the research hotspots in the natural language processing field, has attracted the attention of researchers, and research papers on the field are increasingly published. Many literature reviews on sentiment analysis involving techniques, methods, and applications have been produced using different survey methodologies and tools, but there has not been a survey dedicated to the evolution of research methods and topics of sentiment analysis. There have also been few survey works leveraging keyword co-occurrence on sentiment analysis. Therefore, this study presents a survey of sentiment analysis focusing on the evolution of research methods and topics. It incorporates …

Balanced Blended Space: Foundational Human–Ai Dialogues In A Symmetry-Based Mediation Framework, David Smith

Publications and Research

This working paper documents the early development of the Balanced Blended Space (BBS) framework through a series of iterative interactions between a cognitive agent (human researcher) and a computational agent (AI system) conducted in 2023. The work is motivated by the need for a universal theoretical model capable of describing the integration of physical, virtual, and conceptual spaces, particularly in response to increasing fragmentation across contemporary communication systems.

BBS is proposed as a symmetry-based mediation framework in which relationships between domains—such as physical and virtual space, cognition and computation, and multiple sensory modalities—are treated as structurally equivalent and mappable. Central …

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 …

Say That Again: The Role Of Multimodal Redundancy In Communication And Context, Brandon Javier Dormes

Cognitive Science Senior Theses

With several modes of expression, such as facial expressions, body language, and speech working together to convey meaning, social communication is rich in redundancy. While typically relegated to signal preservation, this study investigates the role of cross-modal redundancies in establishing performance context, focusing on unaided, solo performances. Drawing on information theory, I operationalize redundancy as predictability and use an array of machine learning models to featurize speakers' facial expressions, body poses, movement speeds, acoustic features, and spoken language from 24 TEDTalks and 16 episodes of Comedy Central Stand-Up Presents. This analysis demonstrates that it is possible to distinguish between these …

Neural Tabula Rasa: Foundations For Realistic Memories And Learning, Patrick R. Perrine

Master's Theses

Understanding how neural systems perform memorization and inductive learning tasks are of key interest in the field of computational neuroscience. Similarly, inductive learning tasks are the focus within the field of machine learning, which has seen rapid growth and innovation utilizing feedforward neural networks. However, there have also been concerns regarding the precipitous nature of such efforts, specifically in the area of deep learning. As a result, we revisit the foundation of the artificial neural network to better incorporate current knowledge of the brain from computational neuroscience. More specifically, a random graph was chosen to model a neural system. This …

Wasm-Pbchunk: Incrementally Developing A Racket-To-Wasm Compiler Using Partial Bytecode Compilation, Adam C. Perlin

Master's Theses

Racket is a modern, general-purpose programming language with a language-oriented focus. To date, Racket has found notable uses in research and education, among other applications. To expand the reach of the language, there has been a desire to develop an efficient platform for running Racket in a web-based environment. WebAssembly (Wasm) is a binary executable format for a stack-based virtual machine designed to provide a fast, efficient, and secure execution environment for code on the web. Wasm is primarily intended to be a compiler target for higher-level languages. Providing Wasm support for the Racket project may be a promising way …

A Novel Approach To Extending Music Using Latent Diffusion, Keon Roohparvar, Franz J. Kurfess

Master's Theses

Using deep learning to synthetically generate music is a research domain that has gained more attention from the public in the past few years. A subproblem of music generation is music extension, or the task of taking existing music and extending it. This work proposes the Continuer Pipeline, a novel technique that uses deep learning to take music and extend it in 5 second increments. It does this by treating the musical generation process as an image generation problem; we utilize latent diffusion models (LDMs) to generate spectrograms, which are image representations of music. The Continuer Pipeline is able to …

Avoiding Starvation Of Arms In Restless Multi-Armed Bandit, Dexun Li, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

Restless multi-armed bandits (RMAB) is a popular framework for optimizing performance with limited resources under uncertainty. It is an extremely useful model for monitoring beneficiaries (arms) and executing timely interventions using health workers (limited resources) to ensure optimal benefit in public health settings. For instance, RMAB has been used to track patients’ health and monitor their adherence in tuberculosis settings, ensure pregnant mothers listen to automated calls about good pregnancy practices, etc. Due to the limited resources, typically certain individuals, communities, or regions are starved of interventions, which can potentially have a significant negative impact on the individual/community in the …

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 …

Performance Modeling For Network Anomaly Detection And Sensor Networks, Jie Chu

Dissertations, Theses, and Capstone Projects

Computer networks have become one of the fundamental communication infrastructures of the modern world. Data collection and data analysis over computer networks is a broad area of research and is getting more and more complicated as the ever-increasing complexity of the computer networks. In this dissertation, I will conduct performance modeling work for a few network scenarios and applications. In the first part of this dissertation, I will focus on two vital perspectives of the Internet, one from network administrators and the other from network users. Network administrators are key to manage and protect a computer network. I will study …