Sharif Digital Repository

Direction-of-arrival (DOA) estimation algorithms usually impose high computation burden and most of them are incapable of facing the coherent sources. In this paper, a new computationally efficient algorithm that is robust against the coherent sources is proposed. This method is based on a combination of the Maximum Likelihood (ML) and Orthogonal-Matching-Pursuit (OMP) algorithms. Simulation results show that the proposed algorithm has good performance in the small sample size cases and the coherency does not affect its performance  

A new acceleration technique for the ray tracing algorithm was presented in this paper. Instead of reducing the number of intersection tests, our proposed method finds the solid angles around the transmitter that transport electromagnetic power to the receiver. Then, high-resolution rays are sent out only in these solid angles and the procedure continues iteratively. Since a few rays are traced in each iteration, high resolution can be achieved within acceptable amount of time  

An efficient superresolution (resolution enhancement) method for low resolution images is proposed in this paper. The algorithm is mainly based on a mathematical theorem (inhibition principle) for overdetermined scenario of superresolution. The proposed method aims at achieving a fast and computationally efficient resolution enhancement. Performance of the proposed method is compared to the conventional Farsiu method to show that with less computational complexity the proposed method results in comparable and sometimes slightly better high resolution images. The proposed method can be considered as an improvement to the Farsiu method. © 2009 IEEE  

Ray tracing has been widely accepted as a versatile and reliable method for indoor propagation modeling. Several published articles have addressed the computational efficiency and reliability as the most challenging problems of ray tracing and have presented various solutions. Such challenges are discussed in this paper and some possible solutions are presented  

In this paper we consider a two-level inventory system with one warehouse and one retailer with information exchange. The retailer applies fixed order size continuous review policy. The supplier starts with m initial batches of the same order size of the retailer, and places an order to an outside source immediately after the retailer's inventory position reaches an amount equal to the retailer's order point plus a fixed value s. Transportation times are constant and the retailer faces independent Poisson demand. In a recent paper it was pointed out that the optimal supplier policy in this inventory system is an open question. To obtain the optimal policy for this system, first we find the... 

In this paper, we introduce a new method and new motion variables to study kinematics and dynamics of a 6 d.o.f cable-driven robot. Using these new variables and Lagrange equations, we achieve new equations of motion which are different in appearance and several aspects from conventional equations usually used to study 6 d.o.f cable robots. Then, we introduce a new Jacobian matrix which expresses kinematical relations of the robot via a new approach and is basically different from the conventional Jacobian matrix. One of the important characteristics of the new method is computational efficiency in comparison with the conventional method. It is demonstrated that using the new method instead... 

This paper presents a recursive approach for solving kinematic and dynamic problems in snake-like robots using Kane's equations. An n-link model with n-nonholonomic constraints is used as the snake robot model in our analysis. The proposed algorithm which is used to derive kinematic and dynamic equations recursively, enhances the computational efficiency of our analysis. Using this method we can determine the number of additions and multiplications as a function of n. The proposed method is compared with the Lagrange and Newton-Euler's method in three different aspects: Number of operations, CPU time and error in the computational procedures. © 2006 Cambridge University Press  

Maximum likelihood naturally arises as the target criterion for detection in many applications as well as in layered space-time communications. Nevertheless, the existing algorithms for maximum-likelihood decoding have computational complexity that is not feasible for implementation in practical systems. Applying the Expectation-Maximization algorithm to the Maximum Likelihood detection of layered space-time codes, we iteratively maximize the conditional log-likelihood of a single layer, rather than maximizing the intractable likelihood function of all layers. Computer simulations demonstrate the efficiency of the proposed detection scheme, in comparison to the well known nulling and... 

In this paper, a bi-objective multi-products economic production quantity (EPQ) model is developed, in which the number of orders is limited and imperfect items that are re-workable are produced. The objectives of the problem are minimization of the total inventory costs as well as minimizing the required warehouse space. The model is shown to be of a bi-objective nonlinear programming type, and in order to solve it two meta-heuristic algorithms namely, the non-dominated sorting genetic algorithm (NSGA-II) and multi-objective particle swarm optimization (MOPSO) algorithm, are proposed. To verify the solution obtained and to evaluate the performance of proposed algorithms, two-sample t-tests... 

A new simple window function is presented, which for the same window order (M), has a main-lobe width less than or equal to that of the Hamming window, while offering about 2-4.5 dB smaller peak side-lobe amplitude. Furthermore, just like the Hamming window, it is computationally efficient for signal spectrum analysis; this is because of the fact that, the sum of window coefficients with its shifted version by M/2 samples (i.e. 50% overlap) is constant for the overlapped region. The new window is obtained by adding the third harmonic of the cosine function to the Hamming window, and finding the appropriate amplitudes of DC term, cosine function, and its third harmonic to minimise the peak... 

In this paper, an automated adaptive remeshing procedure is presented for simulation of arbitrary shape crack growth in multiple cracked bodies. The Zienkiewicz-Zhu error estimator is employed in conjunction with the modified superconvergent patch recovery (SPR) technique to obtain more accurate estimation of error. A stability analysis is performed to determine active cracks from a set of competitive cracks. Various crack growth criteria together with the respective crack trajectory prediction are compared. Several numerical examples are illustrated to demonstrate the efficiency, robustness and accuracy of computational algorithm in the simulation of multiple crack growth  

This study presents a new ray tracing acceleration technique for site-specific propagation modelling in indoor environments. It overcomes one of the major problems regarding the computational efficiency of shooting-and-bouncing-ray (SBR) method, that is most of the rays emitted from the source do not reach the receiver whereas all of them must be traced. Our proposed method solves this problem in a two-step procedure based on the idea of line search theory. In the first step, called the bracketing phase, the solid angles around the transmitter that transport electromagnetic power to the receiver are determined. In the second step, called the sectioning or zoom phase, the accuracy is improved... 

Employing femtocell technology noticeably improves both the indoor coverage and the overall cellular network's capacity. In the downlink scenario, when macrocell users (MUs) are far from the macro base station (MBS) and close to the femto access points (FAPs), the transmitted signals of FAPs to their users cause severe interference on MUs. One solution to overcome this issue is serving MUs by neighbouring FAPs. Generally femtocells are selfish and have no desire to allocate their resources to MUs. In this study, a framework to motivate femtocells to share their free resources with MUs is proposed. In this framework, the femtocells are assumed to belong to a specific unit. The unit encourages... 

Most of the biped robots are controlled using pre-computed trajectory methods or methods based on multi-body dynamics models. The pre-computed trajectory-based methods are simple; however, a system becomes highly vulnerable to the external disturbances. In contrast, dynamic methods make a system act faster, yet extensive knowledge is required about the kinematics and dynamics of the system. This fact gave rise to the main purpose of this study, i.e., developing a controller for a biped robot to take advantage of the simplicity and computational efficiency of trajectory-based methods and the robustness of the dynamic-based approach. To do so, this paper presents a two-layer hierarchical... 

This work, based on the standard unscented Kalman filter (UKF), proposes a modified UKF for highly non-linear stochastic systems, assuming that the associated probability distributions are normal. In the standard UKF with 2n + 1 sample points, the estimated mean and covariance match the true mean and covariance up to the third order, besides, there exists a scaling parameter that plays a crucial role in minimising the fourth-order errors. The proposed method consists of a computationally efficient formulation of the unscented transform that incorporates N - 1, N ≥ 2, constant parameters to scale 2n(N - 1) + 1 sample points such that the 2Nth order errors are minimised. The scaling parameters... 

time-optimal problem for redundantly actuated robots moving on a specified path is a challenging problem. Although the problem is well explored and there are proposed solutions based on phase plane analysis, there are still several unresolved issues regarding calculation of solution curves. In this paper, we explore the characteristics of the maximum velocity curve and propose an efficient algorithm to establish the solution curve. Then we propose a straightforward method to calculate the maximum or minimum possible acceleration on the path based on the pattern of saturated actuators, which substantially reduces the computational cost. Two numerical examples are provided to illustrate the... 

Purpose: This paper aims to numerically study the compositional flow of two- and three-phase fluids in one-dimensional porous media and to make a comparison between several upwind and central numerical schemes. Design/methodology/approach: Implicit pressure explicit composition (IMPEC) procedure is used for discretization of governing equations. The pressure equation is solved implicitly, whereas the mass conservation equations are solved explicitly using different upwind (UPW) and central (CEN) numerical schemes. These include classical upwind (UPW-CLS), flux-based decomposition upwind (UPW-FLX), variable-based decomposition upwind (UPW-VAR), Roe’s upwind (UPW-ROE), local Lax–Friedrichs... 

The current paper focuses on the non-linear torsional vibration of a one-stage transmission gear system. Four different methods have been applied for solution of the equation of motion; the discretization method, the perturbation method, the Ritz method, and the stepwise time integration of the equation of motion. The time and frequency results from these analyses have been compared with each other, as well as those reported in literatures. Although all of these methods are accurate and computationally effective for finding the main spectral contribution, however, only the discretization method and the step-wise time-integration model are able to identify the other frequency components. ©... 

Hardware/Software partitioning is one of the most important issues of codesign of embedded systems, since the costs and delays of the final results of a design will strongly depend on partitioning. We present an algorithm based on Particle Swarm Optimization to perform the hardware/software partitioning of a given task graph for minimum cost subject to timing constraint. By novel evolving strategy, we enhance the efficiency and result's quality of our partitioning algorithm in an acceptable run-time. Also, we compare our results with those of Genetic Algorithm on different task graphs. Experimental results show the algorithm's effectiveness in achieving the optimal solution of the HW/SW... 

A multiple-choice knapsack problem can be formulated as a discrete nonlinear knapsack problem (DNKP). A powerful method for solving DNKP is the dynamic programming solution approach. The use of this powerful approach however is limited since the growth of the number of decision variables and state variables requires an extensive computer memory storage and computational time. In this paper we developed a hybrid algorithm for improving the computational efficiency of the dynamic programming when it is applied for solving the DNKP. In the hybrid algorithm, three routines of the imbedded state, surrogate constraints, and bounding scheme are incorporated for increasing the efficiency of this...