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

Computer Sciences Commons™

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year
File Type

Articles 5281 - 5310 of 8479

Full-Text Articles in Computer Sciences

Lossy Projective Hashing And Its Applications, Haiyang Xue, Yamin Liu, Xianhui Lu, Bao Li Dec 2015

Lossy Projective Hashing And Its Applications, Haiyang Xue, Yamin Liu, Xianhui Lu, Bao Li

Research Collection School Of Computing and Information Systems

In this paper, we introduce a primitive called lossy projective hashing. It is unknown before whether smooth projective hashing (Cramer-Shoup, Eurocrypt’02) can be constructed from dual projective hashing (Wee, Eurocrypt’12). The lossy projective hashing builds a bridge between dual projective hashing and smooth projective hashing. We give instantiations of lossy projective hashing from DDH, DCR, QR and general subgroup membership assumptions (including 2k-th residue, p-subgroup and higher residue assumptions). We also show how to construct lossy encryption and fully IND secure deterministic public key encryption from lossy projective hashing. – We give a construction of lossy projective hashing via dual …


Flow Experience In Virtual Worlds: Individuals Versus Dyads, Fiona Fui-Hoon Nah, Brenda Eschenbrenner Dec 2015

Flow Experience In Virtual Worlds: Individuals Versus Dyads, Fiona Fui-Hoon Nah, Brenda Eschenbrenner

Research Collection School Of Computing and Information Systems

Flow is a state of mind in which one is deeply absorbed and immersed in an activity to the point where nothing else matters. Although flow can occur in solitary and social contexts, which context fosters greater flow is unclear. Consistent with self-determination theory, dyads working collaboratively achieved higher states of flow than individuals working alone. In other words, dyads achieved higher states of focused concentration and experienced greater temporal dissociation than individuals working alone. Surprisingly and contradictory to previous findings, dyads did not experience greater enjoyment than individuals working alone. We attributed this surprising finding to the hedonic nature …


Understanding Psychophysiological Correlates Of User Experience Using Electroencephalogram (Eeg), Fiona Fui-Hoon Nah, Keng Siau, Randall Minas, Nathan W. Twyman, Nicholas A. Rollins, Wenbo Wang, Xi Wang Dec 2015

Understanding Psychophysiological Correlates Of User Experience Using Electroencephalogram (Eeg), Fiona Fui-Hoon Nah, Keng Siau, Randall Minas, Nathan W. Twyman, Nicholas A. Rollins, Wenbo Wang, Xi Wang

Research Collection School Of Computing and Information Systems

The objective of this research is to understand psychophysiological correlates of user experience using electroencephalogram (EEG). We will conduct an experimental study to assess the psychophysiological differences across three states of user experience – flow, boredom, and anxiety – and compare them with the neutral state as a baseline. EEG measurement provides a plethora of data that can be decomposed using different analytical procedures. We will utilize one type of analysis, timefrequency decomposition, to examine changes in frequency (e.g., alpha/beta/theta band) over time. These frequency bands correlate with different cognitive states. In this study, we will use Event Related Spectral …


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 …


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 …


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 …


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 …


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 …


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, …


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 …


An Adaptive Markov Strategy For Effective Network Intrusion Detection, Jianye Hao, Yinxing Xue, Mahinthan Chandramohan, Yang Liu, Jun Sun Nov 2015

An Adaptive Markov Strategy For Effective Network Intrusion Detection, Jianye Hao, Yinxing Xue, Mahinthan Chandramohan, Yang Liu, Jun Sun

Research Collection School Of Computing and Information Systems

Network monitoring is an important way to ensure the security of hosts from being attacked by malicious attackers. One challenging problem for network operators is how to distribute the limited monitoring resources (e.g., intrusion detectors) among the network to detect attacks effectively, especially when the attacking strategies can be changing dynamically and unpredictable. To this end, we adopt Markov game to model the interactions between the network operator and the attacker and propose an adaptive Markov strategy (AMS) to determine how the detectors should be placed on the network against possible attacks to minimize the network’s accumulated cost over time. …


Security Slicing For Auditing Xml, Xpath, And Sql Injection Vulnerabilities, Julian Thome, Lwin Khin Shar, Lionel Briand Nov 2015

Security Slicing For Auditing Xml, Xpath, And Sql Injection Vulnerabilities, Julian Thome, Lwin Khin Shar, Lionel Briand

Research Collection School Of Computing and Information Systems

XML, XPath, and SQL injection vulnerabilities are among the most common and serious security issues for Web applications and Web services. Thus, it is important for security auditors to ensure that the implemented code is, to the extent possible, free from these vulnerabilities before deployment. Although existing taint analysis approaches could automatically detect potential vulnerabilities in source code, they tend to generate many false warnings. Furthermore, the produced traces, i.e. dataflow paths from input sources to security-sensitive operations, tend to be incomplete or to contain a great deal of irrelevant information. Therefore, it is difficult to identify real vulnerabilities and …


Shopminer: Mining Customer Shopping Behavior In Physical Clothing Stores With Passive Rfids, Longfei Shangguan, Zimu Zhou, Xiaolong Zheng, Lei Yang, Yunhao Liu, Jinsong Han Nov 2015

Shopminer: Mining Customer Shopping Behavior In Physical Clothing Stores With Passive Rfids, Longfei Shangguan, Zimu Zhou, Xiaolong Zheng, Lei Yang, Yunhao Liu, Jinsong Han

Research Collection School Of Computing and Information Systems

Shopping behavior data are of great importance to understand the effectiveness of marketing and merchandising efforts. Online clothing stores are capable capturing customer shopping behavior by analyzing the click stream and customer shopping carts. Retailers with physical clothing stores, however, still lack effective methods to identify comprehensive shopping behaviors. In this paper, we show that backscatter signals of passive RFID tags can be exploited to detect and record how customers browse stores, which items of clothes they pay attention to, and which items of clothes they usually match with. The intuition is that the phase readings of tags attached on …


Deep Multimodal Learning For Affective Analysis And Retrieval, Lei Pang, Shiai Zhu, Chong-Wah Ngo Nov 2015

Deep Multimodal Learning For Affective Analysis And Retrieval, Lei Pang, Shiai Zhu, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Social media has been a convenient platform for voicing opinions through posting messages, ranging from tweeting a short text to uploading a media file, or any combination of messages. Understanding the perceived emotions inherently underlying these user-generated contents (UGC) could bring light to emerging applications such as advertising and media analytics. Existing research efforts on affective computation are mostly dedicated to single media, either text captions or visual content. Few attempts for combined analysis of multiple media are made, despite that emotion can be viewed as an expression of multimodal experience. In this paper, we explore the learning of highly …


Human Action Recognition In Unconstrained Videos By Explicit Motion Modeling, Yu-Gang Jiang, Qi Dai, Wei Liu, Xiangyang Xue, Chong-Wah Ngo Nov 2015

Human Action Recognition In Unconstrained Videos By Explicit Motion Modeling, Yu-Gang Jiang, Qi Dai, Wei Liu, Xiangyang Xue, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Human action recognition in unconstrained videos is a challenging problem with many applications. Most state-of-the-art approaches adopted the well-known bag-of-features representations, generated based on isolated local patches or patch trajectories, where motion patterns, such as object-object and object-background relationships are mostly discarded. In this paper, we propose a simple representation aiming at modeling these motion relationships. We adopt global and local reference points to explicitly characterize motion information, so that the final representation is more robust to camera movements, which widely exist in unconstrained videos. Our approach operates on the top of visual codewords generated on dense local patch trajectories, …


Direct Or Indirect Match? Selecting Right Concepts For Zero-Example Case, Yi-Jie Lu, Maaike De Boer, Hao Zhang, Klamer Schutte, Wessel Kraaij, Chong-Wah Ngo Nov 2015

Direct Or Indirect Match? Selecting Right Concepts For Zero-Example Case, Yi-Jie Lu, Maaike De Boer, Hao Zhang, Klamer Schutte, Wessel Kraaij, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

No abstract provided.


Vireo-Tno @ Trecvid 2015: Multimedia Event Detection, Hao Zhang, Yi-Jie Lu, Maaike De Boer, Frank Ter Haar, Zhaofan Qiu, Klamer Schutte, Wessel Kraaij, Chong-Wah Ngo Nov 2015

