Numerous security technologies which detect buffer overflow have already proposed. Almost these technologies detect if buffer overflows happen or not, but don’t detect alteration of variable integrity. But there are attacks which are not be able to be defenced unless the technology detect alteration of variable integrity. So in this paper, we propose a system which detect alteration of variable...

Heap based buffer overflows are a dangerous class of vulnerability. One countermeasure is randomizing the location of heap memory blocks. Existing techniques segregate the address space into clusters, each of which is used exclusively for one block size. This approach requires a large amount of address space reservation, and results in lower location randomization for larger blocks. In this pap...

Horn recursion is a term used to describe when non-vanishing products of Schubert classes in the cohomology of complex flag varieties are characterized by inequalities parameterized by similar non-vanishing products in the cohomology of “smaller” flag varieties. We consider the type A partial flag variety and find that its cohomology exhibits a Horn recursion on a certain deformation of the cup...

In mobile computing scenario, the number of handoff (called as handoff counting) is very important for the signalling network design and traffic load analysis. In this paper, we study the handoff counting characteristics in terms of probability mass function (pmf) and statistical moments in the hierarchical cellular system applying overflow scheme under the general cell residence time and gener...

Abstract: This paper studies the asymptotic behavior of the steady-state waiting time, W∞, of the M/G/1 queue with subexponenential processing times for different combinations of traffic intensities and overflow levels. In particular, we provide insights into the regions of large deviations where the so-called heavy traffic approximation and heavy tail asymptotic hold. For queues whose service ...

In this paper we describe a C++ implementation of a hybrid system combining SLI (symmetric level-index) arithmetic and FLP (floating-point) arithmetic. The principal motivation for the work to be presented is to promote the use of SLI arithmetic as a practical framework for scientific computing. This hybrid arithmetic is essentially overflow and underflow free, and its implementation has shown ...

A model for an index sequential file employing multiple overflow chains per bucket is developed. This model is used to analyse the effects of insertions and deletions on the cost of successful and unsuccessful search in terms of block accesses. Numerical results are obtained illustrating the performance. The performance is also compared with that of an ISAM file using only one overflow chain pe...

Repeated modular additions and overflow detection are possible in redundant hybrid number systems (RHNS). In this paper a circuit is proposed that implements the overflow-detecting procedure in such systems and allows a mean addition time of about 10.5 gate delays for numbers having a magnitude order normally distributed in the range [−233, 233 − 1], versus a 14 gate delay required by 32-bit CL...

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...