Buffer overflows have become the most common target for network-based attacks. They are also the primary propagation mechanism used by worms. Although many techniques (such as StackGuard) have been developed to protect servers from being compromised by buffer overflow attacks, these techniques cause the server to crash. In the face of automated, repetitive attacks such as those due to worms, th...

Importance sampling (IS) is a variance reduction method for simulating rare events. A recent paper by Dupuis, Wang and Sezer (Ann. App. Probab. 17(4):13061346, 2007) exploits connections between IS and subsolutions to a limit HJB equation and its boundary conditions to show how to design and analyze simple and efficient IS algorithms for various overflow events for tandem Jackson networks. The ...

We compare the accretion flow onto the neutron star induced by Roche lobe overflow with that by the overflow from the Be disk, in a zero eccentricity, short period binary with the same mass transfer rate, performing three-dimensional Smoothed Particle Hydrodynamics simulations. We find that a persistent accretion disk is formed around the neutron star in both cases. The circularization radius o...

Despite numerous security technologies crafted to resist buffer overflow vulnerabilities, buffer overflows continue to be the dominant form of software security vulnerability. This is because most buffer overflow defenses provide only partial coverage, and the attacks have adapted to exploit problems that are not well-defended, such as heap overflows. This paper presents PointGuard, a compiler ...

In next generation heterogeneous wireless networks, a user with a multi-mode terminal may have different bearer services using different access technologies. Various approaches can be applied to improve user QoS, such as bandwidth degradation for real-time services, integration of real-time and data traffic, and overflow traffic in overlay networks. In this paper, new techniques are derived to ...

Many deep web data sources are ranked data sources, i.e., they rank the matched documents and return at most the top k number of results even though there are more than k documents matching the query. While estimating the size of such ranked deep web data source, it is well known that there is a ranking bias– the traditional methods tend to underestimate the size when queries overflow ( match m...

In this paper we define the overflow problem of a network coding storage system in which the encoding parameter and the storage parameter are mismatched. Through analyses and experiments, we first show the impacts of the overflow problem in a network coding scheme, which not only waste storage spaces, but also degrade coding efficiency. To avoid the overflow problem, we then develop the network...

In this short paper, the second method of Lyapunov is utilized to establish sufficient conditions for the global asymptotic stability of the trivial solution of zero-input two-dimensional (2-D) Fornasini–Marchesini state-space digital filters which are endowed with a general class of overflow nonlinearities. Results for the global asymptotic stability of the null solution of the 2-D Fornasini–M...

The number of identified integer overflow vulnerabilities has been increasing rapidly in recent years. In this paper, we present a system, IntScope, which can automatically detect integer overflow vulnerabilities in x86 binaries before an attacker does, with the goal of finally eliminating the vulnerabilities. IntScope first translates the disassembled code into our own intermediate representat...

The paper shows that in the analysis of a queuing system with fixed-size batch arrivals, there emerges a set of polynomials which are a generalization of Chebyshev polynomials of the second kind. The paper uses these polynomials in assessing the transient behaviour of the overflow (equivalently call blocking) probability in the system. A key figure to note is the proportion of the overflow (or ...