Search results for "FACTORIZATION"
showing 10 items of 221 documents
Application of alternating projection method to ensure feasibility of shadowing cross-correlation models
2007
A novel procedure based on the alternating projection method to adjust experimental shadowing cross-correlation (SCC) matrices is proposed. Given an SCC matrix derived from any experimental model, this procedure finds the nearest diagonalisable correlation matrix. This adjustment allows a proper simulation of shadowing samples, since it produces correlation matrices for which Cholesky factorisation is feasible. Simulation results using this procedure for three different SCC models are compared and discussed.
Production of a tensor glueball in the reaction γγ → G2π0 at large momentum transfer
2018
Abstract We study the production of a tensor glueball in the reaction γ γ → G 2 π 0 . We compute the cross section at higher momentum transfer using the collinear factorisation approach. We find that for a value of the tensor gluon coupling of f g T ∼ 100 MeV, the cross section can be measured in the near future by the Belle II experiment.
gg→HH : Combined uncertainties
2021
In this paper we discuss the combination of the usual renormalization and factorization scale uncertainties of Higgs-pair production via gluon fusion with the novel uncertainties originating from the scheme and scale choice of the virtual top mass. Moreover, we address the uncertainties related to the top-mass definition for different values of the trilinear Higgs coupling and their combination with the other uncertainties.
Ray-Space-Based Multichannel Nonnegative Matrix Factorization for Audio Source Separation
2021
Nonnegative matrix factorization (NMF) has been traditionally considered a promising approach for audio source separation. While standard NMF is only suited for single-channel mixtures, extensions to consider multi-channel data have been also proposed. Among the most popular alternatives, multichannel NMF (MNMF) and further derivations based on constrained spatial covariance models have been successfully employed to separate multi-microphone convolutive mixtures. This letter proposes a MNMF extension by considering a mixture model with Ray-Space-transformed signals, where magnitude data successfully encodes source locations as frequency-independent linear patterns. We show that the MNMF alg…
Characteristic Sturmian words are extremal for the Critical Factorization Theorem
2012
We prove that characteristic Sturmian words are extremal for the Critical Factorization Theorem (CFT) in the following sense. If p x ( n ) denotes the local period of an infinite word x at point n , we prove that x is a characteristic Sturmian word if and only if p x ( n ) is smaller than or equal to n + 1 for all n ≥ 1 and it is equal to n + 1 for infinitely many integers n . This result is extremal with respect to the \{CFT\} since a consequence of the \{CFT\} is that, for any infinite recurrent word x, either the function p x is bounded, and in such a case x is periodic, or p x ( n ) ≥ n + 1 for infinitely many integers n . As a byproduct of the techniques used in the paper we extend a r…
Small-x, Diffraction and Vector Mesons
2015
This talk discusses recent progress in some topics relevant for deep inelastic scattering at small x. We discuss first differences and similarities between conventional collinear factorization and the dipole picture of deep inelastic scattering. Many of the recent theoretical advances at small x are related to taking calculations in the nonlinear saturation regime to next-to-leading order accuracy in the QCD coupling. On the experimental side significant recent progress has been made in exclusive and diffractive processes, in particular in ultraperipheral nucleus-nucleus collisions.
Hard diffraction in photoproduction with Pythia 8
2019
We present a new framework for modeling hard diffractive events in photoproduction, implemented in the general purpose event generator Pythia 8. The model is an extension of the model for hard diffraction with dynamical gap survival in pp and ppbar collisions proposed in 2015, now also allowing for other beam types. It thus relies on several existing ideas: the Ingelman-Schlein approach, the framework for multiparton interactions and the recently developed framework for photoproduction in gamma p, gamma gamma, ep and $e^+e^-$ collisions. The model proposes an explanation for the observed factorization breaking in photoproduced diffractive dijet events at HERA, showing an overall good agreem…
An exact method for graph coloring
2006
International audience; We are interested in the graph coloring problem. We propose an exact method based on a linear-decomposition of the graph. The complexity of this method is exponential according to the linearwidth of the entry graph, but linear according to its number of vertices. We present some experiments performed on literature instances, among which COLOR02 library instances. Our method is useful to solve more quickly than other exact algorithms instances with small linearwidth, such as mug graphs. Moreover, our algorithms are the first to our knowledge to solve the COLOR02 instance 4-Inser_3 with an exact method.
Epichristoffel Words and Minimization of Moore Automata
2014
This paper is focused on the connection between the combinatorics of words and minimization of automata. The three main ingredients are the epichristoffel words, Moore automata and a variant of Hopcroft's algorithm for their minimization. Epichristoffel words defined in [14] generalize some properties of circular sturmian words. Here we prove a factorization property and the existence of the reduction tree, that uniquely identifies the structure of the word. Furthermore, in the paper we investigate the problem of the minimization of Moore automata by defining a variant of Hopcroft's minimization algorithm. The use of this variant makes simpler the computation of the running time and consequ…
Potential approach in marginalizing Gibbs models
1999
Abstract Given an undirected graph G or hypergraph potential H model for a given set of variables V , we introduce two marginalization operators for obtaining the undirected graph G A or hypergraph H A associated with a given subset A ⊂ V such that the marginal distribution of A factorizes according to G A or H A , respectively. Finally, we illustrate the method by its application to some practical examples. With them we show that potential approach allow defining a finer factorization or performing a more precise conditional independence analysis than undirected graph models. Finally, we explain connections with related works.