scholarly journals Analysis of an algorithm catching elephants on the Internet

2008 ◽  
Vol DMTCS Proceedings vol. AI,... (Proceedings) ◽  
Author(s):  
Yousra Chabchoub ◽  
Christine Fricker ◽  
Frédéric Meunier ◽  
Danielle Tibi

International audience The paper deals with the problem of catching the elephants in the Internet traffic. The aim is to investigate an algorithm proposed by Azzana based on a multistage Bloom filter, with a refreshment mechanism (called $\textit{shift}$ in the present paper), able to treat on-line a huge amount of flows with high traffic variations. An analysis of a simplified model estimates the number of false positives. Limit theorems for the Markov chain that describes the algorithm for large filters are rigorously obtained. The asymptotic behavior of the stochastic model is here deterministic. The limit has a nice formulation in terms of a $M/G/1/C$ queue, which is analytically tractable and which allows to tune the algorithm optimally.

2002 ◽  
Vol Vol. 5 ◽  
Author(s):  
Guy Louchard ◽  
Helmut Prodinger

International audience Using generating functions and limit theorems, we obtain a stochastic description of Carlitz compositions of large integer n (i.e. compositions two successive parts of which are different). We analyze: the number M of parts, the number of compositions T(m,n) with m parts, the distribution of the last part size, the correlation between two successive parts, leading to a Markov chain. We describe also the associated processes and the limiting trajectories, the width and thickness of a composition. We finally present a typical simulation. The limiting processes are characterized by Brownian Motion and some discrete distributions.


2010 ◽  
Vol Vol. 12 no. 3 (Graph and Algorithms) ◽  
Author(s):  
Milan Bradonjic ◽  
Tobias Mueller ◽  
Allon G. Percus

Graphs and Algorithms International audience We propose a coloring algorithm for sparse random graphs generated by the geographical threshold graph (GTG) model, a generalization of random geometric graphs (RGG). In a GTG, nodes are distributed in a Euclidean space, and edges are assigned according to a threshold function involving the distance between nodes as well as randomly chosen node weights. The motivation for analyzing this model is that many real networks (e. g., wireless networks, the Internet, etc.) need to be studied by using a ''richer'' stochastic model (which in this case includes both a distance between nodes and weights on the nodes). Here, we analyze the GTG coloring algorithm together with the graph's clique number, showing formally that in spite of the differences in structure between GTG and RGG, the asymptotic behavior of the chromatic number is identical: chi = ln n/ln ln n(1 +o(1)). Finally, we consider the leading corrections to this expression, again using the coloring algorithm and clique number to provide bounds on the chromatic number. We show that the gap between the lower and upper bound is within C ln n/(ln ln n)(2), and specify the constant C.


Author(s):  
Nestor J. Zaluzec

The Information SuperHighway, Email, The Internet, FTP, BBS, Modems, : all buzz words which are becoming more and more routine in our daily life. Confusing terminology? Hopefully it won't be in a few minutes, all you need is to have a handle on a few basic concepts and terms and you will be on-line with the rest of the "telecommunication experts". These terms all refer to some type or aspect of tools associated with a range of computer-based communication software and hardware. They are in fact far less complex than the instruments we use on a day to day basis as microscopist's and microanalyst's. The key is for each of us to know what each is and how to make use of the wealth of information which they can make available to us for the asking. Basically all of these items relate to mechanisms and protocols by which we as scientists can easily exchange information rapidly and efficiently to colleagues in the office down the hall, or half-way around the world using computers and various communications media. The purpose of this tutorial/paper is to outline and demonstrate the basic ideas of some of the major information systems available to all of us today. For the sake of simplicity we will break this presentation down into two distinct (but as we shall see later connected) areas: telecommunications over conventional phone lines, and telecommunications by computer networks. Live tutorial/demonstrations of both procedures will be presented in the Computer Workshop/Software Exchange during the course of the meeting.


Author(s):  
Courtney Deine-Jones

As more libraries offer patron access to the Internet and other on-line services, they must consider the needs of patrons with disabilities who will be using their Internet links either from the library or from remote sites. In planning and implementing technological improvements to optimize access for all patrons, librarians and information specialists must take into account questions of both physical and intellectual access to electronic information. This paper addresses these issues from a pragmatic perspective, reviewing available options and suggesting strategies for improving access for people with various disabilities.


1978 ◽  
Vol 15 (1) ◽  
pp. 65-77 ◽  
Author(s):  
Anthony G. Pakes

This paper develops the notion of the limiting age of an absorbing Markov chain, conditional on the present state. Chains with a single absorbing state {0} are considered and with such a chain can be associated a return chain, obtained by restarting the original chain at a fixed state after each absorption. The limiting age, A(j), is the weak limit of the time given Xn = j (n → ∞).A criterion for the existence of this limit is given and this is shown to be fulfilled in the case of the return chains constructed from the Galton–Watson process and the left-continuous random walk. Limit theorems for A (J) (J → ∞) are given for these examples.


2005 ◽  
Vol 293-294 ◽  
pp. 365-372 ◽  
Author(s):  
Yong Yong He ◽  
Wen Xiu Lu ◽  
Fu Lei Chu

The steam turboset is the key equipment of the electric power system. Thus, it is very important and necessary to monitor and diagnose the running condition and the faults of the steam turboset for the safe and normal running of the electric power system. In this paper, the Internet/Intranet based remote condition monitoring and fault diagnosis scheme is proposed. The corresponding technique and methods are discussed in detail. And a real application system is developed for the 300MW steam turboset. In this scheme, the system is built on the Internet/Intranet and the Client/Server construction and Web/Server model are adopted. The proposed scheme can guarantee real-time data acquisition and on-line condition analysis simultaneously. And especially, the remote condition monitoring and fault diagnosis can be implemented effectively. The developed system has been installed in a power plant of China. And the plant has obtained great economic benefits from it.


2008 ◽  
Vol 204 (1) ◽  
pp. 99-108 ◽  
Author(s):  
Yongsheng Ding ◽  
Min Xu ◽  
Liangjian Hu

1965 ◽  
Vol 2 (1) ◽  
pp. 178-185
Author(s):  
Martin Fox

Certain patches of ground are favorable to the formation of fair weather cumulus clouds. These are patches which reflect rather than absorb solar heat. As the air above these patches is warmed, it will rise and, if the humidity is sufficient, the cooling effect of higher elevation will cause formation of a cloud of the type known as the fair weather cumulus. This fact is used in the present paper to develop a stochastic model for the temporal evolution of the contribution to cloud cover by fair weather cumuli.


Sign in / Sign up

Export Citation Format

Share Document