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

Physical Sciences and Mathematics Commons™

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

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 31 - 60 of 6848

Full-Text Articles in Physical Sciences and Mathematics

Conditional Neural Heuristic For Multiobjective Vehicle Routing Problems, Mingfeng Fan, Yaoxin Wu, Zhiguang Cao, Wen Song, Guillaume Sartoretti, Huan Liu, Guohua Wu Mar 2024

Conditional Neural Heuristic For Multiobjective Vehicle Routing Problems, Mingfeng Fan, Yaoxin Wu, Zhiguang Cao, Wen Song, Guillaume Sartoretti, Huan Liu, Guohua Wu

Research Collection School Of Computing and Information Systems

Existing neural heuristics for multiobjective vehicle routing problems (MOVRPs) are primarily conditioned on instance context, which failed to appropriately exploit preference and problem size, thus holding back the performance. To thoroughly unleash the potential, we propose a novel conditional neural heuristic (CNH) that fully leverages the instance context, preference, and size with an encoder–decoder structured policy network. Particularly, in our CNH, we design a dual-attention-based encoder to relate preferences and instance contexts, so as to better capture their joint effect on approximating the exact Pareto front (PF). We also design a size-aware decoder based on the sinusoidal encoding to explicitly …

Go to article

Knowledge Generation For Zero-Shot Knowledge-Based Vqa, Rui Cao, Jing Jiang Mar 2024

Knowledge Generation For Zero-Shot Knowledge-Based Vqa, Rui Cao, Jing Jiang

Research Collection School Of Computing and Information Systems

Previous solutions to knowledge-based visual question answering (K-VQA) retrieve knowledge from external knowledge bases and use supervised learning to train the K-VQA model. Recently pre-trained LLMs have been used as both a knowledge source and a zero-shot QA model for K-VQA and demonstrated promising results. However, these recent methods do not explicitly show the knowledge needed to answer the questions and thus lack interpretability. Inspired by recent work on knowledge generation from LLMs for text-based QA, in this work we propose and test a similar knowledge-generation-based K-VQA method, which first generates knowledge from an LLM and then incorporates the generated …

Go to article

Hypergraphs With Attention On Reviews For Explainable Recommendation, Theis E. Jendal, Trung Hoang Le, Hady Wirawan Lauw, Matteo Lissandrini, Peter Dolog, Katja Hose Mar 2024

Hypergraphs With Attention On Reviews For Explainable Recommendation, Theis E. Jendal, Trung Hoang Le, Hady Wirawan Lauw, Matteo Lissandrini, Peter Dolog, Katja Hose

Research Collection School Of Computing and Information Systems

Given a recommender system based on reviews, the challenges are how to effectively represent the review data and how to explain the produced recommendations. We propose a novel review-specific Hypergraph (HG) model, and further introduce a model-agnostic explainability module. The HG model captures high-order connections between users, items, aspects, and opinions while maintaining information about the review. The explainability module can use the HG model to explain a prediction generated by any model. We propose a path-restricted review-selection method biased by the user preference for item reviews and propose a novel explanation method based on a review graph. Experiments on …

Go to article

Community Similarity Based On User Profile Joins, Konstantinos Theocharidis, Hady Wirawan Lauw Mar 2024

Community Similarity Based On User Profile Joins, Konstantinos Theocharidis, Hady Wirawan Lauw

Research Collection School Of Computing and Information Systems

Similarity joins on multidimensional data are crucial operators for recommendation purposes. The classic ��-join problem finds all pairs of points within �� distance to each other among two ��-dimensional datasets. In this paper, we consider a novel and alternative version of ��-join named community similarity based on user profile joins (CSJ). The aim of CSJ problem is, given two communities having a set of ��-dimensional users, to find how similar are the communities by matching every single pair of users (a user can be matched with at most one other user) having an absolute difference of at most �� per …

Go to article

Revisiting The Markov Property For Machine Translation, Cunxiao Du, Hao Zhou, Zhaopeng Tu, Jing Jiang Mar 2024

Revisiting The Markov Property For Machine Translation, Cunxiao Du, Hao Zhou, Zhaopeng Tu, Jing Jiang

Research Collection School Of Computing and Information Systems

