Physical Sciences and Mathematics Commons^™

Action Dubber: Timing Audible Actions Via Inflectional Flow, Wenlong Wan, Weiying Zheng, Tianyi Xiang, Guiqing Li, Shengfeng He

Research Collection School Of Computing and Information Systems

We introduce the task of Audible Action Temporal Localization, which aims to identify the spatiotemporal coordinates of audible movements. Unlike conventional tasks such as action recognition and temporal action localization, which broadly analyze video content, our task focuses on the distinct kinematic dynamics of audible actions. It is based on the premise that key actions are driven by inflectional movements; for example, collisions that produce sound often involve abrupt changes in motion. To capture this, we propose T A2Net, a novel architecture that estimates inflectional flow using the second derivative of motion to determine collision timings without relying on audio …

An Efficient Diffusion-Based Non-Autoregressive Solver For Traveling Salesman Problem, Mingzhao Wang, You Zhou, Zhiguang Cao, Yubin Xiao, Xuan Wu, Wei Pang, Yuan Jiang, Hui Yang, Peng Zhao, Yuanshu Li

Research Collection School Of Computing and Information Systems

Recent advances in neural models have shown considerable promise in solving Traveling Salesman Problems (TSPs) without relying on much hand-crafted engineering. However, while non-autoregressive (NAR) approaches benefit from faster inference through parallelism, they typically deliver solutions of inferior quality compared to autoregressive ones. To enhance the solution quality while maintaining fast inference, we propose DEITSP, a diffusion model with efficient iterations tailored for TSP that operates in a NAR manner. Firstly, we introduce a one-step diffusion model that integrates the controlled discrete noise addition process with self-consistency enhancement, enabling optimal solution prediction through simultaneous denoising of multiple solutions. Secondly, we …

Cradle: Empowering Foundation Agents Towards General Computer Control, Weihao Tan, Et. Al.

Research Collection School Of Computing and Information Systems

Despite their success in specific scenarios, existing foundation agents still struggle to generalize across various virtual scenarios, mainly due to the dramatically different encapsulations of environments with manually designed observation and action spaces. To handle this issue, we propose the General Computer Control (GCC) setting to restrict foundation agents to interact with software through the most unified and standardized interface, i.e., using screenshots as input and keyboard and mouse actions as output. We introduce Cradle, a modular and flexible LMM-powered framework, as a preliminary attempt towards GCC. Enhanced by six key modules, Information Gathering, Self-Reflection, Task Inference, Skill Curation, Action …

Information Bottleneck‑Guided Mlps For Robust Spatial‑Temporal Forecasting, Min Chen, Guansong Pang, Wenjun Wang, Cheng Yan

Research Collection School Of Computing and Information Systems

Spatial-temporal forecasting (STF) plays a pivotal role in urban planning and computing. Spatial-Temporal Graph Neural Networks (STGNNs) excel at modeling spatial-temporal dynamics, thus being robust against noise perturbations. However, they often suffer from relatively poor computational efficiency. Simplifying the architectures can improve efficiency but also weakens robustness with respect to noise interference. In this study, we investigate the problem: can simple neural networks such as Multi-Layer Perceptrons (MLPs) achieve robust spatial-temporal forecasting while remaining efficient? To this end, we first reveal the dual noise effect in spatial-temporal data and propose a theoretically grounded principle termed Robust Spatial-Temporal Information Bottleneck (RSTIB), …

Quantum Technologies In Decentralisation, Paul Robert Griffin, Rudy Raymond, Tsuyoshi Idé

Research Collection School Of Computing and Information Systems

Quantum technologies, rooted in the manipulation of quantum information, are revolutionizing computing and networking domains. Their impact on blockchains and decentralized systems is twofold. While much attention has been given to the potential of quantum computing to attack blockchains, these advanced technologies also offer avenues for strengthening and optimizing them. This chapter delves into the intricacies of quantum technologies, from the foundational concepts of qubits, quantum gates, and quantum networks to their implications for blockchains. We explore both the vulnerabilities of blockchains in a quantum-dominant era and the promising solutions quantum technologies provide, culminating in a use case examining their …

