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

Computer Sciences Commons™

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

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 5881 - 5910 of 9024

Full-Text Articles in Computer Sciences

Effects Of The Use Of Points, Leaderboards And Badges On In-Game Purchases Of Virtual Goods, Fiona Fui-Hoon Nah, Lakshmi Sushma Daggubati, Amith Tarigonda, Raghu Vinay Nuvvula, Ofir Turel Aug 2015

Effects Of The Use Of Points, Leaderboards And Badges On In-Game Purchases Of Virtual Goods, Fiona Fui-Hoon Nah, Lakshmi Sushma Daggubati, Amith Tarigonda, Raghu Vinay Nuvvula, Ofir Turel

Research Collection School Of Computing and Information Systems

Game design elements are major factors in gamification. In this study, we seek to examine the impact of game design elements on users’ in-game purchases of virtual goods. The purchase of virtual goods due to players’ intrinsic motivation has been studied but little is known about the purchase of virtual goods due to the use of game design elements (i.e., Points, Leaderboards and Badges) built into the games. Extending our knowledge to this realm can help researchers to better understand gamers’ behaviors, and game designers and marketers to better promote and sell virtual goods in online games.

Go to article

Creating Greater Synergy Between Hci Academia And Practice, Fiona Fui-Hoon Nah, Dennis Galletta, Melinda Knight, James R. Lewis, John Pruitt, Gavriel Salvendy, Hong Sheng, Anna Wichansky Aug 2015

Creating Greater Synergy Between Hci Academia And Practice, Fiona Fui-Hoon Nah, Dennis Galletta, Melinda Knight, James R. Lewis, John Pruitt, Gavriel Salvendy, Hong Sheng, Anna Wichansky

Research Collection School Of Computing and Information Systems

This paper presents perspectives from both academia and practice on how both groups can collaborate and work together to create synergy in the development and advancement of human-computer interaction (HCI). Issues and challenges are highlighted, success cases are offered as examples, and suggestions are provided to further such collaborations.

Go to article

Facilitating Image Search With A Scalable And Compact Semantic Mapping, Meng Wang, Weisheng Li, Dong Liu, Bingbing Ni, Jialie Shen, Shuicheng Yan Aug 2015

Facilitating Image Search With A Scalable And Compact Semantic Mapping, Meng Wang, Weisheng Li, Dong Liu, Bingbing Ni, Jialie Shen, Shuicheng Yan

Research Collection School Of Computing and Information Systems

This paper introduces a novel approach to facilitating image search based on a compact semantic embedding. A novel method is developed to explicitly map concepts and image contents into a unified latent semantic space for the representation of semantic concept prototypes. Then, a linear embedding matrix is learned that maps images into the semantic space, such that each image is closer to its relevant concept prototype than other prototypes. In our approach, the semantic concepts equated with query keywords and the images mapped into the vicinity of the prototype are retrieved by our scheme. In addition, a computationally efficient method …

Go to article

New Product Development Flexibility In A Competitive Environment, Janne Kettunen, Yael Gruksha-Cockayne, Zeger Degraeve, Bert De Reyck Aug 2015

New Product Development Flexibility In A Competitive Environment, Janne Kettunen, Yael Gruksha-Cockayne, Zeger Degraeve, Bert De Reyck

Research Collection Lee Kong Chian School Of Business

Managerial flexibility can have a significant impact on the value of new product development projects. We investigate how the market environment in which a firm operates influences the value and use of development flexibility. We characterize the market environment according to two dimensions, namely (i) its intensity, and (ii) its degree of innovation. We show that these two market characteristics can have a different effect on the value of flexibility. In particular, we show that more intense or innovative environments may increase or decrease the value of flexibility. For instance, we demonstrate that the option to defer a product launch …

Go to article

Topic Modeling With Document Relative Similarities, Jianguang Du, Jing Jiang, Dandan Song, Lejian Liao Jul 2015

Topic Modeling With Document Relative Similarities, Jianguang Du, Jing Jiang, Dandan Song, Lejian Liao

Research Collection School Of Computing and Information Systems

Topic modeling has been widely used in text mining. Previous topic models such as Latent Dirichlet Allocation (LDA) are successful in learning hidden topics but they do not take into account metadata of documents. To tackle this problem, many augmented topic models have been proposed to jointly model text and metadata. But most existing models handle only categorical and numerical types of metadata. We identify another type of metadata that can be more natural to obtain in some scenarios. These are relative similarities among documents. In this paper, we propose a general model that links LDA with constraints derived from …

Go to article

Detection And Classification Of Malicious Javascript Via Attack Behavior Modelling, Yinxing Xue, Junjie Wang, Yang Liu, Hao Xiao, Jun Sun, Mahinthan Chandramohan Jul 2015

Detection And Classification Of Malicious Javascript Via Attack Behavior Modelling, Yinxing Xue, Junjie Wang, Yang Liu, Hao Xiao, Jun Sun, Mahinthan Chandramohan

Research Collection School Of Computing and Information Systems

Existing malicious JavaScript (JS) detection tools and commercial anti-virus tools mostly use feature-based or signature-based approaches to detect JS malware. These tools are weak in resistance to obfuscation and JS malware variants, not mentioning about providing detailed information of attack behaviors. Such limitations root in the incapability of capturing attack behaviors in these approches. In this paper, we propose to use Deterministic Finite Automaton (DFA) to abstract and summarize common behaviors of malicious JS of the same attack type. We propose an automatic behavior learning framework, named JS∗ , to learn DFA from dynamic execution traces of JS malware, where …

Go to article

On Multipath Link Characterization And Adaptation For Device-Free Human Detection, Zimu Zhou, Zheng Yang, Chenshu Wu, Yunhao Liu, Lionel M. Ni Jul 2015

On Multipath Link Characterization And Adaptation For Device-Free Human Detection, Zimu Zhou, Zheng Yang, Chenshu Wu, Yunhao Liu, Lionel M. Ni

Research Collection School Of Computing and Information Systems

No abstract provided.

Go to article

Business Intelligence, Data And Analytics, Singapore Management University Jul 2015

Business Intelligence, Data And Analytics, Singapore Management University

Perspectives@SMU

Data can be used to predict outcomes but quality data is essential

Go to article

Analytics For Business, Consumers And Social Insights, Bhavish Sood Jul 2015

Analytics For Business, Consumers And Social Insights, Bhavish Sood

Library Events

The speaker shared with us on best practice, future outlook and opportunities of analytical applications. The speaker has a strong research interest on how business applications and business intelligence software are being consumed on smartphones and media tablets.

Go to article

Mwp-Bert: Numeracy-Augmented Pre-Training For Math Word Problem Solving, Zhenwen Liang, Jipeng Zhang, Lei Wang, Wei Qin, Yunshi Lan, Jie Shao, Xiangliang Zhang Jul 2015

Mwp-Bert: Numeracy-Augmented Pre-Training For Math Word Problem Solving, Zhenwen Liang, Jipeng Zhang, Lei Wang, Wei Qin, Yunshi Lan, Jie Shao, Xiangliang Zhang

Student Publications

Math word problem (MWP) solving faces a dilemma in number representation learning. In order to avoid the number representation issue and reduce the search space of feasible solutions, existing works striving for MWP solving usually replace real numbers with symbolic placeholders to focus on logic reasoning. However, different from common symbolic reasoning tasks like program synthesis and knowledge graph reasoning, MWP solving has extra requirements in numerical reasoning. In other words, instead of the number value itself, it is the reusable numerical property that matters more in numerical reasoning. Therefore, we argue that injecting numerical properties into symbolic placeholders with …

Go to article

S-Looper: Automatic Summarization For Multipath String Loops, Xiaofei Xie, Yang Liu, Wei Le, Xiaohong Li, Hongxu Chen Jul 2015

S-Looper: Automatic Summarization For Multipath String Loops, Xiaofei Xie, Yang Liu, Wei Le, Xiaohong Li, Hongxu Chen

Research Collection School Of Computing and Information Systems

Loops are important yet most challenging program constructs to analyze for various program analysis tasks. Existing loop analysis techniques mainly handle well loops that contain only integer variables with a single path in the loop body. The key challenge in summarizing a multiple-path loop is that a loop traversal can yield a large number of possibilities due to the different execution orders of these paths located in the loop; when a loop contains a conditional branch related to string content, we potentially need to track every character in the string for loop summarization, which is expensive. In this paper, we …

Go to article

Log-Euclidean Metric Learning On Symmetric Positive Definite Manifold With Application To Image Set Classification, Zhiwu Huang, R. Wang, S. Shan, X. Li, X. Chen Jul 2015

Log-Euclidean Metric Learning On Symmetric Positive Definite Manifold With Application To Image Set Classification, Zhiwu Huang, R. Wang, S. Shan, X. Li, X. Chen

Research Collection School Of Computing and Information Systems

The manifold of Symmetric Positive Definite (SPD) matrices has been successfully used for data representation in image set classification. By endowing the SPD manifold with Log-Euclidean Metric, existing methods typically work on vector-forms of SPD matrix logarithms. This however not only inevitably distorts the geometrical structure of the space of SPD matrix logarithms but also brings low efficiency especially when the dimensionality of SPD matrix is high. To overcome this limitation, we propose a novel metric learning approach to work directly on logarithms of SPD matrices. Specifically, our method aims to learn a tangent map that can directly transform the …

Go to article

Using Tweets To Help Sentence Compression For News Highlights Generation, Zhongyu Wei, Yang Liu, Chen Li, Wei Gao Jul 2015

Using Tweets To Help Sentence Compression For News Highlights Generation, Zhongyu Wei, Yang Liu, Chen Li, Wei Gao

Research Collection School Of Computing and Information Systems

We explore using relevant tweets of a given news article to help sentence compression for generating compressive news highlights. We extend an unsupervised dependency-tree based sentence compression approach by incorporating tweet information to weight the tree edge in terms of informativeness and syntactic importance. The experimental results on a public corpus that contains both news articles and relevant tweets show that our proposed tweets guided sentence compression method can improve the summarization performance significantly compared to the baseline generic sentence compression method.

Go to article

Personalized Sentiment Classification Based On Latent Individuality Of Microblog Users, Kaisong Song, Shi Feng, Wei Gao, Daling Wang, Ge Yu, Kam-Fai Wong Jul 2015

Personalized Sentiment Classification Based On Latent Individuality Of Microblog Users, Kaisong Song, Shi Feng, Wei Gao, Daling Wang, Ge Yu, Kam-Fai Wong

Research Collection School Of Computing and Information Systems

Sentiment expression in microblog posts often reflects user’s specific individuality due to different language habit, personal character, opinion bias and so on. Existing sentiment classification algorithms largely ignore such latent personal distinctions among different microblog users. Meanwhile, sentiment data of microblogs are sparse for individual users, making it infeasible to learn effective personalized classifier. In this paper, we propose a novel, extensible personalized sentiment classification method based on a variant of latent factor model to capture personal sentiment variations by mapping users and posts into a low-dimensional factor space. We alleviate the sparsity of personal texts by decomposing the posts …

Go to article

Optimizing Selection Of Competing Features Via Feedback-Directed Evolutionary Algorithms, Tian Huat Tan, Yinxing Xue, Manman Chen, Jun Sun, Yang Liu, Jin Song Dong Dong Jul 2015

Optimizing Selection Of Competing Features Via Feedback-Directed Evolutionary Algorithms, Tian Huat Tan, Yinxing Xue, Manman Chen, Jun Sun, Yang Liu, Jin Song Dong Dong

Research Collection School Of Computing and Information Systems

Software that support various groups of customers usually require complicated configurations to attain different functionalities. To model the configuration options, feature model is proposed to capture the commonalities and competing variabilities of the product variants in software family or Software Product Line (SPL). A key challenge for deriving a new product is to find a set of features that do not have inconsistencies or conflicts, yet optimize multiple objectives (e.g., minimizing cost and maximizing number of features), which are often competing with each other. Existing works have attempted to make use of evolutionary algorithms (EAs) to address this problem. In …

Go to article

Reliability Assessment For Distributed Systems Via Communication Abstraction And Refinement, Lin Gui, Jun Sun, Yang Liu, Jin Song Dong Jul 2015

Reliability Assessment For Distributed Systems Via Communication Abstraction And Refinement, Lin Gui, Jun Sun, Yang Liu, Jin Song Dong

Research Collection School Of Computing and Information Systems

Distributed systems like cloud-based services are ever more popular. Assessing the reliability of distributed systems is highly non-trivial. Particularly, the order of executions among distributed components adds a dimension of non-determinism, which invalidates existing reliability assessment methods based on Markov chains. Probabilistic model checking based on models like Markov decision processes is designed to deal with scenarios involving both probabilistic behavior (e.g., reliabilities of system components) and non-determinism. However, its application is currently limited by state space explosion, which makes reliability assessment of distributed system particularly difficult. In this work, we improve the probabilistic model checking through a method of …

Go to article

A Comparative Study Between Motivated Learning And Reinforcement Learning, James T. Graham, Janusz A. Starzyk, Zhen Ni, Haibo He, T.-H. Teng, Ah-Hwee Tan Jul 2015

A Comparative Study Between Motivated Learning And Reinforcement Learning, James T. Graham, Janusz A. Starzyk, Zhen Ni, Haibo He, T.-H. Teng, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

This paper analyzes advanced reinforcement learning techniques and compares some of them to motivated learning. Motivated learning is briefly discussed indicating its relation to reinforcement learning. A black box scenario for comparative analysis of learning efficiency in autonomous agents is developed and described. This is used to analyze selected algorithms. Reported results demonstrate that in the selected category of problems, motivated learning outperformed all reinforcement learning algorithms we compared with.

Go to article

An Adaptive Computational Model For Personalized Persuasion, Yilin Kang, Ah-Hwee Tan, Chunyan Miao Jul 2015

An Adaptive Computational Model For Personalized Persuasion, Yilin Kang, Ah-Hwee Tan, Chunyan Miao

Research Collection School Of Computing and Information Systems

While a variety of persuasion agents have been created and applied in different domains such as marketing, military training and health industry, there is a lack of a model which can provide a unified framework for different persuasion strategies. Specifically, persuasion is not adaptable to the individuals’ personal states in different situations. Grounded in the Elaboration Likelihood Model (ELM), this paper presents a computational model called Model for Adaptive Persuasion (MAP) for virtual agents. MAP is a semi-connected network model which enables an agent to adapt its persuasion strategies through feedback. We have implemented and evaluated a MAP-based virtual nurse …

Go to article

A New Public Remote Integrity Checking Scheme With User Privacy, Yiteng Feng, Yi Mu, Guomin Yang, Joseph Liu Jul 2015

A New Public Remote Integrity Checking Scheme With User Privacy, Yiteng Feng, Yi Mu, Guomin Yang, Joseph Liu

Research Collection School Of Computing and Information Systems

With a cloud storage, users can store their data files on a remote cloud server with a high quality on-demand cloud service and are able to share their data with other users. Since cloud servers are not usually regarded as fully trusted and the cloud data can be shared amongst users, the integrity checking of the remote files has become an important issue. A number of remote data integrity checking protocols have been proposed in the literature to allow public auditing of cloud data by a third party auditor (TPA). However, user privacy is not taken into account in most …

Go to article

A New General Framework For Secure Public Key Encryption With Keyword Search, Rongmao Chen, Yi Mu, Guomin Yang, Fuchun Guo, Xiaofen Wang Jul 2015

A New General Framework For Secure Public Key Encryption With Keyword Search, Rongmao Chen, Yi Mu, Guomin Yang, Fuchun Guo, Xiaofen Wang

Research Collection School Of Computing and Information Systems

Public Key Encryption with Keyword Search (PEKS), introduced by Boneh et al. in Eurocrypt’04, allows users to search encrypted documents on an untrusted server without revealing any information. This notion is very useful in many applications and has attracted a lot of attention by the cryptographic research community. However, one limitation of all the existing PEKS schemes is that they cannot resist the Keyword Guessing Attack (KGA) launched by a malicious server. In this paper, we propose a new PEKS framework named Dual-Server Public Key Encryption with Keyword Search (DS-PEKS). This new framework can withstand all the attacks, including the …

Go to article

Privacy-Preserving Offloading Of Mobile App To The Public Cloud, Yue Duan, Mu Zhang, Heng Yin, Yuzhe Tang Jul 2015

Privacy-Preserving Offloading Of Mobile App To The Public Cloud, Yue Duan, Mu Zhang, Heng Yin, Yuzhe Tang

Research Collection School Of Computing and Information Systems

To support intensive computations on resource-restricting mobile devices, studies have been made to enable the offloading of a part of a mobile program to the cloud. However, none of the existing approaches considers user privacy when transmitting code and data off the device, resulting in potential privacy breach. In this paper, we present the design and implementation of a system that automatically performs fine-grained privacy-preserving Android app offloading. It utilizes static analysis and bytecode instrumentation techniques to ensure transparent and efficient Android app offloading while preserving user privacy. We evaluate the effectiveness and performance of our system using two Android …

Go to article

Production Cost Heterogeneity In A Circular-City Model, Mei Lin, Ruhai Wu Jul 2015

Production Cost Heterogeneity In A Circular-City Model, Mei Lin, Ruhai Wu

Research Collection School Of Computing and Information Systems

We derive the closed-form solution characterizing the equilibrium in a circular-city model with competing firms of heterogeneous production costs. Tractability issues in this setting are well known and have not been resolved in prior work. In this paper, the equilibrium solution illustrates effects of production costs on firms’ strategic decisions, their aggregate profit, and consumer surplus.

Go to article

Structured Learning From Heterogeneous Behavior For Social Identity Linkage, Siyuan Liu, Shuhui Wang, Feida Zhu Jul 2015

Structured Learning From Heterogeneous Behavior For Social Identity Linkage, Siyuan Liu, Shuhui Wang, Feida Zhu

Research Collection School Of Computing and Information Systems

Social identity linkage across different social media platforms is of critical importance to business intelligence by gaining from social data a deeper understanding and more accurate profiling of users. In this paper, we propose a solution framework, HYDRA, which consists of three key steps: (I) we model heterogeneous behavior by long-term topical distribution analysis and multi-resolution temporal behavior matching against high noise and information missing, and the behavior similarity are described by multi-dimensional similarity vector for each user pair; (II) we build structure consistency models to maximize the structure and behavior consistency on users' core social structure across different platforms, …

Go to article

Towards City-Scale Mobile Crowdsourcing: Task Recommendations Under Trajectory Uncertainties, Chen Cen, Shih-Fen Cheng, Hoong Chuin Lau, Archan Misra Jul 2015

Towards City-Scale Mobile Crowdsourcing: Task Recommendations Under Trajectory Uncertainties, Chen Cen, Shih-Fen Cheng, Hoong Chuin Lau, Archan Misra

Research Collection School Of Computing and Information Systems

In this work, we investigate the problem of large-scale mobile crowdsourcing, where workers are financially motivated to perform location-based tasks physically. Unlike current industry practice that relies on workers to manually pick tasks to perform, we automatically make task recommendation based on workers’ historical trajectories and desired time budgets. The challenge of predicting workers’ trajectories is that it is faced with uncertainties, as a worker does not take same routes every day. In this work, we depart from deterministic modeling and study the stochastic task recommendation problem where each worker is associated with several predicted routine routes with probabilities. We …

Go to article

Attribute-Based Encryption With Efficient Verifiable Outsourced Decryption, Baodong Qin, Robert H. Deng, Shengli Liu, Siqi Ma Jul 2015

Attribute-Based Encryption With Efficient Verifiable Outsourced Decryption, Baodong Qin, Robert H. Deng, Shengli Liu, Siqi Ma

Research Collection School Of Computing and Information Systems

Attribute-based encryption (ABE) with outsourced decryption not only enables fine-grained sharing of encrypted data, but also overcomes the efficiency drawback (in terms of ciphertext size and decryption cost) of the standard ABE schemes. In particular, an ABE scheme with outsourced decryption allows a third party (e.g., a cloud server) to transform an ABE ciphertext into a (short) El Gamal-type ciphertext using a public transformation key provided by a user so that the latter can be decrypted much more efficiently than the former by the user. However, a shortcoming of the original outsourced ABE scheme is that the correctness of the …

Go to article

Attribute-Based Encryption With Efficient Verifiable Outsourced Decryption, Baodong Qin, Robert H. Deng, Shengli Liu, Siqi Ma Jul 2015

Attribute-Based Encryption With Efficient Verifiable Outsourced Decryption, Baodong Qin, Robert H. Deng, Shengli Liu, Siqi Ma

Research Collection School Of Computing and Information Systems

Attribute-based encryption (ABE) with outsourced decryption not only enables fine-grained sharing of encrypted data, but also overcomes the efficiency drawback (in terms of ciphertext size and decryption cost) of the standard ABE schemes. In particular, an ABE scheme with outsourced decryption allows a third party (e.g., a cloud server) to transform an ABE ciphertext into a (short) El Gamal-type ciphertext using a public transformation key provided by a user so that the latter can be decrypted much more efficiently than the former by the user. However, a shortcoming of the original outsourced ABE scheme is that the correctness of the …

Go to article

Fast Optimal Aggregate Point Search For A Merged Set On Road Networks, Weiwei Sun, Chong Chen, Baihua Zheng, Chunan Chen, Liang Zhu, Weimo Liu, Yan Huang Jul 2015

Fast Optimal Aggregate Point Search For A Merged Set On Road Networks, Weiwei Sun, Chong Chen, Baihua Zheng, Chunan Chen, Liang Zhu, Weimo Liu, Yan Huang

Research Collection School Of Computing and Information Systems

Aggregate nearest neighbor query, which returns an optimal target point that minimizes the aggregate distance for a given query point set, is one of the most important operations in spatial databases and their application domains. This paper addresses the problem of finding the aggregate nearest neighbor for a merged set that consists of the given query point set and multiple points needed to be selected from a candidate set, which we name as merged aggregate nearest neighbor(MANN) query. This paper proposes two algorithms to process MANN query on road networks when aggregate function is max. Then, we extend the algorithms …

Go to article

Active Semi-Supervised Approach For Checking App Behavior Against Its Description, Ma Siqi, Shaowei Wang, David Lo, Deng, Robert H., Cong Sun Jul 2015

Active Semi-Supervised Approach For Checking App Behavior Against Its Description, Ma Siqi, Shaowei Wang, David Lo, Deng, Robert H., Cong Sun

Research Collection School Of Computing and Information Systems

Mobile applications are popular in recent years. They are often allowed to access and modify users' sensitive data. However, many mobile applications are malwares that inappropriately use these sensitive data. To detect these malwares, Gorla et al. Propose CHABADA which compares app behaviors against its descriptions. Data about known malwares are not used in their work, which limits its effectiveness. In this work, we extend the work by Gorla et al. By proposing an active and semi-supervised approach for detecting malwares. Different from CHABADA, our approach will make use of both known benign and malicious apps to predict other malicious …

Go to article

A Convolution Kernel Approach To Identifying Comparisons In Text, Maksim Tkachenko, Hady W. Lauw Jul 2015

A Convolution Kernel Approach To Identifying Comparisons In Text, Maksim Tkachenko, Hady W. Lauw

Research Collection School Of Computing and Information Systems

Comparisons in text, such as in online reviews, serve as useful decision aids. In this paper, we focus on the task of identifying whether a comparison exists between a specific pair of entity mentions in a sentence. This formulation is transformative, as previous work only seeks to determine whether a sentence is comparative, which is presumptuous in the event the sentence mentions multiple entities and is comparing only some, not all, of them. Our approach leverages not only lexical features such as salient words, but also structural features expressing the relationships among words and entity mentions. To model these features …

Go to article

Message Passing For Collective Graphical Models, Tao Sun, Daniel Sheldon, Akshat Kumar Jul 2015

Message Passing For Collective Graphical Models, Tao Sun, Daniel Sheldon, Akshat Kumar

Research Collection School Of Computing and Information Systems

Collective graphical models (CGMs) are a formalism for inference and learning about a population of independent and identically distributed individuals when only noisy aggregate data are available. We highlight a close connection between approximate MAP inference in CGMs and marginal inference in standard graphical models. The connection leads us to derive a novel Belief Propagation (BP) style algorithm for collective graphical models. Mathematically, the algorithm is a strict generalization of BP—it can be viewed as an extension to minimize the Bethe free energy plus additional energy terms that are non-linear functions of the marginals. For CGMs, the algorithm is much …

Go to article

First Prev Next Last