نتایج جستجو برای: subclass
تعداد نتایج: 12876 فیلتر نتایج به سال:
BACKGROUND The Subclass Coleoidea (Class Cephalopoda) accommodates the diverse present-day internally shelled cephalopod mollusks (Spirula, Sepia and octopuses, squids, Vampyroteuthis) and also extinct internally shelled cephalopods. Recent Spirula represents a unique coleoid retaining shell structures, a narrow marginal siphuncle and globular protoconch that signify the ancestry of the subclas...
Most patients with IgA and/or IgG subclass deficiency are asymptomatic but some may suffer from frequent mainly respiratory infections. The aim of our study was to determine the frequency of IgA and/or IgG subclass deficiencies and the rate of chronic pulmonary damage secondary to recurrent pulmonary infections in these children. Serum IgA and IgG subclass levels were measured in 225 children a...
5 Interspecific relationships 48 INTRODUCTION 5 Predation 49 Location and geologic setting 5 Competition 50 Previous work 7 Commensalism 50 Approaches and study objectives 7 DEPOSITIONAL ENVIRONMENT AND Vertebrate paleontology 8 PALEOECOLOGIC SYNTHESIS 50 Paleobotany 8 Climate and paleogeography 50 Stratigraphy and correlation 8 Succession of the ancient communities 51 Acknowledgments 12 Summar...
In this paper, we argue that object-oriented models must be able to represent three kinds of taxonomic structures: static subclasses, dynamic subclasses and role classes. If CAR is a static subclass of V EHICLE, then a vehicle that is not a car can never migrate to the CAR subclass. If EMPloyee is a dynamic subclass of PERSON, then a PERSON that is not an employee may migrate to EMP. In both ca...
In this paper, we study two-player games played on infinite but monotonic game structures. We concentrate on coverability games, a natural subclass of reachability games in the context of monotonic game structures. On the negative side, we show that surprisingly, and contrary to the one-player case, coverability is undecidable on two-player monotonic game structures. On the positive side, we id...
We consider the problem of learning deterministic even linear languages from positive examples. We show that, for any nonnegative integer k, the class of LR(k) even linear languages is not learnable from positive examples while there is a subclass called US(k), which is a natural subclass of U(A) in the strong sense, learnable from positive examples. Our learning algorithm identifies this subcl...
We show a subclass of simple deterministic languages which is teachable in polynomial examples. Teachability on grammatical inference is studied with the setting called “identification in the limit from polynomial time and data”, and there are negative results for famous languages. In this paper, we show a learning algorithm from membership queries and counterexamples for a subclass of simple d...
In this paper, the concepts of symmetric q-calculus and conic regions are used to define a new domain Ωk,q,α˜, which generalizes domains. By using we subclass analytic q-starlike functions in open unit disk U establish some results for class. We also investigate number useful properties characteristics subclass, such as coefficients estimates, structural formulas, distortion inequalities, neces...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید