Recent advances in achieving textbook multigrid e ciency for uid simulations are presented. Textbook multigrid e ciency is de ned as attaining the solution to the governing system of equations in a computational work which is a small multiple of the operation counts associated with discretizing the system. Strategies are reviewed to attain this e ciency by exploiting the factorizability propert...

We consider cellular mobile systems where in order to limit hando blocking probability, admission control is applied to new call requests and capacity is reserved for future hando attempts. We show that due to this advance reservation the achievable e ciency of the system has an upper bound even if no constraint is speci ed on the blocking probability of new call requests. As a reference case, ...

This paper analyzes two popular heuristics for ensur ing packet integrity in ATM switching systems In particular we analyze the behavior of packet tail dis carding in order to understand how the packet level link e ciency is dependent on the rates of individual virtual circuits and the degree of the imposed over load In addition we study early packet discard and show that the queue capacity nee...

The e ciency and accuracy of several time integration schemes are investigated for the unsteady Navier-Stokes equations. This study focuses on the e ciency of higher-order Runge-Kutta schemes in comparison with the popular Backward Di erencing Formulations. For this comparison an unsteady two-dimensional laminar ow problem is chosen, i.e. ow around a circular cylinder at Re=1200. It is conclude...

in this paper, downlink resource allocation for a sparse code multiple access (scma) based heterogeneous  cellular networks (hcn) is investigated. the main aim of this paper is to obtain joint power allocation and codebook assignment to achieve the least total system transmit power. in this regard, the proposed objective function is formulated as total transmit power subject to users minimum ra...

here‎, ‎we aim to develop a new algorithm for solving a multiobjective linear programming problem‎. ‎the algorithm is to obtain a solution which approximately meets the decision maker's preferences‎. ‎it is proved that the proposed algorithm always converges to a weak efficient solution and at times converges to an efficient solution‎. ‎numerical examples and a simulation study are used to...

Emerging applications of RFID require high e–ciency of tag identiflcation. Since passive tags have dumb functionality, the efflciency of tag identiflcation in RFID system relies on the performance of the collision arbitration algorithm embedded in a reader. In this paper, we develop a novel collision arbitration algorithm, which is named Q-Algorithm, improving Q-Algorithm which is introduced in...

Stability is often the goal for clearinghouses in matching markets, such as those matching residents to hospitals, students to schools, etc. Stable outcomes absent transfers need not be utilitarian effi cient, suggesting the potential value of transfers. We study the wedge between stability and effi ciency in large one-to-one matching markets. We show stable matchings are effi cient asymptotica...

In this paper, the delete-mj jackknife estimator is proposed. This estimator is based on samples obtained from the original sample by successively removing mutually exclusive groups of unequal size. In a Monte Carlo simulation study, a hierarchical linear model was used to evaluate the role of nonnormal residuals and sample size on bias and eciency of this estimator. It is shown that bias is r...

In this paper, we study convergence and e ciency of the batch estimator and natural gradient algorithm for blind deconvolution. First, the blind deconvolution problem is formulated in the framework of a semiparametric model, and a family of estimating functions is derived for blind deconvolution. To improve the learning e ciency of the online algorithm, explicit standardized estimating function...