Displaying 221 – 240 of 922

Showing per page

A method for knowledge integration

Martin Janžura, Pavel Boček (1998)

Kybernetika

With the aid of Markov Chain Monte Carlo methods we can sample even from complex multi-dimensional distributions which cannot be exactly calculated. Thus, an application to the problem of knowledge integration (e. g. in expert systems) is straightforward.

A method for learning scenario determination and modification in intelligent tutoring systems

Adrianna Kozierkiewicz-Hetmańska, Ngoc Thanh Nguyen (2011)

International Journal of Applied Mathematics and Computer Science

Computers have been employed in education for years. They help to provide educational aids using multimedia forms such as films, pictures, interactive tasks in the learning process, automated testing, etc. In this paper, a concept of an intelligent e-learning system will be proposed. The main purpose of this system is to teach effectively by providing an optimal learning path in each step of the educational process. The determination of a suitable learning path depends on the student's preferences,...

A method of constructing the frame of a directed graph

Ichiro Hofuku, Kunio Oshima (2013)

International Journal of Applied Mathematics and Computer Science

In web search engines, such as Google, the ranking of a particular keyword is determined by mathematical tools, e.g., Pagerank or Hits. However, as the size of the network increases, it becomes increasingly difficult to use keyword ranking to quickly find the information required by an individual user. One reason for this phenomenon is the interference of superfluous information with the link structure. The World Wide Web can be expressed as an enormous directed graph. The purpose of the present...

A methodology for constructing fuzzy rule-based classification systems.

José María Fernández Garrido, Ignacio Requena Ramos (2000)

Mathware and Soft Computing

In this paper, a methodology to obtain a set of fuzzy rules for classification systems is presented. The system is represented in a layered fuzzy network, in which the links from input to hidden nodes represents the antecedents of the rules, and the consequents are represented by links from hidden to output nodes. Specific genetic algorithms are used in two phases to extract the rules. In the first phase an initial version of the rules is extracted, and in second one, the labels are refined. The...

A methodology for developing knowledge-based systems.

Juan Luis Castro, José Jesús Castro-Sánchez, Antonio Espin, José Manuel Zurita (1998)

Mathware and Soft Computing

This paper presents a methodology for developing fuzzy knowledge based systems (KBS), which permits a complete automatization. This methodology will be useful for approaching more complex problems that those in which machine learning from examples are successful.

A metric for evaluating software architecture and communication models consistency

Jean-Yves Lafaye, Georges Louis (2005)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Among several alternative viewpoints for building software quality metrics, evaluating the consistency between different models in a software specification or implementation appears to be fruitful. An obvious difficulty is that different models are usually expressed by means of different concepts, and then, confronting heterogeneous representations is not straightforward. In this paper, we propose a solution for measuring the consistency between the architecture and the communication models. After...

A metric for evaluating software architecture and communication models consistency

Jean-Yves Lafaye, Georges Louis (2010)

RAIRO - Theoretical Informatics and Applications

Among several alternative viewpoints for building software quality metrics, evaluating the consistency between different models in a software specification or implementation appears to be fruitful. An obvious difficulty is that different models are usually expressed by means of different concepts, and then, confronting heterogeneous representations is not straightforward. In this paper, we propose a solution for measuring the consistency between the architecture and the communication models. After...

A mixed–FEM and BEM coupling for a three-dimensional eddy current problem

Salim Meddahi, Virginia Selgas (2003)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

We study in this paper the electromagnetic field generated in a conductor by an alternating current density. The resulting interface problem (see Bossavit (1993)) between the metal and the dielectric medium is treated by a mixed–FEM and BEM coupling method. We prove that our BEM-FEM formulation is well posed and that it leads to a convergent Galerkin method.

A mixed–FEM and BEM coupling for a three-dimensional eddy current problem

Salim Meddahi, Virginia Selgas (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

We study in this paper the electromagnetic field generated in a conductor by an alternating current density. The resulting interface problem (see Bossavit (1993)) between the metal and the dielectric medium is treated by a mixed–FEM and BEM coupling method. We prove that our BEM-FEM formulation is well posed and that it leads to a convergent Galerkin method.

A model for opinion agreement and confidence in multi-expert multi-criteria decisión making.

Gerardo Canfora, Luigi Troiano (2004)

Mathware and Soft Computing

In multi-expert multi-criteria decision making problems, we often have to deal with different opinions, different importance of criteria and experts, missing data, unexpressed opinions and experts who are not fully confident with their judgment. All these factors make the problem more difficult to solve, and run the risk of making the model logic less transparent. In this paper, we present a model based on simple assumptions described by logical rules, in order to maintain the model transparency...

A model of decision with linguistic knowledge.

María Teresa Lamata Jiménez (1994)

Mathware and Soft Computing

The aim of this paper is to develop a new aggregating method for the decision problem in which the possible values of rewards are known in linguistic terms. We show new operators for solving this problem, as well as the way in which OWA operators provide us with an adequate framework for representing the optimism degree of the decision maker in case we have no information about the real state.

A Model of Mizar Concepts - Unification

Grzegorz Bancerek (2010)

Formalized Mathematics

The aim of this paper is to develop a formal theory of Mizar linguistic concepts following the ideas from [6] and [7]. The theory presented is an abstraction from the existing implementation of the Mizar system and is devoted to the formalization of Mizar expressions. The concepts formalized here are: standarized constructor signature, arity-rich signatures, and the unification of Mizar expressions.

A model of route lifetime optimization with linguistic knowledge in wireless ad-hoc networks.

E. Natsheh, S. Khatun, A. Jantan (2006)

Mathware and Soft Computing

Ad-hoc On-Demand Distance Vector (AODV) routing protocol has been and continues to be a very active and fruitful research protocol since its introduction in the wireless ad-hoc networks. AODV uses a static value for its route lifetime parameter called Active Route Timeout (ART) which indicates the time that the route can stay active in the routing table. Route lifetime may be more accurately determined dynamically via measurement, instead of static value. To accomplish this, the fuzzy logic system...

A modified standard embedding for linear complementarity problems

Sira Allende Allonso, Jürgen Guddat, Dieter Nowack (2004)

Kybernetika

We propose a modified standard embedding for solving the linear complementarity problem (LCP). This embedding is a special one-parametric optimization problem P ( t ) , t [ 0 , 1 ] . Under the conditions (A3) (the Mangasarian–Fromovitz Constraint Qualification is satisfied for the feasible set M ( t ) depending on the parameter t ), (A4) ( P ( t ) is Jongen–Jonker– Twilt regular) and two technical assumptions, (A1) and (A2), there exists a path in the set of stationary points connecting the chosen starting point for P ( 0 ) with a certain...

Currently displaying 221 – 240 of 922