Silicone lntravaginal rings: a new delivery technology for HIV microbicides?

B-222

Living in The Matrix: Virtual Reality Systems and Hyperspatial Representation in Architecture

In the digital age, the hyperspace of virtual reality systems stands out as a new spatial concept creating a parallel realm to "real" space. Virtual reality influences one’s experience of and interaction with architectural space. This "otherworld" brings up the criticism of the existing conception of space, time and body. Hyperspaces are relatively new to designers but not to filmmakers. Their cinematic representations help the comprehension of the outcomes of these new spaces. Visualisation of futuristic ideas on the big screen turns film into a medium for spatial experimentation. Creating a possible future, The Matrix (Andy and Larry Wachowski, 1999) takes the concept of hyperspace to a level not-yet-realised but imagined. With a critical gaze at the existing norms of architecture, the film creates new horizons in terms of space. In this context, this study introduces science fiction cinema as a discussion medium to understand the potentials of virtual reality systems for the architecture of the twenty first century. As a "role model" cinema helps to better understand technological and spatial shifts. It acts as a vehicle for going beyond the spatial theories and designs of the twentieth century, and defining the conception of space in contemporary architecture.

Efficient Path Key Establishment For Wireless Sensor Networks

Key pre-distribution schemes have been proposed as means to overcome Wireless Sensor Networks constraints such as limited communication and processing power. Two sensor nodes can establish a secure link with some probability based on the information stored in their memories though it is not always possible that two sensor nodes may set up a secure link. In this paper, we propose a new approach that elects trusted common nodes called ”Proxies” which reside on an existing secure path linking two sensor nodes. These sensor nodes are used to send the generated key which will be divided into parts (nuggets) according to the number of elected proxies. Our approach has been assessed against previously developed algorithms and the results show that our algorithm discovers proxies more quickly which are closer to both end nodes, thus producing shorter path lengths. We have also assessed the impact of our algorithm on the average time to establish a secure link when the transmitter and receiver of the sensor nodes are ”ON”. The results show the superiority of our algorithm in this regard. Overall, the proposed algorithm is well suited for Wireless Sensor Networks.

Subpixel interpolation architecture for multistandard video motion estimation

A new reconfigurable subpixel interpolation architecture for multistandard (e.g., MPEG-2, MPEG-4, H.264, and AVS) video motion estimation (ME) is presented. This exploits the mixed use of parallel and serial-input FIR filters to achieve high throughput rate and efficient silicon utilization. Silicon design studies show that this can be implemented using 34.8 × 10 3 gates with area and performance that compares very favorably with specific fixed solutions, e.g., for the H.264 standard alone. This can support SDTV and HDTV applications when implemented in 0.18 µm CMOS technology, with further performance enhancements achievable at 0.13 µm and below. © 2009 IEEE.

Segmentation of optic disc in retinal images using an improved gradient vector flow algorithm

Image segmentation plays an important role in the analysis of retinal images as the extraction of the optic disk provides important cues for accurate diagnosis of various retinopathic diseases. In recent years, gradient vector flow (GVF) based algorithms have been used successfully to successfully segment a variety of medical imagery. However, due to the compromise of internal and external energy forces within the resulting partial differential equations, these methods can lead to less accurate segmentation results in certain cases. In this paper, we propose the use of a new mean shift-based GVF segmentation algorithm that drives the internal/external energies towards the correct direction. The proposed method incorporates a mean shift operation within the standard GVF cost function to arrive at a more accurate segmentation. Experimental results on a large dataset of retinal images demonstrate that the presented method optimally detects the border of the optic disc.

Nonrigid Structure-From-Motion From 2-D Images Using Markov Chain Monte Carlo

In this paper we present a new method for simultaneously determining three dimensional (3-D) shape and motion of a non-rigid object from uncalibrated two dimensional (2- D) images without assuming the distribution characteristics. A non-rigid motion can be treated as a combination of a rigid rotation and a non-rigid deformation. To seek accurate recovery of deformable structures, we estimate the probability distribution function of the corresponding features through random sampling, incorporating an established probabilistic model. The fitting between the observation and the projection of the estimated 3-D structure will be evaluated using a Markov chain Monte Carlo based expectation maximisation algorithm. Applications of the proposed method to both synthetic and real image sequences are demonstrated with promising results.

The Potential of a New Type of Carburettor to Assist SORE in Meeting EPA / CARB Phase 3 Legislation

Small off-road engines (SORE) have been recognised as a major source of air pollution. It is estimated that non handheld SORE annually produce over 1 million tonnes of HC+NOx and over 50 million tonnes of CO2. The fuel system design and its operating AFR are of key importance with regard to engine operation and engine out emissions. The conventional low-cost float carburettors used in these engines are relatively ineffective at atomising and preparing the fuel for combustion requiring a rich setting for acceptable functional performance. EPA and CARB have confirmed that Phase 3 limits are achievable for a “durable” engine fitted with a conventional well calibrated and manufactured “stock rich setting” float carburettor together with catalytic oxidation after-treatment and passive secondary air injection. The EPA and CARB strategy for meeting Phase 3 only considers the use of conventional float carburettors that operate at rich AFR’s over their entire engine operating range as no other cost effective alternative fuel system is yet available on the market. A cost effective alternative to the conventional carburettor that enabled leaner or optimised AFR operation with load and improved combustion performance would open the door to alternative strategies to meeting the phase 3 limits. This paper presents a completely new form of mechanical carburettor that gives AFR control with load, improved mixture preparation for improved combustion performance and has a lower production cost than conventional carburettors. The conventional and new fuel system designs and operation are discussed in detail and their technical merits demonstrated in the form of engine test data. The performance of different after-treatment systems is also simulated for different AFR profiles with load for a conventional or unmodified SORE engine. With optimised leaner operation and improved combustion characteristics, this new carburettor technology can provide significant engine out CO and HC+NOx reductions on the J1088 test cycle without loss of functional performance. Depending on the chosen emissions control strategy, minimum engine out emissions or optimum engine AFR for oxidation or three-way after-treatment or another, this new carburettor technology can be easily calibrated to provide the desired engine operating AFR profile on the J1088 cycle.

A mixed cost-function adaptive algorithm for ADSL time-domain equalization

We propose a mixed cost-function adaptive initialization algorithm for the time domain equalizer in a discrete multitone (DMT)-based asymmetric digital subscriber line. Using our approach, a higher convergence rate than that of the commonly used least-mean square algorithm is obtained, whilst attaining bit rates close to the optimum maximum shortening SNR and the upper bound SNR. Furthermore, our proposed method outperforms the minimum mean-squared error design for a range of time domain equalizer (TEQ) filter lengths. The improved performance outweighs the small increase in computational complexity required. A block variant of our proposed algorithm is also presented to overcome the increased latency imposed on the feedback path of the adaptive system.

Platform-Independent IP Transmission over Wireless Networks: The WINE Approach

First demonstration of a working dynamically configurable architecture for wireless IP networks. The programmable architecture was as result of a European collaboration between Industry and University and was applied to a range of IP wireless networks. The work laid the foundations for subsequent research initiatives (including the UK) into programmable wireless networks as well as influencing future wireless standards (e.g. ITU-T).EU project WINE (Wireless Internet NEtworking), -1999-10028.

Progressive Audio Scrambling in Compressed Domain

Audio scrambling can be employed to ensure confidentiality in audio distribution. We first describe scrambling for raw audio using the discrete wavelet transform (DWT) first and then focus on MP3 audio scrambling. We perform scrambling based on a set of keys which allows for a set of audio outputs having different qualities. During descrambling, the number of keys provided and the number of rounds of descrambling performed will decide the audio output quality. We also perform scrambling by using multiple keys on the MP3 audio format. With a subset of keys, we can descramble to obtain a low quality audio. However, we can obtain the original quality audio by using all of the keys. Our experiments show that the proposed algorithms are effective, fast, simple to implement while providing flexible control over the progressive quality of the audio output. The security level provided by the scheme is sufficient for protecting MP3 music content.

An analysis of geometric uncertainty calculations for prostate radiotherapy in clinical practice.

Margins are used in radiotherapy to assist in the calculation of planning target volumes. These margins can be determined by analysing the geometric uncertainties inherent to the radiotherapy planning and delivery process. An important part of this process is the study of electronic portal images collected throughout the course of treatment. Set-up uncertainties were determined for prostate radiotherapy treatments at our previous site and the new purpose-built centre, with margins determined using a number of different methods. In addition, the potential effect of reducing the action level from 5 mm to 3 mm for changing a patient set-up, based on off-line bony anatomy-based portal image analysis, was studied. Margins generated using different methodologies were comparable. It was found that set-up errors were reduced following relocation to the new centre. Although a significant increase in the number of corrections to a patient's set-up was predicted if the action level was reduced from 5 mm to 3 mm, minimal reduction in patient set-up uncertainties would be seen as a consequence. Prescriptive geometric uncertainty analysis not only supports calculation and justification of the margins used clinically to generate planning target volumes, but may also best be used to monitor trends in clinical practice or audit changes introduced by new equipment, technology or practice. Simulations on existing data showed that a 3 mm rather than a 5 mm action level during off-line, bony anatomy-based portal imaging would have had a minimal benefit for the patients studied in this work.

Hierarchical Video Summarization in Reference Subspace

In this paper, a hierarchical video structure summarization approach using Laplacian Eigenmap is proposed, where a small set of reference frames is selected from the video sequence to form a reference subspace to measure the dissimilarity between two arbitrary frames. In the proposed summarization scheme, the shot-level key frames are first detected from the continuity of inter-frame dissimilarity, and the sub-shot level and scene level representative frames are then summarized by using K-mean clustering. The experiment is carried on both test videos and movies, and the results show that in comparison with a similar approach using latent semantic analysis, the proposed approach using Laplacian Eigenmap can achieve a better recall rate in keyframe detection, and gives an efficient hierarchical summarization at sub shot, shot and scene levels subsequently.

Watermarking for Multimedia Security using Complex Wavelets

This paper investigates the application of complex wavelet transforms to the field of digital data hiding. Complex wavelets offer improved directional selectivity and shift invariance over their discretely sampled counterparts allowing for better adaptation of watermark distortions to the host media. Two methods of deriving visual models for the watermarking system are adapted to the complex wavelet transforms and their performances are compared. To produce improved capacity a spread transform embedding algorithm is devised, this combines the robustness of spread spectrum methods with the high capacity of quantization based methods. Using established information theoretic methods, limits of watermark capacity are derived that demonstrate the superiority of complex wavelets over discretely sampled wavelets. Finally results for the algorithm against commonly used attacks demonstrate its robustness and the improved performance offered by complex wavelet transforms.