Displaying 161 – 180 of 235

Showing per page

Perona-Malik equation: properties of explicit finite volume scheme

Angela Handlovičová (2007)

Kybernetika

The Perona–Malik nonlinear parabolic problem, which is widely used in image processing, is investigated in this paper from the numerical point of view. An explicit finite volume numerical scheme for this problem is presented and consistency property is proved.

Process parameter prediction via markov models of sub-activities

Lino G. Marujo, Raad Y. Qassim (2014)

RAIRO - Operations Research - Recherche Opérationnelle

This work aims to fill a lacunae in the project-oriented production systems literature providing a formal analytic description of the rework effects formulae and the determination of the extended design time due to a certain degree of overlapping in a pair of activities. It is made through the utilization of concepts of workflow construction with hidden (semi) Markov models theory and establishing a way to disaggregate activities into sub-activities, in order to determine the activity parameters...

Prognosis and optimization of homogeneous Markov message handling networks

Pavel Boček, Tomáš Feglar, Martin Janžura, Igor Vajda (2001)

Kybernetika

Message handling systems with finitely many servers are mathematically described as homogeneous Markov networks. For hierarchic networks is found a recursive algorithm evaluating after finitely many steps all steady state parameters. Applications to optimization of the system design and management are discussed, as well as a program product 5P (Program for Prognosis of Performance Parameters and Problems) based on the presented theoretical conclusions. The theoretic achievements as well as the practical...

Quasi-hierarchical evolution algorithm for flow assignment in survivable connection-oriented networks

Michal Przewozniczek, Krzysztof Walkowiak (2006)

International Journal of Applied Mathematics and Computer Science

The main objective of this paper is to develop an effective evolutionary algorithm (EA) for the path-assignment problem in survivable connection-oriented networks. We assume a single-link failure scenario, which is the most common and frequently reported failure event. Since the network flow is modeled as a non-bifurcated multicommodity flow, the discussed optimization problem is NP-complete. Thus, we develop an effective heuristic algorithm based on an evolutionary algorithm. The main novelty of...

Reduction in the number of LUT elements for control units with code sharing

Alexander Barkalov, Larysa Titarenko, Jacek Bieganowski (2010)

International Journal of Applied Mathematics and Computer Science

Two methods are proposed targeted at reduction in the number of look-up table elements in logic circuits of compositional microprogram control units (CMCUs) with code sharing. The methods assume the application of field-programmable gate arrays for the implementation of the combinational part of the CMCU, whereas embedded-memory blocks are used for implementation of its control memory. Both methods are based on the existence of classes of pseudoequivalent operational linear chains in a microprogram...

Currently displaying 161 – 180 of 235