
ZOOMING USER INTERFACE IN PRESENTATIONS FOR LEARNING
By: Artem Pecheny
(1879 reads)
Rating:
(1.00/10)

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/ijita174p07.pdf

A COMPUTER METHOD TO STUDY THE ENTIRETY OF STUDENTS’ KNOWLEDGE ACQUIRED DURING A
By: Evgeny A. Eremin
(2126 reads)
Rating:
(1.00/10)

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/ijita174p06.pdf

WAVELET TRANSFORM IN INVESTIGATIONS OF STUDENTS EDUCABILITY DEPENDENTLY ...
By: Kozina et al.
(1995 reads)
Rating:
(1.00/10)

Abstract: Application of 2level 2D 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, 2D 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/ijita174p05.pdf

SYSTEM OF INTELLIGENT SEARCH, CLASSIFICATION AND DOCUMENT SUMMARISATION FOR INTE
By: Vyacheslav Lanin, Dmitriy Tsydvintsev
(1919 reads)
Rating:
(1.00/10)

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 agentbased 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, multiagent systems, intelligent search, semantic indexing, document analysis,
adaptive information systems, CASEtechnology.
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/ijita174p04.pdf

A METHOD OF CONSTRUCTING PERMUTATION POLYNOMIALS OVER FINITE FIELDS
By: Melsik Kyureghyan, Sergey Abrahamyan
(1750 reads)
Rating:
(1.00/10)

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/ijita174p03.pdf

PREDICTIVE MODELING OF SPATIAL REDISTRIBUTION IN DYNAMICAL MODELS OF GLOBAL ...
By: Nelli Ajabyan
(1817 reads)
Rating:
(1.00/10)

Abstract: The paper discusses stability concepts and methods of stability investigation in models describing the
climatebiosphere interaction for a hypothetical zerodimensional model. The climatebiosphere 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/ijita174p02.pdf

ORIENTATION ESTIMATION WITH APPLICATIONS TO IMAGE ANALYSIS AND REGISTRATION
By: David Asatryan, Karen Egiazarian, Vardan Kurkchiyan
(2389 reads)
Rating:
(1.00/10)

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 histogrambased
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/ijita174p01.pdf

PROOF COMPLEXITIES OF SOME PROPOSITIONAL FORMULAE CLASSES IN DIFFERENT ...
By: Ashot Abajyan, Anahit Chubaryan
(2002 reads)
Rating:
(1.00/10)

Abstract: In this paper the proof complexities of some classes of quasihard 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 speedup over the GCNF'+ permutation.
Keywords: determinative conjunct, hard determinable formula, quasihard 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/ijita173p07.pdf

ON RELIABILITY APPROACH TO MULTIPLE HYPOTHESES TESTING AND TO IDENTIFICATION...
By: Evgueni Haroutunian, Aram Yessayan, Parandzem Hakobyan
(1785 reads)
Rating:
(1.00/10)

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/ijita173p06.pdf

ON MEASURABLE MODELS OF PROMOTION OF NEGENTROPIC STRATEGIES BY COGNITION
By: Pogossian Edward
(1905 reads)
Rating:
(1.00/10)

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/ijita173p05.pdf

INTERFERENCE MINIMIZATION IN PHYSICAL MODEL OF WIRELESS NETWORKS
By: Hakob Aslanyan
(2048 reads)
Rating:
(1.00/10)

Abstract: Interference minimization problem in wireless sensor and adhoc 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/ijita173p04.pdf

A NEW ALGORITM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM
By: Vahagn Minasyan
(2266 reads)
Rating:
(1.00/10)

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/ijita173p03.pdf

ON HYPERSIMPLE wtt MITOTIC SETS, WHICH ARE NOT tt MITOTIC
By: Arsen H. Mokatsian
(4004 reads)
Rating:
(1.00/10)

Abstract: A Тcomplete wttmitotic set is composed, which is not ttmitotic. 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 himmune) 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 Tdegrees 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. Tdegree u such that if v is a c.e. Tdegree 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. Tdegree u such that if v is a c.e. Tdegree 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/ijita173p02.pdf

CONSTRAINT CONVEXITY TOMOGRAPHY AND LAGRANGIAN APPROXIMATIONS
By: Levon Aslanyan, Artyom Hovsepyan, Hasmik Sahakyan
(2300 reads)
Rating:
(1.00/10)

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/ijita173p01.pdf

INTELLIGENT AGENTS AND PROTOCOLS
By: Levon H. Aslanyan, David A. Karapetyan
(2181 reads)
Rating:
(1.00/10)

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/ijita172p07.pdf

ON THE STRUCTURE OF MAXIMUM INDEPENDENT SETS IN BIPARTITE GRAPHS
By: Vahagn Minasyan
(1889 reads)
Rating:
(1.00/10)

Abstract: In this paper it is shown that for bipartite graphs the structure of the family of maximum independent
sets can be described constructively, in the following sense. For a bipartite graph there are some “basic”
maximum independent sets, in terms of which any maximum independent set can be described, in the sense that
there is onetoone correspondence between a maximum independent set and an irreducible combination of
these “basic” maximum independent sets. König’s theorem states that there is duality between the cardinalities of
maximum matching and minimum vertex cover. Viewing the mentioned structure, in this paper it is shown that
another duality holds, which is between the sets rather than their cardinalities. We believe that this duality is not
just of theoretical interest, but it also can yield to a usable algorithm for finding a maximum matching of bipartite
graph. In this paper we do not present such algorithm; instead we mention what approaches we plan to use in
further works to obtain such algorithm.
Keywords: bipartite graph, maximum independent set, distributive lattice, duality.
ACM Classification Keywords:G.2.1 Discrete mathematics: Combinatorics
Link:
ON THE STRUCTURE OF MAXIMUM INDEPENDENT SETS IN BIPARTITE GRAPHS
Vahagn Minasyan
http://www.foibg.com/ijita/vol17/ijita172p06.pdf

SOME PROPERTIES IN MULTIDIMENSIONAL MULTIVALUED DISCRETE TORUS
By: Vilik Karakhanyan
(2085 reads)
Rating:
(1.00/10)

Abstract: Current research concerns the following issues: ndimensional discrete torus generated by cycles of
even length is considered; the concept of standard arrangement in the torus is defined and some basic
properties of this arrangement are investigated. The issues considered are similar to discrete isoperimetry
constructions, being related to concept of neighbourhood in terms of linear arrangements of vertices. Considered
are the basic properties of solving the discrete isoperimetry problem on torus.
Keywords: discrete torus, standard arrangement.
ACM Classification Keywords: G.2.1 Discrete mathematics: Combinatorics
Link:
SOME PROPERTIES IN MULTIDIMENSIONAL
MULTIVALUED DISCRETE TORUS
Vilik Karakhanyan
http://www.foibg.com/ijita/vol17/ijita172p05.pdf

COMPARISON OF PROOF SIZES IN FREGE SYSTEMS AND SUBSTITUTION FREGE SYSTEMS
By: Anahit Chubaryan, Hakob Nalbandyan
(1784 reads)
Rating:
(1.00/10)

Abstract: It is known that the minimal number of the steps in a proof of a tautology in a Frege system can be
exponentially larger than in a substitution Frege system, but it is an open problem whether Frege systems can
polynomially simulate substitution Frege systems by sizes. Many people conjecture that the answer is no. We
prove that the answer is yes. As a bridge between substitution Frege systems and Frege systems we consider
the Frege systems, augmented with restricted substitution (single renaming) rule. We prove that Frege systems
with single renaming rule polynomially simulate by size Frege systems with substitution rule without any
restrictions, and Frege systems without substitution rule polynomially simulate Frege systems with single
renaming rule both by steps and by size.
Keywords: Frege system, proof complexity, depthrestricted substitution rule, kbounded substitution rule,
polynomial simulation, exponential speedup.
ACM Classification Keywords: F.4.1 Mathematical Logic and Formal Languages, Mathematical Logic, Proof
theory
Link:
COMPARISON OF PROOF SIZES IN FREGE
SYSTEMS AND SUBSTITUTION FREGE SYSTEMS
Anahit Chubaryan, Hakob Nalbandyan
http://www.foibg.com/ijita/vol17/ijita172p04.pdf

