Computer Sciences

Conditions for Functions on Semilattices to be Realized by Networks with Stable Behaviour under Hazards

The notion of functional stability under hazards is introduced for networks realizing functions defined on finite upper semilattices. Some constructive conditions are established for such functions to be realized by stable networks composed of any elements or of transistors and switches.

About One Approach to the Reconstruction of Behavior of Finite Automaton with Circularity of the Change of States

The article deals with one of the possible approaches to the problem of reconstruction of determined finite automaton behavior, based on the information about the current (defective) and specified (correct) laws of functioning with the help of periodic sequences. A model of finite automaton circularity was built for the purpose of analyzing the behavior of a finite automaton in a circularity mode.

The Using of gLite Middleware for Organization of Distributed Data Storage

This paper gives an introduction to using the grid technology for distributed data storage. There are many different technologies of grid systems deployment for geographically distributed data storages and distributed computation purposes. One of these technologies, gLite middleware is described in this paper. The architecture, the functioning, and the main gLite services are presented here.

The Automata Interpretation of Integer Sequences

Transformation of phase pictures to geometrical images of laws of functioning of state machines, offered and developed by V.A.Tverdokhlebov , has allowed to represent phase pictures by uniform mathematical structures –- broken lines with numerical coordinates of points. V.A.Tverdokhlebov shows, that sequence of elements from the finite set, combined with linear order on set of input words, defines laws of functioning of the discrete determined dynamic system (state machine).

About Realisation of Finite-Element Modeling in Problems of an Osteosynthesis on Cluster Systems of SSU

In this article we describe the optimized cluster version of a package of finite-element modeling. This project titled «Development of Computational and information technologies using computer modeling on parallel computing complexes for traumatological and surgical evaluations to enable efficient diagnostic and medical recommendations».

Technology of Building Femur Bones Solid Models Based on Data from Computerized Axial Tomography

In this article we describe the technology used to build femur bone 3D models based on Computerized Axial Tomography data. This project is titled «Development of Computational and information technologies using computer modeling on parallel computing complexes for traumatological and surgical evaluations to enable efficient diagnostic and medical recommendations».

On Directed Acyclic Exact Extensions

Exact extensions of undirected graphs are well studied, but exact extensions of directed graphs are much less known.We prove that only directe dacyclicgraphor strongly connected graph can be an exact extension. Further more, only transitive tournament can be directed acyclic exact extension.

Construction of Hierarchies in Multidimensional Data Models

This article considers a method of automated determination of hierarchies in dimensions of multidimensional data model, constructed from the source relational database. Construction of hierarchies is realized on the basis of attribute dependencies of source database.

DDoS Attack Detection Using Fuzzy Neural Network

In this article we analyze SYN Flood type of DDoS attack. We suggest method to detect this attack using a fuzzy neural network. Also we introduce modified back-propagation algorithm for neural network teaching.

About Reconstruction of Small Tournaments

A tournament of order n is a complete graph of n nodes with each arc assigned a unique direction. The reconstruction conjecture in graph theory says that graphs are determined uniquely by their subgraphs. This conjecture was proved to be false when P. K. Stockmeyer discovered several infinite families of counterexample pairs of digraphs (including tournaments). In this paper we observe known results about reconstruction of tournaments and present our approach to study reconstruction of all tournaments with up to 12 vertexes.

Pages