Abstract: The idea of subpixel feature detection is widely used in image processing area in these days and it has a high significance in many practical applications. This paper deals with impact of subpixel paradigm on accuracy of 3D coordinates determination using information related to corresponding 2D image pairs. In the other worlds, there is a study how the subpixel corner points detection could influence the accuracy of 3D reconstruction. For that reason our work contains this comparison for image pairs having various mutual position and resolution using data from given datasets. This contribution could answer the question if the paradigm of subpixel detection could be useful in VSLAM methods and other practical tasks where the precision is a key.

Keywords: subpixel corner detection, 3D scene reconstruction, accuracy comparison

ACM Classification Keywords: I.4.8 Scene Analysis - stereo

Link:

IMPACT OF SUBPIXEL PARADIGM ON DETERMINATION OF 3D POSITION FROM 2D IMAGE PAIR

Lukas Sroba, Rudolf Ravas

http://www.foibg.com/ijicp/vol01/ijicp01-02-p07.pdf

Abstract: The current state and trends in the area of dynamic intelligent systems are analyzed. The first experimental results obtained in the development of certain provisions and components of the task-oriented methodology for the integrated expert systems construction during the transition to unformalized problems in dynamic areas of concern solving are considered. State and tendencies of evolution of modern development tools for static and dynamic expert systems development are being analyzed. New facilities of unique Russian instruments for support of integrated expert systems development – the AT-TECHNOLOGY workbench – connected with dynamic integrated expert systems development are in question.

Keywords: dynamic intelligent system, dynamic integrated expert systems, task-oriented methodology, ATTECHNOLOGY workbench, development tools real time, simulation modeling, temporal reasoning, temporal reasoner.

ACM Classification Keywords: I.2.1 Applications and Expert Systems; I.2.5 Programming Languages and Software

Link:

DYNAMIC INTEGRATED EXPERT SYSTEMS: THE EVOLUTION OF AT-TECHNOLOGY WORKBENCH

Galina Rybina, Victor Rybin

http://www.foibg.com/ijicp/vol01/ijicp01-02-p06.pdf

Abstract: The article reveals an approach to modelling of the cognitive ability managing the focus of attention (an ability to switch one's attention) which is based on the reflexive mechanisms developed in “OntoIntegrator” system. There were considered basic experiments to classify the mathematical texts, and demonstrated the reflection mechanisms for the solution of a set task.

Keywords: ontology, reflection, attention switch, ontological mark-up of the text

ACM Classification Keywords: H.3 INFORMATION STORAGE AND RETRIEVAL H.3.1 Content Analysis and Indexing - Linguistic processing

Link:

AN APPROACH TO THE MODELING OF THE COGNITIVE ABILITY MANAGING THE FOCUS OF ATTENTION ON THE BASIS OF THE REFLEXIVE MECHANISM OF THE SYSTEM

Olga Nevzorova, Vladimir Nevzorov

http://www.foibg.com/ijicp/vol01/ijicp01-02-p05.pdf

Abstract: Let ܥ be a collection of objects, characterized by the set ܣ = {ܽଵ,⋯,ܽ௡} of binary attributes. We consider problems of the following type: given an object-characterization table, it is to check if there exists a subset ܯ in ܥ of a given size, such that each attribute of A is satisfied by a given number of objects in ܯ. Additional restriction may be applied such as - the number of matches of each object in ܯ is limited. In this paper we investigate particular cases of the general problem, and consider approximation solutions by means of binary classification trees.

Keywords: Classification tree, covering, greedy algorithm.

ACM Classification Keywords: F.2.2 Nonnumerical Algorithms and Problems

Link:

CONSTRAINED OBJECT-CHARACTERIZATION TABLES AND ALGORITHMS1

Hasmik Sahakyan

http://www.foibg.com/ijicp/vol01/ijicp01-02-p04.pdf

Abstract: The tasks that encloses the Semantic Web often requires semantic comparisons between classes, properties, relations and instances, that mainly consist in semantic similarity. As a consequence, the number of similarity functions used in this field has greatly increased in the last years. However, the selection of the best similarity functions to use in each case is a difficult task usually guided by heuristics and intuition. To overcome this problem, in this paper we propose a taxonomy of similarity functions as a first step to a semantic catalog of similarity functions. This taxonomy is induced by another taxonomy of data types. Our taxonomy allows selecting the similarity functions applicable to a pair of entities based on the data type used to represent them. It also eases the composition of functions according the composition of data types, and supports the inheritance of applicable functions from the more abstract to the more specific data types. As a consequence, it facilitates the application of similarity functions in an automated way. Finally, we also populate this taxonomy with some of the most popular similarity functions used in Semantic Web.

Keywords: Semantic Web, semantic comparison, similarity measures

ACM Classification Keywords: 1.5.4 Pattern recognition applications. I.2.4 Knowledge Representation Formalisms and Methods.

Link:

TOWARDS A SEMANTIC CATALOG OF SIMILARITY MEASURES

Alfredo Sánchez-Alberca?, Rafael Lahoz-Beltra? and Juan Castellanos-Peñuela?

http://www.foibg.com/ijicp/vol01/ijicp01-02-p03.pdf

Abstract: In the paper the development of operating technique for matrices Euclidean spaces is represented. Particularly, within such development transfer of linear operators’ technique with preserving properties of closely correspondence to natural subspaces is represented. Also - spectral results, SVD – and Moore – Penrose Pseudo Inverse – technique, theory of orthogonal projectors and grouping operators. Besides, solution of the linear discrimination problem in Euclidean spaces of matrices is represented in the paper. Realization the program of empowering the operating technique in matrices Euclidean space made possible on the basis of putting in circulation of so-called "cortege operators” and, correspondingly - "cortege operations”.

Keywords: Feature vectors, matrix corteges operators, Single Valued Decomposition for cortege linear operators, linear discrimination.

ACM Classification Keywords: G.2.m. Discrete mathematics: miscellaneous, G.2.1 Combinatorics; G.3 Probability and statistics, G.1.6. Numerical analysis, I.5.1.Pattern Recognition; H.1.m. Models and Principles: miscellaneous.

Link:

SPREADING THE MOORE - PENROSE PSEUDO INVERSE ON MATRICES EUCLIDEAN SPACES: THEORY AND APPLICATIONS

Volodymyr Donchenko, Fedir Skotarenko

http://www.foibg.com/ijicp/vol01/ijicp01-02-p02.pdf

Abstract: Social behavior is mainly based on swarm colonies, in which each individual shares its knowledge about the environment with other individuals to get optimal solutions. Such co-operative model differs from competitive models in the way that individuals die and are born by combining information of alive ones. This paper presents the particle swarm optimization with differential evolution algorithm in order to train a neural network instead the classic back propagation algorithm. The performance of a neural network for particular problems is critically dependant on the choice of the processing elements, the net architecture and the learning algorithm. This work is focused in the development of methods for the evolutionary design of artificial neural networks. This paper focuses in optimizing the topology and structure of connectivity for these networks.

Keywords: Social Intelligence, Neural Networks, Grammatical Swarm, Particle Swarm Optimization, Learning Algorithm.

ACM Classification Keywords: F.1.1 Theory of Computation - Models of Computation, I.2.6 Artificial Intelligence - Learning.

Link:

Polynomial Regression using a Perceptron with Axo-axonic Connections

Nuria Gómez Blas, Luis F. de Mingo, Alberto Arteta

http://www.foibg.com/ijicp/vol01/ijicp01-02-p01.pdf

Abstract: Many artificial intelligence problems are NP-complete ones. To increase the needed time of such a problem solving a method of extraction of sub-formulas characterizing the common features of objects under consideration is suggested. Repeated application of this procedure allows forming a level description of an object and of classes of objects. A model example of such a level description and the degree of steps number increasing is presented in the paper.

Keywords: artificial intelligence, pattern recognition, predicate calculus, complexity of an algorithm, level description of a class.

ACM Classification Keywords: I.2.4 Artificial Intelligence Knowledge Representation Formalisms and Methods – Predicate logic, I.5.1 Pattern Recognition Models – Deterministic, F.2.2 Non numerical Algorithms and Problems – Complexity of proof procedures.

Link:

CONSTRUCTION OF CLASS LEVEL DESCRIPTION FOR EFFICIENT RECOGNITION OF A COMPLEX OBJECT

Tatiana Kosovskaya

http://www.foibg.com/ijicp/vol01/ijicp01-01-p11.pdf

Abstract: We present results of a study of the information about the medieval maps and travellers’ geographic descriptions of Turkey. It is based on Ian Manners’ monograph “European Cartographers and the Ottoman World 1500-1750” (University of Chicago, 2007). The obtained chronological distributions show some peculiarities; we discuss one of them.

Keywords: chronological distribution of information, ottoman world 1500-1750, maps, Little Ice Age

ACM Classification Keywords: I.6 SIMULATION AND MODELLING, I.6.3 Applications

Link:

CHRONOLOGICAL MODELLING OF THE WEST – EUROPEAN INFORMATION ABOUT THE MEDIEVAL MAPS OF THE OTTOMAN WORLD 16TH-18TH CENTURIES

Jordan Tabov, Galina Panayotova

http://www.foibg.com/ijicp/vol01/ijicp01-01-p10.pdf

Abstract: The article describes three different approaches to verification of one of the most frequently used UMLdiagrams – the sequence diagram. It indicates that these methods allow estimating its correctness only in certain aspects, and complex application of these approaches is the most effective way.

Keywords: verification, digital machine, driver, UML-diagram, record, correctness, sequence diagram.

Link:

FORMAL VERIFICATION OF THE SEQUENCE DIAGRAM

Vitaliy Lytvynov, Irina Bogdan

http://www.foibg.com/ijicp/vol01/ijicp01-01-p09.pdf

Abstract: The problem of MPLS networks structural synthesis is considered. The various modifications of Genetic Algorithms (GA) are investigated for this problem solution which differs in implementation of crossover and mutation procedures. The most adequate version of GA was elaborated and its investigations were carried out. The application to suggested GA for real problem of topological optimization of MPLS network is presented.

Keywords: MPLS network, Genetic algorithms, structure synthesis

ACM Classification Keywords: A.0 General Literature - Conference proceedings National Information Technologies NIT 2013

Link:

MPLS NETWORK STRUCTURAL SYNTHESIS WITH APPLICATION OF MODIFIED GENETIC ALGORITHM

Yuriy Zaychenko, Helen Zaychenko

http://www.foibg.com/ijicp/vol01/ijicp01-01-p08.pdf

Abstract: Currently digital video are widely used in various fields of science and technology and in human daily activities. Intensively growing and already existing huge amount of digital video data need to be managed, so the shot boundary detection is the first and important step for content-based video retrieval and indexing. Each algorithm aimed for this approach should accurately detect boundaries between camera shots and do a segmentation of a video. In this paper a new method of abrupt transitions detection is proposed, based on Weibull distribution of each frame's gradient magnitude. Experimental results successfully show that it can effectively detect hard cuts and has certain advantages against widely used other methods, which are using image pixels point-by-point comparison method.

Keywords: segmentation, cut detection, similarity measure, Weibull distribution.

ACM Classification Keywords: Image Processing and Computer Vision

Link:

IMPROVED ALGORITHM FOR VIDEO SHOT DETECTION

David Asatryan, Manuk Zakaryan

http://www.foibg.com/ijicp/vol01/ijicp01-01-p07.pdf

Abstract: The significant increase in number of information sources unfavorable affects on traditional foresight techniques not directly adapted to big data era. Without automation of knowledge processing the quality of final foresight product is significally dependent on human (experts, analytics) abilities. In the article the new process workflow is proposed using text analytics tools to support all stages of foresight. The proposed advanced model of fact extraction with modified rules is based on new workflow, which includes marking data with additional metadata, using automated classification and sentiment extraction techniques, data quality improving steps in addition to quantitative and qualitative analysis of data. The modified rule based model of knowledge extraction adapted to used toolkit is presented. Given approach were tested on supporting of foresight process in domain of agricultural development of Crimea region.

Keywords: foresight, decision making, textual analytics, sentiment analysis, knowledge society, data mining, DSS.

ACM Classification Keywords: H.5.3 Group and Organization Interfaces - Computer-supported cooperative work

Link:

FORESIGHT PROCESS BASED ON TEXT ANALYTICS

Nataliya Pankratova, Volodymyr Savastiyanov

http://www.foibg.com/ijicp/vol01/ijicp01-01-p06.pdf

Abstract: Modeling of reasoning in intelligent systems on the example of intelligent decision support system of real time by means of integration of methods based on case-based reasoning (accumulated experience) and inductive notion formation in the presence of noisy data are considered.

Keywords: intelligent decision support system, real time, plausible reasoning, modeling, case-based, inductive notion formation, noisy data.

Link:

MODELING OF REASONING IN INTELLIGENT DECISION SUPPORT SYSTEMS BY INTEGRATION OF METHODS BASED ON CASE-BASED REASONING AND INDUCTIVE NOTIONS FORMATION

Alexander Eremeev, Marina Fomina

http://www.foibg.com/ijicp/vol01/ijicp01-01-p05.pdf

Abstract: The article describes the algorithmic implementation of information technology for translation from inflectional languages to sign language. For example info logical model of Ukrainian dictionary and sign language, related generalized grammatical constructions for automatic translation are built. The experimental results to verify the effectiveness of the proposed information technology are represented.

Keywords: Automated translation, sign language, inflectional language.

Link:

AUTOMATED TRANSLATION FROM INFLECTIONAL LANGUAGES TO SIGN LANGUAGES

Olexandr Barmak, Iurii Krak, Sergii Romanyshyn

http://www.foibg.com/ijicp/vol01/ijicp01-01-p04.pdf

Abstract: The problems extraction knowledge from natural language text is considered. An automatization approach to extraction knowledge is proposed.

Keywords: automatically analysis of natural languages text, extraction of knowledge.

ACM Classification Keywords: I.2 ARTIFICIAL INTELLIGENCE – I.2.4 Knowledge Representation Formalisms and Methods.

Link:

ANALYSIS AND PROCESSING OF THE TEXT INFORMATION AIMED AT EXTRACTING BASIC KNOWLEDGE

Kryvyi Sergii, Bibikov Dmitriy

http://www.foibg.com/ijicp/vol01/ijicp01-01-p03.pdf

Abstract: In recent decades, an increasing variety of research fields are converging into information science conceptualizations. They are accompanied by astounding new uses of knowledge and even more astounding social transformations that revolve around information technologies. Whether a robust information science will finally emerge may not only depend on successful discussions about the philosophy of information and the social impact of the new technologies. The most important adjustment to make is about framing a “new way of thinking” or new perspective about information science itself: an inner philosophy interconnecting research practices in fundamental areas of the new science. Like in the historical birth of other major sciences, the empirical, comparative understanding of informational phenomena and informational entities should take place first. Further, a naturalistic perspective, biologically inspired, would help in determining what model systems should be adopted for advancing the comparative study of informational entities. Rather than attempting ill-fated definitions is information definable at all? or closely remaining within the confines of information theory, a naturalistic, empirically oriented strategy offers room for advancement. In the end, crafting a great scientific domain around information science –rather than around computing – should be a common goal for the scholars and researchers both from natural sciences and engineering and from social sciences involved in these new studies.

Keywords: Information Flow, Cell Production, Communication, Information Science,

ACM Classification Keywords: Theory

Link:

A NEW APPROACH TO INFORMATION SCIENCE: FRAMING A NATURALISTIC PERSPECTIVE

Jorge Navarro, Raquel del Moral & Pedro C. Marijuán

http://www.foibg.com/ijicp/vol01/ijicp01-01-p02.pdf

Abstract: The privacy preserving computation research area is considered. The problem appear when one party have confidential data and need to do intense computations over that data, and computations will be done by the second party, which may be supposed being untrusted. So the content of the raw data should be kept private from the second party during the computations. Therefore these data are to be encrypted before sending them to the second party. Two possible solution scenarios are considered – one in physical and the second in theoretical levels. Physical level solution assumes some hardware integration and reorganizations. Theoretical level solution is based on cryptographic approach (homomorphic encryption).The main idea is to encrypt data in such a way that the owner, after getting the results of computations over the encrypted data, will be able to get the results on original data only by decrypting the received results. The paper brings description and analyzes of such known schemas. The final outcome is that practical cryptographic tools today are really not ready to be applied on privacy preserving computations, so that the way of solution is the use of heuristic data analyses models and algorithms that replace original data with synthesized data. Considering preparatory, this article is followed by the base research part where synthetic data generation is considered on base of CART algorithm and clustering type computational algorithms.

Keywords: Privacy preserving computations, homomorphic encryption, synthetic data generation.

ACM Classification Keywords: H.1 Information Systems – Models and principles, I.2.0 Artificial intelligence.

Link:

BRIEF ANALYZIS OF TECHNIQUE FOR PRIVACY PRESERVING COMPUTATION1

Levon Aslanyan, Vardan Topchyan, Haykaz Danoyan

http://www.foibg.com/ijicp/vol01/ijicp01-01-p01.pdf

Abstract: There were considered main approaches, methods and features of energy consumption forecasting and creating program complex of a regional model of environmental of wholesale electricity in Russian federation.

Keywords: modeling and forecasting of energy consumption, the program complex, information-analytical systems, econometric modeling.

ACM Classification Keywords: H. Information Systems. H.4 Information Systems Applications: H.4.2 Types of Systems – Decision support (e.g., MIS).

Link:

Program complex of regional models of electricity consumption for the Russian Federation

Galina Starkova, Natalia Frolova

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

Abstract: An axiomatic approach to solve the problem of narrowing the Pareto set based on some numerical information regarding preferences of the decision maker is considered. This approach has been developed by the author since 1983. It requires the acceptance of certain four axioms of "reasonable" behavior of the Decision Maker during the decision making process. It is assumed that in addition to the axioms some information regarding the Decision Maker’s preferences (the so-called "quanta" of information) is known. Using this information it is possible to reduce the Pareto set and thereby facilitate subsequent selection of solutions. We analyze a class of multicriteria choice problems for which this approach can be applied, as well as discuss of possible directions for its generalization.

Key words: Pareto set, multicriteria choice, Pareto set reducing

ACM Classification Keywords: F.4.3 – Decision problems

Link:

Generalized Axiomatic Approach to the Pareto Set Narrowing

Vladimir Noghin

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

Abstract: Earlier, in the framework of our previous papers, we introduced a criterion for comparing interval alternatives, which was called the assurance factor. It is based on the balance of chances that hypothesis on preference for one of the compared alternatives is true and the risks associated with the possible truth of the opposite hypothesis. The criterion is dimensionless that is not similar to other criteria used for this purpose. In this paper this criterion and its calculation method are proposed to use for analysis of the most important from a practical point of view problems of forecasting the expected effectiveness of the individual alternatives. Numerical procedures have been developed to calculate the values of the assurance factor in the case of arbitrary distribution on the analyzed interval alternative. Analytical expressions were also found for the uniform and triangular distributions. Comparison of the results was produced for evaluating the expected effectiveness of interval alternatives on the proposed criterion and on base of other evaluation criteria (mean value, Hurwicz criterion). The arguments presented in favor of adequacy of the proposed criterion for problems of forecasting both expected efficiency of interval alternatives and comparison of alternatives on preference. The possibility harmonizing of results comparing alternatives and evaluating their expected efficiency based on Hurwicz criterion and on the assurance factor was considered. Relation of the assurance factor with "pessimism - optimism" coefficient was received. On this basis we analyze the question concerning substantiation of the choice of Hurwicz criterion values. Using ordinal scales in the process of comparing alternatives and evaluating their expected effectiveness on base of the assurance factor is proposed.

Keywords: estimating expected efficiency of interval alternatives, criterion estimating efficiency, comparing different criteria of efficiency

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

Link:

Evaluating Expected Effectiveness of Interval Alternatives

Gennady Shepelev, Mikhail Sternin

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

Abstract: In the paper a multicriteria problem of lexicographic optimization with convex functions of the criteria on the feasible set described by linear restrictions is considered. One of the possible approaches to the solution of the multicriteria problem of lexicographic optimization is suggested. The approach combines the ideas of methods of feasible directions and linearization. A solution algorithm has been built and proved; some illustrating examples have been given.

Keywords: multicriteria problem, vector criterion, lexicographic optimization, feasible directions, linearization

ACM Classification Keywords: G 1.6 Optimization.

Link:

Solution Algorithm of Multicriteria Problems of Lexicographic Optimization with Convex Criteria Functions

Natalia Semenova, Maria Lomaha, Victor Semenov

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

Abstract: The problem of corporations’ financial analysis and creditability forecasting under uncertainty and risk is considered. The classical scoring method is described. The application of fuzzy neural networks with algorithms of Mamdani and Tsukamoto for enterprises creditability analysis and forecasting is suggested. Fuzzy rules base for NFNs was developed. The experimental investigations of NFNs in the problem creditability forecasting were carried, their efficiency estimated and compared with scoring method.

Keywords: creditability, forecasting, financial analysis, fuzzy neural networks, scoring method

Link:

Financial analysis and creditability estimation of borrowers – corporations under uncertainty

Yuriy Zaychenko, Ovi Nafas Aghaei Agh Ghamish

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

Abstract: New ant colony optimization algorithm has been investigated. Optimal search tactic and ant decision making criterion have been found.

Keywords: Ant colony optimization algorithm, travelling salesman problem, salesman problem

ACM Classification Keywords: G Mathematics of computing – G.2 Discrete mathematics – G.2.2 Graph theory – Graph algorithms, Network problems; I Computing Methodologies – I.2. Artificial Intelligence – I.2.8 Problem Solving, Control Methods and Search – Graph and tree search strategies

Link:

Criteria investigations in ant colony optimization algorithm for travelling salesman problem

Yuriy Zaychenko, Nicholas Murga

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

Abstract: The paper describes an approach to multicriteria choice of computing complex using a multi-stage technology for sequential reducing the dimension of the criteria space. Several hierarchical systems of composite criteria, which aggregate initial characteristics of complex in a single integral index of prospectivity, were built using the methods of verbal decision analysis. The proposed approach allows to simplify the procedure of multicriteria comparisons and choices of options, reduce the complexity of the procedure, select the most preferred option and assess the quality of the selection.

Keywords: multicriteria choice, verbal decision analysis, reducing the dimension of the attribute space, attribute aggregation, integral index, computing complex

ACM ClYsification? Keywords: A.0 General Literature - Conference proceedings

Link:

Selection of Computing Complex by Integral Index of Prospectivity

Alexey Petrovsky, Vasiliy Lobanov, Alla Zaboleeva-Zotova?, Tatiana Shitova

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