Abstract: The article presents new monograph dedicated to the researching of physical phenomenon of statistical stability and exposure of basics of physical-mathematical theory of hyper-random phenomena, the latter describing physical events, variables and processes with consideration of violation of statistical stability. In contrast to two previous author’s monograph devoted to the same subject in which the main attention was paid to the mathematical aspects of the theory of hyper-random phenomena, in the new book the accent is made on physical headwords. The book is oriented on scientists, engineers, and post-graduate students researching in statistical laws of natural physical phenomena as well as developing and using statistical methods for highprecision measuring, prediction and signal processing on long observation intervals. It may also be useful for high-level courses for university students majoring in physical, engineering, and mathematical fields.

Keywords: phenomenon of statistical stability, theory of hyper-random phenomena, physical process, violation of convergence.

ACM Classification Keywords: G.3 Probability and Statistics

Link:

PHYSICAL PHENOMENON OF STATISTICAL STABILITY

Igor Gorban

http://www.foibg.com/ijita/vol21/ijita21-04-p08.pdf

Abstract: Let P(x) = x n + an−1x n−1 + · · · + a1x + a0 be an irreducible polynomial over Fq. In Cao, 2012, Varshamov, 1973, Lidl, 1987 the factorization of the composite polynomial P(x p − ax − δ), when a = 1 and T rFq/Fp (nb − an−1) = 0 is considered. The result of factorization of polynomial P(x p − x − δ) is a p irreducible polynomials of degree n over Fq. In this paper we propose an algorithm for factoring composite polynomial P(x p − x − δ) over Fq and give a explicit view of each factor.

Keywords: finite field, polynomial factorization, polynomial composition

ACM Classification Keywords: I.1.2. Algorithms

Link:

AN ALGORITHM FOR FACTORING COMPOSITE POLYNOMIAL P(x p − x − δ)

Sergey Abrahamyan, Knarik Kyuregyan

http://www.foibg.com/ijita/vol21/ijita21-04-p07.pdf

Abstract: The main features of WordArM? system for storing dictionaries and thesauruses by means of Natural Language Addressing are outlined in the paper. Experiments with WordArM? have shown that the NL-addressing is suitable for dynamic processes of creating and further development of datasets due to avoiding recompilation of the database index structures and high speed access to every data element.

Keywords: Natural Language Addressing

ACM Classification Keywords: H.2 Database Management; H.2.8 Database Applications

Link:

WORDARM - A SYSTEM FOR STORING DICTIONARIES AND THESAURUSES BY NATURAL LANGUAGE ADDRESSING

Krassimira Ivanova

http://www.foibg.com/ijita/vol21/ijita21-04-p06.pdf

Abstract: This paper contains analysis of creation of sets and multisets as an approach for modeling of some aspects of human thinking. The creation of sets is considered within constructive object-oriented version of set theory (COOST), from different sides, in particular classical set theory, object-oriented programming (OOP) and development of intelligent information systems (IIS). The main feature of COOST in contrast to other versions of set theory is an opportunity to describe essences of objects more precisely, using their properties and methods, which can be applied to them. That is why this version of set theory is object-oriented and close to OOP. Within COOST, the author proposes universal constructor of multisets of objects that gives us a possibility to create arbitrary multisets of objects. In addition, a few determined constructors of multisets of objects, which allow creating multisets, using strictly defined schemas, also are proposed in the paper. Such constructors are very useful in cases of very big cardinalities of multisets, because they give us an opportunity to calculate a multiplicity of each object and cardinality of multiset before its creation. The proposed constructors of multisets of objects allow us to model in a sense corresponding processes of human thought, that in turn give us an opportunity to develop IIS, using these tools.

Keywords: constructive object-oriented set theory, class of objects, homogeneous class of objects, inhomogeneous class of objects, set of objects, multiset of objects.

ACM Classification Keywords: I.2.0 General – Cognitive simulation, F.4.1 Mathematical Logic – Set theory, D.1.5 Object-oriented Programming, D.3.3 Language Constructs and Features – Abstract data types, Classes and objects, Data types and structures, E.2 Data Storage Representations – Object representation.

Link:

UNIVERSAL AND DETERMINED CONSTRUCTORS OF MULTISETS OF OBJECTS

Dmytro Terletskyi

http://www.foibg.com/ijita/vol21/ijita21-04-p05.pdf

