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 1 - 30 of 7445

Full-Text Articles in Physical Sciences and Mathematics

A Comprehensive Survey On Relation Extraction: Recent Advances And New Frontiers, Xiaoyan Zhao, Yang Deng, Min Yang, Lingzhi Wang, Rui Zhang, Hong Cheng, Wai Lam, Ying Shen, Ruifeng Xu Jun 2026

A Comprehensive Survey On Relation Extraction: Recent Advances And New Frontiers, Xiaoyan Zhao, Yang Deng, Min Yang, Lingzhi Wang, Rui Zhang, Hong Cheng, Wai Lam, Ying Shen, Ruifeng Xu

Research Collection School Of Computing and Information Systems

Relation extraction (RE) involves identifying the relations between entities from underlying content. RE serves as the foundation for many natural language processing (NLP) and information retrieval applications, such as knowledge graph completion and question answering. In recent years, deep neural networks have dominated the field of RE and made noticeable progress. Subsequently, the large pre-trained language models (PLMs) have taken the state-of-the-art RE to a new level. This survey provides a comprehensive review of existing deep learning techniques for RE. First, we introduce RE resources, including datasets and evaluation metrics. Second, we propose a new taxonomy to categorize existing works …

Go to article

Quantitative Bounds On Resource Usage Of Probabilistic Programs, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Dorde Zikelic May 2026

Quantitative Bounds On Resource Usage Of Probabilistic Programs, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Dorde Zikelic

Research Collection School Of Computing and Information Systems

Cost analysis, also known as resource usage analysis, is the task of finding bounds on the total cost of a program and is a well-studied problem in static analysis. In this work, we consider two classical quantitative problems in cost analysis for probabilistic programs. The first problem is to find a bound on the expected total cost of the program. This is a natural measure for the resource usage of the program and can also be directly applied to average-case runtime analysis. The second problem asks for a tail bound, i.e. ‍given a threshold t the goal is to find …

Go to article

Equivalence And Similarity Refutation For Probabilistic Programs, Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Dorde Zikelic Aug 2025

Equivalence And Similarity Refutation For Probabilistic Programs, Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Dorde Zikelic

Research Collection School Of Computing and Information Systems

We consider the problems of statically refuting equivalence and similarity of output distributions defined by a pair of probabilistic programs. Equivalence and similarity are two fundamental relational properties of probabilistic programs that are essential for their correctness both in implementation and in compilation. In this work, we present a new method for static equivalence and similarity refutation. Our method refutes equivalence and similarity by computing a function over program outputs whose expected value with respect to the output distributions of two programs is different. The function is computed simultaneously with an upper expectation supermartingale and a lower expectation submartingale for …

Go to article

On Lexicographic Proof Rules For Probabilistic Termination, Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Jiří Zárevucký, Dorde Zikelic Jun 2025

On Lexicographic Proof Rules For Probabilistic Termination, Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Jiří Zárevucký, Dorde Zikelic

Research Collection School Of Computing and Information Systems

We consider the almost-sure (a.s.) termination problem for probabilistic programs, which are a stochastic extension of classical imperative programs. Lexicographic ranking functions provide a sound and practical approach for termination of non-probabilistic programs, and their extension to probabilistic programs is achieved via lexicographic ranking supermartingales (LexRSMs). However, LexRSMs introduced in the previous work have a limitation that impedes their automation: all of their components have to be non-negative in all reachable states. This might result in a LexRSM not existing even for simple terminating programs. Our contributions are twofold. First, we introduce a generalization of LexRSMs that allows for some …

Go to article

The Model Of Norm-Regulated Responsibility For Proenvironmental Behavior In The Context Of Littering Prevention, Pengya Ai, Sonny Rosenthal Dec 2024

The Model Of Norm-Regulated Responsibility For Proenvironmental Behavior In The Context Of Littering Prevention, Pengya Ai, Sonny Rosenthal

Research Collection College of Integrative Studies

Previous research suggests that descriptive norms positively influence proenvironmental behavior, including littering prevention. However, in some behavioral contexts, a weak descriptive norm may increase individuals’ feelings of responsibility by signaling a need for action. We examined this effect in the context of litter prevention by conducting structural equation modeling of survey data from 1400 Singapore residents. The results showed that descriptive norms negatively predicted ascription of responsibility and were negatively related to littering prevention behavior via ascription of responsibility and personal norms. It also showed that strong injunctive norms can reduce the inhibitory effect of descriptive norms on ascription of …

Go to article

Triadic Temporal-Semantic Alignment For Weakly-Supervised Video Moment Retrieval, Jin Liu, Jialong Xie, Fengyu Zhou, Shengfeng He Dec 2024

Triadic Temporal-Semantic Alignment For Weakly-Supervised Video Moment Retrieval, Jin Liu, Jialong Xie, Fengyu Zhou, Shengfeng He

Research Collection School Of Computing and Information Systems

Video Moment Retrieval (VMR) aims to identify specific event moments within untrimmed videos based on natural language queries. Existing VMR methods have been criticized for relying heavily on moment annotation bias rather than true multi-modal alignment reasoning. Weakly supervised VMR approaches inherently overcome this issue by training without precise temporal location information. However, they struggle with fine-grained semantic alignment and often yield multiple speculative predictions with prolonged video spans. In this paper, we take a step forward in the context of weakly supervised VMR by proposing a triadic temporalsemantic alignment model. Our proposed approach augments weak supervision by comprehensively addressing …

Go to article

Harnessing Collective Structure Knowledge In Data Augmentation For Graph Neural Networks, Rongrong Ma, Guansong Pang, Ling Chen Dec 2024

Harnessing Collective Structure Knowledge In Data Augmentation For Graph Neural Networks, Rongrong Ma, Guansong Pang, Ling Chen

Research Collection School Of Computing and Information Systems

Graph neural networks (GNNs) have achieved state-of-the-art performance in graph representation learning. Message passing neural networks, which learn representations through recursively aggregating information from each node and its neighbors, are among the most commonly-used GNNs. However, a wealth of structural information of individual nodes and full graphs is often ignored in such process, which restricts the expressive power of GNNs. Various graph data augmentation methods that enable the message passing with richer structure knowledge have been introduced as one main way to tackle this issue, but they are often focused on individual structure features and difficult to scale up with …

Go to article

Uncovering Merchants’ Willingness To Wait In On-Demand Food Delivery Markets, Jian Liang, Ya Zhao, Hai Wang, Zuopeng Xiao, Jintao Ke Nov 2024

Uncovering Merchants’ Willingness To Wait In On-Demand Food Delivery Markets, Jian Liang, Ya Zhao, Hai Wang, Zuopeng Xiao, Jintao Ke

Research Collection School Of Computing and Information Systems

While traditional on-demand food delivery services help restaurants reach more customers and enable doorstep deliveries, they also come with drawbacks, such as high commission fees and limited control over the delivery process. White-label food delivery services have emerged as an alternative, ready-to-use platform for restaurants to arrange delivery for customer orders received through their applications or websites, without the constraints imposed by traditional on-demand food delivery platforms or the need to develop an in-house delivery operation. Although several studies have investigated consumer behavior when using traditional on-demand food delivery services, there is limited research on merchants’ behavior when adopting white-label …

Go to article

Efficient Multiplicative-To-Additive Function From Joye-Libert Cryptosystem And Its Application To Threshold Ecdsa, Haiyang Xue, Ho Man Au, Mengling Liu, Yin Kwan Chan, Handong Cui, Xiang Xie, Hon Tsz Yuen, Chengru Zhang Nov 2024

Efficient Multiplicative-To-Additive Function From Joye-Libert Cryptosystem And Its Application To Threshold Ecdsa, Haiyang Xue, Ho Man Au, Mengling Liu, Yin Kwan Chan, Handong Cui, Xiang Xie, Hon Tsz Yuen, Chengru Zhang

Research Collection School Of Computing and Information Systems

Threshold ECDSA receives interest lately due to its widespread adoption in blockchain applications. A common building block of all leading constructions involves a secure conversion of multiplicative shares into additive ones, which is called the multiplicative-to-additive (MtA) function. MtA dominates the overall complexity of all existing threshold ECDSA constructions. Specifically, O(n2) invocations of MtA are required in the case of n active signers. Hence, improvement of MtA leads directly to significant improvements for all state-of-the-art threshold ECDSA schemes.In this paper, we design a novel MtA by revisiting the Joye-Libert (JL) cryptosystem. Specifically, we revisit JL encryption and propose a JL-based …

Go to article

Hisoma: A Hierarchical Multi-Agent Model Integrating Self-Organizing Neural Networks With Multi-Agent Deep Reinforcement Learning, Minghong Geng, Shubham Pateria, Budhitama Subagdja, Ah-Hwee Tan Oct 2024

Hisoma: A Hierarchical Multi-Agent Model Integrating Self-Organizing Neural Networks With Multi-Agent Deep Reinforcement Learning, Minghong Geng, Shubham Pateria, Budhitama Subagdja, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Multi-agent deep reinforcement learning (MADRL) has shown remarkable advancements in the past decade. However, most current MADRL models focus on task-specific short-horizon problems involving a small number of agents, limiting their applicability to long-horizon planning in complex environments. Hierarchical multi-agent models offer a promising solution by organizing agents into different levels, effectively addressing tasks with varying planning horizons. However, these models often face constraints related to the number of agents or levels of hierarchies. This paper introduces HiSOMA, a novel hierarchical multi-agent model designed to handle long-horizon, multi-agent, multi-task decision-making problems. The top-level controller, FALCON, is modeled as a class …

Go to article

Generative Ai In Software Engineering Must Be Human-Centered: The Copenhagen Manifesto, D. Russo, S. Van Berkel Baltes, Christoph Treude Oct 2024

Generative Ai In Software Engineering Must Be Human-Centered: The Copenhagen Manifesto, D. Russo, S. Van Berkel Baltes, Christoph Treude

Research Collection School Of Computing and Information Systems

The advent of Generative Artificial Intelligence—systems that can produce human-like content such as text, music, visual art, or source code—marks not only a significant leap for Artificial Intelligence (AI) but also a pivotal moment for software practitioners and researchers. The role of software engineering researchers and practitioners in adopting the technologies that shape our world is critical. Historically, the human aspects of developing software have been treated as secondary to more technical innovations. However, the emergence of Generative AI will simultaneously enhance human capabilities while surfacing complex ethical, social, legal, and technical challenges.While primarily aimed at software engineering (SE) researchers …

Go to article

Does Ceo Agreeableness Personality Mitigate Real Earnings Management?, Shan Liu, Xingying Wu, Nan Hu Oct 2024

Does Ceo Agreeableness Personality Mitigate Real Earnings Management?, Shan Liu, Xingying Wu, Nan Hu

Research Collection School Of Computing and Information Systems

Despite efforts to mitigate aggressive financial reporting, earnings management remains challenging to parties interested in inhibiting its dysfunctional effects. Using linguistic algorithms to assess CEO agreeableness personality from their unscripted texts in conference calls, we find that it is a determinant that mitigates a firm's real earnings management. Furthermore, such an effect is more pronounced when firms confront intensive market competition and financial distress and have weaker managerial entrenchment or when CEOs face stronger internal governance. Our findings persist even after we utilize several alternative real earnings management metrics and control other confounding personalities in prior earnings management studies. The …

Go to article

Ocapo: Fine-Grained Occupancy-Aware, Empirically-Driven Pdc Control In Open-Plan, Shared Workspaces, Ravi Anuradha, Dulaj Sanjaya Weerakoon, Archan Misra Oct 2024

Ocapo: Fine-Grained Occupancy-Aware, Empirically-Driven Pdc Control In Open-Plan, Shared Workspaces, Ravi Anuradha, Dulaj Sanjaya Weerakoon, Archan Misra

Research Collection School Of Computing and Information Systems

Passive Displacement Cooling (PDC) is a relatively recent technology gaining attention as a means of significantly reducing building energy consumption overheads, especially in tropical climates. PDC eliminates the use of mechanical fans, instead using chilled-water heat exchangers to perform convective cooling. In this paper, we identify and characterize the impact of several key parameters affecting occupant comfort in a 1000m2 open-floor area (consisting of multiple zones) of a ZEB (Zero Energy Building) deployed with PDC units and tackle the problem of setting the temperature setpoint of the PDC units to assure occupant thermal comfort and yet conserve energy. We tackle …

Go to article

