This document discusses verification and debug of high-speed I/O using the on-die instrumentation (ODI) features of the Altera 28-nm Stratix® V device. In line with Moore's law, I/O technology trends continue to double in speed and data rates every two to three years. As the speed and data rates of I/Os increase, new verification and test challenges emerge. This white paper describes the challe...

Cellular internalization of nanoparticles requires the full wrapping of the nanoparticles by the cell membrane. This wrapping process can occur spontaneously if the adhesive interactions between the nanoparticles and the membranes are sufficiently strong to compensate for the cost of membrane bending. In this article, we show that the membrane curvature prior to wrapping plays a key role for th...

Image denoising using wavelet transform has been successful as wavelet transform generates a large number of small coefficients and a small number of large coefficients. Basic denoising algorithm that using the wavelet transform consists of three steps – first computing the wavelet transform of the noisy image, thresholding is performed on the detail coefficients in order to remove noise and fi...

In abiotic degradation the action of light radiation is one of the most important parameters, because polymers undergo degradation due to the action of light (natural or artificial). The aim of this study was to investigate the degradation rate for samples of polypropylene (PP) modified with an organic pro-degradant submitted to ageing in a natural environment and to accelerated ageing test. Th...

The wrapping eeect is one of the main reasons that the application of interval arithmetic to the enclosure of dynamical systems is diicult. In this paper the source of wrapping is analyzed algebraically and geometrically. A new method for reducing the wrapping eeect is proposed, based on an interval ellipsoid arithmetic. Applications are given to the veriication of stability regions for nonline...

Given a set S of n non-intersecting line segments in the plane, we present an algorithm that computes the 2n visibility polygons of the endpoints of S, in output sensitive time. The algorithm relies on the ordered endpoint visibility graph information to traverse the endpoints of S in a spiral-like manner using a combination of Jarvis' March and depthrst search. One extension of this result is ...