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

Physical Sciences and Mathematics Commons™

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

2015

Research Collection School Of Computing and Information Systems

Discipline
Keyword

Articles 1 - 30 of 333

Full-Text Articles in Physical Sciences and Mathematics

All Your Sessions Are Belong To Us: Investigating Authenticator Leakage Through Backup Channels On Android, Guangdong Bai, Jun Sun, Jianliang Wu, Quanqi Ye, Li Li, Jin Song Dong, Shanqing Guo Dec 2015

All Your Sessions Are Belong To Us: Investigating Authenticator Leakage Through Backup Channels On Android, Guangdong Bai, Jun Sun, Jianliang Wu, Quanqi Ye, Li Li, Jin Song Dong, Shanqing Guo

Research Collection School Of Computing and Information Systems

Security of authentication protocols heavily relies on the confidentiality of credentials (or authenticators) like passwords and session IDs. However, unlike browser-based web applications for which highly evolved browsers manage the authenticators, Android apps have to construct their own management. We find that most apps simply locate their authenticators into the persistent storage and entrust underlying Android OS for mediation. Consequently, these authenticators can be leaked through compromised backup channels. In this work, we conduct the first systematic investigation on this previously overlooked attack vector. We find that nearly all backup apps on Google Play inadvertently expose backup data to any …

Go to article

Gpu Accelerated On-The-Fly Reachability Checking, Zhimin Wu, Yang Liu, Jun Sun, Jianqi Shi, Shengchao Qin Dec 2015

Gpu Accelerated On-The-Fly Reachability Checking, Zhimin Wu, Yang Liu, Jun Sun, Jianqi Shi, Shengchao Qin

Research Collection School Of Computing and Information Systems

Model checking suffers from the infamous state space explosion problem. In this paper, we propose an approach, named GPURC, to utilize the Graphics Processing Units (GPUs) to speed up the reachability verification. The key idea is to achieve a dynamic load balancing so that the many cores in GPUs are fully utilized during the state space exploration.To this end, we firstly construct a compact data encoding of the input transition systems to reduce the memory cost and fit the calculation in GPUs. To support a large number of concurrent components, we propose a multi-integer encoding with conflict-release accessing approach. We …

Go to article

Supercnn: A Superpixelwise Convolutional Neural Network For Salient Object Detection, Shengfeng He, Rynson W.H. Lau, Wenxi Liu, Zhe Huang, Qingxiong Yang Dec 2015

Supercnn: A Superpixelwise Convolutional Neural Network For Salient Object Detection, Shengfeng He, Rynson W.H. Lau, Wenxi Liu, Zhe Huang, Qingxiong Yang

Research Collection School Of Computing and Information Systems

Existing computational models for salient object detection primarily rely on hand-crafted features, which are only able to capture low-level contrast information. In this paper, we learn the hierarchical contrast features by formulating salient object detection as a binary labeling problem using deep learning techniques. A novel superpixelwise convolutional neural network approach, called SuperCNN, is proposed to learn the internal representations of saliency in an efficient manner. In contrast to the classical convolutional networks, SuperCNN has four main properties. First, the proposed method is able to learn the hierarchical contrast features, as it is fed by two meaningful superpixel sequences, which …

Go to article

Mopeye: Monitoring Per-App Network Performance With Zero Measurement Traffic, Daoyuan Wu, Weichao Li, Rocky K. C. Chang, Debin Gao Dec 2015

Mopeye: Monitoring Per-App Network Performance With Zero Measurement Traffic, Daoyuan Wu, Weichao Li, Rocky K. C. Chang, Debin Gao

Research Collection School Of Computing and Information Systems

Mobile network performance measurement is important for understanding mobile user experience, problem diagnosis, and service comparison. A number of crowdsourcing measurement apps (e.g., MobiPerf and Netalyzr) have been embarked for the last few years. Unlike existing apps that use active measurement methods, we employ a novel passive-active approach to continuously monitor per-app network performance on unrooted smartphones without injecting additional network traffic. By leveraging the VpnService API on Android, MopEye, our measurement app, intercepts all network traffic and then relays them to their destinations using socket APIs. Therefore, not only MopEye can measure the round-trip time accurately, it can do …

Go to article

Learning And Controlling Network Diffusion In Dependent Cascade Models, Jiali Du, Pradeep Varakantham, Akshat Kumar, Shih-Fen Cheng Dec 2015

Learning And Controlling Network Diffusion In Dependent Cascade Models, Jiali Du, Pradeep Varakantham, Akshat Kumar, Shih-Fen Cheng

