Repository UNSAP (Universitas Sebelas April)
Not a member yet
1145 research outputs found
Sort by
Complexity and Approximation Results for the Min Weighted Node Coloring Problem
This chapter contains sections titled: Introduction General results Weighted node coloring in triangle-free planar graphs Weighted node coloring in bipartite graphs Split graphs Cographs Interval graphs BibliographyROS
Search for Resonance-enhanced Cp and Angular Asymmetries in the Λ<sub>c</sub><sup>+</sup> → Pμ<sup>+</sup> Μ<sup>-</sup> Decay at Lhcb
The first measurement of the CP asymmetry of the decay rate (A(CP)) and the CP average (Sigma A(FB)) and CP asymmetry (Delta A(FB)) of the forward-backward asymmetry in the muon system of Lambda(+)(c) -> p mu(+) mu(-) decays is reported. The measurement is performed using a data sample of proton-proton collisions, recorded by the LHCb experiment from 2016 to 2018 at a center-of-mass energy of 13 TeV, which corresponds to an integrated luminosity of 5.4 fb(-1). The asymmetries are measured in two regions of dimuon mass near the.-meson mass peak. The dimuon-mass integrated results are A(CP) = (-1.1 +/- 4.0 +/- 0.5)%, Sigma A(FB) = (3.9 +/- 4.0 +/- 0.6)%, Delta A(FB) = (3.1 +/- 4.0 +/- 0.4)%, where the first uncertainty is statistical and the second systematic. The results are consistent with the conservation of CP symmetry and the Standard Model expectations.LPHE-OSSCI-SB-FBLPHE-LSLPHE-R
Complexes of lanthanoid salts with macrocyclic ligands. Part 3. Complexes of the heavier lanthanoid nitrates with crown ethers
LCS
Extending lifetimes of lanthanide-based NIR emitters (Nd, Yb) in the millisecond range through Cr(III) sensitization in discrete bimetallic edifices
LCS
Sampling and Reconstruction of Signals with Finite Rate of Innovation in the Presence of Noise
Recently, it was shown that it is possible to develop exact sampling schemes for a large class of parametric nonban- dlimited signals, namely certain signals of finite rate of innovation. A common feature of such signals is that they have a finite number of degrees of freedom per unit of time and can be reconstructed from a finite number of uniform samples. In order to prove sam- pling theorems, Vetterli et al. considered the case of deterministic, noiseless signals and developed algebraic methods that lead to per- fect reconstruction. However, when noise is present, many of those schemes can become ill-conditioned. In this paper, we revisit the problem of sampling and reconstruction of signals with finite rate of innovation and propose improved, more robust methods that have better numerical conditioning in the presence of noise and yield more accurate reconstruction. We analyze, in detail, a signal made up of a stream of Diracs and develop algorithmic tools that will be used as a basis in all constructions. While some of the tech- niques have been already encountered in the spectral estimation framework, we further explore preconditioning methods that lead to improved resolution performance in the case when the signal contains closely spaced components. For classes of periodic signals, such as piecewise polynomials and nonuniform splines, we propose novel algebraic approaches that solve the sampling problem in the Laplace domain, after appropriate windowing. Building on the re- sults for periodic signals, we extend our analysis to finite-length sig- nals and develop schemes based on a Gaussian kernel, which avoid the problem of ill-conditioning by proper weighting of the data ma- trix. Our methods use structured linear systems and robust algo- rithmic solutions, which we show through simulation results.LCA
Calibration in Circular Ultrasound Tomography Devices
We consider the position calibration problem in circular tomography devices, where sensors deviate from a perfect circle. We introduce a new method of calibration based on the time-of-flight measurements between sensors when the enclosed medium is homogeneous. Bounds on the reconstruction errors are proven and results of simulations mimicking a scanning device are presented.LTHCLCA