Computer Sciences Commons^™

Learning Euclidean-To-Riemannian Metric For Point-To-Set Classification, Zhiwu Huang, R. Wang, S. Shan, X. Chen

Research Collection School Of Computing and Information Systems

In this paper, we focus on the problem of point-to-set classification, where single points are matched against sets of correlated points. Since the points commonly lie in Euclidean space while the sets are typically modeled as elements on Riemannian manifold, they can be treated as Euclidean points and Riemannian points respectively. To learn a metric between the heterogeneous points, we propose a novel Euclidean-to-Riemannian metric learning framework. Specifically, by exploiting typical Riemannian metrics, the Riemannian manifold is first embedded into a high dimensional Hilbert space to reduce the gaps between the heterogeneous spaces and meanwhile respect the Riemannian geometry of …

Ranking-Based Approaches For Localizing Faults, Lucia Lucia

Dissertations and Theses Collection (Open Access)

A fault is the root cause of program failures where a program behaves differently from the intended behavior. Finding or localizing faults is often laborious (especially so for complex programs), yet it is an important task in the software lifecycle. An automated technique that can accurately and quickly identify the faulty code is greatly needed to alleviate the costs of software debugging. Many fault localization techniques assume that faults are localizable, i.e., each fault manifests only in a single or a few lines of code that are close to one another. To verify this assumption, we study how faults spread …

Regen: Optimizing Genetic Selection Algorithms For Heterogeneous Computing, Scott Kenneth Swinkleb Winkleblack

Master's Theses

GenSel is a genetic selection analysis tool used to determine which genetic markers are informational for a given trait. Performing genetic selection related analyses is a time consuming and computationally expensive task. Due to an expected increase in the number of genotyped individuals, analysis times will increase dramatically. Therefore, optimization efforts must be made to keep analysis times reasonable.

This thesis focuses on optimizing one of GenSel’s underlying algorithms for heterogeneous computing. The resulting algorithm exposes task-level parallelism and data-level parallelism present but inaccessible in the original algorithm. The heterogeneous computing solution, ReGen, outperforms the optimized CPU implementation achieving a …

Toward Automating Web Protocol Configuration For A Programmable Logic Controller Emulator, Deanna R. Fink

Theses and Dissertations

Industrial Control Systems (ICS) remain vulnerable through attack vectors that exist within programmable logic controllers (PLC). PLC emulators used as honeypots can provide insight into these vulnerabilities. Honeypots can sometimes deter attackers from real devices and log activity. A variety of PLC emulators exist, but require manual figuration to change their PLC pro le. This limits their flexibility for deployment. An automated process for configuring PLC emulators can open the door for emulation of many types of PLCs. This study investigates the feasibility of creating such a process. The research creates an automated process for figuring the web protocols of …

Optimal Acceleration Thresholds For Non-Holonomic Agents, Brian Ricks, Parris K. Egbert

Computer Science Faculty Publications

Finding optimal trajectories for non-accelerating, non-holonomic agents is a well-understood problem. However, in video games, robotics, and crowd simulations non-holonomic agents start and stop frequently. With the vision of improving crowd simulation, we find optimal paths for virtual agents accelerating from a standstill. These paths are designed for the “ideal”, initial stage of planning when obstacles are ignored. We analytically derive paths and arrival times using arbitrary acceleration angle thresholds. We use these paths and arrival times to find an agent’s optimal ideal path. We then numerically calculate the decision surface that can be used by an application at run-time …

Flow In Gaming: Literature Synthesis And Framework Development, Fiona Fui-Hoon Nah, B. Eschenbrenner, Q. Zeng, V. Telaprolu, S. Sepehr

Research Collection School Of Computing and Information Systems

Flow, a state of optimal experience where one is completely absorbed and immersed in an activity, is an important phenomenon for studying and designing games. In this article, we synthesise the literature on flow in gaming to discern existing research streams, and identify the antecedents, dimensions, and outcomes of flow which are then integrated into a framework. Based on the findings, we provide suggestions for game design elements that practitioners, such as game designers, may find useful for creating or inducing flow in gaming. We also discuss implications for research and practice as well as provide suggestions for future research.

Online Community Transition Detection, Biying Tan, Feida Zhu, Qiang Qu, Siyuan Liu

Research Collection School Of Computing and Information Systems

Mining user behavior patterns in social networks is of great importance in user behavior analysis, targeted marketing, churn prediction and other applications. However, less effort has been made to study the evolution of user behavior in social communities. In particular, users join and leave communities over time. How to automatically detect the online community transitions of individual users is a research problem of immense practical value yet with great technical challenges. In this paper, we propose an algorithm based on the Minimum Description Length (MDL) principle to trace the evolution of community transition of individual users, adaptive to the noisy …

Boat: An Experimental Platform For Researchers To Comparatively And Reproducibly Evaluate Bug Localization Techniques, Xinyu Wang, David Lo, Xin Xia, Xingen Wang, Pavneet Singh Kochhar, Yuan Tian, Xiaohu Yang, Shanping Li, Jianling Sun, Bo Zhou

Research Collection School Of Computing and Information Systems

Bug localization refers to the process of identifying source code files that contain defects from descriptions of these defects which are typically contained in bug reports. There have been many bug localization techniques proposed in the literature. However, often it is hard to compare these techniques since different evaluation datasets are used. At times the datasets are not made publicly available and thus it is difficult to reproduce reported results. Furthermore, some techniques are only evaluated on small datasets and thus it is not clear whether the results are generalizable. Thus, there is a need for a platform that allows …

Sewordsim: Software-Specific Word Similarity Database, Yuan Tian, David Lo, Julia Lawall

Research Collection School Of Computing and Information Systems

Measuring the similarity of words is important in accurately representing and comparing documents, and thus improves the results of many natural language processing (NLP) tasks. The NLP community has proposed various measurements based on WordNet, a lexical database that contains relationships between many pairs of words. Recently, a number of techniques have been proposed to address software engineering issues such as code search and fault localization that require understanding natural language documents, and a measure of word similarity could improve their results. However, WordNet only contains information about words senses in general-purpose conversation, which often differ from word senses in …

Evolving An Information Systems Capstone Course To Align With The Fast Changing Singapore Marketplace, Chris Boesch, Benjamin Kok Siew Gan

Research Collection School Of Computing and Information Systems

Every year, around fifty-five undergraduate teams of four to six students are required to complete a capstone course for the School of Information Systems at Singapore Management University. Each team spends approximately five months working with an industry sponsor using the latest tools and techniques. Students actively learn by implementing the system to solve a real world problem. In addition to delivering value to the local sponsor, our students learn specialized skills currently needed in the marketplace, which might not yet be incorporated into electives and core courses. In this paper, we discuss the tradeoffs of providing students and project …

Towards More Accurate Content Categorization Of Api Discussions, Bo Zhou, Xin Xia, David Lo, Cong Tian, Xinyu Wang

Research Collection School Of Computing and Information Systems

Nowadays, software developers often discuss the usage of various APIs in online forums. Automatically assigning pre-defined semantic categorizes to API discussions in these forums could help manage the data in online forums, and assist developers to search for useful information. We refer to this process as content categorization of API discussions. To solve this problem, Hou and Mo proposed the usage of naive Bayes multinomial, which is an effective classification algorithm. In this paper, we propose a Cache-bAsed compoSitE algorithm, short formed as CASE, to automatically categorize API discussions. Considering that the content of an API discussion contains both textual …

Fully Secure Key-Policy Attribute-Based Encryption With Constant-Size Ciphertexts And Fast Decryption, Junzuo Lai, Robert H. Deng, Yingjiu Li, Jian Weng

Research Collection School Of Computing and Information Systems

Attribute-based encryption (ABE), introduced by Sahai and Waters, is a promising cryptographic primitive, which has been widely applied to implement fine-grained access control system for encrypted data. In its key-policy flavor, attribute sets are used to annotate ciphertexts and secret keys are associated with access structures that specify which ciphertexts a user is entitled to decrypt. In most existing key-policy attribute-based encryption (KP-ABE) constructions, the size of the ciphertext is proportional to the number of attributes associated with it and the decryption cost is proportional to the number of attributes used during decryption. In this paper, we present a new …

Air Indexing For On-Demand Xml Data Broadcast, Weiwei Sun, Rongrui Qin, Jinjin Wu, Baihua Zheng

Research Collection School Of Computing and Information Systems

XML data broadcast is an efficient way to disseminate semi-structured information in wireless mobile environments. In this paper, we propose a novel two-tier index structure to facilitate the access of XML document in an on-demand broadcast system. It provides the clients with an overall image of all the XML documents available at the server side and hence enables the clients to locate complete result sets accordingly. A pruning strategy is developed to cut down the index size and a two-tier structure is proposed to further remove any redundant information. In addition, two index distribution strategies, namely naive distribution and partial …

Socio-Physical Analytics: Challenges & Opportunities, Archan Misra, Kasthuri Jayarajah, Shriguru Nayak, Philips Kokoh Prasetyo, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

In this paper, we argue for expanded research into an area called Socio-Physical Analytics, that focuses on combining the behavioral insight gained from mobile-sensing based monitoring of physical behavior with the inter-personal relationships and preferences deduced from online social networks. We highlight some of the research challenges in combining these heterogeneous data sources and then describe some examples of our ongoing work (based on real-world data being collected at SMU) that illustrate two aspects of socio-physical analytics: (a) how additional demographic and online analytics based attributes can potentially provide better insights into the preferences and behaviors of individuals or groups …

Bootstrapping Simulation-Based Algorithms With A Suboptimal Policy, Nguyen T., Silander T., Lee W., Tze-Yun Leong

Research Collection School Of Computing and Information Systems

Finding optimal policies for Markov Decision Processes with large state spaces is in general intractable. Nonetheless, simulation-based algorithms inspired by Sparse Sampling (SS) such as Upper Confidence Bound applied in Trees (UCT) and Forward Search Sparse Sampling (FSSS) have been shown to perform reasonably well in both theory and practice, despite the high computational demand. To improve the efficiency of these algorithms, we adopt a simple enhancement technique with a heuristic policy to speed up the selection of optimal actions. The general method, called Aux, augments the look-ahead tree with auxiliary arms that are evaluated by the heuristic policy. In …

On Modeling Brand Preferences In Item Adoptions, Minh Duc Luu, Ee Peng Lim, Freddy Chong-Tat Chua

Research Collection School Of Computing and Information Systems

In marketing and advertising, developing and managingbrands value represent the core activities performedby companies. Successful brands attract buyers andadopters, which in turn increase the companies’ value.Given a set of user-item adoption data, can we inferbrand effects from users adopting items? To answerthis question, we develop the Brand Item Topic Model(BITM) that incorporates users’ brand preferences inthe process of item adoption by the users. We evaluateour model using synthetic and two real world datasetsagainst baseline models which do not consider brand effects.The results show that BITM can determine userswho demonstrate brand preferences and predict itemadoptions more accurately.

Hydra: Large-Scale Social Identity Linkage Via Heterogeneous Behavior Modeling, Siyuan Liu, Shuhui Wang, Feida Zhu, Jinbo Zhang, Ramayya Krishnan

Research Collection School Of Computing and Information Systems

We study the problem of large-scale social identity linkage across different social media platforms, which is of critical importance to business intelligence by gaining from social data a deeper understanding and more accurate profiling of users. This paper proposes HYDRA, a solution framework which consists of three key steps: (I) modeling heterogeneous behavior by long-term behavior distribution analysis and multi-resolution temporal information matching; (II) constructing structural consistency graph to measure the high-order structure consistency on users' core social structures across different platforms; and (III) learning the mapping function by multi-objective optimization composed of both the supervised learning on pair-wise ID …

The Case For Human-Centric Personal Analytics, Youngki Lee, Rajesh Krishna Balan

Research Collection School Of Computing and Information Systems

The rich context provided by smartphones has enabled many new context-aware applications. However, these applications still need to provide their own mechanisms to interpret low-level sensing data and generate high-level user states. In this paper, we propose the idea of building a personal analytics (PA) layer that will use inputs from multiple lower layer sources, such as sensor data (accelerometers, gyroscopes, etc.), phone data (call logs, application activity, etc.), and online sources (Twitter, Facebook posts, etc.) to generate high-level user contextual states (such as emotions, preferences, and engagements). Developers can then use the PA layer to easily build a new …

Version History, Similar Report, And Structure: Putting Them Together For Improved Bug Localization, Shaowei Wang, David Lo

Research Collection School Of Computing and Information Systems

During the evolution of a software system, a large number of bug reports are submitted. Locating the source code files that need to be fixed to resolve the bugs is a challenging problem. Thus, there is a need for a technique that can automatically figure out these buggy files. A number of bug localization solutions that take in a bug report and output a ranked list of files sorted based on their likelihood to be buggy have been proposed in the literature. However, the accuracy of these tools still need to be improved. In this paper, to address this need, …

Condensing Class Diagrams By Analyzing Design And Network Metrics Using Optimistic Classification, Ferdian Thung, David Lo, Mohd Hafeez Osman, Michel R.V. Chaudron

Research Collection School Of Computing and Information Systems

A class diagram of a software system enhances our ability to understand software design. However, this diagram is often unavailable. Developers usually reconstruct the diagram by reverse engineering it from source code. Unfortunately, the resultant diagram is often very cluttered; making it difficult to learn anything valuable from it. Thus, it would be very beneficial if we are able to condense the reverse- engineered class diagram to contain only the important classes depicting the overall design of a software system. Such diagram would make program understanding much easier. A class can be important, for example, if its removal would break …

Cross-Language Bug Localization, Xin Xia, David Lo, Xingen Wang, Chenyi Zhang, Xinyu Wang

Research Collection School Of Computing and Information Systems

Bug localization refers to the process of identifying source code files that contain defects from textual descriptions in bug reports. Existing bug localization techniques work on the assumption that bug reports, and identifiers and comments in source code files, are written in the same language (i.e., English). However, software users from non-English speaking countries (e.g., China) often use their native languages (e.g., Chinese) to write bug reports. For this setting, existing studies on bug localization would not work as the terms that appear in the bug reports do not appear in the source code. We refer to this problem as …

An Air Index For Spatial Query Processing In Road Networks, Weiwei Sun, Chunan Chen, Baihua Zheng, Chong Chen, Peng Liu

Research Collection School Of Computing and Information Systems

Spatial queries such as range query and kNN query in road networks have received a growing number of attention in real life. Considering the large population of the users and the high overhead of network distance computation, it is extremely important to guarantee the efficiency and scalability of query processing. Motivated by the scalable and secure properties of wireless broadcast model, this paper presents an air index called Network Partition Index (NPI) to support efficient spatial query processing in road networks via wireless broadcast. The main idea is to partition the road network into a number of regions and then …

On Efficient Reverse Skyline Query Processing, Yunjun Gao, Qing Liu, Baihua Zheng, Gang Chen

Research Collection School Of Computing and Information Systems

Given a D-dimensional data set P and a query point q, a reverse skyline query (RSQ) returns all the data objects in P whose dynamic skyline contains q. It is important for many real life applications such as business planning and environmental monitoring. Currently, the state-of-the-art algorithm for answering the RSQ is the reverse skyline using skyline approximations (RSSA) algorithm, which is based on the precomputed approximations of the skylines. Although RSSA has some desirable features, e.g., applicability to arbitrary data distributions and dimensions, it needs for multiple accesses of the same nodes, incurring redundant I/O and CPU costs. In …

Revisiting Risk-Sensitive Mdps: New Algorithms And Results, Ping Hou, William Yeoh, Pradeep Reddy Varakantham

Research Collection School Of Computing and Information Systems

