In 1996, a common trinucleotide circular code, called X, is identified in genes of eukaryotes and prokaryotes (Arquès and Michel, 1996). This circular code X is a set of 20 trinucleotides allowing the reading frames in genes to be retrieved locally, i.e. anywhere in genes and in particular without start codons. This reading frame retrieval needs a window length l of 12 nucleotides (l ≥ 12). Wit...

One of the most critical decisions in the design of a localslant-stack transform (LSST) is the selection of its aperture, or more precisely, the selection of the appropriate number of traces and their weighting coefficients for each slant stack. The challenge is to achieve a good compromise between the slowness and the spatial resolution. Conventionally, the window size is chosen in a more intu...

In this paper, closed-form and polynomial bounds are derived for the residual intercarrier interference (ICI) in orthogonal frequency-division multiplexing (OFDM) systems resulting from Doppler spread or carrier frequency offset (CFO). We consider the idea of equalizing neighboring subcarriers and the residual interference comes from the subcarriers outside of the equalization window. The longe...

An l∞ norm based Source Separation Method has recently been introduced [1, 2], with the corresponding subgradient based algorithm that has a simple update rule. In this article, we propose a moving window modification to this algorithm, where instead of a long fixed window, a shorter length moving window is used. The simulation results for different blind source separation setups suggest that a...

Abstract : An $l_\infty$ norm based Source Separation Method has recently been introduced, with the corresponding subgradient based algorithm that has a simple update rule. In this article, we propose a moving window modification to this algorithm, where instead of a long fixed window, a shorter length moving window is used. The simulation results for different blind source separation setups su...

We study the throughput vs. window-size behavior of the sliding-window protocolon a trunked byte-stream virtual circuit where the node service discipline is processor sharing, background traffic is Poisson with exponentially distributed message lengths, propagation times are a significant fraction of the total delay, and the channel error rate is negligible. For small windows, the throughput is...