In this paper, we re-examine the Markov property in the context of neural machine translation. We design a Markov Autoregressive Transformer (MAT) and undertake a comprehensive assessment of its performance across four WMT benchmarks. Our findings indicate that MAT with an order larger than 4 can generate translations with quality on par with that of conventional autoregressive transformers. In addition, counter-intuitively, we also find that the advantages of utilizing a higher-order MAT do not specifically contribute to the translation of longer sentences.

Go to article

On The Effects Of Information Asymmetry In Digital Currency Trading, Kwansoo Kim, Robert John Kauffman Mar 2024

On The Effects Of Information Asymmetry In Digital Currency Trading, Kwansoo Kim, Robert John Kauffman

Research Collection School Of Computing and Information Systems

We report on two studies that examine how social sentiment influences information asymmetry in digital currency markets. We also assess whether cryptocurrency can be an investment vehicle, as opposed to only an instrument for asset speculation. Using a dataset on transactions from an exchange in South Korea and sentiment from Korean social media in 2018, we conducted a study of different trading behavior under two cryptocurrency trading market microstructures: a bid-ask spread dealer's market and a continuous trading buy-sell, immediate trade execution market. Our results highlight the impacts of positive and negative trader social sentiment valences on the effects of …

Go to article

Monocular Bev Perception Of Road Scenes Via Front-To-Top View Projection, Wenxi Liu, Qi Li, Weixiang Yang, Jiaxin Cai, Yuanhong Yu, Yuexin Ma, Shengfeng He, Jia Pan Mar 2024

Monocular Bev Perception Of Road Scenes Via Front-To-Top View Projection, Wenxi Liu, Qi Li, Weixiang Yang, Jiaxin Cai, Yuanhong Yu, Yuexin Ma, Shengfeng He, Jia Pan

Research Collection School Of Computing and Information Systems

HD map reconstruction is crucial for autonomous driving. LiDAR-based methods are limited due to expensive sensors and time-consuming computation. Camera-based methods usually need to perform road segmentation and view transformation separately, which often causes distortion and missing content. To push the limits of the technology, we present a novel framework that reconstructs a local map formed by road layout and vehicle occupancy in the bird's-eye view given a front-view monocular image only. We propose a front-to-top view projection (FTVP) module, which takes the constraint of cycle consistency between views into account and makes full use of their correlation to strengthen …

Go to article

Stopguess: A Framework For Public-Key Authenticated Encryption With Keyword Search, Tao Xiang, Zhongming Wang, Biwen Chen, Xiaoguo Li, Peng Wang, Fei Chen Mar 2024

Stopguess: A Framework For Public-Key Authenticated Encryption With Keyword Search, Tao Xiang, Zhongming Wang, Biwen Chen, Xiaoguo Li, Peng Wang, Fei Chen

Research Collection School Of Computing and Information Systems

Public key encryption with keyword search (PEKS) allows users to search on encrypted data without leaking the keyword information from the ciphertexts. But it does not preserve keyword privacy within the trapdoors, because an adversary (e.g., untrusted server) might launch inside keyword-guessing attacks (IKGA) to guess keywords from the trapdoors. In recent years, public key authenticated encryption with keyword search (PAEKS) has become a promising primitive to counter the IKGA. However, existing PAEKS schemes focus on the concrete construction of PAEKS, making them unable to support modular construction, intuitive proof, or flexible extension. In this paper, our proposal called “StopGuess” …

Go to article

Transiam: Aggregating Multi-Modal Visual Features With Locality For Medical Image Segmentation, Xuejian Li, Shiqiang Ma, Junhai Xu, Jijun Tang, Shengfeng He, Fei Guo Mar 2024

Transiam: Aggregating Multi-Modal Visual Features With Locality For Medical Image Segmentation, Xuejian Li, Shiqiang Ma, Junhai Xu, Jijun Tang, Shengfeng He, Fei Guo

Research Collection School Of Computing and Information Systems

Automatic segmentation of medical images plays an important role in the diagnosis of diseases. On single-modal data, convolutional neural networks have demonstrated satisfactory performance. However, multi-modal data encompasses a greater amount of information rather than single-modal data. Multi-modal data can be effectively used to improve the segmentation accuracy of regions of interest by analyzing both spatial and temporal information. In this study, we propose a dual-path segmentation model for multi-modal medical images, named TranSiam. Taking into account that there is a significant diversity between the different modalities, TranSiam employs two parallel CNNs to extract the features which are specific to …

Go to article

Simulated Annealing With Reinforcement Learning For The Set Team Orienteering Problem With Time Windows, Vincent F. Yu, Nabila Y. Salsabila, Shih-W Lin, Aldy Gunawan Mar 2024

Simulated Annealing With Reinforcement Learning For The Set Team Orienteering Problem With Time Windows, Vincent F. Yu, Nabila Y. Salsabila, Shih-W Lin, Aldy Gunawan

Research Collection School Of Computing and Information Systems

This research investigates the Set Team Orienteering Problem with Time Windows (STOPTW), a new variant of the well-known Team Orienteering Problem with Time Windows and Set Orienteering Problem. In the STOPTW, customers are grouped into clusters. Each cluster is associated with a profit attainable when a customer in the cluster is visited within the customer's time window. A Mixed Integer Linear Programming model is formulated for STOPTW to maximizing total profit while adhering to time window constraints. Since STOPTW is an NP-hard problem, a Simulated Annealing with Reinforcement Learning (SARL) algorithm is developed. The proposed SARL incorporates the core concepts …

Go to article

Fixing Your Own Smells: Adding A Mistake-Based Familiarization Step When Teaching Code Refactoring, Ivan Wei Han Tan, Christopher M. Poskitt Mar 2024

Fixing Your Own Smells: Adding A Mistake-Based Familiarization Step When Teaching Code Refactoring, Ivan Wei Han Tan, Christopher M. Poskitt

Research Collection School Of Computing and Information Systems

Programming problems can be solved in a multitude of functionally correct ways, but the quality of these solutions (e.g. readability, maintainability) can vary immensely. When code quality is poor, symptoms emerge in the form of 'code smells', which are specific negative characteristics (e.g. duplicate code) that can be resolved by applying refactoring patterns. Many undergraduate computing curricula train students on this software engineering practice, often doing so via exercises on unfamiliar instructor-provided code. Our observation, however, is that this makes it harder for novices to internalise refactoring as part of their own development practices. In this paper, we propose a …

Go to article

Ditmos: Delving Into Diverse Tiny-Model Selection On Microcontrollers, Xiao Ma, Shengfeng He, Hezhe Qiao, Dong Ma Mar 2024

Ditmos: Delving Into Diverse Tiny-Model Selection On Microcontrollers, Xiao Ma, Shengfeng He, Hezhe Qiao, Dong Ma

Research Collection School Of Computing and Information Systems

Enabling efficient and accurate deep neural network (DNN) inference on microcontrollers is non-trivial due to the constrained on-chip resources. Current methodologies primarily focus on compressing larger models yet at the expense of model accuracy. In this paper, we rethink the problem from the inverse perspective by constructing small/weak models directly and improving their accuracy. Thus, we introduce DiTMoS, a novel DNN training and inference framework with a selectorclassifiers architecture, where the selector routes each input sample to the appropriate classifier for classification. DiTMoS is grounded on a key insight: a composition of weak models can exhibit high diversity and the …

Go to article

T-Pickseer: Visual Analysis Of Taxi Pick-Up Point Selection Behavior, Shuxian Gu, Yemo Dai, Zezheng Feng, Yong Wang, Haipeng Zeng Mar 2024

T-Pickseer: Visual Analysis Of Taxi Pick-Up Point Selection Behavior, Shuxian Gu, Yemo Dai, Zezheng Feng, Yong Wang, Haipeng Zeng

Research Collection School Of Computing and Information Systems

Taxi drivers often take much time to navigate the streets to look for passengers, which leads to high vacancy rates and wasted resources. Empty taxi cruising remains a big concern for taxi companies. Analyzing the pick-up point selection behavior can solve this problem effectively, providing suggestions for taxi management and dispatch. Many studies have been devoted to analyzing and recommending hotspot regions of pick-up points, which can make it easier for drivers to pick-up passengers. However, the selection of pick-up points is complex and affected by multiple factors, such as convenience and traffic management. Most existing approaches cannot produce satisfactory …

Go to article

Imitate The Good And Avoid The Bad: An Incremental Approach To Safe Reinforcement Learning, Minh Huy Hoang, Mai Anh Tien, Pradeep Varakantham Feb 2024

