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.     

Self and mutual admittance of slot antennas on a dielectric half-space

In this paper, an efficient implementation of the spectral domain moment technique is presented for computing the self and mutual coupling between slot antennas on a dielectric half-space. It is demonstrated that by the proper selection of the weighting functions in the method of moments, the analytic evaluation or simplification of the transverse moment integrals is enabled. This results into a significant reduction of the required computational labor. The method is then utilized in order to provide design data for the self and mutual admittances between two slot antennas on a dielectric substrate lens in the case of fused quartz (∈ _r =3.80), crystal quartz (∈ _r =4.53), silicon (∈ _r =11.9) and GaAs (∈ _r =12.8). The presented technique and associated results are useful when designing twin slot quasi-optical receivers, imaging arrays, phased arrays or power-combining arrays of slot elements at millimeter-wave frequencies.     

Processor membership in asynchronous distributed systems

Presents protocols for determining processor membership in asynchronous distributed systems that are subject to processor and communication faults. These protocols depend on the placement of a total order on broadcast messages. The types of systems for which each of these protocols is applicable are characterized by the properties of the communication mechanisms and by the availability of stable storage. In the absence of stable storage or of a mechanism for distinguishing promptly delivered messages, the authors show that no membership protocol can exist. They also discuss their experience in implementing these membership protocols     

Unstructured tree search on SIMD parallel computers

We present new methods for load balancing of unstructured tree computations on large-scale SIMD machines, and analyze the scalability of these and other existing schemes. An efficient formulation of tree search on an SIMD machine consists of two major components: a triggering mechanism, which determines when the search space redistribution must occur to balance the search space over processors, and a scheme to redistribute the search space. We have devised a new redistribution mechanism and a new triggering mechanism. Either of these can be used in conjunction with triggering and redistribution mechanisms developed by other researchers. We analyze the scalability of these mechanisms and verify the results experimentally. The analysis and experiments show that our new load-balancing methods are highly scalable on SIMD architectures. Their scalability is shown to he no worse than that of the best load-balancing schemes on MIMD architectures. We verify our theoretical results by implementing the 15-puzzle problem on a CM-2 SIMD parallel computer     

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.     

Bounded disorder file organization

The bounded disorder file organization proposed by W. Litwin and D.B. Lomet (1987) uses a combination of hashing and tree indexing. Lomet provided an approximate analysis with the mention of the difficulty involved in exact modeling of data nodes, which motivated this work. In an earlier paper (M.V. Ramakrishna and P. Mukhopadhyay, 1988) we provided an exact model and analysis of the data nodes, which is based on the solution of a classical sequential occupancy problem. After summarizing the analysis of data nodes, an alternate file growth method based on repeated trials using universal hashing is proposed and analyzed. We conclude that the alternate file growth method provides simplicity and significant improvement in storage utilization     

Machine independent AND and OR parallel execution of logicprograms. I. The binding environment

We describe a binding environment for the AND and OR parallel execution of logic programs that is suitable for both shared and nonshared memory multiprocessors. The binding environment was designed with a view of rendering a compiler using this binding environment machine independent. The binding environment is similar to closed environments proposed by J. Conery. However, unlike Conery's scheme, it supports OR and independent AND parallelism on both types of machines. The term representation, the algorithms for unification and the join algorithms for parallel AND branches are presented in this paper. We also detail the differences between our scheme and Conery's scheme. A compiler based on this binding environment has been implemented on a platform for machine independent parallel programming called the Chare Kernel     

Genetic evolution of the topology and weight distribution of neuralnetworks

This paper proposes a system based on a parallel genetic algorithm with enhanced encoding and operational abilities. The system, used to evolve feedforward artificial neural networks, has been applied to two widely different problem areas: Boolean function learning and robot control. It is shown that the good results obtained in both cases are due to two factors: first, the enhanced exploration abilities provided by the search-space reducing evolution of both coding granularity and network topology, and, second, the enhanced exploitational abilities due to a recently proposed cooperative local optimizing genetic operator.