Abstract: Problem of comparing alternatives with numerical quality indicators, which due to uncertainty have interval representations, is considered. It is demonstrated inevitability of presence in similar tasks of irremovable risk of making a wrong decision on preference of alternatives. It is emphasized necessity of the account in dealing with such problems both indicators of preference for analyzed alternative in comparison with other objects in their group and risk indicators of making wrong decision. Advantages and disadvantages of available methods of interval alternatives comparing are analyzed. Namely, methods of comparison are considered based on principles of dominance by probability, evaluation methods based on average indicators, new method of collective risk estimating, and methods of “mean – risk” approach. The arguments are given that methods of dominance by probability and methods based on average indicators as tools, which do not allow estimate risk of making a wrong decision explicitly, can play only an auxiliary role in decision-making. Advantages of the method of collective risk estimating consist in account of integral risk in concrete group of compared interval alternatives. Disadvantages are consequence of the fact that the method compares only relative preferences of alternative and permits take into account acceptability of separate alternative only after additional constructions. In the framework of “mean – risk” approach properties of such convenient for practice risk indicator as average semideviation were studied for some simple but important for applications distribution functions of preference chances. It is shown that in some cases instead of average semideviation indicator using of indicators of risk based on results of methods evaluating of deviation from target marks is more expedient. An advantage of methods of “mean – risk” approach is the possibility of calculating for each alternative pair of basic indicators needed for the evaluation interval alternatives, indicator of acceptability of alternatives and indicator of associated risk. The disadvantages include the fact that both of these indicators are calculated for an alternative as an independent object, which is not associated with others in compared group. Comparison of the alternatives on preference is based on values of these indicators but dependence of the risk on the context is not taken into account. Due to presence of both advantages and disadvantages of the methods is proposed to use a three-step approach to decision-making on the selection of interval alternatives, which is based on consistent using of different methods: A stage of the preliminary analysis of alternatives for the purpose of culling some of their number and reducing the dimension of the problem and size of collective risk by this is suggested to include in the procedure of decision making on the choice of the preferred objects. Method 304 International Journal “Information Theories and Applications”, Vol. 23, Number 4, © 2016 of average estimates is suggested to use at this stage. Using of the collective risk estimating techniques with isolating of a small number of alternatives as acceptable by the indicator of preference, as well as having the lowest risk of wrong estimates, is recommended at the following stage and methods of “mean – risk " approach at the final stage.

Keywords: comparing interval alternatives, methods of probabilistic dominance, collective risk estimating, “mean-risk” methods, joint using of the methods.

ACM Classification Keywords: H.1.2 Human information processing. G3 Distribution functions. I.2.3 Uncertainty, “fuzzy”, and probabilistic reasoning.

Link:

DECISION-MAKING IN GROUPS OF INTERVAL ALTERNATIVES

Gennady Shepelev

http://www.foibg.com/ijita/vol23/ijita23-04-p01.pdf

Abstract: One way to improve the quality of distance learning subjects in economics is the development and application in the process of training of trainers and simulators. The article defines the necessary requirements to simulators for the subjects of economic profile. The technology training and learning using the software package developed by the author - trainer "Cyber2T". Attention is concentrated on the stage of the debriefing. A method of analyzing and summarizing the results of the training is done using logical probabilistic model to predict the possible errors and assumptions form the recommendations to correct them."Cyber2T" designed to "Cyber2" basis -. The system of identifying and evaluating the development of knowledge "Cyber2T" written in VB.NET 2010, the database is organized to SQL Server 2008.

Keywords: "Cyber2T"; Simulators-trainer; knowledge systems; Simulator of economic subject.

Link:

CREATING A TRAINING SIMULATOR FOR THE ECONOMIC DISCIPLINES AND ITS FUNCTIONALITY

Tea Munjishvili; Zurab Munjishvili

http://www.foibg.com/ijita/vol23/ijita23-03-p07.pdf

Abstract. Our main goal in this paper is to propose a new approach for modeling human brain memory by storing information using only the names but not pointers. This approach gives us new point of view to the human brain processes. In other hand, it simplifies and speeds up the corresponded computer programs. It is called “Natural Language Addressing” (NLA). This approach is a possibility to access information using natural language words or phrases as direct addresses of the information in the computer memory. For this purpose the internal encoding of the letters is used to generate corresponded address co-ordinates.

