the purpose of the matching interdiction problem in a weighted graph is to findtwo vertices such that the weight of the maximum matching in the graph withoutthese vertices is minimized. an approximate solution for this problem has beenpresented. in this paper, we consider dendrimers as graphs such that the weightsof edges are the bond lengths. we obtain the maximum matching in some types ofdend...

Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new impr...

Evidence from neuropsychological patients suggests that multiple body representations exist. The most common dissociation is between body schema to guide limb movements, and body image used to make perceptual judgements. In the current study we employed a kinaesthetic illusion in two experiments to dissociate body representations in healthy individuals. Tendon vibration creates an illusory leng...

The analysis phase in an indirect, transfer and global approach to machine translation is studied. The analysis conducted can be described as exhaustive (meaning with backtracking), depth-first and strategically and heuristically driven, while the gran~nar used is an augmented context free grammar. The problem areas, being pattern matching, ambiguities, forward propagation, checking for correct...

This paper is about the relationship between dative case and the indirect object, i.e. about the linking between a morphological case and a grammatical role. The primary evidence is taken from relative clause data in German dialects (two other continental West Germanic varieties, Yiddish and a North Frisian dialect, are taken into account as well). The typical morphological systems of some of t...

This work builds a ridesharing model that compares the successful matching rate and detour cost of ridesharing with three types of social connections (i.e., friends) in a small-world network: direct friends, direct or indirect friends, and anyone. How much is trust: The cost and benefit of ridesharing with friends Yaoli Wang1, Nicole Ronald1,2, Ronny Kutadinata1, Stephan Winter1 1 Department of...

We give an indirect argument for the matching G2 = −π∗γ 2 of four-flux and discrete twist in the duality between N = 1 heterotic string and F -theory. This treats in detail the Euler number computation for the physically relevant case of a Calabi-Yau fourfold with singularities. [email protected], supported by U.S. DOE grant DE-FG05-85ER40219/Task A. [email protected], supported by NSF grant...