Conditions for reliable dewatering systems based on voidless drainage in slightly permeable soils

Conclusions 1. Use of dewatering systems based on voidless drainage is most effective when dewatering slightly permeable soils in regions with a deep seasonal frost. 2. Two-story drainage with the upper and lower stories spaced 30 m apart accelerates the discharge of gravitational water from the arable layer. Results of observations on two-story drainage in experimental-production sections indicated that it discharges 2 – 3.8 times more water than systematic tubular drainage with an interdrain spacing of 10 m and a 0.2-m thick three-dimensional filter of a sandy-gravelly mixture. 3. It is recommended to use crushed stone and porous-clay gravel with a fineness of 10 – 20 mm as a filler. In that case, protection of the drain filler is, as a rule, required only from the intrusion of soil from above during construction in cohesive soils with a plasticity indexW _p≥7. 4. seepage rate in a voidless drain should be lower than the scouring velocity for the soil in which the voidless drainage is placed. In the opposite case, it is necessary to lower the grade of the drains or select a filler gradation such that the seepage rate in the drain be lower than the scouring velocity. Translated from Gidrotekhnicheskoe Stroitel’stvo, No. 8, pp. 41–43, August, 1998.     

Performance evaluation of rule grouping on a real-time expertsystem architecture

Uses a Markov process to model a real-time expert system architecture characterized by message passing and event-driven scheduling. The model is applied to the performance evaluation of rule grouping for real-time expert systems running on this architecture. An optimizing algorithm based on Kernighan-Lin heuristic graph partitioning for the real-time architecture is developed and a demonstration system based on the model and algorithm has been developed and tested on a portion of the advanced GPS receiver (AGR) and manned manoeuvring unit (MMU) knowledge bases     

Quantization effects in digitally behaving circuit implementationsof Kohonen networks

Implementing a neural network on a digital or mixed analog and digital chip yields the quantization of the synaptic weights dynamics. This paper addresses this topic in the case of Kohonen's self-organizing maps. We first study qualitatively how the quantization affects the convergence and the properties, and deduce from this analysis the way to choose the parameters of the network (adaptation gain and neighborhood). We show that a spatially decreasing neighborhood function is far more preferable than the usually rectangular neighborhood function, because of the weight quantization. Based on these results, an analog nonlinear network, integrated in a standard CMOS technology, and implementing this spatially decreasing neighborhood function is then presented. It can be used in a mixed analog and digital circuit implementation.     

Large-deviation inequalities for parameter estimators in stochastic systems

Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 95–112, March–April, 1994.     

Active,passive and transpassive dissolution of a nickel base super alloy in concentrated acid mixture solution

The electrochemical and corrosion behaviour of a nickel base super alloy (C-263) has been investigated in the deaerated binary and ternary solution mixture of concentrated phosphoric acid, acetic acid, sulphuric acid, nitric acid or water using potentiostatic technique at 35°C. The possibilities of electropolishing of this alloy in these solution mixtures have been also explored. The alloy showed distinct active, passive and transpassive behaviour in the experimental solutions. The alloy remained active and turned passive in the negative potential region. Transpassive dissolution of the alloy is observed and electropolishing is achieved in this region. The best electropolishing is obtained in 50% H₃PO₄ + 40% CH₃COOH + 10% H₂SO₄. Higher content of water in the electrolytic solution is not useful for electropolishing of the alloy The experimental results also suggest that a current plateau in the transpassive potential region is not a sufficient condition to achieve electropolishing.     

Synthesis and analysis of transformer-isolated converters

A systematic and straightforward procedure is developed for the synthesis and analysis of transformer-isolated power converters. The procedure can be used to determine the ranges of duty-ratio over which the transformer-isolated power converters of a given class can be operated without transformer saturation. The procedure can also be used to study the dependence of the power converter switch stresses on duty-ratios. This information is useful in the selection of the transformer-isolated power converter most suitable for a given application and in the design of this power converter with minimum switch stresses, high power density, and low cost     

Optimized partitioning of a wavelength distributed data interfacering network

A fiber optic ring network, such as fiber distributed data interface (FDDI), can be operated over multiple wavelengths on its existing fiber plant consisting of point-to-point fiber links. Using wavelength division multiplexing (WDM) technology, FDDI nodes can be partitioned to operate over multiple subnetworks, with each subnetwork operating independently on a different wavelength, and inter-subnetwork traffic forwarding performed by a bridge. For this multiwavelength version of FDDI, which we refer to as wavelength distributed data interface (WDDI), we examine the necessary upgrades to the architecture of a FDDI node, including its possibility to serve as a bridge. The main motivation behind this study is that, as network traffic scales beyond (the single-wavelength) FDDI's information-carrying capacity, its multiwavelength version, WDDI, can gracefully accommodate such traffic growth. A number of design choices exist in constructing a good WDDI network. Specifically, we investigate algorithms using which, based on prevailing traffic conditions, partitioning of nodes into subnetworks can be performed in an optimized fashion. Our algorithms partition the nodes into subrings, such that the total traffic flow in the network and/or the network-wide average packet delay is minimized