Research Collection School Of Computing and Information Systems

Diffusion processes have increasingly been used to represent flow of ideas, traffic and diseases in networks. Learning and controlling the diffusion dynamics through management actions has been studied extensively in the context of independent cascade models, where diffusion on outgoing edges from a node are independent of each other. Our work, in contrast, addresses (a) learning diffusion taking management actions to alter the diffusion dynamics to achieve a desired outcome in dependent cascade models. A key characteristic of such dependent cascade models is the flow preservation at all nodes in the network. For example, traffic and people flow is preserved …

Go to article

Aesthetic Experience And Acceptance Of Human Computation Games, Xiaohui Wang, Dion Hoe-Lian Goh, Ee-Peng Lim, Adrian Wei Liang Vu Dec 2015

Aesthetic Experience And Acceptance Of Human Computation Games, Xiaohui Wang, Dion Hoe-Lian Goh, Ee-Peng Lim, Adrian Wei Liang Vu

Research Collection School Of Computing and Information Systems

Human computation games (HCGs) are applications that leverage games to solve computational problems that are out reach of the capacity of computers. Game aesthetics are critical for HCG acceptance, and the game elements should motivate users to contribute time and effort. In this paper, we examine the effect of aesthetic experience on intention to use HCGs. A between-subjects experiment was conducted to compare a HCG and a human computation system (HCS). Results demonstrated that HCGs provided a greater sense of aesthetic experience and attracted more intentional usage than HCSs. Implications of this study are discussed.

Go to article

Incremental Dcop Search Algorithms For Solving Dynamic Dcop Problems, William Yeoh, Pradeep Varakantham, Xiaoxun Sun, Sven Koenig Dec 2015

Incremental Dcop Search Algorithms For Solving Dynamic Dcop Problems, William Yeoh, Pradeep Varakantham, Xiaoxun Sun, Sven Koenig

Research Collection School Of Computing and Information Systems

Distributed constraint optimization (DCOP) problems are well-suited for modeling multi-agent coordination problems. However, it only models static problems, which do not change over time. Consequently, researchers have introduced the Dynamic DCOP (DDCOP) model to model dynamic problems. In this paper, we make two key contributions: (a) a procedure to reason with the incremental changes in DDCOPs and (b) an incremental pseudo-tree construction algorithm that can be used by DCOP algorithms such as any-space ADOPT and any-space BnB-ADOPT to solve DDCOPs. Due to the incremental reasoning employed, our experimental results show that any-space ADOPT and any-space BnB-ADOPT are up to 42% …

Go to article

A Bayesian Recommender Model For User Rating And Review Profiling, Mingming Jiang, Dandan Song, Lejian Liao, Feida Zhu Dec 2015

A Bayesian Recommender Model For User Rating And Review Profiling, Mingming Jiang, Dandan Song, Lejian Liao, Feida Zhu

Research Collection School Of Computing and Information Systems

Intuitively, not only do ratings include abundant information for learning user preferences, but also reviews accompanied by ratings. However, most existing recommender systems take rating scores for granted and discard the wealth of information in accompanying reviews. In this paper, in order to exploit user profiles' information embedded in both ratings and reviews exhaustively, we propose a Bayesian model that links a traditional Collaborative Filtering (CF) technique with a topic model seamlessly. By employing a topic model with the review text and aligning user review topics with "user attitudes" (i.e., abstract rating patterns) over the same distribution, our method achieves …

Go to article

Fast Reinforcement Learning Under Uncertainties With Self-Organizing Neural Networks, Teck-Hou Teng, Ah-Hwee Tan Dec 2015

Fast Reinforcement Learning Under Uncertainties With Self-Organizing Neural Networks, Teck-Hou Teng, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Using feedback signals from the environment, a reinforcement learning (RL) system typically discovers action policies that recommend actions effective to the states based on a Q-value function. However, uncertainties over the estimation of the Q-values can delay the convergence of RL. For fast RL convergence by accounting for such uncertainties, this paper proposes several enhancements to the estimation and learning of the Q-value using a self-organizing neural network. Specifically, a temporal difference method known as Q-learning is complemented by a Q-value Polarization procedure, which contrasts the Q-values using feedback signals on the effect of the recommended actions. The polarized Q-values …

Go to article

Coordinated Persuasion With Dynamic Group Formation For Collaborative Elderly Care, Budhitama Subagdja, Ah-Hwee Tan Dec 2015

