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

Physical Sciences and Mathematics Commons

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

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 3541 - 3570 of 6829

Full-Text Articles in Physical Sciences and Mathematics

Demo: Drumming Application Using Commodity Wearable Devices, Bharat Dwivedi, Archan Misra, Youngki Lee Jun 2016

Demo: Drumming Application Using Commodity Wearable Devices, Bharat Dwivedi, Archan Misra, Youngki Lee

Research Collection School Of Computing and Information Systems

We aim to develop a drumming application in which individual can play drums using multiple wearable and mobile devices. Our vision is to tap out different rythms in the air using smart watches as a virtual drum stick and smart phone would act as a drum kit. Same user interface can be visualized in smart glasses. Here, our prime target is to use multiple commodity wearable devices (non-commodity i.e. Myo arm band) and smart phones for recognizing new (or same type of here) types of multi limb gestural context and building an adaptive application interface and allow such gesture recognition …


Demo: Gpu-Based Image Recognition And Object Detection On Commodity Mobile Devices, Loc Nguyen Huynh, Rajesh Krishna Balan, Youngki Lee Jun 2016

Demo: Gpu-Based Image Recognition And Object Detection On Commodity Mobile Devices, Loc Nguyen Huynh, Rajesh Krishna Balan, Youngki Lee

Research Collection School Of Computing and Information Systems

In this demo, we show that it is feasible to execute CNN for vision sensing tasks directly on mobile devices by leveraging integrated GPU. We propose our design of DeepSense framework based on OpenCL to execute deep learning algorithms in energy-efficient and fast manner.


Strategic Planning For Setting Up Base Stations In Emergency Medical Systems, Supriyo Ghosh, Pradeep Varakantham Jun 2016

Strategic Planning For Setting Up Base Stations In Emergency Medical Systems, Supriyo Ghosh, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

Emergency Medical Systems (EMSs) are an important component of public health-care services. Improving infrastructure for EMS and specifically the construction of base stations at the ”right” locations to reduce response times is the main focus of this paper. This is a computationally challenging task because of the: (a) exponentially large action space arising from having to consider combinations of potential base locations, which themselves can be significant; and (b) direct impact on the performance of the ambulance allocation problem, where we decide allocation of ambulances to bases. We present an incremental greedy approach to discover the placement of bases that …


Robust Partial Order Schedules For Rcpsp/Max With Durational Uncertainty, Na Fu, Pradeep Varakantham, Hoong Chuin Lau Jun 2016

Robust Partial Order Schedules For Rcpsp/Max With Durational Uncertainty, Na Fu, Pradeep Varakantham, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

In this work, we consider RCPSP/max with durational uncertainty. We focus on computing robust Partial Order Schedules (or, in short POS) which can be executed with risk controlled feasibility and optimality, i.e., there is stochastic posteriori quality guarantee that the derived POS can be executed with all constraints honored and completion before robust makespan. To address this problem, we propose BACCHUS: a solution method on Benders Accelerated Cut Creation for Handling Uncertainty in Scheduling. In our proposed approach, we first give an MILP formulation for the deterministic RCPSP/max and partition the model into POS generation process and start time schedule …


Poster: A Device-Free Evaluation System For Gymnastics Using Passive Rfid Tags, Binbin Xie, Jie Xiong, Dingyi Fang, Xiaojiang Chen, Anwen Wang, Zhanyong Tang Jun 2016

Poster: A Device-Free Evaluation System For Gymnastics Using Passive Rfid Tags, Binbin Xie, Jie Xiong, Dingyi Fang, Xiaojiang Chen, Anwen Wang, Zhanyong Tang

Research Collection School Of Computing and Information Systems

No abstract provided.


Demo: Ta$Ker: Campus-Scale Mobile Crowd-Tasking Platform, Nikita Jaiman, Thivya Kandappu, Randy Tandriansyah, Archan Misra Jun 2016

Demo: Ta$Ker: Campus-Scale Mobile Crowd-Tasking Platform, Nikita Jaiman, Thivya Kandappu, Randy Tandriansyah, Archan Misra

