This paper concerns a control system for a resource distribution in a complex of parallel operations. The operations are described by relational knowledge representation with uncertain parameters characterized by an expert. The knowledge obtained from an expert is further corrected online by applying an adaptation process. Three particular adaptive control algorithms are suggested, of which two use an artificial neural network. The paper presents selected results of simulations showing that the proposed concepts and algorithms may be practically useful.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
The paper is concerned with allocation problems for a class of parallel operations described by a relational knowledge representation. Unknown parameters in the relations are assumed to be values of uncertain variables described by certainty distributions given by an expert. Theorems concerning properties of the optima! allocation are presented. The equivalence of the solutions obtained by a direct approach to the allocation problem and by a decomposition is discussed. An example illustrates the presented method.
3
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
For analysis and decision problems in a class of uncertain systems a concept of uncertain variables has been elaborated. In this paper it has been shown how the uncertain variables may be applied to an allocation problem for a class of parallel operations described by a relational knowledge representation with unknown parameters. The unknown parameters are characterized by certainty distributions given by an expert.
4
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
Reduction operations iteratively applied to gray-tone pictures can be used to build the skeleton representation. We regard the grey-tone picture as a mountainous relief and find the skeleton as a set of line patterns running centrally along the regions with locally higher intensity. Skeletonization is accomplished by parallel reduction operations based on a nonridge point tekst, and a new four subiteration parallel algorithm is described which is more efficient than a standard algorithm using the operations based on the notion of point simplicity. A comparison of the performances of the two algorithms is included.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.