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

Software Engineering Commons™

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

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type

Articles 1861 - 1890 of 2211

Full-Text Articles in Software Engineering

Toward A Mobile Platform For Pervasive Games, Inseok Hwang, Youngki Lee, Taiwoo Park, Junehwa Song Aug 2012

Toward A Mobile Platform For Pervasive Games, Inseok Hwang, Youngki Lee, Taiwoo Park, Junehwa Song

Research Collection School Of Computing and Information Systems

Emerging pervasive games will be immersed into real-life situations and leverage new types of contextual interactions therein. For instance, a player’s punching gesture, running activity, and fast heart rate conditions can be used as the game inputs. Although the contextual interaction is the core building blocks of pervasive games, individual game developers hardly utilize a rich set of interactions within a game play. Most challenging, it is significantly difficult for developers to expect dynamic availability of input devices in real life, and adapt to the situation without system-level support. Also, it is challenging to coordinate its resource use with other …

Go to article

Improved Bdd-Based Discrete Analysis Of Timed Systems, Truong Khanh Nguyen, Jun Sun, Yang Liu, Jin Song Dong, Yan Liu Aug 2012

Improved Bdd-Based Discrete Analysis Of Timed Systems, Truong Khanh Nguyen, Jun Sun, Yang Liu, Jin Song Dong, Yan Liu

Research Collection School Of Computing and Information Systems

Model checking timed systems through digitization is relatively easy, compared to zone-based approaches. The applicability of digitization, however, is limited mainly for two reasons, i.e., it is only sound for closed timed systems; and clock ticks cause state space explosion. The former is mild as many practical systems are subject to digitization. It has been shown that BDD-based techniques can be used to tackle the latter to some extent. In this work, we significantly improve the existing approaches by keeping the ticks simple in the BDD encoding. Taking advantage of the ‘simple’ nature of clock ticks, we fine-tune the encoding …

Go to article

Automatic Compositional Verification Of Timed Systems, Shang-Wei Lin, Yang Liu, Jun Sun, Jin Song Dong, Étienne André Aug 2012

Automatic Compositional Verification Of Timed Systems, Shang-Wei Lin, Yang Liu, Jun Sun, Jin Song Dong, Étienne André

Research Collection School Of Computing and Information Systems

Specification and verification of real-time systems are important research topics with crucial applications; however, the so-called state space explosion problem often prevents model checking to be used in practice for large systems. In this work, we present a self-contained toolkit to analyze real-time systems specified using event-recording automata (ERAs), which supports system modeling, animated simulation, and fully automatic compositional verification based on learning techniques. Experimental results show that our tool outperforms the state-of-the-art timed model checker.

Go to article

Using Monterey Phoenix To Formalize And Verify System Architectures, Jiexin Zhang, Yang Liu, Mikhail Auguston, Jun Sun, Jin Song Dong Jul 2012

Using Monterey Phoenix To Formalize And Verify System Architectures, Jiexin Zhang, Yang Liu, Mikhail Auguston, Jun Sun, Jin Song Dong

Research Collection School Of Computing and Information Systems

Modeling and analyzing software architectures are useful for helping to understand the system structures and facilitate proper implementation of user requirements. Despite its importance in the software engineering practice, the lack of formal description and verification support hinders the development of quality architectural models. In this work, we develop an approach for modeling and verifying software architectures specified using Monterey Phoenix (MP) architecture description language. Firstly, we formalize the syntax and operational semantics for MP. This language is capable of modeling system and environment behaviors based on event traces, as well as supporting different architecture composition operations and views. Secondly, …

Go to article

Probabilistic Model Checking Multi-Agent Behaviors In Dispersion Games Using Counter Abstraction, Jianye Hao, Songzheng Song, Yang Liu, Jun Sun, Lin Gui, Jin Song Dong, Ho-Fung Leung Jul 2012

Probabilistic Model Checking Multi-Agent Behaviors In Dispersion Games Using Counter Abstraction, Jianye Hao, Songzheng Song, Yang Liu, Jun Sun, Lin Gui, Jin Song Dong, Ho-Fung Leung

Research Collection School Of Computing and Information Systems

Accurate analysis of the stochastic dynamics of multi-agent system is important but challenging. Probabilistic model checking, a formal technique for analysing a system which exhibits stochastic behaviors, can be a natural solution to analyse multi-agent systems. In this paper, we investigate this problem in the context of dispersion games focusing on two strategies: basic simple strategy (BSS) and extended simple strategies (ESS). We model the system using discrete-time Markov chain (DTMC) and reduce the state space of the models by applying counter abstraction technique. Two important properties of the system are considered: convergence and convergence rate. We show that these …

Go to article

Formal Analysis Of Pervasive Computing Systems, Yan Liu, Xian Zhang, Jin Song Dong, Yang Liu, Jun Sun, Jit Biswas, Mounir Mokhtari Jul 2012

Formal Analysis Of Pervasive Computing Systems, Yan Liu, Xian Zhang, Jin Song Dong, Yang Liu, Jun Sun, Jit Biswas, Mounir Mokhtari

Research Collection School Of Computing and Information Systems

Pervasive computing systems are heterogenous and complex as they usually involve human activities, various sensors and actuators as well as middleware for system controlling. Therefore, analyzing such systems is highly nontrivial. In this work, we propose to use formal methods for analyzing pervasive computing systems. Firstly, a formal modeling framework is proposed to cover the main characteristics of pervasive computing systems (e.g., context-awareness, concurrent communications, layered architectures). Secondly, we identify the safety requirements (e.g., free of deadlocks and conflicts etc.) and propose their specifications as safety and liveness properties. Finally, we demonstrate our ideas using a case study of a …

Go to article

A Model Checker For Hierarchical Probabilistic Real-Time Systems, Songzheng Song, Jun Sun, Yang Liu, Jin Song Dong Jul 2012

A Model Checker For Hierarchical Probabilistic Real-Time Systems, Songzheng Song, Jun Sun, Yang Liu, Jin Song Dong

Research Collection School Of Computing and Information Systems

Real-life systems are usually hard to control, due to their complicated structures, quantitative time factors and even stochastic behaviors. In this work, we present a model checker to analyze hierarchical probabilistic real-time systems. A modeling language called PRTS is used to specify such systems, and automatic zone-abstraction approach, which is probability preserving, is used to generate finite state MDP. We have implemented PRTS in model checking framework PAT so that friendly user interface can be used to edit, simulate and verify PRTS models. Some experiments are conducted to show our tool’s efficiency.

Go to article

Parameter Synthesis For Hierarchical Concurrent Real-Time Systems, Étienne André, Yang Liu, Jun Sun, Jin Song Dong Jul 2012

Parameter Synthesis For Hierarchical Concurrent Real-Time Systems, Étienne André, Yang Liu, Jun Sun, Jin Song Dong

Research Collection School Of Computing and Information Systems

Modeling and verifying complex real-time systems, involving timing delays, are notoriously difficult problems. Checking the correctness of a system for one particular value for each delay does not give any information for other values. It is hence interesting to reason parametrically, by considering that the delays are parameters (unknown constants) and synthesize a constraint guaranteeing a correct behavior. We present here Parametric Stateful Timed CSP, a language capable of specifying hierarchical real-time systems with complex data structures. Although we prove that the synthesis is undecidable in general, we present an algorithm for efficient parameter synthesis that behaves well in practice.

Go to article

Translating Pddl Into Csp# - The Pat Approach, Yi Li, Jing Sun, Jin Song Dong, Yang Liu, Jun Sun Jul 2012

Translating Pddl Into Csp# - The Pat Approach, Yi Li, Jing Sun, Jin Song Dong, Yang Liu, Jun Sun

Research Collection School Of Computing and Information Systems

Model checking provides a way to automatically verify hardware and software systems, whereas the goal of planning is to produce a sequence of actions that leads from the initial state to the desired goal state. Recently research indicates that there is a strong connection between model checking and planning problem solving. In this paper, we investigate the feasibility of using a newly developed model checking framework, Process Analysis Toolkit (PAT), to serve as a planning solution provider for upper layer applications. We first carried out a number of experiments on different planning tools in order to compare their performance and …

Go to article

Mydeal: The Context-Aware Urban Shopping Assistant, Kartik Muralidharan, Swapna Gottipati, Jing Jiang, Narayan Ramasubbu, Rajesh Krishna Balan Jul 2012

Mydeal: The Context-Aware Urban Shopping Assistant, Kartik Muralidharan, Swapna Gottipati, Jing Jiang, Narayan Ramasubbu, Rajesh Krishna Balan

Research Collection School Of Computing and Information Systems

A common problem in large Urban cities, of the sort seen in Asia, is the huge number of retail options available in the city. In particular, it is not uncommon to find multiple malls, each with hundreds of stores inside, just a short distance from each other in almost every part of these cities. These factors make it incredibly hard for consumers to identify stores of interest to them in any particular mall.In response, a number of shopping assistance applications have been created for mobile phones.However, these applications mostly just allow users to know which stores are where or to …

Go to article

Mining Input Sanitization Patterns For Predicting Sql Injection And Cross Site Scripting Vulnerabilities, Lwin Khin Shar, Hee Beng Kuan Tan Jun 2012

Mining Input Sanitization Patterns For Predicting Sql Injection And Cross Site Scripting Vulnerabilities, Lwin Khin Shar, Hee Beng Kuan Tan

Research Collection School Of Computing and Information Systems

Static code attributes such as lines of code and cyclomatic complexity have been shown to be useful indicators of defects in software modules. As web applications adopt input sanitization routines to prevent web security risks, static code attributes that represent the characteristics of these routines may be useful for predicting web application vulnerabilities. In this paper, we classify various input sanitization methods into different types and propose a set of static code attributes that represent these types. Then we use data mining methods to predict SQL injection and cross site scripting vulnerabilities in web applications. Preliminary experiments show that our …

Go to article

Analyzing Multi-Agent Systems With Probabilistic Model Checking Approach, Songzheng Song, Jianye Hao, Yang Liu, Jun Sun, Ho-Fung Leung, Jin Song Dong Jun 2012

Analyzing Multi-Agent Systems With Probabilistic Model Checking Approach, Songzheng Song, Jianye Hao, Yang Liu, Jun Sun, Ho-Fung Leung, Jin Song Dong

Research Collection School Of Computing and Information Systems

Multi-agent systems, which are composed of autonomous agents, have been successfully employed as a modeling paradigm in many scenarios. However, it is challenging to guarantee the correctness of their behaviors due to the complex nature of the autonomous agents, especially when they have stochastic characteristics. In this work, we propose to apply probabilistic model checking to analyze multi-agent systems. A modeling language called PMA is defined to specify such kind of systems, and LTL property and logic of knowledge combined with probabilistic requirements are supported to analyze system behaviors. Initial evaluation indicates the effectiveness of our current progress; meanwhile some …

Go to article

Resource-Aware Video Multicasting Via Access Gateways In Wireless Mesh Networks, Wanqing Tu, Cormac Sreenan, Chun Tung Chou, Archan Misra, Sanjay Jha Jun 2012

Resource-Aware Video Multicasting Via Access Gateways In Wireless Mesh Networks, Wanqing Tu, Cormac Sreenan, Chun Tung Chou, Archan Misra, Sanjay Jha

Research Collection School Of Computing and Information Systems

This paper studies video multicasting in large scale areas using wireless mesh networks. The focus is on the use of Internet access gateways that allow a choice of alternative routes to avoid potentially lengthy and low capacity multi-hop wireless paths. A set of heuristic-based algorithms are described that together aim to maximize network capacity: the two-tier integrated architecture algorithm, the weighted gateway uploading algorithm, the link controlled routing tree algorithm, and the dynamic group management algorithm. These algorithms use different approaches to arrange nodes involved in video multicasting into a clustered and two-tier integrated architecture in which network protocols can …

Go to article

Where Should The Bugs Be Fixed? More Accurate Information Retrieval-Based Bug Localization Based On Bug Reports, Jian Zhou, Hongyu Zhang, David Lo Jun 2012

Where Should The Bugs Be Fixed? More Accurate Information Retrieval-Based Bug Localization Based On Bug Reports, Jian Zhou, Hongyu Zhang, David Lo

Research Collection School Of Computing and Information Systems

For a large and evolving software system, the project team could receive a large number of bug reports. Locating the source code files that need to be changed in order to fix the bugs is a challenging task. Once a bug report is received, it is desirable to automatically point out to the files that developers should change in order to fix the bug. In this paper, we propose BugLocator, an information retrieval based method for locating the relevant files for fixing a bug. BugLocator ranks all files based on the textual similarity between the initial bug report and the …

Go to article

Mining Quantified Temporal Rules: Formalism, Algorithms, And Evaluation, David Lo, Ganesan Ramalingam, Venkatesh Prasad Ranganath, Kapil Vaswani Jun 2012

Mining Quantified Temporal Rules: Formalism, Algorithms, And Evaluation, David Lo, Ganesan Ramalingam, Venkatesh Prasad Ranganath, Kapil Vaswani

Research Collection School Of Computing and Information Systems

Libraries usually impose constraints on how clients should use them. Often these constraints are not well-documented. In this paper, we address the problem of recovering such constraints automatically, a problem referred to as specification mining. Given some client programs that use a given library, we identify constraints on the library usage that are (almost) satisfied by the given set of clients.The class of rules we target for mining combines simple binary temporal operators with state predicates (composed of equality constraints) and quantification. This is a simple yet expressive subclass of temporal properties (LTL formulae) that allows us to capture many …

Go to article

Identifying Linux Bug Fixing Patches, Yuan Tian, Julia Lawall, David Lo Jun 2012

Identifying Linux Bug Fixing Patches, Yuan Tian, Julia Lawall, David Lo

Research Collection School Of Computing and Information Systems

In the evolution of an operating system there is a continuing tension between the need to develop and test new features, and the need to provide a stable and secure execution environment to users. A compromise, adopted by the developers of the Linux kernel, is to release new versions, including bug fixes and new features, frequently, while maintaining some older “longterm” versions. This strategy raises the problem of how to identify bug fixing patches that are submitted to the current version but should be applied to the longterm versions as well. The current approach is to rely on the individual …

Go to article

Are Faults Localizable?, Lucia Lucia, Ferdian Thung, David Lo, Lingxiao Jiang Jun 2012

Are Faults Localizable?, Lucia Lucia, Ferdian Thung, David Lo, Lingxiao Jiang

Research Collection School Of Computing and Information Systems

Many fault localization techniques have been proposed to facilitate debugging activities. Most of them attempt to pinpoint the location of faults (i.e., localize faults) based on a set of failing and correct executions and expect debuggers to investigate a certain number of located program elements to find faults. These techniques thus assume that faults are localizable, i.e., only one or a few lines of code that are close to one another are responsible for each fault. However, in reality, are faults localizable? In this work, we investigate hundreds of real faults in several software systems, and find that many faults …

Go to article

Overcoming The Challenges In Cost Estimation For Distributed Software Projects, Narayanasamy Ramasubbu, Rajesh Krishna Balan Jun 2012

Overcoming The Challenges In Cost Estimation For Distributed Software Projects, Narayanasamy Ramasubbu, Rajesh Krishna Balan

Research Collection School Of Computing and Information Systems

We describe how we studied, in-situ, the operational processes of three large high process maturity distributed software development companies and discovered three common problems they faced with respect to early stage project cost estimation. We found that project managers faced significant challenges to accurately estimate project costs because the standard metrics-based estimation tools they used (a) did not effectively incorporate diverse distributed project configurations and characteristics, (b) required comprehensive data that was not fully available for all starting projects, and (c) required significant domain experience to derive accurate estimates. To address these challenges, we collaborated with practitioners at the three …

Go to article