Research Collection School Of Computing and Information Systems

We design and develop TA$Ker, a real-world mobile crowd- sourcing platform to empirically study the worker responses to various task recommendation and selection strategies.


Poster: Air Quality Friendly Route Recommendation System, Savina Singla, Divya Bansal, Archan Misra Jun 2016

Poster: Air Quality Friendly Route Recommendation System, Savina Singla, Divya Bansal, Archan Misra

Research Collection School Of Computing and Information Systems

To model the overall personal inhalation of hazardous gases through the air (both indoor and outdoor) by an individual, provide air quality friendly route recommendations, thus raising the overall quality of urban movement and living healthy life.


Exemplar-Driven Top-Down Saliency Detection Via Deep Association, Shengfeng He, Rynson W. H. Lau, Qingxiong Yang Jun 2016

Exemplar-Driven Top-Down Saliency Detection Via Deep Association, Shengfeng He, Rynson W. H. Lau, Qingxiong Yang

Research Collection School Of Computing and Information Systems

Top-down saliency detection is a knowledge-driven search task. While some previous methods aim to learn this "knowledge" from category-specific data, others transfer existing annotations in a large dataset through appearance matching. In contrast, we propose in this paper a locateby-exemplar strategy. This approach is challenging, as we only use a few exemplars (up to 4) and the appearances among the query object and the exemplars can be very different. To address it, we design a two-stage deep model to learn the intra-class association between the exemplars and query objects. The first stage is for learning object-to-object association, and the second …


Event Detection With Zero Example: Select The Right And Suppress The Wrong Concepts, Yi-Jie Lu, Hao Zhang, Maaike De Boer, Chong-Wah Ngo Jun 2016

Event Detection With Zero Example: Select The Right And Suppress The Wrong Concepts, Yi-Jie Lu, Hao Zhang, Maaike De Boer, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Complex video event detection without visual examples is a very challenging issue in multimedia retrieval. We present a state-of-the-art framework for event search without any need of exemplar videos and textual metadata in search corpus. To perform event search given only query words, the core of our framework is a large, pre-built bank of concept detectors which can understand the content of a video in the perspective of object, scene, action and activity concepts. Leveraging such knowledge can effectively narrow the semantic gap between textual query and the visual content of videos. Besides the large concept bank, this paper focuses …


Demo: Wearable Application To Manage Problem Behavior In Children With Neurodevelopmental Disorders, Camellia Zakaria, Richard C. Davis Jun 2016

Demo: Wearable Application To Manage Problem Behavior In Children With Neurodevelopmental Disorders, Camellia Zakaria, Richard C. Davis

Research Collection School Of Computing and Information Systems

Managing problem behaviors in children with neurodevelopmental disorders can be challenging. Such behaviors may discourage social participation and learning. Many of these behaviors warrant intervention, however, are challenging for caregivers to constantly supervise. Previous work focused on developing recognition systems for stereotypical and aggressive behaviors. Researchers also developed visualization interface for caregivers to better understand their child’s needs. Our goal however, is to design an independent behavior management application to help children manage problem behaviors with minimal supervision.We conducted a field study at a school for children with special needs in Singapore, and interviewed ten teachers. This study helped us …


Poster: Android Whole-System Control Flow Analysis For Accurate Application Behavior Modeling, Huu Hoang Nguyen Jun 2016

Poster: Android Whole-System Control Flow Analysis For Accurate Application Behavior Modeling, Huu Hoang Nguyen

Research Collection School Of Computing and Information Systems

Android, the modern operating system for smartphones, together with its millions of apps, has become an important part of human life. There are many challenges to analyzing them. It is important to model the mobile systems in order to analyze the behaviors of apps accurately. These apps are built on top of interactions with Android systems. We aim to automatically build abstract models of the mobile systems and thus automate the analysis of mobile applications and detect potential issues (e.g., leaking private data, causing unexpected crashes, etc.). The expected results will be the accuracy models of actual various versions of …


Poster: Improving Communication And Communicability With Smarter Use Of Text-Based Messages On Mobile And Wearable Devices, Kenny T. W. Choo Jun 2016

