Methods of Verifying Continuous Automatic Belt Weighers: State and Prospects

The basic methods of verifying continuous automatic belt weighers are described. A comparative analysis of these methods on the basis of experimental studies is made and ways of implementing the results in industry are recommended.     

Properties of Numeric Codes for the Scheme of Random Subspaces RSC

Properties of coarse coding obtained by using the random subspace coding (RSC) scheme with random hyperrectangular receptive fields are considered. Characteristics of codes are provided such as the dimensionality of receptive fields, code density at various points of the input space, code overlapping, and others. The results of theoretical analysis are illustrated by experiments with high-dimensional codes. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 39–52, July–August 2005.     

How the Conveyor Belt Length Affects Belt Weigher Accuracy

The length of a conveyor belt is analyzed as a function of where the belt weigher is located and recommendations are made for optimizing the choice of location, taking the belt stiffness into account.     

Permanent magnets from fine iron and iron-cobalt alloy powders

Conclusions It has been established that, to obtain the optimum, magnetic properties in isotropic materials from fine iron and iron-cobalt alloy powders, the powders should be heat-treated for 4 h at a temperature of 280°C and compacted under a pressure of 15–16 kbar. Heat treatment tends to destroy dendritic axes of the second and third orders on the powder particles, heal structural defects, and increase the flowability of particles during pressing, thereby ultimately improving the magnetic properties of the resultant components. The maximum magnetic energy is 4.6 kJ/m³ for isotropic magnets from iron powders and 8.6 kJ/m³ for magnets from iron-cobalt alloy powders.Translated from Poroshkovaya Metallurgiya, No. 10 (142), pp. 61–63, October, 1974.     

Time of searching for similar binary vectors in associative memory

Times of searching for similar binary vectors in neural-net and traditional associative memories are investigated and compared. The neural-net approach is demonstrated to surpass the traditional ones even if it is implemented on a serial computer when the entropy of a space of signals is of order of several hundreds and the number of stored vectors is vastly larger than the entropy. This work is supported by RFBR grant 05-07-90049 and partially by the Center of Applied Cybernetics under grant No. 1M6840070004 (Institutional Research Plan AV0Z10300504). __________ Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 3–13, September–October 2006.     

A Binding Procedure for Distributed Binary Data Representations

Problems (inherent in compound hierarchical representations) of preserving information on the structure of coded data and methods of solving them by “binding” of information substructures are discussed. A type of distributed representations is considered in which data are coded by multidimensional binary sparse vectors. The constraints imposed on a binding procedure are formulated and its implementation is provided. Some examples of representation of structured data are considered. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 3–18, May–June 2005.