Abstract: Conceptual modeling of a subject domain, which produces its conceptual model, is an important stage in designing information systems. In recent years, much attention in the development of such systems has been given to reusing information resources and to providing access to them at the semantic level. Methods and technologies of ontological modeling have lately been under intensive development. In this paper, problems and preconditions of conceptual modeling of the subject domain in database technologies and information systems are discussed. Various approaches to conceptual modeling, conceptual modeling languages, and the respective tools are considered, various interpretations of the role of the conceptual model of the subject domain are discussed, and the current state of conceptual modeling tools produced by software industry is assessed. The relationships between the conceptual schemas of the subject domain and ontologies are analyzed and their similarities and differences are described. Terminological issues and the directions of research in the field of conceptual and ontological modeling are considered. An extensive list of references is given.

Abstract: In 1993, E. Codd introduced a concept of an OLAP (online analytical processing) system, which includes 12 rules of representing data for the user. As can be seen from the name, such systems are designed for analyzing data in an interactive mode. Hence, the basic goal of OLAP means is to represent large amount of data in the form convenient for the end-user analysis. Currently, the representation of data in the form of multidimensional cubes is a de facto standard of user work with large amount of data. In this paper, basic concepts of the OLAP systems are introduced and, then, formalized in terms of the lattice theory. In the frame-work of this formalization, the optimality (in terms of the amount of data stored) of the representation of the OLAP cubes by closed lattices or by quotient lattices (which are equivalent to the former) is proved.

Abstract: During the last decade, a new direction of distributed computing--the grid--emerged, which is designed for work with sets of distributed resources. The results obtained, including the development of largescale grid infrastructures, bring us to the discussion of possibility of applying the new technologies to practice. The goal of the paper is to outline a scope of grid capabilities. The discussion relies on the formulation of basic points of the grid concept, principles of integration of spatially distributed resources, and the tasks solved by the grid middleware. Based on this, forms and methods of using grid integration technologies for work with computer, file, information, and other types of resources are described.

Abstract: In the paper, an approach to constructing an extensible framework for the verification of program systems is suggested. In the author's opinion, it will facilitate application of modern rigorous verification methods to practically significant programs, the complexity of which permanently grows. This framework can also become a test harness for testing and adjustment of new techniques of formal verification and static analysis on various industrial software packages.

Abstract: This paper addresses the integration of the PostgreSQL database management system (DBMS) with the Semantic Web. Integration algorithms based on the use of the DBMS capabilities that do not introduce changes in SQL are proposed. An integration based on one of the algorithms supporting main formats of the Semantic Web is presented. The proposed algorithms can be implemented in different DBMSs supporting triggers (or rules), table functions, and indexing.

Abstract: 235 The development of modern enterprise resource planning systems (ERP) is based on the object–ori� ented paradigm. Basic principles of OOP are used to implement both the client and the server (on DBMS server) parts of an application. Supporting an option of storing complex structures (objects in databases) is the main problem in the implementation of the busi� ness logic of the application. The following approaches are usually used for storing objects in the persistent memory:

Abstract: Development of formal programming language specifications is an important problem of theoretical and practical programming. The paper presents operational ontological approach to formal specification of programming languages. It defines formalism for introduction of operational ontological semantics of programming languages: ontological transition systems, description language for ontological transition systems (OTSL), and methodology of applying the OTSL to the development of formal specifications of programming languages.

Abstract: Lattice-based algebraic structures containing semantics of production-logic inference on a type hierarchy in an object-oriented system with an additional relation are introduced. Specific features of these structures, such as closedness, possibility of equivalent transformations, existence of logical reduction, are studied. It is shown how to apply the model developed to verification and optimization of type hierarchies. An important direction of the optimization is automatic elimination of code duplication by "pulling up" common attributes in the type hierarchy. Implementation issues are briefly discussed.

Abstract: The grid project is the next step on the path to the creation of a worldwide artificial mind. For example, the Internet made it possible for people not to care about the place where the information is stored and how it is delivered. The grid allows people not to care about where and which resources are used to execute their programs. The next step will make it possible not to care about what programs are used to perform the desired tasks. It will be sufficient to set a task and programs will find and organize themselves so as to perform it. Even this step will not be the last one. All these features define the process of creating the universal mind from outside, that is, from the viewpoint of users. It is also important to see the internal substance of this process. From the inside, this is the process of creating a global community of programs. In the first decades of software development, the key problem was creating increasingly complicated and clever programs. Beginning in the 1990s, the main problem changed: now, it is to ensure the coexistence and cooperative operation of programs. This is a quite objective process, and it is governed by certain laws of which we mention two. First, the structure of the community of programs and the means of their interaction are largely similar to the structure and means of interaction in human society. Second, the human society becomes increasingly dependent on the community of programs, while the community of programs gradually becomes less dependent on the participation of people in its activity. Some day, the community of programs will become all-sufficient. It is a very important and many-sided question how the relationship between the human society and the community of programs will develop, and we must start studying this problem now. As the first step, I propose to build a model of the future community of programs involving researchers of various specialities. The study of this model will enable us to correctly guide the construction of the community of programs.

Abstract: A simple program for constructing a cellular self-reproducing rectangular loop of arbitrary size is developed based on the parallel substitution algorithm (PSA), which provides a spatial model for representing fine-grained parallel computations. In order to launch the self-reproduction of a loop of some specified size, one should enter its description into the input tape. The program includes operators for preliminary cleaning the cellular array, which makes it possible to easily change its internal functional structure. Two variants of the program are developed. The first variant constructs a chain of self-reproducing loops of the given size, and the second variant constructs an array of such loops.

Abstract: An approach to the problem of complete testing is proposed. Testing is interpreted as the check of an implementation's conformance to the given requirements described by a specification. The completeness means that a test suite finds all the possible implementation errors. In practice, testing must end in a finite amount of time. In the general case, the requirements of completeness and finiteness contradict each other. However, finite complete test suites can be constructed for certain classes of implementations and specifications provided that there are specific test capabilities. Test algorithms are proposed for finite specifications and finite implementations with limited nondeterminism for the case of open-state testing. The complexity of those algorithms is estimated.

Abstract: Problems of estimation of two characteristics of functioning of a web portal--efficiency of information sources and user activity--are considered. To analyze these characteristics, problems of state estimation of dynamic observation systems describing evolution of functioning characteristics are formulated and solved. Mathematical models are introduced and applied to the optimization of operation of an integration component of the web portal. A technique for determining model parameters is discussed.

Abstract: An annual report on meetings of the scientific research seminar on computer algebra is presented.

Abstract: In this paper by means of computer experiment we study advantages and disadvantages of the heuristical method of "parallel integrator". For this purpose we describe and use implementation of the method in Mathematica. In some cases we compare this implementation with the original one in Maple.

Abstract: The paper considers the application of the trace assertion method [1] for specification and verification of automaton programs [2---4]. The trace assertion method allows the programmer to define an externally visible behavior of an automaton program in a rigorous way, without considering details of its implementation. The method is employed at the requirements specification stage of the system development. The paper introduces techniques for defining semantics of some elements of an automaton program, especially those involved in interactions with the control system. A formal approach to defining states of automaton programs is described. Results of studies related to the verification of specification requirements for automaton programs are also presented.

Abstract: The complexity of the verification problem for the behavior (dynamical properties) of systems of interacting intelligent agents is considered. This paper is a continuation of our publications [1–3], in which this problem was mainly considered as applied to deterministic and nondeterministic systems, and largely focuses on asynchronous systems.

Abstract: The implementation of the ParJava development environment is considered that enables one to develop parallel applications in the modern programming language Java within the industrial standard MPI. The internal representation of the SPMD program model is described, which is constructed so as to place as much of the interpretation work of a parallel Java program on JavaVM. Features of the model generation and its preparation to the interpretation are described. The model generator transforms the abstract syntax tree of each method of the program being simulated into a model of the control flow, forms a computation model that will be executed on JavaVM, and forms a module for evaluating the execution times of the basic blocks. The interpretation of the model executed on p nodes of a parallel computing system (cluster) is performed in p logical processes of which each is executed in an individual thread. The interpretation of a logical process assumes that all its methods beginning from the main method are interpreted. The interpretation of each method consists in executing the computation model of this method on JavaVM. The order of interpretation of the method's basic blocks is determined by the system interpreter of the method's model. The system makes it possible to reduce parts of the model and interpret the model by parts. Problems of the simulation and interpretation of communication functions are discussed. The communication functions are described using nine basic exchange operations. To evaluate the time needed to transfer data between processes, an empirical dependence between the amount of the transferred data and the transfer time is used, which is obtained using tests. A short description of the ParJava graphical interface is presented. Applications developed using the proposed implementation of the system are platform independent; and the development, tuning, and maintenance overheads for those applications are considerably reduced. This is a contribution to the development of high-productive parallel applications.

Abstract: This paper describes a program auto-parallelizer that is based on the component approach to constructing optimizing compilers; the parallelizer is included in the technological chain of gcc. Details of using analytical and optimization components for constructing an auto-parallelizer and a parallelization algorithm using the OpenMP library are considered. Finally, we discuss the results of operation of the auto-parallelizer in terms of performance on a subset of problems in the Spec2006 and NAS parallel benchmarks packages.

Abstract: The goal of this work is to analyze various classes of finite and total monomial orderings. The concept of monomial ordering plays the key role in the theory of Grobner bases: every basis is determined by a certain ordering. At the same time, in order to define a Grobner basis, it is not necessary to know ordering of all monomials. Instead, it is sufficient to know only a finite interval of the given ordering. We consider combinatorics of finite monomial orderings and its relationship with cells of a universal Grobner basis. For every considered class of orderings (weakly admissible, convex, and admissible), an algorithm for enumerating finite orderings is discussed and combinatorial integer sequences are obtained. An algorithm for computing all minimal finite orderings for an arbitrary Grobner basis that completely determine this basis is presented. The paper presents also an algorithm for computing an extended universal Grobner basis for an arbitrary zero-dimensional ideal.

Abstract: This paper describes a method of test-suite reduction for regression testing of the interaction between two software modules based on a model of module interaction on a test suite and subsequent filtering of the suite using the constructed model. The interaction model is constructed in terms of sequences of interface functions of the modules being integrated called during the software run.

Abstract: A method, based on the existing UniTESK test, which finds a bug in a system under test, is proposed to construct the minimal test that finds the same bug. This test can be used to localize this bug in the source code of the system. Two strategies for constructing such a test are considered, a comparative analysis of their advantages and disadvantages is performed, and the optimal strategy is proposed. A mathematical justification of the proposed method is given. An algorithm implementing this method is described, and its correctness is proved. An implementation of the proposed method for the CTESK testing tool is described.

Abstract: In this paper, effectiveness of using four criteria in an involutive algorithm based on the Pommaret division for construction of Boolean Grobner bases is studied. One of the results of this study is the observation that the role of the criteria in computations in Boolean rings is much less than that in computations in an ordinary ring of polynomials over the field of integers. Another conclusion of this study is that the efficiency of the second and/or third criteria is higher than that of the two others.

Abstract: An algorithm for video sequence frame rate double up-conversion is described. The algorithm is based on bidirectional motion compensation. The algorithm has no smoothing in the time domain implying the absence of the image sharpness oscillations in the transformed video sequence. A special post-processing step with adaptively controlled degree of smoothing makes it possible to considerably decrease the "blocking" artifact while retaining the maximum number of image details. The absence of complicated mathematical computations allows realtime hardware implementation of the algorithm and real-time video processing.

Abstract: In the paper, combinatorial issues of the factorization of linear ordinary differential operators are studied. It is proved that any finite distributive lattice is that of right divisors of some d'Alembert linear ordinary differential operator with the coefficients belonging to the differential field C(x) of rational functions.

Abstract: The paper is devoted to untyped functional programs, which are defined as systems of equations with separating variables in the untyped ?-calculus [1, 2]. Basic semantics of such programs is usually defined by means of the fixed-point combinator Y. A theorem on semantics invariance with respect to the fixed-point combinator is proved.

Abstract: A technology of the iterative development of parallel programs and the corresponding development tools on the basis of the ParJava environment are considered. A benefit of the ParJava environment is that the the most part of the work can be done on a development computer using a model of the parallel program to be developed. This considerably reduces the the overheads in terms of time and resources used. The proposed technology is illustrated using the development of a parallel program for simulating intense atmospheric vortices as an example.

Abstract: In the paper, the new method Sapsan is described. It is designed for functional testing of parallel programs representing program interface the methods (procedures) of which can be invoked from several threads simultaneously. The Sapsan method makes it possible to verify one of the frequently used requirements to such programs, namely, the interface serializability requirement, which consists in that the result of parallel execution of the interface methods in several threads is equivalent to a certain sequential execution of these methods in the same state. In essence, this requirement is formalization of the widely used thread-safety term.

Abstract: Creation of a content-based image retrieval system implies solving a number of difficult problems, including analysis of low-level image features and construction of feature vectors, multidimensional indexing, design of user interface, and data visualization Quality of a retrieval system depends, first of all, on the feature vectors used, which describe image content The paper presents a survey of common feature extraction and representation techniques and metrics of the corresponding feature spaces Color, texture, and shape features are considered A detailed classification of the currently known features' representations is given Experimental results on efficiency comparison of various methods for representing and comparing image content as applied to the retrieval and classification tasks are presented