While Markov Decision Processes (MDPs) have been shown to be effective models for planning under uncertainty, theobjective to minimize the expected cumulative cost is inappropriate for high-stake planning problems. As such, Yu, Lin, and Yan (1998) introduced the Risk-Sensitive MDP (RSMDP) model, where the objective is to find a policy that maximizes the probability that the cumulative cost is within some user-defined cost threshold. In this paper, we revisit this problem and introduce new algorithms that are based on classical techniques, such as depth-first search and dynamic programming, and a recently introduced technique called Topological Value Iteration (TVI). We demonstrate …

Global Immutable Region Computation, Jilian Zhang, Kyriakos Mouratidis, Hwee Hwa Pang

Research Collection School Of Computing and Information Systems

A top-k query shortlists the k records in a dataset that best match the user's preferences. To indicate her preferences, the user typically determines a numeric weight for each data dimension (i.e., attribute). We refer to these weights collectively as the query vector. Based on this vector, each data record is implicitly mapped to a score value (via a weighted sum function). The records with the k largest scores are reported as the result. In this paper we propose an auxiliary feature to standard top-k query processing. Specifically, we compute the maximal locus within which the query vector incurs no …

Graph-Based Semi-Supervised Learning: Realizing Pointwise Smoothness Probabilistically, Yuan Fang, Kevin Chen-Chuan Chang, Hady W. Lauw

Research Collection School Of Computing and Information Systems

As the central notion in semi-supervised learning, smoothness is often realized on a graph representation of the data. In this paper, we study two complementary dimensions of smoothness: its pointwise nature and probabilistic modeling. While no existing graph-based work exploits them in conjunction, we encompass both in a novel framework of Probabilistic Graph-based Pointwise Smoothness (PGP), building upon two foundational models of data closeness and label coupling. This new form of smoothness axiomatizes a set of probability constraints, which ultimately enables class prediction. Theoretically, we provide an error and robustness analysis of PGP. Empirically, we conduct extensive experiments to show …

Daisy Filter Flow: A Generalized Discrete Approach To Dense Correspondences, Hongsheng Yang, Wen-Yan Lin, Jiangbo Lu

Research Collection School Of Computing and Information Systems

No abstract provided.

Does Latitude Hurt While Longitude Kills? Geographical And Temporal Separation In A Large Scale Software Development Project, Patrick Wagstrom, Subhajit Datta

Research Collection School Of Computing and Information Systems

Distributed software development allows firms to leverage cost advantages and place work near centers of competency. This distribution comes at a cost -- distributed teams face challenges from differing cultures, skill levels, and a lack of shared working hours. In this paper we examine whether and how geographic and temporal separation in a large scale distributed software development influences developer interactions. We mine the work item trackers for a large commercial software project with a globally distributed development team. We examine both the time to respond and the propensity of individuals to respond and find that when taken together, geographic …

Paths Of Influence For Innovations In Financial Is And Technology Ecosystems, Jun Liu, Robert John Kauffman, Dan Ma

Research Collection School Of Computing and Information Systems

Predicting technological innovations in financial information systems (IS) and technology ecosystems has been challenging for technology forecasters and industry analysts due to their underlying complexity. Technology-based financial innovations over the past four decades, such as programmed trading in the 1980s, risk-adjusted return on capital-based financial risk management systems in the 1990s, high-frequency trading and Internet banking in 2000s, and now mobile payments in the 2010s, have all led to transformations in the financial services industry. What basis can be identified to predict such new innovations? And what areas of financial services will they affect? This study applies the technology ecosystem …

Technology Investment Decision-Making Under Uncertainty In Mobile Payment Systems, Robert J. Kauffman, Jun Liu, Dan Ma

Research Collection School Of Computing and Information Systems

Innovations in the mobile payments industry provide potentially profitable investment opportunities for banks. Nonetheless, significant uncertainties are associated with decision-making for this IT investment context, regarding future market conditions, technology standards, and consumer and merchant responses, especially their willingness to adopt. As a result, traditional capital budgeting approach and experienced intuition have not been effective. We develop a model to support a bank’s mobile payment systems adoption decision-making at the firm level when it faces endogenous technological risks and exogenous market conditions. This study applies theory and modeling from financial economics for decision-making under uncertainty to investments in m-payment systems …