Computer Sciences Commons^™

Jollygesture: Exploring Dual-Purpose Gestures In Vr Presentations, Gun Woo Warren Park, Anthony Tang, Fanny Chevalier

Research Collection School Of Computing and Information Systems

Virtual reality (VR) offers new opportunities for presenters to use expressive body language to engage their audience. Yet, most VR presentation systems have adopted control mechanisms that mimic those found in face-to-face presentation systems. We explore the use of gestures that have dual-purpose: first, for the audience, a communicative purpose; second, for the presenter, a control purpose to alter content in slides. To support presenters, we provide guidance on what gestures are available and their effects. We realize our design approach in JollyGesture, a VR technology probe that recognizes dual-purpose gestures in a presentation scenario. We evaluate our approach through …

Usability Versus Collectibility In Nft: The Case Of Web3 Domain Names, Ping Fan Ke, Yi Meng Lau

Research Collection School Of Computing and Information Systems

This study examines the market’s inclination towards usability and collectibility aspects of Non-Fungible Tokens (NFTs) within Web3 domain name marketplaces, drawing insights from resale records. Our findings reveal a prevailing preference for usability, as evidenced by consistently higher average resale prices observed for Ethereum Name Service (ENS) domains compared to Linagee Name Registrar (LNR) domains. However, domains with diminished usability, such as those containing non-ASCII characters, tend to attract investors due to their enhanced collectibility. Our analysis on the effect from previous resale suggests a potential aversion towards second-hand acquisitions among NFT investors when value derives primarily from usability, while …

Poster: Profiling Event Vision Processing On Edge Devices, Ila Nitin Gokarn, Archan Misra

Research Collection School Of Computing and Information Systems

As RGB camera resolutions and frame-rates improve, their increased energy requirements make it challenging to deploy fast, efficient, and low-power applications on edge devices. Newer classes of sensors, such as the biologically inspired neuromorphic event-based camera, capture only changes in light intensity per-pixel to achieve operational superiority in sensing latency (O(μs)), energy consumption (O(mW)), high dynamic range (140dB), and task accuracy such as in object tracking, over traditional RGB camera streams. However, highly dynamic scenes can yield an event rate of up to 12MEvents/second, the processing of which could overwhelm …

Criticality Aware Canvas-Based Visual Perception At The Edge, Ila Gokarn

Research Collection School Of Computing and Information Systems

Efficient and effective machine perception remains a formidable challenge in sustaining high fidelity and high throughput of perception tasks on affordable edge devices. This is especially due to the continuing increase in resolution of sensor streams (e.g., video input streams generated by 4K/8K cameras and neuromorphic event cameras that produce ≥ 10 MEvents/second) and computational complexity of Deep Neural Network (DNN) models, which overwhelms edge platforms, adversely impacting machine perception efficiency. Given the insufficiency of the available computation resources, a question then arises on whether selected regions/components of the perception task can be prioritized (and executed preferentially) to achieve highest …

Learning Dynamic Multimodal Network Slot Concepts From The Web For Forecasting Environmental, Social And Governance Ratings, Gary Ang, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Dynamic multimodal networks are networks with node attributes from different modalities where the at- tributes and network relationships evolve across time, i.e., both networks and multimodal attributes are dynamic; for example, dynamic relationship networks between companies that evolve across time due to changes in business strategies and alliances, which are associated with dynamic company attributes from multiple modalities such as textual online news, categorical events, and numerical financial-related data. Such information can be useful in predictive tasks involving companies. Environmental, social, and gov- ernance (ESG) ratings of companies are important for assessing the sustainability risks of companies. The process of …

Improving Interpretable Embeddings For Ad-Hoc Video Search With Generative Captions And Multi-Word Concept Bank, Jiaxin Wu, Chong-Wah Ngo, Wing-Kwong Chan

Research Collection School Of Computing and Information Systems

Aligning a user query and video clips in cross-modal latent space and that with semantic concepts are two mainstream approaches for ad-hoc video search (AVS). However, the effectiveness of existing approaches is bottlenecked by the small sizes of available video-text datasets and the low quality of concept banks, which results in the failures of unseen queries and the out-of-vocabulary problem. This paper addresses these two problems by constructing a new dataset and developing a multi-word concept bank. Specifically, capitalizing on a generative model, we construct a new dataset consisting of 7 million generated text and video pairs for pre-training. To …

The Low-Carbon Vehicle Routing Problem With Dynamic Speed On Steep Roads, Jianhua Xiao, Xiaoyang Liu, Huixian Zhang, Zhiguang Cao, Liujiang Kang, Yunyun Niu

Research Collection School Of Computing and Information Systems

The low-carbon vehicle routing problem with dynamic speeds on steep roads (LCVRPDS-SR) considers the combined effects of dynamic speeds, steep roads, and loads on carbon emissions. Earlier low-carbon vehicle routing problems typically assumed that vehicles travel at a constant speed on flat roads. However, such models do not apply in urban or rural areas with steep roads. Although the subsequent studies further explored the effect of steep roads, their performance are still suboptimal since they fail to take into account the varying speeds on the terrain. This paper proposes an extended LCVRPDS-SR model that tackles dynamic speed decisions on steep …

Actively Learn From Llms With Uncertainty Propagation For Generalized Category Discovery, Jinggui Liang, Lizi Liao, Hao Fei, Bobo Li, Jing Jiang

Research Collection School Of Computing and Information Systems

Generalized category discovery faces a key issue: the lack of supervision for new and unseen data categories. Traditional methods typically combine supervised pretraining with self-supervised learning to create models, and then employ clustering for category identification. However, these approaches tend to become overly tailored to known categories, failing to fully resolve the core issue. Hence, we propose to integrate the feedback from LLMs into an active learning paradigm. Specifically, our method innovatively employs uncertainty propagation to select data samples from high-uncertainty regions, which are then labeled using LLMs through a comparison-based prompting scheme. This not only eases the labeling task …

Sgsh : Stimulate Large Language Models With Skeleton Heuristics For Knowledge Base Question Generation, Shasha Guo, Lizi Liao, Jing Zhang, Yanling Wang, Cuiping Li, Hong Chen

Research Collection School Of Computing and Information Systems

Knowledge base question generation (KBQG) aims to generate natural language questions from a set of triplet facts extracted from KB. Existing methods have significantly boosted the performance of KBQG via pre-trained language models (PLMs) thanks to the richly endowed semantic knowledge. With the advance of pre-training techniques, large language models (LLMs) (e.g., GPT-3.5) undoubtedly possess much more semantic knowledge. Therefore, how to effectively organize and exploit the abundant knowledge for KBQG becomes the focus of our study. In this work, we propose SGSH — a simple and effective framework to Stimulate GPT-3.5 with Skeleton Heuristics to enhance KBQG. The framework …

Generalized Graph Prompt: Toward A Unification Of Pre-Training And Downstream Tasks On Graphs, Xingtong Yu, Zhenghao Liu, Yuan Fang, Et Al.

Research Collection School Of Computing and Information Systems

Graphs can model complex relationships between objects, enabling a myriad of Web applications such as online page/article classification and social recommendation. While graph neural networks (GNNs) have emerged as a powerful tool for graph representation learning, in an end-to-end supervised setting, their performance heavily relies on a large amount of task-specific supervision. To reduce labeling requirement, the 'pre-train, fine-tune' and 'pre-train, prompt' paradigms have become increasingly common. In particular, prompting is a popular alternative to fine-tuning in natural language processing, which is designed to narrow the gap between pre-training and downstream objectives in a task-specific manner. However, existing study of …

Toward Generalist Anomaly Detection Via In-Context Residual Learning With Few-Shot Sample Prompts, Jiawen Zhu, Guansong Pang

Research Collection School Of Computing and Information Systems

This paper explores the problem of Generalist Anomaly Detection (GAD), aiming to train one single detection model that can generalize to detect anomalies in diverse datasets from different application domains without any further training on the target data. Some recent studies have showed that large pre-trained Visual-Language Models (VLMs) like CLIP have strong generalization capabilities on detecting industrial defects from various datasets, but their methods rely heavily on handcrafted text prompts about defects, making them difficult to generalize to anomalies in other applications, e.g., medical image anomalies or semantic anomalies in natural images. In this work, we propose to train …

Beyond Textual Constraints : Learning Novel Diffusion Conditions With Fewer Examples, Yuyang Yu, Bangzhen Liu, Chenxi Zheng, Xuemiao Xu, Huaidong Zhang, Shengfeng He

Research Collection School Of Computing and Information Systems

In this paper, we delve into a novel aspect of learning novel diffusion conditions with datasets an order of magnitude smaller. The rationale behind our approach is the elimination of textual constraints during the few-shot learning process. To that end, we implement two optimization strategies. The first, prompt-free conditional learning, utilizes a prompt-free encoder derived from a pre-trained Stable Diffusion model. This strategy is designed to adapt new conditions to the diffusion process by minimizing the textual-visual cor-relation, thereby ensuring a more precise alignment between the generated content and the specified conditions. The second strategy entails condition-specific negative rectification, which …

Learning With Unreliability : Fast Few-Shot Voxel Radiance Fields With Relative Geometric Consistency, Yingjie Xu, Bangzhen Liu, Hao Tang, Bailin Deng, Shengfeng He

Research Collection School Of Computing and Information Systems

We propose a voxel-based optimization framework, Re VoRF, for few-shot radiance fields that strategically ad-dress the unreliability in pseudo novel view synthesis. Our method pivots on the insight that relative depth relationships within neighboring regions are more reliable than the ab-solute color values in disoccluded areas. Consequently, we devise a bilateral geometric consistency loss that carefully navigates the trade-off between color fidelity and geometric accuracy in the context of depth consistency for uncertain regions. Moreover, we present a reliability-guided learning strategy to discern and utilize the variable quality across syn-thesized views, complemented by a reliability-aware voxel smoothing algorithm that smoothens …

D3still : Decoupled Differential Distillation For Asymmetric Image Retrieval, Yi Xie, Yihong Lin, Wenjie Cai, Xuemiao Xu, Huaidong Zhang, Yong Du, Shengfeng He

Research Collection School Of Computing and Information Systems

Existing methods for asymmetric image retrieval employ a rigid pairwise similarity constraint between the query network and the larger gallery network. However, these oneto-one constraint approaches often fail to maintain retrieval order consistency, especially when the query network has limited representational capacity. To overcome this problem, we introduce the Decoupled Differential Distillation (D3still) framework. This framework shifts from absolute one-to-one supervision to optimizing the relational differences in pairwise similarities produced by the query and gallery networks, thereby preserving a consistent retrieval order across both networks. Our method involves computing a pairwise similarity differential matrix within the gallery domain, which is …

The Whole Is Better Than The Sum : Using Aggregated Demonstrations In In-Context Learning For Sequential Recommendation, Wang Lei, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Large language models (LLMs) have shown excellent performance on various NLP tasks. To use LLMs as strong sequential recommenders, we explore the in-context learning approach to sequential recommendation. We investigate the effects of instruction format, task consistency, demonstration selection, and number of demonstrations. As increasing the number of demonstrations in ICL does not improve accuracy despite using a long prompt, we propose a novel method called LLMSRec-Syn that incorporates multiple demonstration users into one aggregated demonstration. Our experiments on three recommendation datasets show that LLMSRec-Syn outperforms state-of-the-art LLM-based sequential recommendation methods. In some cases, LLMSRec-Syn can perform on par with …

Physician-Patient Interactions In Online Healthcare Communities: The Effects Of Preconsultation On Service Delivery And Patient Satisfaction, Qian Tang, Anqi Zhao

Research Collection School Of Computing and Information Systems

Preconsultation by medical professionals is a common practice in offline healthcare services to improve consultation efficiency but is rarely adopted for online healthcare services. In a noteworthy departure from this trend, a Chinese online healthcare community (OHC) has instituted preconsultation by assistant physicians prior to online consultations. Using comprehensive service data from this OHC, this study scrutinizes the effects of preconsultation on online healthcare services from both the physician and patient perspectives. The findings reveal that preconsultation by the assistant physician can significantly increase the attending physician’s response speed, length, and provision of informational support, while maintaining a consistent level …

More Human-Likeness, Less Self-Disclosure? Avatars' Form Realism And Job Applicants' Self-Disclosure In Ai Interviews, Yamin Xu, Keng Siau, Fiona Fui-Hoon Nah

Research Collection School Of Computing and Information Systems

The rise of AI in recruitment promises to revolutionize how organizations evaluate job candidates. The quality of AI evaluations is determined by the input data, which depends on job applicants' self-disclosure. However, little is known about how the design elements of AI interview systems, particularly avatar interviewers, influence job applicants' self-disclosure during these interactions. This study aims to address this gap by specifically focusing on how the form realism of avatar interviewers affects job applicants' self-disclosure through their perceptions. In addition, the study will examine the effects of job type as a moderator. Drawing on the Stimulus-Organism-Response (S-O-R) model, this …

