992 resultados para Distance convex simple graphs
Resumo:
Tesis (Maestría en Ciencias con Especialidad en Parasitología) UANL
Resumo:
Tesis (Maestría en Ciencias con Especialidad en Microbiología Industrial) UANL
Resumo:
Tesis (Maestría en Ciencias con Especialidad en Ingeniería Cerámica) U.A.N.L.
Resumo:
Tesis ( Maestría en Ciencias Odontológicas con Especialidad en Ortodoncia) U.A.N.L.
Resumo:
Tesis (Maestría en Ciencias en Nutrición) UANL, 2012.
Resumo:
Tesis (Maestría en Educación Superior con especialidad en la Enseñanza de la Lengua y la Literatura) UANL, 2012.
Projet pilote d'aide à distance en direct à la Bibliothèque ÉPC-Biologie de l'Université de Montréal
Resumo:
Communication présentée dans le cadre du programme de formation continue de la Corporation des bibliothécaires professionnels du Québec, vendredi le 11 mars 2005.
Resumo:
In spatial environments, we consider social welfare functions satisfying Arrow's requirements. i.e., weak Pareto and independence of irrelevant alternatives. When the policy space os a one-dimensional continuum, such a welfare function is determined by a collection of 2n strictly quasi-concave preferences and a tie-breaking rule. As a corrollary, we obtain that when the number of voters is odd, simple majority voting is transitive if and only if each voter's preference is strictly quasi-concave. When the policy space is multi-dimensional, we establish Arrow's impossibility theorem. Among others, we show that weak Pareto, independence of irrelevant alternatives, and non-dictatorship are inconsistent if the set of alternatives has a non-empty interior and it is compact and convex.
Resumo:
In this paper, we study the asymptotic distribution of a simple two-stage (Hannan-Rissanen-type) linear estimator for stationary invertible vector autoregressive moving average (VARMA) models in the echelon form representation. General conditions for consistency and asymptotic normality are given. A consistent estimator of the asymptotic covariance matrix of the estimator is also provided, so that tests and confidence intervals can easily be constructed.
Resumo:
Rapport de recherche
Resumo:
UANL
Flippable Pairs and Subset Comparisons in Comparative Probability Orderings and Related Simple Games
Resumo:
We show that every additively representable comparative probability order on n atoms is determined by at least n - 1 binary subset comparisons. We show that there are many orders of this kind, not just the lexicographic order. These results provide answers to two questions of Fishburn et al (2002). We also study the flip relation on the class of all comparative probability orders introduced by Maclagan. We generalise an important theorem of Fishburn, Peke?c and Reeds, by showing that in any minimal set of comparisons that determine a comparative probability order, all comparisons are flippable. By calculating the characteristics of the flip relation for n = 6 we discover that the regions in the corresponding hyperplane arrangement can have no more than 13 faces and that there are 20 regions with 13 faces. All the neighbours of the 20 comparative probability orders which correspond to those regions are representable. Finally we define a class of simple games with complete desirability relation for which its strong desirability relation is acyclic, and show that the flip relation carries all the information about these games. We show that for n = 6 these games are weighted majority games.