نتایج جستجو برای: single bounded dichotomous choice
تعداد نتایج: 1111436 فیلتر نتایج به سال:
JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected].. The RAND Corporation is collaborating with JSTOR to digit...
in this paper, a new definition of fuzzy bounded sets and totallyfuzzy bounded sets is introduced and properties of such sets are studied. thena relation between totally fuzzy bounded sets and n-compactness is discussed.finally, a geometric characterization for fuzzy totally bounded sets in i- topologicalvector spaces is derived.
This paper examines necessary and sufficient conditions for the existence of Maximum Likelihood Estimates (MLE) and the propriety of the posterior under a bounded improper prior density for a wide class of discrete (or multinomial) choice models. The choice models are based on the principle of utility maximization. Our results cover a wide class of latent variable distributions defining the uti...
Dichotomous Dichotomous variables have only two categories or levels. Variables with values such as “yes” or “no,” “present” or “absent,” “test” or “control” are dichotomous. Gender is a dichotomous variable with two values ‐ “male” and “female.” Disease status (present/absent), exposure status (present/absent), residence (urban/rural), antibiotic sensitivity (sensitive/resistant), type of bact...
Strategy-proofness has been one of the central axioms in the theory of social choice. We find that strategy-proofness is decomposed into three axioms: top-restricted AM-proofness, weak monotonicity, and individual bounded response. Among them, individual bounded respose is not as defensible as the other two, and we present possibility results by excluding individual bounded response from strate...
Given a set S of points in the plane, a geometric network for S is a graph G with vertex set S and straight edges. We consider a broadcasting situation, where one point r ∈ S is a designated source. Given a dilation factor δ, we ask for a geometric network G such that for every point v ∈ S there is a path from r to v in G of length at most δ|rv|, and such that the total edge length is minimized...
The problems of controlling an election have been shown NP-complete in general but polynomial-time solvable in single-peaked elections for many voting correspondences. To explore the complexity border, we consider these control problems by adding/deleting votes in elections with bounded single-peaked width k. Single-peaked elections have singlepeaked width k = 1. We prove that the constructive ...
dimension seep : drip Emphasis enemy : foe Denotational, indirect error : mistake Denotational, fuzzy woods : forest Stylistic, formality pissed : drunk : inebriated Stylistic, force ruin : annihilate Expressed attitude skinny : thin : slim, slender Emotive daddy : dad : father Collocational task : job Selectional pass away : die Subcategorization give : donate 2.3 Dimensions of variation The p...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید