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

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

2009
Erich Poppitz Yanwen Shang

We study ’t Hooft anomaly matching in lattice models with strong Yukawa or multi-fermion interactions. Strong non-gauge interactions among the mirror fermions in a vectorlike lattice gauge theory are introduced with the aim to obtain, in a strong-coupling symmetric phase, a long-distance unbroken gauge theory with chiral fermions in a complex representation. We show how to use exact lattice chi...

1999
J.-F. Ostiguy

For physicists and engineers involved in the design and analysis of beamlines (transfer lines or insertions) the lattice function matching problem is central and can be timeconsuming because it involves constrained nonlinear optimization. For such problems convergence can be difficult to obtain in general without expert human intervention. Over the years, powerful codes have been developed to a...

1998
D. B. Leinweber C. Parrinello J. I. Skullerud A. G. Williams

where the subscript f denotes the finer lattice (β = 6.2 in this study) and the subscript c denotes the coarser lattice (β = 6.0). We can use this relation to study directly the scaling properties of the lattice gluon propagator by matching Talk presented by D. B. Leinweber UKQCD Collaboration the data for the two values of β. This matching can be performed by adjusting the values for the ratio...

1996
Luc De Raedt Peter Idestam Almquist Gunther Sablon Steven Vere

Structural matching originally introduced by Steven Vere in the mid seventies was a popular sub eld of inductive concept learning in the late seventies and early eighties Despite various attempts to formalize and implement the notion of most speci c generalisation of two productions several problems remained These include using background knowledge the non uniqueness of most speci c generalisat...

Journal: :Math. Oper. Res. 2017
Yu Yokoi

Classified stable matching, proposed by Huang, describes a matching model between academic institutes and applicants, where each institute has upper and lower quotas on classes, i.e., subsets of applicants. Huang showed that the problem to decide whether there exists a stable matching or not is NP-hard in general. On the other hand, he showed that the problem is solvable if the classes form a l...

2014
Ciro Gracia Xavier Anguera Miró Jordi Luque Ittai Artzi

A novel phoneme-lattice to phoneme-sequence matching algorithm based on dynamic programming is presented in this paper. Phoneme lattices have been shown to be a good choice to encode in a compact way alternative decoding hypotheses from a speech recognition system. These are typically used for the spoken term detection and keyword-spotting tasks, where a phoneme sequence query is matched to a r...

2000
Rainer Wanzenberg

The lattice for the present design of the TESLA Linear Collider with integrated X-Ray Laser Facility is basically a FODO structure with constant beta-function. There are more than 800 individually powered superconducting quadrupoles to focus the beam in the two main linear accelerators (each with a length of 15 km). For the availability of the beams it is important that a power supply failure o...

2007
He Hu Xiaoyong Du

Ontology matching determines the correspondences between concepts and relations of related ontologies. In this paper, we put forward an ontology hierarchies matching approach based on lattices alignment. The proposed lattice-based matching algorithm can be utilized not only in matching processes between two ontologies, but also in annotation processes between an ontology and its corresponding r...

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

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