نتایج جستجو برای: intransitivity

تعداد نتایج: 160  

Journal: :Diabetes Research and Clinical Practice 2022

Background: The dose-wise variation in sodium-glucose co-transporter inhibitor (SGLTi) treated type 1 diabetes mellitus (T1DM) patients' safety profile remains poorly understood. Aim: Therefore, this study aims to it. Method: A database search occurred PubMed, Embase, and Scopus databases for double-blinded randomized controlled trials reporting the above outcomes. risk of bias assessment revie...

Journal: :Applied Ontology 2006
Ingvar Johansson

Achille Varzi ends his note [10] on my paper [6] by saying: “Parthood is transitive, φ-parthood—for many values of ‘φ’—is not.” Let me call this view ‘the (Simons/Casati/Varzi) predicate modifier account’ of non-transitive parthood relations [9, 2]. As summarized in this quotation, I agree with it here, and did agree with it in the paper Varzi criticizes. It is puzzling to me why he surrounds h...

2010
Matthew A. Bowker Fernando T. Maestre

1. The stress-gradient hypothesis (SGH) predicts that the frequency of facilitative and competitive interactions will vary inversely across abiotic stress gradients, with facilitation being more common when abiotic stress is high. The effect of competition intensity on species richness is generally thought to be negative, but tests along true stress gradients are lacking. This body of research ...

2004
Behrooz Parhami

Sum& Conclusions Voting is important in the realization of ultrareliable systems based on the multi-channel computation paradigm. In an earlier paper (1991 Aug) I dealt with voting networks, viz, hardware implementation of certain voting schemes. A voting algorithm specifies how the voting result is obtained from the input data and can be the basis for implementing a hardware voting network or ...

2012
Matthew A. Bowker Fernando T. Maestre M. A. Bowker

Dryland vegetation is inherently patchy. Th is patchiness goes on to impact ecology, hydrology, and biogeochemistry. Recently, researchers have proposed that dryland vegetation patch sizes follow a power law which is due to local plant facilitation. It is unknown what patch size distribution prevails when competition predominates over facilitation, or if such a pattern could be used to detect c...

2015
Nicholas Brown Clintin P. Davis-Stober Michel Regenwetter

Kalenscher et al. (2010) explored the neural signatures of intransitive preferences. This endeavor is of great interest because transitivity of preferences has long been considered a key feature of rationality. The success of this approach hinges upon appropriate methods for identifying decision makers with intransitive preferences. The authors invented a descriptive numerical “index of intrans...

2011

In chapter 11 , we saw that Parfi t appealed to an Essentially Comparative View of Equality in presenting his Mere Addition Paradox, and that Parfi t now believes that his doing so was a big mistake. More generally, Parfi t now thinks that we should reject any Essentially Comparative View about the goodness of outcomes, which means that we must reject the Essentially Comparative View for all mo...

2015
Yuko Yanagida John Whitman

This paper argues that Old Japanese (eighth century) had split alignment, with nominative-accusative alignment in main clauses and active alignment in nominalized clauses. The main arguments for active alignment in nominalized clause come from ga-marking of active subjects and the distribution oftwo verbal prefixes: /-for active predicates and safor inactive predicates (cf. Yanagida, In: Hasega...

Journal: :Discrete Mathematics 2009
Bertrand Lemaire Marc Le Menestrel

In this paper, we study the binary relations R on a nonempty N-set A which are hindependent and h-positive (cf. the introduction below). They are called homothetic positive orders. Denote by B the set of intervals of R having the form [r,+∞[ with 0 < r ≤ +∞ or ]q,∞[ with q ∈ Q≥0. It is a Q>0-set endowed with a binary relation > extending the usual one on R>0 (identified with a subset of B via t...

1997
Kumiko Tanaka-Ishii

Word co-occurrences form a graph, regarding words as nodes and co-occurrence relations as branches. Thus, a co-occurrence graph can be constructed by co-occurrence relations in a corpus. This paper discusses a clustering method of the co-occurrence graph, the decomposition of the graph, from a graph-theoretical viewpoint. Since one of the applications for the clustering results is the ambiguity...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید