Computer Sciences Commons^™

Virality And Susceptibility In Information Diffusions, Tuan-Anh Hoang, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Viral diffusion allows a piece of information to widely and quickly spread within the network of users through word-ofmouth. In this paper, we study the problem of modeling both item and user factors that contribute to viral diffusion in Twitter network. We identify three behaviorial factors, namely user virality, user susceptibility and item virality, that contribute to viral diffusion. Instead of modeling these factors independently as done in previous research, we propose a model that measures all the factors simultaneously considering their mutual dependencies. The model has been evaluated on both synthetic and real datasets. The experiments show that our …

Delayed Observation Planning In Partially Observable Domains, Pradeep Reddy Varakantham, Janusz Marecki

Research Collection School Of Computing and Information Systems

Traditional models for planning under uncertainty such as Markov Decision Processes (MDPs) or Partially Observable MDPs (POMDPs) assume that the observations about the results of agent actions are instantly available to the agent. In so doing, they are no longer applicable to domains where observations are received with delays caused by temporary unavailability of information (e.g. delayed response of the market to a new product). To that end, we make the following key contributions towards solving Delayed observation POMDPs (D-POMDPs): (i) We first provide an parameterized approximate algorithm for solving D-POMDPs efficiently, with desired accuracy; and (ii) We then propose …

Prioritized Shaping Of Models For Solving Dec-Pomdps, Pradeep Reddy Varakantham, William Yeoh, Prasanna Velagapudi, Paul Scerri

Research Collection School Of Computing and Information Systems

An interesting class of multi-agent POMDP planning problems can be solved by having agents iteratively solve individual POMDPs, find interactions with other individual plans, shape their transition and reward functions to encourage good interactions and discourage bad ones and then recompute a new plan. D-TREMOR showed that this approach can allow distributed planning for hundreds of agents. However, the quality and speed of the planning process depends on the prioritization scheme used. Lower priority agents shape their models with respect to the models of higher priority agents. In this paper, we introduce a new prioritization scheme that is guaranteed to …

Dash: A Novel Search Engine For Database-Generated Dynamic Web Pages, Ken C. K. Lee, Kanchan Bankar, Baihua Zheng, Chi-Yin Chow, Honggang Wang

Research Collection School Of Computing and Information Systems

Database-generated dynamic web pages (db-pages, in short), whose contents are created on the fly by web applications and databases, are now prominent in the web. However, many of them cannot be searched by existing search engines. Accordingly, we develop a novel search engine named Dash, which stands for Db-pAge SearcH, to support db-page search. Dash determines db-pages possibly generated by a target web application and its database through exploring the application code and the related database content and supports keyword search on those db-pages. In this paper, we present its system design and focus on the efficiency issue.

To minimize …

Trurepec: A Trust-Behavior-Based Reputation And Recommender System For Mobile Applications, Zheng Yan, Peng Zhang, Robert H. Deng

Research Collection School Of Computing and Information Systems

Mobile applications are software packages that can be installed and executed in a mobile device. Which mobile application is trustworthy for a user to purchase, download, install, execute or recommend becomes a crucial issue that impacts its final success. This paper proposes TruBeRepec, a trust-behavior-based reputation and recommender system for mobile applications. We explore a model of trust behavior for mobile applications based on the result of a large-scale user survey. We further develop a number of algorithms that are used to evaluate individual user’s trust in a mobile application through trust behavior observation, generate the application’s reputation by aggregating …

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.

Vertical Differentiation And A Comparison Of Online Advertising Models, Mei Lin, Xuqing Ke, Andrew B. Whinston

Research Collection School Of Computing and Information Systems

Designing business models that take into consideration the role of advertising support is critical to the success of online services. In this paper, we address the challenges of these business model strategies and compare different ad revenue models. We use game theory to model vertical differentiation in both monopoly and duopoly settings, in which online service providers may offer an ad-free service, an ad-supported service, or a combination of these services. Offering both ad-free and ad-supported services is the optimal strategy for a monopolist because ad revenues compensate for the cannibalistic effect of vertical differentiation. In a duopoly equilibrium, exactly …

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 …

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 …

A Self-Organizing Multi-Memory System For Autonomous Agents, Wenwen Wang, Budhitama Subagdja, Ah-Hwee Tan, Yuan-Sin Tan

Research Collection School Of Computing and Information Systems

This paper presents a self-organizing approach to the learning of procedural and declarative knowledge in parallel using independent but interconnected memory models. The proposed system, employing fusion Adaptive Resonance Theory (fusion ART) network as a building block, consists of a declarative memory module, that learns both episodic traces and semantic knowledge in real time, as well as a procedural memory module that learns reactive responses to its environment through reinforcement learning. More importantly, the proposed multi-memory system demonstrates how the various memory modules transfer knowledge and cooperate with each other for a higher overall performance. We present experimental studies, wherein …

Overcoming The Challenges In Cost Estimation For Distributed Software Projects, Narayanasamy Ramasubbu, Rajesh Krishna Balan

Research Collection School Of Computing and Information Systems

We describe how we studied, in-situ, the operational processes of three large high process maturity distributed software development companies and discovered three common problems they faced with respect to early stage project cost estimation. We found that project managers faced significant challenges to accurately estimate project costs because the standard metrics-based estimation tools they used (a) did not effectively incorporate diverse distributed project configurations and characteristics, (b) required comprehensive data that was not fully available for all starting projects, and (c) required significant domain experience to derive accurate estimates. To address these challenges, we collaborated with practitioners at the three …

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 …

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 …

Spatial Queries In Wireless Broadcast Environments [Keynote Speech], Kyriakos Mouratidis

Research Collection School Of Computing and Information Systems

Wireless data broadcasting is a promising technique for information dissemination that exploits the computational capabilities of mobile devices, in order to enhance the scalability of the system. Under this environment, the data are continuously broadcast by the server, interleaved with some indexing information for query processing. Clients may tune in the broadcast channel and process their queries locally without contacting the server. In this paper we focus on spatial queries in particular. First, we review existing methods on this topic. Next, taking shortest path computation as an example, we showcase technical challenges arising in this processing model and describe techniques …

Anyone Can Sketch Vignettes!, Rubaiat Habib Kazi, Takeo Igarashi, Shengdong Zhao, Richard Christopher Davis, Toni-Jan Keith Monserrat

Research Collection School of Computing and Information Systems

Vignette is an interactive system that facilitates texture creation in pen-and-ink illustrations. Unlike existing systems, Vignette preserves illustrators’ workflow and style: users draw a fraction of a texture and use gestures to automatically fill regions with the texture. Our exploration of natural work-flow and gesture-based interaction was inspired by traditional way of creating illustrations. We currently support both 1D and 2D synthesis with stitching. Our system also has interactive refinement and editing capabilities to provide a higher level texture control, which helps artists achieve their desired vision. Vignette makes the process of illustration more enjoyable and that first time users …

Inauguration Of Smu-Tcs Icity Laboratory, Singapore Management University

SMU Press Releases and News

The Singapore Management University (SMU) and Tata Consultancy Services (TCS), a leading IT services, business solutions and consulting firm, inaugurated the SMU-TCS Intelligent City Laboratory (“iCity Lab”) on 9 May 2012 (Wednesday). The inauguration ceremony was held at the iCity Lab Experience Centre located at the SMU School of Information Systems (SIS). Equipped with interactive technology, this Experience Centre will serve as a venue for city managers and urban planners to experience the new ideas and technologies which the Lab will be developing. This collaboration initiative was announced on 5 August 2011, which aimed to develop, as well as establish …

#Epicplay: Crowd-Sourcing Sports Video Highlights, Anthony Tang, Sebastian Boring

Research Collection School Of Computing and Information Systems

During a live sports event, many sports fans use social media as a part of their viewing experience, reporting on their thoughts on the event as it unfolds. In this work, we use this information stream to semantically annotate live broadcast sports games, using these annotations to select video highlights from the game. We demonstrate that this approach can be used to select highlights specific for fans of each team, and that these clips reflect the emotions of a fan during a game. Further, we describe how these clips differ from those seen on nightly sportscasts.

Student Usage Patterns And Perceptions For Differentiated Lab Exercises In An Undergraduate Programming Course, Heng Ngee Mok

Research Collection School Of Computing and Information Systems

Differentiated instruction in the form of tiered take-home lab exercises was implemented for students of an undergraduate-level programming course. This paper attempts to uncover the perceptions and usage patterns of students toward these new lab exercises using a comprehensive survey. Findings reveal that these tiered exercises are generally very well received and preferred over their traditional "one size fits all" counter-parts. Although the study does not show that tiered exercises have improved proÞciency or scores, it does seem to indicate higher student engagement and motivation levels. Based on the survey results, a list of recommendations is put forth for the …

Empirical Studies On Collaboration In Software Development: A Systematic Literature Review, Christoph Treude, Margaret-Anne Storey, Jens Weber

Research Collection School Of Computing and Information Systems

Collaboration in software development is a complex is- sue that has been examined by various researchers over the last decade. This paper presents a systematic literature re- view of pertinent literature on empirical studies on collabo- rative software development. We found that a lot of progress has been achieved in the field of global or distributed de- velopment. While there are still many challenges, today's projects seem to have overcome at least some of those. Also, first steps have been made in understanding the collabora- tive aspects of requirements engineering and design. Re- search on tools for collaboration is advanced, …

Expressive Cp-Abe With Partially Hidden Access Structures, Junzuo Lai, Robert H. Deng, Yingjiu Li

Research Collection School Of Computing and Information Systems

At Eurocrypt 2005, Sahai and Waters [7] introduced the concept of attribute-based encryption (ABE). ABE enables public key based one-to-many encryption and is envisioned as a promising cryptographic primitive for realizing scalable and fine-grained access control systems. There are two kinds of ABE schemes [1], key-policy ABE (KP-ABE) and ciphertext-policy ABE (CP-ABE) schemes. This paper, our concern is on the latter.

Spalendar: Visualizing A Group's Calendar Events Over A Geographic Space On A Public Display, Chen Xiang, Sebastian Boring, Sheelagh Carpendale, Anthony Tang, Saul Greenberg

Research Collection School Of Computing and Information Systems

Portable paper calendars (i.e., day planners and organizers) have greatly influenced the design of group electronic calendars. Both use time units (hours/days/weeks/etc.) to organize visuals, with useful information (e.g., event types, locations, attendees) usually presented as - perhaps abbreviated or even hidden - text fields within those time units. The problem is that, for a group, this visual sorting of individual events into time buckets conveys only limited information about the social network of people. For example, people’s whereabouts cannot be read ‘at a glance’ but require examining the text. Our goal is to explore an alternate visualization that can …

Pamr: Passive-Aggressive Mean Reversion Strategy For Portfolio Selection, Bin Li, Peilin Zhao, Steven C. H. Hoi, Vivekanand Gopalkrishnan

Research Collection School Of Computing and Information Systems

This project proposes a novel online portfolio selection strategy named ``Passive Aggressive Mean Reversion" (PAMR). Unlike traditional trend following approaches, the proposed approach relies upon the mean reversion relation of financial markets. Equipped with online passive aggressive learning technique from machine learning, the proposed portfolio selection strategy can effectively exploit the mean reversion property of markets. By analyzing PAMR's update scheme, we find that it nicely trades off between portfolio return and volatility risk and reflects the mean reversion trading principle. We also present several variants of PAMR algorithm, including a mixture algorithm which mixes PAMR and other strategies. We …

Organizing User Search Histories, Heasoo Hwang, Hady W. Lauw, Lise Getoor, Alexandros Ntoulas

Research Collection School Of Computing and Information Systems

Users are increasingly pursuing complex task-oriented goals on the web, such as making travel arrangements, managing finances, or planning purchases. To this end, they usually break down the tasks into a few codependent steps and issue multiple queries around these steps repeatedly over long periods of time. To better support users in their long-term information quests on the web, search engines keep track of their queries and clicks while searching online. In this paper, we study the problem of organizing a user's historical queries into groups in a dynamic and automated fashion. Automatically identifying query groups is helpful for a …

