A generalized correlation attack on a class of stream ciphers based on the Levenshtein distance

A statistical approach to cryptanalysis of a memoryless function of clock-controlled shift registers is introduced. In the case of zero-order correlation immunity, an algorithm for a shift register initial state reconstruction based on the sequence comparison concept is proposed. A constrained Levenshtein distance relevant for the cryptanalysis is defined and a novel recursive procedure for its efficient computation is derived. Preliminary experimental results are given and open theoretic problems are discussed.Following [11], a Boolean function f(x ₁,..., x _n) is said to be mth-order correlation immune if m is the maximum integer such that the random variable f(X ₁,..., X _n) is statistically independent of every set of m random variables chosen from the balanced and independent binary random variables X ₁,..., X _n.     

New neural method for bias dependent noise modelling of microwave transistors

A new method for accurate determination of noise parameters of microwave transistors for various bias conditions is proposed in this paper. The proposed model consists of a transistor empirical noise model (modification of Pospieszalski’s noise model) and two artificial neural networks. With the aim to avoid extraction of the empirical model parameters for each bias point, an artificial neural network is used to introduce bias-dependence of the equivalent circuit parameters. Accuracy of such bias-dependent model is further improved by using an additional neural network aimed to correct the noise parameters’ values. The proposed modeling approach is exemplified by modelling of a MESFET device in packaged form. The noise parameters obtained by the simulation agree well with the measured data.     

The application of Ramo's theorem to the impulse response calculation of a reach-through avalanche photodiode

A method for calculation the impulse response of a depletion layer of a semiconductor device based on Ramo's theorem is described. Using this method the impulse response of a reach-through avalanche photodiode is derived.     

A multimodal hand-based verification system with an aliveness-detection module

This paper presents a multimodal biometrie verification system based on the following hand features: palmprint, four digitprints and four fingerprints. The features are obtained using the Karhunen-Loève transform based approach, and information fusion at the matching-score level was applied. We experimented with different resolutions of the regions of interest, different numbers of features and several normalization and fusion techniques at the matching-score level. To increase the reliability of the system to spoof attacks we included an aliveness-detection module based on thermal images of the hand dor sa. The verification performance when using a system configuration with optimum parameters, i.e., resolution, number of features, normalization and fusion technique, showed an equal error rate (EER) of 0.0020%, which makes the system appropriate for the implementation of high-security biometric systems.     

Characterization and Optimization of a Resonant Cavity Enhanced P-i-N Photodiode Response

This paper presents linear pulse response of a Resonant Cavity Enhanced (RCE) P-i-N fotodiode. The RCE P-i-N photodiode designed for high-speed aplication is analysed for various submicron thicknesses of absorption layer, bias voltages, active areas and incident pulse optical excitations. The results are obtained by numerical simulation of the complete phenomenological model for two valley semiconductor. Great enhancement of the quantum efficiency and the product bandwidth-quantum efficiency, is obvious from obtained results for this photodiode type.     

Explicit form of new class of extremal filter functions with mini-max behaviour of summed sensitivity function

In this article, the all-pole low-pass filter function with mini-max for the summed sensitivity function in the pass-band is considered. With the application of Chebyshev polynomials of the first kind, the proposed filter function is obtained in an explicit form with a maximum number of oscillations of the summed sensitivity function in the pass-band. The calculation of the filter function is derived by using the summed sensitivity function as a starting point. New original approximation function is derived in order to achieve a mini-max summed sensitivity function in the filter pass-band. Sensitivity analysis is carried out and a comparison of the summed sensitivity and the group delay of the proposed and classical all-pole filters is given. Minimisation of the summed sensitivity function is important for reduction of the deviation of the magnitude response caused by temperature changes of the continuous-time active filters implemented into the analogue front end or as programmable chips.     

BPC – A binary priority countdown protocol

In modern wireless ad hoc networks, with a high speed PHY, every collision means a significant loss of useful bandwidth. In the last few years different binary contention protocols have been introduced to address this problem. In this work we propose a novel binary contention protocol called binary priority countdown (BPC) protocol, whose goal is to reduce collisions as well as contention time. BPC uses a new priority countdown mechanism which exploits the efficiency of binary countdown, but the priority countdown process is not constrained to a single binary countdown round. This way, the priority space is not defined by the length of binary countdown round, like in other binary countdown protocols proposed in the literature, and arbitrary medium access priorities can be decremented through multiple binary countdown rounds if necessary. The ability of a new priority countdown mechanism to count down any priority number without changing the length of a binary countdown round, allows independent management of priority space. This “independence” of priority space introduces new optimization and adaptation possibilities. Collision memory effect is recognized and described. BPC protocol reveals connection between unary, binary and digit contention protocols. All three groups of protocols can now be seen as members of the same class of contention algorithms. Preliminary simulation results are shown.     

Analysis of blocking probability in optical burst switched networks

In this article, we study the blocking probability in a wavelength division multiplexing (WDM) based asynchronous bufferless optical burst switched (OBS) network, equipped with a bank of wavelength converters. Our analysis encloses two wavelength reservation schemes JIT (just-in-time) and JET (just-enough-time), and two-class data rate. The contribution of our work includes: (i) derivation of an accurate model for blocking probability of lower priority bursts in case of a non-preempted model; (ii) provision of the analytical model for blocking probability calculation in the OBS network, which includes these variables: two signaling schemes, partial wavelength conversion, two-class data, traffic intensity, cross-connect speed, number of wavelengths in WDM fiber, number of fibers in the node, number of wavelength converters, and number of nodes in the path; (iii) simulation results, which show that partial wavelength conversion provide quite satisfactory quality of service. We compare performance in a single OBS node, under various sets of parameter values. The OBS network shows great flexibility in terms of used multiclass data, and there is no dependence on the used higher layer protocol.     

Progressive Compression of 3D Mesh Geometry Using Sparse Approximations from Redundant Frame Dictionaries

In this paper, we present a new approach for the progressive compression of three‐dimensional (3D) mesh geometry using redundant frame dictionaries and sparse approximation techniques. We construct the proposed frames from redundant linear combinations of the eigenvectors of a combinatorial mesh Laplacian matrix. We achieve a sparse synthesis of the mesh geometry by selecting atoms from a frame using matching pursuit. Experimental results show that the resulting rate‐distortion performance compares favorably with other progressive mesh compression algorithms in the same category, even when a very simple, sub‐optimal encoding strategy is used for the transmitted data. The proposed frames also have the desirable property of being able to be applied directly to a manifold mesh having arbitrary topology and connectivity types; thus, no initial remeshing is required and the original mesh connectivity is preserved.