Workitemexplorer: Visualizing Software Development Tasks Using An Interactive Exploration Environment, Christoph Treude, Patrick Gorman, Lars Grammel, Margaret-Anne Storey Jun 2012

Workitemexplorer: Visualizing Software Development Tasks Using An Interactive Exploration Environment, Christoph Treude, Patrick Gorman, Lars Grammel, Margaret-Anne Storey

Research Collection School Of Computing and Information Systems

This demo introduces WorkItemExplorer, an interactive environment to visually explore data from software development tasks. WorkItemExplorer enables developers and managers to investigate activity and correlations in their task management system by making data exploration flexible and interactive, and by utilizing multiple coordinated views. Our preliminary evaluation shows that WorkItemExplorer is able to answer questions that developers ask, while also enabling them to gain new insights through the free exploration of data.

Go to article

A Novel Unbalanced Tree Structure For Low-Cost Authentication Of Streaming Content On Mobile And Sensor Devices, Thivya Kandappu, Vijay Sivaraman, Roksana Boreli Jun 2012

A Novel Unbalanced Tree Structure For Low-Cost Authentication Of Streaming Content On Mobile And Sensor Devices, Thivya Kandappu, Vijay Sivaraman, Roksana Boreli

Research Collection School Of Computing and Information Systems

We consider stored content being streamed to a resource-poor device (such as a sensor node or a mobile phone), and address the issue of authenticating such content in realtime at the receiver. Per-packet digital signatures incur high computational cost, while per-block signatures impose high delays. A Merkle hash tree combines the benefits of the two by having a single signature per-block (at the root of the tree), while allowing immediate per-packet verification by following a hash-path logarithmic in the number of packets. In this paper we explore how the structure of the Merkle tree can be adapted to improve playback …

Go to article

Adaptive Data Acquisition Strategies For Energy-Efficient, Smartphone-Based, Continuous Processing Of Sensor Streams, Lipyeow Lim, Archan Misra, Tianli Mo Jun 2012

Adaptive Data Acquisition Strategies For Energy-Efficient, Smartphone-Based, Continuous Processing Of Sensor Streams, Lipyeow Lim, Archan Misra, Tianli Mo

Research Collection School Of Computing and Information Systems

There is a growing interest in applications that utilize continuous sensing of individual activity or context, via sensors embedded or associated with personal mobile devices (e.g., smartphones). Reducing the energy overheads of sensor data acquisition and processing is essential to ensure the successful continuous operation of such applications, especially on battery-limited mobile devices. To achieve this goal, this paper presents a framework, called ACQUA, for ‘acquisition-cost’ aware continuous query processing. ACQUA replaces the current paradigm, where the data is typically streamed (pushed) from the sensors to the one or more smartphones, with a pull-based asynchronous model, where a smartphone retrieves …

Go to article

Sammple: Detecting Semantic Indoor Activities In Practical Settings Using Locomotive Signatures, Zhixian Yan, Dipanjan Chakraborty, Archan Misra, Hoyoung Jeung, Karl Aberer Jun 2012

Sammple: Detecting Semantic Indoor Activities In Practical Settings Using Locomotive Signatures, Zhixian Yan, Dipanjan Chakraborty, Archan Misra, Hoyoung Jeung, Karl Aberer

Research Collection School Of Computing and Information Systems

We analyze the ability of mobile phone-generated accelerometer data to detect high-level (i.e., at the semantic level) indoor lifestyle activities, such as cooking at home and working at the workplace, in practical settings. We design a 2-T ier activity extraction framework (called SAMMPLE) for our purpose. Using this, we evaluate discriminatory power of activity structures along the dimension of statistical features and after a transformation to a sequence of individual locomotive micro-activities (e.g. sitting or standing). Our findings from 152 days of real-life behavioral traces reveal that locomotive signatures achieve an average accuracy of 77.14%, an improvement of 16.37% over …

Go to article

Active Refinement Of Clone Anomaly Reports, Lucia, David Lo, Lingxiao Jiang, Aditya Budi Jun 2012

