Abstract. In this paper we present some numerical algorithms for the identification of parameters in inverse problems. We are motivated by the problem of identification of physical parameters in the Swartzendruber formula which appears in the mathematical model of the prelinear filtration of ground water. The parameter inverse problem is formulated as an appropriate control one. An application of standard nonlinear programming methods for solving the problem is presented and obstacles of this approach are pointed out. We propose three strategies in order to deal with many local minima and sensitivity of the algorithms on starting points. The first one is to improve local minimum search using hierarchic optimization, the second one is to make search in large parts of the domain and the third one is to fasten computations using parallel and distributed techniques. Two algorithms that correspond to these strategies are presented: the hierarchic optimization algorithm and the algorithm of simple parallel search with distribution of computations (multiple starting point parallel optimization). Some modifications to these algorithms are also proposed. The results of the application of the described algorithms to a tested problem are presented. The computational tests are based on real data obtained from an experimental range.
Abstract. This paper surveys the state of art in quantification of hard real-time distributed systems. It introduces some new performance measures used in real-time computing and identifies key issues in the design and analysis of these systems. This paper outlines also typical requirements facing designers of safety-critical hard real-time systems.
Abstract. This paper is devoted to a fundamental problem arising during a design of distributed hard real-time systems - a cost minimization of located computers in a network working in a time-constrained environment. As regard our problem, each computer location must take into consideration a proper class of processor. In contrast to the existing traditional solutions of this problem, we used genetic algorithms for a required optimization. We present its application in obtaining all main parameters of designed systems. Genetic algorithms are shown to be effective for the solution of computer assignment problem in distributed hard real-time systems.
Abstract. In this paper, we present an overview of the existing distributed systems for hard real-time environments. We describe their structures and ways in which these systems are running. The paper discusses the ability of software of these systems to survive the failure of the part of the hardware on which it is executed. The preservation of essential data and reconfiguration, to provide a degraded service with the remaining processing resources, is presented. Finnally, we make some comparison between these systems.
Mariusz Baran,
Abstract. A new model of an automated visual inspection of printed circuit boards (PCB) is presented in the paper. The model belongs to a syntactic pattern recognition approach. The efficient ETPL(k) graph languages (Flasiński, Patt. Recogn. 1988, Comp. Vis. Graph. Image Process. 1989, Patt. Recogn. 1990, Patt. Recogn. 1993, Comp. Aided Design 1995, Theor. Comp. Sci. 1998) are used as a representation and analysis scheme.