Search results for "complexity"
showing 10 items of 1094 documents
Effect of substrate and seagrass habitat complexity on detritus colonization and decomposition in a Mediterranean coastal lagoon (Thau Lagoon, France…
2019
Living and Not-living Matter: Complexity and Self-Organisation in Kauffman
2016
Which is the relation between the living and not-living matter? In this paper I’ll try to give this question an answer and to explore the underlying framework. I think that the theoretical biologist Stuart Kauffman develops an outstanding and interesting approach, which is formulated within the research field of the non-equilibrium chaotic systems dynamics, the theory of complexity and self-organization and the recent debate on the evolution. Therefore, my aim is to show the way in which Kauffman employs the concept of self-organization to build a not reductionist model that may account for the issues concerning the living and not-living matter by integrating physics with biology. In genera…
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.
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 …
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…
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…
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.
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…
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…
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.