Vireo-Tno @ Trecvid 2015: Multimedia Event Detection, Hao Zhang, Yi-Jie Lu, Maaike De Boer, Frank Ter Haar, Zhaofan Qiu, Klamer Schutte, Wessel Kraaij, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

This paper presents an overview and comparative analysis of our systems designed for the TRECVID 2015 [1] multimedia event detection (MED) task. We submitted 17 runs, of which 5 each for the zeroexample, 10-example and 100-example subtasks for the Pre-Specified (PS) event detection and 2 runs for the 10-example subtask for the Ad-Hoc (AH) event detection. We did not participate in the Interactive Run. This year we focus on three different parts of the MED task: 1) extending the size of our concept bank and combining it with improved dense trajectories; 2) exploring strategies for semantic query generation (SQG); and …


Multimedia Event Detection: Strong By Integration, Hao Zhang, Maaike De Boer, Yi-Jie Lu, Klamer Schutte, Chong-Wah Ngo, Chong-Wah Ngo Nov 2015

Multimedia Event Detection: Strong By Integration, Hao Zhang, Maaike De Boer, Yi-Jie Lu, Klamer Schutte, Chong-Wah Ngo, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

No abstract provided.


Whom Should We Sense In 'Social Sensing' - Analyzing Which Users Work Best For Social Media Now-Casting, Jisun An, Ingmar Weber Nov 2015

Whom Should We Sense In 'Social Sensing' - Analyzing Which Users Work Best For Social Media Now-Casting, Jisun An, Ingmar Weber

Research Collection School Of Computing and Information Systems

Given the ever increasing amount of publicly available social media data, there is growing interest in using online data to study and quantify phenomena in the offline 'real' world. As social media data can be obtained in near real-time and at low cost, it is often used for 'now-casting' indices such as levels of flu activity or unemployment. The term 'social sensing' is often used in this context to describe the idea that users act as 'sensors', publicly reporting their health status or job losses. Sensor activity during a time period is then typically aggregated in a 'one tweet, one …


Interpolation Guided Compositional Verification, Shang-Wei Lin, Jun Sun, Truong Khanh Nguyen, Yang Liu, Jin Song Dong Nov 2015

Interpolation Guided Compositional Verification, Shang-Wei Lin, Jun Sun, Truong Khanh Nguyen, Yang Liu, Jin Song Dong

Research Collection School Of Computing and Information Systems

Model checking suffers from the state space explosion problem. Compositional verification techniques such as assume-guarantee reasoning (AGR) have been proposed to alleviate the problem. However, there are at least three challenges in applying AGR. Firstly, given a system M1 M2, how do we automatically construct and refine (in the presence of spurious counterexamples) an assumption A2, which must be an abstraction of M2? Previous approaches suggest to incrementally learn and modify the assumption through multiple invocations of a model checker, which could be often time consuming. Secondly, how do we keep the state space small when checking M1 A2 |= …


Event Detection In Wireless Sensor Networks In Random Spatial Sensors Deployments, Pengfei Zhang, Ido Nevat, Gareth W. Peters, Gaoxi Xiao, Hwee-Pink Tan Nov 2015

Event Detection In Wireless Sensor Networks In Random Spatial Sensors Deployments, Pengfei Zhang, Ido Nevat, Gareth W. Peters, Gaoxi Xiao, Hwee-Pink Tan

Research Collection School Of Computing and Information Systems

We develop a new class of event detection algorithms in Wireless Sensor Networks where the sensors are randomly deployed spatially. We formulate the detection problem as a binary hypothesis testing problem and design the optimal decision rules for two scenarios, namely the Poisson Point Process and Binomial Point Process random deployments. To calculate the intractable marginal likelihood density, we develop three types of series expansion methods which are based on an Askey-orthogonal polynomials. In addition, we develop a novel framework to provide guidance on which series expansion is most suitable (i.e., most accurate) to use for different system parameters. Extensive …


A Passive Testing Approach For Protocols In Wireless Sensor Networks, Xiaoping Che, Stephane Maag, Hwee Xian Tan, Hwee-Pink Tan, Zhangbing Zhou Nov 2015

A Passive Testing Approach For Protocols In Wireless Sensor Networks, Xiaoping Che, Stephane Maag, Hwee Xian Tan, Hwee-Pink Tan, Zhangbing Zhou

Research Collection School Of Computing and Information Systems

Smart systems are today increasingly developed with the number of wireless sensor devices drastically increasing. They are implemented within several contexts throughout our environment. Thus, sensed data transported in ubiquitous systems are important, and the way to carry them must be efficient and reliable. For that purpose, several routing protocols have been proposed for wireless sensor networks (WSN). However, one stage that is often neglected before their deployment is the conformance testing process, a cruicial and challenging step. Compared to active testing techniques commonly used in wired networks, passive approaches are more suitable to the WSN environment. While some works …


Stack Layout Randomization With Minimal Rewriting Of Android Binaries, Yu Liang, Xinjie Ma, Daoyuan Wu, Xiaoxiao Tang, Debin Gao, Guojun Peng, Chunfu Jia, Huanguo Zhang Nov 2015

Stack Layout Randomization With Minimal Rewriting Of Android Binaries, Yu Liang, Xinjie Ma, Daoyuan Wu, Xiaoxiao Tang, Debin Gao, Guojun Peng, Chunfu Jia, Huanguo Zhang

Research Collection School Of Computing and Information Systems

