Algorithms For Basic Operations Research Articles

Basic principles of vehicle suspension control

The paper is devoted to the description of the basic operation principles of control systems over suspension (cushioning) system elements of a vehicle. The basic operation algorithms, as well as the basic principles of change of properties of suspension or cushioning components under different vehicle driving conditions, are presented. The list of sensors and signals, which shall be present in the system to ensure its effective operation, is proposed. The results of experimental analysis of the pneumatic elastic element (air bellows) stiffness and the results of computer simulation of the vehicle behavior when turning are additionally presented.

Statistical models of machinery milking duration

The need for developing a new statistical model of the mechanical milking duration, which allows increasing the accuracy of determining the productivity of a milking machine at its design or upgrade stages, has been specified. In addition, the model development will allow working out a technique for designing data-measuring systems of milk production process parameters. The basic operation algorithms of modern milking machines have been considered in the paper. Based on the conducted experimental studies it has been estimated that the distribution of duration for preparing animals for milking equals to a chi-square distribution, the distribution of the milking time when employing milking machines with no milking control function and the distribution of random milking time intervals using the milking control function equals to a gamma distribution. A statistical model of a mechanical milking duration using a milking robot, a milking machine without the milking control function, a milking machine with the milking control function, which takes into account the minimum operation duration of a milking machine, has been developed.

Summation and routing on a partitioned optical passive stars network with large group size

In a partitioned optical passive stars (POPS) network, n=dg processors are divided into g groups of d processors each, and such a POPS network is denoted by POPS(d,g). There is an optical passive star (OPS) coupler between every pair of groups. Hence, a POPS(d,g) requires g/sup 2/ couplers. It is likely that, in a practical system, the number of couplers will be less than the number of processors, i.e., d>/spl radic/n>g and the number of groups will be smaller than the number of processors in a group. Hence, it is important to design fast algorithms for basic operations on such POPS networks with large group size. We present fast algorithms for data sum, prefix sum, and permutation routing on a POPS(d,g) such that d>/spl radic/n>g. Our data sum and prefix sum algorithms improve upon the best known algorithms for these problems designed by Sahni (2000). Permutation routing can be solved on a POPS network by simulating a hypercube sorting algorithm. Our algorithm for permutation routing is more efficient compared to this simulated hypercube sorting algorithm.

Representing Subgroups of Finitely Presented Groups by Quotient Subgroups

This article proposes to represent subgroups of finitely presented groups by their image in a quotient. It gives algorithms for basic operations in this representation and investigates how iteration of this approach can be used to extend known quotients groups with a solvable normal subgroup.