Search results for "Complexity"
showing 10 items of 1094 documents
Angular analysis of charged and neutral B → Kμ + μ − decays
2014
The angular distributions of the rare decays B → K+µ+µ- and B0 → K0 <inf>a</inf>Sμ+μ- are studied with data corresponding to 3 fb-1 of integrated luminosity, collected in proton-proton collisions at 7 and 8TeV centre-of-mass energies with the LHCb detector. The angular distribution is described by two parameters, FH and the forward-backward asymmetry of the dimuon system AFB, which are determined in bins of the dimuon mass squared. The parameter F<inf>H</inf> is a measure of the contribution from (pseudo)scalar and tensor amplitudes to the decay width. The measurements of A<inf>FB</inf> and F<inf>H</inf> reported here are the most precise to d…
Measurement of CP asymmetry in Bs0 → Ds ∓K± decays
2014
Journal of high energy physics 2018(3), 59 (2018). doi:10.1007/JHEP03(2018)059
Observation of an Excited $B^{\pm}_c$ Meson State with the ATLAS Detector
2014
A search for excited states of the B±c meson is performed using 4.9 fb-1 of 7 TeV and 19.2 fb-1 of 8 TeV pp collision data collected by the ATLAS experiment at the LHC. A new state is observed through its hadronic transition to the ground state, with the latter detected in the decay B±c→J/ψπ±. The state appears in the m(Bc±π+π-)-m(Bc±)-2m(π±) mass difference distribution with a significance of 5.2 standard deviations. The mass of the observed state is 6842±4±5 MeV, where the first error is statistical and the second is systematic. The mass and decay of this state are consistent with expectations for the second S-wave state of the B±c meson, B±c(2S).
Dynamic Gaussian Graphical Models for Modelling Genomic Networks
2014
After sequencing the entire DNA for various organisms, the challenge has become understanding the functional interrelatedness of the genome. Only by understanding the pathways for various complex diseases can we begin to make sense of any type of treatment. Unfortunately, decyphering the genomic network structure is an enormous task. Even with a small number of genes the number of possible networks is very large. This problem becomes even more difficult, when we consider dynamical networks. We consider the problem of estimating a sparse dynamic Gaussian graphical model with \(L_1\) penalized maximum likelihood of structured precision matrix. The structure can consist of specific time dynami…
Matching beer with food : pairing principles, underlying mechanisms and a focus on aromatic similarity
2018
Pairing between beer and dishes emerges as a new trend in France. Beer promoters or gastronomy professionals need to offer high-quality advices in terms of beer and food pairing to their customers. Within this context, the objective of the research was to identify pairing principles and to better understand the underlying perceptual mechanisms. Determinants of food and beverage pairing were first analysed from experts’ discourses. Results showed that food and beverage pairings are governed by perceptual, conceptual and affective features, related to physio-chemical, perceptual and cognitive processes. Experts often mentioned “Aromatic Similarity” as one of the main pairing principles. This …
Visual category representations in the infant brain
2021
SUMMARYVisual categorization is a human core cognitive capacity1,2that depends on the development of visual category representations in the infant brain3–7. However, the exact nature of infant visual category representations and their relationship to the corresponding adult form remains unknown8. Our results clarify the nature of visual category representations from electroencephalography (EEG) data in 6- to 8-month-old infants and their developmental trajectory towards adult maturity in the key characteristics of temporal dynamics2,9, representational format10–12, and spectral properties13,14. Temporal dynamics change from slowly emerging, developing representations in infants to quickly e…
Fast Algorithms for Pseudoarboricity
2015
The densest subgraph problem, which asks for a subgraph with the maximum edges-to-vertices ratio d∗, is solvable in polynomial time. We discuss algorithms for this problem and the computation of a graph orientation with the lowest maximum indegree, which is equal to ⌈d∗⌉. This value also equals the pseudoarboricity of the graph. We show that it can be computed in O(|E| √ log log d∗) time, and that better estimates can be given for graph classes where d∗ satisfies certain asymptotic bounds. These runtimes are achieved by accelerating a binary search with an approximation scheme, and a runtime analysis of Dinitz’s algorithm on flow networks where all arcs, except the source and sink arcs, hav…
Optimal standalone data center renewable power supply using an offline optimization approach
2022
Abstract Because of the increasing energy consumption of data centers and their C O 2 emissions, the ANR DATAZERO2 project aims to design autonomous data centers running solely on local renewable energy coupled with storage devices to overcome the intermittency issue. In order to optimize the use of renewable energy and storage devices, a MILP solver is usually in charge of assigning the power to be supplied to the data center. However, in order to reduce the computation time and make the approach scalable, it would be more appropriate to use a polynomial time algorithm. This paper aims at showing and proving that it is possible to provide an optimal power profile via a deterministic algori…
Efficient lower and upper bounds of the diagonal-flip distance between triangulations
2006
There remains today an open problem whether the rotation distance between binary trees or equivalently the diagonal-flip distance between triangulations can be computed in polynomial time. We present an efficient algorithm for computing lower and upper bounds of this distance between a pair of triangulations.
An efficient upper bound of the rotation distance of binary trees
2000
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons triangulations. Ordinal tools are used.