BACKGROUND AND PURPOSE Current models of brain function propose that number processing involves the interaction of different neuronal networks. Our purpose was to use functional MR (fMR) imaging to elucidate the brain regions engaged by multiplication. METHODS Eighteen adults underwent fMR imaging while performing matching, multiplication, and control tasks. For each task, three or four singl...

The conditional matching preclusion number of a graph with n vertices is the minimum number of edges whose deletion results in a graph without an isolated vertex that does not have a perfect matching if n is even, or an almost perfect matching if n is odd. We develop some general properties on conditional matching preclusion and then analyze the conditional matching preclusion numbers for some ...

ontology is the main infrastructure of the semantic web which provides facilities for integration, searching and sharing of information on the web. development of ontologies as the basis of semantic web and their heterogeneities have led to the existence of ontology matching. by emerging large-scale ontologies in real domain, the ontology matching systems faced with some problem like memory con...

This paper provides micro-foundations for independent random matching of a large population, as widely used in the economics literature. We consider both static and dynamic systems with random mutation, partial matching arising from search, and type changes induced by matching. Under independence assumptions at each randomization step, we show that there is an almost-sure constant cross-section...

A set M of edges of a graph G is a matching if no two edges in M are incident to the same vertex. The matching number of G is the maximum cardinality of a matching of G. A set S of vertices in G is a total dominating set of G if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set of G is the total domination number of G. If G does not contain K1,...

Let G be a graph that admits a perfect matching. A forcing set for a perfect matching M of G is a subset S of M , such that S is contained in no other perfect matching of G. This notion has arisen in the study of .nding resonance structures of a given molecule in chemistry. Similar concepts have been studied for block designs and graph colorings under the name de/ning set, and for Latin squares...

Traditional iris recognition method has low speed and searching rate in large-scale unstructured database. Three different quantum algorithms are proposed in iris recognition. Quantum filtering algorithm can get a better filtering result than classical algorithm in iris filtering process. Quantum Fourier transforms exhibits an exponential speed-up compared with discrete Fourier transform in fea...