Stack-based attacks typically require that attackers have a good understanding of the stack layout of the victim program. In this paper, we leverage specific features on ARM architecture and propose a practical technique that introduces randomness to the stack layout when an Android application executes. We employ minimal binary rewriting on the Android app that produces randomized executable of the same size which can be executed on an unmodified Android operating system. Our experiments on applying this randomization on the most popular 20 free Android apps on Google Play show that the randomization coverage of functions increases from 65% (by …


Cost-Sensitive Online Classification With Adaptive Regularization And Its Applications, Peilin Zhao, Furen Zhuang, Min Wu, Xiao-Li Li, Hoi, Steven C. H. Nov 2015

Cost-Sensitive Online Classification With Adaptive Regularization And Its Applications, Peilin Zhao, Furen Zhuang, Min Wu, Xiao-Li Li, Hoi, Steven C. H.

Research Collection School Of Computing and Information Systems

Cost-Sensitive Online Classification is recently proposed to directly online optimize two well-known cost-sensitive measures: (i) maximization of weighted sum of sensitivity and specificity, and (ii) minimization of weighted misclassification cost. However, the previous existing learning algorithms only utilized the first order information of the data stream. This is insufficient, as recent studies have proved that incorporating second order information could yield significant improvements on the prediction model. Hence, we propose a novel cost-sensitive online classification algorithm with adaptive regularization. We theoretically analyzed the proposed algorithm and empirically validated its effectiveness with extensive experiments. We also demonstrate the application of the …


Cnl: Collective Network Linkage Across Heterogeneous Social Platforms, Ming Gao, Ee-Peng Lim, David Lo, Feida Zhu, Philips Kokoh Prasetyo, Aoying Zhou Nov 2015

Cnl: Collective Network Linkage Across Heterogeneous Social Platforms, Ming Gao, Ee-Peng Lim, David Lo, Feida Zhu, Philips Kokoh Prasetyo, Aoying Zhou

Research Collection School Of Computing and Information Systems

The popularity of social media has led many users to create accounts with different online social networks. Identifying these multiple accounts belonging to same user is of critical importance to user profiling, community detection, user behavior understanding and product recommendation. Nevertheless, linking users across heterogeneous social networks is challenging due to large network sizes, heterogeneous user attributes and behaviors in different networks, and noises in user generated data. In this paper, we propose an unsupervised method, Collective Network Linkage (CNL), to link users across heterogeneous social networks. CNL incorporates heterogeneous attributes and social features unique to social network users, handles …


Experience Report: An Industrial Experience Report On Test Outsourcing Practices, Xin Xia, David Lo, Pavneet Singh Kochhar, Zhenchang Xing, Xinyu Wang, Shanping Li Nov 2015

Experience Report: An Industrial Experience Report On Test Outsourcing Practices, Xin Xia, David Lo, Pavneet Singh Kochhar, Zhenchang Xing, Xinyu Wang, Shanping Li

Research Collection School Of Computing and Information Systems

Nowadays, many companies contract their testing functionalities out to third-party IT outsourcing companies. This process referred to as test outsourcing is common in the industry, yet it is rarely studied in the research community. In this paper, to bridge the gap, we performed an empirical study on test outsourcing with 10 interviewees and 140 survey respondents. We investigated various research questions such as the types, the process, and the challenges of test outsourcing, and the differences between test outsourcing and in-house testing. We found customer satisfaction, tight project schedule, and domain unfamiliarity are the top-3 challenges faced by the testers. …


Should Fixing These Failures Be Delegated To Automated Program Repair?, Le Dinh Xuan Bach, Le Bui Tien Duy, David Lo Nov 2015

Should Fixing These Failures Be Delegated To Automated Program Repair?, Le Dinh Xuan Bach, Le Bui Tien Duy, David Lo

Research Collection School Of Computing and Information Systems

Program repair constitutes one of the major components of software maintenance that usually incurs a significant cost in software production. Automated program repair is supposed to help in reducing the software maintenance cost by automatically fixing software defects. Despite the recent advances in automated software repair, it is still very costly to wait for repair tools to produce valid repairs of defects. This paper addresses the following question: "Will an automated program repair technique find a repair for a defect within a reasonable time?". To answer this question, we build an oracle that can predict whether fixing a failure should …


Not All Trips Are Equal: Analyzing Foursquare Check-Ins Of Trips And City Visitors, Wen Haw Chong, Bingtian Dai, Ee Peng Lim Nov 2015

Not All Trips Are Equal: Analyzing Foursquare Check-Ins Of Trips And City Visitors, Wen Haw Chong, Bingtian Dai, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Location-Based Social Networks (LBSN) such as Foursquare allow users to indicate venue visits via check-ins. This results in much fine grained context-rich data, useful for studying user mobility. In this work, we use check-ins to characterize trips and visitors to two cities, where visitors are defined as having their home cities elsewhere. First, we divide trips into two duration types: long and short. We then show that trip types differ in check-in distributions over venue categories, time slots, as well as check-in intensity. Based on the trip types, we then divide visitors into long-term and short-term visitors. We compare visitor …


Real-Time Detection Of Seat Occupancy And Hogging, Huy Hoang Nguyen, Nakul Gulati, Youngki Lee, Rajesh Krishna Balan Nov 2015

Real-Time Detection Of Seat Occupancy And Hogging, Huy Hoang Nguyen, Nakul Gulati, Youngki Lee, Rajesh Krishna Balan

Research Collection School Of Computing and Information Systems

In this paper, we propose a cheap and effective solution to detect if specific seats at a shared public table are occupied -- either by humans or by objects (i.e., the seats are being "hogged"). The hogging of seats, in particular, is a big problem for our campus library and required a large amount of manpower to correct (to find and clear hogged seats). We propose using two different cheap sensors, a capacitance sensor and an infrared (IR) sensor, to solve this problem. In the rest of this paper, we show how using these sensors can accurately determine if a …


Powerforecaster: Predicting Smartphone Power Impact Of Continuous Sensing Applications At Pre-Installation Time, Chulhong Min, Youngki Lee, Chungkuk Yoo, Seungwoo Kang, Sangwon Choi, Pillsoon Park, Inseok Hwang, Younghyun Ju, Seungpyo Choi, Junehwa Song Nov 2015

Powerforecaster: Predicting Smartphone Power Impact Of Continuous Sensing Applications At Pre-Installation Time, Chulhong Min, Youngki Lee, Chungkuk Yoo, Seungwoo Kang, Sangwon Choi, Pillsoon Park, Inseok Hwang, Younghyun Ju, Seungpyo Choi, Junehwa Song

Research Collection School Of Computing and Information Systems

Today's smartphone application (hereinafter 'app') markets miss a key piece of information, power consumption of apps. This causes a severe problem for continuous sensing apps as they consume significant power without users' awareness. Users have no choice but to repeatedly install one app after another and experience their power use. To break such an exhaustive cycle, we propose PowerForecaster, a system that provides users with power use of sensing apps at pre-installation time. Such advanced power estimation is extremely challenging since the power cost of a sensing app largely varies with users' physical activities and phone use patterns. We observe …