In this paper GI/G/1 queueing systems with buffer overflows are involved. First, we will give asymptotic expressions for the long-run fraction of rejected customers, in case the buffer capacity K grows large. Furthermore, we give a non-trivial upper and lower bound for this fraction for all K larger than some constant. Finally, we treat a method to speed up the simulation of the fraction of rej...

Because toxicities may differ for Cr(VI) compounds of varying solubility, some countries and organizations have promulgated different occupational exposure limits (OELs) for soluble and insoluble hexavalent chromium (Cr(VI)) compounds, and analytical methods are needed to determine these species in workplace air samples. To address this need, international standard methods ASTM D6832 and ISO 16...

We introduce an architectural software formalism, buffer automata, for the specification, implementation and analysis of a particular class of discrete interactive systems and devices. The approach defines a layer between the physical user interface and the application (if any) and provides a clear framework for highlighting a number of interaction design issues, in particular around modes and ...

Linear hashing with partial expansions is a file organization intended for dynamic files. In this paper an improved version of the method is presented. Instead of having a separate overflow area, the storage area for overflow records is incorporated into the main file. Hence, all the records are stored in one file which grows and shrinks according to the number of records stored. By using sever...

An introduction to the key topics and challenges in Botnet, buffer overflow vulnerability, privacy-preserving and others.

we prove that the class of profinite groups $g$ that have a factorization $g=ab$ with $a$ and $b$ abelian closed subgroups, is closed under taking strict projective limits. this is a generalization of a recent result by k.h.~hofmann and f.g.~russo. as an application we reprove their generalization of iwasawa's structure theorem for quasihamiltonian pro-$p$ groups.

We propose a method to detect circular arcs, including the determinations of their centers, radii, lengths, and midpoints. The center, radius of a circular arc can easily be determined using circular Hough transform. But, the determinations of the arc midpoint and length are more complicated. Theoretical analysis of the centroid of the near peak Hough transform data is presented. Then, the arc ...

The estimation of the statistics of buffer overflows in networks of queues is inherently costly, simply because of the rarity of these events. This paper presents two eztensions to the known theory for finding optimal transformations for simulating such networks. The first is a direct proof of the asymptotic (as buffer size becomes large) optimality of ezchanging the arrival and service rates i...