913 resultados para Weighted graph matching
Resumo:
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.
Resumo:
We have redefined group membership of six southern galaxy groups in the local universe (mean cz < 2000 km s(-1)) based on new redshift measurements from our recently acquired Anglo-Australian Telescope 2dF spectra. For each group, we investigate member galaxy kinematics, substructure, luminosity functions and luminosity-weighted dynamics. Our calculations confirm that the group sizes, virial masses and luminosities cover the range expected for galaxy groups, except that the luminosity of NGC 4038 is boosted by the central starburst merger pair. We find that a combination of kinematical, substructural and dynamical techniques can reliably distinguish loose, unvirialized groups from compact, dynamically relaxed groups. Applying these techniques, we find that Dorado, NGC 4038 and NGC 4697 are unvirialized, whereas NGC 681, NGC 1400 and NGC 5084 are dynamically relaxed.
Resumo:
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.
Resumo:
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.
Resumo:
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.
Resumo:
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.
Resumo:
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.
Resumo:
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.
Resumo:
Models and model transformations are the core concepts of OMG's MDA (TM) approach. Within this approach, most models are derived from the MOF and have a graph-based nature. In contrast, most of the current model transformations are specified textually. To enable a graphical specification of model transformation rules, this paper proposes to use triple graph grammars as declarative specification formalism. These triple graph grammars can be specified within the FUJABA tool and we argue that these rules can be more easily specified and they become more understandable and maintainable. To show the practicability of our approach, we present how to generate Tefkat rules from triple graph grammar rules, which helps to integrate triple graph grammars with a state of a art model transformation tool and shows the expressiveness of the concept.