نتایج جستجو برای: or at times impossible

تعداد نتایج: 5962198  

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه شهید چمران اهواز - دانشکده علوم 1370

1- in a search directed to the reaction of compound)23(the cycloaddition reaction of 1,3- diphenylisobenzofurane)14(with p-benzoquinone)19(,followed by addition of cyclopentadiene was carried out.the specific spacial stracture of its ir,nmr,mass spectra. 2- in another attempt the kinetic stability and behavior of compounds)20(and)23(was studied.the main subject of this study was the highly reve...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تحصیلات تکمیلی علوم پایه زنجان - دانشکده ریاضی 1393

in this thesis, a structured hierarchical methodology based on petri nets is used to introduce a task model for a soccer goalkeeper robot. in real or robot soccer, goalkeeper is an important element which has a key role and challenging features in the game. goalkeeper aims at defending goal from scoring goals by opponent team, actually to prevent the goal from the opponent player’s attacks. thi...

پایان نامه :موسسه آموزش عالی غیر دولتی و غیرانتفاعی علامه محدث نوری (ره) - پژوهشکده اقتصاد 1393

dynamic assessment according to vygotskys sociocultural theory, states that instruction and assessment are interrelated. using static forms of assessment with second and foreign language students could do more harm than good. many teachers neglect to take account of the complexity involved in learning a second or foreign language and often wonder why learning of a language take so long. thi...

Journal: :The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science 1850

Journal: :Journal of statistical physics 2012
Mark M Meerschaert Peter Straka

A continuous time random walk (CTRW) imposes a random waiting time between random particle jumps. CTRW limit densities solve a fractional Fokker-Planck equation, but since the CTRW limit is not Markovian, this is not sufficient to characterize the process. This paper applies continuum renewal theory to restore the Markov property on an expanded state space, and compute the joint CTRW limit dens...

Journal: :Journal of Graph Theory 1991
Colin McDiarmid

We determine exactly the expected number of hamilton cycles in the random graph obtained by starting with n isolated vertices and adding edges at random until each vertex degree is at least two. This complements recent work of Cooper and Frieze. There are similar results concerning expected numbers for example of perfect matchings, spanning trees, hamilton paths and directed hamilton cycles.

Journal: :Journal of Statistical Physics 2012

Journal: :December 2009 2009

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید