Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (8588)
- Computer Sciences (8571)
- Databases and Information Systems (3465)
- Software Engineering (2164)
- Artificial Intelligence and Robotics (1728)
-
- Information Security (1068)
- Numerical Analysis and Scientific Computing (1024)
- Engineering (979)
- Graphics and Human Computer Interfaces (936)
- Social and Behavioral Sciences (734)
- Business (688)
- Computer Engineering (512)
- Theory and Algorithms (493)
- Operations Research, Systems Engineering and Industrial Engineering (439)
- Programming Languages and Compilers (379)
- OS and Networks (323)
- Communication (310)
- Social Media (248)
- Public Affairs, Public Policy and Public Administration (227)
- Transportation (204)
- Medicine and Health Sciences (189)
- Education (180)
- Management Information Systems (178)
- Data Storage Systems (176)
- E-Commerce (151)
- International and Area Studies (125)
- Asian Studies (124)
- Digital Communications and Networking (123)
- Technology and Innovation (114)
- Health Information Technology (113)
- Keyword
-
- Machine learning (125)
- Deep learning (124)
- Social media (80)
- Artificial intelligence (72)
- Reinforcement learning (69)
-
- Data mining (65)
- Privacy (65)
- Cloud computing (58)
- Deep Learning (56)
- Empirical study (55)
- Optimization (55)
- Security (54)
- Singapore (52)
- Visualization (52)
- Task analysis (50)
- Twitter (50)
- Neural networks (49)
- Online learning (49)
- Software engineering (49)
- Training (49)
- Anomaly detection (47)
- Large Language Models (47)
- Feature extraction (46)
- Collaboration (45)
- Blockchain (44)
- Semantics (43)
- Access control (41)
- Algorithms (40)
- Android (39)
- Natural language processing (39)
- Publication Year
- File Type
Articles 3541 - 3570 of 8762
Full-Text Articles in Entire DC Network
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 …
Securing Bring-Your-Own-Device (Byod) Programming Exams, Oka Kurniawan, Norman Lee, Christopher M. Poskitt
Securing Bring-Your-Own-Device (Byod) Programming Exams, Oka Kurniawan, Norman Lee, Christopher M. Poskitt
Research Collection School Of Computing and Information Systems
Traditional pen and paper exams are inadequate for modern university programming courses as they are misaligned with pedagogies and learning objectives that target practical coding ability. Unfortunately, many institutions lack the resources or space to be able to run assessments in dedicated computer labs. This has motivated the development of bring-your-own-device (BYOD) exam formats, allowing students to program in a similar environment to how they learnt, but presenting instructors with significant additional challenges in preventing plagiarism and cheating. In this paper, we describe a BYOD exam solution based on lockdown browsers, software which temporarily turns students' laptops into secure workstations …
Feature Agglomeration Networks For Single Stage Face Detection, Jialiang Zhang, Xiongwei Wu, Steven C. H. Hoi, Jianke Zhu
Feature Agglomeration Networks For Single Stage Face Detection, Jialiang Zhang, Xiongwei Wu, Steven C. H. Hoi, Jianke Zhu
Research Collection School Of Computing and Information Systems
Recent years have witnessed promising results of exploring deep convolutional neural network for face detection. Despite making remarkable progress, face detection in the wild remains challenging especially when detecting faces at vastly different scales and characteristics. In this paper, we propose a novel simple yet effective framework of “Feature Agglomeration Networks” (FANet) to build a new single-stage face detector, which not only achieves state-of-the-art performance but also runs efficiently. As inspired by Feature Pyramid Networks (FPN) (Lin et al., 2017), the key idea of our framework is to exploit inherent multi-scale features of a single convolutional neural network by aggregating …
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 …
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, …
Pokeme: Applying Context-Driven Notifications To Increase Worker Engagement In Mobile Crowd-Sourcing, Thivya Kandappu, Abhinav Mehrotra, Archan Misra, Mirco Musolesi, Shih-Fen Cheng, Lakmal Buddika Meegahapola
Pokeme: Applying Context-Driven Notifications To Increase Worker Engagement In Mobile Crowd-Sourcing, Thivya Kandappu, Abhinav Mehrotra, Archan Misra, Mirco Musolesi, Shih-Fen Cheng, Lakmal Buddika Meegahapola
Research Collection School Of Computing and Information Systems
In mobile crowd-sourcing systems, simply relying on people to opportunistically select and perform tasks typically leads to drawbacks such as low task acceptance/completion rates and undesirable spatial skews. In this paper, we utilize data from "Smart Campus", a campus-based mobile crowd-sourcing platform, to empirically study and discover whether and how various context-aware notification strategies can help overcome such drawbacks. We first study worker interactions, in the absence of any notifications, to discover some spatio-temporal properties of task acceptance and completion. Based on these insights, we then experimentally demonstrate the effectiveness of two novel, non-personal, context-driven notification strategies, comparing the outcomes …
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 …
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 …
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 …
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 …
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 …
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 …
Ifix: Fixing Concurrency Bugs While They Are Introduced, Zan Wang, Haichi Wang, Shuang Liu, Jun Sun, Haoyu Wang, Junjie Chen
Ifix: Fixing Concurrency Bugs While They Are Introduced, Zan Wang, Haichi Wang, Shuang Liu, Jun Sun, Haoyu Wang, Junjie Chen
Research Collection School Of Computing and Information Systems
Concurrency bugs are notoriously hard to identify and fix. A systematic way of avoiding concurrency bugs is to design and implement a locking policy that consistently guards all shared variables. Concurrency bugs thus can be viewed as the result of an illy-designed or poorly implemented locking policy. The trouble is that the locking policy is often not documented, which makes debugging concurrency bugs clueless. We argue that it is too late to debug concurrency bugs after programming is done and we instead detect and fix them while they are being implemented. In this work, we propose an approach named IFIX …
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 …
An Empirical Study On Correlation Between Coverage And Robustness For Deep Neural Networks, Yizhen Dong, Peixin Zhang, Jingyi Wang, Shuang Liu, Jun Sun, Jianye Hao, Xinyu Wang, Li Wang, Jinsong Dong, Ting Dai
An Empirical Study On Correlation Between Coverage And Robustness For Deep Neural Networks, Yizhen Dong, Peixin Zhang, Jingyi Wang, Shuang Liu, Jun Sun, Jianye Hao, Xinyu Wang, Li Wang, Jinsong Dong, Ting Dai
Research Collection School Of Computing and Information Systems
Deep neural networks (DNN) are increasingly applied in safety-critical systems, e.g., for face recognition, autonomous car control and malware detection. It is also shown that DNNs are subject to attacks such as adversarial perturbation and thus must be properly tested. Many coverage criteria for DNN since have been proposed, inspired by the success of code coverage criteria for software programs. The expectation is that if a DNN is well tested (and retrained) according to such coverage criteria, it is more likely to be robust. In this work, we conduct an empirical study to evaluate the relationship between coverage, robustness and …
Towards K-Vertex Connected Component Discovery From Large Networks, Li Yuan, Guoren Wang, Yuhai Zhao, Feida Zhu
Towards K-Vertex Connected Component Discovery From Large Networks, Li Yuan, Guoren Wang, Yuhai Zhao, Feida Zhu
Research Collection School Of Computing and Information Systems
In many real life network-based applications such as social relation analysis, Web analysis, collaborative network, road network and bioinformatics, the discovery of components with high connectivity is an important problem. In particular, k-edge connected component (k-ECC) has recently been extensively studied to discover disjoint components. Yet many real scenarios present more needs and challenges for overlapping components. In this paper, we propose a k-vertex connected component (k-VCC) model, which is much more cohesive, and thus supports overlapping between components very well. To discover k-VCCs, we propose three frameworks including top-down, bottom-up and hybrid …
Learning Fault Models Of Cyber Physical Systems, Teck Ping Khoo, Jun Sun, Sudipta Chattopadhyay
Learning Fault Models Of Cyber Physical Systems, Teck Ping Khoo, Jun Sun, Sudipta Chattopadhyay
Research Collection School Of Computing and Information Systems
Cyber Physical Systems (CPSs) comprise sensors and actuators which interact with the physical environment over a computer network to achieve some control objective. Bugs in CPSs can have severe consequences as CPSs are increasingly deployed in safety-critical applications. Debugging CPSs is therefore an important real world problem. Traces from a CPS can be lengthy and are usually linked to different parts of the system, making debugging CPSs a complex and time-consuming undertaking. It is challenging to isolate a component without running the whole CPS. In this work, we propose a model-based approach to debugging a CPS. For each CPS property, …
Heartquake: Accurate Low-Cost Non-Invasive Ecg Monitoring Using Bed-Mounted Geophones, Jaeyeon Park, Hyeon Cho, Rajesh Krishna Balan, Jeonggil Ko
Heartquake: Accurate Low-Cost Non-Invasive Ecg Monitoring Using Bed-Mounted Geophones, Jaeyeon Park, Hyeon Cho, Rajesh Krishna Balan, Jeonggil Ko
Research Collection School Of Computing and Information Systems
This work presents HeartQuake, a low cost, accurate, non-intrusive, geophone-based sensing system for extracting accurate electrocardiogram (ECG) patterns using heartbeat vibrations that penetrate through a bed mattress. In HeartQuake, cardiac activity-originated vibration patterns are captured on a geophone and sent to a server, where the data is filtered to remove the sensor's internal noise and passed on to a bidirectional long short term memory (Bi-LSTM) deep learning model for ECG waveform estimation. To the best of our knowledge, this is the first solution that can non-intrusively provide accurate ECG waveform characteristics instead of more basic abstract features such as the …
Using Reinforcement Learning To Minimize The Probability Of Delay Occurrence In Transportation, Zhiguang Cao, Hongliang Guo, Wen Song, Kaizhou Gao, Zhengghua Chen, Le Zhang, Xuexi Zhang
Using Reinforcement Learning To Minimize The Probability Of Delay Occurrence In Transportation, Zhiguang Cao, Hongliang Guo, Wen Song, Kaizhou Gao, Zhengghua Chen, Le Zhang, Xuexi Zhang
Research Collection School Of Computing and Information Systems
Reducing traffic delay is of crucial importance for the development of sustainable transportation systems, which is a challenging task in the studies of stochastic shortest path (SSP) problem. Existing methods based on the probability tail model to solve the SSP problem, seek for the path that minimizes the probability of delay occurrence, which is equal to maximizing the probability of reaching the destination before a deadline (i.e., arriving on time). However, they suffer from low accuracy or high computational cost. Therefore, we design a novel and practical Q-learning approach where the converged Q-values have the practical meaning as the actual …
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 …
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
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 …
Stealthy And Efficient Adversarial Attacks Against Deep Reinforcement Learning, Jianwen Sun, Tianwei Zhang, Xiaofei Xie, Lei Ma, Yan Zheng, Kangjie Chen, Yang Liu
Stealthy And Efficient Adversarial Attacks Against Deep Reinforcement Learning, Jianwen Sun, Tianwei Zhang, Xiaofei Xie, Lei Ma, Yan Zheng, Kangjie Chen, Yang Liu
Research Collection School Of Computing and Information Systems
Adversarial attacks against conventional Deep Learning (DL) systems and algorithms have been widely studied, and various defenses were proposed. However, the possibility and feasibility of such attacks against Deep Reinforcement Learning (DRL) are less explored. As DRL has achieved great success in various complex tasks, designing effective adversarial attacks is an indispensable prerequisite towards building robust DRL algorithms. In this paper, we introduce two novel adversarial attack techniques to stealthily and efficiently attack the DRL agents. These two techniques enable an adversary to inject adversarial samples in a minimal set of critical moments while causing the most severe damage to …
Privacy-Preserving Network Path Validation, Binanda Sengupta, Yingjiu Li, Kai Bu, Robert H. Deng
Privacy-Preserving Network Path Validation, Binanda Sengupta, Yingjiu Li, Kai Bu, Robert H. Deng
Research Collection School Of Computing and Information Systems
The end-users communicating over a network path currently have no control over the path. For a better quality of service, the source node often opts for a superior (or premium) network path to send packets to the destination node. However, the current Internet architecture provides no assurance that the packets indeed follow the designated path. Network path validation schemes address this issue and enable each node present on a network path to validate whether each packet has followed the specific path so far. In this work, we introduce two notions of privacy—path privacy and index privacy—in the context of network …
Essential Sentences For Navigating Stack Overflow Answers, Sarah Nadi, Christoph Treude
Essential Sentences For Navigating Stack Overflow Answers, Sarah Nadi, Christoph Treude
Research Collection School Of Computing and Information Systems
Stack Overflow (SO) has become an essential resource for software development. Despite its success and prevalence, navigating SO remains a challenge. Ideally, SO users could benefit from highlighted navigational cues that help them decide if an answer is relevant to their task and context. Such navigational cues could be in the form of essential sentences that help the searcher decide whether they want to read the answer or skip over it. In this paper, we compare four potential approaches for identifying essential sentences. We adopt two existing approaches and develop two new approaches based on the idea that contextual information …
Example-Based Colourization Via Dense Encoding Pyramids, Chufeng Xiao, Chu Han, Zhuming Zhang, Jing Qin, Tien-Tsin Wong, Guoqiang Han, Shengfeng He
Example-Based Colourization Via Dense Encoding Pyramids, Chufeng Xiao, Chu Han, Zhuming Zhang, Jing Qin, Tien-Tsin Wong, Guoqiang Han, Shengfeng He
Research Collection School Of Computing and Information Systems
We propose a novel deep example-based image colourization method called dense encoding pyramid network. In our study, we define the colourization as a multinomial classification problem. Given a greyscale image and a reference image, the proposed network leverages large-scale data and then predicts colours by analysing the colour distribution of the reference image. We design the network as a pyramid structure in order to exploit the inherent multi-scale, pyramidal hierarchy of colour representations. Between two adjacent levels, we propose a hierarchical decoder-encoder filter to pass the colour distributions from the lower level to higher level in order to take both …
Image Enhanced Event Detection In News Articles, Meihan Tong, Shuai Wang, Yixin Cao, Bin Xu, Juaizi Li, Lei Hou, Tat-Seng Chua
Image Enhanced Event Detection In News Articles, Meihan Tong, Shuai Wang, Yixin Cao, Bin Xu, Juaizi Li, Lei Hou, Tat-Seng Chua
Research Collection School Of Computing and Information Systems
Event detection is a crucial and challenging sub-task of event extraction, which suffers from a severe ambiguity issue of trigger words. Existing works mainly focus on using textual context information, while there naturally exist many images accompanied by news articles that are yet to be explored. We believe that images not only reflect the core events of the text, but are also helpful for the disambiguation of trigger words. In this paper, we first contribute an image dataset supplement to ED benchmarks (i.e., ACE2005) for training and evaluation. We then propose a novel Dual Recurrent Multimodal Model, DRMM, to conduct …
Ausearch: Accurate Api Usage Search In Github Repositories With Type Resolution, Muhammad Hilmi Asyrofi, Ferdian Thung, David Lo, Lingxiao Jiang
Ausearch: Accurate Api Usage Search In Github Repositories With Type Resolution, Muhammad Hilmi Asyrofi, Ferdian Thung, David Lo, Lingxiao Jiang
Research Collection School Of Computing and Information Systems
Nowadays, developers use APIs to implement their applications. To know how to use an API, developers may search for code examples that use the API in repositories such as GitHub. Although code search engines have been developed to help developers perform such search, these engines typically only accept a query containing the description of the task that needs to be implemented or the names of the APIs that the developer wants to use without the capability for the developer to specify particular search constraints, such as the class and parameter types that the relevant API should take. These engines are …
Bounding Regret In Empirical Games, Steven Jecmen, Arunesh Sinha, Zun Li, Long Tran-Thanh
Bounding Regret In Empirical Games, Steven Jecmen, Arunesh Sinha, Zun Li, Long Tran-Thanh
Research Collection School Of Computing and Information Systems
Empirical game-theoretic analysis refers to a set of models and techniques for solving large-scale games. However, there is a lack of a quantitative guarantee about the quality of output approximate Nash equilibria (NE). A natural quantitative guarantee for such an approximate NE is the regret in the game (i.e. the best deviation gain). We formulate this deviation gain computation as a multi-armed bandit problem, with a new optimization goal unlike those studied in prior work. We propose an efficient algorithm Super-Arm UCB (SAUCB) for the problem and a number of variants. We present sample complexity results as well as extensive …