Rate-distortion optimized tree-structured compression algorithms for piecewise polynomial images.

This paper presents novel coding algorithms based on tree-structured segmentation, which achieve the correct asymptotic rate-distortion (R-D) behavior for a simple class of signals, known as piecewise polynomials, by using an R-D based prune and join scheme. For the one-dimensional case, our scheme is based on binary-tree segmentation of the signal. This scheme approximates the signal segments using polynomial models and utilizes an R-D optimal bit allocation strategy among the different signal segments. The scheme further encodes similar neighbors jointly to achieve the correct exponentially decaying R-D behavior (D(R) - c(o)2(-c1R)), thus improving over classic wavelet schemes. We also prove that the computational complexity of the scheme is of O(N log N). We then show the extension of this scheme to the two-dimensional case using a quadtree. This quadtree-coding scheme also achieves an exponentially decaying R-D behavior, for the polygonal image model composed of a white polygon-shaped object against a uniform black background, with low computational cost of O(N log N). Again, the key is an R-D optimized prune and join strategy. Finally, we conclude with numerical results, which show that the proposed quadtree-coding scheme outperforms JPEG2000 by about 1 dB for real images, like cameraman, at low rates of around 0.15 bpp.     

Reverse Authentication in Financial Transactions and Identity Management

New families of protocol, based on communication over human-based side channels, permit secure pairing or group formation in ways such that no party has to prove its name. Rather, individuals are able to hook up devices in their possession to others that they can identify by context. We examine a model in which, to prove his or her identity to a party, the user first uses one of these “human-interactive security protocols” or HISPs to connect to it. Thus, when authenticating A to B, A first authenticates a channel she has to B: the reverse direction. This can be characterised as bootstrapping a secure connection using human trust. This provides new challenges to the formal modelling of trust and authentication.     

A cross-layer analysis of TCP/link adaptation technologies over free-space optical links with Markov error model

This paper presents a comprehensive cross-layer framework on the performance of transmission control protocol (TCP) over a free-space optical (FSO) link, which employs automatic repeat request (ARQ) and adaptive modulation and coding (AMC) schemes. Not similar to conventional works in the literature of FSO, we conduct a Markov error model to accurately capture effects of burst errors caused by atmospheric turbulence on cross-layer operations. From the framework, we quantify the impacts of different parameters/settings of ARQ, AMC, and the FSO link on TCP throughput performance. We also discuss several optimization aspects for TCP performance.     

Performance Bound for LDPC Coded Unitary Space–Time Modulation

This paper is concerned with the bit error probability (BEP) of coded unitary space–time modulation systems based on finite-length low density parity check (LDPC) codes. The union bound on the BEP of the maximum likelihood (ML) decoding is derived for any code rate, unitary space–time constellation and mapping. The tightness of the bound is checked with simulation results of the ordered statistic decoding (OSD). Numerical and simulation results show that the union bound is also close to the error performance of the sum–product (SP) decoding at low BEP levels when Gray mapping is employed. The derived bound is useful to benchmark the error performance of finite-length coded unitary space–time modulation systems, especially for those that employ short-to-medium length LDPC codes.

Indium and tin oxide nanowires by vapor-liquid-solid growth technique

Regular three-dimensional (3-D) arrays of crystalline SnO₂-In₂O₃ nanowires were produced on m-sapphire using a gold catalyst-assisted vapor-liquid-solid growth process. The growth characteristics at multiple growth conditions were analyzed using scanning electron microscopy (SEM), transmission electron microscopy (TEM), selected area electron diffraction (SAED), x-ray photoemission spectroscopy (XPS), and Rutherford backscattering spectroscopy (RBS) to evaluate the functional dependence of nanowire structure and composition on growth parameters such as temperature and source composition. The results indicate that nanowires of mixed composition are not possible from the catalytic clusters; rather, a mixture of indium and tin oxide wires are formed in the range of conditions investigated here.     

Study for the non-contact characterization of metallization ageing of power electronic semiconductor devices using the eddy current technique

The ageing of the metallization layers of power semiconductor dies may be the cause of failure of power semiconductor modules. Usual indicators of failure like on-state voltage drops make it difficult to highlight the deterioration of the metallization layer. In this study, we evaluate the relevance of the characterization of power device metallizations by means of the eddy current sensors. Experimental results show the ability to monitor the state and the evolution of the metallization ageing with such a technique.     

Linear phase paraunitary filter bank with filters of differentlengths and its application in image compression

In this paper, the theory, structure, design, and implementation of a new class of linear-phase paraunitary filter banks (LPPUFBs) are investigated. The novel filter banks with filters of different lengths can be viewed as the generalized lapped orthogonal transforms (GenLOTs) with variable-length basis functions. Our main motivation is the application in block-transform-based image coding. Besides having all of the attractive properties of other lapped orthogonal transforms, the new transform takes advantage of its long, overlapping basis functions to represent smooth signals in order to reduce blocking artifacts, whereas it reserves short basis functions for high-frequency signal components like edges and texture, thereby limiting ringing artifacts. Two design methods are presented, each with its own set of advantages: the first is based on a direct lattice factorization, and the second enforces certain relationships between the lattice coefficients to obtain variable length filters. Various necessary conditions for the existence of meaningful solutions are derived and discussed in both cases. Finally, several design and image coding examples are presented to confirm the validity of the theory     

Energy-Efficient Broadcast and Multicast Trees in Wireless Networks

The wireless networking environment presents formidable challenges to the study of broadcasting and multicasting problems. In this paper we focus on the problem of multicast tree construction, and we introduce and evaluate algorithms for tree construction in infrastructureless, all-wireless applications. The performance metric used to evaluate broadcast and multicast trees is energy-efficiency. We develop the Broadcast Incremental Power (BIP) algorithm, and adapt it to multicast operation by introducing the Multicast Incremental Power (MIP) algorithm. These algorithms exploit the broadcast nature of the wireless communication environment, and address the need for energy-efficient operation. We demonstrate that our algorithms provide better performance than algorithms that have been developed for the link-based, wired environment.     

Energy-aware wireless networking with directional antennas: the case of session-based broadcasting and multicasting

We consider ad hoc wireless networks that use directional antennas and have limited energy resources. To explore quantitatively the advantage offered by the use of directional antennas over the case of omnidirectional antennas, we consider the case of connection-oriented multicast traffic. Building upon our prior work on multicasting algorithms, we introduce two protocols that exploit the use of directional antennas and evaluate their performance, We observe significant improvement with respect to the omnidirectional case, in terms of both energy efficiency and network lifetime. Additionally, we show that further substantial increase in the network's lifetime can be achieved by incorporating a simple measure of a node's residual energy into the node's cost function.