Search results for " complexity."

showing 10 items of 603 documents

Entropic descriptor of a complex behaviour

2009

We propose a new type of entropic descriptor that is able to quantify the statistical complexity (a measure of complex behaviour) by taking simultaneously into account the average departures of a system's entropy S from both its maximum possible value Smax and its minimum possible value Smin. When these two departures are similar to each other, the statistical complexity is maximal. We apply the new concept to the variability, over a range of length scales, of spatial or grey-level pattern arrangements in simple models. The pertinent results confirm the fact that a highly non-trivial, length-scale dependence of the entropic descriptor makes it an adequate complexity-measure, able to disting…

Statistics and ProbabilityCombinatoricsLength scaleStatistical Mechanics (cond-mat.stat-mech)Information complexityFOS: Physical sciencesEntropy (information theory)Statistical physicsStatistical complexityCondensed Matter PhysicsCondensed Matter - Statistical MechanicsMathematicsPhysica A: Statistical Mechanics and its Applications
researchProduct

kmcEx: memory-frugal and retrieval-efficient encoding of counted k-mers.

2018

Abstract Motivation K-mers along with their frequency have served as an elementary building block for error correction, repeat detection, multiple sequence alignment, genome assembly, etc., attracting intensive studies in k-mer counting. However, the output of k-mer counters itself is large; very often, it is too large to fit into main memory, leading to highly narrowed usability. Results We introduce a novel idea of encoding k-mers as well as their frequency, achieving good memory saving and retrieval efficiency. Specifically, we propose a Bloom filter-like data structure to encode counted k-mers by coupled-bit arrays—one for k-mer representation and the other for frequency encoding. Exper…

Statistics and ProbabilitySource codeComputer sciencemedia_common.quotation_subject0206 medical engineeringHash function02 engineering and technologyBiochemistry03 medical and health sciencesEncoding (memory)Molecular BiologyTime complexity030304 developmental biologyBlock (data storage)media_common0303 health sciencesSequence Analysis DNAData structureComputer Science ApplicationsComputational MathematicsComputational Theory and MathematicsError detection and correctionAlgorithmSequence Alignment020602 bioinformaticsAlgorithmsSoftwareBioinformatics (Oxford, England)
researchProduct

Selecting the tuning parameter in penalized Gaussian graphical models

2019

Penalized inference of Gaussian graphical models is a way to assess the conditional independence structure in multivariate problems. In this setting, the conditional independence structure, corresponding to a graph, is related to the choice of the tuning parameter, which determines the model complexity or degrees of freedom. There has been little research on the degrees of freedom for penalized Gaussian graphical models. In this paper, we propose an estimator of the degrees of freedom in $$\ell _1$$ -penalized Gaussian graphical models. Specifically, we derive an estimator inspired by the generalized information criterion and propose to use this estimator as the bias term for two informatio…

Statistics and ProbabilityStatistics::TheoryKullback–Leibler divergenceKullback-Leibler divergenceComputer scienceGaussianInformation Criteria010103 numerical & computational mathematicsModel complexityModel selection01 natural sciencesTheoretical Computer Science010104 statistics & probabilitysymbols.namesakeStatistics::Machine LearningGeneralized information criterionEntropy (information theory)Statistics::MethodologyGraphical model0101 mathematicsPenalized Likelihood Kullback-Leibler Divergence Model Complexity Model Selection Generalized Information Criterion.Model selectionEstimatorStatistics::ComputationComputational Theory and MathematicsConditional independencesymbolsPenalized likelihoodStatistics Probability and UncertaintySettore SECS-S/01 - StatisticaAlgorithmStatistics and Computing
researchProduct

Steady-state and tracking analysis of a robust adaptive filter with low computational cost

2007

This paper analyses a new adaptive algorithm that is robust to impulse noise and has a low computational load [E. Soria, J.D. Martin, A.J. Serrano, J. Calpe, and J. Chambers, A new robust adaptive algorithm with low computacional cost, Electron. Lett. 42 (1) (2006) 60-62]. The algorithm is based on two premises: the use of the cost function often used in independent component analysis and a fuzzy modelling of the hyperbolic tangent function. The steady-state error and tracking capability of the algorithm are analysed using conservation methods [A. Sayed, Fundamentals of Adaptive Filtering, Wiley, New York, 2003], thus verifying the correspondence between theory and experimental results.

Steady stateComputational complexity theoryAdaptive algorithmFunction (mathematics)Tracking (particle physics)Impulse noiseIndependent component analysisAdaptive filterControl and Systems EngineeringControl theorySignal ProcessingComputer Vision and Pattern RecognitionElectrical and Electronic EngineeringSoftwareMathematicsSignal Processing
researchProduct

String Attractors and Infinite Words

2022

The notion of string attractor has been introduced by Kempa and Prezza (STOC 2018) in the context of Data Compression and it represents a set of positions of a finite word in which all of its factors can be “attracted”. The smallest size γ∗ of a string attractor for a finite word is a lower bound for several repetitiveness measures associated with the most common compression schemes, including BWT-based and LZ-based compressors. The combinatorial properties of the measure γ∗ have been studied in [Mantaci et al., TCS 2021]. Very recently, a complexity measure, called string attractor profile function, has been introduced for infinite words, by evaluating γ∗ on each prefix. Such a measure has…

String attractorSettore INF/01 - InformaticaFactor complexityMorphismSturmian wordRecurrent wordRepetitiveness measure
researchProduct

The Neural Basis of Idea Density During Natural Spoken Language

2019

Idea density (ID) evolved as a quantification of propositional base structure. Besides its function as a measure of linguistic complexity, ID has also been used as an index of general linguistic ability. In order to find the neural basis for the processing of high or low ID during spontaneous speech, a sample of healthy adults was assessed using the functional resonance imaging (fMRI) technique; participants described pictures presented to them while in the scanner. Differential patterns of activation were observed for the low- and high-ID conditions, providing new insights into the processing correlates of ID.

Structure (mathematical logic)Linguistic sequence complexityBasis (linear algebra)Computer scienceSpeech recognitionFunction (mathematics)Differential (infinitesimal)Base (topology)Measure (mathematics)Spoken language
researchProduct

A sliding mode approach to robust stabilisation of Markovian jump linear time-delay systems with generally incomplete transition rates

2015

Abstract This paper is devoted to investigating the problem of robust sliding mode control for a class of uncertain Markovian jump linear time-delay systems with generally uncertain transition rates (GUTRs). In this GUTR model, each transition rate can be completely unknown or only its estimate value is known. By making use of linear matrix inequalities technique, sufficient conditions are presented to derive the linear switching surface and guarantee the stochastic stability of sliding mode dynamics. A sliding mode control law is developed to drive the state trajectory of the closed-loop system to the specified linear switching surface in a finite-time interval in spite of the existing unc…

Surface (mathematics)Control and Systems EngineeringControl theoryMode (statistics)TrajectoryInterval (mathematics)State (functional analysis)Transition rate matrixTime complexitySliding mode controlAnalysisComputer Science ApplicationsMathematicsNonlinear Analysis: Hybrid Systems
researchProduct

Surface Activity of Humic Substances Within Peat Profile

2012

Humic substances are able to reduce the surface tension of their solutions and thus can act as surface-active substances in natural environment and possibly also for industrial applications. The ability to influence the surface tension of humic substance solutions depends on their origin. The objective of this study is a comparison of the ability of humic substances from peat profile to influence the surface tension of their solutions and identification of the structural characteristics of peat humic acids, determining their surfactant properties. Humic acids isolated from peat demonstrated significant impact of the surface tension of their solutions – they act as weak surfactants. The surf…

Surface tensionchemistry.chemical_classificationMolecular complexitygeographyPeatgeography.geographical_feature_categoryPulmonary surfactantChemistryEnvironmental chemistryHumic acidcomplex mixturesBogHumus
researchProduct

A multi-methodology and sustainability-supporting framework for implementation and assessment of a holistic building renovation

La ristrutturazione degli edifici in futuro dovrà essere condotta secondo una prospettiva più olistica legata alla sostenibilità vista in una più ampia gamma di obiettivi/criteri e facilitata dagli scenari di ristrutturazione possibili. La ristrutturazione degli edifici dovrebbe servire a migliorarne le performance al fine di soddisfare le esigenze degli utenti, rendendo questi ultimi meno vulnerabili in relazione ai futuri costi energetici. Vi è un grande potenziale per ridurre il consumo di energia negli edifici esistenti. Tuttavia, ciò non deve comprometterè i valori architettonici e di qualità che rendono particolari. Pertanto, non possono essere semplicemente rinnovati, ma devono subir…

Sustainable Renovation Methodology Design MethodologyHolismDecisions ArchitectureSettore ICAR/10 - Architettura TecnicaTectonic Sustainable Building Design (TSBD).ComplexitySystem ArchitectureBuilding Renovation/Retrofitting; Sustainability; Sustainable Renovation Methodology Design Methodology; Multi-methodology; Problem Structuring; Soft Systems Methodology (SSM); Multi Criteria Decision Making (MCDM); Complexity; Holism; Decision Support Systems (DSS); System Architecture; Decisions Architecture; Domain Mapping Matrix (DMM); Dependency Structure Matrix; Tectonics; Tectonic Sustainable Building Design (TSBD).TectonicDomain Mapping Matrix (DMM)Dependency Structure MatrixBuilding Renovation/RetrofittingMulti-methodologySoft Systems Methodology (SSM)Problem StructuringSustainabilityMulti Criteria Decision Making (MCDM)Decision Support Systems (DSS)
researchProduct

Three-dimensional phase unwrapping using the Hungarian algorithm.

2009

We propose a three-dimensional phase unwrapping technique that uses the Hungarian algorithm to join together all the partial residual loops that may occur in a wrapped phase volume. Experimental results have shown that the proposed algorithm is more robust and reliable than other well-known three-dimensional phase unwrapping algorithms. Additionally, the proposed algorithm is fast in terms of computational complexity, which makes it suitable for practical applications.

Synthetic aperture radarComputational complexity theorybusiness.industryComputer scienceResidualPhase unwrappingAtomic and Molecular Physics and OpticsStructured-light 3D scannerOpticsHungarian algorithmbusinessPhase retrievalTelecommunicationsAlgorithmPhase volumeOptics letters
researchProduct