All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 23 Next

Displaying 441 – 460 of 4962

Showing per page

A survey of methods to evaluate quantified sentences.

Miguel Delgado, Daniel Sánchez, José María Serrano, M. Amparo Vila (2000)

Mathware and Soft Computing

The evaluation of quantified sentences is used to solve several problems. Most of the methods proposed in the literature are not satisfactory because they do not verify some intuitive properties. In this paper we propose an extension of both possibilistic and probabilistic methods, based on the Sugeno and the Choquet fuzzy integrals respectively, for the evaluation of type II sentences, the most general kind of sentences. These methods verify good properties, and they are shown to be better than...

A survey of subpixel edge detection methods for images of heat-emitting metal specimens

Anna Fabijańska (2012)

International Journal of Applied Mathematics and Computer Science

In this paper the problem of accurate edge detection in images of heat-emitting specimens of metals is discussed. The images are provided by the computerized system for high temperature measurements of surface properties of metals and alloys. Subpixel edge detection is applied in the system considered in order to improve the accuracy of surface tension determination. A reconstructive method for subpixel edge detection is introduced. The method uses a Gaussian function in order to reconstruct the...

A survey on combinatorial optimization in dynamic environments∗

Nicolas Boria, Vangelis T. Paschos (2011)

RAIRO - Operations Research

This survey presents major results and issues related to the study of NPO problems in dynamic environments, that is, in settings where instances are allowed to undergo some modifications over time. In particular, the survey focuses on two complementary frameworks. The first one is the reoptimization framework, where an instance I that is already solved undergoes some local perturbation. The goal is then to make use of the information provided by the initial solution to compute a new solution. The...

A survey on combinatorial optimization in dynamic environments∗

Nicolas Boria, Vangelis T. Paschos (2011)

RAIRO - Operations Research

This survey presents major results and issues related to the study of NPO problems in dynamic environments, that is, in settings where instances are allowed to undergo some modifications over time. In particular, the survey focuses on two complementary frameworks. The first one is the reoptimization framework, where an instance I that is already solved undergoes some local perturbation. The goal is then to make use of the information provided by the initial solution to compute a new solution. The...

A system for deduction-based formal verification of workflow-oriented software models

Radosław Klimek (2014)

International Journal of Applied Mathematics and Computer Science

The work concerns formal verification of workflow-oriented software models using the deductive approach. The formal correctness of a model's behaviour is considered. Manually building logical specifications, which are regarded as a set of temporal logic formulas, seems to be a significant obstacle for an inexperienced user when applying the deductive approach. A system, along with its architecture, for deduction-based verification of workflow-oriented models is proposed. The process inference is...

A terminal area topology-independent GB-based conflict detection system for A-SMGCS.

Eugenio Roanes Lozano, Rafael Muga, Luis M. Laita, Eugenio Roanes Macías (2004)

RACSAM

A module for conflict detection in A-SMGCS is presented. It supervises the operations that the ground controller has to perform. It doesn?t depend on the topology of the terminal area. The system guarantees the safety of the proposed situation, that is, the impossibility that a conflict arises among aircrafts (and also road vehicles) obeying the signaling. We suppose that the terminal area has stop bars (or semaphores) controlling all intersections and accesses between runways, taxiways, exits,...

A test-set for k -power-free binary morphisms

F. Wlazinski (2001)

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

A morphism f is k -power-free if and only if f ( w ) is k -power-free whenever w is a k -power-free word. A morphism f is k -power-free up to m if and only if f ( w ) is k -power-free whenever w is a k -power-free word of length at most m . Given an integer k ≥ 2 , we prove that a binary morphism is k -power-free if and only if it is k -power-free up to k 2 . This bound becomes linear for primitive morphisms: a binary primitive morphism is k -power-free if and only if it is k -power-free up to 2 k + 1

A test-set for k-power-free binary morphisms

F. Wlazinski (2010)

RAIRO - Theoretical Informatics and Applications

A morphism f is k-power-free if and only if f(w) is k-power-free whenever w is a k-power-free word. A morphism f is k-power-free up to m if and only if f(w) is k-power-free whenever w is a k-power-free word of length at most m. Given an integer k ≥ 2, we prove that a binary morphism is k-power-free if and only if it is k-power-free up to k2. This bound becomes linear for primitive morphisms: a binary primitive morphism is k-power-free if and only if it is k-power-free up to 2k+1

A theory of refinement structure of hedge algebras and its applications to fuzzy logic

Nguyen Ho, Huynh Nam (1999)

Banach Center Publications

In [13], an algebraic approach to the natural structure of domains of linguistic variables was introduced. In this approach, every linguistic domain can be interpreted as an algebraic structure called a hedge algebra. In this paper, a refinement structure of hedge algebras based on free distributive lattices generated by linguistic hedge operations will be examined in order to model structure of linguistic domains more properly. In solving this question, we restrict our consideration to the specific...

Currently displaying 441 – 460 of 4962