Journal:Informatica
Volume 3, Issue 3 (1992), pp. 385–392
Abstract
Binary logic functions ‘AND’ and ‘OR’ of negations are realized by a dendritic branch with nonlinear current-voltage characteristic of membrane. The neuron with such dendrites is a complex logic system performing a great number of elementary logic operations.
Journal:Informatica
Volume 3, Issue 3 (1992), pp. 378–384
Abstract
The checking fidelity of the systems with built-in fault detection circuits is investigated here taking into account the failure rates of functional units, also checking and transmission facilities of right and wrong information on the state of functional units. When fault detection circuits or information transmission facilities fail, then the information given by them may cause false or undetected failures in comparison with the real state of the corresponding functional unit.
Journal:Informatica
Volume 3, Issue 3 (1992), pp. 360–377
Abstract
The special class of networks are presented. Based on unreachable parts of subgraphs the overlappingly decomposed networks are defined. The special decomposition scheme of those networks is applicated for shortest path problem, dynamic programming and synthetic neural nets architecture.
Journal:Informatica
Volume 3, Issue 3 (1992), pp. 348–359
Abstract
The rules of classification of the group of N independent observations into one of k normal populations are considered. In the case when parameters are not known, Bayes estimators of the discriminant scores are suggested.
Journal:Informatica
Volume 3, Issue 3 (1992), pp. 338–347
Abstract
The structure of the weight function of a random space–time autoregressive field, existing in three-dimensional space and time, is considered. The two weight coefficients calculation algorithms are proposed here.
Journal:Informatica
Volume 3, Issue 3 (1992), pp. 301–337
Abstract
Small training sample effects common in statistical classification and artificial neural network classifier design are discussed. A review of known small sample results are presented, and peaking phenomena related to the increase in the number of features and the number of neurons is discussed.
Journal:Informatica
Volume 3, Issue 2 (1992), pp. 275–279
Abstract
In some recent papers a discussion on global minimization algorithms for a broad class of functions was started. An idea is presented here why such a case is different from a case of Lipshitzian functions in respect with the convergence and why for a broad class of functions an algorithm converges to global minimum of an objective function if it generates an everywhere dense sequence of trial points.
Journal:Informatica
Volume 3, Issue 2 (1992), pp. 256–274
Abstract
The results of investigation of the resource management in radar search are presented in the paper. The time for search of manoeuvring targets is minimized by optimal distribution of radar power among the space directions and by optimization of search parameters.
The problem of the optimal control of radar search is extremely complicated in the general case and in real situations, therefore we have compared only some strategies (e.g., one stage cyclic strategy, various multistage strategies).
In some simple cases (e.g., motionless targets) optimal parameters of multistage strategies maybe found but in the general case the efficiency of strategies may be evaluated with the help of statistical simulation. The simulation time was essentially reduced by some simplifications of models, by the forecast of discrete coordinates of the targets and by the use of averaged values.
The usage of the proposed strategies enables us to reduce the time of search by 2–3 times. Those strategies may be executed in real time.