This paper analyses the shortcoming of the traditional methods in program complexity measure,present a new measure method of the path complexity and the algorithm of computing path complexity measure,an example is given in this paper.
It researches three ways of characteristics extraction of signals including zero-center instantaneous feature, wavelet analysis feature and a feature set consisting of fractal dimension, L-Z complexity degree, entropy and resemblance coefficient.
Combining with the structure of the knowledge base,this paper discusses the problems about the consistency of the knowledge base,puts forward a checking algorithm to check the redundancy and conflict from the conclusion,analyses the complexity degree of the algorithm,and gives an example to illustrate this algorithm.
The quantitative indexes of individuation degree which evaluated synthetically the individualized product through discussing emphatically the quantitative method of open degree, restriction degree, association degree, complexity degree and dependence degree etc. were confirmed, and this provided a reference for the design of the individualized product.
An infinitesimal characterization of the complexity of homogeneous spaces
A characterization of the complexity of a homogeneous space of a reductive groupG is given in terms of the mutual position of the tangent Lie algebra of the stabilizer of a generic point of and the (-1)-eigenspace of a Weyl involution of.
In particular, we prove an integral formula for the degree of an ample divisor on a variety of complexity 1, and apply this formula to computing the degree of a closed 3-dimensional orbit in any SL2-module.
Complexity of Homogeneous Spaces and Growth of Multiplicities
The complexity of a homogeneous space G/H under a reductive group G is by definition the codimension of general orbits in G/H of a Borel subgroup B\subseteq G.
Information and asymptotic estimates of the complexities of formulas are determined.
Technical characteristics of self-contained and mobile receiving and transmitting systems of the complex allow one to use them as building blocks in constructing tomographic systems of various configurations and complexities.
Interpretation of logical connectives as operations on sets of binary strings is considered; the complexity of a set is defined as the minimum of Kolmogorov complexities of its elements.
The XPathLink encapsulates complexities of XLink syntax from the application and provides a higher abstraction level when processing a set of XML documents connected by XLink links compared to the existing approaches.
Hence, the gap between the complexities of directed and bidirected cases is eliminated.