On The Lossiness Of 2k-Th Power And The Instantiability Of Rabin-Oaep, Haiyang Xue, Bao Li, Xianhui Lu, Kunpeng Wang, Yamin Liu Oct 2024

On The Lossiness Of 2k-Th Power And The Instantiability Of Rabin-Oaep, Haiyang Xue, Bao Li, Xianhui Lu, Kunpeng Wang, Yamin Liu

Research Collection School Of Computing and Information Systems

Seurin PKC 2014 proposed the 2-ï /4-hiding assumption which asserts the indistinguishability of Blum Numbers from pseudo Blum Numbers. In this paper, we investigate the lossiness of 2 k -th power based on the 2 k -ï /4-hiding assumption, which is an extension of the 2-ï /4-hiding assumption. And we prove that 2 k -th power function is a lossy trapdoor permutation over Quadratic Residuosity group. This new lossy trapdoor function has 2 k -bits lossiness for k -bits exponent, while the RSA lossy trapdoor function given by Kiltz et al. Crypto 2010 has k -bits lossiness for k -bits …

Go to article

D2sr: Decentralized Detection, De-Synchronization, And Recovery Of Lidar Interference, Darshana Rathnayake, Hemanth Sabbella, Meera Radhakrishnan, Archan Misra Oct 2024

D2sr: Decentralized Detection, De-Synchronization, And Recovery Of Lidar Interference, Darshana Rathnayake, Hemanth Sabbella, Meera Radhakrishnan, Archan Misra

Research Collection School Of Computing and Information Systems

We address the challenge of multi-LiDAR interference, an issue of growing importance as LiDAR sensors are embedded in a growing set of pervasive devices. We introduce a novel approach named D2SR, enabling decentralized interference detection, mitigation, and recovery without explicit coordination among nearby LiDAR devices. D2SR comprises three stages: (a) Detection, which identifies interfered frames, (b) Mitigation, which performs time-shifting of a LiDAR’s active period to reduce interference, and (c) Recovery, which corrects or reconstructs the depth values in interfered regions of a depth frame. Key contributions include a lightweight interference detection algorithm achieving an F1-score of 92%, a simple …

Go to article

Retrofitting A Legacy Cutlery Washing Machine Using Computer Vision, Hua Leong Fwa Oct 2024

Retrofitting A Legacy Cutlery Washing Machine Using Computer Vision, Hua Leong Fwa

Research Collection School Of Computing and Information Systems

Industry 4.0, the digitalization of manufacturing promises to lead to lowered cost, efficient processes and even discovery of new business models. However, many of the enterprises have huge investments in legacy machines which are not 'smart'. In this study, we thus designed a cost-efficient solution to retrofit a legacy conveyor belt-based cutlery washing machine with a commodity web camera. We then applied computer vision (using both traditional image processing and deep learning techniques) to infer the speed and utilization of the machine. We detailed the algorithms that we designed for computing both speed andutilization. With the existing operational constraints of …

Go to article

The Impact Of Managerial Myopia On Cybersecurity: Evidence From Data Breaches, Wen Chen, Xing Li, Haibin Wu, Liandong Zhang Sep 2024

The Impact Of Managerial Myopia On Cybersecurity: Evidence From Data Breaches, Wen Chen, Xing Li, Haibin Wu, Liandong Zhang

Research Collection School Of Accountancy

Using a sample of U.S. firms for the period 2005–2017, we provide evidence that managerial myopic actions contribute to corporate cybersecurity risk. Specifically, we show that abnormal cuts in discretionary expenditures, our proxy for managerial myopia, are positively associated with the likelihood of data breaches. The association is largely driven by firms that appear to cut discretionary expenditures to meet short-term earnings targets. In addition, the association is stronger for firms with greater short-term equity incentives, higher earnings response coefficients, low levels of institutional block ownership, or large market shares. Finally, firms appear to increase discretionary expenditures upon the announcement …

Go to article

Recasting The Mould – Librarianship Of The Future: Leveraging Automation, Apis, And Ai, Samantha Seah Sep 2024

Recasting The Mould – Librarianship Of The Future: Leveraging Automation, Apis, And Ai, Samantha Seah

Research Collection Library