Poster: Improving Communication And Communicability With Smarter Use Of Text-Based Messages On Mobile And Wearable Devices, Kenny T. W. Choo

Research Collection School Of Computing and Information Systems

While smartphones have undoubtedly afforded many modern conveniences such as emails, instant messaging or web search, the notifications from smartphones conversely impact our lives through a deluge of information, or stress arising from expectations that we should turn our immediate attention to them (e.g., work emails). In my latest research, we find that the glanceability of smartwatches may provide an opportunity to reduce the perceived disruption from mobile notifications. Text is a common medium for communication in smart devices, the application of natural language processing on text, together with the physical affordances of smartwatches, present exciting opportunities for research to …


Adaptable Key-Policy Attribute-Based Encryption With Time Interval, Siqi Ma, Junzuo Lai, Deng, Robert H., Xuhua Ding Jun 2016

Adaptable Key-Policy Attribute-Based Encryption With Time Interval, Siqi Ma, Junzuo Lai, Deng, Robert H., Xuhua Ding

Research Collection School Of Computing and Information Systems

In this paper, we introduce a new cryptographic primitive: adaptable KP-ABE with time interval (KP-TIABE), which is an extension of key-policy attribute-based encryption (KP-ABE). Adaptable KP-TIABE specifies a decryption time interval for every ciphertext such that the ciphertext can only be decrypted within this time interval. To be more flexible, the decryption time interval associated with a ciphertext can be adjusted on demand by a semi-trusted server. We propose a formal model for adaptable KP-TIABE, present a concrete adaptable KP-TIABE scheme and prove its security under the security model.


Towards Secure Online Distribution Of Multimedia Codestreams, Swee Won Lo May 2016

Towards Secure Online Distribution Of Multimedia Codestreams, Swee Won Lo

Dissertations and Theses Collection (Open Access)

Multimedia codestreams distributed through open and insecure networks are subjected to attacks such as malicious content tampering and unauthorized accesses. This dissertation first addresses the issue of authentication as a mean to integrity - protect multimedia codestreams against malicious tampering. Two cryptographic-based authentication schemes are proposed to authenticate generic scalable video codestreams with a multi-layered structure. The first scheme combines the salient features of hash-chaining and double error correction coding to achieve loss resiliency with low communication overhead and proxy-transparency. The second scheme further improves computation cost by replacing digital signature with a hash-based message authentication code to achieve packet-level …


Graph-Aided Directed Testing Of Android Applications For Checking Runtime Privacy Behaviours, Joseph Joo Keng Chan, Lingxiao Jiang, Kiat Wee Tan, Rajesh Krishna Balan May 2016

Graph-Aided Directed Testing Of Android Applications For Checking Runtime Privacy Behaviours, Joseph Joo Keng Chan, Lingxiao Jiang, Kiat Wee Tan, Rajesh Krishna Balan

Research Collection School Of Computing and Information Systems

While automated testing of mobile applications is very useful for checking run-time behaviours and specifications, its capability in discovering issues in apps is often limited in practice due to long testing time. A common practice is to randomly and exhaustively explore the whole app test space, which takes a lot of time and resource to achieve good coverage and reach targeted parts of the apps. In this paper, we present MAMBA, a directed testing system for checking privacy in Android apps. MAMBA performs path searches of user events in control-flow graphs of callbacks generated from static analysis of app bytecode. …


Learning To Rank For Bug Report Assignee Recommendation, Yuan Tian, Withthige Dinusha Ruchira Wijedasa, David Lo, Claire Le Goues May 2016

Learning To Rank For Bug Report Assignee Recommendation, Yuan Tian, Withthige Dinusha Ruchira Wijedasa, David Lo, Claire Le Goues

Research Collection School Of Computing and Information Systems

Projects receive a large number of bug reports, and resolving these reports take considerable time and human resources. To aid developers in the resolution of bug reports, various automated techniques have been proposed to identify and recommend developers to address newly reported bugs. Two families of bug assignee recommendation techniques include those that recommend developers who have fixed similar bugs before (a.k.a. activity-based techniques) and those recommend suitable developers based on the location of the bug (a.k.a. location-based techniques). Previously, each of these techniques has been investigated separately. In this work, we propose a unified model that combines information from …


Professor Pang Hwee Hwa Appointed Dean Of Smu School Of Information Systems, Singapore Management University May 2016

Professor Pang Hwee Hwa Appointed Dean Of Smu School Of Information Systems, Singapore Management University

SMU Press Releases

The Singapore Management University (SMU) has announced today the appointment of Professor Pang Hwee Hwa as the next Dean of the SMU School of Information Systems (SIS) with effect from 1 July 2016 for a term of five years. Selected from a global pool of candidates after an extensive and rigorous global search which started in October 2015, Prof Pang’s strong commitment to research in information systems and a passion for excellence in education, make him the ideal candidate to lead the School of Information Systems.


From Lights Out To Lights On, Ravi Chidambaram May 2016

From Lights Out To Lights On, Ravi Chidambaram

Asian Management Insights

How Sunlabob went from providing affordable, sustainable energy in rural Laos to becoming an international turnkey operator and co-developer.


Semantic Proximity Search On Graphs With Metagraph-Based Learning, Yuan Fang, Wenqing Lin, Vincent W. Zheng, Min Wu, Kevin Chen-Chuan Chang, Xiao-Li Li May 2016

Semantic Proximity Search On Graphs With Metagraph-Based Learning, Yuan Fang, Wenqing Lin, Vincent W. Zheng, Min Wu, Kevin Chen-Chuan Chang, Xiao-Li Li

Research Collection School Of Computing and Information Systems

Given ubiquitous graph data such as the Web and social networks, proximity search on graphs has been an active research topic. The task boils down to measuring the proximity between two nodes on a graph. Although most earlier studies deal with homogeneous or bipartite graphs only, many real-world graphs are heterogeneous with objects of various types, giving rise to different semantic classes of proximity. For instance, on a social network two users can be close for different reasons, such as being classmates or family members, which represent two distinct classes of proximity. Thus, it becomes inadequate to only measure a …


A Multimethod Approach Towards Assessing Urban Flood Patterns And Its Associated Vulnerabilities In Singapore, Winston T. L. Chow, Brendan D. Cheong, Beatrice H. Ho May 2016

A Multimethod Approach Towards Assessing Urban Flood Patterns And Its Associated Vulnerabilities In Singapore, Winston T. L. Chow, Brendan D. Cheong, Beatrice H. Ho

Research Collection School of Social Sciences

We investigated flooding patterns in the urbanised city-state of Singapore through a multimethod approach combining station precipitation data with archival newspaper and governmental records; changes in flash floods frequencies or reported impacts of floods towards Singapore society were documented. We subsequently discussed potential flooding impacts in the context of urban vulnerability, based on future urbanisation and forecasted precipitation projections for Singapore. We find that, despite effective flood management, (i) significant increases in reported flash flood frequency occurred in contemporary (post-2000) relative to preceding (1984–1999) periods, (ii) these flash floods coincide with more localised, “patchy” storm events, (iii) storms in recent …


Anonymous Identity-Based Broadcast Encryption With Chosen-Ciphertext Security, Kai He, Jian Weng, Jia-Nan Liu, Joseph K. Liu, Wei Liu, Deng, Robert H. May 2016

Anonymous Identity-Based Broadcast Encryption With Chosen-Ciphertext Security, Kai He, Jian Weng, Jia-Nan Liu, Joseph K. Liu, Wei Liu, Deng, Robert H.

Research Collection School Of Computing and Information Systems

In this paper, we propose the first identity-based broadcast encryption scheme, which can simultaneously achieves confidentiality and full anonymity against adaptive chosen-ciphertext attacks under a standard assumption. In addition, two further desirable features are also provided: one is fully-collusion resistant which means that even if all users outside of receivers S collude they cannot obtain any information about the plaintext. The other one is stateless which means that the users in the system do not need to update their private keys when the other users join or leave our system. In particular, our scheme is highly efficient, where the public …


Efficient Verifiable Computation Of Linear And Quadratic Functions Over Encrypted Data, Ngoc Hieu Tran, Hwee Hwa Pang, Robert H. Deng May 2016

Efficient Verifiable Computation Of Linear And Quadratic Functions Over Encrypted Data, Ngoc Hieu Tran, Hwee Hwa Pang, Robert H. Deng

Research Collection School Of Computing and Information Systems

In data outsourcing, a client stores a large amount of data on an untrusted server; subsequently, the client can request the server to compute a function on any subset of the data. This setting naturally leads to two security requirements: confidentiality of input data, and authenticity of computations. Existing approaches that satisfy both requirements simultaneously are built on fully homomorphic encryption, which involves expensive computation on the server and client and hence is impractical. In this paper, we propose two verifiable homomorphic encryption schemes that do not rely on fully homomorphic encryption. The first is a simple and efficient scheme …


Simultaneous Optimization And Sampling Of Agent Trajectories Over A Network, Hala Mostafa, Akshat Kumar, Hoong Chuin Lau May 2016

Simultaneous Optimization And Sampling Of Agent Trajectories Over A Network, Hala Mostafa, Akshat Kumar, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

We study the problem of optimizing the trajectories of agents moving over a network given their preferences over which nodes to visit subject to operational constraints on the network. In our running example, a theme park manager optimizes which attractions to include in a day-pass to maximize the pass’s appeal to visitors while keeping operational costs within budget. The first challenge in this combinatorial optimization problem is that it involves quantities (expected visit frequencies of each attraction) that cannot be expressed analytically, for which we use the Sample Average Approximation. The second challenge is that while sampling is typically done …


Approximate Inference Using Dc Programming For Collective Graphical Models, Duc Thien Nguyen, Akshat Kumar, Hoong Chuin Lau, Daniel Sheldon May 2016

Approximate Inference Using Dc Programming For Collective Graphical Models, Duc Thien Nguyen, Akshat Kumar, Hoong Chuin Lau, Daniel Sheldon

Research Collection School Of Computing and Information Systems

Collective graphical models (CGMs) provide a framework for reasoning about a population of independent and identically distributed individuals when only noisy and aggregate observations are given. Previous approaches for inference in CGMs work on a junction-tree representation, thereby highly limiting their scalability. To remedy this, we show how the Bethe entropy approximation naturally arises for the inference problem in CGMs. We reformulate the resulting optimization problem as a difference-of-convex functions program that can capture different types of CGM noise models. Using the concave-convex procedure, we then develop a scalable message-passing algorithm. Empirically, our approach is highly scalable and accurate for …


Reinforcement Learning Framework For Modeling Spatial Sequential Decisions Under Uncertainty: (Extended Abstract), Truc Viet Le, Siyuan Liu, Hoong Chuin Lau May 2016

Reinforcement Learning Framework For Modeling Spatial Sequential Decisions Under Uncertainty: (Extended Abstract), Truc Viet Le, Siyuan Liu, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

We consider the problem of trajectory prediction, where a trajectory is an ordered sequence of location visits and corresponding timestamps. The problem arises when an agent makes sequential decisions to visit a set of spatial locations of interest. Each location bears a stochastic utility and the agent has a limited budget to spend. Given the agent's observed partial trajectory, our goal is to predict the remaining trajectory. We propose a solution framework to the problem considering both the uncertainty of utility and the budget constraint. We use reinforcement learning (RL) to model the underlying decision processes and inverse RL to …


Hdidx: High-Dimensional Indexing For Efficient Approximate Nearest Neighbor Search, Ji Wan, Sheng Tang, Yongdong Zhang, Jintao Li, Pengcheng Wu, Steven C. H. Hoi May 2016

Hdidx: High-Dimensional Indexing For Efficient Approximate Nearest Neighbor Search, Ji Wan, Sheng Tang, Yongdong Zhang, Jintao Li, Pengcheng Wu, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

Fast Nearest Neighbor (NN) search is a fundamental challenge in large-scale data processing and analytics, particularly for analyzing multimedia contents which are often of high dimensionality. Instead of using exact NN search, extensive research efforts have been focusing on approximate NN search algorithms. In this work, we present "HDIdx", an efficient high-dimensional indexing library for fast approximate NN search, which is open-source and written in Python. It offers a family of state-of-the-art algorithms that convert input high-dimensional vectors into compact binary codes, making them very efficient and scalable for NN search with very low space complexity.


Online Sparse Passive Aggressive Learning With Kernels, Jing Lu, Peilin Zhao, Hoi, Steven C. H. May 2016

Online Sparse Passive Aggressive Learning With Kernels, Jing Lu, Peilin Zhao, Hoi, Steven C. H.

Research Collection School Of Computing and Information Systems

Conventional online kernel methods often yield an unboundedlarge number of support vectors, making them inefficient and non-scalable forlarge-scale applications. Recent studies on bounded kernel-based onlinelearning have attempted to overcome this shortcoming. Although they can boundthe number of support vectors at each iteration, most of them fail to bound thenumber of support vectors for the final output solution which is often obtainedby averaging the series of solutions over all the iterations. In this paper, wepropose a novel kernel-based online learning method, Sparse Passive Aggressivelearning (SPA), which can output a final solution with a bounded number ofsupport vectors. The key idea of …


Domain-Specific Cross-Language Relevant Question Retrieval, Bowen Xu, Zhenchang Xing, Xin Xia, David Lo, Qingye Wang, Shanping Li May 2016

Domain-Specific Cross-Language Relevant Question Retrieval, Bowen Xu, Zhenchang Xing, Xin Xia, David Lo, Qingye Wang, Shanping Li

Research Collection School Of Computing and Information Systems

In software development process, developers often seek solutions to the technical problems they encounter by searching relevant questions on Q&A sites. When developers fail to find solutions on Q&A sites in their native language (e.g., Chinese), they could translate their query and search on the Q&A sites in another language (e.g., English). However, developers who are non-native English speakers often are not comfortable to ask or search questions in English, as they do not know the proper translation of the Chinese technical words into the English technical words. Furthermore, the process of manually formulating cross-language queries and determining the weight …


Deeper Look Into Bug Fixes: Patterns, Replacements, Deletions, And Additions, Mauricio Soto, Ferdian Thung, Chu-Pan Wong, Claire Le Goues, David Lo May 2016

Deeper Look Into Bug Fixes: Patterns, Replacements, Deletions, And Additions, Mauricio Soto, Ferdian Thung, Chu-Pan Wong, Claire Le Goues, David Lo

Research Collection School Of Computing and Information Systems

Many implementations of research techniques that automatically repair software bugs target programs written in C. Work that targets Java often begins from or compares to direct translations of such techniques to a Java context. However, Java and C are very different languages, and Java should be studied to inform the construction of repair approaches to target it. We conduct a large-scale study of bugfixing commits in Java projects, focusing on assumptions underlying common search-based repair approaches. We make observations that can be leveraged to guide high quality automatic software repair to target Java specifically, including common and uncommon statement modifications …


A Key-Insulated Cp-Abe With Key Exposure Accountability For Secure Data Sharing In The Cloud, Hanshu Hong, Zhixin Sun, Ximeng Liu May 2016

A Key-Insulated Cp-Abe With Key Exposure Accountability For Secure Data Sharing In The Cloud, Hanshu Hong, Zhixin Sun, Ximeng Liu

Research Collection School Of Computing and Information Systems

ABE has become an effective tool for data protection in cloud computing. However, since users possessing the same attributes share the same private keys, there exist some malicious users exposing their private keys deliberately for illegal data sharing without being detected, which will threaten the security of the cloud system. Such issues remain in many current ABE schemes since the private keys are rarely associated with any user specific identifiers. In order to achieve user accountability as well as provide key exposure protection, in this paper, we propose a key-insulated ciphertext policy attribute based encryption with key exposure accountability (KI-CPABE-KEA). …