Abstract: The main goal of the research that preliminary results have been presented in this paper is to develop an agent–oriented electronic marketplace for modeling and simulation of dynamic pricing models, i.e. models in which the price of the item is allowed to fluctuate as supply and demand in a market change. The work provides an overview of forms of dynamic pricing models, with particular emphasis on auctions. After that, the main rationale behind using Multi-agent Systems approach for modeling and simulation of complex business structures has been shown. Then the development process of an electronic marketplace, including agents’ architecture as well as implementation environment selection, structure and business logic of e-marketplace have been presented. Last part of the paper comprises conclusions and further research plans.

Keywords: Agent-Based? Models, Simulation for MAS development, Agent-oriented Marketplace Design, Multi Agent Based Modeling and Simulation, Dynamic Pricing Models

ACM Classification Keywords: I. Computing Methodologies; I.2 Artificial Intelligence; I.2.11 Distributed Artificial Intelligence; Multi-Agent? Systems

Link:

AN AGENT–ORIENTED ELECTRONIC MARKETPLACE FOR MODELING AND SIMULATION OF DYNAMIC PRICING MODELS BUSINESS LOGIC

Jacek Jakieła, Paweł Litwin, Marcin Olech

http://www.foibg.com/ibs_isc/ibs-26/ibs-26-p08.pdf

Abstract: The developed technology consists of three main stages: collection of information from a search engine; sifting irrelevant information by the pre-selected features; ranking the obtained results by relevance to a user's request. The ranking model is built with the usage of inductive1 GMDH algorithms. The article describes the effectiveness investigation of the developed technology improving the search relevance of target information on the Internet compared with the Google search engines. When studying, three experiments were conducted with one search request chosen for each experiment. The search results for every request obtained from Google were subsequently processed with the developed technology. The first 100 sites from Google SERP were analyzed to compare the relevance level of Google search and that provided with our technology. Outcomes of the experiments are given in the form of circle diagrams showing the percentage of different types of sites in the search results before and after processing it using the proposed technology. The research demonstrates higher effectiveness of the proposed technology compared to Google search: the developed technology allows achieving the search relevance at the level of 80%. Application of this technology will enable more convenient and relevant search of target information on the Internet.

Keywords: Information search, target information, search engine, search relevance, inductive modeling.

ACM Classification Keywords: H.3.5 Information Search and Retrieval - Information Filtering; H.3.5 Online Information Services – Web-based Services

Link:

ENHANCED TECHNOLOGY OF EFFICIENT INTERNET RETRIEVAL FOR RELEVANT INFORMATION USING INDUCTIVE PROCESSING OF SEARCH RESULTS

Vyacheslav Zosimov, Volodymyr Stepashko, Oleksandra Bulgakova

http://www.foibg.com/ibs_isc/ibs-26/ibs-26-p07.pdf

Abstract: NL-addressing is a possibility to access information using natural language words as addresses of the information stored in the multi-dimensional numbered information spaces. For this purpose the internal encoding of the letters is used to generate corresponded co-ordinates. The tool for working in such style is named OntoArM?. Its main principles, functions and using for storing RDF graphs are outlined in this paper.

Keywords: NL-addressing, RDF graphs, ontology representations.

ACM Classification Keywords: D.4.2 Storage Management; E.2 Data Storage Representations.

Link:

STORING RDF GRAPHS USING NL-ADDRESSING

Krassimira Ivanova, Vitalii Velychko, Krassimir Markov

http://www.foibg.com/ibs_isc/ibs-26/ibs-26-p06.pdf

Abstract: We describe our approach to building the model of the search in libraries’ catalogues based on the fuzzy similarity relation. To construct the model we carried out an experimental search to the variants of name in the catalogs of two libraries - the German National Library and the National Library of France. The model we constructed is based on the result of our experiment.

Keywords: fuzzy similarity relation, names transliteration, authority control, library catalogs

ACM Classification Keywords: H.3.6 Library Automation H.3.3, Information Search and Retrieval, 1.5.1 Pattern recognition. Fuzzy set

Link:

BUILDING THE LIBRARY CATALOG SEARCH MODEL BASED ON THE FUZZY SIMILARITY RELATION

Liliya Vershinina, Mikhail Vershinin, Andrej Masevich

http://www.foibg.com/ibs_isc/ibs-26/ibs-26-p05.pdf

Abstract: RUBRYX is a document classifier developed in 2000s for processing large volumes of Web information. RUBRYX uses weighted sum of n-grams (n=1,2,3) extracted from a very limited number of samples (about 5-10) and takes into account their mutual position in a given text. This sophisticated algorithm proves to be very effective in classifying primary medical records presented in a free text form. In the paper we study possibilities of RUBRYX (version 2.2) on a limited document set in Spanish. These documents are medical histories related to stomach diseases. Such area should be considered as a narrow subset of medical records. The high quality of archived results (accuracy 80%-90%) allows us to recommend RUBRYX for similar applications.

Keywords: natural language processing, medical diagnostics, document classification

ACM Classification Keywords: I.2.7 Natural Language Processing

Link:

CLASSIFICATION OF PRIMARY MEDICAL RECORDS WITH RUBRYX-2: FIRST EXPERIENCE

Olga Kaurova, Mikhail Alexandrov, Ales Bourek

http://www.foibg.com/ibs_isc/ibs-26/ibs-26-p04.pdf

Abstract: Machine translation now left laboratories and became one of the practices of information service. A large number of free or partly free systems of machine translation became available in the net. Consequently, the task of their comparison and evaluation criteria arises. The paper describes the procedure of the estimation of the machine translation of text executed by different machine translation systems. The systems did translation into the Russian language of text (fragment “Communist manifesto” by Marx and Engels) from German, English and French. Students of the philological department of Saint-Petersburg? State University systematized errors of translation, tried to determine the sources of errors, and considered the possibility (or impossibility) of their elimination.

Keywords: machine translation, evaluation, teaching

ACM Classification Keywords: I.2.7 Natural Language Processing

Link:

MACHINE TRANSLATION IN THE COURSE “COMPUTER TECHNOLOGIES IN LINGUISTICS” AT THE PHILOLOGICAL DEPARTMENT OF THE SAINT-PETERSBURG UNIVERSITY

Andrei Masevich, Victor Zakharov

http://www.foibg.com/ibs_isc/ibs-26/ibs-26-p03.pdf

Abstract: Social networking tools, blogs and microblogs, user-generated content sites, discussion groups, problem reporting, and other social services have transformed the way people communicate and consume information. Yet managing this information is still a very onerous activity for both the consumer and the provider, the information itself remains passive. Traditional methods of keyword extraction from text based on predefined codified knowledge are not well suited for use in such empirical environments, and as such do little to support making this information more an active part of the processes to which it may otherwise belong. In this paper we analyse various use cases of real-time context-sensitive keyword detection methods using IBM LanguageWare? applications as example. We present a general high-performance method for exploiting ontologies to automatically generate semantic metadata for text assets, and demonstrate examples of how this method can be implemented to bring commercial and social benefits. In particular, we overview metadata-driven semantic publishing on the BBC FIFA World Cup 2010 website and the applications for social semantic desktops.

Keywords:data mining, natural language processing, recommender systems, social semantic web, graph-based methods.

ACM Classification Keywords: H.3.4 Information Storage and Retrieval: Systems and Software – information networks; H.3.5 Information Storage and Retrieval: Online Information Services – data sharing.

Link:

APPLICATION OF SOCIAL ANALYTICS FOR BUSINESS INFORMATION SYSTEMS

Alexander Troussov, D.J. McCloskey?

http://www.foibg.com/ibs_isc/ibs-26/ibs-26-p02.pdf

Abstract: The problem for existence and determination of the set of positive asymptotically stable realizations of a proper transfer function of linear continuous-time systems is formulated and solved. Necessary and sufficient conditions for existence of the set of the realizations are established. Procedure for computation of the set of realizations are proposed and illustrated by numerical examples.

Keywords: positive, stable, realization, existence, procedure, linear, continuous-time, system.

Link:

POSITIVE STABLE REALIZATIONS OF CONTINUOUS-TIME LINEAR SYSTEMS

Tadeusz Kaczorek

http://www.foibg.com/ibs_isc/ibs-26/ibs-26-p01.pdf

Abstract: The authors present a hardware implementation of the codec for rank codes. Parameters of rank code are (8,4,5). Algorithmwas implemented on FPGA Spartan 3. Code rate is 1/2. The codec operates with elements from Galois field GF(28). The device can process informational data stream up to 77 MiB/s. Proposed results should help understanding rank code structure and simplify the problemof its application.

Keywords: rank codes, codec, error correction code, weak self-orthogonal bases, rankmetric, FPGA, key equation, Euclidean algorithm, fast computing.

ACMClassification Keywords: B.2.4 High-Speed? Arithmetic

MSC: 12Y05, 65Y20, 68W35.

Link:

HARDWARE IMPLEMENTATION OF RANK CODEC

Igor Sysoev,Ernst Gabidulin

http://www.foibg.com/ibs_isc/ibs-25/ibs-25-p19.pdf

Abstract: The mechanism by which neuronal networks dynamically organize and differentiate during development is a salient issue concerning neurogenesis. This central event reflects a topological order and its metrizability. One important parameter in this process concerns the role of tremor and intrinsic electrical properties of neurons Llinàs 1988 from a different in the developmental organization of Central Nervous System (CNS), which we now would like to develop more formally. While tremor is usually considered an undesirable parameter in the generation of coordinated movement it is actually essential in efficient motor execution and reflects fundamental intrinsic neuronal electrophysiological oscillation. In addition, we propose, such intrinsic properties contribute to organize the neuronal connectivity that results in the development of internal coordinate reference systems. Thus the degree of coherence in the oscillatory activities of neuron can be interpreted as embodying a metric tensor of non-Euclidean space that produce topological order associated to CNS development.

Keywords: Degree of coherence, Metric tensor, Nervous System, Intrinsic Oscillation, Functional Geometry

Link:

METRIC TENSOR AS DEGREE OF COHERENCE IN THE DYNAMICAL ORGANIZATION OF THE CENTRAL NERVOUS SYSTEM

Sisir Roy, Rodolfo Llinás

http://www.foibg.com/ibs_isc/ibs-25/ibs-25-p18.pdf

Abstract: We consider problems to classify data represented as discrete probability distributions. For the classification we propose the Voronoi partition technique with respect to -divergence, which is a statistically justified pseudo- distance on the space of probability distributions. In order to improve computational efficiency and performance of the classification, we introduce two nonlinear transformations respectively called the escort and projective transform, and weighted -centroids. Finally we demonstrate performances of the proposed tools via simple numerical examples.

Keywords: -divergence, -Voronoi partition, Escort transformation, Projective transformation

ACM Classification Keywords: I.3.5 Computational Geometry and Object Modeling

MSC: 53A15, 68T10

Link:

GEOMETRICAL TOOLS FOR ALPHA-VORONOI PARTITIONS

Atsumi Ohara and Yuya Nagatani

http://www.foibg.com/ibs_isc/ibs-25/ibs-25-p17.pdf

Abstract: Distance geometry consists of finding an embedding of a weighted undirected graph in Rn. Since some years, we are working on suitable discretizations for this problem. Because of the discretization, the search domain is reduced froma continuous to a discrete set which has the structure of a tree. Based on this combinatorial structure, we developed an efficient branch-and-prune (BP) algorithm for the solution of distance geometry problems. In this paper, we focus on two important aspects of the discretization: the identification of suitable vertex discretizing orderings and the analysis of the symmetries that can be found in BP trees.

Keywords: distance geometry, discretization, combinatorial optimization, discretizing orderings, symmetries.

ACMClassification Keywords: G.2.1 Combinatorics - Combinatorial algorithms; B.5.2 Design Aids -Optimization; J.3 Life andMedical Sciences - Biology and genetics;