Active Refinement Of Clone Anomaly Reports, Lucia, David Lo, Lingxiao Jiang, Aditya Budi

Research Collection School Of Computing and Information Systems

Software clones have been widely studied in the recent literature and shown useful for finding bugs because inconsistent changes among clones in a clone group may indicate potential bugs. However, many inconsistent clone groups are not real bugs (true positives). The excessive number of false positives could easily impede broad adoption of clone-based bug detection approaches. In this work, we aim to improve the usability of clone-based bug detection tools by increasing the rate of true positives found when a developer analyzes anomaly reports. Our idea is to control the number of anomaly reports a user can see at a …

Go to article

What Does Software Engineering Community Microblog About?, Yuan Tian, Palakorn Achananuparp, Ibrahim Nelman Lubis, David Lo, Ee Peng Lim Jun 2012

What Does Software Engineering Community Microblog About?, Yuan Tian, Palakorn Achananuparp, Ibrahim Nelman Lubis, David Lo, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Microblogging is a new trend to communicate and to disseminate information. One microblog post could potentially reach millions of users. Millions of microblogs are generated on a daily basis on popular sites such as Twitter. The popularity of microblogging among programmers, software engineers, and software users has also led to their use of microblogs to communicate software engineering issues apart from using emails and other traditional communication channels.Understanding how millions of users use microblogs in software engineering related activities would shed light on ways we could leverage the fast evolving microblogging content to aid software development efforts. In this work, …

Go to article

Exerlink: Enabling Pervasive Social Exergames With Heterogeneous Exercise Devices, Taiwoo Park, Inseok Hwang, Uichin Lee, Sunghoon Ivan Lee, Chungkuk Yoo, Youngki Lee, Hyukjae Jang, Sungwon Peter Choe, Souneil Park, Junehwa Song Jun 2012

Exerlink: Enabling Pervasive Social Exergames With Heterogeneous Exercise Devices, Taiwoo Park, Inseok Hwang, Uichin Lee, Sunghoon Ivan Lee, Chungkuk Yoo, Youngki Lee, Hyukjae Jang, Sungwon Peter Choe, Souneil Park, Junehwa Song

Research Collection School Of Computing and Information Systems

We envision that diverse social exercising games, or exergames, will emerge, featuring much richer interactivity with immersive game play experiences. Further, the recent advances of mobile devices and wireless networking will make such social engagement more pervasive - people carry portable exergame devices (e.g., jump ropes) and interact with remote users anytime, anywhere. Towards this goal, we explore the potential of using heterogeneous exercise devices as game controllers for a multi-player social exergame; e.g., playing a boat paddling game with two remote exercisers (one with a jump rope, and the other with a treadmill). In this paper, we propose a …

Go to article

Complexity Of The Soundness Problem Of Bounded Workflow Nets, Guan Jun Liu, Jun Sun, Yang Liu, Jin Song Dong Jun 2012

Complexity Of The Soundness Problem Of Bounded Workflow Nets, Guan Jun Liu, Jun Sun, Yang Liu, Jin Song Dong

Research Collection School Of Computing and Information Systems

Classical workflow nets (WF-nets) are an important class of Petri nets that are widely used to model and analyze workflow systems. Soundness is a crucial property that guarantees these systems are deadlock-free and bounded. Aalst et al. proved that the soundness problem is decidable, and proposed (but not proved) that the soundness problem is EXPSPACE-hard. In this paper, we show that the satisfiability problem of Boolean expression is polynomial time reducible to the liveness problem of bounded WF-nets, and soundness and liveness are equivalent for bounded WF-nets. As a result, the soundness problem of bounded WF-nets is co-NP-hard.Workflow nets with …

Go to article

Energy-Efficient Continuous Activity Recognition On Mobile Phones: An Activity-Adaptive Approach, Zhixian Yan, Vigneshwaran Subbaraju, Dipanjan Chakraborty, Archan Misra, Karl Aberer Jun 2012

Energy-Efficient Continuous Activity Recognition On Mobile Phones: An Activity-Adaptive Approach, Zhixian Yan, Vigneshwaran Subbaraju, Dipanjan Chakraborty, Archan Misra, Karl Aberer

Research Collection School Of Computing and Information Systems

Power consumption on mobile phones is a painful obstacle towards adoption of continuous sensing driven applications, e.g., continuously inferring individual’s locomotive activities (such as ‘sit’, ‘stand’ or ‘walk’) using the embedded accelerometer sensor. To reduce the energy overhead of such continuous activity sensing, we first investigate how the choice of accelerometer sampling frequency & classification features affects, separately for each activity, the “energy overhead” vs. “classification accuracy” tradeoff. We find that such tradeoff is activity specific. Based on this finding, we introduce an activity-sensitive strategy (dubbed “A3R” – Adaptive Accelerometer-based Activity Recognition) for continuous activity recognition, where the choice of …

Go to article

Comon: Cooperative Ambience Monitoring Platform With Continuity And Benefit Awareness, Youngki Lee, Younghyun Ju, Chulhong Min, Seungwoo Kang, Inseok Hwang, Junehwa Song Jun 2012

Comon: Cooperative Ambience Monitoring Platform With Continuity And Benefit Awareness, Youngki Lee, Younghyun Ju, Chulhong Min, Seungwoo Kang, Inseok Hwang, Junehwa Song

Research Collection School Of Computing and Information Systems

Mobile applications that sense continuously, such as location monitoring, are emerging. Despite their usefulness, their adoption in real-world deployment situations has been extremely slow. Many smartphone users are turned away by the drastic battery drain caused by continuous sensing and processing. Also, the extractable contexts from the phone are quite limited due to its position and sensing modalities. In this paper, we propose CoMon, a novel cooperative ambience monitoring platform, which newly addresses the energy problem through opportunistic cooperation among nearby mobile users. To maximize the benefit of cooperation, we develop two key techniques, (1) continuity-aware cooperator detection and (2) …

Go to article

Mobicon: Mobile Context Monitoring Platform: Incorporating Context-Awareness To Smartphone-Centric Personal Sensor Networks, Youngki Lee, Younghyun Ju, Chuihong Min, Jihun Yu, Junehwa Song Jun 2012

Mobicon: Mobile Context Monitoring Platform: Incorporating Context-Awareness To Smartphone-Centric Personal Sensor Networks, Youngki Lee, Younghyun Ju, Chuihong Min, Jihun Yu, Junehwa Song

Research Collection School Of Computing and Information Systems

In this demonstration, we will show MobiCon, a context monitoring platform; it runs over smartphones and sensor OSs, and facilitates development and deployment of everyday context-aware applications. For many years, lots of research efforts have been made in building low-cost, yet effective sensor networks for various application domains such as structural health monitoring of bridges, disaster recovery, automated ventilation of buildings. Integration of sensors into smartphones and the advent of wearable devices open a new opportunity for mobile applications to leverage in-situ user contexts such as his/her location, activity, social relationship, health status. In recent studies of mobile and pervasive …

Go to article

Vignette: Interactive Texture Design And Manipulation With Freeform Gestures For Pen-And-Ink Illustration, Rubaiat Habib Kazi, Takeo Igarashi, Shengdong Zhao, Richard C. Davis May 2012

Vignette: Interactive Texture Design And Manipulation With Freeform Gestures For Pen-And-Ink Illustration, Rubaiat Habib Kazi, Takeo Igarashi, Shengdong Zhao, Richard C. Davis

Research Collection School Of Computing and Information Systems

Vignette is an interactive system that facilitates texture creation in pen-and-ink illustrations. Unlike existing systems, Vignette preserves illustrators' workflow and style: users draw a fraction of a texture and use gestures to automatically fill regions with the texture. We currently support both 1D and 2D synthesis with stitching. Our system also has interactive refinement and editing capabilities to provide a higher level texture control, which helps artists achieve their desired vision. A user study with professional artists shows that Vignette makes the process of illustration more enjoyable and that first time users can create rich textures from scratch within minutes.

Go to article

First Prev Next Last