With leaps in artificial intelligence made in recent years redefining the information landscape and introducing new means of information production, librarianship also must evolve to include new literacies. One way librarians can equip and empower ourselves is by understanding the building blocks of how machines and automation work. Perhaps more important than learning specific programming languages, learning computational thinking provides us with more ways to spot and evaluate problems and devise solutions without extensive coding knowledge. My presentation will take the improvement of membership processing as an example using Power Automate, a low-code Microsoft tool mimicking block programming. The tool …

Go to article

Certified Continual Learning For Neural Network Regression, Hong Long Pham, Jun Sun Sep 2024

Certified Continual Learning For Neural Network Regression, Hong Long Pham, Jun Sun

Research Collection School Of Computing and Information Systems

On the one hand, there has been considerable progress on neural network verification in recent years, which makes certifying neural networks a possibility. On the other hand, neural network in practice are often re-trained over time to cope with new data distribution or for solving different tasks (a.k.a. continual learning). Once re-trained, the verified correctness of the neural network is likely broken, particularly in the presence of the phenomenon known as catastrophic forgetting. In this work, we propose an approach called certified continual learning which improves existing continual learning methods by preserving, as long as possible, the established correctness properties …

Go to article

Reimagining Education With Ai, Margherita Pagani, Steven Miller, Jerry Wind Sep 2024

Reimagining Education With Ai, Margherita Pagani, Steven Miller, Jerry Wind

Research Collection School Of Computing and Information Systems

This chapter examines AI’s transformative potential in education, focusing on Generative AI (GenAI) and Large Language Models (LLMs) while at the same time emphasizing the importance of grounding and guiding AI efforts with learning science and education research findings. It synthesizes analyses and expert recommendations, highlighting opportunities like personalized learning and enhanced teacher productivity, alongside challenges such as over-reliance on AI. Practical steps for instructors include adopting a question-first approach, utilizing AI for personalized feedback, designing AI-enhanced learning experiences, fostering critical thinking, and ensuring ethical AI use. The chapter concludes with strategic recommendations for leveraging AI to sustainably improve educational …

Go to article

Granular3d: Delving Into Multi-Granularity 3d Scene Graph Prediction, Kaixiang Huang, Jingru Yang, Jin Wang, Shengfeng He, Zhan Wang, Haiyan He, Qifeng Zhang, Guodong Lu Sep 2024

Granular3d: Delving Into Multi-Granularity 3d Scene Graph Prediction, Kaixiang Huang, Jingru Yang, Jin Wang, Shengfeng He, Zhan Wang, Haiyan He, Qifeng Zhang, Guodong Lu

Research Collection School Of Computing and Information Systems

This paper addresses the significant challenges in 3D Semantic Scene Graph (3DSSG) prediction, essential for understanding complex 3D environments. Traditional approaches, primarily using PointNet and Graph Convolutional Networks, struggle with effectively extracting multi-grained features from intricate 3D scenes, largely due to a focus on global scene processing and single-scale feature extraction. To overcome these limitations, we introduce Granular3D, a novel approach that shifts the focus towards multi-granularity analysis by predicting relation triplets from specific sub-scenes. One key is the Adaptive Instance Enveloping Method (AIEM), which establishes an approximate envelope structure around irregular instances, providing shape-adaptive local point cloud sampling, thereby …

Go to article

Unraveling The Dynamics Of Stable And Curious Audiences In Web Systems, Rodrigo Alves, Antoine Ledent, Renato Assunção, Pedro Vaz-De-Melo, Marius Kloft Sep 2024

Unraveling The Dynamics Of Stable And Curious Audiences In Web Systems, Rodrigo Alves, Antoine Ledent, Renato Assunção, Pedro Vaz-De-Melo, Marius Kloft

Research Collection School Of Computing and Information Systems

We propose the Burst-Induced Poisson Process (BPoP), a model designed to analyze time series data such as feeds or search queries. BPoP can distinguish between the slowly-varying regular activity of a stable audience and the bursty activity of a curious audience, often seen in viral threads. Our model consists of two hidden, interacting processes: a self-feeding process (SFP) that generates bursty behavior related to viral threads, and a non-homogeneous Poisson process (NHPP) with step function intensity that is influenced by the bursts from the SFP. The NHPP models the normal background behavior, driven solely by the overall popularity of the …

