نتایج جستجو برای: lattice matching

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

2015
Jos E. Boschker Lauren A. Galves Timur Flissikowski Joao Marcelo J. Lopes Henning Riechert Raffaella Calarco

Van der Waals (vdW) epitaxy is an attractive method for the fabrication of vdW heterostructures. Here Sb2Te3 films grown on three different kind of graphene substrates (monolayer epitaxial graphene, quasi freestanding bilayer graphene and the SiC (6√3 × 6√3)R30° buffer layer) are used to study the vdW epitaxy between two 2-dimensionally (2D) bonded materials. It is shown that the Sb2Te3 /graphe...

2008
Francis Bursa

We investigate the matching of eigenvalue densities of Wilson loops in SU(N) lattice gauge theory: the eigenvalue densities in 1+1, 2+1 and 3+1 dimensions are nearly identical when the traces of the loops are equal. We show that the matching is present to at least second order in the strong–coupling expansion, and also to second order in perturbation theory. We find that in the continuum limit ...

Journal: :IACR Cryptology ePrint Archive 2012
Siamak Fayyaz Shahandashti Reihaneh Safavi-Naini Philip Ogunbona

We propose a fully private fingerprint matching protocol that compares two fingerprints based on the most widely-used minutia-based fingerprint matching algorithm. The protocol enables two parties, each holding a private fingerprint, to find out if their fingerprints belong to the same individual. Unlike previous works, we do not make any simplifying assumption on the matching algorithm or use ...

Journal: :Journal of Physics A 2021

We present a method for computing transition points of the random cluster model using generalization Newman-Ziff algorithm, celebrated technique in numerical percolation, to model. The new is straightforward implement and works real weight $q>0$. Furthermore, results an arbitrary number values $q$ can be found at once within single simulation. Because algorithm used sweep through bond configura...

2008
Mark A. Peterson Mengqi Ding

We construct doubly periodic Stokes flows in two dimensions using elliptic functions. This method has advantages when the doubly periodic lattice of obstacles has less than maximal symmetry. We find the mean flow through an arbitrary lattice in response to a pressure gradient in an arbitrary direction, and show in a typical example that the shorter of the two period lattice vectors is an “easy ...

2008
Eigo Shintani S. Aoki

We study the vacuum polarization functions on the lattice with exact chiral symmetry of overlap fermion by matching the lattice data at large momentum scales with the Operator Product Expansion (OPE). We extract the strong coupling constant α s (µ) in two-flavor QCD as Λ (2) MS = 0.234(9)(+16 − 0) GeV. From the analysis of the difference between the vector and axial-vector channels , we extract...

2017
Rohit Vaish Dinesh Garg

We study the problem of manipulation of the men-proposing Gale-Shapley algorithm by a single woman via permutation of her true preference list. Our contribution is threefold: First, we show that the matching induced by an optimal manipulation is stable with respect to the true preferences. Second, we identify a class of optimal manipulations called inconspicuous manipulations which, in addition...

Journal: :Physical review letters 2012
Taegil Bae Yong-Chull Jang Chulwoo Jung Hyung-Jin Kim Jangho Kim Jongjeong Kim Kwangwoo Kim Sunghee Kim Weonjong Lee Stephen R Sharpe Boram Yoon

We present a calculation of the kaon B parameter B(K) using lattice QCD. We use improved staggered valence and sea fermions, the latter generated by the MILC Collaboration with N(f)=2+1 light flavors. To control discretization errors, we use four different lattice spacings ranging down to a≈0.045 fm. The chiral and continuum extrapolations are done using SU(2) staggered chiral perturbation theo...

Journal: :Theor. Comput. Sci. 2008
Jean-Luc Baril Jean Marcel Pallo

We introduce a new lattice structure Bn on binary trees of size n. We exhibit efficient algorithms for computing meet and join of two binary trees and give several properties of this lattice. More precisely, we prove that the length of a longest (resp. shortest) path between 0 and 1 in Bn equals to the Eulerian numbers 2n − (n + 1) (resp. (n − 1)2) and that the number of coverings is ( 2n n−1 )...

Journal: :The journal of physical chemistry. B 2011
Eric Jankowski Sharon C Glotzer

Partition functions encode all the thermodynamics of a system, but for most systems of practical importance, they cannot be calculated exactly. In this work we present a new hierarchical method for calculating partition functions to arbitrary precision. We discuss the algorithmic details of our implementation, including elements of shape-matching and entropy calculation for on-lattice and off-l...

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

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