Journal:Informatica
Volume 2, Issue 4 (1991), pp. 524–538
Abstract
The continuation transformation, its application for recursion removal and relation with reduction algorithms is analyzed. The reduction algorithm for expressions in continuation form is presented.
Journal:Informatica
Volume 2, Issue 4 (1991), pp. 516–523
Abstract
This paper presents the new approach to the analysis and synthesis of a parallel-processing architecture. The novelty of the procedure lies in the generalized space–time system of co-ordinates and the space–time transformation of sets in the system. The parallel space–time computing structures (PASTICS) are introduced, main principles are presented and the functional structure of processing unit is analyzed. Computing in the PASTICS is considered as a minimization of a certain potential function which can be derived from the state-transition and output functions, corresponding to the problem to be solved. The problem of synchronization of different processing units must be solved similarly as it is done in the data-flow control computers. Two important cases of application of the PASTICS are mentioned.
Journal:Informatica
Volume 2, Issue 4 (1991), pp. 497–515
Abstract
An external formation based on lithography processes is not a single possible method of the IC manufacturing. In the self-formation the interaction between the forming object and chaotic medium is controlled by the object's structure, and the structure is changed by the interactions accompanied by the primary object increasing complexity. Three kinds of self-formation methods can be used for manufacturing: self-alignment, based on the interaction between an object and distinct sequence of chaotic media, development, where a single chaotic medium is sufficient and reproduction, where the developing objects generates primary objects. There are known a lot of methods for submicrometer structures manufacturing and lithography processes reducing.
Journal:Informatica
Volume 2, Issue 4 (1991), pp. 478–496
Abstract
The paper is devoted to analysis of the software peculiarities of the computer based ultrasonic imaging system for non-destructive) testing (NDT) applications. The developed software enables 1, 2, and 3-dimensional imaging of the intrinsic structure of the materials and measurement of their parameters.
Journal:Informatica
Volume 2, Issue 4 (1991), pp. 473–477
Abstract
The role of an interface between an algorithm and its environment for school students is discussed. The motivation of the use of Pascal functions and procedures instead of commonly used programs in the first lessons of programming is presented. The main features of an interpreter of algorithms (Pascal functions and procedures) implemented on school computer are presented.
Journal:Informatica
Volume 2, Issue 3 (1991), pp. 434–454
Abstract
The smoothing constant λ is the most important characteristic of the nonparametric Parzen window classifier (PWC). The PWC tends to a one-nearest neighbour classifier as λ tends to zero and to a parametric linear Eucliden distance classifier as λ tends to infinity. An asymptotic probability of misclassification of the PWC decreases with the decrease in λ. A sensitivity of the PWC to a finiteness of the training data depends on a true-intrinsic dimensionality of the data, and it increases with the decrease in the value of λ. It is proposed to determine an optimal value of the smoothing constant from a smoothed empirical graph of the dependence of an expected probability of misclassification on the value of λ. The graph can be estimated by means of leaving-one-out or hold-out methods simultaneously for a number of values of λ chosen from the interval (0.001–1000) in a logarithmic scale.
Journal:Informatica
Volume 2, Issue 3 (1991), pp. 414–433
Abstract
In this paper open-loop three-level Stackelberg strategies in deterministic, sequential decision-making problems for linear continuous-time singular systems and quadratic cost function are studied. Necessary conditions under which the existence of open-loop Stackelberg strategies are derived. The analytical solution of three-level open-loop Stackelberg problem is given by means of the eigenvector method. An example is given to illustrate the proposed method.
Journal:Informatica
Volume 2, Issue 3 (1991), pp. 403–413
Abstract
The binary logic functions “AND” and “OR” are realized by the model of a nonlinear stationary dendritic branch. The neuron with such dendrites is a complex logic system performing a great number of elementary logic operations.