{"title":"Dynamic QoS-aware event sampling for community-based participatory sensing systems","authors":"Ioannis Boutsis, V. Kalogeraki","doi":"10.1145/2335484.2335502","DOIUrl":"https://doi.org/10.1145/2335484.2335502","url":null,"abstract":"Over the recent years, the proliferation of mobile networking and the increasing capabilities of smartphone devices have led to the development of the \"Community-based Participatory Sensing\" approach, where users participate in data collection and sharing in a wide range of application areas such as entertainment, transportation and environmental monitoring. This paper develops a participatory sensing system that uses a sampling mechanism that aims to stimulate user participation in dynamic groups that provide services and get compensated for the services they provide. Users participate in the community by sensing and sharing streams of events. The system then uses a sampling mechanism to define a subset of events that preserves the characteristics of the stream data and provides the highest \"information gain\" to the system, given the budget and resource constraints. Our experimental results illustrate that our approach is practical, efficient and depicts good performance.","PeriodicalId":92123,"journal":{"name":"Proceedings of the ... International Workshop on Distributed Event-Based Systems. International Workshop on Distributed Event-Based Systems","volume":"24 1","pages":"153-156"},"PeriodicalIF":0.0,"publicationDate":"2012-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91096970","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Christian Kuka, S. Gerwinn, S. Schweigert, S. Eilers, D. Nicklas
{"title":"Context-model generation for safe autonomous transport vehicles","authors":"Christian Kuka, S. Gerwinn, S. Schweigert, S. Eilers, D. Nicklas","doi":"10.1145/2335484.2335524","DOIUrl":"https://doi.org/10.1145/2335484.2335524","url":null,"abstract":"Autonomously operating vehicles highly depend on the quality of its sensors as they have to be aware of its surroundings to react appropriately. Currently operating automated guided vehicles cover only a limited area with their sensors and therefore can only drive at low speeds. However, as more and more sensors are available, it is essential to build a context-model, which fuses information of different sensors to cover a larger area and allow for an increased level of autonomy. In this paper, we present a context-model based on a Bayesian occupancy filter which can be queried via a data stream management system in order to provide the necessary information at any point in time. Additionally, the Bayesian filter is pessimistically as it is constructed such that probability of occupancy is always upper bounded, to ensure a sufficient level of safety.","PeriodicalId":92123,"journal":{"name":"Proceedings of the ... International Workshop on Distributed Event-Based Systems. International Workshop on Distributed Event-Based Systems","volume":"40 1","pages":"365-366"},"PeriodicalIF":0.0,"publicationDate":"2012-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91217393","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
D. Maier, Michael Grossniklaus, Sharmadha Moorthy, K. Tufte
{"title":"Capturing episodes: may the frame be with you","authors":"D. Maier, Michael Grossniklaus, Sharmadha Moorthy, K. Tufte","doi":"10.1145/2335484.2335485","DOIUrl":"https://doi.org/10.1145/2335484.2335485","url":null,"abstract":"We are interested in detecting episodes in a data stream that are characterized by a period of time over which a condition holds, usually with a minimum duration. For example, we might want to know whenever any router has a packet-drop rate above 0.3% continuously for more than two minutes. Such episodes can be interesting in their own right for monitoring purposes, but they can also specify target regions for examination over the original or other stream. For instance, for each router-drop episode we detect, we might want to count the number of control messages the router received. We assert the key requirements are to detect the episodes, detect them accurately, and detect them promptly. Current capabilities for data-stream management systems (DSMSs) include functionality, such as pattern-matching and windowed aggregates, that can help with detecting some kinds of episodes. We offer a third alternative, frames, which generalizes the other two. Frames are intervals that segment a data stream into regions of interest. In contrast to windows, frame boundaries can be data dependent, such as when a predicate holds for a given duration, or the maximum and minimum values of an attribute diverge more than a certain amount. We introduce frames and their theory, plus their implementation in the NiagaraST DSMS. We then demonstrate some advantages of frames versus windows, such as better characterization of episodes, on real data sets and explore an extension, fragments, to deal with long episodes.","PeriodicalId":92123,"journal":{"name":"Proceedings of the ... International Workshop on Distributed Event-Based Systems. International Workshop on Distributed Event-Based Systems","volume":"1 1","pages":"1-11"},"PeriodicalIF":0.0,"publicationDate":"2012-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89075055","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A highly efficient cloud-based architecture for large-scale STB event processing: industry article","authors":"Bin Cao, Jianwei Yin, Shuiguang Deng, Yueshen Xu, Youneng Xiao, Zhaohui Wu","doi":"10.1145/2335484.2335518","DOIUrl":"https://doi.org/10.1145/2335484.2335518","url":null,"abstract":"With the popularization and ripeness of DTV (Digital television) and IPTV (Internet Protocol television), the STB (Set-Top Box) devices are playing more and more important roles in improving the interactive TV applications. Through STB devices, millions of users can publish/subscribe their interested events when they are participating in different applications. Furthermore, it is likely that a very large number of events would be published simultaneously and processing these events under critical timing constrains is often required by lots of applications. How to subscribe and process this large amount of events in real time is rather a challenge to both academia and industry. The combination of Cloud Computing and DDS (Data Distribution Service) middleware brings us a promising way to address this issue. Cloud computing can not only provide sufficient computing capacity but also reduce the processing cost in a great lot. Besides, DDS middleware supports real-time publish/subscribe communication model and is often used in military scenario. In this paper, in order to process such a large scale and high concurrency events efficiently and real-time, we propose a cloud-based architecture for STB event processing. Besides, we discuss the implementation details of reliability and load balancing. To demonstrate the effectiveness of our approach some experiments on the prototype are evaluated.","PeriodicalId":92123,"journal":{"name":"Proceedings of the ... International Workshop on Distributed Event-Based Systems. International Workshop on Distributed Event-Based Systems","volume":"16 9","pages":"314-323"},"PeriodicalIF":0.0,"publicationDate":"2012-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91492504","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A tutorial on reliability in publish/subscribe services","authors":"C. Esposito","doi":"10.1145/2335484.2335537","DOIUrl":"https://doi.org/10.1145/2335484.2335537","url":null,"abstract":"Publish/subscribe services are required in several long-term on-going industrial projects that envision a radical rethinking of software systems by integrating existing legacy systems in large-scale federating architectures. In fact, such systems are made of a constellation of systems that cooperate with each other by means of the event notification provided by publish/subscribe services over wide-area networks. Such services have met an enthusiastic success in implementing these large-scale federations thanks to their intrinsic decoupling properties that improve the offered scalability guarantees. However, a very important requirement of such federations is the capability of the adopted publish/subscribe service to tolerate faults occurring in the network and/or computing nodes composing the federation, without negatively affecting the provided event notification. Therefore, it is crucial that publish/subscribe services are equipped with proper methods to support reliable event notification.\u0000 In this paper, we present this topic of reliable event notification by introducing its definition, a model of the faults that have to be tolerated, the available methods to recover from such faults and how current publish/subscribe products deal with reliability.","PeriodicalId":92123,"journal":{"name":"Proceedings of the ... International Workshop on Distributed Event-Based Systems. International Workshop on Distributed Event-Based Systems","volume":"151 1","pages":"399-406"},"PeriodicalIF":0.0,"publicationDate":"2012-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77868749","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"From a calculus to an execution environment for stream processing","authors":"R. Soulé, Martin Hirzel, B. Gedik, R. Grimm","doi":"10.1145/2335484.2335487","DOIUrl":"https://doi.org/10.1145/2335484.2335487","url":null,"abstract":"At one level, this paper is about River, a virtual execution environment for stream processing. Stream processing is a paradigm well-suited for many modern data processing systems that ingest high-volume data streams from the real world, such as audio/video streaming, high-frequency trading, and security monitoring. One attractive property of stream processing is that it lends itself to parallelization on multicores, and even to distribution on clusters when extreme scale is required. Stream processing has been co-evolved by several communities, leading to diverse languages with similar core concepts. Providing a common execution environment reduces language development effort and increases portability. We designed River as a practical realization of Brooklet, a calculus for stream processing. So at another level, this paper is about a journey from theory (the calculus) to practice (the execution environment). The challenge is that, by definition, a calculus abstracts away all but the most central concepts. Hence, there are several research questions in concretizing the missing parts, not to mention a significant engineering effort in implementing them. But the effort is well worth it, because using a calculus as a foundation yields clear semantics and proven correctness results.","PeriodicalId":92123,"journal":{"name":"Proceedings of the ... International Workshop on Distributed Event-Based Systems. International Workshop on Distributed Event-Based Systems","volume":"198 1","pages":"20-31"},"PeriodicalIF":0.0,"publicationDate":"2012-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78312323","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Sparkwave: continuous schema-enhanced pattern matching over RDF data streams","authors":"S. Komazec, D. Cerri, D. Fensel","doi":"10.1145/2335484.2335491","DOIUrl":"https://doi.org/10.1145/2335484.2335491","url":null,"abstract":"Data streams, often seen as sources of events, have appeared on the Web. Stream processing on the Web needs however to cope with the typical openness and heterogeneity of the Web environment. Semantic Web technologies, meant to facilitate data integration in an open environment, can help to address heterogeneities across multiple streams. In this paper we present Sparkwave, an approach for continuous pattern matching over RDF data streams. Sparkwave is based on the Rete algorithm, which allows efficient and truly continuous processing of data streams. Sparkwave is able to leverage RDF schema information associated to data streams to compute entailments, so that implicit knowledge is taken into account for pattern matching. In addition, it further extends Rete to support time-based sliding windows and static data instances, to cope with the streaming nature of processed data and real-world use cases.","PeriodicalId":92123,"journal":{"name":"Proceedings of the ... International Workshop on Distributed Event-Based Systems. International Workshop on Distributed Event-Based Systems","volume":"1 1","pages":"58-68"},"PeriodicalIF":0.0,"publicationDate":"2012-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76243138","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
E. Bouillet, Ravina Kothari, Vibhore Kumar, L. Mignet, Senthil Nathan, A. Ranganathan, D. Turaga, O. Udrea, O. Verscheure
{"title":"Processing 6 billion CDRs/day: from research to production (experience report)","authors":"E. Bouillet, Ravina Kothari, Vibhore Kumar, L. Mignet, Senthil Nathan, A. Ranganathan, D. Turaga, O. Udrea, O. Verscheure","doi":"10.1145/2335484.2335513","DOIUrl":"https://doi.org/10.1145/2335484.2335513","url":null,"abstract":"A call detail record (CDR), is a data record produced by a telephone exchange or other telecommunications equipment documenting the details of a phone call that passed through the exchange or equipment. Telecommunications companies (or \"telcos\") use CDRs for purposes of billing, extracting business intelligence, fraud detection, etc. However, they face a Big Data challenge -- many telcos get billions of CDRs per day, and are unable to keep up with these data rates. In this paper, we describe a stream processing solution for processing CDRs that allows scaling the processing to handle 6 billion CDRs per day for a certain telco. We describe the stream processing application (running on the IBM InfoSphere Streams platform) that performs CDR mediation and analysis in real-time. We also describe various business and operational constraints and the legacy software ecosystem - seldom discussed in academic gatherings - that make the problem more challenging than originally meets the eye. The outcome of our work is a highly configurable and scalable CDR processing stream with several functional and performance capabilities that are a first for the telecommunication industry.","PeriodicalId":92123,"journal":{"name":"Proceedings of the ... International Workshop on Distributed Event-Based Systems. International Workshop on Distributed Event-Based Systems","volume":"253 1","pages":"264-267"},"PeriodicalIF":0.0,"publicationDate":"2012-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73342989","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A process-oriented event-based programming language","authors":"Thomas T. Hildebrandt, Francesco Zanitti","doi":"10.1145/2335484.2335530","DOIUrl":"https://doi.org/10.1145/2335484.2335530","url":null,"abstract":"We present the first version of PEPL, a declarative Process-oriented Event-based Programming Language based on the recently introduced Dynamic Condition Response (DCR) Graphs model. DCR Graphs allow for specification, distributed execution and verification of pervasive, event-based workflow and business processes by declaring condition, response, exclude and include relations between events. To provide a basis for PEPL we extend DCR Graphs to allow 1) events and relations to be parametrized with data values, 2) sub processes to be dynamically created, and 3) specification of events to be executed by a processor. We present the PEPL language and constructs, and we provide a reference to where one can find the first implementation of PEPL, which is made in JavaScript and thus allows the example programs to be defined and executed in a common Web browser.","PeriodicalId":92123,"journal":{"name":"Proceedings of the ... International Workshop on Distributed Event-Based Systems. International Workshop on Distributed Event-Based Systems","volume":"43 1","pages":"377-378"},"PeriodicalIF":0.0,"publicationDate":"2012-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82533940","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Run-time composite event recognition","authors":"A. Artikis, M. Sergot, G. Paliouras","doi":"10.1145/2335484.2335492","DOIUrl":"https://doi.org/10.1145/2335484.2335492","url":null,"abstract":"Events are particularly important pieces of knowledge, as they represent activities of special significance within an organisation: the automated recognition of events is of utmost importance. We present RTEC, an Event Calculus dialect for run-time event recognition and its Prolog implementation. RTEC includes a number of novel techniques allowing for efficient run-time recognition, scalable to large data streams. It can be used in applications where data might arrive with a delay from, or might be revised by, the underlying event sources. We evaluate RTEC using a real-world application.","PeriodicalId":92123,"journal":{"name":"Proceedings of the ... International Workshop on Distributed Event-Based Systems. International Workshop on Distributed Event-Based Systems","volume":"60 1","pages":"69-80"},"PeriodicalIF":0.0,"publicationDate":"2012-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73664755","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}