851,004 Hits in 6.4 sec

Continuous distributed monitoring

Graham Cormode
2011 Proceedings of the First International Workshop on Algorithms and Models for Distributed Event Processing - AlMoDEP '11  
This survey introduces this model, and describe a selection results in this setting, from the simple counting problem to a variety of other functions that have been studied.  ...  In the model of continuous distributed monitoring, a number of observers each see a stream of observations. Their goal is to work together to compute a function of the union of their observations.  ...  Muthukrishnan and Ke Yi for comments and suggestions. Thanks also to Luigi Laura for encouraging me to finish this survey on time.  ... 
doi:10.1145/2031792.2031793 dblp:conf/almodep/Cormode11 fatcat:2pukvnyvujekpnnz6lunuwl2mq

A model for continuous query latencies in data streams

Roberto Baldoni, Giuseppe Antonio Di Luna, Donatella Firmani, Giorgia Lodi
2011 Proceedings of the First International Workshop on Algorithms and Models for Distributed Event Processing - AlMoDEP '11  
In this paper we propose a formal model for characterizing latencies affecting the computation of a continuous query either in a Data Stream Management System (DSMS) or in a Complex Event Processing (CEP  ...  In order to model the continuous query we use an acyclic directed (data-flow) graph whose nodes are the EPUs and edges represent the flow of information (events) processed by the EPUs themselves.  ...  SYSTEM MODEL Event Processing Unit.  ... 
doi:10.1145/2031792.2031796 dblp:conf/almodep/BaldoniLFL11 fatcat:gnv4gh2smjgvvfhkkhcogfgtca

Characterizing the adversarial power in uniform and ergodic node sampling

Emmanuelle Anceaume, Yann Busnel, Sébastien Gambs
2011 Proceedings of the First International Workshop on Algorithms and Models for Distributed Event Processing - AlMoDEP '11  
This sample is built out of a stream of events received at each node.  ...  The former model allows us to derive lower bounds on the impact that the adversary has on the sampling functionality while the latter one corresponds to a realistic model.  ...  The 1st International Workshop on Algorithms and Models for Distributed Event Processing (AlMoDEP '11) collocated with the 25th International Symposium on Distributed Computing (DISC 2011).  ... 
doi:10.1145/2031792.2031795 dblp:conf/almodep/AnceaumeBG11 fatcat:hebyufrj2bbjrkuxaoqielfy6m

Revisiting Snapshot Algorithms by Refinement-Based Techniques

Manamiary Bruno Andriamiarina, Dominique Mery, Neeraj Kumar Singh
2012 2012 13th International Conference on Parallel and Distributed Computing, Applications and Technologies  
The formalization process is based on a modeling language Event B, which supports a refinement-based incremental development using RODIN platform.  ...  Among existing solutions, Chandy and Lamport have proposed a simple distributed algorithm.  ...  We are mainly interested by providing recipes for using the Event B framework and refinement for developing the distributed algorithms.  ... 
doi:10.1109/pdcat.2012.119 dblp:conf/pdcat/AndriamiarinaMS12 fatcat:33vveeaxdjgizbbi32wqbjunq4

Revisiting snapshot algorithms by refinement-based techniques

Bruno Andriamiarina, Dominique Méry, Kumar Singh
2014 Computer Science and Information Systems  
The formalization process is based on a modeling language Event B, which supports a refinement-based incremental development using RODIN platform.  ...  Among the existing solutions, Chandy and Lamport propose a simple distributed algorithm.  ...  The model LOC-PROCESS, refining PROCESS, localizes informations and describes a model for the Lai and Yang algorithm.  ... 
doi:10.2298/csis130122007a fatcat:ci6zwtafqndppdkm7uerqzjita

Automatic Generation of DistAlgo Programs from Event-B Models [chapter]

Alexis Grall
2020 Lecture Notes in Computer Science  
The DistAlgo language is a highlevel programming language for distributed algorithms.  ...  The Event-B language combines refinement techniques and state based modelling and is adapted to the verification of distributed systems [3, 12] .  ...  Development of the Transformation The LB language [5] defines a distributed algorithm in Event-B as a collection of processes with a specific local algorithm for each process.  ... 
doi:10.1007/978-3-030-48077-6_34 fatcat:a4mbawsb6vevzasaf4echw4izm

VISIRI - Distributed Complex Event Processing System for Handling Large Number of Queries [chapter]

Malinda Kumarasinghe, Geeth Tharanga, Lasitha Weerasinghe, Ujitha Wickramarathna, Surangika Ranathunga
2015 Lecture Notes in Computer Science  
Distributed CEP systems have been identified as the best alternative for this.  ...  The CEP query distribution algorithm in VISIRI is able to distribute a large number of queries among a set of CEP nodes in such a way that the event duplication in the network is minimized while not compromising  ...  The query distribution algorithm in the SCTXPF system is optimized for large number of complex event processing queries and for very high events rates.  ... 
doi:10.1007/978-3-319-19282-6_15 fatcat:rzfr7y4c3rdqflyzuj2rebhvum

Research on Emergency Logistics Scheduling Model Based on Disruptions

Fu Ke-jun, Hu Xiang-pei, Wang Xu-ping
2006 2006 International Conference on Management Science and Engineering  
From the views of emergency logistics scheduling, the disruption events during the process of logistics distribution are discussed and classified into three groups by its impacts on the status of goods  ...  The method proposed in this paper will supply a new perspective for the research of theory and decision support application in the disposal of disruptions and real time controlling during logistics distribution  ...  model can only used to specific distribution circumstances and there are so many kinds of logistics distribution models and algorithms.  ... 
doi:10.1109/icmse.2006.314174 fatcat:snmhfklvd5btnbgeqjsitocnuy

Generating Distributed Programs from Event-B Models

Horatiu Cirstea, Alexis Grall, Dominique Méry
2020 Electronic Proceedings in Theoretical Computer Science  
In this paper, we present an approach for combining correct-by-construction approaches and transformations of formal models (Event-B) into programs (DistAlgo) to address the design of verified distributed  ...  The refinement process and the soundness of the transformation allow one to produce correct-by-construction distributed programs.  ...  Modelling Distributed Algorithms in EVENT-B We use the modelling technique of G.  ... 
doi:10.4204/eptcs.320.8 fatcat:elzebiuvhfa3fkdecvej6pcyeq


Nosir Bakhshilloevich Narziev, Khushbakov Sherzod, Khamraev Mansur, Bakhtiyorova Mokhiruy
2022 Zenodo  
Practical aspects of modeling are investigated algorithms and methods of ranking in e-commerce systems. An algorithmically optimal way to generate events for simulation of buy/sell events.  ...  Showing how to use data structures to obtain the optimal implementation of algorithms ranking.  ...  Modeling of ranking algorithms. The task of modeling the ranking algorithm is reduced to modeling of two processes: the sales process and the ranking.  ... 
doi:10.5281/zenodo.6572174 fatcat:jqrvdrlb3fdexnjy3ljdvibqxa

Applying MapReduce to Conformance Checking
Применение MapReduce для проверки соответствия моделей процессов и логов событий

I.S. Shugurov, A.A. Mitsyuk
2016 Proceedings of the Institute for System Programming of RAS  
Conformance checking algorithms are aimed to assess how well a given process model, typically represented by a Petri net, and a corresponding event log fit each other.  ...  MapReduce is a popular model of parallel computing which allows for simple implementation of efficient and scalable distributed calculations.  ...  A typical process discovery algorithm takes an even log as an input parameter and constructs a process model which adequately describes the behavior observed in the event log.  ... 
doi:10.15514/ispras-2016-28(3)-7 fatcat:mngicibgavh5nbulzb4gcdvv4y

Tool integration for flexible simulation of distributed algorithms

Shashank Khanvilkar, Sol M. Shatz
2001 Software, Practice & Experience  
This is a simple algorithm that is used to establish causal ordering of events occurring in different processes.  ...  We found that our approach encourages re-use of models in terms of using simpler models as a basis for building more complex models -this can make the development of distributed algorithms faster and simpler  ...  Oliver Yu, for lending us, both the software and the hardware for carrying out our experiments.  ... 
doi:10.1002/spe.419 fatcat:kaxkg2hkund2nhgmwxp7qpllxu

A Renewal Model of Intrusion [article]

David Tolpin
2018 arXiv   pre-print
We present a probabilistic model of an intrusion in a renewal process. Given a process and a sequence of events, an intrusion is a subsequence of events that is not produced by the process.  ...  We evaluate the model for intrusion detection on synthetic data and on anonymized data from an online payment system.  ...  Renewal processes [5] are used to model arrival of events where hold times between events are independently distributed.  ... 
arXiv:1709.08163v5 fatcat:dqxu7ys2wrckxaithpsb7crvtq

Counterfactual Temporal Point Processes [article]

Kimia Noorbakhsh, Manuel Gomez Rodriguez
2022 arXiv   pre-print
To this end, we first develop a causal model of thinning for temporal point processes that builds upon the Gumbel-Max structural causal model.  ...  Then, given an observed realization of a temporal point process with a given intensity function, we develop a sampling algorithm that uses the above causal model of thinning and the superposition theorem  ...  Acknowledgements We would like to thank William Trouleau for sharing with us a pre-processed version of the Ebola dataset as well as the fitted stochastic block model we used in our simulation experiments  ... 
arXiv:2111.07603v2 fatcat:iaa6gmara5dflcqcov5sgcv3wm

Event Monitoring using Distributed Pattern Recognition Approach on Integrated IoT-Blockchain Network

Anang Hudaya Muhamad Amin, Nazrul Muhaimin Ahmad, Subarmaniam Kannan
2019 Advances in Science, Technology and Engineering Systems  
Combining this IoT event monitoring capabilities with blockchain-based data storage and verification could leads towards a scalable event detection and monitoring model for large-scale network.  ...  In this paper, we present a distributed event monitoring scheme using a Hierarchical Graph Neuron (HGN) distributed pattern recognition algorithm.  ...  GN-Based Approach for Event Monitoring Graph Neuron (GN) is a single-cycle learning distributed pattern recognition algorithm that utilizes the in-network processing model [11] .  ... 
doi:10.25046/aj040432 fatcat:npweyq4penadfd5b7vc4uyta6m
« Previous Showing results 1 — 15 out of 851,004 results