Design, implementation, and testing of advanced virtual coordinate-measuring machines

Copyright @ 2011 IEEE. This article has been made available through the Brunel Open Access Publishing Fund.Advanced virtual coordinate-measuring machines (CMMs) (AVCMMs) have recently been developed at Brunel University, which provide vivid graphical representation and powerful simulation of CMM operations, together with Monte-Carlo-based uncertainty evaluation. In an integrated virtual environment, the user can plan an inspection strategy for a given task, carry out virtual measurements, and evaluate the uncertainty associated with the measurement results, all without the need of using a physical machine. The obtained estimate of uncertainty can serve as a rapid feedback for the user to optimize the inspection plan in the AVCMM before actual measurements or as an evaluation of the measurement results performed. This paper details the methodology, design, and implementation of the AVCMM system, including CMM modeling, probe contact and collision detection, error modeling and simulation, and uncertainty evaluation. This paper further reports experimental results for the testing of the AVCMM

Flexible protein folding by ant colony optimization

Protein structure prediction is one of the most challenging topics in bioinformatics. As the protein structure is found to be closely related to its functions, predicting the folding structure of a protein to judge its functions is meaningful to the humanity. This chapter proposes a flexible ant colony (FAC) algorithm for solving protein folding problems (PFPs) based on the hydrophobic-polar (HP) square lattice model. Different from the previous ant algorithms for PFPs, the pheromones in the proposed algorithm are placed on the arcs connecting adjacent squares in the lattice. Such pheromone placement model is similar to the one used in the traveling salesmen problems (TSPs), where pheromones are released on the arcs connecting the cities. Moreover, the collaboration of effective heuristic and pheromone strategies greatly enhances the performance of the algorithm so that the algorithm can achieve good results without local search methods. By testing some benchmark two-dimensional hydrophobic-polar (2D-HP) protein sequences, the performance shows that the proposed algorithm is quite competitive compared with some other well-known methods for solving the same protein folding problems

Spin relaxation and decoherence of two-level systems

We revisit the concepts of spin relaxation and spin decoherence of two level (spin-1/2) systems. From two toy-models, we clarify two issues related to the spin relaxation and decoherence: 1) For an ensemble of two-level particles each subjected to a different environmental field, there exists an ensemble relaxation time $T_1^*$ which is fundamentally different from $T_1$. When the off-diagonal coupling of each particle is in a single mode with the same frequency but a random coupling strength, we show that $T_1^*$ is finite while the spin relaxation time of a single spin $T_1$ and the usual ensemble decoherence time $T_2^*$ are infinite. 2) For a two-level particle under only a random diagonal coupling, its relaxation time $T_1$ shall be infinite but its decoherence time $T_2$ is finite.Comment: 5 pages, 2 figure

Dynamic Behavior of Precast Concrete Beam-Column Sub-Assemblages with High Performance Connections Subjected to Sudden Column Removal Scenario

Unbonded posttensioned precast concrete (UPPC) structure has shown its excellent aseismic performance in laboratory tests and earthquake investigation. However, the progressive collapse behavior of UPPC subjected to column removal scenario is still unclear. To fill this knowledge gap, two 1/2 scaled UPPC beam-column sub-assemblages were tested under a penultimate column removal scenario. The dynamic test results indicated that UPPC sub-assemblages have desirable load redistribution capacity to mitigate progressive collapse. The failure modes of the sub-assemblages observed in dynamic test were quite similar to that in static counterparts

Mobile robot localization using robust extended H-infinity filtering

This is the author's accepted manuscript. The final published article is available from the link below. Copyright @ 2009 Institution of Mechanical Engineers.In this paper, a novel methodology is provided for accurate localization of a mobile robot using autonomous navigation based on internal and external sensors. A new robust extended H∞ filter is developed to deal with the non-linear kinematic model of the robot and the non-linear distance measurements, together with process and measurement noises. The proposed filter relies on a two-step prediction-correction structure, which is similar to a Kalman filter. Simulations are provided to demonstrate the effectiveness of the proposed method.EPSRC, the Nuffield Foundation, and the Alexander von Humboldt Foundation

Asymptotic theorems of sequential estimation-adjusted urn models

The Generalized P\'{o}lya Urn (GPU) is a popular urn model which is widely used in many disciplines. In particular, it is extensively used in treatment allocation schemes in clinical trials. In this paper, we propose a sequential estimation-adjusted urn model (a nonhomogeneous GPU) which has a wide spectrum of applications. Because the proposed urn model depends on sequential estimations of unknown parameters, the derivation of asymptotic properties is mathematically intricate and the corresponding results are unavailable in the literature. We overcome these hurdles and establish the strong consistency and asymptotic normality for both the patient allocation and the estimators of unknown parameters, under some widely satisfied conditions. These properties are important for statistical inferences and they are also useful for the understanding of the urn limiting process. A superior feature of our proposed model is its capability to yield limiting treatment proportions according to any desired allocation target. The applicability of our model is illustrated with a number of examples.Comment: Published at http://dx.doi.org/10.1214/105051605000000746 in the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org

Secure thermal infrared communications using engineered blackbody radiation

The thermal (emitted) infrared frequency bands, from 20–40 THz and 60–100 THz, are best known for applications in thermography. This underused and unregulated part of the spectral range offers opportunities for the development of secure communications. The ‘THz Torch' concept was recently presented by the authors. This technology fundamentally exploits engineered blackbody radiation, by partitioning thermally-generated spectral noise power into pre-defined frequency channels; the energy in each channel is then independently pulsed modulated and multiplexing schemes are introduced to create a robust form of short-range secure communications in the far/mid infrared. To date, octave bandwidth (25–50 THz) single-channel links have been demonstrated with 380 bps speeds. Multi-channel ‘THz Torch' frequency division multiplexing (FDM) and frequency-hopping spread-spectrum (FHSS) schemes have been proposed, but only a slow 40 bps FDM scheme has been demonstrated experimentally. Here, we report a much faster 1,280 bps FDM implementation. In addition, an experimental proof-of-concept FHSS scheme is demonstrated for the first time, having a 320 bps data rate. With both 4-channel multiplexing schemes, measured bit error rates (BERs) of < 10(−6) are achieved over a distance of 2.5 cm. Our approach represents a new paradigm in the way niche secure communications can be established over short links