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

Physical Sciences and Mathematics Commons

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year
File Type

Articles 751 - 780 of 6891

Full-Text Articles in Physical Sciences and Mathematics

An Empirical Study Of Package Management Issues Via Stack Overflow, Syful Islam, Raula Kula, Christoph Treude, Bodin Chinthanet, Takashi Ishio, Kenichi Matsumoto Feb 2023

An Empirical Study Of Package Management Issues Via Stack Overflow, Syful Islam, Raula Kula, Christoph Treude, Bodin Chinthanet, Takashi Ishio, Kenichi Matsumoto

Research Collection School Of Computing and Information Systems

The package manager (PM) is crucial to most technology stacks, acting as a broker to ensure that a verified dependency package is correctly installed, configured, or removed from an application. Diversity in technology stacks has led to dozens of PMs with various features. While our recent study indicates that package management features of PM are related to end-user experiences, it is unclear what those issues are and what information is required to resolve them. In this paper, we have investigated PM issues faced by end-users through an empirical study of content on Stack Overflow (SO). We carried out a qualitative …


Safe Delivery Of Critical Services In Areas With Volatile Security Situation Via A Stackelberg Game Approach, Tien Mai, Arunesh Sinha Feb 2023

Safe Delivery Of Critical Services In Areas With Volatile Security Situation Via A Stackelberg Game Approach, Tien Mai, Arunesh Sinha

Research Collection School Of Computing and Information Systems

Vaccine delivery in under-resourced locations with security risks is not just challenging but also life threatening. The COVID pandemic and the need to vaccinate added even more urgency to this issue. Motivated by this problem, we propose a general framework to set-up limited temporary (vaccination) centers that balance physical security and desired (vaccine) service coverage with limited resources. We set-up the problem as a Stackelberg game between the centers operator (defender) and an adversary, where the set of centers is not fixed a priori but is part of the decision output. This results in a mixed combinatorial and continuous optimization …


Constrained Reinforcement Learning In Hard Exploration Problems, Pankayaraj Pathmanathan, Pradeep Varakantham Feb 2023

Constrained Reinforcement Learning In Hard Exploration Problems, Pankayaraj Pathmanathan, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

One approach to guaranteeing safety in Reinforcement Learning is through cost constraints that are imposed on trajectories. Recent works in constrained RL have developed methods that ensure constraints can be enforced even at learning time while maximizing the overall value of the policy. Unfortunately, as demonstrated in our experimental results, such approaches do not perform well on complex multi-level tasks, with longer episode lengths or sparse rewards. To that end, wepropose a scalable hierarchical approach for constrained RL problems that employs backward cost value functions in the context of task hierarchy and a novel intrinsic reward function in lower levels …


Solving Large-Scale Pursuit-Evasion Games Using Pre-Trained Strategies, Shuxin Li, Xinrun Wang, Youzhi Zhang, Wanqi Xue, Jakub Cerny, Bo An Feb 2023

Solving Large-Scale Pursuit-Evasion Games Using Pre-Trained Strategies, Shuxin Li, Xinrun Wang, Youzhi Zhang, Wanqi Xue, Jakub Cerny, Bo An

Research Collection School Of Computing and Information Systems

Pursuit-evasion games on graphs model the coordination of police forces chasing a fleeing felon in real-world urban settings, using the standard framework of imperfect-information extensive-form games (EFGs). In recent years, solving EFGs has been largely dominated by the Policy-Space Response Oracle (PSRO) methods due to their modularity, scalability, and favorable convergence properties. However, even these methods quickly reach their limits when facing large combinatorial strategy spaces of the pursuit-evasion games. To improve their efficiency, we integrate the pre-training and fine-tuning paradigm into the core module of PSRO -- the repeated computation of the best response. First, we pre-train the pursuer's …


Alignment-Enriched Tuning For Patch-Level Pre-Trained Document Image Models, Lei Wang, Jiabang He, Xing Xu, Ning Liu, Hui Liu Feb 2023

Alignment-Enriched Tuning For Patch-Level Pre-Trained Document Image Models, Lei Wang, Jiabang He, Xing Xu, Ning Liu, Hui Liu

Research Collection School Of Computing and Information Systems