Imitate The Good And Avoid The Bad: An Incremental Approach To Safe Reinforcement Learning, Minh Huy Hoang, Mai Anh Tien, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

A popular framework for enforcing safe actions in Reinforcement Learning (RL) is Constrained RL, where trajectory based constraints on expected cost (or other cost measures) are employed to enforce safety and more importantly these constraints are enforced while maximizing expected reward. Most recent approaches for solving Constrained RL convert the trajectory based cost constraint into a surrogate problem that can be solved using minor modifications to RL methods. A key drawback with such approaches is an over or underestimation of the cost constraint at each state. Therefore, we provide an approach that does not modify the trajectory based cost constraint …

Go to article

Catnet: Cross-Modal Fusion For Audio-Visual Speech Recognition, Xingmei Wang, Jianchen Mi, Boquan Li, Yixu Zhao, Jiaxiang Meng Feb 2024

Catnet: Cross-Modal Fusion For Audio-Visual Speech Recognition, Xingmei Wang, Jianchen Mi, Boquan Li, Yixu Zhao, Jiaxiang Meng

Research Collection School Of Computing and Information Systems

Automatic speech recognition (ASR) is a typical pattern recognition technology that converts human speeches into texts. With the aid of advanced deep learning models, the performance of speech recognition is significantly improved. Especially, the emerging Audio–Visual Speech Recognition (AVSR) methods achieve satisfactory performance by combining audio-modal and visual-modal information. However, various complex environments, especially noises, limit the effectiveness of existing methods. In response to the noisy problem, in this paper, we propose a novel cross-modal audio–visual speech recognition model, named CATNet. First, we devise a cross-modal bidirectional fusion model to analyze the close relationship between audio and visual modalities. Second, …

Go to article

Glop: Learning Global Partition And Local Construction For Solving Large-Scale Routing Problems In Real-Time, Haoran Ye, Jiarui Wang, Helan Liang, Zhiguang Cao, Yong Li, Fanzhang Li Feb 2024

Glop: Learning Global Partition And Local Construction For Solving Large-Scale Routing Problems In Real-Time, Haoran Ye, Jiarui Wang, Helan Liang, Zhiguang Cao, Yong Li, Fanzhang Li

Research Collection School Of Computing and Information Systems

The recent end-to-end neural solvers have shown promise for small-scale routing problems but suffered from limited real-time scaling-up performance. This paper proposes GLOP (Global and Local Optimization Policies), a unified hierarchical framework that efficiently scales toward large-scale routing problems. GLOP partitions large routing problems into Travelling Salesman Problems (TSPs) and TSPs into Shortest Hamiltonian Path Problems. For the first time, we hybridize non-autoregressive neural heuristics for coarse-grained problem partitions and autoregressive neural heuristics for fine-grained route constructions, leveraging the scalability of the former and the meticulousness of the latter. Experimental results show that GLOP achieves competitive and state-of-the-art real-time performance …

Go to article

Recommendations With Minimum Exposure Guarantees: A Post-Processing Framework, Ramon Lopes, Rodrigo Alves, Antoine Ledent, Rodrygo L. T. Santos, Marius Kloft Feb 2024

Recommendations With Minimum Exposure Guarantees: A Post-Processing Framework, Ramon Lopes, Rodrigo Alves, Antoine Ledent, Rodrygo L. T. Santos, Marius Kloft

Research Collection School Of Computing and Information Systems

Relevance-based ranking is a popular ingredient in recommenders, but it frequently struggles to meet fairness criteria because social and cultural norms may favor some item groups over others. For instance, some items might receive lower ratings due to some sort of bias (e.g. gender bias). A fair ranking should balance the exposure of items from advantaged and disadvantaged groups. To this end, we propose a novel post-processing framework to produce fair, exposure-aware recommendations. Our approach is based on an integer linear programming model maximizing the expected utility while satisfying a minimum exposure constraint. The model has fewer variables than previous …

Go to article

When Evolutionary Computation Meets Privacy, Bowen Zhao, Wei-Neng Chen, Xiaoguo Li, Ximeng Liu, Qingqi Pei, Jun Zhang Feb 2024

When Evolutionary Computation Meets Privacy, Bowen Zhao, Wei-Neng Chen, Xiaoguo Li, Ximeng Liu, Qingqi Pei, Jun Zhang

