Application of edge-to-edge matching model to understand the in-plane texture of TiSi2 (C49) thin films on (001)(Si) surface

The edge-to-edge matching model, which was originally developed for predicting crystallographic features in diffusional phase transformations in solids, has been used to understand the formation of in-plane textures in TiSi2 (C49) thin films on Si single crystal (001)si surface. The model predicts all the four previously reported orientation relationships between C49 and Si substrate based on the actual atom matching across the interface and the basic crystallographic data only. The model has strong potential to be used to develop new thin film materials. (c) 2006 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

Matching of catalogues by probabilistic pattern classification

We consider the statistical problem of catalogue matching from a machine learning perspective with the goal of producing probabilistic outputs, and using all available information. A framework is provided that unifies two existing approaches to producing probabilistic outputs in the literature, one based on combining distribution estimates and the other based on combining probabilistic classifiers. We apply both of these to the problem of matching the HI Parkes All Sky Survey radio catalogue with large positional uncertainties to the much denser SuperCOSMOS catalogue with much smaller positional uncertainties. We demonstrate the utility of probabilistic outputs by a controllable completeness and efficiency trade-off and by identifying objects that have high probability of being rare. Finally, possible biasing effects in the output of these classifiers are also highlighted and discussed.

Understanding the crystallography of the eutectoid microstructure in a Zn-Al alloy using the edge-to-edge matching model

The orientation relationship (OR) between the beta(Zn) phase and the alpha(Al) phase and the corresponding habit planes in a Zn-Al eutectoid alloy were accurately determined using convergent beam Kikuchi line diffraction patterns. In addition to the previously reported OR. [11 (2) over bar0](beta)parallel to[110](alpha), (0002)(beta)parallel to ((1) over bar 11)alpha, two new ORs were observed. They are: [11 (2) over bar0](beta)parallel to [110], ((1) over bar 101)(beta) 0.82 degrees from (002)(alpha) and [(1) over bar 100](beta)parallel to[112](alpha), (0002)(beta) 4.5 degrees from (111)(alpha). These ORs can be explained and understood using the recently developed edge-to-edge matching model. (c) 2006 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

Imitating the neighbours: vocal dialect matching in a mimic-model system

Vocal mimicry provides a unique system for investigating song learning and cultural evolution in birds. Male lyrebirds produce complex vocal displays that include extensive and accurate mimicry of many other bird species. We recorded and analysed the songs of the Albert's lyrebird (Menura alberti) and its most commonly imitated model species, the satin bowerbird (Ptilonorhynchus violaceus), at six sites in southeast Queensland, Australia. We show that each population of lyrebirds faithfully reproduces the song of the local population of bowerbirds. Within a population, lyrebirds show less variation in song structure than the available variation in the songs of the models. These results provide the first quantitative evidence for dialect matching in the songs of two species that have no direct ecological relationship.

Edge-to-edge matching - The fundamentals

The basis of the present authors' edge-to-edge matching model for understanding the crystallography of partially coherent precipitates is the minimization of the energy of the interface between the two phases. For relatively simple crystal structures, this energy minimization occurs when close-packed, or relatively close-packed, rows of atoms match across the interface. Hence, the fundamental principle behind edge-to-edge matching is that the directions in each phase that correspond to the edges of the planes that meet in the interface should be close-packed, or relatively close-packed, rows of atoms. A few of the recently reported examples of what is termed edge-to-edge matching appear to ignore this fundamental principle. By comparing theoretical predictions with available experimental data, this article will explore the validity of this critical atom-row coincidence condition, in situations where the two phases have simple crystal Structures and in those where the precipitate has a more complex structure.

Machine learning for matching astronomy catalogues

An emerging issue in the field of astronomy is the integration, management and utilization of databases from around the world to facilitate scientific discovery. In this paper, we investigate application of the machine learning techniques of support vector machines and neural networks to the problem of amalgamating catalogues of galaxies as objects from two disparate data sources: radio and optical. Formulating this as a classification problem presents several challenges, including dealing with a highly unbalanced data set. Unlike the conventional approach to the problem (which is based on a likelihood ratio) machine learning does not require density estimation and is shown here to provide a significant improvement in performance. We also report some experiments that explore the importance of the radio and optical data features for the matching problem.

Fast stereo matching by iterated dynamic programming and quadtree subregioning

The application of energy minimisation methods for stereo matching has been demonstrated to produce high quality disparity maps. However the majority of these methods are known to be computationally expensive, requiring minutes or even hours of computation. We propose a fast minimisation scheme that produces strongly competitive results for significantly reduced computation, requiring only a few seconds of computation. In this paper, we present our iterated dynamic programming algorithm along with a quadtree subregioning process for fast stereo matching.

Matching commercial clips from TV streams using a unique, robust and compact signature

One of critical challenges in automatic recognition of TV commercials is to generate a unique, robust and compact signature. Uniqueness indicates the ability to identify the similarity among the commercial video clips which may have slight content variation. Robustness means the ability to match commercial video clips containing the same content but probably with different digitalization/encoding, some noise data, and/or transmission and recording distortion. Efficiency is about the capability of effectively matching commercial video sequences with a low computation cost and storage overhead. In this paper, we present a binary signature based method, which meets all the three criteria above, by combining the techniques of ordinal and color measurements. Experimental results on a real large commercial video database show that our novel approach delivers a significantly better performance comparing to the existing methods.

3D protein structure matching by patch signatures

For determining functionality dependencies between two proteins, both represented as 3D structures, it is an essential condition that they have one or more matching structural regions called patches. As 3D structures for proteins are large, complex and constantly evolving, it is computationally expensive and very time-consuming to identify possible locations and sizes of patches for a given protein against a large protein database. In this paper, we address a vector space based representation for protein structures, where a patch is formed by the vectors within the region. Based on our previews work, a compact representation of the patch named patch signature is applied here. A similarity measure of two patches is then derived based on their signatures. To achieve fast patch matching in large protein databases, a match-and-expand strategy is proposed. Given a query patch, a set of small k-sized matching patches, called candidate patches, is generated in match stage. The candidate patches are further filtered by enlarging k in expand stage. Our extensive experimental results demonstrate encouraging performances with respect to this biologically critical but previously computationally prohibitive problem.