Displaying 21 – 40 of 407

Showing per page

Search trees and bubble memories

Philippe Flajolet, Thomas Ottmann, Derick Wood (1985)

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

Seasonal time-series imputation of gap missing algorithm (STIGMA)

Eduardo Rangel-Heras, Pavel Zuniga, Alma Y. Alanis, Esteban A. Hernandez-Vargas, Oscar D. Sanchez (2023)

Kybernetika

This work presents a new approach for the imputation of missing data in weather time-series from a seasonal pattern; the seasonal time-series imputation of gap missing algorithm (STIGMA). The algorithm takes advantage from a seasonal pattern for the imputation of unknown data by averaging available data. We test the algorithm using data measured every 10 minutes over a period of 365 days during the year 2010; the variables include global irradiance, diffuse irradiance, ultraviolet irradiance, and temperature,...

Secuenciación dinámica de sistemas de fabricación flexible mediante aprendizaje automático: análisis de los principales sistemas de secuenciación existentes.

Paolo Priore, David de la Fuente, Javier Puente, Alberto Gómez (2001)

Qüestiió

Una forma habitual de secuenciar de modo dinámico los trabajos en los sistemas de fabricación es mediante el empleo de reglas de secuenciación. Sin embargo, el problema que presenta este método es que el comportamiento del sistema de fabricación dependerá de su estado, y no existe una regla que supere a las demás en todos los posibles estados que puede presentar el sistema de fabricación. Por lo tanto, sería interesante usar en cada momento la regla más adecuada. Para lograr este objetivo, se pueden...

Segmentation of MRI data by means of nonlinear diffusion

Radomír Chabiniok, Radek Máca, Michal Beneš, Jaroslav Tintěra (2013)

Kybernetika

The article focuses on the application of the segmentation algorithm based on the numerical solution of the Allen-Cahn non-linear diffusion partial differential equation. This equation is related to the motion of curves by mean curvature. It exhibits several suitable mathematical properties including stable solution profile. This allows the user to follow accurately the position of the segmentation curve by bringing it quickly to the vicinity of the segmented object and by approaching the details...

Segmenting colour images on the basis of a fuzzy hierarchical approach.

Jesús Chamorro-Martínez, Daniel Sánchez, Belén Prados-Suárez, Elena Galán-Perales, M.ª Amparo Vila (2003)

Mathware and Soft Computing

In this paper we deal with two problems related to imprecision in colour image segmentation processes: to decide whether a set of pixels verify the property to be homogeneously coloured, and to represent the set of possible segmentations of an image at different precision levels. In order to solve the first problem we introduce a measure of distance between colours in the CIE L*a*b* space, that allows us to measure the degree of homogeneity of two pixels p and q on the basis of the maximum distance...

Selected multicriteria shortest path problems: an analysis of complexity, models and adaptation of standard algorithms

Zbigniew Tarapata (2007)

International Journal of Applied Mathematics and Computer Science

The paper presents selected multicriteria (multiobjective) approaches to shortest path problems. A classification of multi-objective shortest path (MOSP) problems is given. Different models of MOSP problems are discussed in detail. Methods of solving the formulated optimization problems are presented. An analysis of the complexity of the presented methods and ways of adapting of classical algorithms for solving multiobjective shortest path problems are described. A comparison of the effectiveness...

Self-adaptation of parameters in a learning classifier system ensemble machine

Maciej Troć, Olgierd Unold (2010)

International Journal of Applied Mathematics and Computer Science

Self-adaptation is a key feature of evolutionary algorithms (EAs). Although EAs have been used successfully to solve a wide variety of problems, the performance of this technique depends heavily on the selection of the EA parameters. Moreover, the process of setting such parameters is considered a time-consuming task. Several research works have tried to deal with this problem; however, the construction of algorithms letting the parameters adapt themselves to the problem is a critical and open problem...

Self-adaptive air-sea simulation based on multi-sensors agentification

S. Peyruqueou, D. Capera, T. Médina, C. De Murcia (2010)

RAIRO - Operations Research

Combat Management System training uses simulation of an overall tactical situation. This involves the real-time management of numerous and diverse entities to keep the simulation scenario consistent in a highly dynamic environment. To address this difficult problem, we propose an adaptive multi-agent system in which each entity is considered as a smart sensor/effector mobile. The autonomy and the dynamic behaviour offered to each entity leads the simulation to self-adapt to inevitable disturbances...

Self-affine fractals of finite type

Christoph Bandt, Mathias Mesing (2009)

Banach Center Publications

In the class of self-affine sets on ℝⁿ we study a subclass for which the geometry is rather tractable. A type is a standardized position of two intersecting pieces. For a self-affine tiling, this can be identified with an edge or vertex type. We assume that the number of types is finite. We study the topology of such fractals and their boundary sets, and we show how new finite type fractals can be constructed. For finite type self-affine tiles in the plane we give an algorithm which decides whether...

Self-avoiding walks on the lattice ℤ² with the 8-neighbourhood system

Andrzej Chydziński, Bogdan Smołka (2001)

Applicationes Mathematicae

This paper deals with the properties of self-avoiding walks defined on the lattice with the 8-neighbourhood system. We compute the number of walks, bridges and mean-square displacement for N=1 through 13 (N is the number of steps of the self-avoiding walk). We also estimate the connective constant and critical exponents, and study finite memory and generating functions. We show applications of this kind of walk. In addition, we compute upper bounds for the number of walks and the connective constant....

Self-diclique circulant digraphs

Marietjie Frick, Bernardo Llano, Rita Zuazua (2015)

Mathematica Bohemica

We study a particular digraph dynamical system, the so called digraph diclique operator. Dicliques have frequently appeared in the literature the last years in connection with the construction and analysis of different types of networks, for instance biochemical, neural, ecological, sociological and computer networks among others. Let D = ( V , A ) be a reflexive digraph (or network). Consider X and Y (not necessarily disjoint) nonempty subsets of vertices (or nodes) of D . A disimplex K ( X , Y ) of D is the subdigraph...

Currently displaying 21 – 40 of 407