Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (3441)
- Software Engineering (2143)
- Artificial Intelligence and Robotics (1664)
- Information Security (1056)
- Numerical Analysis and Scientific Computing (1024)
-
- Graphics and Human Computer Interfaces (921)
- Engineering (857)
- Social and Behavioral Sciences (661)
- Business (625)
- Theory and Algorithms (493)
- Computer Engineering (431)
- Operations Research, Systems Engineering and Industrial Engineering (399)
- Programming Languages and Compilers (379)
- OS and Networks (322)
- Communication (297)
- Social Media (240)
- Public Affairs, Public Policy and Public Administration (207)
- Transportation (185)
- Medicine and Health Sciences (178)
- Education (164)
- Management Information Systems (164)
- Data Storage Systems (160)
- E-Commerce (146)
- Health Information Technology (107)
- International and Area Studies (107)
- Asian Studies (106)
- Technology and Innovation (100)
- Digital Communications and Networking (96)
- Keyword
-
- Deep learning (122)
- Machine learning (121)
- Social media (74)
- Artificial intelligence (70)
- Reinforcement learning (69)
-
- Data mining (64)
- Privacy (61)
- Cloud computing (58)
- Deep Learning (56)
- Empirical study (54)
- Optimization (53)
- Security (53)
- Visualization (51)
- Software engineering (49)
- Training (49)
- Neural networks (48)
- Online learning (48)
- Task analysis (48)
- Anomaly detection (47)
- Singapore (47)
- Twitter (46)
- Feature extraction (45)
- Blockchain (44)
- Collaboration (44)
- Large Language Models (43)
- Semantics (43)
- Access control (41)
- Algorithms (40)
- Android (39)
- Machine Learning (38)
- Publication Year
- File Type
Articles 3421 - 3450 of 8479
Full-Text Articles in Computer Sciences
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 …
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 …
Social Influence Does Matter: User Action Prediction For In-Feed Advertising., Hongyang Wang, Qingfei Meng, Ju Fan, Yuchen Li, Laizhong Cui, Xiaoman Zhao, Chong Peng, Gong Chen Chen, Xiaoyong Du
Social Influence Does Matter: User Action Prediction For In-Feed Advertising., Hongyang Wang, Qingfei Meng, Ju Fan, Yuchen Li, Laizhong Cui, Xiaoman Zhao, Chong Peng, Gong Chen Chen, Xiaoyong Du
Research Collection School Of Computing and Information Systems
Social in-feed advertising delivers ads that seamlessly fit insidea user’s feed, and allows users to engage in social actions(likes or comments) with the ads. Many businesses payhigher attention to “engagement marketing” that maximizessocial actions, as social actions can effectively promote brandawareness. This paper studies social action prediction for infeedadvertising. Most existing works overlook the social influenceas a user’s action may be affected by her friends’actions. This paper introduces an end-to-end approach thatleverages social influence for action prediction, and focuseson addressing the high sparsity challenge for in-feed ads. Wepropose to learn influence structure that models who tendsto be influenced. We extract …
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 …
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 …
Gdface: Gated Deformation For Multi-View Face Image Synthesis, Xuemiao Xu, Keke Li, Cheng Xu, Shengfeng He
Gdface: Gated Deformation For Multi-View Face Image Synthesis, Xuemiao Xu, Keke Li, Cheng Xu, Shengfeng He
Research Collection School Of Computing and Information Systems
Photorealistic multi-view face synthesis from a single image is an important but challenging problem. Existing methods mainly learn a texture mapping model from the source face to the target face. However, they fail to consider the internal deformation caused by the change of poses, leading to the unsatisfactory synthesized results for large pose variations. In this paper, we propose a Gated Deformable Face Synthesis Network to model the deformation of faces that aids the synthesis of the target face image. Specifically, we propose a dual network that consists of two modules. The first module estimates the deformation of two views …
Zero-Shot Ingredient Recognition By Multi-Relational Graph Convolutional Network, Jingjing Chen, Liangming Pan, Zhipeng Wei, Xiang Wang, Chong-Wah Ngo, Tat-Seng Chua
Zero-Shot Ingredient Recognition By Multi-Relational Graph Convolutional Network, Jingjing Chen, Liangming Pan, Zhipeng Wei, Xiang Wang, Chong-Wah Ngo, Tat-Seng Chua
Research Collection School Of Computing and Information Systems
Recognizing ingredients for a given dish image is at the core of automatic dietary assessment, attracting increasing attention from both industry and academia. Nevertheless, the task is challenging due to the difficulty of collecting and labeling sufficient training data. On one hand, there are hundred thousands of food ingredients in the world, ranging from the common to rare. Collecting training samples for all of the ingredient categories is difficult. On the other hand, as the ingredient appearances exhibit huge visual variance during the food preparation, it requires to collect the training samples under different cooking and cutting methods for robust …
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 …
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 …
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 …
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.
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 …
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 …
Stochastically Robust Personalized Ranking For Lsh Recommendation Retrieval, Dung D. Le, Hady W. Lauw
Stochastically Robust Personalized Ranking For Lsh Recommendation Retrieval, Dung D. Le, Hady W. Lauw
Research Collection School Of Computing and Information Systems
Locality Sensitive Hashing (LSH) has become one of the most commonly used approximate nearest neighbor search techniques to avoid the prohibitive cost of scanning through all data points. For recommender systems, LSH achieves efficient recommendation retrieval by encoding user and item vectors into binary hash codes, reducing the cost of exhaustively examining all the item vectors to identify the topk items. However, conventional matrix factorization models may suffer from performance degeneration caused by randomly-drawn LSH hash functions, directly affecting the ultimate quality of the recommendations. In this paper, we propose a framework named SRPR, which factors in the stochasticity of …
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 …
Deepdualmapper: A Gated Fusion Network For Automatic Map Extraction Using Aerial Images And Trajectories, Hao Wu, Hanyuan Zhang, Xinyu Zhang, Weiwei Sun, Baihua Zheng, Yuning Jiang
Deepdualmapper: A Gated Fusion Network For Automatic Map Extraction Using Aerial Images And Trajectories, Hao Wu, Hanyuan Zhang, Xinyu Zhang, Weiwei Sun, Baihua Zheng, Yuning Jiang
Research Collection School Of Computing and Information Systems
Automatic map extraction is of great importance to urban computing and location-based services. Aerial image and GPS trajectory data refer to two different data sources that could be leveraged to generate the map, although they carry different types of information. Most previous works on data fusion between aerial images and data from auxiliary sensors do not fully utilize the information of both modalities and hence suffer from the issue of information loss. We propose a deep convolutional neural network called DeepDualMapper which fuses the aerial image and trajectory data in a more seamless manner to extract the digital map. We …
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). …
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 …
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 …
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 …
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 …
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 …
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 …
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 …
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 …
Learning-Guided Network Fuzzing For Testing Cyber-Physical System Defences, Yuqi Chen, Christopher M. Poskitt, Jun Sun, Sridhar Adepu, Fan Zhang
Learning-Guided Network Fuzzing For Testing Cyber-Physical System Defences, Yuqi Chen, Christopher M. Poskitt, Jun Sun, Sridhar Adepu, Fan Zhang
Research Collection School Of Computing and Information Systems
The threat of attack faced by cyber-physical systems (CPSs), especially when they play a critical role in automating public infrastructure, has motivated research into a wide variety of attack defence mechanisms. Assessing their effectiveness is challenging, however, as realistic sets of attacks to test them against are not always available. In this paper, we propose smart fuzzing, an automated, machine learning guided technique for systematically finding 'test suites' of CPS network attacks, without requiring any knowledge of the system's control programs or physical processes. Our approach uses predictive machine learning models and metaheuristic search algorithms to guide the fuzzing of …
Key Regeneration-Free Ciphertext-Policy Attribute-Based Encryption And Its Application, Hui Cui, Robert H. Deng, Baodong Qin, Jian Weng
Key Regeneration-Free Ciphertext-Policy Attribute-Based Encryption And Its Application, Hui Cui, Robert H. Deng, Baodong Qin, Jian Weng
Research Collection School Of Computing and Information Systems
Attribute-based encryption (ABE) provides a promising solution for enabling scalable access control over encrypted data stored in the untrusted servers (e.g., cloud) due to its ability to perform data encryption and decryption defined over descriptive attributes. In order to bind different components which correspond to different attributes in a user's attribute-based decryption key together, key randomization technique has been applied in most existing ABE schemes. This randomization method, however, also empowers a user the capability of regenerating a newly randomized decryption key over a subset of the attributes associated with the original decryption key. Because key randomization breaks the linkage …
Game Theoretical Study On Client-Controlled Cloud Data Deduplication, Xueqin Liang, Zheng Yan, Robert H. Deng
Game Theoretical Study On Client-Controlled Cloud Data Deduplication, Xueqin Liang, Zheng Yan, Robert H. Deng
Research Collection School Of Computing and Information Systems
Data deduplication eliminates redundant data and is receiving increasing attention in cloud storage services due to the proliferation of big data and the demand for efficient storage. Data deduplication not only requires a consummate technological designing, but also involves multiple parties with conflict interests. Thus, how to design incentive mechanisms and study their acceptance by all relevant stakeholders remain important open issues. In this paper, we detail the payoff structure of a client-controlled deduplication scheme and analyze the feasibilities of unified discount and individualized discount under this structure. Through game theoretical study, a privacy-preserving individualized discount-based incentive mechanism is further …
Migrating From Monoliths To Cloud-Based Microservices: A Banking Industry Example, Alan Megargel, Venky Shankararaman, David K. Walker
Migrating From Monoliths To Cloud-Based Microservices: A Banking Industry Example, Alan Megargel, Venky Shankararaman, David K. Walker
Research Collection School Of Computing and Information Systems
As more organizations are placing cloud computing at the heart of their digital transformation strategy, it is important that they adopt appropriate architectures and development methodologies to leverage the full benefits of the cloud. A mere “lift and move” approach, where traditional monolith applications are moved to the cloud will not support the demands of digital services. While, monolithic applications may be easier to develop and control, they are inflexible to change and lack the scalability needed for cloud environments. Microservices architecture, which adopts some of the concepts and principles from service-oriented architecture, provides a number of benefits when developing …