Coordinated Persuasion With Dynamic Group Formation For Collaborative Elderly Care, Budhitama Subagdja, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Ageing in place demands a new paradigm of inhouse caregiving allowing many aspects of daily lives to be tackled by smart appliances and technologies. The important challenges include the effective provision of recommendations by multiple parties of caregiver constituting changes of the user’s behavior. In this multiagent environment, interdependencies between agents become major issues to tackle. This paper presents an approach of dynamic group formation for autonomous caregiving agents to collaborate in recommending different aspects of well-being. The approach supports the agents to regulate the timing of their recommendations, prevent conflicting messages, and cooperate to make more effective persuasions. A …

Go to article

Learning Query And Image Similarities With Ranking Canonical Correlation Analysis, Ting Yao, Tao Mei, Chong-Wah Ngo Dec 2015

Learning Query And Image Similarities With Ranking Canonical Correlation Analysis, Ting Yao, Tao Mei, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

One of the fundamental problems in image search is to learn the ranking functions, i.e., similarity between the query and image. The research on this topic has evolved through two paradigms: feature-based vector model and image ranker learning. The former relies on the image surrounding texts, while the latter learns a ranker based on human labeled query-image pairs. Each of the paradigms has its own limitation. The vector model is sensitive to the quality of text descriptions, and the learning paradigm is difficult to be scaled up as human labeling is always too expensive to obtain. We demonstrate in this …

Go to article

Adaptive Scaling Of Cluster Boundaries For Large-Scale Social Media Data Clustering, Lei Meng, Ah-Hwee Tan, Donald C. Wunsch Dec 2015

Adaptive Scaling Of Cluster Boundaries For Large-Scale Social Media Data Clustering, Lei Meng, Ah-Hwee Tan, Donald C. Wunsch

Research Collection School Of Computing and Information Systems

The large scale and complex nature of social media data raises the need to scale clustering techniques to big data and make them capable of automatically identifying data clusters with few empirical settings. In this paper, we present our investigation and three algorithms based on the fuzzy adaptive resonance theory (Fuzzy ART) that have linear computational complexity, use a single parameter, i.e., the vigilance parameter to identify data clusters, and are robust to modest parameter settings. The contribution of this paper lies in two aspects. First, we theoretically demonstrate how complement coding, commonly known as a normalization method, changes the …

Go to article

Mylife: An Online Personal Memory Album, Di Wang, Ah-Hwee Tan Dec 2015

Mylife: An Online Personal Memory Album, Di Wang, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

In this demo, we illustrate the formation, retrieval, and playback of autobiographical memory in an online personal memory album named MyLife. The memory in MyLife consists of pictorial snapshots of one's life together with the associated context, namely time, location, people, activity, imagery, and emotion. MyLife allows direct import of memories from other online personal photo repositories. For memory retrieval, users can use not only exact cues, but also partial, vague, inaccurate, and random ones. The retrieved memories are then played back as a movie-like slide show with various visual effects and background music. MyLife holds high potential in both …

Go to article

Preface: Wi 2015, Ah-Hwee Tan, Yuefeng Li, Ee-Peng Lim, Jie Zhang, Dell Zhang, Julita Vassileva Dec 2015

Preface: Wi 2015, Ah-Hwee Tan, Yuefeng Li, Ee-Peng Lim, Jie Zhang, Dell Zhang, Julita Vassileva

Research Collection School Of Computing and Information Systems

This volume contains the papers selected for presentation at the 2015 IEEE/WIC/ACM International Conference on Web Intelligence (WI’15), which was held from 6 to 9 December 2015 in Singapore, a city which welcomes people from different parts of the world to work and play. Following the tradition of WI conference in previous years, WI’15 was collocated with 2015 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT’15). Both WI’15 and IAT’15 were sponsored by the IEEE Computer Society, Web Intelligence Consortium (WIC), Association for Computing Machinery (ACM), and the Memetic Computing Society. The two collocated conferences were hosted by the Joint …

Go to article

Silver Assistants For Aging-In-Place, Di Wang, Budhitama Subagdja, Yilin Kang, Ah-Hwee Tan Dec 2015

Silver Assistants For Aging-In-Place, Di Wang, Budhitama Subagdja, Yilin Kang, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

In this demo, we present an assembly of silver assistants for supporting Aging-In-Place (AIP). The virtual agents are designed to serve around the clock to complement human care within the intelligent home environment. Residing in different platforms with ubiquitous access, the agents collaboratively provide holistic care to the elderly users. The demonstration is shown in a 3-D virtual home replicating a typical 5-room apartment in Singapore. Sensory inputs are stored in a knowledge base named Situation Awareness Model (SAM). Therefore, the capabilities of the agents can always be extended by expanding the knowledge defined in SAM. Using the simulation system, …

Go to article

Non-Intrusive Robust Human Activity Recognition For Diverse Age Groups, Di Wang, Ah-Hwee Tan, Daqing Zhang Dec 2015

Non-Intrusive Robust Human Activity Recognition For Diverse Age Groups, Di Wang, Ah-Hwee Tan, Daqing Zhang

Research Collection School Of Computing and Information Systems

—Many elderly prefer to live independently at their own homes. However, how to use modern technologies to ensure their safety presents vast challenges and opportunities. Being able to non-intrusively sense the activities performed by the elderly definitely has great advantages in various circumstances. Non-intrusive activity recognition can be performed using the embedded sensors in modern smartphones. However, not many activity recognition models are robust enough that allow the subjects to carry the smartphones in different pockets with unrestricted orientations and varying deviations. Moreover, to the best of our knowledge, no existing literature studied the difference between the youth and the …

Go to article

On The Unreliability Of Bug Severity Data, Yuan Tian, Nasir Ali, David Lo, Ahmed E. Hassan Dec 2015

On The Unreliability Of Bug Severity Data, Yuan Tian, Nasir Ali, David Lo, Ahmed E. Hassan

Research Collection School Of Computing and Information Systems

Severity levels, e.g., critical and minor, of bugs are often used to prioritize development efforts. Prior research efforts have proposed approaches to automatically assign the severity label to a bug report. All prior efforts verify the accuracy of their approaches using human-assigned bug reports data that is stored in software repositories. However, all prior efforts assume that such human-assigned data is reliable. Hence a perfect automated approach should be able to assign the same severity label as in the repository – achieving a 100% accuracy. Looking at duplicate bug reports (i.e., reports referring to the same problem) from three open-source …

Go to article

Capstone Projects Mining System For Insights And Recommendations, Melvrivk Aik Chun Goh, Swapna Gottipati, Venky Shankararaman Dec 2015

Capstone Projects Mining System For Insights And Recommendations, Melvrivk Aik Chun Goh, Swapna Gottipati, Venky Shankararaman

Research Collection School Of Computing and Information Systems

In this paper, we present a classification based system to discover knowledge and trends in higher education students’ projects. Essentially, the educational capstone projects provide an opportunity for students to apply what they have learned and prepare themselves for industry needs. Therefore mining such projects gives insights of students’ experiences as well as industry project requirements and trends. In particular, we mine capstone projects executed by Information Systems students to discover patterns and insights related to people, organization, domain, industry needs and time. We build a capstone projects mining system (CPMS) based on classification models that leverage text mining, natural …

Go to article

Incorporating Analytics Into A Business Process Modelling Course, Gottipati Swapna, Shankararaman, Venky Dec 2015

Incorporating Analytics Into A Business Process Modelling Course, Gottipati Swapna, Shankararaman, Venky

Research Collection School Of Computing and Information Systems

Embedding analytics is about integrating data analytics into operational systems that are part of an organization’s business processes. Currently, most organizations focus on automation business processes and enhancing productivity. However, going forward, in order to stay competitive, organizations have to go beyond automating their processes, by making them more intelligent, by embedding analytics into their processes and business applications. Therefore, there is need for enhancing the knowledge and skills of BPM professionals with know-how on improving a business process by embedding analytics into the workflow. In this paper contribution, the authors share their experience on how an existing process modelling, …

Go to article

Differentially Private Subspace Clustering, Yining Wang, Yu-Xiang Wang, Aarti Singh Dec 2015

Differentially Private Subspace Clustering, Yining Wang, Yu-Xiang Wang, Aarti Singh

Research Collection School Of Computing and Information Systems

Subspace clustering is an unsupervised learning problem that aims at grouping data points into multiple “clusters” so that data points in a single cluster lie approximately on a low-dimensional linear subspace. It is originally motivated by 3D motion segmentation in computer vision, but has recently been generically applied to a wide range of statistical machine learning problems, which often involves sensitive datasets about human subjects. This raises a dire concern for data privacy. In this work, we build on the framework of differential privacy and present two provably private subspace clustering algorithms. We demonstrate via both theory and experiments that …

Go to article

Adaptive Duty Cycling In Sensor Networks With Energy Harvesting Using Continuous-Time Markov Chain And Fluid Models, Ronald Wai Hong Chan, Pengfei Zhang, Ido Nevat, Sai Ganesh Nagarajan, Alvin Cerdena Valera, Hwee Xian Tan Dec 2015

