Symbolic Dynamics in the Free-Fall Equal-Mass Three-Body Problem

The paper has been presented at the 12th International Conference on Applications of Computer Algebra, Varna, Bulgaria, June, 2006

On Parabolic Subgroups and Hecke Algebras of some Fractal Groups

* The authors thank the “Swiss National Science Foundation” for its support.

The Inflation Index Prognosis Based on the Method of Decision-Marking “Tree”

The description of the support system for marking decision in terms of prognosing the inflation level based on the multifactor dependence represented by the decision – marking “tree” is given in the paper. The interrelation of factors affecting the inflation level – economic, financial, political, socio-demographic ones, is considered. The perspectives for developing the method of decision – marking “tree”, and pointing out the so- called “narrow” spaces and further analysis of possible scenarios for inflation level prognosing in particular, are defined.

Derivation of Context-free Stochastic L-Grammar Rules for Promoter Sequence Modeling Using Support Vector Machine

Formal grammars can used for describing complex repeatable structures such as DNA sequences. In this paper, we describe the structural composition of DNA sequences using a context-free stochastic L-grammar. L-grammars are a special class of parallel grammars that can model the growth of living organisms, e.g. plant development, and model the morphology of a variety of organisms. We believe that parallel grammars also can be used for modeling genetic mechanisms and sequences such as promoters. Promoters are short regulatory DNA sequences located upstream of a gene. Detection of promoters in DNA sequences is important for successful gene prediction. Promoters can be recognized by certain patterns that are conserved within a species, but there are many exceptions which makes the promoter recognition a complex problem. We replace the problem of promoter recognition by induction of context-free stochastic L-grammar rules, which are later used for the structural analysis of promoter sequences. L-grammar rules are derived automatically from the drosophila and vertebrate promoter datasets using a genetic programming technique and their fitness is evaluated using a Support Vector Machine (SVM) classifier. The artificial promoter sequences generated using the derived L- grammar rules are analyzed and compared with natural promoter sequences.

Upgradable Tree Levels Editor of Metaontologies, Ontologies and Knowledge for a Chemistry

* This paper has supported by Far Eastern Branch of the Russian Academy of Sciences, the project 06-III-A-01-005 and Russian Fund of Fundamental Investigation, the project 06-07-89071-a

Digitization and Preservation of City Landmarks Using Limited and Free Web Services

This paper presents a practical approach for digitizing city landmarks based on free and limited Web resources. The digital replicas are then placed on the Web using popular services, like Google earth, and are accessible to a huge user base. The method is easily applicable and quite valuable to organizations with limited funding.

Programming and Testing a Two-Tree Algorithm

ACM Computing Classification System (1998): G.2.2, F.2.2.