MSC: 05C85, 90C27, 51K99.

Link:

ON THE DISCRETIZATION OF DISTANCE GEOMETRY PROBLEMS

Antonio Mucherino,Carlile Lavor,Leo Liberti,Nelson Maculan

http://www.foibg.com/ibs_isc/ibs-25/ibs-25-p16.pdf

Abstract: Functions defining a distance and a distinguish degree between objects described by predicate formulas are introduced. It is proved that the introduced function of distance satisfies all properties of a distance. The function of objects distinguish degree adequately reflects similarity of objects but does not define a distance because the triangle inequality is not fulfilled for it. The calculation of the introduced functions is based on the notion of partial deduction of a predicate formula.

Keywords: artificial intelligence, pattern recognition, distance between objects, predicate calculus.

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

Link:

DISTANCE BETWEEN OBJECTS DESCRIBED BY PREDICATE FORMULAS

Tatiana Kosovskaya

http://www.foibg.com/ibs_isc/ibs-25/ibs-25-p15.pdf

Abstract: An antimatroid is an accessible set system (U,F) closed under union. Every antimatroid may be represented as a graph whose vertices are sets of F, where two vertices are adjacent if the corresponding sets are differ by one element. This graph is a partial cube. Hence an antimatroid with the ground set U of size n may be isometrically embedded into the hypercube {0, 1}n. Thus the distance on an antimatroid considered as a graph coincides with the Hamming distance. A poset antimatroid is an antimatroid, which is formed by the lower sets of a poset. We consider different definitions of the distance between elements of an antimatroid, and give a new characterization of poset antimatroids.

Keywords: antimatroid, partial cube, zigzag distance, Hamming distance.

ACM Classification Keywords: G.2

MSC: 05C12; 52B40

Link:

DISTANCES ON ANTIMATROIDS

Yulia Kempner, Vadim E. Levit

http://www.foibg.com/ibs_isc/ibs-25/ibs-25-p14.pdf

Abstract: Given two distances d and d′ defined on a finite set I, with d  d′, we characterise the set of all ultrametrics lying between d and d′ (if any), showing they are the union of finitely many intervals with a common top endpoint, the subdominant ultrametric of d′. We also provide an algorithm to compute the bottom of any interval, given by any upperminimal ultrametric of d less than d′. A series of approximations according to the supremum norm derive from this.

Keywords: ultrametric, subdominant ultrametric, upperminimal ultrametrics, approximation, supremum norm

MSC: G3: Statistics

Link:

INTERVALS AS ULTRAMETRIC APPROXIMATIONS ACCORDING TO THE SUPREMUM NORM

Bernard Fichet

http://www.foibg.com/ibs_isc/ibs-25/ibs-25-p13.pdf

Abstract: Purely geometric arguments are used to extract information from three-dimensional structures of oligomeric proteins, that are very common biological entities stably made of several polypeptidic chains. They are characterized by the presence of an interface between adjacent amino acid chains and can be investigated with the approach proposed here. We introduce a method, called symmetrization, that allows one to rank interface interactions on the basis of inter-atomic distances and of the local geometry. The lowest level of the ranking has been used previously with interesting results. Now, we need to complete this picture with a careful analysis of the higher ranks, that are for the first time introduced here, in a proper mathematical set up. The interface finds a very nice mathematical abstraction by the notion of weighted bipartite graph, where the inter-atomic distance provides the weight. Thus, our approach is partially inspired to graph theory decomposition methods but with an emphasis to “locality”, namely the idea that structures constructed by the symmetrization adapt to the local scales of the problem. This is an important issue as the known interfaces may present major differences in relation to their size, their composition and the local geometry. Thus, we looked for a local method, that can autonomously detect the local structure. The physical neighborhood is introduced by the concept of cluster of interactions. We discuss the biological applications of this ranking and our previous fruitful experience with the lowest symmetrized level. An example is given, using the prototypical cholera toxin.

