Computer Sciences

T-irreducible extension for unions of complete graphs

Authors: Kurnosova S. G.

T-irreducible extension is one of kinds of optimal extensions of graphs. Constructions of optimal extensions are used in diagnosis of discrete systems and in cryptography. A graph H with n+1 vertices is called an extension of a graph G with n vertices if G can be embedded in every maximal subgraph of H. Any graph Ghas the trivial extension that is the join ng+of G with some outer vertex v. T-irreducible extensions are obtained from the trivial extension by removal of maximal number of edges in such a way that the extension property is preserved.

Construction of All Nonisomorphic Minimal Vertex Extensions of the Graph by the Method of Canonical Representatives

Authors: Abrosimov M. B., Kamil I. A., Lobov A. A.

In 1976 John P. Hayes proposed a graph model for investigating the fault tolerance of discrete systems. The technical system is mapped to a graph. The elements of the system correspond to the vertices of the graph, and links between the elements correspond to edges or arcs of the graph. Failure of a system element refers to the removal of the corresponding vertex from the system graph along with all its edges. Later together with Frank Harary the model was extended to links failures. The formalization of a fault-tolerant system implementation is the extension of the graph.

On Optimization of Reconfiguration Procedure in Multiprocessor Systems

Authors: Grol V. V., Romankevich V. A., Moravej S. M.

Some questions concerned to organization of programming procedure being optimized in accordance with a number of parameters for multiprocessor fault-tolerant system’s components in cosideration with compensation by properly functioned components of possible faults are reviewed in the paper. An algorithm to form a subsets of processor elements is developed and an anayitic expressions allow to reduce the time or hardware spendings in such systems are produced.

Mathematical Models for Evaluation of the Higher Education System Functions with DEA Approach

Authors: Firsova А. A., Chernyshova G. Y.

The purpose of this research is to develop the Data Envelopment Analysis (DEA) methodology for modeling of the assessment of the regional higher education systems effectiveness. The importance and topicality of this study is based on the increasing role of universities in the economic development of regions and countries in recent decades as well as the need to develop approaches for assessing the university effectiveness, and using mathematical models and methods for these goals.

Classification and Recognition of Structures of Genetic Sequences

Authors: Tverdokhlebov V. A., Kariakin D. A.

For solving problems of determining the relationships between the properties of organisms and the properties of the corresponding genetic sequences, we proposed a classification of genetic sequences based on numerical indicators of recurrent and Z-recurrent shapes, which define the structure of functional relationships of elements in sequences. For numerical indicators of recurrent and Z-recurrent shapes, we introduce a method of classification of genetic sequences.

A Method of Protected Distribution of Data Among Unreliable and Untrusted Nodes

Authors: Kosolapov Y. V., Pevnev F. S.

We consider a model of protecting the confidentiality and recoverability of data in a distributed storage system. It is assumed that in- formational blocks are coded into the code blocks. Then the blocks are divided into parts and distributed among repositories of the distributed storage. A modification of the code noising method is con- structed which simultaneously provides computational resistance to coalition attacks on confidentiality of stored data. Moreover, the modification also provides protection from the failure of a part of the storage nodes.

Fuzzy Linear Automata Testing

Authors: Speranskii D. V.

The article deals with the problem of synthesis of tests for fuzzy linear automata (FLA). Now several varieties of FLA are used as models of real fuzzy systems. The article introduces and investigates one particular type of FLA. The fuzziness of the behavior of the automaton is suggested to appear due to the use of elements of a special type in the characteristic matrices. Each such element is a certain set of elements of the field over which the FLA is given.

Administration of Virtual Data Processing Center over OpenFlow

Authors: Solovyev V. M.

This paper researches the building principles and administration of virtual data processing centers based on hyper-converged systems over OpenFlow. We provide the implementation features of such virtual centers on the basis of software-defined networking that is managed by a dedicated controller (a server). We suggest the graph administration model of hyper-converged system resources compliant with required performance on the one hand and economic requirements on the other.

The Use of a Genetic Algorithm in Modeling the Electrophysical Properties of a Layered Nanocomposite

Authors: Kim R. P., Romanchuk S. P., Terin D. V., Korchagin S. A.

The research proposes an approach to solving the problem of selecting layered nanocomposite components with given electrical properties. The known methods for modeling the nanocomposites electrical characteristics are based on a preliminary analysis of such characteristics as the dielectric constant and electrical conductivity of the materials that make up a nanocomposite. The study proposes an algorithm for the selection of components of a layered nanocomposite using a genetic algorithm.

Pages