Research Collection School Of Computing and Information Systems

Recently, evolutionary computation (EC) has experienced significant advancements due to the integration of machine learning, distributed computing, and big data technologies. These developments have led to new research avenues in EC, such as distributed EC and surrogate-assisted EC. While these advancements have greatly enhanced the performance and applicability of EC, they have also raised concerns regarding privacy leakages, specifically the disclosure of optimal results and surrogate models. Consequently, the combination of evolutionary computation and privacy protection becomes an increasing necessity. However, a comprehensive exploration of privacy concerns in evolutionary computation is currently lacking, particularly in terms of identifying the object, …

Go to article

Handling Long And Richly Constrained Tasks Through Constrained Hierarchical Reinforcement Learning, Yuxiao Lu, Arunesh Sinha, Pradeep Varakantham Feb 2024

Handling Long And Richly Constrained Tasks Through Constrained Hierarchical Reinforcement Learning, Yuxiao Lu, Arunesh Sinha, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

Safety in goal directed Reinforcement Learning (RL) settings has typically been handled through constraints over trajectories and have demonstrated good performance in primarily short horizon tasks. In this paper, we are specifically interested in the problem of solving temporally extended decision making problems such as robots cleaning different areas in a house while avoiding slippery and unsafe areas (e.g., stairs) and retaining enough charge to move to a charging dock; in the presence of complex safety constraints. Our key contribution is a (safety) Constrained Search with Hierarchical Reinforcement Learning (CoSHRL) mechanism that combines an upper level constrained search agent (which …

Go to article

Foodmask: Real-Time Food Instance Counting, Segmentation And Recognition, Huu-Thanh Nguyen, Yu Cao, Chong-Wah Ngo, Wing-Kwong Chan Feb 2024

Foodmask: Real-Time Food Instance Counting, Segmentation And Recognition, Huu-Thanh Nguyen, Yu Cao, Chong-Wah Ngo, Wing-Kwong Chan

Research Collection School Of Computing and Information Systems

Food computing has long been studied and deployed to several applications. Understanding a food image at the instance level, including recognition, counting and segmentation, is essential to quantifying nutrition and calorie consumption. Nevertheless, existing techniques are limited to either category-specific instance detection, which does not reflect precisely the instance size at the pixel level, or category-agnostic instance segmentation, which is insufficient for dish recognition. This paper presents a compact and fast multi-task network, namely FoodMask, for clustering-based food instance counting, segmentation and recognition. The network learns a semantic space simultaneously encoding food category distribution and instance height at pixel basis. …

Go to article

Public Acceptance Of Using Artificial Intelligence-Assisted Weight Management Apps In High-Income Southeast Asian Adults With Overweight And Obesity: A Cross-Sectional Study, Han Shi Jocelyn Chew, Palakorn Achananuparp, Palakorn Achananuparp, Nicholas W. S. Chew, Yip Han Chin, Yujia Gao, Bok Yan Jimmy So, Asim Shabbir, Ee-Peng Lim, Kee Yuan Ngiam Feb 2024

Public Acceptance Of Using Artificial Intelligence-Assisted Weight Management Apps In High-Income Southeast Asian Adults With Overweight And Obesity: A Cross-Sectional Study, Han Shi Jocelyn Chew, Palakorn Achananuparp, Palakorn Achananuparp, Nicholas W. S. Chew, Yip Han Chin, Yujia Gao, Bok Yan Jimmy So, Asim Shabbir, Ee-Peng Lim, Kee Yuan Ngiam

Research Collection School Of Computing and Information Systems

Introduction: With in increase in interest to incorporate artificial intelligence (AI) into weight management programs, we aimed to examine user perceptions of AI-based mobile apps for weight management in adults with overweight and obesity. Methods: 280 participants were recruited between May and November 2022. Participants completed a questionnaire on sociodemographic profiles, Unified Theory of Acceptance and Use of Technology 2 (UTAUT2), and Self-Regulation of Eating Behavior Questionnaire. Structural equation modeling was performed using R. Model fit was tested using maximum-likelihood generalized unweighted least squares. Associations between influencing factors were analyzed using correlation and linear regression. Results: 271 participant responses were …

Go to article

Frameworks For Measuring Population Health: A Scoping Review, Sze Ling Chan, Clement Zhong Hao Ho, Nang Ei Ei Khaing, Ezra Ho, Candelyn Pong, Jia Sheng Guan, Calida Chua, Zongbin Li, Trudi Lim Wenqi, Sean Shao Wei Lam, Lian Leng Low, Choon How How Feb 2024

Frameworks For Measuring Population Health: A Scoping Review, Sze Ling Chan, Clement Zhong Hao Ho, Nang Ei Ei Khaing, Ezra Ho, Candelyn Pong, Jia Sheng Guan, Calida Chua, Zongbin Li, Trudi Lim Wenqi, Sean Shao Wei Lam, Lian Leng Low, Choon How How

Research Collection School Of Computing and Information Systems

Introduction Many regions in the world are using the population health approach and require a means to measure the health of their population of interest. Population health frameworks provide a theoretical grounding for conceptualization of population health and therefore a logical basis for selection of indicators. The aim of this scoping review was to provide an overview and summary of the characteristics of existing population health frameworks that have been used to conceptualize the measurement of population health. Methods We used the Population, Concept and Context (PCC) framework to define eligibility criteria of frameworks. We were interested in frameworks applicable …

Go to article

Machine Learning For Refining Knowledge Graphs: A Survey, Budhitama Subagdja, D. Shanthoshigaa, Zhaoxia Wang, Ah-Hwee Tan Feb 2024

Machine Learning For Refining Knowledge Graphs: A Survey, Budhitama Subagdja, D. Shanthoshigaa, Zhaoxia Wang, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Knowledge graph (KG) refinement refers to the process of filling in missing information, removing redundancies, and resolving inconsistencies in knowledge graphs. With the growing popularity of KG in various domains, many techniques involving machine learning have been applied, but there is no survey dedicated to machine learning-based KG refinement yet. Based on a novel framework following the KG refinement process, this paper presents a survey of machine learning approaches to KG refinement according to the kind of operations in KG refinement, the training datasets, mode of learning, and process multiplicity. Furthermore, the survey aims to provide broad practical insights into …

Go to article

Reverse Multi-Choice Dialogue Commonsense Inference With Graph-Of-Thought, Li Zheng, Hao Fei, Fei Li, Bobo Li, Lizi Liao, Donghong Ji, Chong Teng Feb 2024

Reverse Multi-Choice Dialogue Commonsense Inference With Graph-Of-Thought, Li Zheng, Hao Fei, Fei Li, Bobo Li, Lizi Liao, Donghong Ji, Chong Teng

Research Collection School Of Computing and Information Systems

With the proliferation of dialogic data across the Internet, the Dialogue Commonsense Multi-choice Question Answering (DC-MCQ) task has emerged as a response to the challenge of comprehending user queries and intentions. Although prevailing methodologies exhibit effectiveness in addressing single-choice questions, they encounter difficulties in handling multi-choice queries due to the heightened intricacy and informational density. In this paper, inspired by the human cognitive process of progressively excluding options, we propose a three-step Reverse Exclusion Graph-of-Thought (ReX-GoT) framework, including Option Exclusion, Error Analysis, and Combine Information. Specifically, our ReX-GoT mimics human reasoning by gradually excluding irrelevant options and learning the reasons …

Go to article

Hgprompt: Bridging Homogeneous And Heterogeneous Graphs For Few-Shot Prompt Learning, Xingtong Yu, Yuan Fang, Zemin Liu, Xinming Zhang Feb 2024

Hgprompt: Bridging Homogeneous And Heterogeneous Graphs For Few-Shot Prompt Learning, Xingtong Yu, Yuan Fang, Zemin Liu, Xinming Zhang

Research Collection School Of Computing and Information Systems

Graph neural networks (GNNs) and heterogeneous graph neural networks (HGNNs) are prominent techniques for homogeneous and heterogeneous graph representation learning, yet their performance in an end-to-end supervised framework greatly depends on the availability of task-specific supervision. To reduce the labeling cost, pre-training on selfsupervised pretext tasks has become a popular paradigm, but there is often a gap between the pre-trained model and downstream tasks, stemming from the divergence in their objectives. To bridge the gap, prompt learning has risen as a promising direction especially in few-shot settings, without the need to fully fine-tune the pre-trained model. While there has been …

Go to article

Effects Of Voice Pitch On Social Perceptions Vary With Relational Mobility And Homicide Rate, Toe Aung, Et. Al Jan 2024

Effects Of Voice Pitch On Social Perceptions Vary With Relational Mobility And Homicide Rate, Toe Aung, Et. Al

Research Collection School of Social Sciences

Fundamental frequency (fo) is the most perceptually salient vocal acoustic parameter, yet little is known about how its perceptual influence varies across societies. We examined how fo affects key social perceptions and how socioecological variables modulate these effects in 2,647 adult listeners sampled from 44 locations across 22 nations. Low male fo increased men’s perceptions of formidability and prestige, especially in societies with higher homicide rates and greater relational mobility in which male intrasexual competition may be more intense and rapid identification of highstatus competitors may be exigent. High female fo increased women’s perceptions of flirtatiousness where relational mobility was …

Go to article

Cooperative Trucks And Drones For Rural Last-Mile Delivery With Steep Roads, Jiuhong Xiao, Ying Li, Zhiguang Cao, Jianhua Xiao Jan 2024

Cooperative Trucks And Drones For Rural Last-Mile Delivery With Steep Roads, Jiuhong Xiao, Ying Li, Zhiguang Cao, Jianhua Xiao

Research Collection School Of Computing and Information Systems

The cooperative delivery of trucks and drones promises considerable advantages in delivery efficiency and environmental friendliness over pure fossil fuel fleets. As the prosperity of rural B2C e-commerce grows, this study intends to explore the prospect of this cooperation mode for rural last-mile delivery by developing a green vehicle routing problem with drones that considers the presence of steep roads (GVRPD-SR). Realistic energy consumption calculations for trucks and drones that both consider the impacts of general factors and steep roads are incorporated into the GVRPD-SR model, and the objective is to minimize the total energy consumption. To solve the proposed …

Go to article

Continual Learning, Fast And Slow, Quang Anh Pham, Chenghao Liu, Steven C. H. Hoi Jan 2024

Continual Learning, Fast And Slow, Quang Anh Pham, Chenghao Liu, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

According to the Complementary Learning Systems (CLS) theory (McClelland et al. 1995) in neuroscience, humans do effective continual learning through two complementary systems: a fast learning system centered on the hippocampus for rapid learning of the specifics, individual experiences; and a slow learning system located in the neocortex for the gradual acquisition of structured knowledge about the environment. Motivated by this theory, we propose DualNets (for Dual Networks), a general continual learning framework comprising a fast learning system for supervised learning of pattern-separated representation from specific tasks and a slow learning system for representation learning of task-agnostic general representation via …

Go to article

Remote Multi-Person Heart Rate Monitoring With Smart Speakers: Overcoming Separation Constraint, Ngoc Doan Thu Tran, Dong Ma, Rajesh Krishna Balan Jan 2024

Remote Multi-Person Heart Rate Monitoring With Smart Speakers: Overcoming Separation Constraint, Ngoc Doan Thu Tran, Dong Ma, Rajesh Krishna Balan

Research Collection School Of Computing and Information Systems

Heart rate is a key vital sign that can be used to understand an individual’s health condition. Recently, remote sensing techniques, especially acoustic-based sensing, have received increasing attention for their ability to non-invasively detect heart rate via commercial mobile devices such as smartphones and smart speakers. However, due to signal interference, existing methods have primarily focused on monitoring a single user and required a large separation between them when monitoring multiple people. These limitations hinder many common use cases such as couples sharing the same bed or two or more people located in close proximity. In this paper, we present …

Go to article

Provably Secure Decisions Based On Potentially Malicious Information, Dongxia Wang, Tim Muller, Jun Sun Jan 2024

Provably Secure Decisions Based On Potentially Malicious Information, Dongxia Wang, Tim Muller, Jun Sun

Research Collection School Of Computing and Information Systems

There are various security-critical decisions routinely made, on the basis of information provided by peers: routing messages, user reports, sensor data, navigational information, blockchain updates, etc. Jury theorems were proposed in sociology to make decisions based on information from peers, which assume peers may be mistaken with some probability. We focus on attackers in a system, which manifest as peers that strategically report fake information to manipulate decision making. We define the property of robustness: a lower bound probability of deciding correctly, regardless of what information attackers provide. When peers are independently selected, we propose an optimal, robust decision mechanism …

Go to article

First Prev Next Last