Search results for "Statistics::Theory"

showing 10 items of 56 documents

Measurement of the W boson mass

1996

The W boson mass is measured using proton-proton collision data at root s = 13 TeV corresponding to an integrated luminosity of 1.7fb(-1) recorded during 2016 by the LHCb experiment. With a simultaneous fit of the muon q/p(T) distribution of a sample of W ->mu y decays and the phi* distribution of a sample of Z -> mu mu decays the W boson mass is determined to be

13000 GeV-cmsTevatronparton: distribution functionQC770-798W: leptonic decay7. Clean energy01 natural sciencesLuminosityPhysics Particles & FieldsSubatomär fysikHadron-Hadron scattering (experiments)scattering [p p]Electroweak interactionNuclear Experimentparticle identification [muon]Settore FIS/01PhilosophyPhysicsCoupling (probability)CERN LHC CollHadron colliderPhysical SciencesTransverse masscolliding beams [p p]distribution function [parton]Collider Detector at FermilabParticles and fieldCOLLISIONSp p: scatteringCERN PBARP COLLIDERAstrophysics::High Energy Astrophysical PhenomenaW: mass: measuredStandard ModelNuclear physicsddc:530010306 general physics0206 Quantum PhysicsMuonScience & Technology010308 nuclear & particles physicsWeinberg angleHEPFERMILAB TEVATRONElectroweak interaction Hadron-Hadron scattering (experiments) QCD For- ward physicsCDFp p: colliding beamsPhysics::Instrumentation and DetectorsElectron–positron annihilation= 1.8 TEVGeneral Physics and Astronomy= 1.8 TEV; PBARP COLLISIONS; DECAYVector bosonHigh Energy Physics - ExperimentHigh Energy Physics - Experiment (hep-ex)Computer Science::Systems and ControlSubatomic Physics[PHYS.HEXP]Physics [physics]/High Energy Physics - Experiment [hep-ex]PhysicFermilabBosonPhysics0105 Mathematical PhysicsStatistics::ApplicationsSettore FIS/01 - Fisica Sperimentalestatistical [error]Nuclear & Particles PhysicsCENTRAL TRACKING CHAMBERerror: statisticalCENTRAL ELECTROMAGNETIC CALORIMETERTransverse momentum0202 Atomic Molecular Nuclear Particle and Plasma PhysicsLHCmass: measured [W]Particle Physics - ExperimentStatistics::TheoryParticle physicsNuclear and High Energy Physicselectroweak interaction: precision measurementRegular Article - Experimental PhysicsTRANSVERSE ENERGYFOS: Physical sciencesmuon: particle identification530Particle decayPBARP COLLISIONSNuclear and particle physics. Atomic energy. Radioactivityprecision measurement [electroweak interaction]0103 physical sciencesForward physicVECTOR BOSONElectroweak interaction Hadron-Hadron scattering (experiments) QCD Forward physicsCERN PBARP COLLIDER; CENTRAL ELECTROMAGNETIC CALORIMETER; CENTRAL TRACKING CHAMBER; = 1.8 TEV; PARTON DISTRIBUTIONS; FERMILAB TEVATRON; VECTOR BOSON; TRANSVERSE ENERGY; CDF; COLLISIONShep-exHigh Energy Physics::PhenomenologyLHC-BQCDleptonic decay [W]LHCbPARTON DISTRIBUTIONSMass spectrumForward physicsPhysics::Accelerator PhysicsHigh Energy Physics::ExperimentDECAYHumanitiesexperimental results
researchProduct

Quantum Identification of Boolean Oracles

2004

The oracle identification problem (OIP) is, given a set S of M Boolean oracles out of 2 N ones, to determine which oracle in S is the current black-box oracle. We can exploit the information that candidates of the current oracle is restricted to S. The OIP contains several concrete problems such as the original Grover search and the Bernstein-Vazirani problem. Our interest is in the quantum query complexity, for which we present several upper bounds. They are quite general and mostly optimal: (i) The query complexity of OIP is \(O(\sqrt{N {\rm log} M {\rm log} N}{\rm log log} M)\) for anyS such that M = |S| > N, which is better than the obvious bound N if M \(< 2^{N/log^3 N}\). (ii) It is \…

CombinatoricsStatistics::TheoryLog-log plotTheoryofComputation_GENERALQuantum walkQuantum algorithmComputer Science::Computational ComplexityBoolean functionUpper and lower boundsOracleQuantum computerMathematicsRandom oracle
researchProduct

Upport vector machines for nonlinear kernel ARMA system identification.

2006

Nonlinear system identification based on support vector machines (SVM) has been usually addressed by means of the standard SVM regression (SVR), which can be seen as an implicit nonlinear autoregressive and moving average (ARMA) model in some reproducing kernel Hilbert space (RKHS). The proposal of this letter is twofold. First, the explicit consideration of an ARMA model in an RKHS (SVM-ARMA 2k) is proposed. We show that stating the ARMA equations in an RKHS leads to solving the regularized normal equations in that RKHS, in terms of the autocorrelation and cross correlation of the (nonlinearly) transformed input and output discrete time processes. Second, a general class of SVM-based syste…

Computer Science::Machine LearningStatistics::TheoryComputer Networks and CommunicationsBiomedical signal processingInformation Storage and RetrievalMachine learningcomputer.software_genrePattern Recognition AutomatedStatistics::Machine LearningArtificial IntelligenceApplied mathematicsStatistics::MethodologyAutoregressive–moving-average modelComputer SimulationMathematicsTelecomunicacionesHardware_MEMORYSTRUCTURESSupport vector machinesModels StatisticalNonlinear system identificationbusiness.industryAutocorrelationSystem identificationSignal Processing Computer-AssistedGeneral MedicineComputer Science ApplicationsSupport vector machineNonlinear systemKernelAutoregressive modelNonlinear DynamicsARMA modelling3325 Tecnología de las TelecomunicacionesArtificial intelligenceNeural Networks ComputerbusinesscomputerSoftwareAlgorithmsReproducing kernel Hilbert spaceIEEE transactions on neural networks
researchProduct

Nonlinear GARCH models for highly persistent volatility

2005

In this paper we study new nonlinear GARCH models mainly designed for time series with highly persistent volatility. For such series, conventional GARCH models have often proved unsatisfactory because they tend to exaggerate volatility persistence and exhibit poor forecasting ability. Our main emphasis is on models that are similar to previously introduced smooth transition GARCH models except for the novel feature that a lagged value of conditional variance is used as the transition variable. This choice of the transition variable corresponds to the idea that high persistence in conditional variance is related to relatively infrequent changes in regime. U sing the theory of Markov chains w…

Economics and EconometricsStatistics::TheorySeries (mathematics)Markov chainAutoregressive conditional heteroskedasticity05 social sciences01 natural sciencesVolatility persistenceVariable (computer science)010104 statistics & probabilityNonlinear systemExchange rate0502 economics and businessEconometrics0101 mathematicsVolatility (finance)Conditional variance050205 econometrics Mathematics
researchProduct

B-Spline Estimation in a Survey Sampling Framework

2021

Nonparametric regression models have been used more and more over the last years to model survey data and incorporate efficiently auxiliary information in order to improve the estimation of totals, means or other study parameters such as Gini index or poverty rate. B-spline nonparametric regression has the benefit of being very flexible in modeling nonlinear survey data while keeping many similarities and properties of the classical linear regression. This method proved to be efficient for deriving a unique system of weights which allowed to estimate in an efficient way and simultaneously many study parameters. Applications on real and simulated survey data showed its high efficiency. This …

EstimationStatistics::TheoryComputer scienceConsistency (statistics)B-splineLinear regressionStatisticsStatistics::MethodologySurvey data collectionEstimatorSurvey samplingNonparametric regression
researchProduct

Thresholding projection estimators in functional linear models

2008

We consider the problem of estimating the regression function in functional linear regression models by proposing a new type of projection estimators which combine dimension reduction and thresholding. The introduction of a threshold rule allows to get consistency under broad assumptions as well as minimax rates of convergence under additional regularity hypotheses. We also consider the particular case of Sobolev spaces generated by the trigonometric basis which permits to get easily mean squared error of prediction as well as estimators of the derivatives of the regression function. We prove these estimators are minimax and rates of convergence are given for some particular cases.

FOS: Computer and information sciencesStatistics and ProbabilityMathematical optimizationStatistics::TheoryMean squared error of predictionMean squared errorMathematics - Statistics TheoryStatistics Theory (math.ST)Projection (linear algebra)Methodology (stat.ME)FOS: MathematicsApplied mathematicsStatistics - MethodologyMathematicsLinear inverse problemNumerical AnalysisLinear modelEstimatorRegression analysisMinimaxSobolev spaceThresholdingOptimal rate of convergenceDerivatives estimationRate of convergenceHilbert scaleStatistics Probability and UncertaintyGalerkin methodJournal of Multivariate Analysis
researchProduct

Generalized information criterion for model selection in penalized graphical models

2014

This paper introduces an estimator of the relative directed distance between an estimated model and the true model, based on the Kulback-Leibler divergence and is motivated by the generalized information criterion proposed by Konishi and Kitagawa. This estimator can be used to select model in penalized Gaussian copula graphical models. The use of this estimator is not feasible for high-dimensional cases. However, we derive an efficient way to compute this estimator which is feasible for the latter class of problems. Moreover, this estimator is, generally, appropriate for several penalties such as lasso, adaptive lasso and smoothly clipped absolute deviation penalty. Simulations show that th…

Methodology (stat.ME)FOS: Computer and information sciencesStatistics::TheoryStatistics - Methodology
researchProduct

Hybridization ofsd- andfp-shell proton orbitals in the systemS36+37Cl

1993

Experimental and theoretical evidence is presented that the proton exchange is strongly enhanced by a mixing of single-particle configurations in $^{37}\mathrm{Cl}$ (in the system $^{36}\mathrm{S}$${+}^{37}$Cl, which is shown to be the clearest example of hybridization in nuclear physics. The experimental data on elastic and inelastic transfer are only reproduced if the complete set of single-particle states (${\mathit{d}}_{3/2}$,${\mathit{s}}_{1/2}$,${\mathit{f}}_{7/2}$,${\mathit{p}}_{3/2}$,${\mathit{f}}_{5/2}$, and ${\mathit{p}}_{1/2}$) is included in a coupled-reaction-channel calculation. The strong enhancement is explained by the hybridization of orbits of different parity. In a two-ce…

Nuclear reactionPhysicsBaryonStatistics::TheoryStatistics::ApplicationsProtonBinding energyHadronGeneral Physics and AstronomyElementary particleAtomic physicsNucleonWave functionPhysical Review Letters
researchProduct

Nonlocal Isoperimetric Inequality

2019

For the nonlocal perimeter, there is also an isoperimetric inequality, and here the main hypothesis used on J is that it is radially nonincreasing.

PerimeterStatistics::TheoryMathematics::ProbabilityMathematical analysisMathematics::Metric GeometryMathematics::Differential GeometryComputer Science::Computational GeometryIsoperimetric inequalityMathematics
researchProduct

Shrinkage and spectral filtering of correlation matrices: A comparison via the Kullback-Leibler distance

2007

The problem of filtering information from large correlation matrices is of great importance in many applications. We have recently proposed the use of the Kullback-Leibler distance to measure the performance of filtering algorithms in recovering the underlying correlation matrix when the variables are described by a multivariate Gaussian distribution. Here we use the Kullback-Leibler distance to investigate the performance of filtering methods based on Random Matrix Theory and on the shrinkage technique. We also present some results on the application of the Kullback-Leibler distance to multivariate data which are non Gaussian distributed.

Physics - Physics and SocietyStatistics::TheoryStatistical Finance (q-fin.ST)MathematicsofComputing_NUMERICALANALYSISFOS: Physical sciencesQuantitative Finance - Statistical FinancePhysics and Society (physics.soc-ph)Statistics::ComputationFOS: Economics and businessStatistics::Machine LearningComputingMethodologies_PATTERNRECOGNITIONPhysics - Data Analysis Statistics and ProbabilityStatistics::MethodologyCOVARIANCE-MATRIXData Analysis Statistics and Probability (physics.data-an)
researchProduct