Alignment between image and text has shown promising im provements on patch-level pre-trained document image mod els. However, investigating more effective or finer-grained alignment techniques during pre-training requires a large amount of computation cost and time. Thus, a question natu rally arises: Could we fine-tune the pre-trained models adap tive to downstream tasks with alignment objectives and achieve comparable or better performance? In this paper, we pro pose a new model architecture with alignment-enriched tuning (dubbed AETNet) upon pre-trained document image models, to adapt downstream tasks with the joint task-specific super vised and alignment-aware contrastive objective. Specifically, weintroduce an extra …


Future Aware Pricing And Matching For Sustainable On-Demand Ride Pooling, Xianjie Zhang, Pradeep Varakantham, Hao Jiang Feb 2023

Future Aware Pricing And Matching For Sustainable On-Demand Ride Pooling, Xianjie Zhang, Pradeep Varakantham, Hao Jiang

Research Collection School Of Computing and Information Systems

The popularity of on-demand ride pooling is owing to the benefits offered to customers (lower prices), taxi drivers (higher revenue), environment (lower carbon footprint due to fewer vehicles) and aggregation companies like Uber (higher revenue). To achieve these benefits, two key interlinked challenges have to be solved effectively: (a) pricing – setting prices to customer requests for taxis; and (b) matching – assignment of customers (that accepted the prices) to taxis/cars. Traditionally, both these challenges have been studied individually and using myopic approaches (considering only current requests), without considering the impact of current matching on addressing future requests. In this …


Bidding Graph Games With Partially-Observable Budgets, Guy Avni, Ismael Jecker, Dorde Zikelic Feb 2023

Bidding Graph Games With Partially-Observable Budgets, Guy Avni, Ismael Jecker, Dorde Zikelic

Research Collection School Of Computing and Information Systems

Two-player zero-sum graph games are a central model, which proceeds as follows. A token is placed on a vertex of a graph, and the two players move it to produce an infinite play, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In bidding games, however, the players have budgets and in each turn, an auction (bidding) determines which player moves the token. So far, bidding games have only been studied as fullinformation games. In this work we initiate the study of partial-information bidding games: we study bidding games in which …


Ranked Keyword Search Over Encrypted Cloud Data Through Machine Learning Method, Yinbin Miao, Wei Zheng, Xiaohua Jia, Ximeng Liu, Kim-Kwang Raymond Choo, Robert H. Deng Jan 2023

Ranked Keyword Search Over Encrypted Cloud Data Through Machine Learning Method, Yinbin Miao, Wei Zheng, Xiaohua Jia, Ximeng Liu, Kim-Kwang Raymond Choo, Robert H. Deng

Research Collection School Of Computing and Information Systems

Ranked keyword search over encrypted data has been extensively studied in cloud computing as it enables data users to find the most relevant results quickly. However, existing ranked multi-keyword search solutions cannot achieve efficient ciphertext search and dynamic updates with forward security simultaneously. To solve the above problems, we first present a basic Machine Learning-based Ranked Keyword Search (ML-RKS) scheme in the static setting by using the k-means clustering algorithm and a balanced binary tree. ML-RKS reduces the search complexity without sacrificing the search accuracy, but is still vulnerable to forward security threats when applied in the dynamic setting. Then, …


Just-In-Time Obsolete Comment Detection And Update, Zhongxin Liu, Xin Xia, David Lo, Meng Yan, Shangping Li Jan 2023

Just-In-Time Obsolete Comment Detection And Update, Zhongxin Liu, Xin Xia, David Lo, Meng Yan, Shangping Li

Research Collection School Of Computing and Information Systems

Comments are valuable resources for the development, comprehension and maintenance of software. However, while changing code, developers sometimes neglect the evolution of the corresponding comments, resulting in obsolete comments. Such obsolete comments can mislead developers and introduce bugs in the future, and are therefore detrimental. We notice that by detecting and updating obsolete comments in time with code changes, obsolete comments can be effectively reduced and even avoided. We refer to this task as Just-In-Time (JIT) Obsolete Comment Detection and Update. In this work, we propose a two-stage framework named CUP2 (Two-stage Comment UPdater) to automate this task. CUP2 consists …


Seqadver: Automatic Payload Construction And Injection In Sequence-Based Android Adversarial Attack, Fei Zhang, Ruitao Feng, Xiaofei Xie, Xiaohong Li, Lianshuan Shi Jan 2023

Seqadver: Automatic Payload Construction And Injection In Sequence-Based Android Adversarial Attack, Fei Zhang, Ruitao Feng, Xiaofei Xie, Xiaohong Li, Lianshuan Shi

Research Collection School Of Computing and Information Systems

Machine learning has achieved a great success in the field of Android malware detection. In order to avoid being caught by these ML-based Android malware detection, malware authors are inclined to initiate adversarial sample attacks by tampering with mobile applications. Although machine learning has high capability, it lacks robustness against adversarial attacks. Currently, many of the adversarial attacking tools not only inject dead code into target applications, which can never be executed, but also require the injection of many benign features into a malicious APK. This can be easily noticeable by program analysis techniques. In this paper, we propose SeqAdver, …


Sleepmore: Inferring Sleep Duration At Scale Via Multi-Device Wifi Sensing, Camellia Zakaria, Gizem Yilmaz, Priyanka Mammen, Michael Chee, Prashant Shenoy, Rajesh Krishna Balan Jan 2023

Sleepmore: Inferring Sleep Duration At Scale Via Multi-Device Wifi Sensing, Camellia Zakaria, Gizem Yilmaz, Priyanka Mammen, Michael Chee, Prashant Shenoy, Rajesh Krishna Balan

Research Collection School Of Computing and Information Systems

The availability of commercial wearable trackers equipped with features to monitor sleep duration and quality has enabled more useful sleep health monitoring applications and analyses. However, much research has reported the challenge of long-term user retention in sleep monitoring through these modalities. Since modern Internet users own multiple mobile devices, our work explores the possibility of employing ubiquitous mobile devices and passive WiFi sensing techniques to predict sleep duration as the fundamental measure for complementing long-term sleep monitoring initiatives. In this paper, we propose SleepMore, an accurate and easy-to-deploy sleep-tracking approach based on machine learning over the user's WiFi network …


Dual-View Preference Learning For Adaptive Recommendation, Zhongzhou Liu, Yuan Fang, Min Wu Jan 2023

Dual-View Preference Learning For Adaptive Recommendation, Zhongzhou Liu, Yuan Fang, Min Wu

Research Collection School Of Computing and Information Systems

While recommendation systems have been widely deployed, most existing approaches only capture user preferences in the , i.e., the user's general interest across all kinds of items. However, in real-world scenarios, user preferences could vary with items of different natures, which we call the . Both views are crucial for fully personalized recommendation, where an underpinning macro-view governs a multitude of finer-grained preferences in the micro-view. To model the dual views, in this paper, we propose a novel model called Dual-View Adaptive Recommendation (DVAR). In DVAR, we formulate the micro-view based on item categories, and further integrate it with the …


Coordinating Multi-Party Vehicle Routing With Location Congestion Via Iterative Best Response, Waldy Joe, Hoong Chuin Lau Jan 2023

Coordinating Multi-Party Vehicle Routing With Location Congestion Via Iterative Best Response, Waldy Joe, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

This work is motivated by a real-world problem of coordinating B2B pickup-delivery operations to shopping malls involving multiple non-collaborative logistics service providers (LSPs) in a congested city where space is scarce. This problem can be categorized as a vehicle routing problem with pickup and delivery, time windows and location congestion with multiple LSPs (or ML-VRPLC in short), and we propose a scalable, decentralized, coordinated planning approach via iterative best response. We formulate the problem as a strategic game where each LSP is a self-interested agent but is willing to participate in a coordinated planning as long as there are sufficient …


Anchorage: Visual Analysis Of Satisfaction In Customer Service Videos Via Anchor Events, Kam Kwai Wong, Xingbo Wang, Yong Wang, Jianben He, Rong Zhang, Huamin Qu Jan 2023

Anchorage: Visual Analysis Of Satisfaction In Customer Service Videos Via Anchor Events, Kam Kwai Wong, Xingbo Wang, Yong Wang, Jianben He, Rong Zhang, Huamin Qu

Research Collection School Of Computing and Information Systems

Delivering customer services through video communications has brought new opportunities to analyze customer satisfaction for quality management. However, due to the lack of reliable self-reported responses, service providers are troubled by the inadequate estimation of customer services and the tedious investigation into multimodal video recordings. We introduce , a visual analytics system to evaluate customer satisfaction by summarizing multimodal behavioral features in customer service videos and revealing abnormal operations in the service process. We leverage the semantically meaningful operations to introduce structured event understanding into videos which help service providers quickly navigate to events of their interest. supports a comprehensive …


Dashboard Design Mining And Recommendation, Yanna Lin, Haotian Li, Aoyu Wu, Yong Wang, Huamin Qu Jan 2023

Dashboard Design Mining And Recommendation, Yanna Lin, Haotian Li, Aoyu Wu, Yong Wang, Huamin Qu

Research Collection School Of Computing and Information Systems

Dashboards, which comprise multiple views on a single display, help analyze and communicate multiple perspectives of data simultaneously. However, creating effective and elegant dashboards is challenging since it requires careful and logical arrangement and coordination of multiple visualizations. To solve the problem, we propose a data-driven approach for mining design rules from dashboards and automating dashboard organization. Specifically, we focus on two prominent aspects of the organization: , which describes the position, size, and layout of each view in the display space; and, which indicates the interaction between pairwise views. We build a new dataset containing 854 dashboards crawled online, …


Demonstrating Multi-Modal Human Instruction Comprehension With Ar Smart Glass, Mudiyanselage Dulanga Kaveesha Weerakoon, Vigneshwaran Subbaraju, Tuan Tran, Archan Misra Jan 2023

Demonstrating Multi-Modal Human Instruction Comprehension With Ar Smart Glass, Mudiyanselage Dulanga Kaveesha Weerakoon, Vigneshwaran Subbaraju, Tuan Tran, Archan Misra

Research Collection School Of Computing and Information Systems

We present a multi-modal human instruction comprehension prototype for object acquisition tasks that involve verbal, visual and pointing gesture cues. Our prototype includes an AR smart-glass for issuing the instructions and a Jetson TX2 pervasive device for executing comprehension algorithms. With this setup, we enable on-device, computationally efficient object acquisition task comprehension with an average latency in the range of 150-330msec.


Invalidator: Automated Patch Correctness Assessment Via Semantic And Syntactic Reasoning, Tranh Le-Cong, Duc Minh Luong, Xuan Bach D. Le, David Lo, Nhat-Hoa Tran, Bui Quang-Huy, Quyet-Thang Huynh Jan 2023

Invalidator: Automated Patch Correctness Assessment Via Semantic And Syntactic Reasoning, Tranh Le-Cong, Duc Minh Luong, Xuan Bach D. Le, David Lo, Nhat-Hoa Tran, Bui Quang-Huy, Quyet-Thang Huynh

Research Collection School Of Computing and Information Systems

Automated program repair (APR) has been gaining ground recently. However, a significant challenge that still remains is test overfitting, in which APR-generated patches plausibly pass the validation test suite but fail to generalize. A common practice to assess the correctness of APR-generated patches is to judge whether they are equivalent to ground truth, i.e., developer-written patches, by either generating additional test cases or employing human manual inspections. The former often requires the generation of at least one test that shows behavioral differences between the APR-patched and developer-patched programs. Searching for this test, however, can be difficult as the search space …


Relation Preserving Triplet Mining For Stabilising The Triplet Loss In Re-Identification Systems, Adhiraj Ghosh, Kuruparan Shanmugalingam, Wen-Yan Lin Jan 2023

Relation Preserving Triplet Mining For Stabilising The Triplet Loss In Re-Identification Systems, Adhiraj Ghosh, Kuruparan Shanmugalingam, Wen-Yan Lin

Research Collection School Of Computing and Information Systems

Object appearances change dramatically with pose variations. This creates a challenge for embedding schemes that seek to map instances with the same object ID to locations that are as close as possible. This issue becomes significantly heightened in complex computer vision tasks such as re-identification(reID). In this paper, we suggest that these dramatic appearance changes are indications that an object ID is composed of multiple natural groups, and it is counterproductive to forcefully map instances from different groups to a common location. This leads us to introduce Relation Preserving Triplet Mining (RPTM), a feature matching guided triplet mining scheme, that …


Reinforcement Learning Enhanced Pichunter For Interactive Search, Zhixin Ma, Jiaxin Wu, Weixiong Loo, Chong-Wah Ngo Jan 2023

Reinforcement Learning Enhanced Pichunter For Interactive Search, Zhixin Ma, Jiaxin Wu, Weixiong Loo, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

With the tremendous increase in video data size, search performance could be impacted significantly. Specifically, in an interactive system, a real-time system allows a user to browse, search and refine a query. Without a speedy system quickly, the main ingredient to engage a user to stay focused, an interactive system becomes less effective even with a sophisticated deep learning system. This paper addresses this challenge by leveraging approximate search, Bayesian inference, and reinforcement learning. For approximate search, we apply a hierarchical navigable small world, which is an efficient approximate nearest neighbor search algorithm. To quickly prune the search scope, we …


Learning Feature Embedding Refiner For Solving Vehicle Routing Problems, Jingwen Li, Yining Ma, Zhiguang Cao, Yaoxin Wu, Wen Song, Jie Zhang, Yeow Meng Chee Jan 2023

Learning Feature Embedding Refiner For Solving Vehicle Routing Problems, Jingwen Li, Yining Ma, Zhiguang Cao, Yaoxin Wu, Wen Song, Jie Zhang, Yeow Meng Chee

Research Collection School Of Computing and Information Systems

While the encoder–decoder structure is widely used in the recent neural construction methods for learning to solve vehicle routing problems (VRPs), they are less effective in searching solutions due to deterministic feature embeddings and deterministic probability distributions. In this article, we propose the feature embedding refiner (FER) with a novel and generic encoder–refiner–decoder structure to boost the existing encoder–decoder structured deep models. It is model-agnostic that the encoder and the decoder can be from any pretrained neural construction method. Regarding the introduced refiner network, we design its architecture by combining the standard gated recurrent units (GRU) cell with two new …


Locality-Aware Tail Node Embeddings On Homogeneous And Heterogeneous Networks, Zemin Liu, Yuan Fang, Wentao Zhang, Xinming Zhang, Steven C. H. Hoi Jan 2023

Locality-Aware Tail Node Embeddings On Homogeneous And Heterogeneous Networks, Zemin Liu, Yuan Fang, Wentao Zhang, Xinming Zhang, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

While the state-of-the-art network embedding approaches often learn high-quality embeddings for high-degree nodes with abundant structural connectivity, the quality of the embeddings for low-degree or nodes is often suboptimal due to their limited structural connectivity. While many real-world networks are long-tailed, to date little effort has been devoted to tail node embeddings. In this article, we formulate the goal of learning tail node embeddings as a problem, given the few links on each tail node. In particular, since each node resides in its own local context, we personalize the regression model for each tail node. To reduce overfitting in the …


Reks: Role-Based Encrypted Keyword Search With Enhanced Access Control For Outsourced Cloud Data, Yibin Miao, Feng Li, Xiaohua Jia, Huaxiong Wang, Ximeng Liu, Kim-Kwang Raymond Choo, Robert H. Deng Jan 2023

Reks: Role-Based Encrypted Keyword Search With Enhanced Access Control For Outsourced Cloud Data, Yibin Miao, Feng Li, Xiaohua Jia, Huaxiong Wang, Ximeng Liu, Kim-Kwang Raymond Choo, Robert H. Deng

Research Collection School Of Computing and Information Systems

Keyword-based search over encrypted data is an important technique to achieve both data confidentiality and utilization in cloud outsourcing services. While commonly used access control mechanisms, such as identity-based encryption and attribute-based encryption, do not generally scale well for hierarchical access permissions. To solve this problem, we propose a Role-based Encrypted Keyword Search (REKS) scheme by using the role-based access control and broadcast encryption. Specifically, REKS allows owners to deploy hierarchical access control by allowing users with parent roles to have access permissions from child roles. Using REKS, we further facilitate token generation preprocessing and efficient user management, thereby significantly …


Achieving High Map-Coverage Through Pattern Constraint Reduction, Yingquan Zhao, Zan Wang, Shuang Liu, Jun Sun, Junjie Chen, Xiang Chen Jan 2023

Achieving High Map-Coverage Through Pattern Constraint Reduction, Yingquan Zhao, Zan Wang, Shuang Liu, Jun Sun, Junjie Chen, Xiang Chen

Research Collection School Of Computing and Information Systems

Testing multi-threaded programs is challenging due to the enormous space of thread interleavings. Recently, a code coverage criterion for multi-threaded programs called MAP-coverage has been proposed and shown to be effective for testing concurrent programs. Existing approaches for achieving high MAP-coverage are based on random testing with simple heuristics, which is ineffective in systematically triggering rare thread interleavings. In this study, we propose a novel approach called pattern constraint reduction (PCR), which employs optimized constraint solving to generate thread interleavings for high MAP-coverage. The idea is to iteratively encode and solve path conditions to generate thread interleavings which are guaranteed …


T-Counter: Trustworthy And Efficient Cpu Resource Measurement Using Sgx In The Cloud, Chuntao Dong, Qingni Shen, Xuhua Ding, Daoqing Yu, Wu Luo, Pengfei Wu, Zhonghai Wu Jan 2023

T-Counter: Trustworthy And Efficient Cpu Resource Measurement Using Sgx In The Cloud, Chuntao Dong, Qingni Shen, Xuhua Ding, Daoqing Yu, Wu Luo, Pengfei Wu, Zhonghai Wu

Research Collection School Of Computing and Information Systems

As cloud services have become popular, and their adoption is growing, consumers are becoming more concerned about the cost of cloud services. Cloud Service Providers (CSPs) generally use a pay-per-use billing scheme in the cloud services model: consumers use resources as they needed and are billed for their resource usage. However, CSPs are untrusted and privileged; they have full control of the entire operating system (OS) and may tamper with bills to cheat consumers. So, how to provide a trusted solution that can keep track of and verify the consumers’ resource usage has been a challenging problem. In this paper, …


The Three-Sided Market Of On-Demand Delivery, S. Bahrami, M. Nourinejad, Y. Yin, Hai Wang Jan 2023

The Three-Sided Market Of On-Demand Delivery, S. Bahrami, M. Nourinejad, Y. Yin, Hai Wang

Research Collection School Of Computing and Information Systems

On-demand delivery services are three-sided markets that enable interactions between customers and suppliers with the help of crowdsourced drivers. Customers and suppliers may pay a commission to gain access to the service and drivers are granted a wage for providing their delivery service. This study characterizes the properties of three-side on-demand delivery markets, and proposes pricing strategies that enable the platform to manipulate the market towards profit or social welfare maximizing outcomes. We consider earning-sensitive independent drivers, price-and-time-sensitive customers, and price-sensitive suppliers. By assuming that all players are heterogeneous in their valuation of the service, we model their numbers as …


I Know What You Are Searching For: Code Snippet Recommendation From Stack Overflow Posts, Zhipeng Gao, Xin Xia, David Lo, John C. Grundy, Xindong Zhang, Zhenchang Xing Jan 2023

I Know What You Are Searching For: Code Snippet Recommendation From Stack Overflow Posts, Zhipeng Gao, Xin Xia, David Lo, John C. Grundy, Xindong Zhang, Zhenchang Xing

Research Collection School Of Computing and Information Systems

Stack Overflow has been heavily used by software developers to seek programming-related information. More and more developers use Community Question and Answer forums, such as Stack Overflow, to search for code examples of how to accomplish a certain coding task. This is often considered to be more efficient than working from source documentation, tutorials, or full worked examples. However, due to the complexity of these online Question and Answer forums and the very large volume of information they contain, developers can be overwhelmed by the sheer volume of available information. This makes it hard to find and/or even be aware …


Assessing The Effectiveness Of A Chatbot Workshop As Experiential Teaching And Learning Tool To Engage Undergraduate Students, Kyong Jin Shim, Thomas Menkhoff, Ying Qian Teo, Clement Shi Qi Ong Jan 2023

Assessing The Effectiveness Of A Chatbot Workshop As Experiential Teaching And Learning Tool To Engage Undergraduate Students, Kyong Jin Shim, Thomas Menkhoff, Ying Qian Teo, Clement Shi Qi Ong

Research Collection School Of Computing and Information Systems

In this paper, we empirically examine and assess the effectiveness of a chatbot workshop as experiential teaching and learning tool to engage undergraduate students enrolled in an elective course “Doing Business with A.I.” in the Lee Kong Chian School of Business (LKCSB) at Singapore Management University. The chatbot workshop provides non-STEM students with an opportunity to acquire basic skills to build a chatbot prototype using the ‘Dialogflow’ program. The workshop and the experiential learning activity are designed to impart conversation and user-centric design know how and know why to students. A key didactical aspect which informs the design and flow …


Verifytl: Secure And Verifiable Collaborative Transfer Learning, Zhuoran Ma, Jianfeng Ma, Yinbin Miao, Ximeng Liu, Wei Zheng, Kim-Kwang Raymond Choo, Robert H. Deng Jan 2023

Verifytl: Secure And Verifiable Collaborative Transfer Learning, Zhuoran Ma, Jianfeng Ma, Yinbin Miao, Ximeng Liu, Wei Zheng, Kim-Kwang Raymond Choo, Robert H. Deng

Research Collection School Of Computing and Information Systems

Getting access to labeled datasets in certain sensitive application domains can be challenging. Hence, one may resort to transfer learning to transfer knowledge learned from a source domain with sufficient labeled data to a target domain with limited labeled data. However, most existing transfer learning techniques only focus on one-way transfer which may not benefit the source domain. In addition, there is the risk of a malicious adversary corrupting a number of domains, which can consequently result in inaccurate prediction or privacy leakage. In this paper, we construct a secure and Verif iable collaborative T ransfer L earning scheme, VerifyTL, …


Intelligent Adaptive Gossip-Based Broadcast Protocol For Uav-Mec Using Multi-Agent Deep Reinforcement Learning, Zen Ren, Xinghua Li, Yinbin Miao, Zhuowen Li, Zihao Wang, Mengyao Zhu, Ximeng Liu, Deng, Robert H. Jan 2023

Intelligent Adaptive Gossip-Based Broadcast Protocol For Uav-Mec Using Multi-Agent Deep Reinforcement Learning, Zen Ren, Xinghua Li, Yinbin Miao, Zhuowen Li, Zihao Wang, Mengyao Zhu, Ximeng Liu, Deng, Robert H.

Research Collection School Of Computing and Information Systems

UAV-assisted mobile edge computing (UAV-MEC) has been proposed to offer computing resources for smart devices and user equipment. UAV cluster aided MEC rather than one UAV-aided MEC as edge pool is the newest edge computing architecture. Unfortunately, the data packet exchange during edge computing within the UAV cluster hasn't received enough attention. UAVs need to collaborate for the wide implementation of MEC, relying on the gossip-based broadcast protocol. However, gossip has the problem of long propagation delay, where the forwarding probability and neighbors are two factors that are difficult to balance. The existing works improve gossip from only one factor, …


Graphsearchnet: Enhancing Gnns Via Capturing Global Dependencies For Semantic Code Search, Shangqing Liu, Xiaofei Xie, Jjingkai Siow, Lei Ma, Guozhu Meng, Yang Liu Jan 2023

Graphsearchnet: Enhancing Gnns Via Capturing Global Dependencies For Semantic Code Search, Shangqing Liu, Xiaofei Xie, Jjingkai Siow, Lei Ma, Guozhu Meng, Yang Liu

Research Collection School Of Computing and Information Systems

Code search aims to retrieve accurate code snippets based on a natural language query to improve software productivity and quality. With the massive amount of available programs such as (on GitHub or Stack Overflow), identifying and localizing the precise code is critical for the software developers. In addition, Deep learning has recently been widely applied to different code-related scenarios, ., vulnerability detection, source code summarization. However, automated deep code search is still challenging since it requires a high-level semantic mapping between code and natural language queries. Most existing deep learning-based approaches for code search rely on the sequential text ., …