Finir: The 2nd Workshop On Financial Information Retrieval In The Era Of Generative Ai, Fengbin Zhu, Yunshan Ma, Fuli Feng, Chao Wang, Huanbo Luan, Guangnan Ye, Shuo Zhang, Dhagash Mehta, Pingping Chen, Bing Xiang, Tat‑Seng Chua

Research Collection School Of Computing and Information Systems

Recent advancements in Generative AI, such as Large Language Models (LLMs), have demonstrated remarkable success across various general tasks. Extensive studies have explored leveraging generative models in finance, but significant challenges persist. This half-day workshop explores potential approaches and research directions to address these challenges by equipping generative models with advanced Information Retrieval (IR) models. Specifically, this workshop seeks to provide a platform for discussing innovative ideas that facilitate the advancement of IR technology to enrich generative models in finance from four key perspectives: (i) financial IR techniques (ii) financial IR benchmarking and evaluation (iii) financial systems and agents/assistants (iv) …

Fashiondpo: Fine‑Tune Fashion Outfit Generation Model Using Direct Preference Optimization, Mingzhe Yu, Yunshan Ma, Lei Wu, Changshuo Wang, Xue Li, Lei Meng

Research Collection School Of Computing and Information Systems

Personalized outfit generation aims to construct a set of compatible and personalized fashion items as an outfit. Recently, generative AI models have received widespread attention, as they can generate fashion items for users to complete an incomplete outfit or create a complete outfit. However, they have limitations in terms of lacking diversity and relying on the supervised learning paradigm. Recognizing this gap, we propose a novel framework FashionDPO, which fine-tunes the fashion outfit generation model using direct preference optimization. This framework aims to provide a general fine-tuning approach to fashion generative models, refining a pre-trained fashion outfit generation model using …

Exploring The Capabilities Of Llms For Code-Change-Related Tasks, Lishui Fan, Jiakun Liu, Zhongxin Liu, David Lo, Xin Xia, Shanping Li

Research Collection School Of Computing and Information Systems

Developers deal with code-change-related tasks daily, e.g., reviewing code. Pre-trained code and code-change-oriented models have been adapted to help developers with such tasks. Recently, large language models (LLMs) have shown their effectiveness in code-related tasks. However, existing LLMs for code focus on general code syntax and semantics rather than the differences between two code versions. Thus, it is an open question how LLMs perform on code-change-related tasks.To answer this question, we conduct an empirical study using 1B parameters LLMs on three code-change-related tasks, i.e., code review generation, commit message generation, and just-in-time comment update, with in-context learning (ICL) and parameter-efficient …

Enhancing Project-Specific Code Completion By Inferring Internal Api Information, Le Deng, Xiaoxia Ren, Chao Ni, Ming Liang, David Lo, Zhongxin Liu

Research Collection School Of Computing and Information Systems

Project-specific code completion, which aims to complete code based on the context of the project, is an important and practical software engineering task. The state-of-the-art approaches employ the retrieval-augmented generation (RAG) paradigm and prompt large language models (LLMs) with information retrieved from the target project for project-specific code completion. In practice, developers always define and use custom functionalities, namely internal APIs, to facilitate the implementation of specific project requirements. Thus, it is essential to consider internal API information for accurate project-specific code completion. However, existing approaches either retrieve similar code snippets, which do not necessarily contain related internal API information, …

Robust Relevance Feedback For Interactive Known-Item Video Search, Zhixin Ma, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Known-item search (KIS) involves only a single search target, making relevance feedback-typically a powerful technique for efficiently identifying multiple positive examples to infer user intent-inapplicable. PicHunter addresses this issue by asking users to select the top-k most similar examples to the unique search target from a displayed set. Under ideal conditions, when the user's perception aligns closely with the machine's perception of similarity, consistent and precise judgments can elevate the target to the top position within a few iterations. However, in practical scenarios, expecting users to provide consistent judgments is often unrealistic, especially when the underlying embedding features used for …

