FIRE: fractal indexing with robust extensions for image databases

As already documented in the literature, fractal image encoding is a family of techniques that achieves a good compromise between compression and perceived quality by exploiting the self-similarities present in an image. Furthermore, because of its compactness and stability, the fractal approach can be used to produce a unique signature, thus obtaining a practical image indexing system. Since fractal-based indexing systems are able to deal with the images in compressed form, they are suitable for use with large databases. We propose a system called FIRE, which is then proven to be invariant under three classes of pixel intensity transformations and under geometrical isometries such as rotations by multiples of /spl pi//2 and reflections. This property makes the system robust with respect to a large class of image transformations that can happen in practical applications: the images can be retrieved even in the presence of illumination and/or color alterations. Additionally, the experimental results show the effectiveness of FIRE in terms of both compression and retrieval accuracy.     

Self-organized public-key management for mobile ad hoc networks

In contrast with conventional networks, mobile ad hoc networks usually do not provide online access to trusted authorities or to centralized servers, and they exhibit frequent partitioning due to link and node failures and to node mobility. For these reasons, traditional security solutions that require online trusted authorities or certificate repositories are not well-suited for securing ad hoc networks. We propose a fully self-organized public-key management system that allows users to generate their public-private key pairs, to issue certificates, and to perform authentication regardless of the network partitions and without any centralized services. Furthermore, our approach does not require any trusted authority, not even in the system initialization phase.     

Performance limitation due to statistical Raman crosstalk in a WDM system with multiple-wavelength bidirectionally pumped Raman amplification

A general theoretical model of statistical Raman crosstalk and its impact on system performance in a multiwavelength bidirectionally pumped Raman fiber amplifier (RFA) is developed for the first time, where we have taken modulation statistics, dispersion-induced pulse walk-off and signal-induced pump depletion into account. Two kinds of statistical Raman crosstalk, from signal-induced forward-pump depletion and from signal-signal Raman interaction, are included in one model. Formulas for normalized Raman crosstalk, Raman crosstalk-induced relative intensity noise spectral density, and its variance and system performance impact in terms of Q penalty are presented for both a single-span system and a dispersion-compensated multispan wavelength-division-multiplexed (WDM) link. Based on these formulas, we numerically investigate the impact of Raman crosstalk on system performance in a three-wavelengths bidirectionally pumped 40 /spl times/ 40-Gb/s WDM system for various fiber types. In addition, Raman crosstalk in a four-wavelength bidirectionally pumped RFA was experimentally measured. The results agree well with our theory.     

Stability analysis of a feedback-controlled resonant DC-DC converter

This paper reports on the stability analysis of one member of a dual-channel resonant DC-DC converter family. The study is confined to the buck configuration in symmetrical operation. The output voltage of the converter is controlled by a closed loop applying constant-frequency pulsewidth modulation. The dynamic analysis reveals that a bifurcation cascade develops as a result of increasing the loop gain. The trajectory of the variable-structure piecewise-linear nonlinear system pierces through the Poincare plane at the fixed point in state space when the loop gain is small. For stability criterion the positions of the characteristic multipliers of the Jacobian matrix belonging to the Poincare map function defined around the fixed point located in the Poincare plane is applied. In addition to the stability analysis, a bifurcation diagram is developed showing the four possible states of the feedback loop: the periodic, the quasi-periodic, the subharmonic, and the chaotic states. Simulation and test results verify the theory.     

Personal telecommunication radiation safety and the precautionary principle

The approach to risk management for RF and microwave radiation has been to establish guidelines for maximum permissible levels of exposure. These guidelines are based on evaluations of the relevant scientific literature and, with safety margins to account for uncertainties and gaps in scientific knowledge, offer a significant level of protection against established hazards of RF and microwave radiation for short-term exposures. One can argue, on this basis, that the precautionary principle - specifically, safety factors -have been used to guide the making and promulgation of existing permissible-exposure standards for RF and microwave radiation. Therefore, discussions on the appropriateness of the precautionary principle for RF radiation may be "much ado about nothing". Clearly, this approach to "pre caution" neither has stifled technological development, nor has it helped to enforce the acceptance of zero risk, but it provided a basis for action when science was unable to give a clear answer.     

Application of convolutional error correcting codes in ultrawideband M-ary PPM signaling

The interference issues related to ultrawideband (UWB) radio pose tight restrictions on the maximum data rate of UWB radio telecommunication systems. A possible solution is to reduce the required signal to interference ratio (SIR) that gives satisfactory performance to the UWB system. In this letter, we propose coded M-ary UWB radio communication systems. Two classes of convolutional codes, namely, low-rate superorthogonal codes and high-rate punctured codes are considered for this purpose. Simulation results on the bit error rate of the proposed system indicates that the system is capable to work in lower SIR's and therefore supports higher data transmission rates in a real interference environment compared to the previously proposed UWB communication systems.     

From Poldhu to the Italian station of Coltano: Marconi and the first years of transcontinental wireless

This paper presents the evolution of low-frequency, high-power transcontinental transmission, starting from the first successful transatlantic link from Poldhu up to the Italian transcontinental station of Coltano. The trend toward higher and higher transmitting power, and the dead end into which wireless was heading if it were not for research in the higher frequency ranges, are pointed out.     

Perceptually-weighted evaluation criteria for segmentation masks in video sequences

In order to complement subjective evaluation of the quality of segmentation masks, this paper introduces a procedure for automatically assessing this quality. Algorithmically computed figures of merit are proposed. Assuming the existence of a perfect reference mask (ground truth), generated manually or with a reliable procedure over a test set, these figures of merit take into account visually desirable properties of a segmentation mask in order to provide the user with metrics that best quantify the spatial and temporal accuracy of the segmentation masks. For the sake of easy interpretation, results are presented on a peaked signal-to-noise ratio-like logarithmic scale.     

Reducible rank codes and their applications to cryptography

We present a new family of so-called reducible rank codes which are a generalization of rank product codes . This family includes maximal rank distance (MRD) codes for lengths n>N in the field F/sub N/. We give methods for encoding and decoding reducible rank codes. A public key cryptosystem based on these codes and on the idea of a column scrambler is proposed. The column scrambler "mixes" columns of a generator (parity-check) matrix of a code. It makes the system more resistant to structural attacks such as Gibson's attacks. Possible attacks on the system are thoroughly studied. The system is found to be secure against known attacks for public keys of about 16 kbits and greater.     

Graph-theoretic construction of low-density parity-check codes

This article presents a graph-theoretic method for constructing low-density parity-check (LDPC) codes from connected graphs without the requirement of large girth. This method is based on finding a set of paths in a connected graph, which satisfies the constraint that any two paths in the set are either disjoint or cross each other at one and only one vertex. Two trellis-based algorithms for finding these paths are devised. Good LDPC codes of practical lengths are constructed and they perform well with iterative decoding.