Adaptive Duty Cycling In Sensor Networks With Energy Harvesting Using Continuous-Time Markov Chain And Fluid Models, Ronald Wai Hong Chan, Pengfei Zhang, Ido Nevat, Sai Ganesh Nagarajan, Alvin Cerdena Valera, Hwee Xian Tan

Research Collection School Of Computing and Information Systems

The dynamic and unpredictable nature of energy harvesting sources available for wireless sensor networks, and the time variation in network statistics like packet transmission rates and link qualities, necessitate the use of adaptive duty cycling techniques. Such adaptive control allows sensor nodes to achieve long-run energy neutrality, where energy supply and demand are balanced in a dynamic environment such that the nodes function continuously. In this paper, we develop a new framework enabling an adaptive duty cycling scheme for sensor networks that takes into account the node battery level, ambient energy that can be harvested, and application-level QoS requirements. We …

Go to article

Content-Based Visual Landmark Search Via Multimodal Hypergraph Learning, Lei Zhu, Jialie Shen, Hai Jin, Ran Zheng, Liang Xie Dec 2015

Content-Based Visual Landmark Search Via Multimodal Hypergraph Learning, Lei Zhu, Jialie Shen, Hai Jin, Ran Zheng, Liang Xie

Research Collection School Of Computing and Information Systems

While content-based landmark image search has recently received a lot of attention and became a very active domain, it still remains a challenging problem. Among the various reasons, high diverse visual content is the most significant one. It is common that for the same landmark, images with a wide range of visual appearances can be found from different sources and different landmarks may share very similar sets of images. As a consequence, it is very hard to accurately estimate the similarities between the landmarks purely based on single type of visual feature. Moreover, the relationships between landmark images can be …

Go to article

Robust Execution Strategies For Project Scheduling With Unreliable Resources And Stochastic Durations, Na Fu, Hoong Chuin Lau, Pradeep Varakantham Dec 2015

Robust Execution Strategies For Project Scheduling With Unreliable Resources And Stochastic Durations, Na Fu, Hoong Chuin Lau, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

The resource-constrained project scheduling problem with minimum and maximum time lags (RCPSP/max) is a general model for resource scheduling in many real-world problems (such as manufacturing and construction engineering). We consider RCPSP/max problems where the durations of activities are stochastic and resources can have unforeseen breakdowns. Given a level of allowable risk, (Formula presented.), our mechanisms aim to compute the minimum robust makespan execution strategy. Robust makespan for an execution strategy is any makespan value that has a risk less than (Formula presented.). The risk for a makespan value, (Formula presented.) given an execution strategy, is the probability that a …

Go to article

Modeling Social Media Content With Word Vectors For Recommendation, Ying Ding, Jing Jiang Dec 2015

Modeling Social Media Content With Word Vectors For Recommendation, Ying Ding, Jing Jiang

Research Collection School Of Computing and Information Systems

In social media, recommender systems are becoming more and more important. Different techniques have been designed for recommendations under various scenarios, but many of them do not use user-generated content, which potentially reflects users’ opinions and interests. Although a few studies have tried to combine user-generated content with rating or adoption data, they mostly reply on lexical similarity to calculate textual similarity. However, in social media, a diverse range of words is used. This renders the traditional ways of calculating textual similarity ineffective. In this work, we apply vector representation of words to measure the semantic similarity between text. We …

Go to article

A Misspecification Test For Logit Based Route Choice Models, Tien Mai, Emma Frejinger, Fabian Bastin Dec 2015

A Misspecification Test For Logit Based Route Choice Models, Tien Mai, Emma Frejinger, Fabian Bastin

Research Collection School Of Computing and Information Systems