Retrieval Augmented Generation For Dynamic Graph Modeling, Yuxia Wu, Lizi Liao, Yuan Fang

Research Collection School Of Computing and Information Systems

Modeling dynamic graphs, such as those found in social networks, recommendation systems, and e-commerce platforms, is crucial for capturing evolving relationships and delivering relevant insights over time. Traditional approaches primarily rely on graph neural networks with temporal components or sequence generation models, which often focus narrowly on the historical context of target nodes. This limitation restricts the ability to adapt to new and emerging patterns in dynamic graphs. To address this challenge, we propose a novel framework, Retrieval-Augmented Generation for Dy namic Graph modeling (RAG4DyG ), which enhances dynamic graph predictions by incorporating contextually and temporally relevant examples from broader …

Milpbench: A Large-Scale Benchmark Test Suite For Mixed Integer Linear Programming Problems, Huigen Ye, Yaoyang Cheng, Hua Xu, Zhiguang Cao, Hanzhang Qin

Research Collection School Of Computing and Information Systems

Mixed-integer linear programming (MILP) is a cornerstone of optimization with applications across numerous domains. However, the development and evaluation of MILP-solving algorithms are hindered by existing benchmark datasets, which are often limited in scale, lack diversity, and are poorly structured, making them inadequate for systematic testing across different solving approaches, especially for machine learning (ML)-based methods. To address these issues, we introduce MILPBench, a large-scale benchmark suite comprising 100,000 MILP instances organized into 60 well-categorized classes. Using structural properties and embedding similarity metrics, we developed a novel classification framework to ensure both intra-class homogeneity and inter-class diversity. In addition to …

Collaboration With Dynamic Open Ad Hoc Team Via Team State Modelling, Jing Sun, Cong Zhang, Zhiguang Cao

Research Collection School Of Computing and Information Systems

Open ad hoc teamwork presents the challenging problem of designing an autonomous agent that can rapidly adapt to collaborate with teammates without prior coordination in an open environment. Existing methods primarily rely on fixed, predefined teammate types, overlooking the fact that teammates may change dynamically. To address this limitation, we propose a novel reinforcement learning approach, the Open Online Teammate Adaptation Framework (Open-OTAF), which enables a controlled agent to collaborate with dynamic teammates in open ad hoc environments. To achieve this, the controlled agent employs a dual teamwork situation inference model to capture the current teamwork state, facilitating decision-making under …

Wa-Fdnet: A Unified Weight Adaptation Network For Multimodal Image Fusion And Object Detection, Yanyin Guo, Ying Luo, Junwei Li, Zhiyuan Zhang

Research Collection School Of Computing and Information Systems

Multimodal image fusion and object detection are critical tasks in computer vision, particularly in scenarios requiring robust perception under low illumination conditions. Existing approaches that attempt to combine these tasks often rely on cascaded or loosely coupled designs, which can result in suboptimal performance due to gradient conflicts and task imbalance. In this paper, we propose WA-FDNet, a novel Weight Adaptation Fusion Detection Network that unifies multimodal image fusion and object detection into a single end-to-end framework. WA-FDNet adopts a shared encoder–private decoder architecture, enabling efficient feature sharing while preserving task-specific characteristics. The image fusion branch employs a spatial attention-based …

A Mixed-Curvature Based Pre-Training Paradigm For Multi-Task Vehicle Routing Solver, Suyu Liu, Zhiguang Cao, Shanshan Feng, Yew-Soon Ong

Research Collection School Of Computing and Information Systems

