Results 331 to 340 of about 22,856,606 (379)
Some of the next articles are maybe not open access.
Transcription of chromatin: these are complex times
Current Opinion in Genetics & Development, 1998Transcription of chromatin-packaged genes involves highly regulated changes in nucleosomal structure that control DNA accessibility. Two systems that facilitate these changes are ATP-dependent chromatin remodeling complexes and enzymatic complexes which control histone acetylation and deacetylation.
Jennifer A. Armstrong +1 more
openaire +2 more sources
2004
Complexity introduces a measure associated with algorithms described for a computation model. This measure allows us to express that a problem is more difficult than another one and to understand why certain problems are inherently difficult. Two classical measures are introduced: time, which measures the number of elementary steps necessary in an ...
Michel de Rougemont, Richard Lassaigne
openaire +2 more sources
Complexity introduces a measure associated with algorithms described for a computation model. This measure allows us to express that a problem is more difficult than another one and to understand why certain problems are inherently difficult. Two classical measures are introduced: time, which measures the number of elementary steps necessary in an ...
Michel de Rougemont, Richard Lassaigne
openaire +2 more sources
Time, Complexity and the Global
2002This chapter presumes that a new kind of social science ‘paradigm’, that of globalization, is currently being developed and reproduced. I examine some connections between this emergent globalization paradigm and another paradigm, that of complexity. The latter is also emerging as a contending new paradigm for the social sciences, having already been ...
openaire +2 more sources
Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences, 1972
It is shown that the complex recurrent space-times are of Petrov type D or N. The spaces of type D are non-empty and decomposable into the product of two 2-dimensional spaces of arbitrary curvature, the recurrence vector being necessarily real. It is established that the problem of determining the type N complex recurrent spaces is equivalent to that ...
J. Leroy, Raymond G. McLenaghan
openaire +2 more sources
It is shown that the complex recurrent space-times are of Petrov type D or N. The spaces of type D are non-empty and decomposable into the product of two 2-dimensional spaces of arbitrary curvature, the recurrence vector being necessarily real. It is established that the problem of determining the type N complex recurrent spaces is equivalent to that ...
J. Leroy, Raymond G. McLenaghan
openaire +2 more sources
Complexity, information and time
World Futures, 1992Abstract Evolution proceeds in time. Time is experienced as change only, predominantly irreversible change. Measuring change in the form of information growth it is possible to define a measure for the amount of time produced during information increase. Systems creating information contribute to the generation of time. To be able to create information,
openaire +2 more sources
Time Complexity of Recognition
1984A measure of the computational complexity of recognising strings of a language characterised in a particular grammatical formalism. Usually given as the worst-case asymptotic upper bound — that is, one proves how a particular recognition algorithm will perform on arbitrarily long strings of a language whose grammar is the worst possible for the given ...
Lincoln Wallen, Alan Bundy
openaire +2 more sources
Time and Interactions in Complex Systems
Systems Research and Behavioral Science, 1997Summary: Morphodynamics accounts for the evolution and the creation of order in living matter in the model set up by physics to explain order in inert matter. Now, according to physics, ordering is closely bound to passing time. The model thus leads to the definition of a specific time for living matter. Morphodynamics then shows that organisms are apt
openaire +3 more sources
Time series clustering in linear time complexity
Data mining and knowledge discovery, 2021Xiaosheng Li, Jessica Lin, Liang Zhao
semanticscholar +1 more source
Complexity of Categorical Time Series
Sociological Methods & Research, 2010Categorical time series, covering comparable time spans, are often quite different in a number of aspects: the number of distinct states, the number of transitions, and the distribution of durations over states. Each of these aspects contributes to an aggregate property of such series that is called complexity.
openaire +2 more sources
Time complexity and model complexity of fast identification of continuous-time LTI systems
IEEE Transactions on Automatic Control, 1999Summary: The problem of fast identification of continuous-time systems is formulated in the metric complexity theory setting. It is shown that the two key steps to achieving fast identification, i.e., optimal input design and optimal model selection can be carried out independently when the time system belongs to a general a priori set.
George Zames, Le Yi Wang, Lin Lin
openaire +3 more sources