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 2431 - 2460 of 7459

Full-Text Articles in Physical Sciences and Mathematics

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

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 …

Go to article

Heartquake: Accurate Low-Cost Non-Invasive Ecg Monitoring Using Bed-Mounted Geophones, Jaeyeon Park, Hyeon Cho, Rajesh Krishna Balan, Jeonggil Ko Mar 2020

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 …

Go to article

Automatic Verification Of Multi-Threaded Programs By Inference Of Rely-Guarantee Specifications, Xuan-Bach Le, David Sanan, Jun Sun, Shang-Wei Lin Mar 2020

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 …

Go to article

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

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 …

Go to article

Towards K-Vertex Connected Component Discovery From Large Networks, Li Yuan, Guoren Wang, Yuhai Zhao, Feida Zhu Mar 2020

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 …

Go to article

Tackling Regional Climate Change Impacts And Food Security Issues: A Critical Analysis Across Asean, Pif, And Saarc, Md. Saidul Islam, Edson Kieu Mar 2020

Tackling Regional Climate Change Impacts And Food Security Issues: A Critical Analysis Across Asean, Pif, And Saarc, Md. Saidul Islam, Edson Kieu

Research Collection Lee Kong Chian School Of Business

Climate change and food security issues are multi-faceted and transcend across national boundaries. Therefore, this paper begins with the premise that regional organizations are optimally positioned to address climate change and food security issues while actively engaging global partners to slow down or reverse current trajectories. However, the potential of regional organizations to play a central role in mitigating these vital concerns has not been realized. In this paper, we focus on three regional organizations—the Association of Southeast Asian Nations (ASEAN), the Pacific Islands Forum (PIF), and the South Asian Association for Regional Cooperation (SAARC) and set out to investigate …

Go to article

The Search For Optimal Oxygen Saturation Targets In Critically Ill: Patients Observational Data From Large Icu Databases, Willem Van Den Boom, Michael Hoy, Jagadish Sankaran, Mengru Liu, Haroun Chahed, Mengling Feng, Kay Choong See Mar 2020

The Search For Optimal Oxygen Saturation Targets In Critically Ill: Patients Observational Data From Large Icu Databases, Willem Van Den Boom, Michael Hoy, Jagadish Sankaran, Mengru Liu, Haroun Chahed, Mengling Feng, Kay Choong See

Research Collection School Of Computing and Information Systems

Background: Although low oxygen saturations are generally regarded as deleterious, recent studies in ICU patients have shown that a liberal oxygen strategy increases mortality. However, the optimal oxygen saturation target remains unclear. The goal of this study was to determine the optimal range by using real-world data. Methods: Replicate retrospective analyses were conducted of two electronic medical record databases: the eICU Collaborative Research Database (eICU-CRD) and the Medical Information Mart for Intensive Care III database (MIMIC). Only patients with at least 48 h of oxygen therapy were included. Nonlinear regression was used to analyze the association between median pulse oximetry-derived …

Go to article

Singapore’S National Ai Strategy, Singapore Management University Feb 2020

Singapore’S National Ai Strategy, Singapore Management University

Perspectives@SMU

The island state is banking on industry-wide projects and building an AI ecosystem to transform its economy

Go to article

Brain Drain: The Impact Of Air Pollution On Firm Performance, Shuyu Xue, Bohui Zhang, Xiaofeng Zhao Feb 2020

Brain Drain: The Impact Of Air Pollution On Firm Performance, Shuyu Xue, Bohui Zhang, Xiaofeng Zhao

Research Collection Lee Kong Chian School Of Business

By exploiting the exogenous variation in air pollution caused by China’s central heating policy, we find that air pollution reduces the accumulation of executive talent and high-quality employees. We also find that firms located in polluted areas have poorer performance, especially for firms with greater dependence on human capital.

Go to article

Gdface: Gated Deformation For Multi-View Face Image Synthesis, Xuemiao Xu, Keke Li, Cheng Xu, Shengfeng He Feb 2020

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 …

Go to article

Generating Realistic Stock Market Order Streams, Junyi Li, Xintong Wang, Yaoyang Lin, Arunesh Sinha, Michael P. Wellman Feb 2020

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.

Go to article

Solving Online Threat Screening Games Using Constrained Action Space Reinforcement Learning, Sanket Shah, Arunesh Sinha, Pradeep Varakantham, Andrew Perrault, Millind Tambe Feb 2020

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 …

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

Image Enhanced Event Detection In News Articles, Meihan Tong, Shuai Wang, Yixin Cao, Bin Xu, Juaizi Li, Lei Hou, Tat-Seng Chua Feb 2020

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 …

Go to article

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

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 …

Go to article

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

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 …

Go to article

Zero-Shot Ingredient Recognition By Multi-Relational Graph Convolutional Network, Jingjing Chen, Liangming Pan, Zhipeng Wei, Xiang Wang, Chong-Wah Ngo, Tat-Seng Chua Feb 2020

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 …

Go to article

Bounding Regret In Empirical Games, Steven Jecmen, Arunesh Sinha, Zun Li, Long Tran-Thanh Feb 2020

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 …

Go to article

Privacy-Preserving Network Path Validation, Binanda Sengupta, Yingjiu Li, Kai Bu, Robert H. Deng Feb 2020

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 …

Go to article

Mcdpc: Multi‐Center Density Peak Clustering, Yizhang Wang, Di Wang, Xiaofeng Zhang, Wei Pang, Chunyan Miao, Ah-Hwee Tan, You Zhou Feb 2020

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

Go to article

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

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 …

Go to article

Ausearch: Accurate Api Usage Search In Github Repositories With Type Resolution, Muhammad Hilmi Asyrofi, Ferdian Thung, David Lo, Lingxiao Jiang Feb 2020

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 …

Go to article

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

First Prev Next Last