Generic Ergodic Capacity Bounds for Fixed-Gain AF Dual-Hop Relaying Systems

This paper elaborates on the ergodic capacity of fixed-gain amplify-and-forward (AF) dual-hop systems, which have recently attracted considerable research and industry interest. In particular, two novel capacity bounds that allow for fast and efficient computation and apply for nonidentically distributed hops are derived. More importantly, they are generic since they apply to a wide range of popular fading channel models. Specifically, the proposed upper bound applies to Nakagami-m, Weibull, and generalized-K fading channels, whereas the proposed lower bound is more general and applies to Rician fading channels. Moreover, it is explicitly demonstrated that the proposed lower and upper bounds become asymptotically exact in the high signal-to-noise ratio (SNR) regime. Based on our analytical expressions and numerical results, we gain valuable insights into the impact of model parameters on the capacity of fixed-gain AF dual-hop relaying systems. © 2011 IEEE.

A Tunable Encryption Scheme and Analysis of Fast Selective Encryption for CAVLC and CABAC in H.264/AVC

Recently, two fast selective encryption methods for context-adaptive variable length coding and context-adaptive binary arithmetic coding in H.264/AVC were proposed by Shahid et al. In this paper, it was demonstrated that these two methods are not as efficient as only encrypting the sign bits of nonzero coefficients. Experimental results showed that without encrypting the sign bits of nonzero coefficients, these two methods can not provide a perceptual scrambling effect. If a much stronger scrambling effect is required, intra prediction modes, and the sign bits of motion vectors can be encrypted together with the sign bits of nonzero coefficients. For practical applications, the required encryption scheme should be customized according to a user's specified requirement on the perceptual scrambling effect and the computational cost. Thus, a tunable encryption scheme combining these three methods is proposed for H.264/AVC. To simplify its implementation and reduce the computational cost, a simple control mechanism is proposed to adjust the control factors. Experimental results show that this scheme can provide different scrambling levels by adjusting three control factors with no or very little impact on the compression performance. The proposed scheme can run in real-time and its computational cost is minimal. The security of the proposed scheme is also discussed. It is secure against the replacement attack when all three control factors are set to one.

Fast recognition of musical sounds based on timbre

Human listeners seem to have an impressive ability to recognize a wide variety of natural sounds. However, there is surprisingly little quantitative evidence to characterize this fundamental ability. Here the speed and accuracy of musical-sound recognition were measured psychophysically with a rich but acoustically balanced stimulus set. The set comprised recordings of notes from musical instruments and sung vowels. In a first experiment, reaction times were collected for three target categories: voice, percussion, and strings. In a go/no-go task, listeners reacted as quickly as possible to members of a target category while withholding responses to distractors (a diverse set of musical instruments). Results showed near-perfect accuracy and fast reaction times, particularly for voices. In a second experiment, voices were recognized among strings and vice-versa. Again, reaction times to voices were faster. In a third experiment, auditory chimeras were created to retain only spectral or temporal features of the voice. Chimeras were recognized accurately, but not as quickly as natural voices. Altogether, the data suggest rapid and accurate neural mechanisms for musical-sound recognition based on selectivity to complex spectro-temporal signatures of sound sources.

Fast-drying multi-laminate bioadhesive films for transdermal and topical drug delivery

No bioadhesive patch-based system is currently marketed. This is despite an extensive number of literature reports on such systems detailing their advantages over conventional pressure sensitive adhesive-based patches in wet environments and describing successful delivery of a diverse array of drug substances. This lack of proprietary bioadhesive patches is largely due to the fact that such systems are exclusively water-based, meaning drying is difficult. In this paper we describe, for the first time, a novel multiple lamination method for production of bioadhesive patches. In contrast to patches produced using a conventional casting approach, which took 48 hours to dry, bioadhesive films prepared using the novel multiple lamination method were dried in 15?min and were folded into formed patches in a further 10?min. Patches prepared by both methods had comparable physicochemical properties. The multiple lamination method allowed supersaturation of 5-aminolevulinic acid to be achieved in formed patch matrices. However, drug release studies were unable to show an advantage for supersaturation with this particular drug, due to its water high solubility. The multiple lamination method allowed greater than 90% of incorporated nicotine to remain within formed patches, in contrast to the 48% achieved for patches prepared using a conventional casting approach. The procedure described here could readily be adapted for automation by industry. Due to the reduced time, energy and ensuing finance now required, this could lead to bioadhesive patch-based drug delivery systems becoming commercially viable. This would, in turn, mean that pathological conditions occurring in wet or moist areas of the body could now be routinely treated by prolonged site-specific drug delivery, as mediated by a commercially produced bioadhesive patch.

Fast Moving Window Algorithm for QR and Cholesky Decompositions

This paper proposes a fast moving window algorithm for QR and Cholesky decompositions by simultaneously applying data updating and downdating. The developed procedure is based on inner products and entails a similar downdating to that of the Chambers’ approach. For adding and deleting one row of data from the original matrix, a detailed analysis shows that the proposed algorithm outperforms existing ones in terms or computational efficiency, if the number of columns exceeds 7. For a large number of columns, the proposed algorithm is numerically superior compared to the traditional sequential technique.

Ultracam - An Ultra-Fast Triple-Beam CCD Camera

ULTRACAM is a high-speed three-colour CCD camera designed to provide imaging photometry at high temporal resolutions. The instrument is highly portable and will be used at a number of large telescopes around the world. ULTRACAM was successfully commissioned on the 4.2-m William Herschel Telescope on La Palma on 16 May 2002 over 3 months ahead of schedule and within budget. The instrument was funded by PPARC and designed and built by a consortium involving the Universities of Sheffield Southampton and the UKATC Edinburgh. We present an overview of the design and performance characteristics of ULTRACAM and highlight some of its most recent scientific results.

Generation of hemispherical fast electron waves in the presence of preplasma in ultraintense laser-matter interaction

Hemispherical electron plasma waves generated from ultraintense laser interacting with a solid target having a subcritical preplasma is studied using particle-in-cell simulation. As the laser pulse propagates inside the preplasma, it becomes self-focused due to the response of the plasma electrons to the ponderomotive force. The electrons are mainly heated via betatron resonance absorption and their thermal energy can become higher than the ponderomotive energy. The hot electrons easily penetrate through the thin solid target and appear behind it as periodic hemispherical shell-like layers separated by the laser wavelength.

A sparse representation based fast detection method for surface defect detection of bottle caps

A practical machine-vision-based system is developed for fast detection of defects occurring on the surface of bottle caps. This system can be used to extract the circular region as the region of interests (ROI) from the surface of a bottle cap, and then use the circular region projection histogram (CRPH) as the matching features. We establish two dictionaries for the template and possible defect, respectively. Due to the requirements of high-speed production as well as detecting quality, a fast algorithm based on a sparse representation is proposed to speed up the searching. In the sparse representation, non-zero elements in the sparse factors indicate the defect's size and position. Experimental results in industrial trials show that the proposed method outperforms the orientation code method (OCM) and is able to produce promising results for detecting defects on the surface of bottle caps.