Go to article

Solving Fractional Differential Equations On A Quantum Computer: A Variational Approach, Fong Yew Leong, Dax Enshan Koh, Jian Feng Kong, Siong Thye Goh, Jun Yong Khoo, Wei Bin Ewe, Hongying Li, Jayne Thompson, Dario Poletti Sep 2024

Solving Fractional Differential Equations On A Quantum Computer: A Variational Approach, Fong Yew Leong, Dax Enshan Koh, Jian Feng Kong, Siong Thye Goh, Jun Yong Khoo, Wei Bin Ewe, Hongying Li, Jayne Thompson, Dario Poletti

Research Collection School Of Computing and Information Systems

We introduce an efficient variational hybrid quantum-classical algorithm designed for solving Caputo time-fractional partial differential equations. Our method employs an iterable cost function incorporating a linear combination of overlap history states. The proposed algorithm is not only efficient in terms of time complexity but also has lower memory costs compared to classical methods. Our results indicate that solution fidelity is insensitive to the fractional index and that gradient evaluation costs scale economically with the number of time steps. As a proof of concept, we apply our algorithm to solve a range of fractional partial differential equations commonly encountered in engineering …

Go to article

Efficient Neural Collaborative Search For Pickup And Delivery Problems, Detian Kong, Yining Ma, Zhiguang Cao, Tianshu Yu, Jianhua Xiao Sep 2024

Efficient Neural Collaborative Search For Pickup And Delivery Problems, Detian Kong, Yining Ma, Zhiguang Cao, Tianshu Yu, Jianhua Xiao

Research Collection School Of Computing and Information Systems

In this paper, we introduce Neural Collaborative Search (NCS), a novel learning-based framework for efficiently solving pickup and delivery problems (PDPs). NCS pioneers the collaboration between the latest prevalent neural construction and neural improvement models, establishing a collaborative framework where an improvement model iteratively refines solutions initiated by a construction model. Our NCS collaboratively trains the two models via reinforcement learning with an effective shared-critic mechanism. In addition, the construction model enhances the improvement model with high-quality initial solutions via curriculum learning, while the improvement model accelerates the convergence of the construction model through imitation learning. Besides the new framework …

Go to article

Certified Quantization Strategy Synthesis For Neural Networks, Yedi Zhang, Guangke Chen, Jun Sun, Jun Sun Sep 2024

Certified Quantization Strategy Synthesis For Neural Networks, Yedi Zhang, Guangke Chen, Jun Sun, Jun Sun

Research Collection School Of Computing and Information Systems

Quantization plays an important role in deploying neural networks on embedded, real-time systems with limited computing and storage resources (e.g., edge devices). It significantly reduces the model storage cost and improves inference efficiency by using fewer bits to represent the parameters. However, it was recently shown that critical properties may be broken after quantization, such as robustness and backdoor-freeness. In this work, we introduce the first method for synthesizing quantization strategies that verifiably maintain desired properties after quantization, leveraging a key insight that quantization leads to a data distribution shift in each layer. We propose to compute the preimage for …

Go to article

Predicting Personality Or Prejudice? Facial Inference In The Age Of Artificial Intelligence, Shilpa Madan, Gayoung Park Aug 2024

Predicting Personality Or Prejudice? Facial Inference In The Age Of Artificial Intelligence, Shilpa Madan, Gayoung Park

Research Collection Lee Kong Chian School Of Business

Facial inference, a cornerstone of person perception, has traditionally been studied through human judgments about personality traits and abilities based on people's faces. Recent advances in artificial intelligence (AI) have introduced new dimensions to this field, employing machine learning algorithms to reveal people's character, capabilities, and social outcomes based just on their faces. This review examines recent research on human and AI-based facial inference across psychology, business, computer science, legal, and policy studies to highlight the need for scientific consensus on whether or not people's faces can reveal their inner traits, and urges researchers to address the critical concerns …

Go to article

An Llm-Assisted Easy-To-Trigger Poisoning Attack On Code Completion Models: Injecting Disguised Vulnerabilities Against Strong Detection, Shenao Yan, Shen Wang, Yue Duan, Hanbin Hong, Kiho Lee, Doowon Kim, Yuan Hong Aug 2024

