Frequency response function based damage identification using principal component analysis and pattern recognition technique

Pattern recognition is a promising approach for the identification of structural damage using measured dynamic data. Much of the research on pattern recognition has employed artificial neural networks (ANNs) and genetic algorithms as systematic ways of matching pattern features. The selection of a damage-sensitive and noise-insensitive pattern feature is important for all structural damage identification methods. Accordingly, a neural networks-based damage detection method using frequency response function (FRF) data is presented in this paper. This method can effectively consider uncertainties of measured data from which training patterns are generated. The proposed method reduces the dimension of the initial FRF data and transforms it into new damage indices and employs an ANN method for the actual damage localization and quantification using recognized damage patterns from the algorithm. In civil engineering applications, the measurement of dynamic response under field conditions always contains noise components from environmental factors. In order to evaluate the performance of the proposed strategy with noise polluted data, noise contaminated measurements are also introduced to the proposed algorithm. ANNs with optimal architecture give minimum training and testing errors and provide precise damage detection results. In order to maximize damage detection results, the optimal architecture of ANN is identified by defining the number of hidden layers and the number of neurons per hidden layer by a trial and error method. In real testing, the number of measurement points and the measurement locations to obtain the structure response are critical for damage detection. Therefore, optimal sensor placement to improve damage identification is also investigated herein. A finite element model of a two storey framed structure is used to train the neural network. It shows accurate performance and gives low error with simulated and noise-contaminated data for single and multiple damage cases. As a result, the proposed method can be used for structural health monitoring and damage detection, particularly for cases where the measurement data is very large. Furthermore, it is suggested that an optimal ANN architecture can detect damage occurrence with good accuracy and can provide damage quantification with reasonable accuracy under varying levels of damage.

Utility of temporal artery biopsy samples for genome-wide analysis of giant cell arteritis

Giant Cell Arteritis (GCA) is the most common vasculitis affecting the elderly. Archived formalin-fixed paraffin-embedded (FFPE) temporal artery biopsy (TAB) specimens potentially represent a valuable resource for large-scale genetic analysis of this disease. FFPE TAB samples were obtained from 12 patients with GCA. Extracted TAB DNA was assessed by real time PCR before restoration using the Illumina HD FFPE Restore Kit. Paired FFPE-blood samples were genotyped on the Illumina OmniExpress FFPE microarray. The FFPE samples that passed stringent quality control measures had a mean genotyping success of >97%. When compared with their matching peripheral blood DNA, the mean discordant heterozygote and homozygote single nucleotide polymorphisms calls were 0.0028 and 0.0003, respectively, which is within the accepted tolerance of reproducibility. This work demonstrates that it is possible to successfully obtain high-quality microarray-based genotypes FFPE TAB samples and that this data is similar to that obtained from peripheral blood.

Saviour Siblings and the Regulation of Assisted Reproductive Technology: Harm, Ethics and Law

Advances in the field of Assisted Reproductive Technology (ART) have been revolutionary. This book focuses on the use of ARTs in the context of families who seek to conceive a matching sibling donor as a source of tissue to treat an existing sick child. Such children have been referred to as ‘saviour siblings’. Considering the legal and regulatory frameworks that impact on the accessibility of this technology in Australia and the UK, the work analyses the ethical and moral issues that arise from the use of the technology for this specific purpose. The author claims the only justification for limiting a family’s reproductive liberty in this context is where the exercise of reproductive decision-making results in harm to others. It is argued that the harm principle is the underlying feature of legislative action in Western democratic society, and as such, this principle provides the grounds upon which a strong and persuasive argument is made for a less-restrictive regulatory approach in the context of ‘saviour siblings’.

A biomechanical approach to iris normalization

The richness of the iris texture and its variability across individuals make it a useful biometric trait for personal authentication. One of the key stages in classical iris recognition is the normalization process, where the annular iris region is mapped to a dimensionless pseudo-polar coordinate system. This process results in a rectangular structure that can be used to compensate for differences in scale and variations in pupil size. Most iris recognition methods in the literature adopt linear sampling in the radial and angular directions when performing iris normalization. In this paper, a biomechanical model of the iris is used to define a novel nonlinear normalization scheme that improves iris recognition accuracy under different degrees of pupil dilation. The proposed biomechanical model is used to predict the radial displacement of any point in the iris at a given dilation level, and this information is incorporated in the normalization process. Experimental results on the WVU pupil light reflex database (WVU-PLR) indicate the efficacy of the proposed technique, especially when matching iris images with large differences in pupil size.

Building instance knowledge network for word sense disambiguation

In this paper, a new high precision focused word sense disambiguation (WSD) approach is proposed, which not only attempts to identify the proper sense for a word but also provides the probabilistic evaluation for the identification confidence at the same time. A novel Instance Knowledge Network (IKN) is built to generate and maintain semantic knowledge at the word, type synonym set and instance levels. Related algorithms based on graph matching are developed to train IKN with probabilistic knowledge and to use IKN for probabilistic word sense disambiguation. Based on the Senseval-3 all-words task, we run extensive experiments to show the performance enhancements in different precision ranges and the rationality of probabilistic based automatic confidence evaluation of disambiguation. We combine our WSD algorithm with five best WSD algorithms in senseval-3 all words tasks. The results show that the combined algorithms all outperform the corresponding algorithms.

CCD: Connected Component Descriptor for Robust Mosaicing of Camera-Captured Document Images

We propose a robust method for mosaicing of document images using features derived from connected components. Each connected component is described using the Angular Radial Tran. form (ART). To ensure geometric consistency during feature matching, the ART coefficients of a connected component are augmented with those of its two nearest neighbors. The proposed method addresses two critical issues often encountered in correspondence matching: (i) The stability of features and (ii) Robustness against false matches due to the multiple instances of characters in a document image. The use of connected components guarantees a stable localization across images. The augmented features ensure a successful correspondence matching even in the presence of multiple similar regions within the page. We illustrate the effectiveness of the proposed method on camera captured document images exhibiting large variations in viewpoint, illumination and scale.

PocketMatch: A new algorithm to compare binding sites in protein structures

Recognizing similarities and deriving relationships among protein molecules is a fundamental requirement in present-day biology. Similarities can be present at various levels which can be detected through comparison of protein sequences or their structural folds. In some cases similarities obscure at these levels could be present merely in the substructures at their binding sites. Inferring functional similarities between protein molecules by comparing their binding sites is still largely exploratory and not as yet a routine protocol. One of the main reasons for this is the limitation in the choice of appropriate analytical tools that can compare binding sites with high sensitivity. To benefit from the enormous amount of structural data that is being rapidly accumulated, it is essential to have high throughput tools that enable large scale binding site comparison. Results: Here we present a new algorithm PocketMatch for comparison of binding sites in a frame invariant manner. Each binding site is represented by 90 lists of sorted distances capturing shape and chemical nature of the site. The sorted arrays are then aligned using an incremental alignment method and scored to obtain PMScores for pairs of sites. A comprehensive sensitivity analysis and an extensive validation of the algorithm have been carried out. A comparison with other site matching algorithms is also presented. Perturbation studies where the geometry of a given site was retained but the residue types were changed randomly, indicated that chance similarities were virtually non-existent. Our analysis also demonstrates that shape information alone is insufficient to discriminate between diverse binding sites, unless combined with chemical nature of amino acids. Conclusion: A new algorithm has been developed to compare binding sites in accurate, efficient and high-throughput manner. Though the representation used is conceptually simplistic, we demonstrate that along with the new alignment strategy used, it is sufficient to enable binding comparison with high sensitivity. Novel methodology has also been presented for validating the algorithm for accuracy and sensitivity with respect to geometry and chemical nature of the site. The method is also fast and takes about 1/250(th) second for one comparison on a single processor. A parallel version on BlueGene has also been implemented.

Ultrafast Raman loss spectroscopy

