نتایج جستجو برای: factorization structure

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

Journal: :Applied Categorical Structures 2011
S. Sh. Mousavi S. N. Hosseini

In this article the notion of quasi right factorization structure in a category X is given. The main result is a one to one correspondence between certain classes of quasi right factorization structures and 2-reflective subobjects of a predefined object in Lax(PrOrdX op ). Also a characterization of quasi right factorization structures in terms of images is given. As an application, the closure...

Journal: :journal of sciences, islamic republic of iran 2010
h. mehraban

we used qcd factorization for the hadronic matrix elements to show that the existing data, in particular the branching ratios br ( ?j/?k) and br ( ?j/??), can be accounted for this approach. we analyzed the decay within the framework of qcd factorization. we have complete calculation of the relevant hard-scattering kernels for twist-2 and twist-3. we calculated this decays in a special scale ( ...

2007
GRANT LARSEN

Familiarly, in Z, we have unique factorization. We investigate the general ring and what conditions we can impose on it to necessitate analogs of unique factorization. The trivial ideal structure of a field, the extent to which primary decomposition is unique, that a Noetherian ring necessarily has one, that a principal ideal domain is a unique factorization domain, and that a Dedekind domain h...

Journal: :CoRR 2014
Beyza Ermis Yusuf Kenan Yilmaz Ali Taylan Cemgil Evrim Acar

Probabilistic Latent Tensor Factorization (PLTF) is a recently proposed probabilistic framework for modelling multi-way data. Not only the common tensor factorization models but also any arbitrary tensor factorization structure can be realized by the PLTF framework. This paper presents full Bayesian inference via variational Bayes that facilitates more powerful modelling and allows more sophist...

2000
Pedro M. Q. Aguiar José M. F. Moura

Factorization methods use linear subspace constraints to recover 3D rigid structure from 2D motion. Usually, these methods give equal weight to the contribution of each region (or feature) to the estimates of the 3D structure. In this paper, we accommodate different confidence weights for the 2D motion parameter estimates of each region, by rewriting the problem as the factorization of a modifi...

2008
Romuald A. Janik

In this talk I review the structure of vacua of N = 2 theories broken down to N = 1 and it’s link with factorization of SeibergWitten curves. After an introduction to the structure of vacua in various supersymmetric gauge theories, I discuss the use of the exact factorization solution to identify different dual descriptions of the same physics and to count the number of connected domains in the...

2002
Mário Q. Aguiar José M. F. Moura

Factorization algorithms are increasingly popular to recover 3D rigid structure from video. In this paper, we analyze the rank 1 factorization algorithm to determine what are the most suitable 3D shapes or the best 3D motions to recover the 3D structure from the 2D trajectories of the features. We show that the shape is best retrieved from orthogonal views aligned with the longest and smallest ...

2012
Hanhuai Shan Jens Kattge Peter B. Reich Arindam Banerjee Franziska Schrodt Markus Reichstein

Plant traits are a key to understanding and predicting the adaptation of ecosystems to environmental changes, which motivates the TRY project aiming at constructing a global database for plant traits and becoming a standard resource for the ecological community. Despite its unprecedented coverage, a large percentage of missing data substantially constrains joint trait analysis. Meanwhile, the t...

2003
Jon Eakins

We discuss the origin of causal set structure and the emergence of classical space and time in the universe. Given that the universe is a closed self-referential quantum automaton with a quantum register consisting of a vast number of elementary quantum subregisters, we find two distinct but intimately related causal sets. One of these is associated with the factorization and entanglement prope...

2008
G Berkolaiko J M Harrison M Novaes

We introduce a bijection between inequivalent minimal factorizations of the n-cycle (1 2 . . . n) into a product of smaller cycles of given length and trees of a certain structure. A factorization has the type α = (α2, α3, · · · ) if it has αj factors of length j. Inequivalent factorizations are defined up to reordering of commuting factors. A factorization is minimal if no factorizations of a ...

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

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