Abstract: MICRORAM is a simulation model in which a colony of bacteria evolves inside an artificial world. The model has the flavor of the classical models of the decades of the 80s and 90s in which artificial life was inspired by microbiology. We show how a population of ‘bacterial’ agents is able to adapt to environmental changes and survive to the attack from an external agent simulated with an ‘antibiotic’. The conclusion is that many ideas from the 80s and 90s are still valid, and it is possible to design and simulate agents inspired by natural ‘bacterial colonies’, with potential applications in bacterial and natural computing.

Keywords: artificial life worlds, agent based modeling, bacterial genetic algorithm, conjugation operator.

ACM Classification Keywords: I.6 Simulation and Modeling

Link:

MICRORAM: A SIMULATION MODEL OF A COLONY OF BACTERIA EVOLVING INSIDE AN ARTIFICIAL WORLD

Daniel Thai Dam, Rafael Lahoz-Beltra?

http://www.foibg.com/ijita/vol21/ijita21-04-p04.pdf

Abstract: One of the biggest challenges that software developers face is to make an accurate estimate of the project effort. Radial basis function neural networks have been used to software effort estimation in this work using NASA dataset. This paper evaluates and compares radial basis function versus a regression model. The results show that radial basis function neural network have obtained less Mean Square Error than the regression method.

Keywords: software effort estimation, software repositories, radial basis function and artificial neural networks.

ACM Classification Keywords: I.2.6 Artificial Intelligence – Connectionism and neural nets, H.2.7 Database Administration – Data Ware house and repository.

Link:

SOFTWARE EFFORT ESTIMATION USING RADIAL BASIS FUNCTION NEURAL NETWORKS

Ana Maria Bautista, Angel Castellanos, Tomas San Feliu

http://www.foibg.com/ijita/vol21/ijita21-04-p03.pdf

Abstract: It is shown, that any multicriteria problem can be represented by a hierarchical system of criteria. Individual properties of the object (alternative) are evaluated at the bottom level of the system, using a criteria vector; and a composition mechanism is used to evaluate the object as a whole at the top level. The problem is solved by the method of nested scalar convolutions of vector-valued criteria. The methodology of the problem solving is based on the complementarity principle by N. Bohr and the theorem of incompleteness by K. Gödel.

Keywords: hierarchical structure, nested scalar convolutions, multicriteria approach, decomposition; composition

Link:

A HIERARCHICAL APPROACH TO MULTICRITERIA PROBLEMS

Albert Voronin, Yuriy Ziatdinov, Igor Varlamov

http://www.foibg.com/ijita/vol21/ijita21-04-p02.pdf

Abstract: The optimization problem of functioning of the producing similar products enterprise is considered. For its solution proposed multiagent technology, the use of which will make informed decisions about the expansion of production, reduction, and so branching. Models of the enterprise functioning in a competitive environment are constructed.

Keywords: enterprise, interaction, models, multiagent technology.

ACM Classification Keywords: I.2.11 Distributed Artificial Intelligence – Multiagent Systems.

Link:

INTELLECTUAL INFORMATION SUPPORT OF BRANCH ENTERPRISE EXECUTIVES’ DECISION MAKING PROCESSES

Aleksey Voloshyn, Bogdan Mysnyk, Vitaliy Snytyuk

http://www.foibg.com/ijita/vol21/ijita21-04-p01.pdf

Аннотация. Описываются средства структуризации информационных массивов на основе использования растущих пирамидальных сетей. Приводятся примеры обработки информации на сайте ОСТРОВ ЗНАНИЙ.

Ключевые слова: структуризация естественно-языкового текста, представление и обработка знаний.

ACM Classification Keywords: I.2 ARTIFICIAL INTELLIGENCE - I.2.4 Knowledge Representation Formalisms and Methods, K.3 COMPUTERS AND EDUCATION - K.3.1 Computer Uses in Education

Link:

МЕТОДИКА ИСПОЛЬЗОВАНИЯ СРЕДСТВ СТРУКТУРИЗАЦИИ УЧЕБНОГО МАТЕРИАЛА

Сулима Е.Н., Миленин В.М

http://www.foibg.com/ijita/vol17/ijita17-4-p09.pdf

Abstract: It is difficult to exaggerate the importance, the urgency and complexity of “good” classifications creation, especially in knowledge management, artificial intelligence, decision making. To what extend it is possible within a short paper, the peculiarities and advantages of the new system method of the systemological classification analysis for the classifications of concepts creation were discussed. It is noted that the applying of the natural classification criteria improves considerably the quality and the power of the classification knowledge models and ontologies, allows taking into account the deep knowledge of any, including ill-structured, domains. In the process of the research conduction the system models of the domain fragment of the ontologies on the basis of the parametric classification were created. Some results of the actual domain “Social Networks in Internet” analysis and modelling and the ontology fragments, realized in the ontologies engineering tool Protégé 3.2, are also considered. The systemological classification analysis application has allowed proving the obtained classifications of social networks functions, taking into account the objects essential properties. It has also successfully recommended itself for deep knowledge acquisition; the basic hierarchy of classes, “good” classifications and ontologies creation; possesses predictive power, simple logically relevant structure, ensures the possibility of the correct inference on knowledge.

Keywords: conceptual knowledge, knowledge systematization, natural classification, ontology, systemological classification analysis, social network, hierarchy, systemology, artificial intelligence.

ACM Classification Keywords: 1.2 Artificial Intelligence – 1.2.6 Learning: Knowledge Acquisition

Link:

CONCEPTUAL KNOWLEDGE MODELING ON THE BASIS OF NATURAL CLASSIFICATION

Mikhail Bondarenko, Kateryna Solovyova, Andrey Danilov

http://www.foibg.com/ijita/vol17/ijita17-4-p08.pdf

Abstract: The paper describes interactive environment for creating and using in learning multimedia presentations of compound visual structure with linking arrows due to zooming user interface. Therefore the environment can be viewed as hypermedia one. The article contains the analyses of appliance well established principles of modern instructional theories as well as hypotheses in application hypermedia in learning.

Keywords: cognitive load theory, cognitive theory of multimedia learning, zooming user interface, hypermedia.

ACM Classification Keywords: K.3.1 Computer Uses in Education

Link:

ZOOMING USER INTERFACE IN PRESENTATIONS FOR LEARNING

Artem Pecheny

http://www.foibg.com/ijita/vol17/ijita17-4-p07.pdf

Abstract: This paper considers the experimental research of measuring interconnections between the basic concepts, acquired during completion of a course in Computer Architecture. A special computer technique for estimating of students’ knowledge entirety was developed and successfully tested. An original mode of experimental data visualization is proposed. Several pedagogical regularities were revealed by assessing how students digested the main concepts of the course.

Keywords: entirety, concept, knowledge structure, education, course.

ACM Classification Keywords: K.3.1 Computer Uses in Education; I.2.6 Learning – Knowledge acquisition.

Link:

A COMPUTER METHOD TO STUDY THE ENTIRETY OF STUDENTS’ KNOWLEDGE ACQUIRED DURING AN EDUCATIONAL COURSE

Evgeny A. Eremin

http://www.foibg.com/ijita/vol17/ijita17-4-p06.pdf

Abstract: Application of 2-level 2-D Haar Discrete Wavelet Transform of images with special words repeated by hand is offered. Metric of similarity for images with pattern words and images with students' written words like analog of proposed patterns is considered. A new approach to objective assessment of educability like dependence on level of graphic skills of process of writing is offered. Experiment is revealed the presence of statistic significant correlation between average score in special academic subjects group or in other words between special educability and level of graphic writing skills automation for high school students.

Keywords: educability, process of writing, 2-D discrete wavelet transform, image similarity

ACM Classification Keywords: I.5 PATTERN RECOGNITION and K.3.2 COMPUTER AND INFORMATION SCIENCE EDUCATION

Link:

WAVELET TRANSFORM IN INVESTIGATIONS OF STUDENTS EDUCABILITY DEPENDENTLY ON DEGREE OF GRAPHICAL SKILLS AUTOMATION OF WRITING PROCESS

Olga Kozina, Nataliya Bilous, Mykola Zapolovskij, Vladimir Panchenko

http://www.foibg.com/ijita/vol17/ijita17-4-p05.pdf

Abstract: The article presents a description of alleged approaches to the implementation of data processing subsystem on Internet portal. Main problems are connected with exponential growth in number of documents, lack of semantic indexing and unstructured nature of information. In proposed approach, user receives an effective intelligent means of finding electronic documents on the basis of semantic indexing, automatic classification and cataloging of documents with construction of semantic links between them and automatic summarization of documents with the use of knowledge. The proposal is to increase the effectiveness of working with electronic documents with the help of intelligent analysis, for which agent-based and ontological approaches are used. In accordance with the proposed approach, ontology is used to describe data semantics of the document and its structure. Ontology is a central concept in process of document analysis. Through the use of ontologies the required data can be obtained; we know where to find information and how it can be interpreted. Ontology Repository contains three levels of ontologies. At the first level there are ontologies describing objects which are used in a particular system and which take into account system features. At the second level there are objects described in terms of the first level that are invariant to the domain. Objects of the third level describe the most general concepts and axioms, by which the lower levels objects are described. The third and second levels can be divided into two parts: a description of structures and description of the documents themselves.

Keywords: ontology, agent, multi-agent systems, intelligent search, semantic indexing, document analysis, adaptive information systems, CASE-technology.

ACM Classification Keywords: H.2. Database Management: H.2.3. Languages – Report writers; H.3.3. Information Search and Retrieval – Query formulation.

Link:

SYSTEM OF INTELLIGENT SEARCH, CLASSIFICATION AND DOCUMENT SUMMARISATION FOR INTERNET PORTAL

Vyacheslav Lanin, Dmitriy Tsydvintsev

http://www.foibg.com/ijita/vol17/ijita17-4-p04.pdf

Abstract: In this paper we consider the problem of characterizing permutation polynomials of the shape over the field ; that is, we seek conditions on the coefficients of a polynomial which are necessary for it to represent a permutation.

Keywords: finite field, permutation polynomial, linear translator.

Link:

A METHOD OF CONSTRUCTING PERMUTATION POLYNOMIALS OVER FINITE FIELDS

Melsik Kyureghyan, Sergey Abrahamyan

http://www.foibg.com/ijita/vol17/ijita17-4-p03.pdf

Abstract: The paper discusses stability concepts and methods of stability investigation in models describing the climate-biosphere interaction for a hypothetical zero-dimensional model. The climate-biosphere model proposed by Svirezhev-& von Bloh, 1997, exhibited interesting features concerning the stability and sensitivity to perturbations of the global system. The work is focused on the determination of transition times between the equilibriums due to random perturbations. In investigate bifurcations in the model to describe complex behavior in the model with multiple equilibriums. Global vegetation pattern dynamics strongly depends on production and hence evolutionary models must explicitly use this concept. We have shown analytically that GVP dynamics could demonstrate complex behavior with multiple equilibria, chaotic dynamics associated with them as well as transition zones between consequent states.

Keywords: global vegetation pattern, modeling

ACM Classification Keywords J.2 PHYSICAL SCIENCES AND ENGINEERING, G.1.7 Ordinary Differential Equations: Chaotic systems

Link:

PREDICTIVE MODELING OF SPATIAL REDISTRIBUTION IN DYNAMICAL MODELS OF GLOBAL VEGETATION PATTERNS UNDER CLIMATE CHANGE

Nelli Ajabyan

http://www.foibg.com/ijita/vol17/ijita17-4-p02.pdf

Abstract: In this paper, a novel method for image orientation angle determination is proposed. The method is based on the use of parameters of scattering ellipse of an image gradient field. Various problems with application of the proposed technique are considered. The results of the experiments for determining the predominant direction of an image are presented. Three methods of image orientation angle (OA) estimation are compared. It is shown that the method based on scattering ellipse technique is more precise than the histogram-based methods. The term of the "backlash" of image rotation algorithms is submitted and a method for “backlash” estimation is proposed. The “backlash” can be used for determination of the quality of arbitrary rotation algorithm. It is also shown that the proposed technique can be applied to the problems related to the Horizon line tracking.

Keywords: Image registration, orientation angle, directionality, regularity, gradient, rotation, scattering ellipse.

ACM Classification Keywords: Image Processing and Computer Vision

Link:

ORIENTATION ESTIMATION WITH APPLICATIONS TO IMAGE ANALYSIS AND REGISTRATION

David Asatryan, Karen Egiazarian, Vardan Kurkchiyan

http://www.foibg.com/ijita/vol17/ijita17-4-p01.pdf

Abstract: In this paper the proof complexities of some classes of quasi-hard determinable (Tsgf n ) and hard determinable (ψ n ) formulas are investigated in some refutation propositional systems. It is proved that 1) the number of proof steps of Tsgf n in R(lin) (Resolution over linear equations) and GCNF'+ permutation (cutfree Gentzen type with permutation) systems are bounded by p( 2 Tsgf n log ) for some polynomial p(), 2) the formulas ψ n require exponential size proofs in GCNF'+ permutation. It is also shown that Frege systems polynomially simulate GCNF'+ permutation and any Frege system has exponential speed-up over the GCNF'+ permutation.

Keywords: determinative conjunct, hard determinable formula, quasi-hard determinable formula, proof complexity, refutation system, polynomial simulation.

ACM Classification Keywords: F.4.1 Mathematical Logic and Formal Languages, Mathematical Logic, Proof theory

Link:

PROOF COMPLEXITIES OF SOME PROPOSITIONAL FORMULAE CLASSES IN DIFFERENT REFUTATION SYSTEMS1

Ashot Abajyan, Anahit Chubaryan

http://www.foibg.com/ijita/vol17/ijita17-3-p07.pdf

Abstract: This paper is devoted to study of characteristics of logarithmically asymptotically optimal (LAO) hypotheses testing and identification for a model consisting of two related objects. In general case it is supposed that L1 possible probability distributions of states constitute the family of possible hypotheses for the first object and the second object is distributed according to one of L1 × L2 given conditional distributions depending on the distribution index and the current observed state of the first object. For the first testing procedure the matrix of interdependencies of all possible pairs of the error probability exponents (reliabilities) in asymptotically optimal tests of distributions of both objects is studied. The identification of the distributions of two objects gives an answer to the question whether 1 r -th and 2r -th distributions occurred or not on the first and the second objects, correspondingly. Reliabilities for the LAO identification are determined for each pair of double hypotheses. By the second approach the optimal interdependencies of lower estimates of all possible pairs of corresponding reliabilities are found and lower estimates of reliabilities for the LAO identification are studied for each pair of hypotheses. The more complete results are presented for model of statistically dependent objects, when distributions of the objects are dependent, but its current states are independent. For an example of two statistically dependent objects optimal interdependencies of pairs of reliabilities are calculated and graphically presented.

Keywords: Multiple hypotheses testing, Identification of distribution, Inference of many objects, Error probability exponents, Reliabilities.

Link:

ON RELIABILITY APPROACH TO MULTIPLE HYPOTHESES TESTING AND TO IDENTIFICATION OF PROBABILITY DISTRIBUTIONS OF TWO STOCHASTICALLY RELATED OBJECTS

Evgueni Haroutunian, Aram Yessayan, Parandzem Hakobyan

http://www.foibg.com/ijita/vol17/ijita17-3-p06.pdf

Abstract: Could models of mind be independent from living realities but be classified as mind if the mind uses the same criteria to form the class mind? In the paper a constructive view on the models of mind, cognizers, is presented and the measurable criteria and schemes of experiments on mentality of cognizers are discussed.

Keywords: modeling, cognition, measures, negentropic, strategies.

ACM Classification Keywords: A.0 General Literature.

Link:

ON MEASURABLE MODELS OF PROMOTION OF NEGENTROPIC STRATEGIES BY COGNITION

Pogossian Edward

http://www.foibg.com/ijita/vol17/ijita17-3-p05.pdf

Abstract: Interference minimization problem in wireless sensor and ad-hoc networks is considered. That is to assign a transmission power to each node of a network such that the network is connected and at the same time the maximum of accumulated signal straight on network nodes is minimum. Previous works on interference minimization in wireless networks mainly consider the disk graph model of network. For disk graph model two approximation algorithms with O( n) and (( ln ) ) 2 O opt n upper bounds of maximum interference are known, where n is the number of nodes and opt is the minimal interference of a given network. In current work we consider more general interference model, the physical interference model, where sender nodes' signal straight on a given node is a function of a sender/receiver node pair and sender nodes' transmission power. For this model we give a polynomial time approximation algorithm which finds a connected network with at most (( ln ) / ) 2 O opt n β interference, where β ≥1 is the minimum signal straight necessary on receiver node for successfully receiving a message.

Keywords: interference, wireless networks, graph connectivity, set cover, randomized rounding.

ACM Classification Keywords: C.2.1 Network Architecture and Design - Network topology, G.2.2 Graph Theory - Network problems

Link:

INTERFERENCE MINIMIZATION IN PHYSICAL MODEL OF WIRELESS NETWORKS

Hakob Aslanyan

http://www.foibg.com/ijita/vol17/ijita17-3-p04.pdf