Solving various types of vehicle routing problems (VRPs) using a unified neural solver has garnered significant attentions in recent years. Despite their effectiveness, existing neural multi-task solvers often fail to account for the geometric structures inherent in different tasks, which may result in suboptimal performance. To address this limitation, we propose a curvature-aware pre-training framework. Specifically, we leverage mixed-curvature spaces during the feature fusion stage, encouraging the model to capture the underlying geometric properties of each instance. Through extensive experiments, we evaluate the proposed pre-training strategy on existing neural multi-task solvers across a variety of testing scenarios. The results demonstrate …

Meta-Black-Box-Optimization Through Offline Q-Function Learning, Zeyuan Ma, Zhiguang Cao, Zhou Jiang, Hongshu Guo, Yue-Jiao Gong

Research Collection School Of Computing and Information Systems

Recent progress in Meta-Black-Box-Optimization (MetaBBO) has demonstrated that using RL to learn a meta-level policy for dynamic algorithm configuration (DAC) over an optimization task distribution could significantly enhance the performance of the low-level BBO algorithm. However, the online learning paradigms in existing works makes the efficiency of MetaBBO problematic. To address this, we propose an offline learning-based MetaBBO framework in this paper, termed Q-Mamba, to attain both effectiveness and efficiency in MetaBBO. Specifically, we first transform DAC task into long-sequence decision process. This allows us further introduce an effective Q-function decomposition mechanism to reduce the learning difficulty within the intricate …

O-Mapl: Offline Multi-Agent Preference Learning, The Viet Bui, Tien Mai, Hong Thanh Nguyen

Research Collection School Of Computing and Information Systems

Inferring reward functions from demonstrations is a key challenge in reinforcement learning (RL), particularly in multi-agent RL (MARL). The large joint state-action spaces and intricate inter-agent interactions in MARL make inferring the joint reward function especially challenging. While prior studies in single-agent settings have explored ways to recover reward functions and expert policies from human preference feedback, such studies in MARL remain limited. Existing methods typically combine two separate stages, supervised reward learning, and standard MARL algorithms, leading to unstable training processes. In this work, we exploit the inherent connection between reward functions and Q functions in cooperative MARL to …

Mitigating Regression Faults Induced By Feature Evolution In Deep Learning Systems, Hanmo Yu, Zan Wang, Xuyang Chen, Junjie Chen, Jun Sun, Shuang Liu, Zishuo Dong

Research Collection School Of Computing and Information Systems

Deep learning (DL) systems have been widely utilized across various domains. However, the evolution of DL systems can result in regression faults. In addition to the evolution of DL systems through the incorporation of new data, feature evolution, such as the addition of new features, is also common and can introduce regression faults. In this work, we first investigate the underlying factors that are correlated with regression faults in feature evolution scenarios, i.e., redundancy and contribution shift. Based on our investigation, we propose a novel mitigation approach called FeaProtect, which aims to minimize the impact of these two factors. To …

An Exponential Cone Integer Programming And Piece-Wise Linear Approximation Approach For 0-1 Fractional Programming, Hoang Giang Pham, Thuy Anh Ta, Tien Mai

Research Collection School Of Computing and Information Systems

We study a class of binary fractional programs commonly encountered in important application domains such as assortment optimization and facility location. These problems are known to be NP-hard to approximate within any constant factor, and existing solution approaches typically rely on mixed-integer linear programming or second-order cone programming reformulations. These methods often utilize linearization techniques (e.g., big-M or McCormick inequalities), which can result in weak continuous relaxations. In this work, we propose a novel approach based on an exponential cone reformulation combined with piecewise linear approximation. This allows the problem to be solved efficiently using standard cutting-plane or branch-and-cut procedures. …

The B2biers System: A Content-Based Perspective On Maximizing Influence And Subscription In Social Networks, Konstantinos Theocharidis, Hady Wirawan Lauw

Research Collection School Of Computing and Information Systems

