نتایج جستجو برای: renormalization group theory6 words separated by comma

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

Journal: :CoRR 2015
Felipe A. P. de Figueiredo Joao Paulo Miranda Fabrício L. Figueiredo Fabbryccio A. C. M. Cardoso

This document gives formatting guidelines for authors preparing papers for publication in the International Journal of Emerging Technology and Advanced Engineering The authors must follow the instructions given in the document for the papers to be published. Keywords—Keyword are your own designated keyword which can be used for easy location of the manuscript using any search engines. It includ...

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

abstract recent studies suggest that prelistening activities play an important role in the development of listening comprehension (e.g. long 1990;chiang and dunkel 1992; schmidt-rinehart 1994; jensen and hansen 1995; robinson et al., 1995; buck, 1995; foster and skehan,1996; teng 1996; robinson, 2001; chang and read 2006). in line with previous studies and to shed light on a new aspect of sche...

2008
Kay Jörg Wiese

In contrast to standard critical phenomena, disordered systems need to be treated via the Functional Renormalization Group. The latter leads to a coarse grained disorder landscape, which after a finite renormalization becomes non-analytic, thus overcoming the predictions of the seemingly exact dimensional reduction. We review recent progress on how the nonanalytic effective action can be measur...

1992
E. Bagan Patricia Ball

Radiative corrections to both perturbative and non-perturbative contributions are added to existing calculations of the Isgur-Wise function ξIW . To this end, we develop a method for calculating two-loop integrals in the heavy quark effective theory involving two different scales. The inclusion of O(αs) terms causes ξIW to decrease as compared to the lowest order result and shows the importance...

Journal: :Electr. J. Comb. 2010
Jianxi Li Ji-Ming Guo Wai Chee Shiu

The algebraic connectivity of a graph G is the second smallest eigenvalue of its Laplacian matrix. Let Bn be the set of all bicyclic graphs of order n. In this paper, we determine the last four bicyclic graphs (according to their smallest algebraic connectivities) among all graphs in Bn when n > 13. This result, together with our previous results on trees and unicyclic graphs, can be used to fu...

Journal: :Progress of Theoretical Physics 1977

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

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