Keywords: modeling human brain memory, ontologies, addressing, natural language addressing

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

Link:

STORING INFORMATION VIA NATURAL LANGUAGE ADDRESSING – A STEP TOWARD MODELING HUMAN BRAIN MEMORY

Krassimira Ivanova, Stefan Karastanev

http://www.foibg.com/ijita/vol23/ijita23-03-p06.pdf

Abstract: Image inpainting is the process of filling in missing or damaged parts. Exemplar based image inpainting algorithm fills in the missing parts using information from the known part of the image. Scanning the whole image for finding the most similar patch is a very time consuming task. Also the algorithm doesn’t consider the depth information which harms the quality of the result. In this paper, we use depth information from the image depth map and this approach improves efficiency and quality of inpainted image. The paper includes experiment results and comparison with exemplar based inpainting algorithm.

Keywords: stereo image, inpainting, exemplar based, depth map, image completion

ACM Classification Keywords: I.4.4 Image Processing and Computer Vision - Restoration

Link:

EXEMPLAR BASED INPAINTING USING DEPTH MAP INFORMATION

Vahan Gevorgyan Vladimir, Aram Gevorgyan Vladimir, Gevorg Karapetyan Arakel

http://www.foibg.com/ijita/vol23/ijita23-03-p05.pdf

Abstract: A new approach to analysis of structure of the training sample based on identification and parameterization clusters of local regularities that are considered as generalized precedents of manifestation of partial interrelations in data is investigated. Substantive treatment of non-uniformity in images of empirical distributions in parametric spaces is proposed, and possibilities of use of secondary cluster structure for reduction of complexity of decisions and increase of processing speed, identification and verification of regularities, are studied.

Keywords: local dependency, generalized precedent, parametric space, cluster, hyper-parallelepiped, logical regularity, hypercube bitmap, derivative distribution, decision rule

Link:

ASSEMBLING DECISION RULE ON THE BASE OF GENERALIZED PRECEDENTS

Vladimir Ryazanov, Alexander Vinogradov, Yuryi Laptin

http://www.foibg.com/ijita/vol23/ijita23-03-p04.pdf

Abstract: The scientific and technological problems of constructing dynamic integrated expert systems and the approaches to their solution are discussed. The new stages of the development of a problemoriented methodology and AT-TECHNOLOGY workbench for constructing integrated expert systems in the context of solving dynamic integrated expert systems are considered. The theoretical and technical issues concerned with the representation and processing of temporal knowledge and simulation modeling are of special interest. The features of the implementation of temporal reasoning software and simulation modeling software for the dynamic version of the AT-TECHNOLOGY workbench are described.

Keywords: dynamic integrated expert systems, problem-oriented methodology, AT-TECHNOLOGY workbench, time representation, interval Allen logic, temporal solver, integration, simulation modeling

ACM Classification Keywords: software and its engineering, real-time systems software, software notations and tools, context specific languages, development frameworks and environments, software development techniques

Link:

SOME ASPECTS OF TEMPORAL REASONING INTEGRATION WITH SIMULATION MODELING FOR DYNAMIC INTEGRATED EXPERT SYSTEMS CONSTRUCTION USING AT-TECHNOLOGY WORKBENCH

Galina Rybina, Victor Rybin

http://www.foibg.com/ijita/vol23/ijita23-03-p03.pdf

Abstract: The paper deals with the methodology of complex sensitivity analysis of solution given by one of the popular multiple-criteria decision-making methods, namely the Analytic Hierarchy Process. This methodology includes evaluation of sensitivity of hierarchy elements local ranking to changes in an expert pairwise comparison judgments and evaluation of sensitivity of global ranking of decision alternatives to changes in weights of hierarchy elements. The sensitivity analysis is illustrated on a problem of evaluation of renewable energy technologies for an eco-house in Ukraine.

Keywords: the analytic hierarchy process, uncertainty of expert pairwise comparison judgments, sensitivity analysis, stability intervals, critical expert pairwise comparison judgments, critical elements of a hierarchy.

ACM Classification Keywords: H.4.2. INFORMATION SYSTEM APPLICATION: type of system strategy

Link:

SENSITIVITY ANALYSIS OF A DECISION-MAKING PROBLEM USING THE ANALYTIC HIERARCHY PROCESS

Nataliya D. Pankratova, Nadezhda I. Nedashkovskaya

http://www.foibg.com/ijita/vol23/ijita23-03-p02.pdf

Abstract: This article, in general, is devoted to a set of discrete optimization issues derived from the domain of pattern recognition, machine learning and data mining - specifically. The global objectives are the compactness hypotheses of pattern recognition, and the structural reconstruction of the discrete tomography. The driving force of the current research was the proof technic of the discrete isoperimetry problem. In proofs by induction the split technique was applied and then it is important to have some information about the sizes of the split compounds. Isoperimetry itself is a formalism of the compactness hypotheses. From one side knowledge on split sizes helps to find the compact structures and learning sets based on this, from the other side – split sizes help to prove the necessary relations. The pure combinatorial approaches 22-77 are not able at the moment to give an efficient description of the split sizes and – the weighted row-different matrices. The probabilistic method, as it is well-known, gives additional knowledge about the random subsets, and this may be useful as a complementary knowledge about a different objects or a situations concerned the properties of discrete structures – isoperimetry and tomography. The discrete mathematical science deals with different types of discrete structures, studying their transformations and properties. In some problems we face the issues about the existence of structures under some special constraints, about the enumeration of structures under these constraints, and – on algorithmic optimization. Given a simple structure – in some cases, it can be even hard to compute some basic properties of it. Such are for example the graph chromatic number, the minimal set cover, the solution of the well-known SAT and plenty of other NP-complete problems. When structures are given, the mentioned parameters may be easily computable. To find a structure by the given parameters often becomes hard. We call such problems – inverse problems. Our special interest is in considering of simple (0,1) matrices and their row and column weights. Given a matrix we can compute the mentioned weights (direct problem). The inverse problem, — when it is to find the construction with the given weights is not simple. At least there is not known polynomial algorithms for this problem. Moreover, the problem is known as the hypotheses posted by famous graph theorist C. Berge so that the problem is well known and unsolved. 204 International Journal “Information Theories and Applications”, Vol. 23, Number 3, © 2016 Besides the logical and combinatorial analysis of the inverse type problems of discrete optimization, in several cases the probabilistic models were applied successfully. The idea of this paper is to use the probabilistic theory of combinatorial analysis to the discrete tomography problem given in terms of the (0,1) matrices. The paper tries to outline the models, relations and the methodology. Our research priority interest is to understand the opportunities, similarities and perspectives in this broad research area. The study is ongoing and the follow up publication will come soon.

Keywords: discrete tomography, discrete isoperimetry, probabilistic theory of combinatorial analysis, (0,1) matrices, discrete optimization.

ACM Classification Keywords: G.2.1 Combinatorics

Link:

RANDOMIZED SET SYSTEMS CONSTRAINED BY THE DISCRETE TOMOGRAPHY

Irina Arsenyan, Levon Aslanyan and Hasmik Sahakyan

http://www.foibg.com/ijita/vol23/ijita23-03-p01.pdf

Abstract: The algorithms for computation of basis of solutions systems of linear constraints over set of real numbers, minimal supported set of solutions for systems of linear Diophantine homogeneous equations over set of natural numbers and basis of systems of linear Diophantine homogeneous and inhomogeneous equations over ring of integer numbers, over ring and eld of residues on modulo are described. Thies algorithms consider in context of solving of general constraint satisfaction problem

ACM Classication Keywords: Systems of linear Diophantine constraints, minimal supported set of solutions, basis of solutions, constraint satisfaction problem

Link:

Линейные ограничения и методы их решения

Сергей Л. Крывый

http://www.foibg.com/ijita/vol23/ijita23-02-p01.pdf

Abstract: This article put emphasis on the issue of information system efficiency in tourism, as a tool of defining the level of domestic and inbound tourism growth. The necessity of information system development is determined to solve the problem of current tourism functionality; however, the implementation of some automated information system (AIS) cannot be a solution to the obstacle. AIS need to be efficient. Thus, the article provides the way of estimation and enhancement of information flows as an approach to improve information system efficiency.

Keywords: automated information systems (AIS), efficiency, information flow, graph modeling, AIS enhancement, information systems in tourism.

