Research on integrating small numbers of datasets suggests the use of customized matching rules in order to adapt to the patterns in the data and achieve better results. The state-of-the-art work on matching large numbers of datasets exploits attribute co-occurrence as well as the similarity of values between multiple sources. We build upon these research directions in order to develop a method...

The DNA profiles of two individuals can have 0, 1, or 2 pairs of alleles that are the same at each locus. These events may be called mismatches, partial matches or matches, respectively, and they have probabilities that depend on the population proportions of alleles as well as the population structure parameter theta. The observed and expected numbers of pairs of individuals with various numbe...

The (G1,G2)-online Ramsey game is a two-player turn-based between builder and painter. Starting from an empty graph with infinite vertices, the adds new edge in each round, painter colors it red or blue. aims to force either copy of G1 blue G2 as few rounds possible, while painter’s aim opposite. online number r˜(G1,G2) minimum edges that needs win game, regardless strategy. Furthermore, we ini...

After preliminary computerized training on visual-visual identity matching, a 5-year-old boy with autism (Sam) was given visual-visual and auditory-visual matching-to-sample tests with new stimuli. He did well in matching dictated name samples to 20 pictures, 26 printed upper case letters, and 9 single-digit numbers. In matching the visual stimuli (pictures, letters, or numbers) to themselves, ...

We define the median stable matching for two-sided matching markets with wages and prove constructively that it exists. Journal of Economic Literature Classification Numbers: C71, C78.

Let G be a graph with edge set E and vertex set V. A vertex u is said to cover itself, all edges incident with u and all vertices joined to u . An edge (u, v) covers itself, the vertices u and v and all edges incident with u or v . Two elements of E U V are independent if neither covers the other . A Subset ~', of elements of E U V is called a total cover if the elements of W cover G and W is m...