نتایج جستجو برای: partition factor

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

2006
M WHEELER

Using BKP neutral fermions, we derive a product expression for the generating function of volume-weighted plane partitions that satisfy two conditions. If we call a set of adjacent equal height-h columns, h > 0, an h-path, then 1. Every h-path can assume one of two possible colours. 2. There is a unique way to move along an h-path from any column to another. In [1], Okounkov and Reshetikhin obs...

ژورنال: مهندسی دریا 2010
آل شیخ, علی اصغر, صداقت, امین, محمدی, نازیلا, ملک, محمدرضا,

The objective of this paper is to introduce a new method for coastlines delineation from high-resolution satellite images automatically. The proposed approach integrates the color histogram analysis for estimating the number of clusters, fuzzy c-partition, and genetic algorithms for optimizing fuzzy c-partition matrix. The imagery is classified into homogenous areas using the proposed fuzzy log...

There are many obstacles in quantum circuits implementation with large scales, so distributed quantum systems are appropriate solution for these quantum circuits. Therefore, reducing the number of quantum teleportation leads to improve the cost of implementing a quantum circuit. The minimum number of teleportations can be considered as a measure of the efficiency of distributed quantum systems....

B. Chen T. Shen W. Zhao X. Du Y. Meng Y. Wang Y. Zhang Z. Zhou,

Wheat–cotton double cropping practices on a large scale in cotton belt of the Yellow RiverValley and the Yangtze River Valley in China. Field experiments were conducted to determinethe effects of wheat–cotton double cropping on cotton biomass accumulation and yieldformation during 2011/12 and 2012/13 growing seasons. Two cotton cultivars, Siza 3 (mid–latematurity) and CCRI 50 (early maturity), ...

2009
Joseph Gonzalez Yucheng Low Carlos Guestrin David R. O'Hallaron

As computer clusters become more common and the size of the problems encountered in the field of AI grows, there is an increasing demand for efficient parallel inference algorithms. We consider the problem of parallel inference on large factor graphs in the distributed memory setting of computer clusters. We develop a new efficient parallel inference algorithm, DBRSplash, which incorporates ove...

Journal: :Physical review. E, Statistical, nonlinear, and soft matter physics 2006
Michael Chertkov Vladimir Y. Chernyak

Considering a discrete and finite statistical model of a general position we introduce an exact expression for the partition function in terms of a finite series. The leading term in the series is the Bethe-Peierls (belief propagation) (BP) contribution; the rest are expressed as loop contributions on the factor graph and calculated directly using the BP solution. The series unveils a small par...

2016
Zhang NA Cui HUAIXIN

BACKGROUND The aim of the study was to discuss on the influential factors of the mode of classification of partition management in the emergency triage. METHOD Retrospectively analyzing the effects of emergency triage of 156 cases who adopted the classification partition management mode during Oct 2014 to Oct 2015 in Xuzhou Central Hospital (Xuzhou, Jiangsu Province, China). They were divided...

2016
Anna Khoreva Rodrigo Benenson Fabio Galasso Matthias Hein Bernt Schiele

Graph-based video segmentation methods rely on superpixels as starting point. While most previous work has focused on the construction of the graph edges and weights as well as solving the graph partitioning problem, this paper focuses on better superpixels for video segmentation. We demonstrate by a comparative analysis that superpixels extracted from boundaries perform best, and show that bou...

Journal: :Proceedings of the National Academy of Sciences of the United States of America 1976
T L Hill

In the Eyring rate theory, the rate constant is expressed as a product of a frequency factor (kT/h) and a quotient of partition functions. Continuing an earlier paper, it is shown here by means of simple examples that the Eyring formalism may be extended to include diffusion-controlled processes if a new frequency factor, D/Rlambda, is substituted for kT/h, where D = diffusion coefficient, lamb...

Journal: :Random Struct. Algorithms 1999
Anne Condon Richard M. Karp

The NP-hard graph bisection problem is to partition the nodes of an undirected graph into two equal-sized groups so as to minimize the number of edges that cross the partition. The more general graph l-partition problem is to partition the nodes of an undirected graph into l equal-sized groups so as to minimize the total number of edges that cross between groups. We present a simple, linear-tim...

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

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