ACM Classification Keywords: G.2.2 Graph Theory, H.1 Models and Principles, K.4.3 Organizational Impacts

Link:

INFORMATION FLOWS ENHANCEMENT FOR AIS TOURISM AUTOMATED INFORMATION SYSTEM

Irina Titova, Natalia Frolova

http://www.foibg.com/ijita/vol23/ijita23-01-p08.pdf

Abstract: Time series processing in intelligent is a complex cross–disciplinary problem that is posed in many research areas. In this paper two subproblems are considered: anomaly detection in time series and time series clustering on an example of speaker clustering.

Keywords: Time Series Processing, Anomaly Detection, Speaker Clustering, Neural Networks.

Link:

METHODS AND ALGORITHMS OF TIME SERIES PROCESSING IN INTELLIGENT SYSTEMS

Sergey G. Antipov , Marina V. Fomina, Vadim V.Vagin, Alexandr P. Eremeev, Vasilii A. Ganishev

http://www.foibg.com/ijita/vol23/ijita23-01-p07.pdf

Abstract: The paper describes methods and tools for organizational knowledge representation in the field of strategic management. Visual and matrix/table-based methods are actively used for knowledge representation in this domain. Diagrams solve problems associated with the managerial thinking (cognitive challenges), managerial communications and coordination (social problems), and the ability of managers to motivate and involve their employees (emotional problems). On the other hand, there are types of information and tasks that are better supported by matrices. In order to effectively combine diagrams with matrices the paper suggests multi-representation of organizational knowledge using ontologies. Such multi-representation capabilities for organizational knowledge are already supported by some enterprise architecture management software tools. Two of these tools are described in the paper.

Keywords: organizational knowledge, knowledge management methods, knowledge representation, knowledge structuring, ontologies, strategic management.

ACM Classification Keywords: A.0 General Literature - Conference proceedings

Link:

REPRESENTING STRATEGIC ORGANIZATIONAL KNOWLEDGE VIA DIAGRAMS, MATRICES AND ONTOLOGIES

Dmitry Kudryavtsev, Anna Menshikova, Tatiana Gavrilova

http://www.foibg.com/ijita/vol23/ijita23-01-p06.pdf

Abstract: We consider ܦ ,(݊)௠the set of all degree sequences of simple hypergraphs with ݊ vertices and ݉ hyperedges. We show that ܦ ,(݊)௠which is a subset of the ݊-dimensional ݉+1-valued grid ାଵ௠ߌ ௡ , is not a convex subset of ߌ௠ାଵ ௡ ; and give a characterization of the convex hull of ܦ .(݊)௠

Keywords: hypergraph, degree sequence, convexity.

ACM Classification Keywords: F.2.2: Nonnumerical Algorithms and Problems; G.2.2 Graph Theory

Link:

CONVEXITY RELATED ISSUES FOR THE SET OF HYPERGRAPHIC SEQUENCES

Hasmik Sahakyan, Levon Aslanyan

http://www.foibg.com/ijita/vol23/ijita23-01-p05.pdf

Abstract: In this paper a modification of public key encryption system presented in Khachatryan, Kyureghyan, 2015 and performance analysis are presented. As described in Khachatryan, Kyureghyan, 2015, the permutation polynomial P(x) is declared to be a public polynomial for encryption. A public key encryption of given m(x) is the evaluation of polynomial P(x) at point m(x) where the result of evaluation is calculated via so called White box reduction, which does not reveal the underlying secret polynomial g(x). Our analysis have shown that an attacker may acquire some information about the message, having its cipher-text, in case of using certain values of P(x). So either those values of P(x) must be avoided, or the modification presented in this paper must be used. Our implementation’s performance was compared to RSA-2048 implementation of CryptoPP library and it was 3.75x and 133x faster on encryption and decryption operations respectively.

Keywords: Permutation polynomials, Public-key encryption, White box reduction..

ACM Classification Keywords: E.3 DATA ENCRYPTION - Public key cryptosystems

Link:

On a public key encryption algorithm based on Permutation Polynomials and performance analyses

Gurgen Khachatrian Martun Karapetyan

http://www.foibg.com/ijita/vol23/ijita23-01-p04.pdf

Abstract: Data clustering has been a well-studied research field for a long time. One of the latest trends in this area is the application of Particle Swarm Optimization (PSO) in clustering which has good potential for improvements. This paper presents an approach to using Particle Swarm Optimization to cluster data. It is shown how PSO can be used to find the centroids of a user specified number of clusters. Results show that PSO clustering techniques have much potential.

Keywords: Social intelligence, Particle swarm optimization, Swarm computing, Clustering algorithms.

ACM Classification Keywords: 10010147.10010178 Computing methodologies Artificial intelligence, 10010147.10010257 Computing methodologies Machine learning, 10010147.10010257.10010293.10010294 Computing methodologies Neural networks.

Link:

Clustering using Particle Swarm Optimization

Nuria Gómez Blas, Octavio López Tolic

http://www.foibg.com/ijita/vol23/ijita23-01-p03.pdf

Abstract: The management and proper use of the Urban Public Transport Systems (UPTS) constitute a field as critical as little investigated according to its relevance and urgent idiosyncrasy within smart cities realm. In this paper, a newfangled approach by using the Natural Computing paradigm and Collective Computation is shown, more concretely taking advantage of an Ant Colony Optimization algorithm variation in order to build a system that makes the complete control of the UPTS a tangible reality.

Keywords: Smart City, Natural Computing, Collective Computation, Urban Public Transport System, Wireless Sensor Networks

ACM Classification Keywords: 10003120.10003138: Human-centered computing - Ubiquitous and mobile computting, 10010147.10010178: Computing methodologies - Artificial intelligence, 10010147.10010257.10010293.10011809: Computing methodologies - Bio-inspired approaches, 10010405.10010481.10010485: Applied computing - Transportation

Link:

COLLECTIVE COMPUTATION: TURNING THE UNDERGROUND INTO AN ANT NEST

Clemencio Morales, Luis Fernando de Mingo

http://www.foibg.com/ijita/vol23/ijita23-01-p02.pdf

Abstract: Once the biggest issue with the current democracy system is identified, the research focuses on finding the root of the problem. This is a key step and requires further analysis as we are constantly deviating from the true origin. Unless we tackle the root of the problem any attempt we make to improve the system will be in vain. The current democratic system is severely flawed and therefore requires improvement that can only be detected by society. The works highlighted here report numerous problems of corruption, lack of transparency, information monopoly, and bipartisanship in virtually all current governments. These days, citizen demonstrations against political abuse are a social reality, which proves the large gap that exists between the government and the middle class. This work defines several parameters to measure the quality of governments and propose to use a linear function to check on them. Once the root of the problem comes to the surface, the way to move forward becomes clear.

Keywords: Linear function, quality measurement, Democratic system

Link:

IMPLEMENTING A LINEAR FUNCTION TO MEASURE THE QUALITY IN GOVERNMENTS

Alberto Arteta, Juan Castellanos, Yanjun Zhao, Danush K. Wijekularathna

http://www.foibg.com/ijita/vol23/ijita23-01-p01.pdf

Abstract: The actual development of our civilization on Earth in the last century has seen an explosive growth of meaningful production, manipulation and use of information. Unfortunately, we still rely on an intuitive notion of this phenomenon, and even some of the leading experts avoid giving a precise definition of this development. What is more important - the explosive increase of the capacity to exchange signals over the past two decades has brought an overall reduction of the information in the communication flow, rather than its integral growth, and its allegorical approximation is closer to the level of relict infrared radiation of the Universe, rather than a typical star’s optic or UHF emission. The other side of the coin is the exponentially growing complexity and linked with it impracticability of relevant functions which make use of such information. The paper describes an approach for effective framing of the so called semantic-pragmatic information and a relatively simple formal structural model of a subject which uses such information, as a set of properties of this paradigm, concerning the boundaries of possible information consumption in real natural or artificial systems in the Universe. As formulated, these properties govern: - The limitations on the amount of information and information exchange in real subjects / systems; - The conditions for converting Information into Noise and vice versa; - The principles of growth of proper pragmatic information in a natural subject /system during its physical existence/”life”; - Asymptotical reduction of communicated information among so called "Teleological" or "Autopoietic" (i.e. self-expandable, self-steering and self-developing) systems during their post-mature evolution. Some interesting consequences of the identified properties are outlined, that can have a great social relevance both now and in the near future.

Keywords: Semantic Information Theory, Framework, General System Theory Class, Instance Definition.

ACM Classification Keywords: H.1.1 Systems and Information Theory, Value of information

Link:

FORMAL THEORY OF SEMANTIC AND PRAGMATIC INFORMATION - A TECHNOCRATIC APPROACH

Venco Bojilov

http://www.foibg.com/ijita/vol22/ijita22-04-p05.pdf

Abstract: An approach for estimation of Software Models (SMs) from Cognitive Science point of view is outlined in the paper. The basic notion of this approach is the new term “Software Model Cognitive Value” (SMCV). Software models are represented as Unified Modeling Language (UML) UML 2.5, 2012 diagrams that are used in Agile approach Beck et al, 2001; Allen, 2015. In order to define peculiarities of SM human perception, cognitive principles of comprehension are considered in this paper. According to these principles, the peculiarities of SM comprehension in different situations when software is developed following Agile approach, are formulated. The proposed approach offers an estimation of SM from the points of view both Software Engineering and Cognitive Science. From the Software Engineering view, characteristics of SM designing are considered. The cognitive features of SM such as its comprehension and understanding are taken into account. The process of applying the proposed approach to choose the best type of SM for requirement analysis for project of designing 3D-graph is also outlined in this paper. Applications of this approach and advantages of its applying for solving typical Software Engineering tasks are formulated.

Keywords: Software Model Cognitive Value; UML Diagram; Agile Development; Model-Driven? Development; Software Lifecycle Process; Software Designing, Software Requirement Analysis; 3Dgrpah.

ACM Classification Keywords: D.2 Software Engineering; D.2.1 Requirements/Specifications; D.2.9 Management - Life cycle; Software process models; I.2.0 General: Cognitive science.

Link:

SOFTWARE MODEL COGNITIVE VALUE

Elena Chebanyuk, Krassimir Markov

http://www.foibg.com/ijita/vol22/ijita22-04-p04.pdf

Abstract: We further develop the self-centered model of mental representations for language with the focus on the mechanisms underlying syntactic calculus and the construction of larger meaningful constructs out of the basic syntactic units. We consider the inborn multimodal perception and the selfconcept as an actor in an environment as the basis for concept formation and syntactic construction. Based on relevant findings in language acquisition, we investigate the perceptual, semantic, and syntactic aspects of mental apparatus. We see this apparatus as an overall system that can handle the task of conceptualization and the task of syntactic construction using the same mechanisms. Based on the argument-centered model of mental representations which involves such processing homogeneity, we show the gradual development of the complexity of syntactic formants during language acquisition.

Keywords: language acquisition, syntax complexity, mental operations

ACM classification keywords: I.2.0: Artificial Intelligence, I.2.7: Natural Language Processing

Link:

SYNTACTIC OPERATIONS – MODELING LANGUAGE FACULTY

Velina Slavova, Alona Soschen

http://www.foibg.com/ijita/vol22/ijita22-04-p03.pdf

Abstract: Based on results from recent studies in neuroscience, cognitive science, brain imaging and psychology, we develop a model of language faculty. We suggest that the entire brain, all its subnets and processes are responsible for the formation of mental representations of the world, obtained gradually by the subject as an actor in the environment. We assume that mental representations are developed using inborn cognitive mechanisms for creating internal information units operated on a continuous bases for the internal ‘language of thought’ and the external ‘language of communication’. We consider that the underlying mental processing is self-centered and uses inborn operations such as ‘projection of the actor’ and ‘mirroring’. We discuss the four levels of cognitive apparatus related to the language faculty (perceptual, syntactic, semantic, and communicative). Language development relies on species-specific mental operations that comply with the general laws of efficient growth in biological systems, the laws that account for both the effective reiteration of the minimal meaningful unit in syntax and the semantics of concept formation.

Keywords: brain activity, fMRI, language, semantic space, concept, syntax, semantics

ACM classification keywords I.2.0: AI General I.2.7: Natural Language Processing

Link:

ON MENTAL REPRESENTATIONS: LANGUAGE STRUCTURE AND MEANING REVISED

Velina Slavova, Alona Soschen

http://www.foibg.com/ijita/vol22/ijita22-04-p02.pdf

