Spatio-temporal architecture-based framework for testing services in the cloud

Increasingly, various services are deployed and orchestrated in the cloud to form global, large-scale systems. The global distribution, high complexity, and physical separation pose new challenges into the quality assurance of such complex services. One major challenge is that they are intricately connected with the spatial and temporal characteristics of the domains they support. In this paper, we present our visions on the integration of spatial and temporal logic into the system design and quality maintenance of the complex services in the cloud. We suggest that new paradigms should be proposed for designing software architecture that will particularly embed the spatial and temporal properties of the cloud services, and new testing methodologies should be developed based on architecture including spatio-temporal aspects. We also discuss several potential directions in the relevant research

Spatio-temporal event detection using probabilistic graphical models (PGMs)

Event detection concerns identifying occurrence of interesting events which are meaningful and understandable. In dynamic fields, as time passes the attribute of phenomenon varies in spatial locations. Detecting events in dynamic fields requires an approach to deal with the highly granular data arriving in real time. This paper proposes a spatiotemporal event detection algorithm in dynamic fields which are monitored by wireless sensor networks (WSNs). The algorithm provides a method using probabilistic graphical models (PGMs) in WSNs to cope with the uncertainty of sensor readings. The algorithm incorporates the ability of Markov chains in temporal dependency modelling and Markov random fields theory to model the spatial dependency of sensors in a distributed fashion. Experimental evaluation of the proposed algorithm demonstrates that the decentralized approach improves the F1-score to 82% and 29% better precision than simple threshold technique. In addition, the performance of the algorithm was evaluated and compared with respect to the scalability (in terms of communication complexity). In comparison with the centralized approach the decentralized algorithm can substantially improve the scalability of communication in wireless sensor networks