In this paper we focus our studies on LTE, which is a development under 3G technologies Release-8 of the 3GPP Project plan and is considered a baseline and step towards the LTE-Advanced. In orthogonal frequency division multiplexing networks, inter-cell interference results in poor performance, especially universal frequency reuse scheme has already been used. Soft Frequency Reuse (SFR) scheme,...

The paper presents the equality of a kernel AdaTron (KA) method (originating from a gradient ascent learning approach) and sequential minimal optimization (SMO) learning algorithm (based on an analytic quadratic programming step) in designing the support vector machines (SVMs) having positive definite kernels. The conditions of the equality of two methods are established. The equality is valid ...

A new parallel symmetric successive over-relaxation (PSSOR) preconditioner is proposed in this paper by the multi-type partition techniques introduced in SIAM J. Scientific Computing 20, 2006, pp. 1513-1533. In a general matrix expression, it is proved to be symmetric and positive-definite if the coefficient matrix of a linear system is symmetric and positive-definite. It is also proved to be e...

There is a current need for scheduling policies that can leverage the performance variability observed when scheduling parallel computations on multi-user clusters. We develop one solution to this problem called stochastic scheduling that utilizes a distribution of application execution performance on the target resources to determine a performance-efficient schedule. In this paper, we define a...

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...

This paper considers a generalization of the classical red/black ordering of grid points for f ini te difference or f i n i t e element discret i z a t i o n s shown t o be effective i n the implementation of the SOR i terat ion method on vector or parallel computers. orderings for different discretizations and implementation on the CDC Cyber 203/205 and the Finite Element Machine i s discussed...

The goal of the paper is to bring to the attention of the computational community a long overlooked, very simple, acceleration method that impressively speeds up explicit time-stepping schemes, at essentially no extra cost. The authors explain the basis of the method, namely stabilization via wisely chosen inner steps (stages), justify it for linear problems, and spell out how simple it is to i...

During the past two decades, the stability of large scaler systems has been studied by numerous authors; many results can be found in the books of Michel and Miller [12] and Siljak [14]. Recently, Liao [7-lo] used the lumped iterations to investigate stabilities of large scale systems and interval matrices. Iterations are the most important methods used to solve algebraic equations in number an...

The numerical solutions of 2-D steady incompressible flow in a driven cavity are presented. The Navier-Stokes equations in streamfunction and vorticity variables are solved simply with Successive Over Relaxation (SOR) method. Using a very fine grid mesh with 1025×1025 points, the steady driven cavity flow is solved for Re 20,000. For accuracy, the iterations are carried out on the streamfunctio...

The Euclidean division of two formal series in one variable produces a sequence of series that we obtain explicitly, remarking that the case where one of the two initial series is 1 is sufficiently generic. As an application, we define a Wronskian of symmetric functions. The Euclidean division of two polynomials P (z), Q(z), in one variable z, of consecutive degrees, produces a sequence of line...