This paper deals with a new form of nonlinear Raman spectroscopy called `ultrafast Raman loss spectroscopy (URLS)'. URLS is analogous to stimulated Raman spectroscopy (SRS) but is much more sensitive than SRS. The signals are background (noise) free unlike in coherent anti-Stokes Raman spectroscopy (CARS) and it provides natural fluorescence rejection, which is a major problem in Raman spectroscopy. In addition, being a self-phase matching process, the URLS experiment is much easier than CARS, which requires specific phase matching of the laser pulses. URLS is expected to be alternative if not competitive to CARS microscopy, which has become a popular technique in applications to materials, biology and medicine.

A Scalable High Throughput Firewall in FPGA

High end network security applications demand high speed operation and large rule set support. Packet classification is the core functionality that demands high throughput in such applications. This paper proposes a packet classification architecture to meet such high throughput. We have implemented a Firewall with this architecture in reconflgurable hardware. We propose an extension to Distributed Crossproducting of Field Labels (DCFL) technique to achieve scalable and high performance architecture. The implemented Firewall takes advantage of inherent structure and redundancy of rule set by using our DCFL Extended (DCFLE) algorithm. The use of DCFLE algorithm results in both speed and area improvement when it is implemented in hardware. Although we restrict ourselves to standard 5-tuple matching, the architecture supports additional fields. High throughput classification invariably uses Ternary Content Addressable Memory (TCAM) for prefix matching, though TCAM fares poorly in terms of area and power efficiency. Use of TCAM for port range matching is expensive, as the range to prefix conversion results in large number of prefixes leading to storage inefficiency. Extended TCAM (ETCAM) is fast and the most storage efficient solution for range matching. We present for the first time a reconfigurable hardware implementation of ETCAM. We have implemented our Firewall as an embedded system on Virtex-II Pro FPGA based platform, running Linux with the packet classification in hardware. The Firewall was tested in real time with 1 Gbps Ethernet link and 128 sample rules. The packet classification hardware uses a quarter of logic resources and slightly over one third of memory resources of XC2VP30 FPGA. It achieves a maximum classification throughput of 50 million packet/s corresponding to 16 Gbps link rate for the worst case packet size. The Firewall rule update involves only memory re-initialization in software without any hardware change.

A Scalable High Throughput Firewall in FPGA

High end network security applications demand high speed operation and large rule set support. Packet classification is the core functionality that demands high throughput in such applications. This paper proposes a packet classification architecture to meet such high throughput. We have Implemented a Firewall with this architecture in reconfigurable hardware. We propose an extension to Distributed Crossproducting of Field Labels (DCFL) technique to achieve scalable and high performance architecture. The implemented Firewall takes advantage of inherent structure and redundancy of rule set by using, our DCFL Extended (DCFLE) algorithm. The use of DCFLE algorithm results In both speed and area Improvement when It is Implemented in hardware. Although we restrict ourselves to standard 5-tuple matching, the architecture supports additional fields.High throughput classification Invariably uses Ternary Content Addressable Memory (TCAM) for prefix matching, though TCAM fares poorly In terms of area and power efficiency. Use of TCAM for port range matching is expensive, as the range to prefix conversion results in large number of prefixes leading to storage inefficiency. Extended TCAM (ETCAM) is fast and the most storage efficient solution for range matching. We present for the first time a reconfigurable hardware Implementation of ETCAM. We have implemented our Firewall as an embedded system on Virtex-II Pro FPGA based platform, running Linux with the packet classification in hardware. The Firewall was tested in real time with 1 Gbps Ethernet link and 128 sample rules. The packet classification hardware uses a quarter of logic resources and slightly over one third of memory resources of XC2VP30 FPGA. It achieves a maximum classification throughput of 50 million packet/s corresponding to 16 Gbps link rate for file worst case packet size. The Firewall rule update Involves only memory re-initialiization in software without any hardware change.

Does PGA external stenting reduce compliance mismatch in venous grafts?

Background: Autogenous vein grafting is widely used in regular bypassing procedures. Due to its mismatch with the host artery in both mechanical property and geometry, the graft often over expands under high arterial blood pressure and forms a step-depth where eddy flow develops, thus causing restenosis, fibrous graft wall, etc. External stents, such as sheaths being used to cuff the graft, have been introduced to eliminate these mismatches and increase the patency. Although histological and immunochemical studies have shown some positive effects of the external stent, the mechanical mismatch under the protection of an external stent remains poorly analyzed. Methods: In this study, the jugular veins taken from hypercholesterolemic rabbits were transplanted into the carotid arteries, and non-woven polyglycolic acid (PGA) fabric was used to fabricate the external stents to study the effect of the biodegradable external stent. Eight weeks after the operation, the grafts were harvested to perform mechanical tests and histological examinations. An arc tangent function was suggested to describe the relationship between pressure and cross-sectional area to analyse the compliance of the graft. Results: The results from the mechanical tests indicated that grafts either with or without external stents displayed large compliance in the low-pressure range and were almost inextensible in the high-pressure range. This was very different from the behavior of the arteries or veins in vivo. The data from histological tests showed that, with external stents, collagen fibers were more compact, whilst those in the graft without protection were looser and thicker. No elastic fiber was found in either kind of grafts. Furthermore, grafts without protection were over-expanded which resulted in much bigger cross-sectional areas. Conclusion: The PGA external extent contributes little to the reduction of the mechanical mismatch between the graft and its host artery while remodeling develops. For the geometric mismatch, it reduces the cross-section area, therefore matching with the host artery much better. Although there are some positive effects, conclusively the PGA is not an ideal material for external stent.

Automated topometric graph generation from floor plan analysis

The world is rich with information such as signage and maps to assist humans to navigate. We present a method to extract topological spatial information from a generic bitmap floor plan and build a topometric graph that can be used by a mobile robot for tasks such as path planning and guided exploration. The algorithm first detects and extracts text in an image of the floor plan. Using the locations of the extracted text, flood fill is used to find the rooms and hallways. Doors are found by matching SURF features and these form the connections between rooms, which are the edges of the topological graph. Our system is able to automatically detect doors and differentiate between hallways and rooms, which is important for effective navigation. We show that our method can extract a topometric graph from a floor plan and is robust against ambiguous cases most commonly seen in floor plans including elevators and stairwells.

Bismuth tungsten-oxide bronzes - a study of intergrowth phases and related aspects

Reaction of bismuth metal with WO$_3$ in the absence of oxygen yields interesting bronze-like phases. From analytical electron microscopy and X-ray photoelectron spectroscopy, the product phases are found to have the general composition Bi$_x$ WO$_3$ with bismuth in the 3+ state. Structural investigations made with high resolution electron micrscopy and cognate techniques reveal that when x < 0.02, a perovskite bronze is formed. When x $\geqslant$ 0.02, however, intergrowth tungsten bronzes (i.t.b.) containing varying widths of the WO$_3$ slab are formed, the lattice periodicity being in the range 2.3-5.1 nm in a direction perpendicular to the WO$_3$ slabs. Image-matching studies indicate that the bismuth atoms are in the tunnels of the hexagonal tungsten bronze (h.t.b.) strips and the h.t.b. strips always remain one-tunnel wide. Annealed samples show a satellite structure around the superlattice spots in the electron diffraction patterns, possibly owing to ordering of the bismuth atoms in the tunnels. The i.t.b. phases show recurrent intergrowths extending up to 100 nm in several crystals. The periodicity varies considerably within the same crystal wherever there is disordered intergrowth, but unit cell dimensions can be assigned from X-ray and electron diffraction patterns. The maximum value of x in the i.t.b. phases is ca. 0.07 and there is no evidence for the i.t.b. phase progressively giving way to the h.t.b. phase with increase in x. Hexagonal tungsten bronzes that contain bismuth with x up to 0.02 can be formed by starting from hexagonal WO$_3$, but the h.t.b. phase seems to be metastable. Optical, magnetic and electron transport properties of the i.t.b. phases have been measured and it appears that the electrons become itinerant when x > 0.05.

Acacia nilotica ssp. indica (L.) Willd. ex Del. (Mimosaceae)

Prickly acacia, a Weed of National Significance or WONS, is a serious problem in Queensland particularly the Mitchell grass downs where it was once planted to provide shade for livestock. The chapter summarises current knowledge about the taxonomy, biology, distribution, ecology, impacts and biological control of the weed. Queensland has been trying to achieve biological control of prickly acacia since 1980 when it began foreign exploration in Pakistan. Since then further exploration was undertaken in Kenya, South Africa and presently India. Six insects have been released in Queensland but only two of these are established. Greater emphasis is being placed on climate matching, plant response to herbivory and genotype matching in present work and it is hoped that this approach will allow more rigorous evaluations of agent performance and better understanding of reasons for success or failure of agents.

Climatic-requirements models of cat's claw creeper Macfadyena unguis-cati (Bignoniaceae) to prioritise areas for exploration and release of biological control agents

Climate matching software (CLIMEX) was used to prioritise areas to explore for biological control agents in the native range of cat's claw creeper Macfadyena unguis-cati (Bignoniaceae), and to prioritise areas to release the agents in the introduced ranges of the plant. The native distribution of cat's claw creeper was used to predict the potential range of climatically suitable habitats for cat's claw creeper in its introduced ranges. A Composite Match Index (CMI) of cat's claw creeper was determined with the 'Match Climates' function in order to match the ranges in Australia and South Africa where the plant is introduced with its native range in South and Central America. This information was used to determine which areas might yield climatically-adapted agents. Locations in northern Argentina had CMI values which best matched sites with cat's claw creeper infestations in Australia and South Africa. None of the sites from where three currently prioritised biological control agents for cat's claw creeper were collected had CMI values higher than 0.8. The analysis showed that central and eastern Argentina, south Brazil, Uruguay and parts of Bolivia and Paraguay should be prioritised for exploration for new biological control agents for cat's claw creeper to be used in Australia and South Africa.