The multinomial logit (MNL) model is often used for analyzing route choices in real networks in spite of the fact that path utilities are believed to be correlated. Yet, statistical tests for model misspecification are rarely used. This paper shows how the information matrix test for model misspecification proposed byWhite (1982) can be applied to test path-based and link-based MNL route choice models.We present a Monte Carlo experiment using simulated data to assess the size and the power of the test and to compare its performance with the IIA (Hausman and McFadden, 1984) and McFadden–Train Lagrange multiplier (McFadden and Train, …

Go to article

On Top-K Selection In Multi-Armed Bandits And Hidden Bipartite Graphs, Wei Cao, Jian Li, Yufei Tao, Zhize Li Dec 2015

On Top-K Selection In Multi-Armed Bandits And Hidden Bipartite Graphs, Wei Cao, Jian Li, Yufei Tao, Zhize Li

Research Collection School Of Computing and Information Systems

This paper discusses how to efficiently choose from $n$ unknown distributions the $k$ ones whose means are the greatest by a certain metric, up to a small relative error. We study the topic under two standard settings---multi-armed bandits and hidden bipartite graphs---which differ in the nature of the input distributions. In the former setting, each distribution can be sampled (in the i.i.d. manner) an arbitrary number of times, whereas in the latter, each distribution is defined on a population of a finite size $m$ (and hence, is fully revealed after m samples). For both settings, we prove lower bounds on …

Go to article

Active Crowdsourcing For Annotation, Shuji Hao, Chunyan Miao, Steven C. H. Hoi, Peilin Zhao Dec 2015

Active Crowdsourcing For Annotation, Shuji Hao, Chunyan Miao, Steven C. H. Hoi, Peilin Zhao

Research Collection School Of Computing and Information Systems

Crowdsourcing has shown great potential in obtaining large-scale and cheap labels for different tasks. However, obtaining reliable labels is challenging due to several reasons, such as noisy annotators, limited budget and so on. The state-of-the-art approaches, either suffer in some noisy scenarios, or rely on unlimited resources to acquire reliable labels. In this article, we adopt the learning with expert~(AKA worker in crowdsourcing) advice framework to robustly infer accurate labels by considering the reliability of each worker. However, in order to accurately predict the reliability of each worker, traditional learning with expert advice will consult with external oracles~(AKA domain experts) …

Go to article

A Benchmark And Comparative Study Of Video-Based Face Recognition On Cox Face Database, Zhiwu Huang, S. Shan, R. Wang, H. Zhang, S. Lao, A. Kuerban, X. Chen Dec 2015

A Benchmark And Comparative Study Of Video-Based Face Recognition On Cox Face Database, Zhiwu Huang, S. Shan, R. Wang, H. Zhang, S. Lao, A. Kuerban, X. Chen

Research Collection School Of Computing and Information Systems

Face recognition with still face images has been widely studied, while the research on video-based face recognition is inadequate relatively, especially in terms of benchmark datasets and comparisons. Real-world video-based face recognition applications require techniques for three distinct scenarios: 1) Videoto-Still (V2S); 2) Still-to-Video (S2V); and 3) Video-to-Video (V2V), respectively, taking video or still image as query or target. To the best of our knowledge, few datasets and evaluation protocols have benchmarked for all the three scenarios. In order to facilitate the study of this specific topic, this paper contributes a benchmarking and comparative study based on a newly collected …

Go to article

Progressive Sequence Matching For Adl Plan Recommendation, Shan Gao, Di Wang, Ah-Hwee Tan, Chunyan Miao Dec 2015

Progressive Sequence Matching For Adl Plan Recommendation, Shan Gao, Di Wang, Ah-Hwee Tan, Chunyan Miao

Research Collection School Of Computing and Information Systems

Activities of Daily Living (ADLs) are indicatives of a person’s lifestyle. In particular, daily ADL routines closely relate to a person’s well-being. With the objective of promoting active lifestyles, this paper presents an agent system that provides recommendations of suitable ADL plans (i.e., selected ADL sequences) to individual users based on the more active lifestyles of the others. Specifically, we develop a set of quantitative measures, named wellness scores, spanning the evaluation across the physical, cognitive, emotion, and social aspects based on his or her ADL routines. Then we propose an ADL sequence learning model, named Recommendation ADL ART, or …

Go to article

Bring-Your-Own-Application (Byoa): Optimal Stochastic Application Migration In Mobile Cloud Computing, Jonathan David Chase, Dusit Niyato, Sivadon Chaisiri Dec 2015

Bring-Your-Own-Application (Byoa): Optimal Stochastic Application Migration In Mobile Cloud Computing, Jonathan David Chase, Dusit Niyato, Sivadon Chaisiri

Research Collection School Of Computing and Information Systems

The increasing popularity of using mobile devices in a work context, has led to the need to be able to support more powerful computation. Users no longer remain in an office or at home to conduct their activities, preferring libraries and cafes. In this paper, we consider a mobile cloud computing scenario in which users bring their own mobile devices and are offered a variety of equipment, e.g., desktop computer, smart- TV, or projector, to migrate their applications to, so as to save battery life, improve usability and performance. We formulate a stochastic optimization problem to optimize the allocation of …

Go to article

Next Last