Try It Together - Qualitative Coding With Atlas.Ti, Danping Dong, Bryan Leow

2024 AI for Research Week

This hands-on session introduces Atlas.ti, a well-established qualitative data analysis tool for analyzing your transcripts and textual data. The session will cover coding data, extracting insights, creating visualizations, and exploring the tool's latest AI features.

Try It Together: Transcribing Your Audio With Whisper Api, Bella Ratmelia

2024 AI for Research Week

In this hands-on session, we will explore using the Whisper API to transcribe audio recordings from interviews, focus groups, and speeches. The session will delve into best practices and address common issues that may arise during the transcription process.

Academic Search And Discovery Tools In The Age Of Ai And Large Language Models: An Overview Of The Space, Aaron Tay

2024 AI for Research Week

In the ever-evolving landscape of academic research, “AI tools” for literature search and synthesis are currently getting a lot of attention. These tools promise to ramp up productivity, enabling us to accomplish more in less time or absorb more knowledge without drowning in endless reading. With the sheer number of these systems increasing daily, it's natural to wonder: are they really worth our time and money? And if they are, how should we go about picking the right one from the multitude of options?

In this talk, I will share my views on how the space has developed over two …

Academic Literature Review In Age Of Ai And Large Language Models​, Aaron Tay

Research Collection Library

Explore the evolving landscape of academic research with a focus on open data and AI advancements, particularly in natural language processing. Join us for a practical presentation on leveraging emerging tools for literature review. Discover platforms like Connected Papers, ResearchRabbit, and Litmaps, offering paper exploration and recommendations based on initial 'seed papers.' Dive into AI-enhanced search engines like Elicit, Scispace, Semantic Scholar, and Scite.ai, powered by Large Language Models such as BERT and GPT. Learn about the latest developments, strengths, and weaknesses of these tools, and how they reshape literature review methods, from tool selection to query input techniques.

Lecture-Style Tutorial: Towards Graph Foundation Models, Chuan Shi, Cheng Yang, Yuan Fang, Lichao Sun, Philip Yu

Research Collection School Of Computing and Information Systems

Emerging as fundamental building blocks for diverse artificial intelligence applications, foundation models have achieved notable success across natural language processing and many other domains. Concurrently, graph machine learning has gradually evolved from shallow methods to deep models to leverage the abundant graph-structured data that constitute an important pillar in the data ecosystem for artificial intelligence. Naturally, the emergence and homogenization capabilities of foundation models have piqued the interest of graph machine learning researchers. This has sparked discussions about developing a next-generation graph learning paradigm, one that is pre-trained on broad graph data and can be adapted to a wide range …

An Evaluation Of Heart Rate Monitoring With In-Ear Microphones Under Motion, Kayla-Jade Butkow, Ting Dang, Andrea Ferlini, Dong Ma, Yang Liu, Cecilia Mascolo

Research Collection School Of Computing and Information Systems

With the soaring adoption of in-ear wearables, the research community has started investigating suitable in-ear heart rate detection systems. Heart rate is a key physiological marker of cardiovascular health and physical fitness. Continuous and reliable heart rate monitoring with wearable devices has therefore gained increasing attention in recent years. Existing heart rate detection systems in wearables mainly rely on photoplethysmography (PPG) sensors, however, these are notorious for poor performance in the presence of human motion. In this work, leveraging the occlusion effect that enhances low-frequency bone-conducted sounds in the ear canal, we investigate for the first time in-ear audio-based motion-resilient …

Social Balance On Networks: Local Minima And Best-Edge Dynamics, Krishnendu Chatterjee, Jakub Svoboda, Dorde Zikelic, Andreas Pavlogiannis, Josef Tkadlec

Research Collection School Of Computing and Information Systems

Structural balance theory is an established framework for studying social relationships of friendship and enmity. These relationships are modeled by a signed network whose energy potential measures the level of imbalance, while stochastic dynamics drives the network toward a state of minimum energy that captures social balance. It is known that this energy landscape has local minima that can trap socially aware dynamics, preventing it from reaching balance. Here we first study the robustness and attractor properties of these local minima. We show that a stochastic process can reach them from an abundance of initial states and that some local …

Attribute-Hiding Fuzzy Encryption For Privacy-Preserving Data Evaluation, Zhenhua Chen, Luqi Huang, Guomin Yang, Willy Susilo, Xingbing Fu, Xingxing Jia

Research Collection School Of Computing and Information Systems

Privacy-preserving data evaluation is one of the prominent research topics in the big data era. In many data evaluation applications that involve sensitive information, such as the medical records of patients in a medical system, protecting data privacy during the data evaluation process has become an essential requirement. Aiming at solving this problem, numerous fuzzy encryption systems for different similarity metrics have been proposed in literature. Unfortunately, the existing fuzzy encryption systems either fail to achieve attribute-hiding or achieve it, but are impractical. In this paper, we propose a new fuzzy encryption scheme for privacy-preserving data evaluation based on overlap …

Diffusion-Based Negative Sampling On Graphs For Link Prediction, Yuan Fang, Yuan Fang

Research Collection School Of Computing and Information Systems

Link prediction is a fundamental task for graph analysis with important applications on the Web, such as social network analysis and recommendation systems, etc. Modern graph link prediction methods often employ a contrastive approach to learn robust node representations, where negative sampling is pivotal. Typical negative sampling methods aim to retrieve hard examples based on either predefined heuristics or automatic adversarial approaches, which might be inflexible or difficult to control. Furthermore, in the context of link prediction, most previous methods sample negative nodes from existing substructures of the graph, missing out on potentially more optimal samples in the latent space. …

Multigprompt For Multi-Task Pre-Training And Prompting On Graphs, Xingtong Yu, Chang Zhou, Yuan Fang, Xinming Zhan

Research Collection School Of Computing and Information Systems

Graph Neural Networks (GNNs) have emerged as a mainstream technique for graph representation learning. However, their efficacy within an end-to-end supervised framework is significantly tied to the availability of task-specific labels. To mitigate labeling costs and enhance robustness in few-shot settings, pre-training on self-supervised tasks has emerged as a promising method, while prompting has been proposed to further narrow the objective gap between pretext and downstream tasks. Although there has been some initial exploration of prompt-based learning on graphs, they primarily leverage a single pretext task, resulting in a limited subset of general knowledge that could be learned from the …

Unraveling The ‘Anomaly’ In Time Series Anomaly Detection: A Self-Supervised Tri-Domain Solution, Yuting Sun, Guansong Pang, Guanhua Ye, Tong Chen, Xia Hu, Hongzhi Yin

Research Collection School Of Computing and Information Systems

The ongoing challenges in time series anomaly detection (TSAD), including the scarcity of anomaly labels and the variability in anomaly lengths and shapes, have led to the need for a more robust and efficient solution. As limited anomaly labels hinder traditional supervised models in anomaly detection, various state-of-the-art (SOTA) deep learning (DL) techniques (e.g., self-supervised learning) are introduced to tackle this issue. However, they encounter difficulties handling variations in anomaly lengths and shapes, limiting their adaptability to diverse anomalies. Additionally, many benchmark datasets suffer from the problem of having explicit anomalies that even random functions can detect. This problem is …

Explaining Sequences Of Actions In Multi-Agent Deep Reinforcement Learning Models, Phyo Wai Khaing, Minghong Geng, Shubham Pateria, Budhitama Subagdja, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

This paper introduces a method to explain MADRL agents’ behaviors by abstracting their actions into high-level strategies. Particularly, a spatio-temporal neural network model is applied to encode the agents’ sequences of actions as memory episodes wherein an aggregating memory retrieval can generalize them into a concise abstract representation of collective strategies. To assess the effectiveness of our method, we applied it to explain the actions of QMIX MADRL agents playing a StarCraft Multi-agent Challenge (SMAC) video game. A user study on the perceived explainability of the extracted strategies indicates that our method can provide comprehensible explanations at various levels of …

Term Importance For Transformer-Based Qa Retrieval : A Case Study Of Stackexchange, Bryan Zhi Yang Tan, Hady W. Lauw

Research Collection School Of Computing and Information Systems

Question-answering (QA) retrieval is the task of retrieving the most relevant answer to a given question from a collection of answers. Various approaches to QA retrieval have been developed recently. One successful and popular model is Contextualized Late Interaction over BERT (ColBERT), a transformer-based approach that adopts a query-document scoring mechanism that retains the granularity of transformer matching, whilst improving on efficiency. However, one key limitation is that it requires further fine-tuning for new query or collection types. In this work, we explore and propose several non-parametric retrieval augmentation methods based on explicit signals of term importance that improve over …