The popular problem of Influence Maximization (IM) asks for the k users who can maximize the influence of a fixed post in a social network. In contrast, the problem of Content- Aware Influence Maximization (CAIM) asks for the k features to form a viral tunable post in a social network starting its diffusion from a fixed set of initial adopters. CAIM paves the way for a number of novel problems to be studied that altogether can lead to the development of a system that would be valuable for advertisers who manage social network pages. This holds since features (brands) in …

Prompttutor: Effects Of An Llm-Based Chatbot On Learning Outcomes And Motivation In Flipped Classrooms, Yuhao Zhang, Eng Lieh Ouh, Chong Jee Adam Ho, Siaw Ling Lo, Kar Way Tan, Feng Lin

Research Collection School Of Computing and Information Systems

This study explores the integration of a Large Language Model (LLM) based chatbot, PromptTutor, into flipped classrooms (FC) for undergraduate Computer Science (CS) education. PromptTutor is designed to provide personalized, immediate feedback to support student learning in FC by incorporating reflective learning and scaffolding strategies. The traditional FC typically lacks this immediate feedback during the pre-class learning phase, risking decreased student motivation according to existing literature. This study examines if students improve in learning outcomes and motivation after using PromptTutor. Through a controlled crossover experiment with 50 students, the study demonstrates statistically significant improvements in students' quiz performance and motivation …

Crow: Eliminating Backdoors From Large Language Models Via Internal Consistency Regularization, Nay Myat Min, Long H. Pham, Yige Li, Jun Sun

Research Collection School Of Computing and Information Systems

Large Language Models (LLMs) are vulnerable to backdoor attacks that manipulate outputs via hidden triggers. Existing defense methods—designed for vision/text classification tasks—fail for text generation. We propose Internal Consistency Regularization (CROW), a defense leveraging the observation that backdoored models exhibit unstable layer-wise hidden representations when triggered, while clean models show smooth transitions. CROW enforces consistency across layers via adversarial perturbations and regularization during finetuning, neutralizing backdoors without requiring clean reference models or trigger knowledge—only a small clean dataset. Experiments across Llama-2 (7B, 13B), CodeLlama (7B, 13B), and Mistral-7B demonstrate CROW’s effectiveness: it achieves significant reductions in attack success rates across …

An On-The-Fly Synthesis Framework For Ltl Over Finite Traces, Shengping Xiao, Yongkang Li, Shufang Zhu, Jun Sun, Jianwen Li, Geguang Pu, Moshe Vardi

Research Collection School Of Computing and Information Systems

We present an on-the-fly synthesis framework for Linear Temporal Logic over finite traces (LTLf) based on top-down deterministic automata construction. Existing approaches rely on constructing a complete Deterministic Finite Automaton (DFA) corresponding to the LTLf specification, a process with doubly exponential complexity relative to formula size in the worst case. In this case, the synthesis cannot be conducted until the entire DFA is constructed. This inefficiency is the main bottleneck of existing approaches. To address this challenge, we first present a method for converting LTLf into Transition-based DFA (TDFA) by directly leveraging LTLf semantics, incorporating intermediate results as direct components …

Unified Neural Backdoor Removal With Only Few Clean Samples Through Unlearning And Relearning, Nay Myat Min, Long H. Pham, Jun Sun

Research Collection School Of Computing and Information Systems

Deep neural networks have achieved remarkable success across various applications; however, their vulnerability to backdoor attacks poses severe security risks—especially in situations where only a limited set of clean samples is available for defense. In this work, we address this critical challenge by proposing ULRL (UnLearn and ReLearn for backdoor removal), a novel two-phase approach for comprehensive backdoor removal. Our method first employs an unlearning phase, in which the network’s loss is intentionally maximized on a small clean dataset to expose neurons that are excessively sensitive to backdoor triggers. Subsequently, in the relearning phase, these suspicious neurons are recalibrated using …

Numerical Approach To The Optimization Of The Bandwidth Tunability Of A Non-Cascaded Multifunctional Optical Filter, Ramon Benedict L. Lapina, Benjamin B. Dingel, Clint Dominic Bennett

