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

Digital Commons Network™

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

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 8641 - 8670 of 10505

Full-Text Articles in Entire DC Network

Algorithms For Constrained K-Nearest Neighbor Queries Over Moving Object Trajectories, Yunjun Gao, Baihua Zheng, Gencai Chen, Qing Li, Chun Chen Apr 2010

Algorithms For Constrained K-Nearest Neighbor Queries Over Moving Object Trajectories, Yunjun Gao, Baihua Zheng, Gencai Chen, Qing Li, Chun Chen

Research Collection School Of Computing and Information Systems

An important query for spatio-temporal databases is to find nearest trajectories of moving objects. Existing work on this topic focuses on the closest trajectories in the whole data space. In this paper, we introduce and solve constrained k-nearest neighbor (CkNN) queries and historical continuous CkNN (HCCkNN) queries on R-tree-like structures storing historical information about moving object trajectories. Given a trajectory set D, a query object (point or trajectory) q, a temporal extent T, and a constrained region CR, (i) a CkNN query over trajectories retrieves from D within T, the k (≥ 1) trajectories that lie closest to q and …

Go to article

Information Search Patterns In E-Commerce Product Comparison Services, Fiona Fui-Hoon Nah, Weiyin Hong, Liqiang Chen, Hong-Hee Lee Apr 2010

Information Search Patterns In E-Commerce Product Comparison Services, Fiona Fui-Hoon Nah, Weiyin Hong, Liqiang Chen, Hong-Hee Lee

Research Collection School Of Computing and Information Systems

To facilitate product selection and purchase decisions on e-commerce Web sites, the presentation of product information is very important. In this research, the authors study how disposition styles influence users’ search patterns in product comparison services of e-commerce Web sites. The results show that people use relatively more feature paths and less product paths in vertical disposition style than horizontal disposition style. The findings also indicate that there are relatively more feature paths and less product paths in the first half than second half of the information search paths. This is consistent with Gensch’s two-stage choice model which suggests that …

Go to article

Playing With Recognizers: A Call For An Extensible Editor, Richard Christopher Davis Apr 2010

Playing With Recognizers: A Call For An Extensible Editor, Richard Christopher Davis

Research Collection School of Computing and Information Systems

The sketch recognition interface community has not produced a ―killer‖ application, because access to sketch recognition technology has been too restricted. If recognition technologies were more freely available for experimentation, powerful new applications would evolve. This paper proposes a rough architecture for an extensible graphical editor that facilitates collaboration between recognition technology developers, user interface designers, and early adopters of sketch recognition interfaces. Only by serving all three communities will we reach the critical mass necessary for killer applications to emerge.

Go to article

Practical Id-Based Encryption For Wireless Sensor Network, Cheng-Kang Chu, Joseph K. Liu, Jianying Zhou, Feng Bao, Robert H. Deng Apr 2010

Practical Id-Based Encryption For Wireless Sensor Network, Cheng-Kang Chu, Joseph K. Liu, Jianying Zhou, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

In this paper, we propose a new practical identity-based encryption scheme which is suitable for wireless sensor network (WSN). We call it Receiver-Bounded Online/Offline Identity-based Encryption (RB-OOIBE). It splits the encryption process into two parts -- the offline and the online part. In the offline part, all heavy computations are done without the knowledge of the receiver's identity and the plaintext message. In the online stage, only light computations such as modular operation and symmetric key encryption are required, together with the receiver's identity and the plaintext message. Moreover, since each offline ciphertext can be re-used for the same receiver, …

Go to article

Dynamic Treatment Effect Analysis Of Tv Effects On Child Cognitive Development, Fali Huang, Myoung-Jae Lee Apr 2010

Dynamic Treatment Effect Analysis Of Tv Effects On Child Cognitive Development, Fali Huang, Myoung-Jae Lee

Research Collection School Of Economics

We investigate whether TV watching at ages 6-7 and 8-9 affects cognitive development measured by math and reading scores at ages 8-9, using a rich childhood longitudinal sample from NLSY79. Dynamic panel data models are estimated to handle the unobserved child-specific factor, endogeneity of TV watching, and dynamic nature of the causal relation. A special emphasis is placed on the last aspect, where TV watching affects cognitive development, which in turn affects future TV watching. When this feedback occurs, it is not straightforward to identify and estimate the TV effect. We develop a two-stage estimation method which can deal with …

