Search results for "complexi"
showing 10 items of 1116 documents
Differenza, autonomia, complessità organizzazionale. Dialettica del pensiero complesso in Edgar Morin
2012
"I know that humanity needs politics. That this politics needs anthroposociology. That anthroposociology needs to be linked to the science of nature...". Edgar Morin (1921), the "traveler of complexity", as he himself likes to call himself, proposes to "reorganize our mental system", the "structure of knowledge", precisely starting from the "revelation of the true structure of reality". The philosophical significance of Morin's thought, compared to the scientific approach, can be seen in the fact that it proposes to make the reality of our universe rise to the dignity of ontological principles, concepts elaborated within the gnoseological and epistemological. This research aims to present t…
Nuclear DNA fractions with grossly different base ratios in the genome of the marine sponge Geodia cydonium
2008
The DNA of the marine sponge Geodia cydonium (G.c.), a member of the phylogenetically old phylum Porifera, was characterized by density gradient centrifugation and by determining its genetic complexity by reassociation kinetics. At least five subcomponents were identified by curve-fit analyses of analytical density gradient centrifugation profiles of total G.c.-DNA. Four of these subcomponents were isolated from total G.c.-DNA by preparative density gradient centrifugation. The GC-contents of the subcomponents were determined to be 36.4%, 44.0%, 58.7%, and 66.1%, respectively. To our knowledge, such an extreme heterogeneity of DNA composition has never before been observed for any organism.…
Time multiplexing super-resolved imaging without a priori knowledge of the spatial distribution of the encoding structured illumination
2021
Time multiplexing is a super-resolution technique that sacrifices time to overcome the resolution reduction obtained because of diffraction. There are many super resolution methods based on time multiplexing, but all of them require a priori knowledge of the time changing encoding mask, which is projected on the object and used to encode and decode the high-resolution information. In this paper, we present a time multiplexing technique that does not require the a priori knowledge on the projected encoding mask. First, the theoretical concept of the technique is demonstrated; then, numerical simulations and experimental results are presented.
Mixed valence mono- and hetero-metallic grid catenanes
2015
Multicomponent self-assembly was employed to obtain, in the solid state, a series of mixed valence mono- and hetero-metallic grid catenanes, which were characterized by single crystal X-ray diffraction.
Longest Motifs with a Functionally Equivalent Central Block
2004
International audience; This paper presents a generalization of the notion of longest repeats with a block of k don't care symbols introduced by [Crochemore et al., LATIN 2004] (for k fixed) to longest motifs composed of three parts: a first and last that parameterize match (that is, match via some symbol renaming, initially unknown), and a functionally equivalent central block. Such three-part motifs are called longest block motifs. Different types of functional equivalence, and thus of matching criteria for the central block are considered, which include as a subcase the one treated in [Crochemore et al., LATIN 2004] and extend to the case of regular expressions with no Kleene closure or …
An Efficient Algorithm for the Generation of Z-Convex Polyominoes
2014
We present a characterization of Z-convex polyominoes in terms of pairs of suitable integer vectors. This lets us design an algorithm which generates all Z-convex polyominoes of size n in constant amortized time.
Algorithmic Information Theory and Computational Complexity
2013
We present examples where theorems on complexity of computation are proved using methods in algorithmic information theory. The first example is a non-effective construction of a language for which the size of any deterministic finite automaton exceeds the size of a probabilistic finite automaton with a bounded error exponentially. The second example refers to frequency computation. Frequency computation was introduced by Rose and McNaughton in early sixties and developed by Trakhtenbrot, Kinber, Degtev, Wechsung, Hinrichs and others. A transducer is a finite-state automaton with an input and an output. We consider the possibilities of probabilistic and frequency transducers and prove sever…
Transition Function Complexity of Finite Automata
2011
State complexity of finite automata in some cases gives the same complexity value for automata which intuitively seem to have completely different complexities. In this paper we consider a new measure of descriptional complexity of finite automata -- BC-complexity. Comparison of it with the state complexity is carried out here as well as some interesting minimization properties are discussed. It is shown that minimization of the number of states can lead to a superpolynomial increase of BC-complexity.
On positive P
2002
Continuing a line of research opened up by Grigni and Sipser (1992) and further pursued by Stewart (1994), we show that a wide variety of equivalent characterizations of P still remain equivalent when restricted to be positive. All these restrictions thus define the same class posP, a proper subclass of monP, the class of monotone problems in P. We also exhibit complete problems for posP under very weak reductions.
Incremental termination proofs and the length of derivations
1991
Incremental termination proofs, a concept similar to termination proofs by quasi-commuting orderings, are investigated. In particular, we show how an incremental termination proof for a term rewriting system T can be used to derive upper bounds on the length of derivations in T. A number of examples show that our results can be applied to yield (sharp) low-degree polynomial complexity bounds.