Vignette: Interactive Texture Design And Manipulation With Freeform Gestures For Pen-And-Ink Illustration, Rubaiat Habib Kazi, Takeo Igarashi, Shengdong Zhao, Richard C. Davis

Research Collection School Of Computing and Information Systems

Vignette is an interactive system that facilitates texture creation in pen-and-ink illustrations. Unlike existing systems, Vignette preserves illustrators' workflow and style: users draw a fraction of a texture and use gestures to automatically fill regions with the texture. We currently support both 1D and 2D synthesis with stitching. Our system also has interactive refinement and editing capabilities to provide a higher level texture control, which helps artists achieve their desired vision. A user study with professional artists shows that Vignette makes the process of illustration more enjoyable and that first time users can create rich textures from scratch within minutes.

Method And Apparatus For Rapid Identification Of Column Heterogeneity, Bing Tian Dai, Nikolaos Koudas, Beng Chin Ooi, Divesh Srivastava, Suresh Venkatasubranmanian

Research Collection School Of Computing and Information Systems

A method and apparatus for rapid identification of column heterogeneity in databases are disclosed. For example, the method receives data associated with a column in a database. The method computes a cluster entropy for the data as a measure of data heterogeneity and then determines whether said data is heterogeneous in accordance with the cluster entropy.

Spatial Queries In Wireless Broadcast Environments [Keynote Speech], Kyriakos Mouratidis

Research Collection School Of Computing and Information Systems

Wireless data broadcasting is a promising technique for information dissemination that exploits the computational capabilities of mobile devices, in order to enhance the scalability of the system. Under this environment, the data are continuously broadcast by the server, interleaved with some indexing information for query processing. Clients may tune in the broadcast channel and process their queries locally without contacting the server. In this paper we focus on spatial queries in particular. First, we review existing methods on this topic. Next, taking shortest path computation as an example, we showcase technical challenges arising in this processing model and describe techniques …

Coercion Resistance In Authentication Responsibility Shifting, Payas Gupta, Xuhua Ding, Debin Gao

Research Collection School Of Computing and Information Systems

Responsibility shifting, a popular solution used in the event of failure of primary authentication where a human helper is involved in regaining access, is vulnerable to coercion attacks. In this work, we report our user study which investigates the helper’s emotional status when being coerced to assist in an attack. Results show that the coercion causes involuntary skin conductance fluctuation on the helper, which indicates that he/she is nervous and stressed. This response can be used to strengthen the security of the authentication system by providing coercion resistance.

Modeling Latent Relationships In The Mygamma Network, Mauricio Sadinle, Mike Finegold, Stephen E. Fienberg, Ee-Peng Lim

LARC Research Publications

No abstract provided.

Setting Up A Low-Cost Lab Management System For A Multi-Purpose Computing Laboratory Using Virtualisation Technology, Heng Ngee Mok, Wee Kiat Tan

Research Collection School Of Computing and Information Systems

This paper describes how a generic computer laboratory equipped with 52 workstations is set up for teaching IT-related courses and other general purpose usage. The authors have successfully constructed a lab management system based on decentralised, client-side software virtualisation technology using Linux and free software tools from VMware that fulfils the requirements of fast "switch over" time between consecutive lab sessions, the ability to support a wide range of IT courses and usage scenarios, low cost, easy maintenance, and a sandboxed environment for potentially disruptive IT security lab exercises. Sufficient implementation details are provided so that readers can build a …

Message Passing Algorithms For Map Estimation Using Dc Programming, Akshat Kumar, Shlomo Zilberstein, Marc Toussaint

Research Collection School Of Computing and Information Systems

We address the problem of finding the most likely assignment or MAP estimation in a Markov random field. We analyze the linear programming formulation of MAP through the lens of difference of convex functions (DC) programming, and use the concave-convex procedure (CCCP) to develop efficient message-passing solvers. The resulting algorithms are guaranteed to converge to a global optimum of the well-studied local polytope, an outer bound on the MAP marginal polytope. To tighten the outer bound, we show how to combine it with the mean-field based inner bound and, again, solve it using CCCP. We also identify a useful relationship …