Displaying 641 – 660 of 922

Showing per page

An application of the theory of intuitionistic fuzzy multigraphs.

Krassimir Atanassov, B. K. Papadopoulos, A. Syropoulos (2004)

Mathware and Soft Computing

In a recent paper by one of the authors it has been shown that there is a relationship between algebraic structures and labeled transition systems. Indeed, it has been shown that an algebraic structures can be viewed as labeled transition systems, which can also be viewed as multigraphs. In this paper, we extend this work by providing an estimation of the transition possibilities between vertices that are connected with multiarcs.

An approach based on the use of the ant system to design combinational logic circuits.

Benito Mendoza García, Carlos A. Coello Coello (2002)

Mathware and Soft Computing

In this paper we report the first attempt to design combinational logic circuits using the ant system. In order to design circuits, a measure of quality improvement in partially built circuits is introduced and a cost metric (based on the number of gates) is adopted in order to optimize the feasible circuits generated. The approach is compared to a genetic algorithm and to a human designer using several examples and the sensitivity of the algorithm to its parameters is studied using analysis of...

An architecture for making judgments using computing with words

Jerry Mendel (2002)

International Journal of Applied Mathematics and Computer Science

Our thesis is that computing with words needs to account for the uncertainties associated with the meanings of words, and that these uncertainties require using type-2 fuzzy sets. Doing this leads to a proposed architecture for making it judgments by means of computing with words, i.e., to a perceptual computer-the Per-C. The Per-C includes an encoder, a type-2 rule-based fuzzy logic system, and a decoder. It lets all human-computer interactions be performed using words. In this paper, a quantitative...

An attractive class of bipartite graphs

Rodica Boliac, Vadim Lozin (2001)

Discussiones Mathematicae Graph Theory

In this paper we propose a structural characterization for a class of bipartite graphs defined by two forbidden induced subgraphs. We show that the obtained characterization leads to polynomial-time algorithms for several problems that are NP-hard in general bipartite graphs.

An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid

Laura Giambruno, Antonio Restivo (2008)

RAIRO - Theoretical Informatics and Applications

We investigate the intersection of two finitely generated submonoids of the free monoid on a finite alphabet. To this purpose, we consider automata that recognize such submonoids and we study the product automata recognizing their intersection. By using automata methods we obtain a new proof of a result of Karhumäki on the characterization of the intersection of two submonoids of rank two, in the case of prefix (or suffix) generators. In a more general setting, for an arbitrary number of generators,...

An automatic hybrid method for retinal blood vessel extraction

Yong Yang, Shuying Huang, Nini Rao (2008)

International Journal of Applied Mathematics and Computer Science

The extraction of blood vessels from retinal images is an important and challenging task in medical analysis and diagnosis. This paper presents a novel hybrid automatic approach for the extraction of retinal image vessels. The method consists in the application of mathematical morphology and a fuzzy clustering algorithm followed by a purification procedure. In mathematical morphology, the retinal image is smoothed and strengthened so that the blood vessels are enhanced and the background information...

An automatic segmentation method for scanned images of wheat root systems with dark discolourations

Jarosław Gocławski, Joanna Sekulska-Nalewajko, Ewa Gajewska, Marzena Wielanek (2009)

International Journal of Applied Mathematics and Computer Science

The analysis of plant root system images plays an important role in the diagnosis of plant health state, the detection of possible diseases and growth distortions. This paper describes an initial stage of automatic analysis-the segmentation method for scanned images of Ni-treated wheat roots from hydroponic culture. The main roots of a wheat fibrous system are placed separately in the scanner view area on a high chroma background (blue or red). The first stage of the method includes the transformation...

An axiom system for incidence spatial geometry.

Rafael María Rubio, Alfonso Ríder (2008)

RACSAM

Incidence spatial geometry is based on three-sorted structures consisting of points, lines and planes together with three intersort binary relations between points and lines, lines and planes and points and planes. We introduce an equivalent one-sorted geometrical structure, called incidence spatial frame, which is suitable for modal considerations. We are going to prove completeness by SD-Theorem. Extensions to projective, affine and hyperbolic geometries are also considered.

Currently displaying 641 – 660 of 922