Minimax Universal Decoding With an Erasure Option

Motivated by applications of rateless coding, decision feedback, and automatic repeat request (ARQ), we study the problem of universal decoding for unknown channels in the presence of an erasure option. Specifically, we harness the competitive minimax methodology developed in earlier studies, in order to derive a universal version of Forney's classical erasure/list decoder, which in the erasure case, optimally trades off between the probability of erasure and the probability of undetected error. The proposed universal erasure decoder guarantees universal achievability of a certain fraction xi of the optimum error exponents of these probabilities (in a sense to be made precise in the sequel). A single-letter expression for xi, which depends solely on the coding rate and the Neyman-Pearson threshold (to be defined), is provided. The example of the binary-symmetric channel is studied in full detail, and some conclusions are drawn     

QoS assessment of 3G video-phone calls by tracing watermarking exploiting the new colour space `YST?

Tracing watermarking has been recently proposed as a technique to provide a blind measure of the quality of service of the communication link, focusing on multimedia communication scenarios. 3G communication scenarios, where each customer transmits both voice and MPEG-4 video sequences in real time, have been considered. Typical video-phone call consists of close shots of speakers, framing their face in the foreground. For such particular application, a novel colour space (YST) is adopted to minimise the perceptual distortions on face coding introduced by watermarking. In the YST space, the luminance component (Y) is the same as in conventional YUV space, whereas the vectors S and T lie within the chrominance (UV) plane. The S (skin) component is a linear combination of U and V obtained as the 'average' chrominance estimated from an assorted set human faces to achieve a reasonable generalisation. The third component, T, is defined as orthogonal to the YS plane. The results show the benefits obtained in digital watermarking by the new representation against the conventional approach. In fact, the sensitivity of the YST representation outperforms the conventional one in terms of objective (mean square error, peak signal-to-noise ratio) and subjective (video-quality metrics) indicators.     

Hidden Markov modeling using a dominant state sequence with application to speech recognition

Approximate maximum likelihood (ML) hidden Markov modeling using the most likely state sequence (MLSS) is examined and compared with the exact ML approach that considers all possible state sequences. It is shown that for any hidden Markov model (HMM), the difference between the approximate and the exact normalized likelihood functions cannot exceed the logarithm of the number of states divided by the dimension of the output vectors (frame length), which is negligible for typically used values of vector dimension (128–256) and number of states (2–30). Furthermore, for Gaussian HMMs and a given observation sequence, the MLSS is typically the sequence of nearest neighbor states in the Itakura-Saito sense, and the posterior probability of any state sequence which departs from the MLSS in a single time instant decays exponentially with the frame length. Hence, for a sufficiently large frame length the exact and approximate ML approaches provide similar model estimates and likelihood values. The results and their implications on speech recognition are demonstrated in a set of experiments.     

Fast Inverse Motion Compensation Algorithms for MPEG and for Partial DCT Information

In prior work, we developed a fast inverse motion compensation method that can be implemented directly on the DCT domain representation derived from the compressed bitstreams conforming to MPEG, H.261, and H.263 standards. That work was restricted to compressed-domain representations wherein the motion-vectors have integer pel accuracy. Here, we extend this work to fractional-pel accurate motion-vectors. We also extend the prior work to speed up the inverse motion compensation process in the DCT domain by explicitly exploiting the sparseness of the DCT domain representation. Using partial DCT information, we show that the DCT domain method has substantially lower operation count than the conventional spatial domain approach which requires decompression followed by inverse motion-compensation.     

K- and Cs-FeV/Al2O3soot combustion catalysts for diesel exhaust treatment

Alkali-doped FeV oxide catalysts supported on -alumina were prepared and their catalytic activity in the combustion of diesel soot is reported. The catalysts were characterized by XRD, TPR and SEM–EDX analysis. The influence of the nature of the alkali metal (K and Cs), the temperature of treatment of the catalysts and the stability to sulfur poisoning have been investigated.

Catalysts doped with Cs were the most active and stable also after several combustion cycles and in the presence of sulfur in the stream. The activity measurements and microstructural results suggest that the combustion of soot is favored on catalysts where amorphous phases and/or mixed Fe---V---O phases, ensuring an intimate contact between iron and vanadium, are present. A reaction mechanism involving the participation of the redox couple Fe(II)–Fe(III) in the activation of the vanadium combustion sites, is proposed.     

Nanostructured Materials for Room‐Temperature Gas Sensors

Sensor technology has an important effect on many aspects in our society, and has gained much progress, propelled by the development of nanoscience and nanotechnology. Current research efforts are directed toward developing high‐performance gas sensors with low operating temperature at low fabrication costs. A gas sensor working at room temperature is very appealing as it provides very low power consumption and does not require a heater for high‐temperature operation, and hence simplifies the fabrication of sensor devices and reduces the operating cost. Nanostructured materials are at the core of the development of any room‐temperature sensing platform. The most important advances with regard to fundamental research, sensing mechanisms, and application of nanostructured materials for room‐temperature conductometric sensor devices are reviewed here. Particular emphasis is given to the relation between the nanostructure and sensor properties in an attempt to address structure–property correlations. Finally, some future research perspectives and new challenges that the field of room‐temperature sensors will have to address are also discussed.     

On the Wyner-Ziv problem for individual sequences

We consider a variation of the Wyner-Ziv (W-Z) problem pertaining to lossy compression of individual sequences using finite-state encoders and decoders. There are two main results in this paper. The first characterizes the relationship between the performance of the best M-state encoder-decoder pair to that of the best block code of size /spl lscr/ for every input sequence, and shows that the loss of the latter relative to the former (in terms of both rate and distortion) never exceeds the order of (logM)//spl lscr/, independently of the input sequence. Thus, in the limit of large M, the best rate-distortion performance of every infinite source sequence can be approached universally by a sequence of block codes (which are also implementable by finite-state machines). While this result assumes an asymptotic regime where the number of states is fixed, and only the length n of the input sequence grows without bound, we then consider the case where the number of states M=M/sub n/ is allowed to grow concurrently with n. Our second result is then about the critical growth rate of M/sub n/ such that the rate-distortion performance of M/sub n/-state encoder-decoder pairs can still be matched by a universal code. We show that this critical growth rate of M/sub n/ is linear in n.     

Multistage Switching Architectures for Software Routers

Software routers based on personal computer (PC) architectures are becoming an important alternative to proprietary and expensive network devices. However, software routers suffer from many limitations of the PC architecture, including, among others, limited bus and central processing unit (CPU) bandwidth, high memory access latency, limited scalability in terms of number of network interface cards, and lack of resilience mechanisms. Multistage PC-based architectures can be an interesting alternative since they permit us to i) increase the performance of single- software routers, ii) scale router size, iii) distribute packet-manipulation and control functionality, iv) recover from single-component failures, and v) incrementally upgrade router performance. We propose a specific multistage architecture, exploiting PC-based routers as switching elements, to build a high-speed, large-size, scalable, and reliable software router. A small-scale prototype of the multistage router is currently up and running in our labs, and performance evaluation is under way.