IMPLEMENTATION OF DICTIONARY LOOKUP AUTOMATA FOR UNL ANALYSIS AND GENERATION
By: Igor Zaslawskiy, Aram Avetisyan, Vardan Gevorgyan
(2412 reads)
Rating:
(1.00/10)

Abstract: In this paper we present some research results and propose solutions for natural language string
lookup techniques. In particular a fast method is suggested for searching dictionary entries for possible matches
of sentence words without using relational databases or full dictionary load into machine random access memory.
Such approach is essential for minimizing the speed dependency from dictionary size and available machine
resources as well as for the scalability of the analyzer software. The mentioned is based on an implementation of
AhoCorasick? Aho, Corasick, 1977 automata with a number of optimizations in the indexing and lookup
algorithm.
Keywords: UNL, natural language processing, dictionary lookup, indexing, search, XML, pattern matching
machine, string matching algorithm, information search
ACM Classification Keywords: F.2.2 Nonnumerical Algorithms and Problems – Pattern matching, Sorting and
searching, I.2.7 Natural Language Processing  Text analysis, Language parsing and understanding, I.7.2
Document Preparation – Index generation, Markup languages, H.3.1 Content Analysis and Indexing –
Dictionaries, Indexing Methods, H.3.3 Information Search and Retrieval  Retrieval models, Search process.
Link:
IMPLEMENTATION OF DICTIONARY LOOKUP AUTOMATA
FOR UNL ANALYSIS AND GENERATION
Igor Zaslawskiy, Aram Avetisyan, Vardan Gevorgyan
http://www.foibg.com/ijita/vol17/ijita172p03.pdf

APPROXIMATION GREEDY ALGORITHM FOR RECONSTRUCTING OF (0,1)MATRICES WITH DIFFERE
By: Hasmik Sahakyan
(1795 reads)
Rating:
(1.00/10)

Abstract: Existence and reconstruction issues are considered for a class of (0,1)matrices with different rows.
Intending to define quantitative characteristics, maximization of which lead to matrices with different rows in case
when the later exist, we consider the number of pairs of different rows.A greedy algorithm is introduced for this
purpose and then its optimality is proven for local steps.
Keywords: (0,1)matrices, greedy algorithms
ACM Classification Keywords: F.2.2 Nonnumerical Algorithms and Problems:Computations on discrete
structures
Link:
APPROXIMATION GREEDY ALGORITHM FOR RECONSTRUCTING OF
(0,1)MATRICES WITH DIFFERENT ROWS
Hasmik Sahakyan
http://www.foibg.com/ijita/vol17/ijita172p02.pdf

ASSOCIATION RULE MINING WITH NDIMENSIONAL UNIT CUBE CHAIN SPLIT TECHNIQUE
By: Levon Aslanyan, Robert Khachatryan
(2104 reads)
Rating:
(1.00/10)

Abstract: This paper considers the association rule mining problem and provides an alternative to APRIORI
algorithm, for solving this problem by splitting up the ndimensional unit cube vertices into the chains using the
well know technique introduced by G. Hansel. We use the further development of this technique given by G.
Tonyan, which adds computability on levels of chains and chain splits. A brief description of the software
implementation of the introduced alternative approach is given.
Keywords: association rule, data mining, unit cube.
ACM Classification Keywords: 1.5. Pattern recognition, H.2.8 Database applications, Data mining.
Link:
ASSOCIATION RULE MINING
WITH NDIMENSIONAL UNIT CUBE CHAIN SPLIT TECHNIQUE
Levon Aslanyan, Robert Khachatryan
http://www.foibg.com/ijita/vol17/ijita172p01.pdf

