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

Digital Commons Network™

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year

Articles 1351 - 1380 of 4266

Full-Text Articles in Entire DC Network

Checking Smart Contracts With Structural Code Embedding, Zhipeng Gao, Lingxiao Jiang, Xin Xia, David Lo, John Grundy Dec 2021

Checking Smart Contracts With Structural Code Embedding, Zhipeng Gao, Lingxiao Jiang, Xin Xia, David Lo, John Grundy

Research Collection School Of Computing and Information Systems

Smart contracts have been increasingly used together with blockchains to automate financial and business transactions. However, many bugs and vulnerabilities have been identified in many contracts which raises serious concerns about smart contract security, not to mention that the blockchain systems on which the smart contracts are built can be buggy. Thus, there is a significant need to better maintain smart contract code and ensure its high reliability. In this paper, we propose an automated approach to learn characteristics of smart contracts in Solidity, useful for repetitive contract code, bug detection and contract validation. Our new approach is based on …


Degree Doesn't Matter: Identifying The Drivers Of Interaction In Software Development Ecosystem, Amrita Bhattacharjee, Subhajit Datta, Subhashis Majumder Dec 2021

Degree Doesn't Matter: Identifying The Drivers Of Interaction In Software Development Ecosystem, Amrita Bhattacharjee, Subhajit Datta, Subhashis Majumder

Research Collection School Of Computing and Information Systems

Large scale software development ecosystems represent one of the most complex human enterprises. In such settings, developers are embedded in a web of shared concerns, responsibilities, and objectives at individual and collective levels. A deep understanding of the factors that influence developers to connect with one another is crucial in appreciating the challenges of such ecosystems as well as formulating strategies to overcome those challenges. We use real world data from multiple software development ecosystems to construct developer interaction networks and examine the mechanisms of such network formation using statistical models to identify developer attributes that have maximal influence on …


Imon: Appearance-Based Gaze Tracking System On Mobile Devices, Sinh Huynh, Rajesh Krishna Balan, Jeonggil Ko Dec 2021

Imon: Appearance-Based Gaze Tracking System On Mobile Devices, Sinh Huynh, Rajesh Krishna Balan, Jeonggil Ko

Research Collection School Of Computing and Information Systems

Gaze tracking is a key building block used in many mobile applications including entertainment, personal productivity, accessibility, medical diagnosis, and visual attention monitoring. In this paper, we present iMon, an appearance-based gaze tracking system that is both designed for use on mobile phones and has significantly greater accuracy compared to prior state-of-the-art solutions. iMon achieves this by comprehensively considering the gaze estimation pipeline and then overcoming three different sources of errors. First, instead of assuming that the user's gaze is fixed to a single 2D coordinate, we construct each gaze label using a probabilistic 2D heatmap gaze representation input to …


Statistical Moderation: A Case Study In Grading On A Curve, Manoj Thulasidas Dec 2021

Statistical Moderation: A Case Study In Grading On A Curve, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

There is a negative perception about “grading on a curve,” because of the feeling that the cohort strength may skew the final grades one way or another. However, given the difficulties in ensuring absolute uniformity in assessment across the years, especially when taught and assessed by different instructors under different settings, grading on a curve may be a necessary evil. Once we accept this type of statistical moderation as the last line of defense in standardizing the final scores so that student cohorts from different terms or sections or schools may be compared, we have to implement it well. In …


Early Prediction Of Hate Speech Propagation, Ken-Yu Lin, Roy Ka-Wei Lee, Wei Gao, Wen-Chih Peng Dec 2021

Early Prediction Of Hate Speech Propagation, Ken-Yu Lin, Roy Ka-Wei Lee, Wei Gao, Wen-Chih Peng

Research Collection School Of Computing and Information Systems

Online hate speech has disrupted the social connectedness in online communities and raises public safety concerns in our societies. Motivated by this rising issue, researchers have developed many machine learning and deep learning methods to detect hate speech in social media automatically. However, most of the existing automated solutions have focused on detecting hate speech in a single post, neglecting the network and information propagation effects of social media platforms. Ideally, the content moderators would want to identify the hateful posts and monitor posts and threads that are likely to induce hate. This paper aims to address this research gap …


Context-Aware Graph Convolutional Network For Dynamic Origin-Destination Prediction, Juan Nathaniel, Baihua Zheng Dec 2021

Context-Aware Graph Convolutional Network For Dynamic Origin-Destination Prediction, Juan Nathaniel, Baihua Zheng

Research Collection School Of Computing and Information Systems

A robust Origin-Destination (OD) prediction is key to urban mobility. A good forecasting model can reduce operational risks and improve service availability, among many other upsides. Here, we examine the use of Graph Convolutional Net-work (GCN) and its hybrid Markov-Chain (GCN-MC) variant to perform a context-aware OD prediction based on a large-scale public transportation dataset in Singapore. Compared with the baseline Markov-Chain algorithm and GCN, the proposed hybrid GCN-MC model improves the prediction accuracy by 37% and 12% respectively. Lastly, the addition of temporal and historical contextual information further improves the performance of the proposed hybrid model by 4 –12%.


Fine-Grained Generalization Analysis Of Inductive Matrix Completion, Antoine Ledent, Rodrigo Alves, Yunwen Lei, Marius Kloft Dec 2021

Fine-Grained Generalization Analysis Of Inductive Matrix Completion, Antoine Ledent, Rodrigo Alves, Yunwen Lei, Marius Kloft

Research Collection School Of Computing and Information Systems

In this paper, we bridge the gap between the state-of-the-art theoretical results for matrix completion with the nuclear norm and their equivalent in \textit{inductive matrix completion}: (1) In the distribution-free setting, we prove bounds improving the previously best scaling of \widetilde{O}(rd2) to \widetilde{O}(d3/2√r), where d is the dimension of the side information and rr is the rank. (2) We introduce the (smoothed) \textit{adjusted trace-norm minimization} strategy, an inductive analogue of the weighted trace norm, for which we show guarantees of the order \widetilde{O}(dr) under arbitrary sampling. In the inductive case, a similar rate was previously achieved only under uniform sampling …


Functional Signatures: New Definition And Constructions, Qingwen Guo, Qiong Huang, Sha Ma, Meiyan Xiao, Guomin Yang, Willy Susilo Dec 2021

Functional Signatures: New Definition And Constructions, Qingwen Guo, Qiong Huang, Sha Ma, Meiyan Xiao, Guomin Yang, Willy Susilo

Research Collection School Of Computing and Information Systems

Functional signatures (FS) enable a master authority to delegate its signing privilege to an assistant. Concretely, the master authority uses its secret key sk(F) to issue a signing key sk(f) for a designated function f is an element of F-FS and sends both f and sk(f) to the assistant E, which is then able to compute a signature sigma(f) with respect to pk(F) for a message y in the range of f. In this paper, we modify the syntax of FS slightly to support the application scenario where a certificate of authorization is necessary. Compared with the original FS, our …


Broadcast Authenticated Encryption With Keyword Search, Xueqiao Liu, Kai He, Guomin Yang, Willy Susilo, Joseph Tonien, Qiong Huang Dec 2021

Broadcast Authenticated Encryption With Keyword Search, Xueqiao Liu, Kai He, Guomin Yang, Willy Susilo, Joseph Tonien, Qiong Huang

Research Collection School Of Computing and Information Systems

The emergence of public-key encryption with keyword search (PEKS) has provided an elegant approach to enable keyword search over encrypted content. Due to its high computational complexity proportional to the number of intended receivers, the trivial way of deploying PEKS for data sharing with multiple receivers is impractical, which motivates the development of a new PEKS framework for broadcast mode. However, existing works suffer from either the vulnerability to keyword guessing attacks (KGA) or high computation and communication complexity. In this work, a new primitive for keyword search in broadcast mode, named broadcast authenticated encryption with keyword search (BAEKS), is …


Infinite Time Horizon Safety Of Bayesian Neural Networks, Mathias Lechner, Dorde Zikelic, Krishnendu Chatterjee, Thomas A. Henzinger Dec 2021

Infinite Time Horizon Safety Of Bayesian Neural Networks, Mathias Lechner, Dorde Zikelic, Krishnendu Chatterjee, Thomas A. Henzinger

Research Collection School Of Computing and Information Systems

Bayesian neural networks (BNNs) place distributions over the weights of a neural network to model uncertainty in the data and the network’s prediction. We consider the problem of verifying safety when running a Bayesian neural network policy in a feedback loop with infinite time horizon systems. Compared to the existing sampling-based approaches, which are inapplicable to the infinite time horizon setting, we train a separate deterministic neural network that serves as an infinite time horizon safety certificate. In particular, we show that the certificate network guarantees the safety of the system over a subset of the BNN weight posterior’s support. …


Efficient Reinforcement Learning In Resource Allocation Problems Through Permutation Invariant Multi-Task Learning, Desmond Cai, Shiau Hong Lim, Laura Wynter Dec 2021

Efficient Reinforcement Learning In Resource Allocation Problems Through Permutation Invariant Multi-Task Learning, Desmond Cai, Shiau Hong Lim, Laura Wynter

Research Collection School Of Computing and Information Systems

One of the main challenges in real-world reinforcement learning is to learn successfully from limited training samples. We show that in certain settings, the available data can be dramatically increased through a form of multi-task learning, by exploiting an invariance property in the tasks. We provide a theoretical performance bound for the gain in sample efficiency under this setting. This motivates a new approach to multi-task learning, which involves the design of an appropriate neural network architecture and a prioritized task-sampling strategy. We demonstrate empirically the effectiveness of the proposed approach on two real-world sequential resource allocation tasks where this …


Automated Doubt Identification From Informal Reflections Through Hybrid Sentic Patterns And Machine Learning Approach, Siaw Ling Lo, Kar Way Tan, Eng Lieh Ouh Dec 2021

Automated Doubt Identification From Informal Reflections Through Hybrid Sentic Patterns And Machine Learning Approach, Siaw Ling Lo, Kar Way Tan, Eng Lieh Ouh

Research Collection School Of Computing and Information Systems

Do my students understand? The question that lingers in every instructor’s mind after each lesson. With the focus on learner-centered pedagogy, is it feasible to provide timely and relevant guidance to individual learners according to their levels of understanding? One of the options available is to collect reflections from learners after each lesson to extract relevant feedback so that doubts or questions can be addressed in a timely manner. In this paper, we derived a hybrid approach that leverages a novel Doubt Sentic Pattern Detection (SPD) algorithm and a machine learning model to automate the identification of doubts from students’ …


Deriving Invariant Checkers For Critical Infrastructure Using Axiomatic Design Principles, Cheah Huei Yoong, Venkata Reddy Palleti, Rajib Ranjan Maiti, Arlindo Silva, Christopher M. Poskitt Dec 2021

Deriving Invariant Checkers For Critical Infrastructure Using Axiomatic Design Principles, Cheah Huei Yoong, Venkata Reddy Palleti, Rajib Ranjan Maiti, Arlindo Silva, Christopher M. Poskitt

Research Collection School Of Computing and Information Systems

Cyber-physical systems (CPSs) in critical infrastructure face serious threats of attack, motivating research into a wide variety of defence mechanisms such as those that monitor for violations of invariants, i.e. logical properties over sensor and actuator states that should always be true. Many approaches for identifying invariants attempt to do so automatically, typically using data logs, but these can miss valid system properties if relevant behaviours are not well-represented in the data. Furthermore, as the CPS is already built, resolving any design flaws or weak points identified through this process is costly. In this paper, we propose a systematic …


A Fine-Grained Attribute Based Data Retrieval With Proxy Re-Encryption Scheme For Data Outsourcing Systems, Hanshu Hong, Ximeng Liu, Zhixin Sun Dec 2021

A Fine-Grained Attribute Based Data Retrieval With Proxy Re-Encryption Scheme For Data Outsourcing Systems, Hanshu Hong, Ximeng Liu, Zhixin Sun

Research Collection School Of Computing and Information Systems

Attribute based encryption is suitable for data protection in data outsourcing systems such as cloud computing. However, the leveraging of encryption technique may retrain some routine operations over the encrypted data, particularly in the field of data retrieval. This paper presents an attribute based date retrieval with proxy re-encryption (ABDR-PRE) to provide both fine-grained access control and retrieval over the ciphertexts. The proposed scheme achieves fine-grained data access management by adopting KP-ABE mechanism, a delegator can generate the re-encryption key and search indexes for the ciphertexts to be shared over the target delegatee’s attributes. Throughout the process of data sharing, …


Learning To Iteratively Solve Routing Problems With Dual-Aspect Collaborative Transformer, Yining Ma, Jingwen Li, Zhiguang Cao, Wen Song, Le Zhang, Zhenghua Chen, Jing Tang Dec 2021

Learning To Iteratively Solve Routing Problems With Dual-Aspect Collaborative Transformer, Yining Ma, Jingwen Li, Zhiguang Cao, Wen Song, Le Zhang, Zhenghua Chen, Jing Tang

Research Collection School Of Computing and Information Systems

Recently, Transformer has become a prevailing deep architecture for solving vehicle routing problems (VRPs). However, it is less effective in learning improvement models for VRP because its positional encoding (PE) method is not suitable in representing VRP solutions. This paper presents a novel Dual-Aspect Collaborative Transformer (DACT) to learn embeddings for the node and positional features separately, instead of fusing them together as done in existing ones, so as to avoid potential noises and incompatible correlations. Moreover, the positional features are embedded through a novel cyclic positional encoding (CPE) method to allow Transformer to effectively capture the circularity and symmetry …


Concise Mercurial Subvector Commitments: Definitions And Constructions, Yannan Li, Willy Susilo, Guomin Yang, Tran Viet Xuan Phuong, Yong Yu, Dongxi Liu Dec 2021

Concise Mercurial Subvector Commitments: Definitions And Constructions, Yannan Li, Willy Susilo, Guomin Yang, Tran Viet Xuan Phuong, Yong Yu, Dongxi Liu

Research Collection School Of Computing and Information Systems

Vector commitment and its variants have attracted a lot of attention recently as they have been exposed to a wide range of applications in blockchain. Two special extensions of vector commitments, namely subvector commitments and mercurial commitments, have been proposed with attractive features that are desirable in many applications. Nevertheless, to the best of our knowledge, a single construction satisfying all those attractive features is still missing. In this work, we analyze those important properties and propose a new primitive called mercurial subvector commitments, which are efficiently updatable, mercurial hiding, position binding, and aggregatable. We formalize the system model and …


Hierarchical Control Of Multi-Agent Reinforcement Learning Team In Real-Time Strategy (Rts) Games, Weigui Jair Zhou, Budhitama Subagdja, Ah-Hwee Tan, Darren Wee Sze Ong Dec 2021

Hierarchical Control Of Multi-Agent Reinforcement Learning Team In Real-Time Strategy (Rts) Games, Weigui Jair Zhou, Budhitama Subagdja, Ah-Hwee Tan, Darren Wee Sze Ong

Research Collection School Of Computing and Information Systems

Coordinated control of multi-agent teams is an important task in many real-time strategy (RTS) games. In most prior work, micromanagement is the commonly used strategy whereby individual agents operate independently and make their own combat decisions. On the other extreme, some employ a macromanagement strategy whereby all agents are controlled by a single decision model. In this paper, we propose a hierarchical command and control architecture, consisting of a single high-level and multiple low-level reinforcement learning agents operating in a dynamic environment. This hierarchical model enables the low-level unit agents to make individual decisions while taking commands from the high-level …


Vireo @ Trecvid 2021 Ad-Hoc Video Search, Jiaxin Wu, Phuong Anh Nguyen, Chong-Wah Ngo Dec 2021

Vireo @ Trecvid 2021 Ad-Hoc Video Search, Jiaxin Wu, Phuong Anh Nguyen, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

In this paper, we summarize our submitted runs and results for Ad-hoc Video Search (AVS) task at TRECVid 2020


Verification Assisted Gas Reduction For Smart Contracts, Bo Gao, Siyuan Shen, Ling Shi, Jiaying Li, Jun Sun, Lei Bu Dec 2021

Verification Assisted Gas Reduction For Smart Contracts, Bo Gao, Siyuan Shen, Ling Shi, Jiaying Li, Jun Sun, Lei Bu

Research Collection School Of Computing and Information Systems

Smart contracts are computerized transaction protocols built on top of blockchain networks. Users are charged with fees, a.k.a. gas in Ethereum, when they create, deploy or execute smart contracts. Since smart contracts may contain vulnerabilities which may result in huge financial loss, developers and smart contract compilers often insert codes for security checks. The trouble is that those codes consume gas every time they are executed. Many of the inserted codes are however redundant. In this work, we present sOptimize, a tool that optimizes smart contract gas consumption automatically without compromising functionality or security. sOptimize works on smart contract bytecode, …


Sofi: Reflection-Augmented Fuzzing For Javascript Engines, Xiaoyu He, Xiaofei Xie, Yuekang Li, Jianwen Sun, Feng Li, Wei Zou, Yang Liu, Lei Yu, Jianhua Zhou, Wenchang Shi, Wei Huo Nov 2021

Sofi: Reflection-Augmented Fuzzing For Javascript Engines, Xiaoyu He, Xiaofei Xie, Yuekang Li, Jianwen Sun, Feng Li, Wei Zou, Yang Liu, Lei Yu, Jianhua Zhou, Wenchang Shi, Wei Huo

Research Collection School Of Computing and Information Systems

JavaScript engines have been shown prone to security vulnerabilities, which can lead to serious consequences due to their popularity. Fuzzing is an effective testing technique to discover vulnerabilities. The main challenge of fuzzing JavaScript engines is to generate syntactically and semantically valid inputs such that deep functionalities can be explored. However, due to the dynamic nature of JavaScript and the special features of different engines, it is quite challenging to generate semantically meaningful test inputs.We observed that state-of-the-art semantic-aware JavaScript fuzzers usually require manually written rules to analyze the semantics for a JavaScript engine, which is labor-intensive, incomplete and engine-specific. …


Figcps: Effective Failure-Inducing Input Generation For Cyber-Physical Systems With Deep Reinforcement Learning, Shaohua Zhang, Shuang Liu, Jun Sun, Yuqi Chen, Wenzhi Huang, Jinyi Liu, Jian Liu, Jianye Hao Nov 2021

Figcps: Effective Failure-Inducing Input Generation For Cyber-Physical Systems With Deep Reinforcement Learning, Shaohua Zhang, Shuang Liu, Jun Sun, Yuqi Chen, Wenzhi Huang, Jinyi Liu, Jian Liu, Jianye Hao

Research Collection School Of Computing and Information Systems

Cyber-Physical Systems (CPSs) are composed of computational control logic and physical processes, that intertwine with each other. CPSs are widely used in various domains of daily life, including those safety-critical systems and infrastructures, such as medical monitoring, autonomous vehicles, and water treatment systems. It is thus critical to effectively test them. However, it is not easy to obtain test cases which can fail the CPS. In this work, we propose a failure-inducing input generation approach FIGCPS for CPS, which requires no knowledge of the CPS under test or any history logs of the CPS which are usually hard to obtain. …


Finding A Needle In A Haystack: Automatic Mining Of Silent Vulnerability Fixes, Jiayuan Zhou, Michael Pacheco, Zhiyuan Wan, Xin Xia, David Lo, Yuan Wang, Ahmed E. Hassan Nov 2021

Finding A Needle In A Haystack: Automatic Mining Of Silent Vulnerability Fixes, Jiayuan Zhou, Michael Pacheco, Zhiyuan Wan, Xin Xia, David Lo, Yuan Wang, Ahmed E. Hassan

Research Collection School Of Computing and Information Systems

Following the coordinated vulnerability disclosure model, a vulnerability in open source software (OSS) is suggested to be fixed “silently”, without disclosing the fix until the vulnerability is disclosed. Yet, it is crucial for OSS users to be aware of vulnerability fixes as early as possible, as once a vulnerability fix is pushed to the source code repository, a malicious party could probe for the corresponding vulnerability to exploit it. In practice, OSS users often rely on the vulnerability disclosure information from security advisories (e.g., National Vulnerability Database) to sense vulnerability fixes. However, the time between the availability of a vulnerability …


Topic Modeling For Multi-Aspect Listwise Comparison, Delvin Ce Zhang, Hady W. Lauw Nov 2021

Topic Modeling For Multi-Aspect Listwise Comparison, Delvin Ce Zhang, Hady W. Lauw

Research Collection School Of Computing and Information Systems

As a well-established probabilistic method, topic models seek to uncover latent semantics from plain text. In addition to having textual content, we observe that documents are usually compared in listwise rankings based on their content. For instance, world-wide countries are compared in an international ranking in terms of electricity production based on their national reports. Such document comparisons constitute additional information that reveal documents' relative similarities. Incorporating them into topic modeling could yield comparative topics that help to differentiate and rank documents. Furthermore, based on different comparison criteria, the observed document comparisons usually cover multiple aspects, each expressing a distinct …


Cs-Light: Camera Sensing Based Occupancy-Aware Robust Smart Building Lighting Control, Anuradha Ravi, Kasun Pramuditha Gamlath, Siyan Hu, Archan Misra Nov 2021

Cs-Light: Camera Sensing Based Occupancy-Aware Robust Smart Building Lighting Control, Anuradha Ravi, Kasun Pramuditha Gamlath, Siyan Hu, Archan Misra

Research Collection School Of Computing and Information Systems

We describe the practical development of a smart lighting control system, CS-Light, that uses a preexisting surveillance camera infrastructure as the sole sensing substrate. At a high level, the camera feeds are used to both (a) estimate the illuminance of individual, fine-grained (roughly 12m2) sub-regions, and (b) identify sub-regions that have non-transient human occupancy. Subsequently, these estimates are used to perform fine-grained (non-binary) power optimization of a set of LED luminaires, collectively minimizing energy consumption while assuring comfort to human occupants. The key to our approach is the ability to tackle the challenging problem of translating the luminance (pixel intensity) …


Learning To Teach And Learn For Semi-Supervised Few-Shot Image Classification, Xinzhe Li, Jianqiang Huang, Yaoyao Liu, Qin Zhou, Shibao Zheng, Bernt Schiele, Qianru Sun Nov 2021

Learning To Teach And Learn For Semi-Supervised Few-Shot Image Classification, Xinzhe Li, Jianqiang Huang, Yaoyao Liu, Qin Zhou, Shibao Zheng, Bernt Schiele, Qianru Sun

Research Collection School Of Computing and Information Systems

This paper presents a novel semi-supervised few-shot image classification method named Learning to Teach and Learn (LTTL) to effectively leverage unlabeled samples in small-data regimes. Our method is based on self-training, which assigns pseudo labels to unlabeled data. However, the conventional pseudo-labeling operation heavily relies on the initial model trained by using a handful of labeled data and may produce many noisy labeled samples. We propose to solve the problem with three steps: firstly, cherry-picking searches valuable samples from pseudo-labeled data by using a soft weighting network; and then, cross-teaching allows the classifiers to teach mutually for rejecting more noisy …


Stock Market Trend Forecasting Based On Multiple Textual Features: A Deep Learning Method, Zhenda Hu, Zhaoxia Wang, Seng-Beng Ho, Ah-Hwee Tan Nov 2021

Stock Market Trend Forecasting Based On Multiple Textual Features: A Deep Learning Method, Zhenda Hu, Zhaoxia Wang, Seng-Beng Ho, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Stock market trend forecasting is a valuable and challenging research task for both industry and academia. In order to explore the influence of stock news information on the stock market trend, a textual embedding construction method is proposed to encode multiple textual features, including topic features, sentiment features, and semantic features extracted from stock news textual content. In addition, a deep learning method is designed by using financial data and multiple textual features obtained from multiple news textual embeddings for short-term stock market trend prediction. For evaluation, extensive experiments on real stock market data are conducted. The experimental results illustrate …


Efficient Server-Aided Secure Two-Party Computation In Heterogeneous Mobile Cloud Computing, Yulin Wu, Xuan Wang, Willy Susilo, Guomin Yang, Zoe L. Jiang, Qian Chen, Peng Xu Nov 2021

Efficient Server-Aided Secure Two-Party Computation In Heterogeneous Mobile Cloud Computing, Yulin Wu, Xuan Wang, Willy Susilo, Guomin Yang, Zoe L. Jiang, Qian Chen, Peng Xu

Research Collection School Of Computing and Information Systems

With the ubiquity of mobile devices and rapid development of cloud computing, mobile cloud computing (MCC) has been considered as an essential computation setting to support complicated, scalable and flexible mobile applications by overcoming the physical limitations of mobile devices with the aid of cloud. In the MCC setting, since many mobile applications (e.g., map apps) interacting with cloud server and application server need to perform computation with the private data of users, it is important to realize secure computation for MCC. In this article, we propose an efficient server-aided secure two-party computation (2PC) protocol for MCC. This is the …


Is Multi-Hop Reasoning Really Explainable? Towards Benchmarking Reasoning Interpretability, Xin Lv, Yixin Cao, Lei Hou, Juanzi Li, Zhiyuan Liu, Yichi Zhang, Zelin Dai Nov 2021

Is Multi-Hop Reasoning Really Explainable? Towards Benchmarking Reasoning Interpretability, Xin Lv, Yixin Cao, Lei Hou, Juanzi Li, Zhiyuan Liu, Yichi Zhang, Zelin Dai

Research Collection School Of Computing and Information Systems

Multi-hop reasoning has been widely studied in recent years to obtain more interpretable link prediction. However, we find in experiments that many paths given by these models are actually unreasonable, while little work has been done on interpretability evaluation for them. In this paper, we propose a unified framework to quantitatively evaluate the interpretability of multi-hop reasoning models so as to advance their development. In specific, we define three metrics, including path recall, local interpretability, and global interpretability for evaluation, and design an approximate strategy to calculate these metrics using the interpretability scores of rules. We manually annotate all possible …


Patchnet: Hierarchical Deep Learning-Based Stable Patch Identification For The Linux Kernel, Thong Hoang, Julia Lawall, Yuan Tian, Richard J. Oentaryo, David Lo Nov 2021

Patchnet: Hierarchical Deep Learning-Based Stable Patch Identification For The Linux Kernel, Thong Hoang, Julia Lawall, Yuan Tian, Richard J. Oentaryo, David Lo

Research Collection School Of Computing and Information Systems

Linux kernel stable versions serve the needs of users who value stability of the kernel over new features. The quality of such stable versions depends on the initiative of kernel developers and maintainers to propagate bug fixing patches to the stable versions. Thus, it is desirable to consider to what extent this process can be automated. A previous approach relies on words from commit messages and a small set of manually constructed code features. This approach, however, shows only moderate accuracy. In this paper, we investigate whether deep learning can provide a more accurate solution. We propose PatchNet, a hierarchical …


Where2change: Change Request Localization For App Reviews, Tao Zhang, Jiachi Chen, Xian Zhan, Xiapu Luo, David Lo, He Jiang Nov 2021

Where2change: Change Request Localization For App Reviews, Tao Zhang, Jiachi Chen, Xian Zhan, Xiapu Luo, David Lo, He Jiang

Research Collection School Of Computing and Information Systems

Million of mobile apps have been released to the market. Developers need to maintain these apps so that they can continue to benefit end users. Developers usually extract useful information from user reviews to maintain and evolve mobile apps. One of the important activities that developers need to do while reading user reviews is to locate the source code related to requested changes. Unfortunately, this manual work is costly and time consuming since: (1) an app can receive thousands of reviews, and (2) a mobile app can consist of hundreds of source code files. To address this challenge, Palomba et …