نتایج جستجو برای: descriptive method
تعداد نتایج: 1717844 فیلتر نتایج به سال:
The Welaran watershed in the Karangsambung area is hydrogeologically interesting because of its morphology, “U” shaped morphology like an amphitheater with lithology consisting tertiary to quarternary rocks. character river intermittent that watery during rainy season and dry season. This study intended identify determine general hydrogeological condition on a scale 1:20.000. applies descriptiv...
The researchers assume that ability of writing should be developed in a good plan and through practices. most important duty for his effort to minimize students’ difficult writing. It was got indication learning form done still traditional. using strategy gives possibility relate apply their knowledge skill they at the class with real life are environment. Teacher’s is facilitator direction gra...
abstract part one: the electrode oxidation potentials of a series of eighteen n-hydroxy compounds in aqueous solution were calculated based on a proper thermodynamic cycle. the dft method at the level of b3lyp-6-31g(d,p) was used to calculate the gas-phase free energy differences ,and the polarizable continuum model (pcm) was applied to describe the solvent and its interaction with n-hydroxy ...
State complexity is a descriptive complexity measure for regular languages. We investigate the problems related to the state complexity of regular languages and their operations. In particular, we compare the state complexity results on regular languages with those on nite languages.
In this paper we present logical characterizations of two preorders, within the framework of Hennessy-Milner Logics. The two preorders (loosely termed bisimulation-based efficiency preorders) are on processes represented as labelled transition systems. The characterizations are particularly interesting as they explore preorders lying between strong and weak bisimilarity, guided by a principle o...
A new distance function dist (A,B) for fuzzy sets A and B is introduced. It is based on the descriptive complexity, i.e., the number of bits (on average) that are needed to describe an element in the symmetric difference of the two sets. The distance gives the amount of additional information needed to describe any one of the two sets given the other. We prove its mathematical properties and pe...
Syntactic constraints in Koskenniemi's Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turns out that although the constraints in Voutilainen's (1994) FSIG description of English make use of several extensions to regular expressions, the description as a whole reduces to a finite combination of union, compleme...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید