Matching problem

Summarizing, the Procrustes matching problem for two configurations X and Y can be solved with the following algorithm ... 

Note also that, even if some evil epidemiologists could undertake such an experiment in humans, there is virtually no way two human populations could be assembled and matched in the way lab animal populations can be matched, so that causation would remain difficult for the epidemiologist to establish. This matching problem begins to explain why there is much distance to travel even after an association is demonstrated. 

Exercise. Thomas Young remarked that if two different languages have the same word for one concept one cannot yet conclude that they are related since it may be a coincidence. In this connection he solved the following Rencontre Problem or Matching Problem What is the probability that an arbitrary permutation of n objects leaves no object in its place Naturally it is assumed that each permutation has a probability n 1 to occur. Show that the desired probability p as a function of n obeys the recurrence relation... 

A useful target postulated so as to distinguish among the many HENs that satisfy the minimum utility cost is the minimum number of matches problem which is stated in the following section. 

The total cost of a given pose corresponds to an optimal solution of the complete matching problem, which is a permutation e of 1, 2,..., N that minimizes... 

Although there are a number of techniques that have been proposed to solve the surface matching problem, they all suffer from the fact that an inherent uncertainty is replaced by ad hoc procedures. Even if the molecular surface concept is replaced by a one parameter family of isosurfaces," this does not lead to a unique matching technique. 

Forgy, C., Rete A Fast Algorithm for the Many Pattern/Many Object Pattern Match Problem, Artificial Intelligence, 19, 17, 1982. 

Schema matching aims at identifying semantic correspondences between metadata structures or models, such as database schemas, XML message formats, and ontologies. Solving such match problems is a key task in numerous application fields, particularly to support data exchange, schema evolution, and virtually all kinds of data integration. Unfortunately, the typically high degree of semantic heterogeneity reflected in different schemas makes schema matching an inherently complex task. Hence, most current systems still require the manual specification of semantic correspondences, e.g., with the help of a GUI. While such an approach is appropriate for...

Tan and Lambrix (2007) propose an alternative approach that recommends a promising match strategy for a given match problem. They first select a limited... 

As mentioned in Sec. 1, the substructure isomorphism is only a special case of the more general MCSS match problem. 

For colored graph matching problems, all other atom properties, such as atom types and hybridizations, are also taken into account during the selection of starting atom pairs. 

There are only three possible ketones 2-heptanone, 3-hepianone, and 4-heptanone. So this is really a matching problem. 

Color matching is a difficult matter. Introducing a direct link between product data sheet specifications and supplied material is the best way to help people in solving the color matching problem. 

Kalagnanam, J., Dawande, M., Trumbo, M., and Lee, H. The Surplus Inventory Matching Problem in the Process Industry. Operations Research, 48(4) 505-516, July 2000. 

---