نتایج جستجو برای: descriptive method first
تعداد نتایج: 2924038 فیلتر نتایج به سال:
a novel silver (ag) nanocomposite electrode was proposed that fabricated from metal nanostructures and ionic liquids. the combined application of unique properties of nanomaterials and ionic liquids in the design of this ag nanocomposite results in electrodes with interesting advantages compared to the conventional metal disk electrode. in the first part of this thesis, the elecrocatalytic eff...
the aim of this study is investigating the effect of teaching “metacognitive strategies” on the way which scientific information retrieval workes by the using of google scholar searching machine on the students of ms in the psycology & education faculty of allameh tabatabayi university in 2007-2008 academic year. the statistical community was the students of ms in psychology & education facult...
this thesis attempts to measure learning styles, self efficacy and intrinsic motivation as predictors of iranian ielts reading comprehension. in order to address this issue, a quantitative study was conducted on some randomly selected intact students at ferdowsi university. these two groups were assigned as they were undergraduate (ba=91) and graduate (ma =74) students; they were all aged betwe...
abstract the current study examined the role of emotional intelligence and motivation on language learning of efl learners in iranian context. the participants of this study were 162 female and 100 male junior high school students. these participants were selected by convenient sampling method. to carry out the study two questionnaires were administered to the participants. first, the adap...
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoint of descriptive complexity theory. TC0 can be characterized as the class of queries expressible by the logic FOC(<,+,×), which is first-order logic augmented by counting quantifiers on ordered structures that have ad...
First-order (FO) logic and its extensions play an important role in many branches of (theoretical) computer science. Examples that will be considered in this paper are automata theory and descriptive complexity. Since Büchi’s and Elgot’s famous characterization of the regular string languages as the sets of models of (existential) monadic second-order (MSO) sentences, (existential) MSO logic ha...
Polyadic Higher-Order Fixpoint Logic (PHFL) is a modal fixpoint logic obtained as the merger of Higher-Order Fixpoint Logic (HFL) and the Polyadic μ-Calculus. Polyadicity enables formulas to make assertions about tuples of states rather than states only. Like HFL, PHFL has the ability to formalise properties using higher-order functions. We consider PHFL in the setting of descriptive complexity...
The computational complexity of a problem is the amount of resources, such as time or space, required by a machine that solves the problem. The descriptive complexity of problems is the complexity of describing problems in some logical formalism over finite structures. One of the exciting developments in complexity theory is the discovery of a very intimate connection between computational and ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید