Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (8556)
- Computer Sciences (8539)
- Databases and Information Systems (3453)
- Software Engineering (2164)
- Artificial Intelligence and Robotics (1697)
-
- Information Security (1071)
- Numerical Analysis and Scientific Computing (1025)
- Graphics and Human Computer Interfaces (933)
- Engineering (888)
- Social and Behavioral Sciences (681)
- Business (642)
- Theory and Algorithms (493)
- Computer Engineering (451)
- Operations Research, Systems Engineering and Industrial Engineering (410)
- Programming Languages and Compilers (379)
- OS and Networks (324)
- Communication (297)
- Social Media (240)
- Public Affairs, Public Policy and Public Administration (217)
- Transportation (195)
- Medicine and Health Sciences (181)
- Education (170)
- Management Information Systems (167)
- Data Storage Systems (162)
- E-Commerce (148)
- International and Area Studies (111)
- Asian Studies (110)
- Health Information Technology (110)
- Digital Communications and Networking (104)
- Technology and Innovation (104)
- Keyword
-
- Deep learning (123)
- Machine learning (122)
- Social media (74)
- Artificial intelligence (72)
- Reinforcement learning (69)
-
- Privacy (65)
- Data mining (64)
- Cloud computing (58)
- Deep Learning (56)
- Empirical study (54)
- Optimization (54)
- Security (54)
- Visualization (51)
- Task analysis (50)
- Online learning (49)
- Software engineering (49)
- Training (49)
- Neural networks (48)
- Singapore (48)
- Anomaly detection (47)
- Feature extraction (46)
- Twitter (46)
- Large Language Models (45)
- Blockchain (44)
- Collaboration (44)
- Semantics (43)
- Access control (41)
- Algorithms (40)
- Android (39)
- Natural language processing (39)
- Publication Year
- File Type
Articles 3481 - 3510 of 8597
Full-Text Articles in Entire DC Network
Detecting Fake News In Social Media: An Asia-Pacific Perspective, Meeyoung Cha, Wei Gao, Cheng-Te Li
Detecting Fake News In Social Media: An Asia-Pacific Perspective, Meeyoung Cha, Wei Gao, Cheng-Te Li
Research Collection School Of Computing and Information Systems
In March 2011, the catastrophic accident known as "The Fukushima Daiichi nuclear disaster" took place, initiated by the Tohoku earthquake and tsunami in Japan. The only nuclear accident to receive a Level-7 classification on the International Nuclear Event Scale since the Chernobyl nuclear power plant disaster in 1986, the Fukushima event triggered global concerns and rumors regarding radiation leaks. Among the false rumors was an image, which had been described as a map of radioactive discharge emanating into the Pacific Ocean, as illustrated in the accompanying figure. In fact, this figure, depicting the wave height of the tsunami that followed, …
Automated Synthesis Of Local Time Requirement For Service Composition, Étienne André, Tian Huat Tan, Manman Chen, Shuang Liu, Jun Sun, Yang Liu, Jin Song Dong
Automated Synthesis Of Local Time Requirement For Service Composition, Étienne André, Tian Huat Tan, Manman Chen, Shuang Liu, Jun Sun, Yang Liu, Jin Song Dong
Research Collection School Of Computing and Information Systems
Service composition aims at achieving a business goal by composing existing service-based applications or components. The response time of a service is crucial, especially in time-critical business environments, which is often stated as a clause in service-level agreements between service providers and service users. To meet the guaranteed response time requirement of a composite service, it is important to select a feasible set of component services such that their response time will collectively satisfy the response time requirement of the composite service. In this work, we use the BPEL modeling language that aims at specifying Web services. We extend it …
Space Efficient Revocable Ibe For Mobile Devices In Cloud Computing, Baodong Qin, Ximeng Liu, Zhuo Wei, Dong Zheng
Space Efficient Revocable Ibe For Mobile Devices In Cloud Computing, Baodong Qin, Ximeng Liu, Zhuo Wei, Dong Zheng
Research Collection School Of Computing and Information Systems
Revocation capacity is one of the main properties for an identity-based encryption (IBE), as in practice users’ private keys are possibly leaked or expired. However, existing revocable IBE schemes usually lack of short keys. Recently, Lin et al. proposed a method to design space efficient revocable IBE scheme from non-monotonic key-policy attribute-based encryption scheme. But, it requires too many pairings (linear to the number of revoked users) to decrypt an IBE ciphertext. In this study, we overcome this problem by adopting the technique of server-aided revocation, recently proposed by Qin et al. in ESORICS 2015. The main contribution is a …
S2n2: An Interpretive Semantic Structure Attention Neural Network For Trajectory Classification, Canghong Jin, Ting Tao, Xianzhe Luo, Zemin Liu, Minghui Wu
S2n2: An Interpretive Semantic Structure Attention Neural Network For Trajectory Classification, Canghong Jin, Ting Tao, Xianzhe Luo, Zemin Liu, Minghui Wu
Research Collection School Of Computing and Information Systems
We have witnessed a rapid growth over past decades in sensor data mining (SDM), which aims at extracting valuable information automatically from large repositories of moving activity data. One of the significant SDM tasks is identifying humans through their transit modes using a variety of user-tracking systems. However, to the best of our knowledge, distinguishing traces of users and understanding their behaviors are difficult tasks in most real-life cases for the following reasons: 1) activity data containing both temporal and spatial contexts are of high order and sparse; 2) living patterns are not as regular as expected, and the route …
The Search For Optimal Oxygen Saturation Targets In Critically Ill: Patients Observational Data From Large Icu Databases, Willem Van Den Boom, Michael Hoy, Jagadish Sankaran, Mengru Liu, Haroun Chahed, Mengling Feng, Kay Choong See
The Search For Optimal Oxygen Saturation Targets In Critically Ill: Patients Observational Data From Large Icu Databases, Willem Van Den Boom, Michael Hoy, Jagadish Sankaran, Mengru Liu, Haroun Chahed, Mengling Feng, Kay Choong See
Research Collection School Of Computing and Information Systems
Background: Although low oxygen saturations are generally regarded as deleterious, recent studies in ICU patients have shown that a liberal oxygen strategy increases mortality. However, the optimal oxygen saturation target remains unclear. The goal of this study was to determine the optimal range by using real-world data. Methods: Replicate retrospective analyses were conducted of two electronic medical record databases: the eICU Collaborative Research Database (eICU-CRD) and the Medical Information Mart for Intensive Care III database (MIMIC). Only patients with at least 48 h of oxygen therapy were included. Nonlinear regression was used to analyze the association between median pulse oximetry-derived …
Predicting Student Performance In Interactive Online Question Pools Using Mouse Interaction Features, Huan Wei, Haotian Li, Meng Xia, Yong Wang, Huamin Qu
Predicting Student Performance In Interactive Online Question Pools Using Mouse Interaction Features, Huan Wei, Haotian Li, Meng Xia, Yong Wang, Huamin Qu
Research Collection School Of Computing and Information Systems
Modeling student learning and further predicting the performance is a well-established task in online learning and is crucial to personalized education by recommending different learning resources to different students based on their needs. Interactive online question pools (e.g., educational game platforms), an important component of online education, have become increasingly popular in recent years. However, most existing work on student performance prediction targets at online learning platforms with a well-structured curriculum, predefined question order and accurate knowledge tags provided by domain experts. It remains unclear how to conduct student performance prediction in interactive online question pools without such well-organized question …
Capacitor-Based Activity Sensing For Kinetic-Powered Wearable Iots, Guohao Lan, Dong Ma, Weitao Xu, Mahbub Hassan, Wen Hu
Capacitor-Based Activity Sensing For Kinetic-Powered Wearable Iots, Guohao Lan, Dong Ma, Weitao Xu, Mahbub Hassan, Wen Hu
Research Collection School Of Computing and Information Systems
We propose the use of the conventional energy storage component, i.e., capacitor, in the kinetic-powered wearable IoTs as the sensor to detect human activities. Since activities accumulate energy in the capacitor at different rates, the charging rate of the capacitor can be used to detect the activities. The key advantage of the proposed capacitor-based activity sensing mechanism, called CapSense, is that it obviates the need for sampling the motion signal at a high rate, and thus, significantly reduces power consumption of the wearable device. The challenge we face is that capacitors are inherently non-linear energy accumulators, which leads to significant …
W8-Scope: Fine-Grained, Practical Monitoring Of Weight Stack-Based Exercises, Meeralakshmi Radhakrishnan, Archan Misra, Rajesh Krishna Balan
W8-Scope: Fine-Grained, Practical Monitoring Of Weight Stack-Based Exercises, Meeralakshmi Radhakrishnan, Archan Misra, Rajesh Krishna Balan
Research Collection School Of Computing and Information Systems
Fine-grained, unobtrusive monitoring of gym exercises can help users track their own exercise routines and also provide corrective feedback. We propose W8-Scope, a system that uses a simple magnetic-cum-accelerometer sensor, mounted on the weight stack of gym exercise machines, to infer various attributes of gym exercise behavior. More specifically, using multiple machine learning models, W8-Scope helps identify who is exercising, what exercise she is doing, how much weight she is lifting, and whether she is committing any common mistakes. Real world studies, conducted with 50 subjects performing 14 different exercises over 103 distinct sessions in two gyms, show that W8-Scope …
Privacy-Preserving Data Processing With Flexible Access Control, Wenxiu Ding, Zheng Yan, Robert H. Deng
Privacy-Preserving Data Processing With Flexible Access Control, Wenxiu Ding, Zheng Yan, Robert H. Deng
Research Collection School Of Computing and Information Systems
Cloud computing provides an efficient and convenient platform for cloud users to store, process and control their data. Cloud overcomes the bottlenecks of resource-constrained user devices and greatly releases their storage and computing burdens. However, due to the lack of full trust in cloud service providers, the cloud users generally prefer to outsource their sensitive data in an encrypted form, which, however, seriously complicates data processing, analysis, as well as access control. Homomorphic encryption (HE) as a single key system cannot flexibly control data sharing and access after encrypted data processing. How to realize various computations over encrypted data in …
Light Structure From Pin Motion: Geometric Point Light Source Calibration, Hiroaki Santo, Michael Waechter, Wen-Yan Lin, Yusuke Sugano, Yasuyuki Matsushita
Light Structure From Pin Motion: Geometric Point Light Source Calibration, Hiroaki Santo, Michael Waechter, Wen-Yan Lin, Yusuke Sugano, Yasuyuki Matsushita
Research Collection School Of Computing and Information Systems
We present a method for geometric point light source calibration. Unlike prior works that use Lambertian spheres, mirror spheres, or mirror planes, we use a calibration target consisting of a plane and small shadow casters at unknown positions above the plane. We show that shadow observations from a moving calibration target under a fixed light follow the principles of pinhole camera geometry and epipolar geometry, allowing joint recovery of the light position and 3D shadow caster positions, equivalent to how conventional structure from motion jointly recovers camera parameters and 3D feature positions from observed 2D features. Moreover, we devised a …
Automatic Verification Of Multi-Threaded Programs By Inference Of Rely-Guarantee Specifications, Xuan-Bach Le, David Sanan, Jun Sun, Shang-Wei Lin
Automatic Verification Of Multi-Threaded Programs By Inference Of Rely-Guarantee Specifications, Xuan-Bach Le, David Sanan, Jun Sun, Shang-Wei Lin
Research Collection School Of Computing and Information Systems
Rely-Guarantee is a comprehensive technique that supports compositional reasoning for concurrent programs. However, specifications of the Rely condition - environment interference, and Guarantee condition - local transformation of thread state - are challenging to establish. Thus the construction of these conditions becomes bottleneck in automating the technique. To tackle the above problem, we propose a verification framework that, based on Rely-Guarantee principles, constructs the correctness proof of concurrent program through inferring suitable Rely -Guarantee conditions automatically. Our framework first constructs a Hoare-style sequential proof for each thread and then applies abstraction refinement to elevate these proofs into concurrent ones with …
When The Bank Comes To You: Branch Network And Customer Omnichannel Banking Behavior, Mi Zhou, Dan Geng, Vibhanshu Abhishek, Beibei Li
When The Bank Comes To You: Branch Network And Customer Omnichannel Banking Behavior, Mi Zhou, Dan Geng, Vibhanshu Abhishek, Beibei Li
Research Collection School Of Computing and Information Systems
Banks today have been increasingly reducing their physical presence and redirecting customers to digital channels, and yet, the consequences of this strategy are not well studied. This paper investigates the effects of banks' branch network changes (i.e., branch openings and branch closures) on customer omnichannel banking behavior. Using approximately 0.85 million (33 months') anonymized individual-level banking transactions from a large commercial bank in the United States, this paper shows the asymmetric effects of branch openings and branch closures on customer omnichannel banking behavior. In particular, we find that branch openings increase customers' branch transactions; however, the first branch opening leads …
The Spatial Optimization And Evaluation Of The Economic, Ecological, And Social Value Of Urban Green Space In Shenzhen, Yuhan Yu, Wenting Zhang, Peihong Fu, Wei Huang, Keke Li, Kai Cao
The Spatial Optimization And Evaluation Of The Economic, Ecological, And Social Value Of Urban Green Space In Shenzhen, Yuhan Yu, Wenting Zhang, Peihong Fu, Wei Huang, Keke Li, Kai Cao
Research Collection School Of Computing and Information Systems
Urban green space (UGS) is important in urban systems, as it benefits economic development, ecological conservation, and living conditions. Many studies have evaluated the economic, ecological, and social value of UGS worldwide, and spatial optimization for UGS has been carried out to maximize its value. However, few studies have simultaneously examined these three values of UGS in one optimization system. To fill this gap, this study evaluated the economic value of UGS in terms of promoting housing prices, its ecological value through the relief of high land surface temperature (LST), and its social value through the provision of recreation spaces …
Vehicle Routing Problem For Multi-Product Cross-Docking, Aldy Gunawan, Audrey Tedja Widjaja, Benjamin Gan, Vincent F. Yu, Panca Jodiawan
Vehicle Routing Problem For Multi-Product Cross-Docking, Aldy Gunawan, Audrey Tedja Widjaja, Benjamin Gan, Vincent F. Yu, Panca Jodiawan
Research Collection School Of Computing and Information Systems
Cross-docking is a logistic technique that can reduce costs occurred in a supply chain network while increasing the flow of goods, thus shortening the shipping cycle. Inside a cross-dock facility, the goods are directly transferred from incoming vehicles to outgoing vehicles without storing them in-between. Our research extends and combines this cross-docking technique with a well-known logistic problem, the vehicle routing problem (VRP), for delivering multiple products and addresses it as the VRP for multi-product cross-docking (VRP-MPCD). We developed a mixed integer programming model and generated two sets of VRP-MPCD instances, which are based on VRPCD instances. The instances are …
Deepbindiff: Learning Program-Wide Code Representations For Binary Diffing, Yue Duan, Xuezixiang Li, Jinghan Wang, Wang, Heng Yin
Deepbindiff: Learning Program-Wide Code Representations For Binary Diffing, Yue Duan, Xuezixiang Li, Jinghan Wang, Wang, Heng Yin
Research Collection School Of Computing and Information Systems
Binary diffing analysis quantitatively measures the differences between two given binaries and produces fine-grained basic block matching. It has been widely used to enable different kinds of critical security analysis. However, all existing program analysis and machine learning based techniques suffer from low accuracy, poor scalability, coarse granularity, or require extensive labeled training data to function. In this paper, we propose an unsupervised program-wide code representation learning technique to solve the problem. We rely on both the code semantic information and the program-wide control flow information to generate block embeddings. Furthermore, we propose a k-hop greedy matching algorithm to find …
Mcdpc: Multi‐Center Density Peak Clustering, Yizhang Wang, Di Wang, Xiaofeng Zhang, Wei Pang, Chunyan Miao, Ah-Hwee Tan, You Zhou
Mcdpc: Multi‐Center Density Peak Clustering, Yizhang Wang, Di Wang, Xiaofeng Zhang, Wei Pang, Chunyan Miao, Ah-Hwee Tan, You Zhou
Research Collection School Of Computing and Information Systems
Density peak clustering (DPC) is a recently developed density-based clustering algorithm that achieves competitive performance in a non-iterative manner. DPC is capable of effectively handling clusters with single density peak (single center), i.e., based on DPC’s hypothesis, one and only one data point is chosen as the center of any cluster. However, DPC may fail to identify clusters with multiple density peaks (multi-centers) and may not be able to identify natural clusters whose centers have relatively lower local density. To address these limitations, we propose a novel clustering algorithm based on a hierarchical approach, named multi-center density peak clustering (McDPC). …
Automated Deprecated-Api Usage Update For Android Apps: How Far Are We?, Ferdian Thung, Stefanus Agus Haryono, Lucas Serrano, Gilles Muller, Julia Lawall, David Lo, Lingxiao Jiang
Automated Deprecated-Api Usage Update For Android Apps: How Far Are We?, Ferdian Thung, Stefanus Agus Haryono, Lucas Serrano, Gilles Muller, Julia Lawall, David Lo, Lingxiao Jiang
Research Collection School Of Computing and Information Systems
As the Android API evolves, some API methods may be deprecated, to be eventually removed. App developers face the challenge of keeping their apps up-to-date, to ensure that the apps work in both older and newer Android versions. Currently, AppEvolve is the state-of-the-art approach to automate such updates, and it has been shown to be quite effective. Still, the number of experiments reported is moderate, involving only API usage updates in 41 usage locations. In this work, we replicate the evaluation of AppEvolve and assess whether its effectiveness is generalizable. Given the set of APIs on which AppEvolve has been …
Five Challenges In Cloud-Enabled Intelligence And Control, Tarek Abdelzaher, Yifan Hao, Kasthuri Jayarajah, Archan Misra, Per Skarin, Shuochao Yao, Dulanga Kaveesha Weerakoon Weerakoon Mudiyanselage, Karl-Erik Arzen
Five Challenges In Cloud-Enabled Intelligence And Control, Tarek Abdelzaher, Yifan Hao, Kasthuri Jayarajah, Archan Misra, Per Skarin, Shuochao Yao, Dulanga Kaveesha Weerakoon Weerakoon Mudiyanselage, Karl-Erik Arzen
Research Collection School Of Computing and Information Systems
The proliferation of connected embedded devices, or the Internet of Things (IoT), together with recent advances in machine intelligence, will change the profile of future cloud services and introduce a variety of new research problems, both in cloud applications and infrastructure layers. These problems are centered around empowering individually resource-limited devices to exhibit intelligent behavior, both in sensing and control, thanks to a judicious utilization of cloud resources. Cloud services will enable learning from data, performing inference, and executing control, all with assurances on outcomes. The paper discusses such emerging services and outlines five resulting new research directions towards enabling …
Generating Realistic Stock Market Order Streams, Junyi Li, Xintong Wang, Yaoyang Lin, Arunesh Sinha, Michael P. Wellman
Generating Realistic Stock Market Order Streams, Junyi Li, Xintong Wang, Yaoyang Lin, Arunesh Sinha, Michael P. Wellman
Research Collection School Of Computing and Information Systems
We propose an approach to generate realistic and high-fidelity stock market data based on generative adversarial networks. We model the order stream as a stochastic process with finite history dependence, and employ a conditional Wasserstein GAN to capture history dependence of orders in a stock market. We test our approach with actual market and synthetic data on a number of different statistics, and find the generated data to be close to real data.
Topic Modeling On Document Networks With Adjacent-Encoder, Ce Zhang, Hady W. Lauw
Topic Modeling On Document Networks With Adjacent-Encoder, Ce Zhang, Hady W. Lauw
Research Collection School Of Computing and Information Systems
Oftentimes documents are linked to one another in a network structure,e.g., academic papers cite other papers, Web pages link to other pages. In this paper we propose a holistic topic model to learn meaningful and unified low-dimensional representations for networked documents that seek to preserve both textual content and network structure. On the basis of reconstructing not only the input document but also its adjacent neighbors, we develop two neural encoder architectures. Adjacent-Encoder, or AdjEnc, induces competition among documents for topic propagation, and reconstruction among neighbors for semantic capture. Adjacent-Encoder-X, or AdjEnc-X, extends this to also encode the network structure …
Multi-Level Fine-Scaled Sentiment Sensing With Ambivalence Handling, Zhaoxia Wang, Seng-Beng Ho, Erik Cambria
Multi-Level Fine-Scaled Sentiment Sensing With Ambivalence Handling, Zhaoxia Wang, Seng-Beng Ho, Erik Cambria
Research Collection School Of Computing and Information Systems
Social media represent a rich source of information, such as critiques, feedback, and other opinions posted online by Internet users. Such information is typically a good reflection of users’ sentiments and attitudes towards various services, topics, or products. Sentiment analysis has become an increasingly important natural language processing (NLP) task to help users make sense of what is happening in the Internet blogosphere and it can be useful for companies as well as public organizations. However, most existing sentiment analysis techniques are only able to analyze data at the aggregate level, merely providing a binary classification (positive vs. negative), and …
Interpretable Rumor Detection In Microblogs By Attending To User Interactions, Ling Min Serena Khoo, Hai Leong Chieu, Zhong Qian, Jing Jiang
Interpretable Rumor Detection In Microblogs By Attending To User Interactions, Ling Min Serena Khoo, Hai Leong Chieu, Zhong Qian, Jing Jiang
Research Collection School Of Computing and Information Systems
We address rumor detection by learning to differentiate between the community’s response to real and fake claims in microblogs. Existing state-of-the-art models are based on tree models that model conversational trees. However, in social media, a user posting a reply might be replying to the entire thread rather than to a specific user. We propose a post-level attention model (PLAN) to model long distance interactions between tweets with the multi-head attention mechanism in a transformer network. We investigated variants of this model: (1) a structure aware self-attention model (StA-PLAN) that incorporates tree structure information in the transformer network, and (2) …
Neural Approximate Dynamic Programming For On-Demand Ride-Pooling, Sanket Shah, Meghna Lowalekar, Pradeep Varakantham
Neural Approximate Dynamic Programming For On-Demand Ride-Pooling, Sanket Shah, Meghna Lowalekar, Pradeep Varakantham
Research Collection School Of Computing and Information Systems
On-demand ride-pooling (e.g., UberPool, LyftLine, GrabShare) has recently become popular because of its ability to lower costs for passengers while simultaneously increasing revenue for drivers and aggregation companies (e.g., Uber). Unlike in Taxi on Demand (ToD) services – where a vehicle is assigned one passenger at a time – in on-demand ride-pooling, each vehicle must simultaneously serve multiple passengers with heterogeneous origin and destination pairs without violating any quality constraints. To ensure near real-time response, existing solutions to the real-time ride-pooling problem are myopic in that they optimise the objective (e.g., maximise the number of passengers served) for the current …
Does Reputational Sanctions Deter Negligence In Information Security Management? A Field Quasi-Experiment, Qian Tang, Andrew B. Whinston
Does Reputational Sanctions Deter Negligence In Information Security Management? A Field Quasi-Experiment, Qian Tang, Andrew B. Whinston
Research Collection School Of Computing and Information Systems
Security negligence, a major cause of data breaches, occurs when an organization’s information technology management fails to adequately address security vulnerabilities. By conducting a field quasi-experiment using outgoing spam as a focal security issue, this study investigates the effectiveness of reputational sanctions in reducing security negligence in a global context. In the quasi-experiment, a reputational sanction mechanism based on outgoing spam was established for four countries, and for each country, reputational sanctions were imposed on the 10 organizations with the largest outgoing spam volumes—that is, these organizations were listed publicly. We find that because of our reputational sanction mechanism, organizations …
Saga: Efficient And Large-Scale Detection Of Near-Miss Clones With Gpu Acceleration, Guanhua Li, Yijian Wu, Chanchal K. Roy, Jun Sun, Xin Peng, Nanjie Zhan, Bin Hu, Jingyi Ma
Saga: Efficient And Large-Scale Detection Of Near-Miss Clones With Gpu Acceleration, Guanhua Li, Yijian Wu, Chanchal K. Roy, Jun Sun, Xin Peng, Nanjie Zhan, Bin Hu, Jingyi Ma
Research Collection School Of Computing and Information Systems
Clone detection on large code repository is necessary for many big code analysis tasks. The goal is to provide rich information on identical and similar code across projects. Detecting near-miss code clones on big code is challenging since it requires intensive computing and memory resources as the scale of the source code increases. In this work, we propose SAGA, an efficient suffix-array based code clone detection tool designed with sophisticated GPU optimization. SAGA not only detects Type-l and Type-2 clones but also does so for cross-project large repositories and for the most computationally expensive Type-3 clones. Meanwhile, it also works …
Solving Online Threat Screening Games Using Constrained Action Space Reinforcement Learning, Sanket Shah, Arunesh Sinha, Pradeep Varakantham, Andrew Perrault, Millind Tambe
Solving Online Threat Screening Games Using Constrained Action Space Reinforcement Learning, Sanket Shah, Arunesh Sinha, Pradeep Varakantham, Andrew Perrault, Millind Tambe
Research Collection School Of Computing and Information Systems
Large-scale screening for potential threats with limited resources and capacity for screening is a problem of interest at airports, seaports, and other ports of entry. Adversaries can observe screening procedures and arrive at a time when there will be gaps in screening due to limited resource capacities. To capture this game between ports and adversaries, this problem has been previously represented as a Stackelberg game, referred to as a Threat Screening Game (TSG). Given the significant complexity associated with solving TSGs and uncertainty in arrivals of customers, existing work has assumed that screenees arrive and are allocated security resources at …
Multi-Level Head-Wise Match And Aggregation In Transformer For Textual Sequence Matching, Shuohang Wang, Yunshi Lan, Yi Tay, Jing Jiang, Jingjing Liu
Multi-Level Head-Wise Match And Aggregation In Transformer For Textual Sequence Matching, Shuohang Wang, Yunshi Lan, Yi Tay, Jing Jiang, Jingjing Liu
Research Collection School Of Computing and Information Systems
Transformer has been successfully applied to many natural language processing tasks. However, for textual sequence matching, simple matching between the representation of a pair of sequences might bring in unnecessary noise. In this paper, we propose a new approach to sequence pair matching with Transformer, by learning head-wise matching representations on multiple levels. Experiments show that our proposed approach can achieve new state-of-the-art performance on multiple tasks that rely only on pre-computed sequence-vectorrepresentation, such as SNLI, MNLI-match, MNLI-mismatch, QQP, and SQuAD-binary
Distinguishing Similar Design Pattern Instances Through Temporal Behavior Analysis, Renhao Xiong, David Lo, Bixin Li
Distinguishing Similar Design Pattern Instances Through Temporal Behavior Analysis, Renhao Xiong, David Lo, Bixin Li
Research Collection School Of Computing and Information Systems
Design patterns (DPs) encapsulate valuable design knowledge of object-oriented systems. Detecting DP instances helps to reveal the underlying rationale, thus facilitates the maintenance of legacy code. Resulting from the internal similarity of DPs, implementation variants, and missing roles, approaches based on static analysis are unable to well identify structurally similar instances. Existing approaches further employ dynamic techniques to test the runtime behaviors of candidate instances. Automatically verifying the runtime behaviors of DP instances is a challenging task in multiple aspects. This paper presents an approach to improve the verification process of existing approaches. To exercise the runtime behaviors of DP …
Joint Learning Of Answer Selection And Answer Summary Generation In Community Question Answering, Yang Deng, Wai Lam, Yuexiang Xie, Daoyuan Chen, Yaliang Li, Min Yang, Ying Shen
Joint Learning Of Answer Selection And Answer Summary Generation In Community Question Answering, Yang Deng, Wai Lam, Yuexiang Xie, Daoyuan Chen, Yaliang Li, Min Yang, Ying Shen
Research Collection School Of Computing and Information Systems
Community question answering (CQA) gains increasing popularity in both academy and industry recently. However, the redundancy and lengthiness issues of crowdsourced answers limit the performance of answer selection and lead to reading difficulties and misunderstandings for community users. To solve these problems, we tackle the tasks of answer selection and answer summary generation in CQA with a novel joint learning model. Specifically, we design a question-driven pointer-generator network, which exploits the correlation information between question-Answer pairs to aid in attending the essential information when generating answer summaries. Meanwhile, we leverage the answer summaries to alleviate noise in original lengthy answers …
Analysis Of Blockchain Protocol Against Static Adversarial Miners Corrupted By Long Delay Attackers, Quan Yuan, Puwen Wei, Keting Jia, Haiyang Xue
Analysis Of Blockchain Protocol Against Static Adversarial Miners Corrupted By Long Delay Attackers, Quan Yuan, Puwen Wei, Keting Jia, Haiyang Xue
Research Collection School Of Computing and Information Systems
Bitcoin, which was initially introduced by Nakamoto, is the most disruptive and impactive cryptocurrency. The core Bitcoin technology is the so-called blockchain protocol. In recent years, several studies have focused on rigorous analyses of the security of Nakamoto’s blockchain protocol in an asynchronous network where network delay must be considered. Wei, Yuan, and Zheng investigated the effect of a long delay attack against Nakamoto’s blockchain protocol. However, their proof only holds in the honest miner setting. In this study, we improve Wei, Yuan and Zheng’s result using a stronger model where the adversary can perform long delay attacks and corrupt …