ABOUT SPECIES INDEPENDENCE OF POLYSTICHUM SUBTRIPTERON TZVEL.
نویسندگان
چکیده
منابع مشابه
AN ANATOMICAL STUDY OF FIVE POLYSTICHUM SPECIES IN IRAN
In this research, five species of genus Polystichum, belong to Aspidiaceae, namely, P. lonchitis, P. woronowii, P. setiferum, P. braunii and P. aculeatum, gathered from Gilan and MazandaranProvinces were anatomically studied. To distinguish anatomical character of different growing organs such as pinnules, rachis, rhizumes and roots, the cross section was prepared. Based on these researches, id...
متن کاملTHE SPORES MICRO-MORPHOLOGICAL STUDY OF FIVE POLYSTICHUM SPECIES IN IRAN
In this research, five species of the genus Polystichum, belonging to Dryopteridaceae, namely, P. lonchitis, P. woronowii, P. setiferum, P. braunii and P. aculeatum, were collected from Gilan and Mazandaran Provinces and studied micro-morphologically. In order to compare the spores, their morphology and their ornamentation was studied. The spores each were picked from sporangia and each sample ...
متن کاملPropositional Reasoning about Saturated Conditional Probabilistic Independence
Conditional independence provides an essential framework to deal with knowledge and uncertainty in Artificial Intelligence, and is fundamental in probability and multivariate statistics. Its associated implication problem is paramount for building Bayesian networks. Unfortunately, the problem does not enjoy a finite ground axiomatization and is already coNP-complete to decide for restricted sub...
متن کاملReasoning about Independence in Probabilistic Models of Relational Data
Bayesian networks leverage conditional independence to compactly encode joint probability distributions. Many learning algorithms exploit the constraints implied by observed conditional independencies to learn the structure of Bayesian networks. The rules of d -separation provide a theoretical and algorithmic framework for deriving conditional independence facts from model structure. However, t...
متن کاملSome news about the independence number of a graph
For a finite undirected graph G on n vertices some continuous optimization problems taken over the n-dimensional cube are presented and it is proved that their optimum values equal the independence number of G.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Biological Bulletin of Bogdan Chmelnitskiy Melitopol State Pedagogical University
سال: 2016
ISSN: 2226-9010,2225-5486
DOI: 10.15421/201638