Search results for "complexi"

showing 10 items of 1116 documents

Complexity Selection of the Self-Organizing Map

2002

This paper describes how the complexity of the Self-Organizing Map can be selected using the Minimum Message Length principle. The use of the method in textual data analysis is also demonstrated.

Self-organizing mapComputer scienceSelfWorst-case complexityData miningMinimum description lengthcomputer.software_genrecomputerSelection (genetic algorithm)Minimum message length
researchProduct

Measurement of the semileptonic decaysB¯→Dτ−ν¯τandB¯→D*τ−ν¯τ

2009

We present measurements of the semileptonic decays B{sup -}{yields}D{sup 0}{tau}{sup -}{nu}{sub {tau}}, B{sup -}{yields}D*{sup 0}{tau}{sup -}{nu}{sub {tau}}, B{sup 0}{yields}D{sup +}{tau}{sup -}{nu}{sub {tau}}, and B{sup 0}{yields}D*{sup +}{tau}{sup -}{nu}{sub {tau}}, which are sensitive to non-standard model amplitudes in certain scenarios. The data sample consists of 232x10{sup 6} {upsilon}(4S){yields}BB decays collected with the BABAR detector at the PEP-II e{sup +}e{sup -} collider. We select events with a D or D* meson and a light lepton (l=e or {mu}) recoiling against a fully reconstructed B meson. We perform a fit to the joint distribution of lepton momentum and missing mass squared …

Semileptonic decayPhysicsNuclear and High Energy PhysicsParticle physicsMeson010308 nuclear & particles physicsBranching fractionElectron–positron annihilation01 natural sciencesCrystallographyTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY0103 physical sciencesB meson010306 general physicsLeptonPhysical Review D
researchProduct

Explicit Granger causality in kernel Hilbert spaces

2020

Granger causality (GC) is undoubtedly the most widely used method to infer cause-effect relations from observational time series. Several nonlinear alternatives to GC have been proposed based on kernel methods. We generalize kernel Granger causality by considering the variables cross-relations explicitly in Hilbert spaces. The framework is shown to generalize the linear and kernel GC methods, and comes with tighter bounds of performance based on Rademacher complexity. We successfully evaluate its performance in standard dynamical systems, as well as to identify the arrow of time in coupled R\"ossler systems, and is exploited to disclose the El Ni\~no-Southern Oscillation (ENSO) phenomenon f…

Series (mathematics)Dynamical systems theoryHilbert spaceFOS: Physical sciencesNonlinear Sciences - Chaotic Dynamics01 natural sciences010305 fluids & plasmassymbols.namesakeKernel methodGranger causalityPhysics - Data Analysis Statistics and ProbabilityKernel (statistics)Arrow of time0103 physical sciencesRademacher complexitysymbolsApplied mathematicsChaotic Dynamics (nlin.CD)010306 general physicsData Analysis Statistics and Probability (physics.data-an)Mathematics
researchProduct

Forbidden Factors and Fragment Assembly

2002

In this paper we approach the fragment assembly problem by using the notion of minimal forbidden factors introduced in previous paper. Denoting by M(w) the set of minimal forbidden factors of a word w, we first focus on the evaluation of the size of elements in M(w) and on designing of an algorithm to recover the word w from M(w). Actually we prove that for a word w randomly generated by a memoryless source with identical symbol probabilities, the maximal length m(w) of words in M(w) is logarithmic and that the reconstruction algorithm runs in linear time. These results have an interesting application to the fragment assembly problem, i.e. reconstruct a word w from a given set I of substrin…

Set (abstract data type)CombinatoricsLogarithmFragment (logic)Reconstruction algorithmFocus (optics)AlgorithmTime complexitySubstringWord (computer architecture)Mathematics
researchProduct

The set of conjugacy class sizes of a finite group does not determine its solvability

2014

Abstract We find a pair of groups, one solvable and the other non-solvable, with the same set of conjugacy class sizes.

Set (abstract data type)Discrete mathematicsMathematics::Group TheoryFinite groupTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESTheoryofComputation_COMPUTATIONBYABSTRACTDEVICESAlgebra and Number TheoryConjugacy classTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONMathematicsofComputing_DISCRETEMATHEMATICSMathematicsJournal of Algebra
researchProduct

Reducing Local Alphabet Size in Recognizable Picture Languages

2021

A recognizable picture language is defined as the projection of a local picture language defined by a set of two-by-two tiles, i.e. by a strictly-locally-testable (SLT) language of order 2. The family of recognizable picture languages is also defined, using larger k by k tiles, \(k>2\), by the projection of the corresponding SLT language. A basic measure of the descriptive complexity of a picture language is given by the size of the SLT alphabet using two-by-two tiles, more precisely by the so-called alphabetic ratio of sizes: SLT-alphabet/picture-alphabet. We study how the alphabetic ratio changes moving from two to larger tile sizes, and we obtain the following result: any recognizable pi…

Set (abstract data type)Discrete mathematicsProjection (mathematics)Property (programming)Order (ring theory)AlphabetDescriptive complexity theoryPicture languageMeasure (mathematics)Mathematics
researchProduct

Regression with Imputed Covariates: A Generalized Missing Indicator Approach

2011

A common problem in applied regression analysis is that covariate values may be missing for some observations but imputed values may be available. This situation generates a trade-off between bias and precision: the complete cases are often disarmingly few, but replacing the missing observations with the imputed values to gain precision may lead to bias. In this paper we formalize this trade-off by showing that one can augment the regression model with a set of auxiliary variables so as to obtain, under weak assumptions about the imputations, the same unbiased estimator of the parameters of interest as complete-case analysis. Given this augmented model, the bias-precision trade-off may then…

Set (abstract data type)Reduction (complexity)Relation (database)Bias of an estimatorStatisticsCovariateSettore SECS-P/05 - EconometriaStatistics::MethodologyRegression analysisMissing dataRegressionMathematicsSSRN Electronic Journal
researchProduct

An Introduction to Computational Complexity

2016

This chapter is not strictly about algebra. However, this chapter offers a set of mathematical and computational instruments that will allow us to introduce several concepts in the following chapters. Moreover, the contents of this chapter are related to algebra as they are ancillary concepts that help (and in some cases allow) the understanding of algebra.

Set (abstract data type)symbols.namesakeTheoretical computer scienceComputational complexity theoryComputer scienceAsymptotic computational complexityWorst-case complexitysymbolsComputational problemAlgebra over a fieldComputational resourceHuffman coding
researchProduct

First assessment of the vermetid reefs along the coasts of Favignana Island (Southern Tyrrhenian Sea)

2015

Intertidal vermetid reefs, particularly vulnerable to environmental changes and human activities, are now experiencing high mortality in several areas of the Mediterranean Sea. Since the increase of knowledge on this habitat is important for conservation purposes, we provide a first baseline assessment of the vermetid reefs along the coasts of the Favignana Island (Marine Protected Area “Egadi Islands”). Preliminary results showed the presence of a true reef, similar to a fringing reef, displaying at least three local patterns, distinguishable for width (from 2.3 to 15.5 m), height of the outer and of the inner margin (from 5.6 to 18 cm and from 8.3 to 26 cm, respectively) and number, width…

Settore BIO/07 - EcologiaBioconstructionSettore BIO/02 - Botanica Sistematicahabitat and topographic complexityvermetid reefFavignana Island
researchProduct

RESULTS OF DIFFERENT ANTHROPIC USES ON THE STRUCTURE OF VERMETID REEFS

2014

The biogenic vermetid reef is a key habitat of coastal ecosystems that modifies the shoreline morphology and increases the local biodiversity. Despite its ecological relevance, rarely it is subjected to an accurate management and is often exposed to several human activities. This study aims to distinguish between the effects of different typologies of anthropic uses on the physical structure of the vermetid reef. A comparison between totally protected, partially protected and strongly anthropized reefs has been done and two variables have been analysed: the substratum complexity and the density of reef-building organism. Both the variables show higher values in totally and partially protect…

Settore BIO/07 - EcologiaVermetid reef anthropic uses substratum complexity Mediterranean Sea
researchProduct