Abstract: An original algorithm for numbering large datasets by means of Natural Language Addressing (NLA) is presented in the paper. We use a counter to number different instances and store its current value in the container NL-addressed by the instance. If the instance is repeated, from this NL-address we receive its already assigned number. The algorithm is implemented in an experimental program RDFArM for storing large RDF-datasets. The provided experiments have shown that NL-access time for one instance (triple or quadruple) does not depend on the number of already stored instances from the dataset. This is very important for storing Big Data.

Keywords: Natural Language Addressing, Big Data, Numbering Large Datasets

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

Link:

ALGORITHM FOR QUICK NUMBERING OF LARGE VOLUMES OF DATA

Krassimira Ivanova

http://www.foibg.com/ijita/vol22/ijita22-04-p01.pdf

Abstract: The article describes the development of a software library for ontological metadata inclusion into modern office documents formats. The model of the document used for indexing its content by ontology concepts is given. Existing projects addressed for similar problems are overviewed.

Keywords: ontology; semantic indexing, document formats.

ACM Classification Keywords: I.2 Artificial Intelligence: I.2.11 Distributed Artificial Intelligence; I.7 Document and Text Processing: I.7.2 Document Preparation; I.7.3 Index Generation.

Link:

INTEGRATION OF ONTOLOGY RESOURCES INTO OPEN FORMAT DOCUMENTS FOR SEMANTIC INDEXING

Viacheslav Lanin

http://www.foibg.com/ijitk/ijitk-vol09/ijitk09-04-p06.pdf

Abstract: One of the most popular areas of unmanned aerial vehicles (UAV) use is the monitoring of roads and highways. UAVs are considered to be a low-cost and rapidly growing platform that can provide effective mechanisms for data collection and processing, especially in case of long distances. In this paper a new method for automated road monitoring with the help of UAV is offered. The method is suitable for determining image areas, where the heterogeneity compared with the general road structure is spotted. Also, algorithms for finding road cover from video shots and for determining the direction of the road are offered. The method is applicable for automated control of UAVs in order to find and track roads, as well as registration of various types of objects on the road. All the methods and algorithms were tested on a model and the results are shown.

Keywords: image processing, road tracking, road monitoring, similarity measure, UAV

ACM Classification Keywords: Image Processing and Computer Vision

Link:

TECHNIQUE FOR ROAD AUTOMATED TRACKING WITH UNMANNED AERIAL VEHICLES

Samvel Hovsepyan

http://www.foibg.com/ijitk/ijitk-vol09/ijitk09-04-p05.pdf

Abstract: In this paper the classification of the most used load balancing methods in distributed systems (including cloud technology, cluster systems, grid systems) is described. Load balancing is represented on four levels of network model OSI: channel, network, transport, application. Features, advantages and shortcomings are presented for each level. Also strengths and weaknesses of network, transport and application levels are described. Basics of hardware based load balancing in Network Packet Broker and Application Delivery Controllers, that working on OSI layers 2-7, are described. In this work strengths and weaknesses of hardware based load balancing are shown. Basics of software based load balancing are carried out. Differences between software based load balancing and hardware based one are described too. In the work characterizations of the most used dynamic load balancing algorithms in distributed systems is described. Advantages and shortcomings of each algorithm are carried out. Load balancing uses a variety of methods and algorithms for balancing. In the work methods that are used on channel, network, transport, application levels of OSI model and available in balancers and/or can be configured on the servers are presented and analyzed. Employment, effectiveness, strengths and weaknesses of each type of the methods are described in accordance with analysis. Following methods are carried out: direct Routing, Network Address Translation, Source Network Address Translation, Transparent SNAT, SSL Termination or Acceleration, TCP/IP server load balancing, Hashing, Caching, DNS load balancing, Network Load Balancing, Proxy method, Load balancing by using redirection.

Keywords: Keywords— load balancing, distributed system, hardware and software load balancing cloud, DNS, network level, Network Address Translation, proxy.

ACM Classification Keywords: C.2.0 General – Open Systems Interconnection reference model (OSI), C.2.3 Network Operations - Network management, C.2.4 Distributed Systems - Client/server, Distributed applications

Link:

METHODS AND ALGORITHMS OF LOAD BALANCING

Igor Ivanisenko

http://www.foibg.com/ijitk/ijitk-vol09/ijitk09-04-p04.pdf