Keywords: symmetrization, protein interfaces, oligomeric proteins, graphs, bonds ranking, interaction clusters.

ACM Classification Keywords: J.2 Physical sciences - Mathematics and statistics J.3 Life and medical sciences - Biology and genetics

Link:

SYMMETRIZATION: RANKING AND CLUSTERING IN PROTEIN INTERFACES

Giovanni Feverati, Claire Lesieur, Laurent Vuillon

http://www.foibg.com/ibs_isc/ibs-25/ibs-25-p12.pdf

Abstract: Universal Fechnerian Scaling (UFS) is a principled approach to computing “subjective” distances among objects (stimuli) from their pairwise discrimination probabilities. It is based on the concept of ‘dissimilarity function’ leading to a locally symmetrical quasimetric in the context of Dissimilarity Cumulation (DC) theory developed by Dzhafarov and Colonius. Here we show that, for finite sets of objects, the replacement of dissimilarity cumulation with a dissimilarity maximization procedure results in “subjective” distances satisfying the ultrametric inequality.

Keywords: Fechnerian scaling; dissimilarity function; quasimetric; ultrametric.

ACM Classification Keywords: G.2.3 Discrete Mathematics – Applications;

MSC: 54E05, 54E15, 54E35, 05C12

Link:

ULTRAMETRIC FECHNERIAN SCALING OF DISCRETE OBJECT SETS

Hans Colonius, Ehtibar N. Dzhafarov

http://www.foibg.com/ibs_isc/ibs-25/ibs-25-p11.pdf

Abstract: Maximum rank distance (MRD) codes have been used for the construction of space time block code (STBC) using a matrix method. Like orthogonal STBC’s in most popular cases, MRD-STBC’s can also achieve full diversity. Though an OSTBC is known to yield the best BER performance, a unique case is described where MRD- STBC performs better than Alamouti code (OSTBC). Moreover, the viability of Gabidulin’s decoding algorithm has been established by decoding complex symbols generated from MRD-STBC’s. Under this decoding scheme, MRD- STBC’s have been shown to be preferred candidate for higher antenna configuration as the decoding complexity of Gabidulin’s algorithm is far less than that of maximum likelihood (ML) decoding algorithm.

Keywords: Rank codes, Gaussian integers, space time block codes, orthogonal space time block codes.

MSC: 12E20

Link:

RANK CODES OVER GAUSSIAN INTEGERS AND SPACE TIME BLOCK CODES

Hafiz M.Asif, Ernst Gabidulin, Bahram Honary

http://www.foibg.com/ibs_isc/ibs-25/ibs-25-p10.pdf

Abstract: Information overload and an abundance of choices create situations where selecting one option becomes extremely difficult or even worse, a guessing game. Collaborative ranking systems address this problem by creating intelligent rankings of items based on user opinions aggregation. This paper presents a metric-based multi-criteria recommender system that can be used on non-rigid sets of criteria. These systems fare well with respect to accuracy, transparency and flexibility.

Keywords: Multi-dimensional recommender system, metric method.

ACM Classification Keywords: H.4: Information systems applications

MSC: 68N30: Mathematical aspects of software engineering

Link:

METRIC BASED RECOMMENDER SYSTEMS

Ali Akhtarzada, Cristian S. Calude, John Hosking

http://www.foibg.com/ibs_isc/ibs-25/ibs-25-p09.pdf

Abstract: A divergence function is a skew-symmetric distance like function on a manifold. In the geometric theory of statistical inference, such a divergence function is useful. In complex systems, Tsallis anomalous statistics is developing rapidly. A q-exponential family is an important statistical model in Tsallis statistics. For this q-exponential family, a divergence function is constructed from the viewpoint of affine differential geometry.

Keywords: information geometry, affine differential geometry, Tsallis statistics, divergence, q-exponential family

ACM Classification Keywords: G.0 General

MSC: 53A15, 62B10, 53A30

Link:

CONSTRUCTION OF GEOMETRIC DIVERGENCE ON q-EXPONENTIAL FAMILY

Hiroshi Matsuzoe

http://www.foibg.com/ibs_isc/ibs-25/ibs-25-p08.pdf

Abstract: Corresponding to each regular asymptotic polytope P in hyperbolic n-space Hn is an isomorphic figure °P in inversive (n1)-space In−1 having many related metric properties. A regular inversive polytope °P has a

Abstract: The main objects of Coding theory are metric vector or matrix spaces. Subsets of spaces are known as codes. The main problem is constructing codes of given pairwise distance and having maximal cardinality. Most known and most investigated spaces are Hamming spaces. Thousands papers and books are devoted to codes in the Hamming metric. We mention here only two books 1; 2 and will not consider this metric in details. Other metrics are investigated much less. In this paper, we give many examples of useful metrics. It is still non exhaustive review.

Keywords: metrics and norms, the uniform and non-uniform Hamming metrics, the Lee and Sharma-Kaushik? metrics, the city block (Manhattan) metric, the Varshamov metric, the burst metric, the 2-dimensional burst metric, the term rank metric, the rank metric, combinatorial metrics, projective metrics, graph metrics, the subspace metric.

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

MSC: 94B05, 94B20, 94B25

Link:

A BRIEF SURVEY OF METRICS IN CODING THEORY

Ernst Gabidulin

http://www.foibg.com/ibs_isc/ibs-25/ibs-25-p06.pdf

Abstract: The main purpose of this paper is to popularize Danzer’s power complex construction and establish some new results about covering maps between two power complexes. Power complexes are cube-like combinatorial structures that share many structural properties with higher-dimensional cubes and cubical tessellations on manifolds. Power complexes that are also abstract polytopes have repeatedly appeared somewhat unexpectedly in various contexts, although often under a different name. However, the non-polytope case is largely unexplored.

Keywords: cube; cubical tessellation; abstract polytope; incidence complex; covering.

MSC (2000): Primary: 51M20. Secondary: 52B15.

Link:

CUBE-LIKE POLYTOPES AND COMPLEXES

Andrew Duke, Egon Schulte

http://www.foibg.com/ibs_isc/ibs-25/ibs-25-p05.pdf

Abstract: We showthat the cone ofweighted n-point quasi-metricsWQMetn, the cone ofweighted quasi-hypermetrics WHypn and the cone of oriented cuts OCutn are projections along an extreme ray of the metric cone Metn+1, of the hypermetric cone Hypn+1 and of the cut cone Cutn+1, respectively. This projection is such that if one knows all faces of an original cone then one knows all faces of the projected cone.

Keywords: distance, metrics, hypermetrics, cutmetrics, quasi-metrics.

MSC: 52B12, 51F99, 90C57

Link:

CONES OF WEIGHTED QUASIMETRICS,WEIGHTED QUASIHYPERMETRICS AND OF ORIENTED CUTS

Michel Deza,Vyacheslav P.Grishukhin,Elena Deza

http://www.foibg.com/ibs_isc/ibs-25/ibs-25-p04.pdf

Abstract: The walk distances in graphs are defined as the result of appropriate transformations of the P1 k=0(tA)k proximity measures, where A is the weighted adjacency matrix of a graph and t is a sufficiently small positive parameter. The walk distances are graph-geodetic; moreover, they converge to the shortest path distance and to the so-called long walk distance as the parameter t approaches its limiting values. Furthermore, the logarithmic forest distances which are known to generalize the resistance distance and the shortest path distance are a specific subclass of walk distances. On the other hand, the long walk distance is equal to the resistance distance in a transformed graph.

Keywords: graph distances, walk distances, logarithmic forest distances, transitional measure, Laplacian matrix, resistance distance, network

ACM Classification Keywords: G.2.2 Graph Theory – Network problems; E.1 Data Structures – Graphs and networks; C.2.1 Network Architecture and Design – Network topology

Link:

LOGARITHMIC DISTANCES IN GRAPHS

Pavel Chebotarev

http://www.foibg.com/ibs_isc/ibs-25/ibs-25-p03.pdf