An Llm-Assisted Easy-To-Trigger Poisoning Attack On Code Completion Models: Injecting Disguised Vulnerabilities Against Strong Detection, Shenao Yan, Shen Wang, Yue Duan, Hanbin Hong, Kiho Lee, Doowon Kim, Yuan Hong

Research Collection School Of Computing and Information Systems

Large Language Models (LLMs) have transformed code completion tasks, providing context-based suggestions to boost developer productivity in software engineering. As users often fine-tune these models for specific applications, poisoning and backdoor attacks can covertly alter the model outputs. To address this critical security challenge, we introduce CODEBREAKER, a pioneering LLM-assisted backdoor attack framework on code completion models. Unlike recent attacks that embed malicious payloads in detectable or irrelevant sections of the code (e.g., comments), CODEBREAKER leverages LLMs (e.g., GPT-4) for sophisticated payload transformation (without affecting functionalities), ensuring that both the poisoned data for fine-tuning and generated code can evade strong …

Go to article

Self-Chats From Large Language Models Make Small Emotional Support Chatbot Better, Zhonghua Zheng, Lizi Liao, Yang Deng, Libo Qin, Liqiang Nie Aug 2024

Self-Chats From Large Language Models Make Small Emotional Support Chatbot Better, Zhonghua Zheng, Lizi Liao, Yang Deng, Libo Qin, Liqiang Nie

Research Collection School Of Computing and Information Systems

Large Language Models (LLMs) have shown strong generalization abilities to excel in various tasks, including emotion support conversations. However, deploying such LLMs like GPT-3 (175B parameters) is resource-intensive and challenging at scale. In this study, we utilize LLMs as “Counseling Teacher” to enhance smaller models’ emotion support response abilities, significantly reducing the necessity of scaling up model size. To this end, we first introduce an iterative expansion framework, aiming to prompt the large teacher model to curate an expansive emotion support dialogue dataset. This curated dataset, termed ExTES, encompasses a broad spectrum of scenarios and is crafted with meticulous strategies …

Go to article

Anopas: Practical Anonymous Transit Pass From Group Signatures With Time-Bound Keys, Rui Shi, Yang Yang, Yingjiu Li, Huamin Feng, Hwee Hwa Pang, Robert H. Deng Aug 2024

Anopas: Practical Anonymous Transit Pass From Group Signatures With Time-Bound Keys, Rui Shi, Yang Yang, Yingjiu Li, Huamin Feng, Hwee Hwa Pang, Robert H. Deng

Research Collection School Of Computing and Information Systems

An anonymous transit pass system allows passengers to access transport services within fixed time periods, with their privileges automatically deactivating upon time expiration. Although existing transit pass systems are deployable on powerful devices like PCs, their adaptation to more user-friendly devices, such as mobile phones with smart cards, is inefficient due to their reliance on heavy-weight operations like bilinear maps. In this paper, we introduce an innovative anonymous transit pass system, dubbed Anopas, optimized for deployment on mobile phones with smart cards, where the smart card is responsible for crucial lightweight operations and the mobile phone handles key-independent and time-consuming …

Go to article

Style: Improving Domain Transferability Of Asking Clarification Questions In Large Language Model Powered Conversational Agents, Yue Chen, Chen Huang, Yang Deng, Wenqiang Lei, Dingnan Jin, Jia Liu, Tat-Seng Chua Aug 2024

Style: Improving Domain Transferability Of Asking Clarification Questions In Large Language Model Powered Conversational Agents, Yue Chen, Chen Huang, Yang Deng, Wenqiang Lei, Dingnan Jin, Jia Liu, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Equipping a conversational search engine with strategies regarding when to ask clarification questions is becoming increasingly important across various domains. Attributing to the context understanding capability of LLMs and their access to domain-specific sources of knowledge, LLM-based clarification strategies feature rapid transfer to various domains in a posthoc manner. However, they still struggle to deliver promising performance on unseen domains, struggling to achieve effective domain transferability. We take the first step to investigate this issue and existing methods tend to produce one-size-fits-all strategies across diverse domains, limiting their search effectiveness. In response, we introduce a novel method, called STYLE, to …

Go to article

Next Last