Search results for "68"
showing 10 items of 1026 documents
Minería de oro: promesas, conflictos y desilusión en Cerro de San Pedro, México
2018
Este artículo analiza los conflictos por los recursos agua y tierra en Cerro de San Pedro, México, cuando una empresa minera canadiense inició una mina a cielo abierto en este municipio. Examinamos diferentes posiciones en el conflicto entre la mina de oro y los habitantes locales, y cómo ambivalentes regulaciones nacionales y organismos gubernamentales permitieron que una empresa extranjera operara sin los permisos requeridos. Para analizar el conflicto utilizamos el marco de Escalones de Análisis de Derechos, que distingue cuatro capas de disputa: sobre los recursos; el contenido de las normas; el poder de decisión; y los discursos. Discutimos cómo la auto-representación de la empresa ext…
Miscellaneous Graph Preliminaries. Part I
2021
Summary This article contains many auxiliary theorems which were missing in the Mizar Mathematical Library to the best of the author’s knowledge. Most of them regard graph theory as formalized in the GLIB series and are needed in upcoming articles.
About Graph Complements
2020
Summary This article formalizes different variants of the complement graph in the Mizar system [3], based on the formalization of graphs in [6].
Refined Finiteness and Degree Properties in Graphs
2020
Summary In this article the finiteness of graphs is refined and the minimal and maximal degree of graphs are formalized in the Mizar system [3], based on the formalization of graphs in [4].
Automata and differentiable words
2011
We exhibit the construction of a deterministic automaton that, given k > 0, recognizes the (regular) language of k-differentiable words. Our approach follows a scheme of Crochemore et al. based on minimal forbidden words. We extend this construction to the case of C\infinity-words, i.e., words differentiable arbitrary many times. We thus obtain an infinite automaton for representing the set of C\infinity-words. We derive a classification of C\infinity-words induced by the structure of the automaton. Then, we introduce a new framework for dealing with \infinity-words, based on a three letter alphabet. This allows us to define a compacted version of the automaton, that we use to prove that ev…
Parsimony hierarchies for inductive inference
2004
AbstractFreivalds defined an acceptable programming system independent criterion for learning programs for functions in which the final programs were required to be both correct and “nearly” minimal size. i.e.. within a computable function of being purely minimal size. Kinber showed that this parsimony requirement on final programs limits learning power. However, in scientific inference, parsimony is considered highly desirable. Alim-computable functionis (by definition) one calculable by a total procedure allowed to change its mind finitely many times about its output. Investigated is the possibility of assuaging somewhat the limitation on learning power resulting from requiring parsimonio…
Indecomposable modules over the Virasoro Lie algebra and a conjecture of V. Kac
1991
We consider a class of indecomposable modules over the Virasoro Lie algebra that we call bounded admissible modules. We get results concerning the center and the dimensions of the weight spaces. We prove that these modules always contain a submodule with one-dimensional weight spaces. From this follows the proof of a conjecture of V. Kac concerning the classification of simple admissible modules.
About Graph Mappings
2019
Summary In this articles adjacency-preserving mappings from a graph to another are formalized in the Mizar system [7], [2]. The generality of the approach seems to be largely unpreceeded in the literature to the best of the author’s knowledge. However, the most important property defined in the article is that of two graphs being isomorphic, which has been extensively studied. Another graph decorator is introduced as well.
About Graph Unions and Intersections
2020
Summary In this article the union and intersection of a set of graphs are formalized in the Mizar system [5], based on the formalization of graphs in [7].
Decreased presence of Langerhans cells is a critical determinant for Indian Post kala-azar dermal leishmaniasis.
2015
Post kala-azar dermal leishmaniasis (PKDL) is the dermal sequel of visceral leishmaniasis (VL) and occurs after apparent cure or alongside with VL. It is confined to South Asia (India, Nepal and Bangladesh) and East Africa (mainly Sudan), the incidence being 5-10% and 50-60% respectively. In South Asia, as the transmission of VL is anthroponotic, PKDL patients are the proposed disease reservoir, thus assuming epidemiological significance, its eradication being linked to the control of leishmaniasis. In the absence of an animal model and its low incidence, factors contributing towards the immunopathogenesis of PKDL remain an open-ended, yet pertinent question. This study delineated the lesio…