نتایج جستجو برای: descriptive study
تعداد نتایج: 3995020 فیلتر نتایج به سال:
Introduction: About 2.400.000 human cases in 61 countries and 180000000 people at Fascioliasis infection risk, show the importance of human aspects of Fascioliasis around the world. In the north of our country (Iran) huge outbreaks of Fascioliasis have been seen and up to 10000 people have been infected with Fascioliasis in one of these outbreaks. So this study tries to show better criteria a...
Background: Lichen planus has various clinical and epidemiologic features in different countries. Objectives: To determine clinical and epidemiologic patterns of lichen planus in dermatology department of Hamadan Sina Hospital during a ten-year period. Patients and Methods: This retrospective descriptive study was performed on 363 patients (Including 190 females and 173 males) suffered fr...
Protection of privacy in databases has become of increasing importance. While a number of techniques have been proposed to query databases while preserving privacy of individual records in the database, very little is done to define a measure on how much privacy is lost after statistical releases. We suggest a definition based on information theory. Intuitively, the privacy loss is proportional...
Weakly recognizing morphisms from free semigroups onto finite semigroups are a classical way for defining the class of ω-regular languages, i.e., a set of infinite words is weakly recognizable by such a morphism if and only if it is accepted by some Büchi automaton. We consider the descriptional complexity of various constructions for weakly recognizing morphisms. This includes the conversion f...
The communication structure of parallel communicating grammar systems (PCGS) considered as the descriptional complexity of PCGS is investigated here. The aim of the paper is to compare computational power of PCGS’s with respect to their communication structure. Investigating the generation of the languages over one-letter alphabet the communication structures dags(directed acyclic graphs) and c...
We prove that the set of properties describable by a uniform sequence of rst-order sentences using at most k + 1 distinct variables is exactly equal to the set of properties checkable by a Turing machine in DSPACEn k ] (where n is the size of the universe). This set is also equal to the set of properties describable using an iterative deenition for a nite set of relations of arity k. This is a ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید