نتایج جستجو برای: transitivity system
تعداد نتایج: 2233103 فیلتر نتایج به سال:
This article employs one of the tools proposed by Jeffries’ (2010) framework critical stylistic namely TCF representing actions/events /and states (transitivity) to examine how male and female Para Athletes are linguistically constructed as social actors in selected English Arabic Paralympic sport magazines. It aims identify strategies employed these magazines their textual representation const...
Rich-club, assortativity and clustering coefficients are frequently used measures to estimate topological properties of complex networks. Here we find that the connectivity among a very small portion of the richest nodes can dominate the assortativity and clustering coefficients of a large network, which reveals that the rich-club connectivity is leveraged throughout the network. Our study sugg...
We show that among Cr extensions (r > 0) of a uniformly hyperbolic dynamical system with fiber the standard real Heisenberg group Hn of dimension 2n + 1, those that avoid an obvious obstruction to topological transitivity are generically topological transitive. Moreover, if one considers extensions with fiber a connected nilpotent Lie group with compact commutator subgroup (for example, Hn/Z), ...
We consider existential rules (aka Datalog±) as a formalism for specifying ontologies. In recent years, many classes of existential rules have been exhibited for which conjunctive query (CQ) entailment is decidable. However, most of these classes cannot express transitivity of binary relations, a frequently used modelling construct. In this paper, we address the issue of whether transitivity ca...
An on-line "word detection" paradigm was used to assess the comprehension of thematic and transitive verb agreements during sentence processing in individuals diagnosed with probable Alzheimer's Disease (AD, n=15) and Frontotemporal Dementia (FTD, n=14). AD, FTD, and control participants (n=17) were asked to listen for a word in a sentence. Unbeknownst to the participants, the target word follo...
Much work has demonstrated that speakers of verb-final languages are able to construct rich syntactic representations in advance of verb information. This may reflect general architectural properties of the language processor, or it may only reflect a language-specific adaptation to the demands of verb-finality. The present study addresses this issue by examining whether speakers of a verb-medi...
B Properties of the Declarative System 23 1 Lemma (Declarative Weakening) . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23 2 Lemma (Declarative Term Substitution) . . . . . . . . . . . . . . . . . . . . . . . . 23 3 Lemma (Reflexivity of Declarative Subtyping) . . . . . . . . . . . . . . . . . . . . . 23 4 Lemma (Subtyping Inversion) . . . . . . . . . . . . . . . . . . . . . . . . . ....
We generalize the classical expected-utility criterion by weakening transitivity to Suzumura consistency. In the absence of full transitivity, reflexivity and completeness no longer follow as a consequence of the system of axioms employed and a richer class of rankings of probability distributions results. This class is characterized by means of standard expected-utility axioms in addition to S...
We present a graphical criterion for reading dependencies from the minimal directed independence map G of a graphoid p, under the assumption that G is a polytree and p satisfies weak transitivity. We prove that the criterion is sound and complete. We argue that assuming weak transitivity is not too restrictive.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید