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

Physical Sciences and Mathematics Commons™

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

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 2461 - 2490 of 7469

Full-Text Articles in Physical Sciences and Mathematics

Interpretable Rumor Detection In Microblogs By Attending To User Interactions, Ling Min Serena Khoo, Hai Leong Chieu, Zhong Qian, Jing Jiang Feb 2020

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) …

Go to article

Topic Modeling On Document Networks With Adjacent-Encoder, Ce Zhang, Hady W. Lauw Feb 2020

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 …

Go to article

Deepbindiff: Learning Program-Wide Code Representations For Binary Diffing, Yue Duan, Xuezixiang Li, Jinghan Wang, Wang, Heng Yin Feb 2020

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 …

Go to article

Stealthy And Efficient Adversarial Attacks Against Deep Reinforcement Learning, Jianwen Sun, Tianwei Zhang, Xiaofei Xie, Lei Ma, Yan Zheng, Kangjie Chen, Yang Liu Feb 2020

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 …

Go to article

Analysis Of Blockchain Protocol Against Static Adversarial Miners Corrupted By Long Delay Attackers, Quan Yuan, Puwen Wei, Keting Jia, Haiyang Xue Feb 2020

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 …

Go to article

Distinguishing Similar Design Pattern Instances Through Temporal Behavior Analysis, Renhao Xiong, David Lo, Bixin Li Feb 2020

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 …

Go to article

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 Feb 2020

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 …

Go to article

Stochastically Robust Personalized Ranking For Lsh Recommendation Retrieval, Dung D. Le, Hady W. Lauw Feb 2020

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 …

Go to article

Example-Based Colourization Via Dense Encoding Pyramids, Chufeng Xiao, Chu Han, Zhuming Zhang, Jing Qin, Tien-Tsin Wong, Guoqiang Han, Shengfeng He Feb 2020

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 …

Go to article

Are The Code Snippets What We Are Searching For? A Benchmark And An Empirical Study On Code Search With Natural-Language Queries, Shuhan Yan, Hang Yu, Yuting Chen, Beijun Shen Feb 2020

Are The Code Snippets What We Are Searching For? A Benchmark And An Empirical Study On Code Search With Natural-Language Queries, Shuhan Yan, Hang Yu, Yuting Chen, Beijun Shen

Research Collection School Of Computing and Information Systems

Code search methods, especially those that allow programmers to raise queries in a natural language, plays an important role in software development. It helps to improve programmers' productivity by returning sample code snippets from the Internet and/or source-code repositories for their natural-language queries. Meanwhile, there are many code search methods in the literature that support natural-language queries. Difficulties exist in recognizing the strengths and weaknesses of each method and choosing the right one for different usage scenarios, because (1) the implementations of those methods and the datasets for evaluating them are usually not publicly available, and (2) some methods leverage …

Go to article

Neural Approximate Dynamic Programming For On-Demand Ride-Pooling, Sanket Shah, Meghna Lowalekar, Pradeep Varakantham Feb 2020

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 …

Go to article

Essential Sentences For Navigating Stack Overflow Answers, Sarah Nadi, Christoph Treude Feb 2020

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 …

Go to article

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 Feb 2020

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 …

Go to article

Does Reputational Sanctions Deter Negligence In Information Security Management? A Field Quasi-Experiment, Qian Tang, Andrew B. Whinston Feb 2020

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 …

Go to article

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 Feb 2020

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 …

Go to article

Multi-Level Fine-Scaled Sentiment Sensing With Ambivalence Handling, Zhaoxia Wang, Seng-Beng Ho, Erik Cambria Feb 2020

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 …

Go to article

Multi-Level Head-Wise Match And Aggregation In Transformer For Textual Sequence Matching, Shuohang Wang, Yunshi Lan, Yi Tay, Jing Jiang, Jingjing Liu Feb 2020

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

Go to article

Learning-Guided Network Fuzzing For Testing Cyber-Physical System Defences, Yuqi Chen, Christopher M. Poskitt, Jun Sun, Sridhar Adepu, Fan Zhang Jan 2020

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 …

Go to article

Key Regeneration-Free Ciphertext-Policy Attribute-Based Encryption And Its Application, Hui Cui, Robert H. Deng, Baodong Qin, Jian Weng Jan 2020

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 …

Go to article

Game Theoretical Study On Client-Controlled Cloud Data Deduplication, Xueqin Liang, Zheng Yan, Robert H. Deng Jan 2020

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 …

Go to article

Migrating From Monoliths To Cloud-Based Microservices: A Banking Industry Example, Alan Megargel, Venky Shankararaman, David K. Walker Jan 2020

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 …

Go to article

The Future Of Work Now: Medical Coding With Ai, Thomas H. Davenport, Steven M. Miller Jan 2020

The Future Of Work Now: Medical Coding With Ai, Thomas H. Davenport, Steven M. Miller

Research Collection School Of Computing and Information Systems

The coding of medical diagnosis and treatment has always been a challenging issue. Translating a patient’s complex symptoms, and a clinician’s efforts to address them, into a clear and unambiguous classification code was difficult even in simpler times. Now, however, hospitals and health insurance companies want very detailed information on what was wrong with a patient and the steps taken to treat them— for clinical record-keeping, for hospital operations review and planning, and perhaps most importantly, for financial reimbursement purposes.

Go to article

Deterministic Identity-Based Encryption From Lattice-Based Programmable Hash Functions With High Min-Entropy, Daode Zhang, Jie Li, Bao Li, Xianhui Lu, Haiyang Xue, Dingding Jia, Yamin Liu Jan 2020

Deterministic Identity-Based Encryption From Lattice-Based Programmable Hash Functions With High Min-Entropy, Daode Zhang, Jie Li, Bao Li, Xianhui Lu, Haiyang Xue, Dingding Jia, Yamin Liu

Research Collection School Of Computing and Information Systems

There only exists one deterministic identity-based encryption (DIBE) scheme which is adaptively secure in the auxiliary-input setting, under the learning with errors (LWE) assumption. However, the master public key consists of basic matrices. In this paper, we consider to construct adaptively secure DIBE schemes with more compact public parameters from the LWE problem. (i) On the one hand, we gave a generic DIBE construction from lattice-based programmable hash functions with high min-entropy. (ii) On the other hand, when instantiating our generic DIBE construction with four LPHFs with high min-entropy, we can get four adaptively secure DIBE schemes with more compact …

Go to article

Memory And Resource Leak Defects And Their Repairs In Java Projects, Mohammadreza Ghanavati, Diego Costa, Janos Seboek, David Lo, Artur Andrzejak Jan 2020

Memory And Resource Leak Defects And Their Repairs In Java Projects, Mohammadreza Ghanavati, Diego Costa, Janos Seboek, David Lo, Artur Andrzejak

Research Collection School Of Computing and Information Systems

Despite huge software engineering efforts and programming language support, resource and memory leaks are still a troublesome issue, even in memory-managed languages such as Java. Understanding the properties of leak-inducing defects, how the leaks manifest, and how they are repaired is an essential prerequisite for designing better approaches for avoidance, diagnosis, and repair of leak-related bugs. We conduct a detailed empirical study on 452 issues from 10 large opensource Java projects. The study proposes taxonomies for the leak types, for the defects causing them, and for the repair actions. We investigate, under several aspects, the distributions within each taxonomy and …

Go to article

Vietnamese Punctuation Prediction Using Deep Neural Networks, Thuy Pham, Nhu Nguyen, Hong Quang Pham, Han Cao, Binh Nguyen Jan 2020

Vietnamese Punctuation Prediction Using Deep Neural Networks, Thuy Pham, Nhu Nguyen, Hong Quang Pham, Han Cao, Binh Nguyen

Research Collection School Of Computing and Information Systems

Adding appropriate punctuation marks into text is an essential step in speech-to-text where such information is usually not available. While this has been extensively studied for English, there is no large-scale dataset and comprehensive study in the punctuation prediction problem for the Vietnamese language. In this paper, we collect two massive datasets and conduct a benchmark with both traditional methods and deep neural networks. We aim to publish both our data and all implementation codes to facilitate further research, not only in Vietnamese punctuation prediction but also in other related fields. Our project, including datasets and implementation details, is publicly …

Go to article

Remote Communication In Wilderness Search And Rescue: Implications For The Design Of Emergency Distributed-Collaboration Tools For Network-Sparse Environments, Brennan Jones, Anthony Tang, Carman Neustaedter Jan 2020

Remote Communication In Wilderness Search And Rescue: Implications For The Design Of Emergency Distributed-Collaboration Tools For Network-Sparse Environments, Brennan Jones, Anthony Tang, Carman Neustaedter

Research Collection School Of Computing and Information Systems

Wilderness search and rescue (WSAR) requires careful communication between workers in different locations. To understand the contexts from which WSAR workers communicate and the challenges they face, we interviewed WSAR workers and observed a mock-WSAR scenario. Our findings illustrate that WSAR workers face challenges in maintaining a shared mental model. This is primarily done through distributed communication using two-way radios and cell phones for text and photo messaging; yet both implicit and explicit communication suffer. WSAR workers send messages for various reasons and share different types of information with varying levels of urgency. This warrants the use of multiple communication …

Go to article

Systematic Classification Of Attackers Via Bounded Model Checking, Eric Rothstein-Morris, Jun Sun, Sudipta Chattopadyay Jan 2020

Systematic Classification Of Attackers Via Bounded Model Checking, Eric Rothstein-Morris, Jun Sun, Sudipta Chattopadyay

Research Collection School Of Computing and Information Systems

In this work, we study the problem of verification of systems in the presence of attackers using bounded model checking. Given a system and a set of security requirements, we present a methodology to generate and classify attackers, mapping them to the set of requirements that they can break. A naive approach suffers from the same shortcomings of any large model checking problem, i.e., memory shortage and exponential time. To cope with these shortcomings, we describe two sound heuristics based on cone-of-influence reduction and on learning, which we demonstrate empirically by applying our methodology to a set of hardware benchmark …

Go to article

Practical Server-Side Indoor Localization: Tackling Cardinality Outlier Challenges, Anuradha Ravi, Archan Misra Jan 2020

Practical Server-Side Indoor Localization: Tackling Cardinality Outlier Challenges, Anuradha Ravi, Archan Misra

Research Collection School Of Computing and Information Systems

In spite of many advances in indoor localization techniques, practical implementation of robust device independent, server-side Wi-Fi localization (i.e., without any active participation of client devices) remains a challenge. This work utilizes an operationally-deployed Wi-Fi based indoor location infrastructure, based on the classical RADAR algorithm, to tackle two such practical challenges: (a) low cardinality, whereby only the associated AP generates sufficient RSSI reports and (b) outlier identification, which requires explicit identification of mobile clients that are attached to the Wi-Fi network but outside the fingerprinted region. To tackle the low-cardinality problem, we present a technique that uses cardinality changes to …

Go to article

Pgas: Privacy-Preserving Graph Encryption For Accurate Constrained Shortest Distance Queries, Can Zhang, Liehuang Zhu, Kashif Sharif, Chuan Zhang, Ximeng Liu Jan 2020

Pgas: Privacy-Preserving Graph Encryption For Accurate Constrained Shortest Distance Queries, Can Zhang, Liehuang Zhu, Kashif Sharif, Chuan Zhang, Ximeng Liu

Research Collection School Of Computing and Information Systems

The constrained shortest distance (CSD) query is used to determine the shortest distance between two vertices of a graph while ensuring that the total cost remains lower than a given threshold. The virtually unlimited storage and processing capabilities of cloud computing have enabled the graph owners to outsource their graph data to cloud servers. However, it may introduce privacy challenges that are difficult to address. In recent years, some relevant schemes that support the shortest distance query on the encrypted graph have been proposed. Unfortunately, some of them have unacceptable query accuracy, and some of them leak sensitive information that …

Go to article

Structure-Priority Image Restoration Through Genetic Algorithm Optimization, Zhaoxia Wang, Haibo Pen, Ting Yang, Quan Wang Jan 2020

Structure-Priority Image Restoration Through Genetic Algorithm Optimization, Zhaoxia Wang, Haibo Pen, Ting Yang, Quan Wang

Research Collection School Of Computing and Information Systems

With the significant increase in the use of image information, image restoration has been gaining much attention by researchers. Restoring the structural information as well as the textural information of a damaged image to produce visually plausible restorations is a challenging task. Genetic algorithm (GA) and its variants have been applied in many fields due to their global optimization capabilities. However, the applications of GA to the image restoration domain still remain an emerging discipline. It is still challenging and difficult to restore a damaged image by leveraging GA optimization. To address this problem, this paper proposes a novel GA-based …

Go to article

First Prev Next Last