Go to article

Finding Influentials Based On The Temporal Order Of Information Adoption In Twitter, Changhyun Lee, Haewoon Kwak, Hosung Park, Sue Moon Apr 2010

Finding Influentials Based On The Temporal Order Of Information Adoption In Twitter, Changhyun Lee, Haewoon Kwak, Hosung Park, Sue Moon

Research Collection School Of Computing and Information Systems

Twitter offers an explicit mechanism to facilitate information diffusion and has emerged as a new medium for communication. Many approaches to find influentials have been proposed, but they do not consider the temporal order of information adoption. In this work, we propose a novel method to find influentials by considering both the link structure and the temporal order of information adoption in Twitter. Our method finds distinct influentials who are not discovered by other methods.

Go to article

Data Mining Based Predictive Models For Overall Health Indices, Ridhima Rajkumar, Kyong Jin Shim, Jaideep Srivastava Apr 2010

Data Mining Based Predictive Models For Overall Health Indices, Ridhima Rajkumar, Kyong Jin Shim, Jaideep Srivastava

Research Collection School Of Computing and Information Systems

In this study, we infer health care indices of individuals using their pharmacy medical and prescription claims. Specifically, we focus on the widely used Charlson Index. We use data mining techniques to formulate the problem of classifying Charlson Index (CI) and build predictive models to predict individual health index score. First, we present comparative analyses of several classification algorithms. Second, our study shows that certain ensemble algorithms lead to higher prediction accuracy in comparison to base algorithms. Third, we introduce cost-sensitive learning to the classification algorithms and show that the inclusion of cost-sensitive learning leads to improved prediction accuracy. The …

Go to article

Policy-Driven Distributed And Collaborative Demand Response In Multi-Domain Commercial Buildings, Archan Misra, Henning Schulzrinne Apr 2010

Policy-Driven Distributed And Collaborative Demand Response In Multi-Domain Commercial Buildings, Archan Misra, Henning Schulzrinne

Research Collection School Of Computing and Information Systems

Enabling a sophisticated Demand Response (DR) framework, whereby individual consumers adapt their electricity consumption in response to price variations, is a major objective of the emerging Smart Grid. We first point out why the current model, of EMS-based centralized control of a static repository of high load appliances, is inappropriate for supporting DR in future commercial buildings and campuses, where the consuming appliances are controlled by multiple users. To enable DR in such multi-domain environments, we envision a more collaborative and autonomous model, where a large set of heterogeneous smart electrical devices autonomously self-organize and negotiate their collective DR. Enabling …

Go to article

Optimal Matching Between Spatial Datasets Under Capacity Constraints, Hou U Leong, Kyriakos Mouratidis, Man Lung Yiu, Nikos Mamoulis Apr 2010

Optimal Matching Between Spatial Datasets Under Capacity Constraints, Hou U Leong, Kyriakos Mouratidis, Man Lung Yiu, Nikos Mamoulis

Research Collection School Of Computing and Information Systems

Consider a set of customers (e.g., WiFi receivers) and a set of service providers (e.g., wireless access points), where each provider has a capacity and the quality of service offered to its customers is anti-proportional to their distance. The capacity constrained assignment (CCA) is a matching between the two sets such that (i) each customer is assigned to at most one provider, (ii) every provider serves no more customers than its capacity, (iii) the maximum possible number of customers are served, and (iv) the sum of Euclidean distances within the assigned provider-customer pairs is minimized. Although max-flow algorithms are applicable …

Go to article

Managing Media Rich Geo-Spatial Annotations For A Map-Based Mobile Application Using Clustering, Khasfariyati Razikin, Dion Hoe-Lian Goh, Ee Peng Lim, Aixin Sun, Yin-Leng Theng, Thi Nhu Quynh Kim, Kalyani Chatterjea, Chew-Hung Chang Apr 2010

Managing Media Rich Geo-Spatial Annotations For A Map-Based Mobile Application Using Clustering, Khasfariyati Razikin, Dion Hoe-Lian Goh, Ee Peng Lim, Aixin Sun, Yin-Leng Theng, Thi Nhu Quynh Kim, Kalyani Chatterjea, Chew-Hung Chang

Research Collection School Of Computing and Information Systems

