Polysurfacic tori or kideas are three-dimensional objects formed by rotating a regular polygon around a central axis. These toric shapes are referred to as “polysurfacic” because their characteristics, such as the n...Polysurfacic tori or kideas are three-dimensional objects formed by rotating a regular polygon around a central axis. These toric shapes are referred to as “polysurfacic” because their characteristics, such as the number of sides or surfaces separated by edges, can vary in a non-trivial manner depending on the degree of twisting during the revolution. We use the term “Kideas” to specifically denote these polysurfacic tori, and we represent the number of sides (referred to as “facets”) of the original polygon followed by a point, while the number of facets from which the torus is twisted during its revolution is indicated. We then explore the use of concave regular polygons to generate Kideas. We finally give acceleration for the algorithm for calculating the set of prime numbers.展开更多
Let f be a tree map,P(f) the set of periodic points of f and CR(f) the set of chain recurrent points of f. In this paper,the notion of division for invariant closed subsets of a tree map is introduced.It is proved th...Let f be a tree map,P(f) the set of periodic points of f and CR(f) the set of chain recurrent points of f. In this paper,the notion of division for invariant closed subsets of a tree map is introduced.It is proved that: (1) f has zero topological entropy if and only if for any x∈CR(f)-P(f) and each natural number s the orbit of x under f s has a division; (2) If f has zero topological entropy,then for any x∈CR(f)-P(f) the ω-limit set of x is an infinite minimal set.展开更多
The label text is a very important tool for the automatic processing of language. It is used in several applications such as morphological and syntactic text analysis, index-ing, retrieval, finished networks determini...The label text is a very important tool for the automatic processing of language. It is used in several applications such as morphological and syntactic text analysis, index-ing, retrieval, finished networks deterministic (in which all combinations of words that are accepted by the grammar are listed) or by statistical grammars (e.g., an n-gram in which the probabilities of sequences of n words in a specific order are given), etc. In this article, we developed a morphosyntactic labeling system language “Baoule” using hidden Markov models. This will allow us to build a tagged reference corpus and rep-resent major grammatical rules faced “Baoule” language in general. To estimate the parameters of this model, we used a training corpus manually labeled using a set of morpho-syntactic labels. We then proceed to an improvement of the system through the re-estimation procedure parameters of this model.展开更多
文摘Polysurfacic tori or kideas are three-dimensional objects formed by rotating a regular polygon around a central axis. These toric shapes are referred to as “polysurfacic” because their characteristics, such as the number of sides or surfaces separated by edges, can vary in a non-trivial manner depending on the degree of twisting during the revolution. We use the term “Kideas” to specifically denote these polysurfacic tori, and we represent the number of sides (referred to as “facets”) of the original polygon followed by a point, while the number of facets from which the torus is twisted during its revolution is indicated. We then explore the use of concave regular polygons to generate Kideas. We finally give acceleration for the algorithm for calculating the set of prime numbers.
基金the National Natural Science Foundation of China(1 996 1 0 0 1 ) and SF of Guangxi(0 1 3 5 0 2 7)
文摘Let f be a tree map,P(f) the set of periodic points of f and CR(f) the set of chain recurrent points of f. In this paper,the notion of division for invariant closed subsets of a tree map is introduced.It is proved that: (1) f has zero topological entropy if and only if for any x∈CR(f)-P(f) and each natural number s the orbit of x under f s has a division; (2) If f has zero topological entropy,then for any x∈CR(f)-P(f) the ω-limit set of x is an infinite minimal set.
文摘The label text is a very important tool for the automatic processing of language. It is used in several applications such as morphological and syntactic text analysis, index-ing, retrieval, finished networks deterministic (in which all combinations of words that are accepted by the grammar are listed) or by statistical grammars (e.g., an n-gram in which the probabilities of sequences of n words in a specific order are given), etc. In this article, we developed a morphosyntactic labeling system language “Baoule” using hidden Markov models. This will allow us to build a tagged reference corpus and rep-resent major grammatical rules faced “Baoule” language in general. To estimate the parameters of this model, we used a training corpus manually labeled using a set of morpho-syntactic labels. We then proceed to an improvement of the system through the re-estimation procedure parameters of this model.