CONSTRUCTION OF SOME COMPOSITION PERMUTATIONS VIA LINEAR TRANSLATORS
By: Sergey Abrahamyan, Knarik Kyuregyan
(1834 reads)
Rating:
(1.00/10)

Abstract: This paper considers construction of some composition permutation polynomials. For some
permutation polynomials the explicit view of their selfcompositions and inverse mappings are given. Also
for some particular case the cycle structure is considered.
Keywords: finite field, polynomial factorization, polynomial composition
ACM Classification Keywords: F.2.1 Numerical Algorithms and Problems
Link:
Construction of Some Composition Permutations via Linear
Translators
Sergey Abrahamyan, Knarik Kyuregyan
http://www.foibg.com/ijita/vol22/ijita2203p08.pdf

THE SYSTEM OF MULTILINGUAL TEXT DATA PROCESSING ON THE BASE OF THE MODIFIED ...
By: Oleg Moyseenko
(1843 reads)
Rating:
(1.00/10)

Abstract: The article describes the architecture and principles of work of the developed system of
automated processing of large volumes of textual information. The system is based on the modification
of the free software library LibSVM and on the implemented in it method of support vector machines.
The system performs functions of search, classification, categorization, and clustering of text documents
requested by the user.
Keywords: classification, categorization, clustering, text documents processing.
ACM Classification Keywords: H.3.3 Information Search and Retrieval, H.3.1 Content Analysis and
Indexing.
Link:
THE SYSTEM OF MULTILINGUAL TEXT DATA PROCESSING ON THE BASE OF THE
MODIFIED ALGORITHM SVM
Oleg Moyseenko
http://www.foibg.com/ijita/vol22/ijita2203p07.pdf

ALGORITHMIZATION PROCESS FOR FRACTAL ANALYSIS IN THE CHAOTIC DYNAMICS OF ...
By: Igor Skiter, Еlena Trunova
(2016 reads)
Rating:
(1.00/10)

Abstract: This work deals in the usage of fractal analysis to determine the trend of dynamic
characteristics of chaotic series based on R/Sanalysis. We propose an algorithm using the method of
dynamic roles with large dimensions, which can be specified Hurst at every step of aggregation without
storing values of data stream based on neural network technology.
Keywords: Complex System of Structured Type (CSST), chaotic dynamic series, fractal analysis,
Hausdorff rate, Hurst rate, algorithm R/S analysis, persistence, antipersistence, prognosis, neural
network.
ACM Classification Keywords: G.1.2 Approximation, F.1.1 Models of Computation (F.4.1)
Link:
ALGORITHMIZATION PROCESS FOR FRACTAL ANALYSIS IN THE CHAOTIC
DYNAMICS OF COMPLEX SYSTEMS STRUCTURED TYPE
Igor Skiter, Еlena Trunova
http://www.foibg.com/ijita/vol22/ijita2203p06.pdf

GENERAL STRUCTURE OF COLLECT/REPORT PARADIGM FOR STORING AND ACCESSING BIG DATA
By: Krassimir Markov, Krassimira Ivanova
(1694 reads)
Rating:
(1.00/10)

Abstract: The general structure of Collect/Report Paradigm (CRP) is outlined in this paper. CRP is a
new approach for storing and accessing large amounts of data. Main advantages of CRP are:
(1) collecting information is done by all nodes independently in parallel. It is possible one node to send
information to another; (2) reporting information is provided only by the nodes which really contain
information related to the request; the rest nodes do not react, they remain silent; (3) input data as well
as results are in RDFtriple or RDFquadruple format.
Keywords: Collect/Report Paradigm, Big Data, Cloud computing.
ACM Classification Keywords: D.4.3 File Systems Management, Access methods.
Link:
GENERAL STRUCTURE OF COLLECT/REPORT PARADIGM
FOR STORING AND ACCESSING BIG DATA
Krassimir Markov, Krassimira Ivanova
http://www.foibg.com/ijita/vol22/ijita2203p05.pdf


