Digital Commons Network^™

Innovation Rules: A Method For Identifying Disruptive Innovation Opportunities?, Arcot Desai Narasimhalu

Research Collection School Of Computing and Information Systems

Innovation Rules or innovation evolution paths are described in this paper as a mechanism for identifying disruptive innovation opportunities. A generic structure of an Innovation Rule is first introduced followed by a discussion using specific instance of an Innovation Rule. The application of Innovation Rules for the discovery of disruptive innovation opportunities is presented next. Two methods that use Innovation Rules as the basis for identifying disruptive innovation opportunities are described next, one for market pull and the other one for technology push. A framework for dealing with Innovation Rules that represent both big and small disruptions is discussed next. …

Mining Input Sanitization Patterns For Predicting Sql Injection And Cross Site Scripting Vulnerabilities, Lwin Khin Shar, Hee Beng Kuan Tan

Research Collection School Of Computing and Information Systems

Static code attributes such as lines of code and cyclomatic complexity have been shown to be useful indicators of defects in software modules. As web applications adopt input sanitization routines to prevent web security risks, static code attributes that represent the characteristics of these routines may be useful for predicting web application vulnerabilities. In this paper, we classify various input sanitization methods into different types and propose a set of static code attributes that represent these types. Then we use data mining methods to predict SQL injection and cross site scripting vulnerabilities in web applications. Preliminary experiments show that our …

Analyzing Multi-Agent Systems With Probabilistic Model Checking Approach, Songzheng Song, Jianye Hao, Yang Liu, Jun Sun, Ho-Fung Leung, Jin Song Dong

Research Collection School Of Computing and Information Systems

Multi-agent systems, which are composed of autonomous agents, have been successfully employed as a modeling paradigm in many scenarios. However, it is challenging to guarantee the correctness of their behaviors due to the complex nature of the autonomous agents, especially when they have stochastic characteristics. In this work, we propose to apply probabilistic model checking to analyze multi-agent systems. A modeling language called PMA is defined to specify such kind of systems, and LTL property and logic of knowledge combined with probabilistic requirements are supported to analyze system behaviors. Initial evaluation indicates the effectiveness of our current progress; meanwhile some …

Lagrangian Relaxation For Large-Scale Multi-Agent Planning, Geoff Gordon, Pradeep Reddy Varakantham, William Yeoh, Ajay Srinivasan, Hoong Chuin Lau, Shih-Fen Cheng

Research Collection School Of Computing and Information Systems

Multi-agent planning is a well-studied problem with applications in various areas. Due to computational constraints, existing research typically focuses either on unstructured domains with many agents, where we are content with heuristic solutions, or domains with small numbers of agents or special structure, where we can find provably near-optimal solutions. In contrast, here we focus on provably near-optimal solutions in domains with many agents, by exploiting influence limits. To that end, we make two key contributions: (a) an algorithm, based on Lagrangian relaxation and randomized rounding, for solving multi-agent planning problems represented as large mixed-integer programs; (b) a proof of …

Modelling Housing Prices And Credit Activity, Knowledge@Smu

Knowledge@SMU

Together, the housing and banking sectors of any capitalist nation can play an important hand in determining its overall economic health. This is clear from studies of booms and busts in the United States over this past decade and in Japan about three decades ago. A new econometric model now attempts to make sense of large changes in housing prices with corresponding changes in credit volume. The model was presented at a research seminar organised by SMU's School of Economics.

Lagrangian Relaxation For Large-Scale Multi-Agent Planning, Geoffrey J. Gordon, Pradeep Varakantham, William Yeoh, Hoong Chuin Lau, Ajay Srinivasan Aravamudhan, Shih-Fen Cheng

LARC Research Publications

Multi-agent planning is a well-studied problem with applications in various areas. Due to computational constraints, existing research typically focuses either on unstructured domains with many agents, where we are content with heuristic solutions, or domains with small numbers of agents or special structure, where we can find provably near-optimal solutions. In contrast, here we focus on provably near-optimal solutions in domains with many agents, by exploiting influence limit. To that end, we make two key contributions: (a) an algorithm, based on Lagrangian relaxation and randomized rounding, for solving multi-agent planning problems represented as large mixed-integer programs; (b) a proof of …

Starcraft Ii In-Game Action Lists, Gong Wei, Ee Peng Lim, Achananuparp Palakorn, Feida Zhu, David Lo, Freddy Chua

SMU Research Data

1732 event logs of actions performed by players in Starcraft II public replays downloaded from GameReplays.org.

The Data Set consists of 1732 log files (Size: 55 MB) compressed into a Zip archive (Size: 9.3 MB).

This dataset has accumulated 267 downloads from 19 July 2012 to 2 Nov 2017 before being transferred to another collection.

Old URL: http://ink.library.smu.edu.sg/data/1/

Testing For Jumps In Noisy High Frequency Data, Yacine Ait-Sahalia, Jean Jacod, Jia Li

Research Collection School Of Economics

This paper proposes a robustification of the test statistic of Aït-Sahalia and Jacod (2009b) for the presence of market microstructure noise in high frequency data, based on the pre-averaging method of Jacod et al. (2010). We show that the robustified statistic restores the test's discriminating power between jumps and no jumps despite the presence of market microstructure noise in the data.

Enacting Clan Control In Complex It Projects: A Social Capital Perspective, Cecil Eng Huang Chua, Wee-Kiat Lim, Christina Soh, Siew Kien Sia

CCX Research

The information technology project control literature has documented that clan control is often essential in complex multistakeholder projects for project success. However, instituting clan control in such conditions is challenging as people come to a project with diverse skills and backgrounds. There is often insufficient time for clan control to develop naturally. This paper investigates the question , "How can clan control be enacted in complex IT projects? " Recognizing social capital as a resource , we conceptualize a clan as a group with strong social capital (i.e., where its members have developed their structural, cognitive, and relational ties to …

Workitemexplorer: Visualizing Software Development Tasks Using An Interactive Exploration Environment, Christoph Treude, Patrick Gorman, Lars Grammel, Margaret-Anne Storey

Research Collection School Of Computing and Information Systems

This demo introduces WorkItemExplorer, an interactive environment to visually explore data from software development tasks. WorkItemExplorer enables developers and managers to investigate activity and correlations in their task management system by making data exploration flexible and interactive, and by utilizing multiple coordinated views. Our preliminary evaluation shows that WorkItemExplorer is able to answer questions that developers ask, while also enabling them to gain new insights through the free exploration of data.

Complexity Of The Soundness Problem Of Bounded Workflow Nets, Guan Jun Liu, Jun Sun, Yang Liu, Jin Song Dong

Research Collection School Of Computing and Information Systems

Classical workflow nets (WF-nets) are an important class of Petri nets that are widely used to model and analyze workflow systems. Soundness is a crucial property that guarantees these systems are deadlock-free and bounded. Aalst et al. proved that the soundness problem is decidable, and proposed (but not proved) that the soundness problem is EXPSPACE-hard. In this paper, we show that the satisfiability problem of Boolean expression is polynomial time reducible to the liveness problem of bounded WF-nets, and soundness and liveness are equivalent for bounded WF-nets. As a result, the soundness problem of bounded WF-nets is co-NP-hard.Workflow nets with …

More Of A Receiver Than A Giver: Why Do People Unfollow In Twitter?, Haewoon Kwak, Sue Moon, Wonjae Lee

Research Collection School Of Computing and Information Systems

We propose a logistic regression model taking into ac- count two analytically different sets of factors–structure and action. The factors include individual, dyadic, and triadic properties between ego and alter whose tie breakup is under consideration. From the fitted model using a large-scale data, we discover 5 structural and 7 actional variables to have significant explanatory power for unfollow. One unique finding from our quantitative analysis is that people appreciate receiving acknowl- edgements from others even in virtually unilateral com- munication relationships and are less likely to unfollow them: people are more of a receiver than a giver.

Active Refinement Of Clone Anomaly Reports, Lucia, David Lo, Lingxiao Jiang, Aditya Budi

Research Collection School Of Computing and Information Systems

Software clones have been widely studied in the recent literature and shown useful for finding bugs because inconsistent changes among clones in a clone group may indicate potential bugs. However, many inconsistent clone groups are not real bugs (true positives). The excessive number of false positives could easily impede broad adoption of clone-based bug detection approaches. In this work, we aim to improve the usability of clone-based bug detection tools by increasing the rate of true positives found when a developer analyzes anomaly reports. Our idea is to control the number of anomaly reports a user can see at a …

A New Framework For Privacy Of Rfid Path Authentication, Shaoying Cai, Robert H. Deng, Yingjiu Li, Yunlei Zhao

Research Collection School Of Computing and Information Systems

RFID-based path authentication enables supply chain managers to verify the exact path that a tag has taken. In this paper, we introduce a new oracle Move that models a tag's movement along a designed or an arbitrary path in a supply chain. With this oracle, we refine the existing security and privacy notions for RFID-based path authentication. In addition, we propose a new privacy notion, called path privacy, for RFID-based path authentication. Our privacy notion captures the privacy of both tag identity and path information in a single game. Compared to existing two-game based privacy notions, it is more rigorous, …

When A Friend In Twitter Is A Friend In Life, Wei Xie, Cheng Li, Feida Zhu, Ee-Peng Lim, Xueqing Gong

Research Collection School Of Computing and Information Systems

Twitter is a fast-growing online social network service (SNS) where users can "follow" any other user to receive his or her mini-blogs which are called "tweets". In this paper, we study the problem of identifying a user's off-line real-life social community, which we call the user'sTwitter off-line community, purely from examining Twitter network structure. Based on observations from our user-verified Twitter data and results from previous works, we propose three principles about Twitter off-line communities. Incorporating these principles, we develop a novel algorithm to iteratively discover the Twitter off-line community based on a new way of measuring user closeness. According …

Mobicon: Mobile Context Monitoring Platform: Incorporating Context-Awareness To Smartphone-Centric Personal Sensor Networks, Youngki Lee, Younghyun Ju, Chuihong Min, Jihun Yu, Junehwa Song

Research Collection School Of Computing and Information Systems

In this demonstration, we will show MobiCon, a context monitoring platform; it runs over smartphones and sensor OSs, and facilitates development and deployment of everyday context-aware applications. For many years, lots of research efforts have been made in building low-cost, yet effective sensor networks for various application domains such as structural health monitoring of bridges, disaster recovery, automated ventilation of buildings. Integration of sensors into smartphones and the advent of wearable devices open a new opportunity for mobile applications to leverage in-situ user contexts such as his/her location, activity, social relationship, health status. In recent studies of mobile and pervasive …

Stochastic Dominance In Stochastic Dcops For Risk-Sensitive Applications, Nguyen Duc Thien, William Yeoh, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Distributed constraint optimization problems (DCOPs) are well-suited for modeling multi-agent coordination problems where the primary interactions are between local subsets of agents. However, one limitation of DCOPs is the assumption that the constraint rewards are without uncertainty. Researchers have thus extended DCOPs to Stochastic DCOPs (SDCOPs), where rewards are sampled from known probability distribution reward functions, and introduced algorithms to find solutions with the largest expected reward. Unfortunately, such a solution might be very risky, that is, very likely to result in a poor reward. Thus, in this paper, we make three contributions: (1) we propose a stricter objective for …

Ifalcon: A Neural Architecture For Hierarchical Planning, Budhitama Subagdja, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Hierarchical planning is an approach of planning by composing and executing hierarchically arranged predefined plans on the fly to solve some problems. This approach commonly relies on a domain expert providing all semantic and structural knowledge. One challenge is how the system deals with incomplete ill-defined knowledge while the solution can be achieved on the fly. Most symbolic-based hierarchical planners have been devised to allow the knowledge to be described expressively. However, in some cases, it is still difficult to produce the appropriate knowledge due to the complexity of the problem domain especially if the missing knowledge must be acquired …

Exerlink: Enabling Pervasive Social Exergames With Heterogeneous Exercise Devices, Taiwoo Park, Inseok Hwang, Uichin Lee, Sunghoon Ivan Lee, Chungkuk Yoo, Youngki Lee, Hyukjae Jang, Sungwon Peter Choe, Souneil Park, Junehwa Song

Research Collection School Of Computing and Information Systems

We envision that diverse social exercising games, or exergames, will emerge, featuring much richer interactivity with immersive game play experiences. Further, the recent advances of mobile devices and wireless networking will make such social engagement more pervasive - people carry portable exergame devices (e.g., jump ropes) and interact with remote users anytime, anywhere. Towards this goal, we explore the potential of using heterogeneous exercise devices as game controllers for a multi-player social exergame; e.g., playing a boat paddling game with two remote exercisers (one with a jump rope, and the other with a treadmill). In this paper, we propose a …

Self-Organizing Neural Networks For Learning Air Combat Maneuvers, Teck-Hou Teng, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

This paper reports on an agent-oriented approach for the modeling of adaptive doctrine-equipped computer generated force (CGF) using a commercial-grade simulation platform known as CAE STRIVECGF. A self- organizing neural network is used for the adaptive CGF to learn and generalize knowledge in an online manner during the simulation. The challenge of defining the state space and action space and the lack of domain knowledge to initialize the adaptive CGF are addressed using the doctrine used to drive the non-adaptive CGF. The doctrine contains a set of specialized knowledge for conducting 1-v-1 dogfights. The hierarchical structure and symbol representation of …

Visualizing Media Bias Through Twitter, Jisun An, Meeyoung Cha, Gummadi, Krishna, Jon Crowcroft, Daniele Queria

Research Collection School Of Computing and Information Systems

Traditional media outlets are known to report political news in a biased way, potentially affecting the political beliefs of the audience and even altering their voting behaviors. Therefore, tracking bias in everyday news and building a platform where people can receive balanced news information is important. We propose a model that maps the news media sources along a dimensional dichotomous political spectrum using the co-subscriptions relationships inferred by Twitter links. By analyzing 7 million follow links, we show that the political dichotomy naturally arises on Twitter when we only consider direct media subscription. Furthermore, we demonstrate a real-time Twitter-based application …

Fast Semantic Diffusion For Large-Scale Context-Based Image And Video Annotation, Yu-Gang Jiang, Qi Dai, Jun Wang, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Exploring context information for visual recognition has recently received significant research attention. This paper proposes a novel and highly efficient approach, which is named semantic diffusion, to utilize semantic context for large-scale image and video annotation. Starting from the initial annotation of a large number of semantic concepts (categories), obtained by either machine learning or manual tagging, the proposed approach refines the results using a graph diffusion technique, which recovers the consistency and smoothness of the annotations over a semantic graph. Different from the existing graph-based learning methods that model relations among data samples, the semantic graph captures context by …

China’S Futures And The World’S Future: An Introduction, William A. Callahan

Research Collection School of Social Sciences

China’s growing economic, political, and cultural power is an important global issue; Chinese people are increasingly interested in thinking about their country’s future as a world power. This article introduces the special issue ‘China’s futures – and the world’s future’ by discussing how futurology works in China. It argues that Chinese futures studies exhibit two general trends: (1) a shift from locating the future outside China to see China itself as the future, and (2) a shift from officials centrally planning the future to many different people dreaming about many different futures. The battle for the future thus is not …

Distributed Path Authentication For Dynamic Rfid-Enabled Supply Chains, Shaoying Cai, Yingjiu Li, Yunlei Zhao

Research Collection School Of Computing and Information Systems

In this paper, we propose a distributed path authentication solution for dynamic RFID-enabled supply chains to address the counterfeiting problem. Compared to existing general anti-counterfeiting solutions, our solution requires non sharing of item-level RFID information among supply chain parties, thus eliminating the requirement on high network bandwidth and fine-grained access control. Our solution is secure, privacy-preserving, and practical. It leverages on the standard EPCglobal network to share information about paths and parties in path authentication. Our solution can be implemented on standard EPC class 1 generation 2 tags with only 720 bits storage and no computational capability.

Shanghai’S Alternative Futures: The World Expo, Citizen Intellectuals, And China’S New Civil Society, William A. Callahan

Research Collection School of Social Sciences

Civil society seems to be a dead issue in China because its formal aspects of mobilization and institutionalization are so tightly regulated by the party-state. This article looks to activities in and around the Shanghai World Expo (2010) to rethink the meaning of civil society and political action in China. Through an analysis of the Expo’s national, theme, and corporate pavilions, it shows how Beijing is planning a harmonious future for China and the world. Yet alongside this unified future, it examines how Shanghai’s citizen intellectuals – filmmaker Jia Zhangke, artist Cai Guoqiang, and blogger Han Han – are creating …

Nonlinear Cointegrating Regression Under Weak Identification, Xiaoxia Shi, Peter C. B. Phillips

Research Collection School Of Economics

An asymptotic theory is developed for a weakly identified cointegrating regression model in which the regressor is a nonlinear transformation of an integrated process. Weak identification arises from the presence of a loading coefficient for the nonlinear function that may be close to zero. In that case, standard nonlinear cointegrating limit theory does not provide good approximations to the finite-sample distributions of nonlinear least squares estimators, resulting in potentially misleading inference. A new local limit theory is developed that approximates the finite-sample distributions of the estimators uniformly well irrespective of the strength of the identification. An important technical component of …

Mining Quantified Temporal Rules: Formalism, Algorithms, And Evaluation, David Lo, Ganesan Ramalingam, Venkatesh Prasad Ranganath, Kapil Vaswani

Research Collection School Of Computing and Information Systems

Libraries usually impose constraints on how clients should use them. Often these constraints are not well-documented. In this paper, we address the problem of recovering such constraints automatically, a problem referred to as specification mining. Given some client programs that use a given library, we identify constraints on the library usage that are (almost) satisfied by the given set of clients.The class of rules we target for mining combines simple binary temporal operators with state predicates (composed of equality constraints) and quantification. This is a simple yet expressive subclass of temporal properties (LTL formulae) that allows us to capture many …

Resource-Aware Video Multicasting Via Access Gateways In Wireless Mesh Networks, Wanqing Tu, Cormac Sreenan, Chun Tung Chou, Archan Misra, Sanjay Jha

Research Collection School Of Computing and Information Systems

This paper studies video multicasting in large scale areas using wireless mesh networks. The focus is on the use of Internet access gateways that allow a choice of alternative routes to avoid potentially lengthy and low capacity multi-hop wireless paths. A set of heuristic-based algorithms are described that together aim to maximize network capacity: the two-tier integrated architecture algorithm, the weighted gateway uploading algorithm, the link controlled routing tree algorithm, and the dynamic group management algorithm. These algorithms use different approaches to arrange nodes involved in video multicasting into a clustered and two-tier integrated architecture in which network protocols can …

Active Malware Analysis Using Stochastic Games, Simon Williamson, Pradeep Reddy Varakantham, Debin Gao, Chen Hui Ong

Research Collection School Of Computing and Information Systems

Cyber security is increasingly important for defending computer systems from loss of privacy or unauthorised use. One important aspect is threat analysis - how does an attacker infiltrate a system and what do they want once they are inside. This paper considers the problem of Active Malware Analysis, where we learn about the human or software intruder by actively interacting with it with the goal of learning about its behaviours and intentions, whilst at the same time that intruder may be trying to avoid detection or showing those behaviours and intentions. This game-theoretic active learning is then used to obtain …

Adaptive Data Acquisition Strategies For Energy-Efficient, Smartphone-Based, Continuous Processing Of Sensor Streams, Lipyeow Lim, Archan Misra, Tianli Mo

Research Collection School Of Computing and Information Systems

There is a growing interest in applications that utilize continuous sensing of individual activity or context, via sensors embedded or associated with personal mobile devices (e.g., smartphones). Reducing the energy overheads of sensor data acquisition and processing is essential to ensure the successful continuous operation of such applications, especially on battery-limited mobile devices. To achieve this goal, this paper presents a framework, called ACQUA, for ‘acquisition-cost’ aware continuous query processing. ACQUA replaces the current paradigm, where the data is typically streamed (pushed) from the sensors to the one or more smartphones, with a pull-based asynchronous model, where a smartphone retrieves …