Abstract: This paper discusses the problem of determining the longest common subsequence (LCS) of two sequences. Here we view this problem in the background of the well known algorithm for the longest increasing subsequence (LIS). This new approach leads us to a new online algorithm which runs in time and in space where is the length of the input sequences and is the number of minimal matches between them. Using an advanced technique of van Emde Boas trees the time complexity bound can be reduced to preserving the space bound of .

Keywords: longest common subsequence, longest increasing subsequence, online algorithm.

ACM Classification Keywords:G.2.1 Discrete mathematics: Combinatorics

Link:

A NEW ALGORITM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM

Vahagn Minasyan

http://www.foibg.com/ijita/vol17/ijita17-3-p03.pdf

Abstract: A Т-complete wtt-mitotic set is composed, which is not tt-mitotic. A relation is found out between structure of computably enumerable sets and the density of their unsolvability degrees. Let us adduce some definitions: A computably enumerable (c.e.) set is tt - mitotic (wtt - mitotic) set if it is the disjoint union of two c.e. sets both of the same tt -degree ( wtt -degree) of unsolvability. Let A be an infinite set. f majorize A if ( ( ) ) n ∀n f n ≥ z , where z0 ,z1, are the members of A in strictly increasing order. A is hyperimmune (abbreviated h-immune) if A is infinite and (∀ recursive f ) f does not majorize A. A is hypersimple if A is c.e. and A is hyperimmune. A is hyperhyperimmune if A is infinite and ¬(∃ recursive f ) so that [( ) &( )( ) ∀u Wf (u) is finite & Wf (u)  A ≠ ∅ ∀u ∀v u ≠ v ⇒Wf (u) Wf (v) = ∅ ]. A is hyperhypersimple if A is computably enumerable and A is hyperhyperimmune. We shall denote T-degrees by small bold Latin letters. A degree a ≤ 0′ is low if a′ = 0′(i.e. if the jumpa′ has the lowest degree possible). Theorem (Martin 6). a is the degree of a maximal set ⇔ a is the degree of a hypersimple set ⇔ a is c.e. and a′ = 0′′ . Theorem (R. Robinson 8). Let b and c be c.e. degrees such that c < b and c is low. Then there exist incomparable low c.e. degrees 0 a and a1 , such that 0 1 b = a ∪ a and a > c i , for i < 2 . Griffiths (3) proved that there is a low c.e. T-degree u such that if v is a c.e. T-degree and u ≤ v then v is not completely mitotic. In this article it is proved the following theorem: Theorem. There exists a low c.e. T-degree u such that if v is a c.e. T-degree and u ≤ v then v contains hypersimple wtt -mitotic set, which is not tt -mitotic. From the abovementioned theorems of Martin and R. Robinson follows that it is impossible to replace hypersimple by hyperhypersimple.

Keywords: computably enumerable (c.e.) set, mitotic, wtt -reducibility, tt -reducibility, hypersimple set, low degree.

ACM Classification Keywords: F. Theory of Computation, F.1.3 Complexity Measures and Classes.

Link:

ON HYPERSIMPLE wtt -MITOTIC SETS, WHICH ARE NOT tt -MITOTIC

Arsen H. Mokatsian

http://www.foibg.com/ijita/vol17/ijita17-3-p02.pdf

Abstract: This paper considers one particular problem of general type of discrete tomography problems and introduces an approximate algorithm for its solution based on Lagrangian relaxation. A software implementation is given as well.

Keywords: discrete tomography, lagrangian relaxation.

ACM Classification Keywords: F.2.2 Nonnumerical Algorithms and Problems: Computations on discrete structures.

Link:

CONSTRAINT CONVEXITY TOMOGRAPHY AND LAGRANGIAN APPROXIMATIONS

Levon Aslanyan, Artyom Hovsepyan, Hasmik Sahakyan

http://www.foibg.com/ijita/vol17/ijita17-3-p01.pdf

Abstract: We study interaction protocols of software agents in an Intelligent Agent Server system, which employs software agents in regard to different applied problems. Models of agent interaction protocols are proposed. The protocols are evaluated for utility, implementation and applicability. The logical level of system is designed and implemented algorithmically. The test application is the intrusion detection problem.

Keywords: saftware agent, secure communication, inteligence.

ACM Classification Keywords: D.2.11 Software Architectures.

Link:

INTELLIGENT AGENTS AND PROTOCOLS

Levon H. Aslanyan, David A. Karapetyan

http://www.foibg.com/ijita/vol17/ijita17-2-p07.pdf