With the prevalence of mobile devices that are equipped with wireless Internet capabilities and Global Positioning System (GPS) functionality, the creation and access of user-generated content are extended to users on the go. Such content are tied to real world objects, in the form of geospatial annotations, and it is only natural that these annotations are visualized using a map-based approach. However, viewing maps that are filled with annotations could hinder the serendipitous discovery of data, especially on the small screens of mobile devices. This calls for a need to manage the annotations. In this paper, we introduce a mobile …

Go to article

Cold War Origins Of The International Federation For Information Processing, Ksenia Tatarchenko Apr 2010

Cold War Origins Of The International Federation For Information Processing, Ksenia Tatarchenko

Research Collection College of Integrative Studies

The International Federation for Information Processing (IFIP) was born as a nongovernmental federation with the main goal of bringing together computer professionals from countries in the East and West. This article examines the Cold War context of the IFIP's origins and the mechanisms its founders used to reconcile computing and politics and to construct computing as an international discipline.

Go to article

Model-Based Methods For Linking Web Service Choreography And Orchestration, Jun Sun, Yang Liu, Jin Song Dong, Geguang Pu, Tian Huat Tan Mar 2010

Model-Based Methods For Linking Web Service Choreography And Orchestration, Jun Sun, Yang Liu, Jin Song Dong, Geguang Pu, Tian Huat Tan

Research Collection School Of Computing and Information Systems

In recent years, many Web service composition languages have been proposed. Web service choreography describes collaboration protocols of cooperating Web service participants from a global view. Web service orchestration describes collaboration of the Web services in predefined patterns based on local decision about their interactions with one another at the message/execution level. In this work, we present model-based methods to close the gap between the two views. Building on the strength of model checking techniques, Web service choreography and orchestration are verified against temporal properties or against each other (to show that they are consistent). Specialized optimization techniques are developed …

Go to article

Cca-Secure Unidirectional Proxy Re-Encryption In The Adaptive Corruption Model Without Random Oracles, Jian Weng, Minrong Chen, Yanjiang Yang, Robert H. Deng, Kefei Chen Mar 2010

Cca-Secure Unidirectional Proxy Re-Encryption In The Adaptive Corruption Model Without Random Oracles, Jian Weng, Minrong Chen, Yanjiang Yang, Robert H. Deng, Kefei Chen

Research Collection School Of Computing and Information Systems

Proxy re-encryption (PRE), introduced by Blaze, Bleumer and Strauss in Eurocrypt’98, allows a semitrusted proxy to convert a ciphertext originally intended for Alice into an encryption of the same message intended for Bob. PRE has recently drawn great interest, and many interesting PRE schemes have been proposed. However, up to now, it is still an important question to come up with a chosen-ciphertext secure unidirectional PRE in the adaptive corruption model. To address this problem, we propose a new unidirectional PRE scheme, and prove its chosen-ciphertext security in the adaptive corruption model without random oracles. Compared with the best known …

Go to article

Differentiating Knowledge Processes In Organisational Learning: A Case Of “Two Solitudes”, Siu Loon Hoe, Steven Mcshane Mar 2010

Differentiating Knowledge Processes In Organisational Learning: A Case Of “Two Solitudes”, Siu Loon Hoe, Steven Mcshane

Research Collection School Of Computing and Information Systems

The fields of organizational behavior (OB)/strategy and marketing have taken different paths over the past two decades to understanding organizational learning. OB/strategy has been pre-occupied with theory development and case study illustrations, whereas marketing has taken a highly quantitative path. Although relying on essentially the same foundation theory, the two disciplines have had minimal crossfertilization. Furthermore, both fields tend to blur or usually ignore the distinction between structural and informal knowledge processes. The purpose of the paper is to highlight the distinction between informal and structural knowledge acquisition and dissemination processes and propose new definitions to differentiate them. Future research …

Go to article

Creating An Immersive Game World With Evolutionary Fuzzy Cognitive Maps, Yundong Cai, Ah-Hwee Tan, Zhiqi Shen, Boyang Li Mar 2010

Creating An Immersive Game World With Evolutionary Fuzzy Cognitive Maps, Yundong Cai, Ah-Hwee Tan, Zhiqi Shen, Boyang Li

Research Collection School Of Computing and Information Systems

