نتایج جستجو برای: two way coupling model
تعداد نتایج: 4432418 فیلتر نتایج به سال:
Using a tight-binding model and a tranfer-matrix technique, we numerically investigate the effects of the coupling strength, and the length of the molecule on the electronic transmission through a CNT/(single) molecule/CNT system. With trans-polyacetylene (trans-PA) as the molecule sandwiched between two semi-infinite carbon nanotube(CNT), we rely on Landauer formalism as the basis for studyi...
It is shown that for any class C closed under linear-time reductions, the complete sets for C under sublogarithmic reductions are also complete under 2DFA reductions, and thus are isomorphic under first-order reductions.
On every n-long input, every two-way finite automaton (fa) can reverse its 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 requires Ω(2) states on every deterministic fa with few reversals, but only h states on a nondeterministic fa with few reversals.
since esp received universal attention to smooth the path for academic studies and productions, a great deal of research and studies have been directed towards this area. swales’ (1990) model of ra introduction move analysis has served a pioneering role of guiding many relevant studies and has proven to be productive in terms of helpful guidelines that are the outcome of voluminous productions ...
هدف از انجام این پایان نامه شبیه سازی فرایندهای پخش ، انتقال و رسوب ذرات جامد در میدان جریان سیال می باشد.به همین منظور با بکارگیری یک روش اویلری – لاگرانژی میدان سیال را با استفاده از نگرش اویلری حل نموده و رفتار ذرات جامد را در مختصات لاگرانژی مورد مطالعه قرار می دهیم. همچنین اثرات متقابل دو فاز را در مواقع لزوم بصورت جملات چشمه و چاه در معادلات ناویر استوکس وارد می کنیم. در حالتی که جریان مغ...
In this paper, we show how the study of two-way automata on words may relevantly be extended to the study of two-way automata on one-dimensional overlapping tiles that generalize finite words. Indeed, over tiles, languages recognizable by finite two-way automata (resp. multi-pebble automata) coincide with languages definable by Kleene’s (resp. Kleene’s extended) regular expressions. As an immed...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید