This work develops a morphing decision strategy to optimize the cruising efficiency for variable-sweep aircraft, and simple practical guidance control system is given as well. They can in tandem accomplish cruise mission effectively. To make accurately, we take into account equilibrium equations of forces; variations airspeed, altitude, mass optimal configurations different conditions are solve...

This paper describes our work in solving path planning problem for mobile robot by using harmonic functions to generate path in the configuration space. Harmonic functions are known to have an advantage as a global potential function in the potential field based approach for robot path planning. However, an immense amount of computations are required as the size of the environment get bigger. T...

Multipartitioning is a skewed-cyclic block distribution that yields better parallel efficiency and scalability for line-sweep computations than traditional block partitionings. This paper describes extensions to the Rice dHPF compiler for High Performance Fortran that enable it to support multipartitioned data distributions and optimizations that enable dHPF to generate efficient multipartition...

The low-permeability oil and gas resources of our country are quite common and abundant. Their reserve has accounted for one-fifth of total oil reserves of our country, and their yield has constituted the important part of national petroleum annual yield, but its development is very difficult. Polymer gel technology is a technical method of improving sweep efficiency in recent years which subst...

In the previous studies, the effectiveness of the Arithmetic Mean (AM) iterative method and its variants for solving various scientific problems has been investigated. Consequently, in this paper, the implementation and performance one of the AM method variants i.e. Quarter-Sweep Arithmetic Mean (QSAM) method for solving dense linear system associated with the numerical solution of first kind l...

This paper is concerned with a memory-efficient representation of reachability graphs. We describe a technique that enables us to represent each reachable marking in a number of bits close to the theoretical minimum needed for explicit state enumeration. The technique maps each state vector onto a number between zero and the number of reachable states and uses the sweep-line method to delete th...

A new generalized Voronoi diagram is defined on the surface of a river with unifonn flow; a point belongs to the territory of a site if and only if a boat starting from the site can reach the point faster than a boat starting from any other site. If the river runs slower than the boat, the Voronoi diagram can be obtained from the ordinary Voronoi diagram by a certain transformation, whereas if ...