An increasing number of serious games have been developed to enhance the user experiences in education and training. In order to bridge the gap of game experiences in the virtual environment and in the real life, it is crucial to generate believable characters and contexts in real-time. However, the variables to be simulated for a large-scale serious game are numerous. These variables are involved in complex causal relationships and their values change over time. In view that world modeling has not been well addressed with conventional models, this paper uses a computational model Evolutionary Fuzzy Cognitive Map (EFCM) to model …

Go to article

A Self-Organizing Neural Architecture Integrating Desire, Intention And Reinforcement Learning, Ah-Hwee Tan, Yu-Hong Feng, Yew-Soon Ong Mar 2010

A Self-Organizing Neural Architecture Integrating Desire, Intention And Reinforcement Learning, Ah-Hwee Tan, Yu-Hong Feng, Yew-Soon Ong

Research Collection School Of Computing and Information Systems

This paper presents a self-organizing neural architecture that integrates the features of belief, desire, and intention (BDI) systems with reinforcement learning. Based on fusion Adaptive Resonance Theory (fusion ART), the proposed architecture provides a unified treatment for both intentional and reactive cognitive functionalities. Operating with a sense-act-learn paradigm, the low level reactive module is a fusion ART network that learns action and value policies across the sensory, motor, and feedback channels. During performance, the actions executed by the reactive module are tracked by a high level intention module (also a fusion ART network) that learns to associate sequences of actions …

Go to article

Preference Queries In Large Multi-Cost Transportation Networks, Kyriakos Mouratidis, Yimin Lin, Man Lung Yiu Mar 2010

Preference Queries In Large Multi-Cost Transportation Networks, Kyriakos Mouratidis, Yimin Lin, Man Lung Yiu

Research Collection School Of Computing and Information Systems

Research on spatial network databases has so far considered that there is a single cost value associated with each road segment of the network. In most real-world situations, however, there may exist multiple cost types involved in transportation decision making. For example, the different costs of a road segment could be its Euclidean length, the driving time, the walking time, possible toll fee, etc. The relative significance of these cost types may vary from user to user. In this paper we consider such multi-cost transportation networks (MCN), where each edge (road segment) is associated with multiple cost values. We formulate …

Go to article

Efficient Verification Of Shortest Path Search Via Authenticated Hints, Man Lung Yiu, Yimin Lin, Kyriakos Mouratidis Mar 2010

Efficient Verification Of Shortest Path Search Via Authenticated Hints, Man Lung Yiu, Yimin Lin, Kyriakos Mouratidis

Research Collection School Of Computing and Information Systems

Shortest path search in transportation networks is unarguably one of the most important online search services nowadays (e.g., Google Maps, MapQuest, etc), with applications spanning logistics, spatial optimization, or everyday driving decisions. Often times, the owner of the road network data (e.g., a transport authority) provides its database to third-party query services, which are responsible for answering shortest path queries posed by their clients. The issue arising here is that a query service might be returning sub-optimal paths either purposely (in order to serve its own purposes like computational savings or commercial reasons) or because it has been compromised by …

Go to article

Top-K Aggregation Queries Over Large Networks, Xifeng Yan, Bin He, Feida Zhu, Jiawei Han Mar 2010

Top-K Aggregation Queries Over Large Networks, Xifeng Yan, Bin He, Feida Zhu, Jiawei Han

Research Collection School Of Computing and Information Systems

Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional associations in biological pathways. In these domains, there is a need to perform aggregation operations on large-scale networks. Unfortunately the existing implementation of aggregation operations on relational databases does not guarantee superior performance in network space, especially when it involves edge traversals and joins of gigantic tables. In this paper, we investigate the neighborhood aggregation queries: Find nodes that have top-k highest aggregate values over their h-hop neighbors. While these basic queries are common in …

Go to article

Information-Quality Aware Routing In Event-Driven Sensor Networks, Hwee Xian Tan, Mun-Choon Chan, Wendong Xiao, Peng-Yong Kong, Chen-Khong Tham Mar 2010

Information-Quality Aware Routing In Event-Driven Sensor Networks, Hwee Xian Tan, Mun-Choon Chan, Wendong Xiao, Peng-Yong Kong, Chen-Khong Tham

Research Collection School Of Computing and Information Systems

Upon the occurrence of a phenomenon of interest in a wireless sensor network, multiple sensors may be activated, leading to data implosion and redundancy. Data aggregation and/or fusion techniques exploit spatio-temporal correlation among sensory data to reduce traffic load and mitigate congestion. However, this is often at the expense of loss in Information Quality (IQ) of data that is collected at the fusion center. In this work, we address the problem of finding the least-cost routing tree that satisfies a given IQ constraint. We note that the optimal least-cost routing solution is a variation of the classical NP-hard Steiner tree …

Go to article

A Multi-Key Pirate Decoder Against Traitor Tracing Schemes, Yongdong Wu, Robert H. Deng Mar 2010

A Multi-Key Pirate Decoder Against Traitor Tracing Schemes, Yongdong Wu, Robert H. Deng

Research Collection School Of Computing and Information Systems

In this paper we introduce an architecture for a multi-key pirate decoder which employs decryption keys from multiple traitors. The decoder has built-in monitoring and self protection functionalities and is capable of defeating most multiple-round based traitor tracing schemes such as the schemes based on the black-box confirmation method. In particular, the proposed pirate decoder is customized to defeat the private key and the public key fully collusion resistant traitor tracing (FTT) schemes, respectively. We show how the decoder prolongs a trace process so that the tracer has to give up his effort. FTT schemes are designed to identify all …

Go to article

Symphony: A Platform For Search-Driven Applications, John C. Shafer, Rakesh Agrawal, Hady W. Lauw Mar 2010

Symphony: A Platform For Search-Driven Applications, John C. Shafer, Rakesh Agrawal, Hady W. Lauw

Research Collection School Of Computing and Information Systems

We present the design of Symphony, a platform that enables non-developers to build and deploy a new class of search-driven applications that combine their data and domain expertise with content from search engines and other web services. The Symphony prototype has been built on top of Microsoft's Bing infrastructure. While Symphony naturally makes use of the customization capabilities exposed by Bing, its distinguishing feature is the capability it provides to the application creator to combine their proprietary data and domain expertise with content obtained from Bing. They can also integrate specialized data obtained from web services to enhance the richness …

Go to article

Index-Exciting Caviar: A New Empirical Time-Varying Risk Model, Dashan Huang, Baimin Yu, Zudi Lu, Sergio Focardi, Frank Fabozzi, Masao Fukushima Mar 2010

Index-Exciting Caviar: A New Empirical Time-Varying Risk Model, Dashan Huang, Baimin Yu, Zudi Lu, Sergio Focardi, Frank Fabozzi, Masao Fukushima

Research Collection Lee Kong Chian School Of Business

Instead of assuming the distribution of return series, Engle and Manganelli (2004) propose a new Value-at-Risk (VaR) modeling approach, Conditional Autoregressive Value-at-Risk (CAViaR), to directly compute the quantile of an individual asset's returns which performs better in many cases than those that invert a return distribution. In this paper we explore more flexible CAViaR models that allow VaR prediction to depend upon a richer information set involving returns on an index. Specifically, we formulate a time-varying CAViaR model whose parameters vary according to the evolution of the index. The empirical evidence reported in this paper suggests that our time-varying CAViaR …

Go to article

Climate Risk Management: The Case Of Forecasting Tropical Cyclones, Carolyn W Chang, Sk Jack Chang, Kian Guan Lim Mar 2010

Climate Risk Management: The Case Of Forecasting Tropical Cyclones, Carolyn W Chang, Sk Jack Chang, Kian Guan Lim

Research Collection Lee Kong Chian School Of Business

Global warming has induced an increasing number of deadly tropical cyclones with a continuing trend. Developing high-functional climate risk management tools in forecasting, catastrophe modeling, pricing and hedging is thus crucial. By using transactional price changes of traded hurricane derivatives as the predictor in a doubly-binomial pricing framework, we develop a dynamic market-consensus hurricane forecasting model. Our model can forecast when and how a hurricane will make landfall, and how these forecasts will update themselves upon trading arrival.

Go to article

Probabilistic Public Key Encryption With Equality Test, Guomin Yang, Chik How Tan, Qiong Huang, Duncan S. Wong Mar 2010

Probabilistic Public Key Encryption With Equality Test, Guomin Yang, Chik How Tan, Qiong Huang, Duncan S. Wong

Research Collection School Of Computing and Information Systems

We present a (probabilistic) public key encryption (PKE) scheme such that when being implemented in a bilinear group, anyone is able to check whether two ciphertexts are encryptions of the same message. Interestingly, bilinear map operations are not required in key generation, encryption or decryption procedures of the PKE scheme, but is only required when people want to do an equality test (on the encrypted messages) between two ciphertexts that may be generated using different public keys. We show that our PKE scheme can be used in different applications such as searchable encryption and partitioning encrypted data. Moreover, we show …

Go to article

Local Coordination Under Bounded Rationality: Coase Meets Simon, Finds Hayek, C. Jason Woodard Mar 2010

Local Coordination Under Bounded Rationality: Coase Meets Simon, Finds Hayek, C. Jason Woodard

Research Collection School Of Computing and Information Systems

This paper explores strategic behavior in a network of firms using an agent-based model. The model exhibits a tension between economic efficiency and the stability of the network in the face of incentives to change its configuration. This tension is to be expected because the conditions of the Coase theorem are violated: the boundedly rational firms in the model lack the ability to discover efficient network configurations or achieve them through collective action. In computational experiments, as predicted by theory, firms frequently became locked into inefficient outcomes or endless cycles of mutual frustration. However, simple institutional innovations such as property …

Go to article

Overinvestment And The Operating Performance Of Seo Firms, Fangjian Fu Mar 2010

Overinvestment And The Operating Performance Of Seo Firms, Fangjian Fu

Research Collection Lee Kong Chian School Of Business

Prior studies have documented that firms' operating performance deteriorates following seasoned equity offerings (SEOs). This paper proposes and empirically tests the hypothesis that the poor performance is caused by managers' overinvestment. I show that, subsequent to the offering, SEO firms tend to invest more heavily than non-issuing control firms that are in the same industry and have enough financial slack and similar amounts of investment opportunities. More importantly, I find a negative relation between post-issue investment and operating performance, controlling for investment opportunities and pre-issue performance. The evidence supports an overinvestment interpretation as it stands in contrast to the prediction …

Go to article

The Way We Think: Ethics, Health And The Environment In International Business, David Nathan Smith Mar 2010

The Way We Think: Ethics, Health And The Environment In International Business, David Nathan Smith

Research Collection Yong Pung How School Of Law

Breaches of ethics and social responsibility in domestic and international business are typically thought to be anchored in such phenomena as greed, dishonesty and conflict of interest. While these forces are frequently at work in international business transactions, there is often another major force at work when failures of ethics and social responsibility occur. This article addresses the question of what is it about the way that transnational company managers and government officials think or don’t think that leads to breaches of ethics and social responsibility – breaches that often result in major health, environmental and social tragedies. The article …

Go to article

Efficient Cca-Secure Pke From Identity-Based Techniques, Junzuo Lai, Robert H. Deng, Shengli Liu, Weidong Kou Mar 2010

Efficient Cca-Secure Pke From Identity-Based Techniques, Junzuo Lai, Robert H. Deng, Shengli Liu, Weidong Kou

Research Collection School Of Computing and Information Systems

Boneh, Canetti, Halevi, and Katz showed a general method for constructing CCA-secure public key encryption (PKE) from any selective-ID CPA-secure identity-based encryption (IBE) schemes. Their approach treated IBE as a black box. Subsequently, Boyen, Mei, and Waters demonstrated how to build a direct CCA-secure PKE scheme from the Waters IBE scheme, which is adaptive-ID CPA secure. They made direct use of the underlying IBE structure, and required no cryptographic primitive other than the IBE scheme itself. However, their scheme requires long public key and the security reduction is loose. In this paper, we propose an efficient PKE scheme employing identity-based …

Go to article

Medially: A Provenance-Aware Remote Health Monitoring Middleware, Atanu Roy Chowdhury, Ben Falchuk, Archan Misra Mar 2010

Medially: A Provenance-Aware Remote Health Monitoring Middleware, Atanu Roy Chowdhury, Ben Falchuk, Archan Misra

Research Collection School Of Computing and Information Systems

This paper presents MediAlly, a middleware for supporting energy-efficient, long-term remote health monitoring. Data is collected using physiological sensors and transported back to the middleware using a smart phone. The key to MediAlly's energy efficient operations lies in the adoption of an Activity Triggered Deep Monitoring (ATDM) paradigm, where data collection episodes are triggered only when the subject is determined to possess a specified context. MediAlly supports the on-demand collection of contextual provenance using a novel low-overhead provenance collection sub-system. The behaviour of this sub-system is configured using an application-defined context composition graph. The resulting provenance stream provides valuable insight …

Go to article

First Prev Next Last