نتایج جستجو برای: two way coupled
تعداد نتایج: 2904915 فیلتر نتایج به سال:
learning-oriented assessment seeks to emphasise that a fundamental purpose of assessment should be to promote learning. it mirrors formative assessment and assessment for learning processes. it can be defined as actions undertaken by teachers and / or students, which provide feedback for the improvement of teaching and learning. it also contrasts with equally important measurement-focused appro...
The thermal management of the vehicular module is key to design efficient wireless power transfer systems. In order predict behavior by simulation, mutual interaction electromagnetic and fields must be taken into account. This multiphysical coupling leads extensive computational effort. One approach reduce complexity limiting interdependencies between domains one-way coupling. paper examined ap...
fuzzy logic has been developed over the past three decades into a widely applied techinque in classification and control engineering. today fuzzy logic control is one of the most important applications of fuzzy set theory and specially fuzzy logic. there are two general approachs for using of fuzzy control, software and hardware. integrated circuits as a solution for hardware realization are us...
In this paper, we first study the conversion of weighted two-way automata to one-way automata. We show that this conversion preserves the unambiguity but does not preserve the determinism. Yet, we prove that the conversion of an unambiguous weighted one-way automaton into a two-way automaton leads to a deterministic two-way automaton. As a consequence, we prove that unambiguous weighted two-way...
this thesis aims to adduce an unmitigated and comprehensive explication concerning the relationship of three significant elements of fiction: setting, chracter and theme. my research is basically placed on two outstanding novels of the 19th century: emily brontes wuthering heights and thomas hardys return of the native. my endeavour lies in studying the correlation among the three above-mention...
On every n-long input, every two-way finite automaton (fa) can reverse its input head O(n) times before halting. A fawith few reversals is an automaton where this number is only o(n). For every h, we exhibit a language that can be recognized by an h-state nondeterministic fa with few reversals, but requires Ω(2) states on every deterministic fa with few reversals.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید