Институт проблем информатики Российской Академии наук
Институт проблем информатики Российской Академии наук
Российская Академия наук

Институт проблем информатики Российской Академии наук




«INFORMATICS AND APPLICATIONS»
Scientific journal
Volume 3, Issue 2, 2009

Content | Bibliography | About  Authors

Abstract and Keywords.

A PROBABILISTIC ANALYSIS OF FAULT DETECTION LATENCY IN A NETWORK OF FINITE STATE MACHINES

  • A. V. Pechinkin   IPI RAN. apechinkin@ipiran.ru
  • S. L. Frenkel   IPI RAN. fsergei@mail.ru

Abstract:  This paper suggests an approach to the computation of time probability distribution function (PDF) of Fault Detection Latency (FDL) in case, when a system is modeled as a combination of interacting finite state machines (FSMs) under randominputs, where the interactions deal with switching each of the FSMs froma working mode to a testing one. Fault detection latency is a period of fault detection after it occurs in certain inner states. Traditionally, the FDL of an FSM is modeled as the time (numbers of its state transition steps) to absorption for a Markov chain with the state space generated by a product of fault-free and faulty (i.e., corrupted by a fault) FSMs. The principal problem of using this model for the networks of sub-FSMs is that random transitions of the product of the fault-free and faulty networked automata even under independent inputs randomvectors are not theMarkovian ones. Thanks to an extension of the transition space of the networked FSMs by some additional states corresponding to the number of steps between transitions to the modes mentioned above for each of sub-FSMs, this model is extended to the case of an FSM decomposed (in a designing process) into a number of components of sub-FSMs. A way to compute the FDL PDF in terms of FDL PDF of initial FSM (that is not decomposed) and the FSMs of corresponding sub-FSMs is shown.

Keywords:  testing; Finite State Machine; Markov chains

BACKUP USING SNAPSHOTS

  • V.A. Kozmidiady   IPI RAN. v.kozmidiady@gmail.com

Abstract: Complication of the reserve copying (backup) using differences between two successive snapshots is examined. A formal model in which it is possible exactly to put a problem is offered. An algorithm which solves this problem for almost linear time of the volume of differences is offered.

Keywords: backup; snapshots; file system recovery; journaling file system

REGISTRATION OF DISTORTIONS IN AUTOMATIC FINGERPRINT IDENTIFICATION

  • O. S. Ushmaev   IPI RAN. oushmaev@ipiran.ru

Abstract:  The problem of biometric system adjusting to the variable operational environment is considered. The impact of operational distortion is analyzed with automatic fingerprint identification as an example. The general approach for operation distortion registration is suggested. Based on this approach, the method for adjusting of a biometric system was developed. The author’s experiments showed the effectiveness of the suggested approach.

Keywords: biometrics; automatic fingerprint identification; recognition distortions

APPROXIMATE METHOD OF CALCULATION OF NODE CHARACTERISTICS IN TELECOMMUNICATION NETWORK WITH REPETITIVE TRANSMISSIONS

  • Ya.M. Agalarov   IPI RAN. Ya.M. Agalarov

Abstract:  A model of packet commutation nodewith repetitive transmissions for two schemes of buffermemory distributions— fully accessible and fully shared — is considered. The approximate method of calculation of stream intensity and probabilities of node blocking is proposed. The necessity and sufficiency conditions for existence and unicity of solution of equation were derived for streams in node when operating regime became established, and the convergence of iteration method for solving proposed equation was proved.

Keywords: packet commutation node; buffer memory; repetitive transmissions; probabilities of blocking; iteration method

SOME IMPLEMENTATION ASPECTS OF THE CONNECTING MEDIUM IN THE DECENTRALIZED PACKET SWITCHING ARCHITECTURE

  • V.B. Egorov   IPI RAN. vegorov@ipiran.ru

Abstract:  Specific requirements to the connecting medium in the decentralized packet switching architecture are defined. Some medium implementation aspects are discussed. Special attention is paid to high-speed serial interfaces used as a connecting medium, with a reduced version of such an interface assigned to packet switching being proposed.

Keywords: packet switch; decentralized switching; integrated communications controller; superlocal network; high-speed serial interface

TECHNOLOGICAL SYSTEM FOR AUTOMATIC PROCESSING OF THREE-DIMENSIONAL LIDAR DATA

  • V.A. Sukhomlin   IPI RAN. sukhomlin@mail.ru
  • I.N. Gorkavyi   M. V. Lomonosov Moscow State University, Faculty of Computational Mathematics and Cybernetics. ilya_gor@rambler.ru

Abstract:  New approach to development of software suites for automatic processing of LIDAR data is considered. The elaborated algorithms for classification of three-dimensional (3D) data and generation of high quality models of bare-Earth relief are described, tools for visualization of 3Dmodels and interactive correction ofmodels by operator are presented. The paper discusses goals, achieved results, and perspectives of new approach.

Keywords: automatic data processing; classification methods; three-dimensional models; LIDAR; laser scanning

SEMIOTIC MODEL FOR COMPUTER CODING CONCEPTS AND INFORMATION OBJECTS

  • I.M. Zatsman   IPI RAN. iz_ipi@a170.ipi.ac.ru

Abstract:  he semiotic model, which has been developed during research of problems of generation and evolution of goal-oriented knowledge systems in digital libraries and other kinds of information systems, is considered. These problems concern to the new direction of the researches which has been named “Cognitive Informatics.” The semioticmodel suggested is intended for the description of computer coding concepts and information objects. This model is positioned as theoretical foundations for development ofmethods of the three-component coding denotata, concepts, and information objects, including construction of one-to-one correspondence between concepts of goal-oriented knowledge systems and computer codes.

Keywords: semiotic model; goal-oriented knowledge systems; denotata; concepts; information objects; computer codes; three-component coding; one-to-one correspondence between concepts and computer codes