|
SECOND ATTEMPT TO BUILD A MODEL OF THE TIC-TAC-TOE GAME 1
By: Dimiter Dobrev
(3606 reads)
Rating:
(1.00/10)
|
Abstract: We want to make a program which can play any game or in other words we want to make AI. It is
impossible to include in this program the rules of all games and that is why our program should be able to find
these rules by itself. We cannot solve this problem in the general case. So, our first task will be to make a
program which is able to find the rules of the Tic-Tac-Toe? game. Even this task is too complicated. So, first we
will try to find these rules manually and this will help us make a program which is able to find these rules
automatically.
Keywords: Artificial Intelligence, Games, Automated reasoning.
ACM Classification Keywords: I.2.0 Artificial Intelligence - Philosophical foundations
Link:
SECOND ATTEMPT TO BUILD A MODEL OF THE TIC-TAC-TOE GAME 1
Dimiter Dobrev
http://www.foibg.com/ibs_isc/ibs-02/IBS-02-p19.pdf
|
DERIVATION OF CONTEXT-FREE STOCHASTIC L-GRAMMAR RULES ...
By: Robertas Damaševičius
(4234 reads)
Rating:
(1.00/10)
|
Abstract: Formal grammars can used for describing complex repeatable structures such as DNA sequences. In
this paper, we describe the structural composition of DNA sequences using a context-free stochastic L-grammar.
L-grammars are a special class of parallel grammars that can model the growth of living organisms, e.g. plant
development, and model the morphology of a variety of organisms. We believe that parallel grammars also can
be used for modeling genetic mechanisms and sequences such as promoters. Promoters are short regulatory
DNA sequences located upstream of a gene. Detection of promoters in DNA sequences is important for
successful gene prediction. Promoters can be recognized by certain patterns that are conserved within a species,
but there are many exceptions which makes the promoter recognition a complex problem. We replace the
problem of promoter recognition by induction of context-free stochastic L-grammar rules, which are later used for
the structural analysis of promoter sequences. L-grammar rules are derived automatically from the drosophila and
vertebrate promoter datasets using a genetic programming technique and their fitness is evaluated using a
Support Vector Machine (SVM) classifier. The artificial promoter sequences generated using the derived Lgrammar
rules are analyzed and compared with natural promoter sequences.
Keywords: stochastic context-free L-grammar, DNA modeling, machine learning, data mining, bioinformatics.
ACM Classification Keywords: F.4.2 Grammars and Other Rewriting Systems; I.2.6 Knowledge acquisition; I.5
Pattern recognition; J.3 Life and medical sciences.
Link:
DERIVATION OF CONTEXT-FREE STOCHASTIC L-GRAMMAR RULES
FOR PROMOTER SEQUENCE MODELING USING SUPPORT VECTOR MACHINE
Robertas Damaševičius
http://www.foibg.com/ibs_isc/ibs-02/IBS-02-p13.pdf
|
SIMULTANEOUS CONTROL OF CHAOTIC SYSTEMS USING RBF NETWORKS
By: Castellanos et al.
(3514 reads)
Rating:
(1.00/10)
|
Abstract: Chaos control is a concept that recently acquiring more attention among the research community,
concerning the fields of engineering, physics, chemistry, biology and mathematic. This paper presents a method
to simultaneous control of deterministic chaos in several nonlinear dynamical systems. A radial basis function
networks (RBFNs) has been used to control chaotic trajectories in the equilibrium points. Such neural network
improves results, avoiding those problems that appear in other control methods, being also efficient dealing with a
relatively small random dynamical noise.
Keywords: Neural Network, Radial basis function, Backpropagation, Chaotic Dynamic Systems, Control
Feedback Methods.
ACM Classification Keywords: F.1.1 Models of Computation: Self-modifying machines (neural networks); F.1.2
Modes of Computation: Alternation and nondeterminism; G.1.7 Ordinary Differential Equations: Chaotic systems;
Link:
SIMULTANEOUS CONTROL OF CHAOTIC SYSTEMS USING RBF NETWORKS
Angel Castellanos, Rafael Gonzalo, Ana Martinez
http://www.foibg.com/ibs_isc/ibs-02/IBS-02-p04.pdf
|
AUTOMATIC GENERATION OF TITLES FOR A CORPUS OF QUESTIONS
By: Jesús Cardeñosa, Carolina Gallardo
(3542 reads)
Rating:
(1.00/10)
|
Abstract: This paper describes the followed methodology to automatically generate titles for a corpus of
questions that belong to sociological opinion polls. Titles for questions have a twofold function: (1) they are the
input of user searches and (2) they inform about the whole contents of the question and possible answer options.
Thus, generation of titles can be considered as a case of automatic summarization. However, the fact that
summarization had to be performed over very short texts together with the aforementioned quality conditions
imposed on new generated titles led the authors to follow knowledge-rich and domain-dependent strategies for
summarization, disregarding the more frequent extractive techniques for summarization.
Keywords: Summarization, text processing, subjective clustering.
ACM Classification Keywords: H.3.1 Content Analysis and Indexing
Link:
AUTOMATIC GENERATION OF TITLES FOR A CORPUS OF QUESTIONS
Jesús Cardeñosa, Carolina Gallardo
http://www.foibg.com/ibs_isc/ibs-02/IBS-02-p14.pdf
|
METHODOLOGY FOR LANGUAGE ANALYSIS AND GENERATION ...
By: Cardeñosa et al.
(3706 reads)
Rating:
(1.00/10)
|
Abstract: The best results in the application of computer science systems to automatic translation are obtained in
word processing when texts pertain to specific thematic areas, with structures well defined and a concise and
limited lexicon. In this article we present a plan of systematic work for the analysis and generation of language
applied to the field of pharmaceutical leaflet, a type of document characterized by format rigidity and precision in
the use of lexicon. We propose a solution based in the use of one interlingua as language pivot between source
and target languages; we are considering Spanish and Arab languages in this case of application.
Keywords: Controlled languages; Interlingua-based Machine Translation
ACM Classification Keywords: I.2.7 Natural Language Processing
Link:
METHODOLOGY FOR LANGUAGE ANALYSIS AND GENERATION
IN CLOSED DOMAINS: PHARMACEUTICAL LEAFLET
Jesús Cardeñosa, Carolina Gallardo, Adriana Toni
http://www.foibg.com/ibs_isc/ibs-02/IBS-02-p17.pdf
|
THE CASCADE ORTHOGONAL NEURAL NETWORK
By: Bodyanskiy et al.
(5525 reads)
Rating:
(1.00/10)
|
Abstract: in the paper new non-conventional growing neural network is proposed. It coincides with the Cascade-
Correlation Learning Architecture structurally, but uses ortho-neurons as basic structure units, which can be
adjusted using linear tuning procedures. As compared with conventional approximating neural networks proposed
approach allows significantly to reduce time required for weight coefficients adjustment and the training dataset
size.
Keywords: orthogonal activation functions, ortho-synapse, ortho-neuron, cascade orthogonal neural network.
ACM Classification Keywords: I.2.6 Learning – Connectionism and neural nets
Link:
THE CASCADE ORTHOGONAL NEURAL NETWORK
Yevgeniy Bodyanskiy, Artem Dolotov, Iryna Pliss, Yevgen Viktorov
http://www.foibg.com/ibs_isc/ibs-02/IBS-02-p02.pdf
|
OUTLIERS RESISTANT LEARNING ALGORITHM FOR RADIAL-BASIS-FUZZY-WAVELET-NEURAL ...
By: Bodyanskiy et al.
(3824 reads)
Rating:
(1.00/10)
|
Abstract: In this paper an outliers resistant learning algorithm for the radial-basis-fuzzy-wavelet-neural network
based on R. Welsh criterion is proposed. Suggested learning algorithm under consideration allows the signals
processing in presence of significant noise level and outliers. The robust learning algorithm efficiency is
investigated and confirmed by the number of experiments including medical applications.
Keywords: computational intelligence, hybrid architecture, wavelet, fuzzy-wavelet neural network, robust learning
algorithm, outliers resistant.
ACM Classification Keywords: I.2.6 Learning – Connectionism and neural nets.
Link:
OUTLIERS RESISTANT LEARNING ALGORITHM FOR RADIAL-BASIS-FUZZY-WAVELET-NEURAL NETWORK
IN STOMACH ACUTE INJURY DIAGNOSIS TASKS
Yevgeniy Bodyanskiy, Oleksandr Pavlov, Olena Vynokurova
http://www.foibg.com/ibs_isc/ibs-02/IBS-02-p07.pdf
|
IMPLEMENTATION OF A HEURISTIC METHOD OF DECOMPOSITION ...
By: Arkadij Zakrevskij, Nikolai Toropov
(3108 reads)
Rating:
(1.00/10)
|
Abstract: An original heuristic algorithm of sequential two-block decomposition of partial Boolean functions is
researched. The key combinatorial task is considered: finding of suitable partition on the set of arguments, i. e.
such one, on which the function is separable. The search for suitable partition is essentially accelerated by
preliminary detection of its traces. Within the framework of the experimental system the efficiency of the algorithm
is evaluated, the boundaries of its practical application are determined.
Keywords: Partial Boolean Functions, Heuristic Method of Decomposition
ACM Classification Keywords: B.6. Combinational logic, switching theory, automatic synthesis, optimization.
Link:
IMPLEMENTATION OF A HEURISTIC METHOD OF DECOMPOSITION
OF PARTIAL BOOLEAN FUNCTIONS
Arkadij Zakrevskij, Nikolai Toropov
http://www.foibg.com/ibs_isc/ibs-01/IBS-01-p08.pdf
|
SEQUENCING JOBS WITH UNCERTAIN PROCESSING TIMES ...
By: Yuri Sotskov, Natalja Egorova
(3548 reads)
Rating:
(1.00/10)
|
Abstract: We consider an uncertain version of the scheduling problem to sequence set of jobs J on a single
machine with minimizing the weighted total flow time, provided that processing time of a job can take on any real
value from the given closed interval. It is assumed that job processing time is unknown random variable before
the actual occurrence of this time, where probability distribution of such a variable between the given lower and
upper bounds is unknown before scheduling. We develop the dominance relations on a set of jobs J. The
necessary and sufficient conditions for a job domination may be tested in polynomial time of the number n = |J|
of jobs. If there is no a domination within some subset of set J, heuristic procedure to minimize the weighted total
flow time is used for sequencing the jobs from such a subset. The computational experiments for randomly
generated single-machine scheduling problems with n ≤ 700 show that the developed dominance relations are
quite helpful in minimizing the weighted total flow time of n jobs with uncertain processing times.
Keywords: Scheduling, robustness and sensitivity analysis.
ACM Classification Keywords: F.2.2 Nonnumerical algorithms and problems: Sequencing and scheduling.
Link:
SEQUENCING JOBS WITH UNCERTAIN PROCESSING TIMES
AND MINIMIZING THE WEIGHTED TOTAL FLOW TIME
Yuri Sotskov, Natalja Egorova
http://www.foibg.com/ibs_isc/ibs-01/IBS-01-p12.pdf
|
MINIMIZATION OF REACTIVE PROBABILISTIC AUTOMATA
By: Olga Siedlecka
(3171 reads)
Rating:
(1.00/10)
|
Abstract: The problem of finite automata minimization is important for software and hardware designing. Different
types of automata are used for modeling systems or machines with finite number of states. The limitation of
number of states gives savings in resources and time. In this article we show specific type of probabilistic
automata: the reactive probabilistic finite automata with accepting states (in brief the reactive probabilistic
automata), and definitions of languages accepted by it. We present definition of bisimulation relation for
automata's states and define relation of indistinguishableness of automata states, on base of which we could
effectuate automata minimization. Next we present detailed algorithm reactive probabilistic automata’s
minimization with determination of its complexity and analyse example solved with help of this algorithm.
Keywords: minimization algorithm, reactive probabilistic automata, equivalence of states of automata,
bisimulation relation.
ACM Classification Keywords: F. Theory of Computation, F.1 Computation by Abstract Devices, F.1.1 Models
of Computation, Automata; F.4 Mathematical logic and formal languages, F.4.3 Formal Languages
Link:
MINIMIZATION OF REACTIVE PROBABILISTIC AUTOMATA
Olga Siedlecka
http://www.foibg.com/ibs_isc/ibs-01/IBS-01-p10.pdf
|
PRIMARY AND SECONDARY EMPIRICAL VALUES IN NETWORK REDIMENSIONING
By: Emiliya Saranova
(3328 reads)
Rating:
(1.00/10)
|
Abstract: A model of an overall telecommunication network with virtual circuits switching, in stationary state, with
Bernoulli-Poisson-Pascal? (BPP) input flow, repeated calls, limited number of homogeneous terminals and 8 types
of losses is considered. One of the main problems of network redimensioning is estimation of the traffic offered in
the network because it reflects on finding of necessary number of equivalent switching lines on the basis of the
consideration of detailed users behavior and target Quality of Service (QoS).
The aim of this paper is to find a new solution of Network Redimensioning Task (NRDT) 4, taking into account
the inconvenience of necessary measurements, not considered in the previous research 5.
The results are applicable for redimensioning of every (virtual) circuit switching telecommunication system, both
for wireline and wireless systems (GSM, PSTN, ISDN and BISDN). For packet - switching networks proposed
approach may be used as a comparison basis and when they work in circuit switching mode (e.g. VoIP).
Keywords: Overall Network Traffic, Offered Traffic, Virtual Circuits Switching.
ACM Classification Keywords: C.2.1 Network Architecture and Design; C.2.3 Network Operations;
C.4 Performance of Systems.
Link:
PRIMARY AND SECONDARY EMPIRICAL VALUES IN NETWORK REDIMENSIONING
Emiliya Saranova
http://www.foibg.com/ibs_isc/ibs-01/IBS-01-p07.pdf
|
EVALUATION OF PARETO/D/1/K QUEUE BY SIMULATION
By: Seferin Mirtchev, Rossitza Goleva
(4728 reads)
Rating:
(1.00/10)
|
Abstract: The finding that Pareto distributions are adequate to model Internet packet interarrival times has
motivated the proposal of methods to evaluate steady-state performance measures of Pareto/D/1/k queues.
Some limited analytical derivation for queue models has been proposed in the literature, but their solutions are
often of a great mathematical challenge. To overcome such limitations, simulation tools that can deal with general
queueing system must be developed. Despite certain limitations, simulation algorithms provide a mechanism to
obtain insight and good numerical approximation to parameters of queues. In this work, we give an overview of
some of these methods and compare them with our simulation approach, which are suited to solve queues with
Generalized-Pareto? interarrival time distributions. The paper discusses the properties and use of the Pareto
distribution. We propose a real time trace simulation model for estimating the steady-state probability showing the
tail-raising effect, loss probability, delay of the Pareto/D/1/k queue and make a comparison with M/D/1/k. The
background on Internet traffic will help to do the evaluation correctly. This model can be used to study the longtailed
queueing systems. We close the paper with some general comments and offer thoughts about future work.
Keywords: Pareto distribution, delay system, queueing analyses, simulation model, peak traffic modelling;
ACM Classification Keywords: G.3 Probability and statistics: queueing theory, I.6.5 Model development
Link:
EVALUATION OF PARETO/D/1/K QUEUE BY SIMULATION
Seferin Mirtchev, Rossitza Goleva
http://www.foibg.com/ibs_isc/ibs-01/IBS-01-p06.pdf
|
MULTIDIMENSIONAL HETEROGENEOUS VARIABLE PREDICTION ...
By: Gennadiy Lbov, Maxim Gerasimov
(4020 reads)
Rating:
(1.00/10)
|
Abstract: In the works 1, 2 we proposed an approach of forming a consensus of experts’ statements for the
case of forecasting of qualitative and quantitative variable. In this paper, we present a method of aggregating sets
of individual statements into a collective one for the general case of forecasting of multidimensional
heterogeneous variable.
Keywords: multidimensional variable, expert statements, coordination.
ACM Classification Keywords: I.2.6. Artificial Intelligence - knowledge acquisition.
Link:
MULTIDIMENSIONAL HETEROGENEOUS VARIABLE PREDICTION
BASED ON EXPERTS’ STATEMENTS∗
Gennadiy Lbov, Maxim Gerasimov
http://www.foibg.com/ibs_isc/ibs-01/IBS-01-p13.pdf
|
EXTENDED ALGORITHM FOR TRANSLATION OF MSC-DIAGRAMS INTO PETRI NETS
By: Sergii Kryvyy, Oleksiy Chugayenko
(3227 reads)
Rating:
(1.00/10)
|
Abstract: The article presents an algorithm for translation the system, described by MSC document into Petri Net
modulo strong bisimulation. Obtained net can be later used for determining various systems' properties. Example
of correction error in original system with using if described algorithm presented.
Keywords: MSC, Petri Net, model checking, verification, RAD.
ACM Classification Keywords: D.2.4 Software/Program Verification - Formal methods, Model checking
Link:
EXTENDED ALGORITHM FOR TRANSLATION OF MSC-DIAGRAMS INTO PETRI NETS
Sergii Kryvyy, Oleksiy Chugayenko
http://www.foibg.com/ibs_isc/ibs-01/IBS-01-p09.pdf
|
FAST LINEAR ALGORITHM FOR ACTIVE RULES APPLICATION IN TRANSITION P SYSTEMS
By: Gil et al.
(3264 reads)
Rating:
(1.00/10)
|
Abstract: Transition P systems are computational models based on basic features of biological membranes and
the observation of biochemical processes. In these models, membrane contains objects multisets, which evolve
according to given evolution rules. In the field of Transition P systems implementation, it has been detected the
necessity to determine whichever time are going to take active evolution rules application in membranes. In
addition, to have time estimations of rules application makes possible to take important decisions related to the
hardware / software architectures design.
In this paper we propose a new evolution rules application algorithm oriented towards the implementation of
Transition P systems. The developed algorithm is sequential and, it has a linear order complexity in the number of
evolution rules. Moreover, it obtains the smaller execution times, compared with the preceding algorithms.
Therefore the algorithm is very appropriate for the implementation of Transition P systems in sequential devices.
Keywords: Natural Computing, Membrane computing, Transition P System, Rules Application Algorithms
ACM Classification Keywords: D.1.m Miscellaneous – Natural Computing
Link:
FAST LINEAR ALGORITHM FOR ACTIVE RULES APPLICATION IN TRANSITION P SYSTEMS
Francisco Javier Gil, Jorge Tejedor, Luis Fernández
http://www.foibg.com/ibs_isc/ibs-01/IBS-01-p05.pdf
|
A METAONTOLOGY FOR MEDICAL DIAGNOSTICS OF ACUTE DISEASES. PART 2. ...
By: Chernyakhovskaya et al.
(3496 reads)
Rating:
(1.00/10)
|
Abstract: This article is the continuation of the formal description of the metaontology for medical diagnostics in
the language of applied logic. It contains a description of interrelations between terms of knowledge and reality in
the form of ontological agreements.
Keywords: Medical Diagnostics, ontology model, metaontology.
ACM Classification Keywords: I.2.1 Applications and Expert Systems, I.2.4 Knowledge Representation
Formalisms and Methods, J.3 Life and Medical Sciences.
Link:
A METAONTOLOGY FOR MEDICAL DIAGNOSTICS OF ACUTE DISEASES. PART 2. A FORMAL DESCRIPTION OF CAUSE-AND-EFFECT RELATIONS
Mary Chernyakhovskaya, Alexander Kleshchev, Phillip Moskalenko
http://www.foibg.com/ibs_isc/ibs-01/IBS-01-p15.pdf
|
A METAONTOLOGY FOR MEDICAL DIAGNOSTICS OF ACUTE DISEASES. PART 1. ...
By: Chernyakhovskaya et al.
(3660 reads)
Rating:
(1.00/10)
|
Abstract: The aim of this article is to describe formally a metaontology for medical diagnostics of acute diseases
in the language of applied logic. The article includes an informal description of the metaontology, and the part of
its model which contains the definitions for basic terms of knowledge and situations and also their integrity
restrictions in the form of ontological agreements.
Keywords: Medical Diagnostics, ontology model, metaontology.
ACM Classification Keywords: I.2.1 Applications and Expert Systems, I.2.4 Knowledge Representation
Formalisms and Methods, J.3 Life and Medical Sciences
Link:
A METAONTOLOGY FOR MEDICAL DIAGNOSTICS OF ACUTE DISEASES. PART 1. AN INFORMAL DESCRIPTION AND DEFINITIONS OF BASIC TERMS
Mary Chernyakhovskaya, Alexander Kleshchev, Phillip Moskalenko
http://www.foibg.com/ibs_isc/ibs-01/IBS-01-p14.pdf
|
A METAONTOLOGY FOR MEDICAL DIAGNOSTICS OF ACUTE DISEASES. PART 3. ...
By: Chernyakhovskaya et al.
(3505 reads)
Rating:
(1.00/10)
|
Abstract: This article is the final part of the formal description of the metaontology for medical diagnostics in the
language of applied logic. It contains a description of the causes of signs’ values and of the causes of diseases.
Keywords: Medical Diagnostics, ontology model, metaontology.
ACM Classification Keywords: I.2.1 Applications and Expert Systems, I.2.4 Knowledge Representation
Formalisms and Methods, J.3 Life and Medical Sciences.
Link:
A METAONTOLOGY FOR MEDICAL DIAGNOSTICS OF ACUTE DISEASES.
PART 3. A FORMAL DESCRIPTION OF THE CAUSES OF SIGNS’ VALUES AND OF DISEASES
Mary Chernyakhovskaya, Alexander Kleshchev, Phillip Moskalenko
http://www.foibg.com/ibs_isc/ibs-01/IBS-01-p16.pdf
|
PARALLELIZATION OF LOGICAL INFERENCE FOR CONFLUENT RULE-BASED SYSTEM1
By: Irene Artemieva, Michael Tyutyunnik
(4094 reads)
Rating:
(1.00/10)
|
Abstract: The article describes the research aimed at working out a program system for multiprocessor
computers. The system is based on the confluent declarative production system. The article defines some
schemes of parallel logical inference and conditions affecting scheme choice.
Keywords: Logical Inference, parallel rule-based systems
ACM Classification Keywords: D 3.2 – Constraint and logic languages, I 2.5 Expert system tools and
techniques.
Link:
PARALLELIZATION OF LOGICAL INFERENCE FOR CONFLUENT RULE-BASED SYSTEM1
Irene Artemieva, Michael Tyutyunnik
http://www.foibg.com/ibs_isc/ibs-01/IBS-01-p11.pdf
|
P SYSTEMS GÖDELIZATION
By: Luengo et al.
(3514 reads)
Rating:
(1.00/10)
|
Abstract: This paper presents a method for assigning natural numbers to Transition P systems based on a
Gödelization process. The paper states step by step the way for obtaining Gödel numbers for each one of the
fundamental elements of Transition P systems –multisets of objects, evolution rules, priorities relation, membrane
structure- until defining the Gödel number of a given Transition P system.
Keywords: Membrane Computing, Transition P System, Gödelization
ACM Classification Keywords: D.1.m Miscellaneous – Natural Computing
Link:
P SYSTEMS GÖDELIZATION
Carmen Luengo, Luis Fernández, Fernando Arroyo
http://www.foibg.com/ibs_isc/ibs-01/IBS-01-p04.pdf
|
TIMED TRANSITION AUTOMATA AS NUMERICAL PLANNING DOMAIN
By: Alfredo Milani, Silvia Suriani
(3452 reads)
Rating:
(1.00/10)
|
Abstract: A general technique for transforming a timed finite state automaton into an equivalent automated
planning domain based on a numerical parameter model is introduced. Timed transition automata have many
applications in control systems and agents models; they are used to describe sequential processes, where
actions are labelling by automaton transitions subject to temporal constraints. The language of timed words
accepted by a timed automaton, the possible sequences of system or agent behaviour, can be described in term
of an appropriate planning domain encapsulating the timed actions patterns and constraints. The time words
recognition problem is then posed as a planning problem where the goal is to reach a final state by a sequence of
actions, which corresponds to the timed symbols labeling the automaton transitions. The transformation is proved
to be correct and complete and it is space/time linear on the automaton size. Experimental results shows that the
performance of the planning domain obtained by transformation is scalable for real world applications. A major
advantage of the planning based approach, beside of the solving the parsing problem, is to represent in a single
automated reasoning framework problems of plan recognitions, plan synthesis and plan optimisation.
Keywords: Timed Transition Automata, Automated Planning, Domain
ACM Classification Keywords: F.1.1 Models of Computation I.2.8 Problem Solving, Control Methods, and
Search
Link:
TIMED TRANSITION AUTOMATA AS NUMERICAL PLANNING DOMAIN
Alfredo Milani, Silvia Suriani
http://www.foibg.com/ibs_isc/ibs-01/IBS-01-p03.pdf
|
LAGRANGEAN APPROXIMATION FOR COMBINATORIAL INVERSE PROBLEMS
By: Hasmik Sahakyan, Levon Aslanyan
(4122 reads)
Rating:
(1.00/10)
|
Abstract: Various combinatorial problems are effectively modelled in terms of (0,1) matrices. Origins are coming
from n-cube geometry, hypergraph theory, inverse tomography problems, or directly from different models of
application problems. Basically these problems are NP-complete. The paper considers a set of such problems
and introduces approximation algorithms for their solutions applying Lagragean relaxation and related set of
techniques.
Keywords: Approximation algorithms, Lagragean relaxation
ACM Classification Keywords: G.2.1 Discrete mathematics: Combinatorics
Link:
LAGRANGEAN APPROXIMATION FOR COMBINATORIAL INVERSE PROBLEMS
Hasmik Sahakyan, Levon Aslanyan
http://www.foibg.com/ibs_isc/ibs-01/IBS-01-p02.pdf
|
NON-LINEAR NETWORK-FLOW MODEL OF ŁUKASIEWICZ’S MULTIVALUE LOGIC
By: Sgurev et al.
(3208 reads)
Rating:
(1.00/10)
|
Abstract: The paper presents a new network-flow interpretation of Łukasiewicz’s logic based on models with an
increased effectiveness. The obtained results show that the presented network-flow models principally may work
for multivalue logics with more than three states of the variables i.e. with a finite set of states in the interval from 0
to 1. The described models give the opportunity to formulate various logical functions. If the results from a given
model that are contained in the obtained values of the arc flow functions are used as input data for other models
then it is possible in Łukasiewicz’s logic to interpret successfully other sophisticated logical structures. The
obtained models allow a research of Łukasiewicz’s logic with specific effective methods of the network-flow
programming. It is possible successfully to use the specific peculiarities and the results pertaining to the function
‘traffic capacity of the network arcs’. Based on the introduced network-flow approach it is possible to interpret
other multivalue logics – of E.Post, of L.Brauer, of Kolmogorov, etc.
Keywords: Łukasiewicz’s multivalue logic, operational research, network flow interpretation.
ACM Classification Keywords: F.4.0 Mathematical Logic and Formal Languages – General, F.4.1 Mathematical
Logic – Logic and constraint programming.
Link:
NON-LINEAR NETWORK-FLOW MODEL OF ŁUKASIEWICZ’S MULTIVALUE LOGIC
Vassil Sgurev, Stefan Kojnov
http://www.foibg.com/ibs_isc/ibs-01/IBS-01-p01.pdf
|
MOBILE ELECTION
By: Long et al.
(3891 reads)
Rating:
(1.00/10)
|
Abstract: Mobile phones have the potential of fostering political mobilisation. There is a significant political power
in mobile technology. Like the Internet, mobile phones facilitate communication and rapid access to information.
Compared to the Internet, however, mobile phone diffusion has reached a larger proportion of the population in
most countries, and thus the impact of this new medium is conceivably greater. There are now more mobile
phones in the UK than there are people (averaging at 121 mobile phones for every 100 people). In this paper, the
attempt to use modern mobile technology to handle the General Election, is discussed. The pre-election
advertising, election day issues, including the election news and results as they come in, and answering
questions via text message regarding the results of current and/or previous general elections are considered.
Keywords: mobile text messages, mobile election, mobile advertising, question-answering system
ACM Classification Keywords: I.2 Artificial intelligence: I.2.7 Natural Language Processing: Text analysis.
Link:
MOBILE ELECTION
Elena Long, Vladimir Lovitskii, Michael Thrasher, David Traynor
http://www.foibg.com/ibs_isc/ibs-09/ibs-09-p02.pdf
|
MOBILE SEARCH AND ADVERTISING
By: Lovitskii et al.
(3901 reads)
Rating:
(1.00/10)
|
Abstract: Mobile advertising is a rapidly growing sector providing brands and marketing agencies the opportunity
to connect with consumers beyond traditional and digital media and instead communicate directly on their mobile
phones. Mobile advertising will be intrinsically linked with mobile search, which has transported from the internet
to the mobile and is identified as an area of potential growth. The result of mobile searching show that as a
general rule such search result exceed 160 characters; the dialog is required to deliver the relevant portion of a
response to the mobile user. In this paper we focus initially on mobile search and mobile advert creation, and
later the mechanism of interaction between the user’s request, the result of searching, advertising and dialog.
Keywords: mobile text messages, mobile search, mobile advertising, question-answering system
ACM Classification Keywords: I.2 Artificial intelligence: I.2.7 Natural Language Processing: Text analysis.
Link:
MOBILE SEARCH AND ADVERTISING
Vladimir Lovitskii, Colin McCaffery?, Michael Thrasher, David Traynor, Peter Wright
http://www.foibg.com/ibs_isc/ibs-09/ibs-09-p01.pdf
|
|
|