Sharif Digital Repository

We propose a no-go theorem by proving the impossibility of constructing a deterministic quantum circuit that iterates a unitary oracle by calling it only once. Different schemes are provided to bypass this result and to approximately realize the iteration. The optimal scheme is also studied. An interesting observation is that for a large number of iterations, a trivial strategy like using the identity channel has the optimal performance, and preprocessing, postprocessing, or using resources like entanglement does not help at all. Intriguingly, the number of iterations, when being large enough, does not affect the performance of the proposed schemes  

Remote sensing satellites propulsion subsystem preliminary design based on performance sizing is discussed. The process is a fairly complicated one considering a variety of operational as well as performance requirements. This research aims to reduce the number of iterations required by the current practice to reach a compromise. It is based on a rapid-sizing method that helps lessen lengthy iteration cycles. The proposed technique, similar to such class of preliminary design processes, leads to an acceptable approximation that must be properly conveyed to other disciplines involved for further elaborations. With proper selection of design and performance parameters together with fundamental... 

Remote sensing satellites propulsion subsystem preliminary design based on performance sizing is discussed. The process is a fairly complicated one considering a variety of operational as well as performance requirements. This research aims to reduce the number of iterations required by the current practice to reach a compromise. It is based on a rapid-sizing method that helps lessen lengthy iteration cycles. The proposed technique, similar to such class of preliminary design processes, leads to an acceptable approximation that must be properly conveyed to other disciplines involved for further elaborations. With proper selection of design and performance parameters together with fundamental... 

An inverse finite element method (IFEM) has been developed for estimation of the blank size and prediction of the strain distribution in sheet metal forming. In the inverse method the nodal coordinates in the final shape are known and their corresponding positions on the initial blank should be determined. The developed method deals with logarithmic large strains of membrane triangular elements, virtual work principle and a new approach for friction modeling. This method leads to a system of nonlinear equations which is highly sensitive to the initial guess. In order to avoid the converging problems, especially in the quasi-vertical walls, an appropriate initial guess is introduced. The... 

In this paper, we suggest a general model for the fixed-valued impulse noise and propose a two-stage method for high density noise suppression while preserving the image details. In the first stage, we apply an iterative impulse detector, exploiting the image entropy, to identify the corrupted pixels and then employ an Adaptive Iterative Mean filter to restore them. The filter is adaptive in terms of the number of iterations, which is different for each noisy pixel, according to the Euclidean distance from the nearest uncorrupted pixel. Experimental results show that the proposed filter is fast and outperforms the best existing techniques in both objective and subjective performance measures... 

A nonlinear inverse finite element method is developed for estimation of initial blank shape and strain distribution in final shape. This method often based on implicit static algorithms, causes sometimes convergence problems because of strong nonlinearities. In order to avoid the converging problems, especially in the quasi vertical walls, an appropriate initial guess is introduced. By using this initial guess, the number of iterations in the nonlinear numerical solution is decreased, solution speed is significantly increased and complicated geometries can be analyzed by this method with good accuracy. Application to a Srail part shows good agreement between commercially available finite... 

In this paper, a new interaction prediction approach for hierarchical control of non-linear large-scale systems is presented. The proposed approach uses a new gradient-type coordination scheme which is robust with respect to the parameters' variation, and also has a good convergence rate. In classical coordination strategies, which can be divided into the gradient-type and substitution-type approaches, it is not possible to improve the robustness and the convergence rate at the same time, since by increasing one the other decreases. The proposed approach has the main advantages of the gradient-type algorithms in being independent of the parameter's variation and also the initial guess of the... 

In this paper, we study the resource allocation and scheduling problem for a downlink non- orthogonal multiple access (NOMA) network where the base station (BS) allocates the spectrum resources and power to the set of users. We aim to optimize the sub-channel assignment and power allocation to achieve a balance between the number of scheduled users and total sum-rate maximization. To solve the above problem, we propose a many-to-many two-sided user-subchannel matching algorithm in which the set of users and sub-channels are considered as two sets of players pursuing their own interests. The algorithm converges to a pair-wise stable matching after a limited number of iterations. Simulation... 

Point Set Registration (PSR) of anatomic parts is used in different fields such as Patient Specific Implant (PSI) design in Computer Assisted Surgery (CAS) procedure. We designed a modified rigid PSR method based on student's-t mixture model. The proposed method is compared with Coherent Point Drift (CPD) registration method. Higher convergence speed and the lower error value are the advantages of the suggested algorithm in compare with CPD. In our method, the number of iterations decreases by about 69%, and the final error improvement was about 7% in comparison with CPD. The robustness of the proposed algorithm makes it beneficial to be used in the procedure of designing PSI in both... 

In this paper, a new interaction prediction approach is presented for optimal control of nonlinear large-scale systems. The proposed approach uses a new gradient-type coordination scheme which has a larger convergence region with respect to the parameters' variation, and also has a good convergence rate. In this approach, the coordination vector is updated using the gradient of coordination error. This type of coordination considerably reduces the number of iterations. The robustness and the convergence rate of the proposed approach against the best classical interaction prediction approaches are shown through simulations of a benchmark problem. © 2008 IEEE  

In this study, a new method is presented for transmission expansion planning in restructured power systems. In this method, the future values of maximum load demanded, bid of generators to sell power and bid of consumers to buy power are assumed uncertain. The objective of the planning problem is the minimization of the total investment cost. The constraint of the problem is satisfying two constraints with a high probability: first, the total congestion costs must be limited to a certain value and second the n-1 reliability criterion must be satisfied by the transmission network. Due to extent of the problem solution space in this study, simulated annealing algorithm is used to determine the... 

In this paper a general variable material property (VMP) formulation for the solution of thick-walled tubes with constant axial strains was developed and compared with the alternative VMP method that is called the Hencky program The VMP method was initially developed for the analysis of plane stress and plane strain states. However, the actual autofrettage process is under constant axial strain, i.e., open-end and closed-end conditions. Results indicate very good agreement with the Hencky program. Our method is simple, accurate, and very efficient, so that the number of iterations for convergence reduces approximately to one-tenth of Hencky program iterations. The solution algorithm for... 

In this paper, a novel computational algorithm is proposed for hierarchical optimal control of nonlinear systems. The hierarchical control uses a new coordination strategy based on the gradient of the coordination errors. This type of coordination extremely reduces the number of iterations required for obtaining the overall optimal solution. The performance and the convergence rate of the proposed approach, in compare to the classical gradient-type interaction prediction approach, is shown through simulations of a benchmark continuous stirred tank reactor (CSTR) problem. ©2008 IEEE  

The practicality of robust model predictive control of systems with model uncertainties depends on the time consumed for solving a defined optimization problem. This paper presents a method for the computational complexity reduction in a robust model predictive control. First a scaled state vector is defined such that the objective function contours in the defined optimization problem become vertical or horizontal ellipses or circles, and then the control input is determined at each sampling time as a state feedback that minimizes the infinite horizon objective function by solving some linear matrix inequalities. The simulation results show that the number of iterations to solve the problem... 

Bus network design is an important problem in public transportation. In practice, some parameters of this problem are uncertain. We propose two models for the bus terminal location problem with fuzzy parameters. In the first formulation, the number of passengers corresponding to each node is a fuzzy number. In the second formulation, an additional assumption of fuzzy neighborhood is considered. These problems being NP-hard, we use a genetic algorithm (GA) and a simulated annealing (SA) algorithm for solving them. We also propose an idea to hybridize these algorithms. In our hybrid algorithm, SA is applied as a neighborhood search procedure of GA on the best individual of the population,... 

Semi-Supervised Learning (SSL) has become a topic of recent research that effectively addresses the problem of limited labeled data. Many SSL methods have been developed based on the manifold assumption, among them, the Local and Global Consistency (LGC) is a popular method. The problem with most of these algorithms, and in particular with LGC, is the fact that their naive implementations do not scale well to the size of data. Time and memory limitations are the major problems faced in large-scale problems. In this paper, we provide theoretical bounds on gradient descent, and to overcome the aforementioned problems, a new approximate Newton's method is proposed. Moreover, convergence... 

In this paper, a multiproduct single vendor-single buyer supply chain problem is investigated based on the economic production quantity model developed for the buyer to minimize the inventory cost. The model to be more applicable for real-world supply chain problems contains five stochastic constraints including backordering cost, space, ordering, procurement, and available budget. The objective is to find the optimal order quantities of the products such that the total inventory cost is minimized while the constraints are satisfied. The recently-developed sequential quadratic programming (SQP), as one of the best optimization methods available in the literature, is used to solve the... 

Numerical approximation based on different forms of the governing partial differential equation can lead to significantly different results for two-phase flow in porous media. Selecting the proper primary variables is a critical step in efficiently modeling the highly nonlinear problem of multiphase subsurface flow. A comparison of various forms of numerical approximations for two-phase flow equations is performed in this work. Three forms of equations including the pressure-based, mixed pressure-saturation and modified pressure-saturation are examined. Each of these three highly nonlinear formulations is approximated using finite difference method and is linearized using both Picard and... 

In this paper, a new decomposition-coordination framework is presented for two-level optimal control of large-scale nonlinear systems. In the proposed approach, decomposition is performed by defining an interaction vector, while coordination is based on a new interaction prediction approach. In the first level, sub-problems are solved for nonlinear dynamics using a gradient method, while in the second level, the coordination is done using the gradient of coordination errors. This is in contrast to the conventional gradient-type coordination schemes, where they use the gradient of Lagrangian function. It is shown that the proposed decomposition-coordination framework considerably reduces the... 

An stochastic version of the classical shortest path problem whereby for each node of a graph, a probability distribution over the set of successor nodes must be chosen so as to reach a certain destination node with minimum expected cost. In this paper, we propose a new algorithm based on Particle Swarm Optimization (PSO) for solving Stochastic Shortest Path Problem (SSPP). The comparison of our algorithm with other algorithms indicates that its performance is suitable even by the less number of iterations. © 2008 Springer-Verlag Berlin Heidelberg