Ateneo Innovation Center

Previously, we reported a multifunctional optical filter which is a Photonic Integrated Circuit (PIC)–based, noncascaded bandpass filter wherein the Ring Resonators-based Direct-Coupled-All-Pass Filter (D-APF) and Cross-coupled All-pass Filter (C-APF) are attached to each of the arms of a single Mach Zehnder Interferometer (MZI). This device is an alternative platform to the conventional platform of programmable photonic filters that does not rely on combining different photonic elements to implement various filter functionalities. For one, it can generate (i) Narrowband Filter, (ii) Asymmetric Interleaver (AI) and (iii) Symmetric Interleaver (SI) responses by varying limited number of specific parameters of the device. It …

Being And Becoming In The Algorithmic Age, Bernard E. Harcourt

Faculty Scholarship

To change the world: the prerequisite, most often, is to change our experience of the world, to experience the world differently, to be shaken to our foundations, to have one’s sense of self shattered. That is a process of both being and becoming. In order to turn that process in our favour, in this age of artificial intelligence, it will be crucial to transform data and algorithms into bits of justice.

Structure-Activity Relationships Of Isothiourea And Silicon Phthalocyanine Catalysts, Christian J. Harrison

Theses and Dissertations

Efficient organic synthesis often relies on improving catalyst designs and investigating reaction mechanisms to accomplish feats such as high stereoselectivity, low catalyst loadings, and performing sustainable chemistry. Within the field of organocatalysis, intermolecular interactions between a catalyst and a substrate are a large contributing factor to the control of a reaction, including rate and selectivity. Investigating mechanisms can provide information on the type of intermolecular interactions occurring in the reaction, aiding future reaction and catalyst development. This dissertation will explore two recent projects and how probing intermolecular interactions through simple modifications provides information useful for new catalyst designs and properties. …

Causal Neuro-Symbolic Artificial Intelligence: Synergy Between Neuro-Symbolic And Causal Artificial Intelligence, Utkarshani Jaimini

Theses and Dissertations

Understanding and reasoning about cause and effect is innate to human cognition. In everyday life, humans continuously engage in causal reasoning and hypothetical retrospection to make decisions, plan actions, and interpret events. This cognitive ability allows us to ask questions such as: “What caused this situation?”, “What will happen if I take this action?”, or “What would have happened had I chosen differently?” This intuitive capacity to form mental models of the world, infer causal relationships, and reason about alternative scenarios, particularly counterfactuals, is central to our intelligence and adaptability. In contrast, current machine learning (ML) and artificial intelligence (AI) …

A Neuro-Symbolic Ai Approach To Scene Understanding In Autonomous Systems, Ruwan Tharanga Wickramarachchige Don

Theses and Dissertations

Effectively understanding scenes requires a unified representation of scene data and background knowledge. A neuro-symbolic AI approach to scene understanding leverages such a unified representation to enable advanced expression, inference, and labeling of scenes, improving the perception of autonomous systems.

Scene understanding remains a central challenge in the machine perception of autonomous systems. It requires the integration of multiple sources of information, background knowledge, and heterogeneous sensor data to perceive, interpret, and reason about both physical and semantic aspects of dynamic environments. Current approaches to scene understanding primarily rely on computer vision and deep learning models that operate directly on …

2025 July - Tennessee Monthly Climate Report, Tennessee Climate Office, East Tennessee State University

Tennessee Climate Office Monthly Reports

Hi All,

The main story for July was the high heat and humidity that spread across the state for the second half of the month. Most counties in the state saw at least 1 day with a heat advisory or extreme heat warning issued by the National Weather Service due to a combination of high temperatures and humidity that sent heat index values above advisory/warning criteria. The western half of the state saw higher heat index values and were impacted by the heat wave for a longer period of time than the eastern half of the state. Some part of …