Sharif Digital Repository

Employing an admittance representation in the form of a black box model approximated by rational functions for linear power system components or network equivalents to be included in electromagnetic transient studies is a well-known method which improves calculation efficiency. All of the methods that have been proposed to solve the rational approximation problem have made efforts to overcome the problem of preserving the passivity of the final model. Passivity is a vital property, since a non-passive model may lead to an unstable transient simulation in the time domain. In this paper a post-processing technique for passivity enforcement through an iterative process for the detection and... 

In this paper, we first introduce a network of learning automata, which we call it as distributed learning automata and then propose some iterative algorithms for solving stochastic shortest path problem. These algorithms use distributed learning automata to find a policy that determines a path from a source node to a destination node with minimal expected cost (length). In these algorithms, at each stage distributed learning automata determines which edges to be sampled. This sampling method may result in decreasing unnecessary samples and hence decreasing the running time of algorithms. It is shown that the shortest path is found with a probability as close as to unity by proper choice of... 

In this research, a multigrid formulation is suitably developed to accelerate the convergence rate for the solution of the equations arising from the discretization of the two-dimensional incompressible Navier-Stokes equations. The governing equations are treated using an implicit finite element volume method. To achieve our purpose, the solution domain is divided into a large number of quadrilateral elements. Normally, we need utilizing very fine grid resolutions to obtain solution with sufficient accuracy. Unfortunately using the standard implicit solvers on fine grids needs huge computational time. However, it is known that the rate of convergence of classical relaxation schemes reduces... 

In Particle Swarm Optimization (PSO) algorithm, although taking an active role to guide particles moving toward optimal solution, the most-fit candidate does not have a guide itself and only moves along its velocity vector in every iteration. This may yield a noticeable number of agents converge into local optima if the guide (i.e. the most fit candidate) agent cannot explore the best solution. In this paper, an attempt is made to get the advantage of the Ant Colony Optimization (ACO) methodology to assist the PSO algorithm for choosing a proper guide for each particle. This will strengthen the PSO abilities for not getting involved in local optima. As a result, we present a promising new... 

An exact elasto-plastic analytical solution for large-strained internal pressurized thick-walled spherical vessels made of elastic-linear and nonlinear hardening material is derived in this paper. This solution is based on the notion of finite strains, the deformation theory of Hencky and the yield criteria of von Mises and Tresca. Nolinear elastic solution of an axisymetric boundary value problem is used as a basis to generate its inelastic solution, whereas the Hyper-elastic constitutive equation is invoked to represent the material response in the elastic region. This method treats the material parameters as field variables. Their distributions are obtained in an iterative manner using... 

Although GAN-based methods have received many achievements in the last few years, they have not been entirely successful in generating discrete data. The most crucial challenge of these methods is the difficulty of passing the gradient from the discriminator to the generator when the generator outputs are discrete. Despite the fact that several attempts have been made to alleviate this problem, none of the existing GAN-based methods have improved the performance of text generation compared with the maximum likelihood approach in terms of both the quality and the diversity. In this paper, we proposed a new framework for generating discrete data by an adversarial approach in which there is no... 

In this paper, we study the throughput utility functions in buffer-equipped monostatic backscatter communication networks with multi-antenna Readers. In the considered model, the backscatter nodes (BNs) store the data in their buffers before transmission to the Reader. We investigate three utility functions, namely, the sum, the proportional and the common throughput. We design online admission policies, corresponding to each utility function, to determine how much data can be admitted in the buffers. Moreover, we propose an online data link control policy for jointly controlling the transmit and receive beamforming vectors as well as the reflection coefficients of the BNs. The proposed... 

Linear resolvers are position sensors that are being used in a wide range of applications for linear motion systems. The electromagnetic design of a linear resolver, similar to any other electromagnetic device, demands an accurate, functional, and fast tool. While the finite element method (FEM) is considered the most accurate tool for electromagnetic analysis, it is not a good candidate for an optimization-based design which is an iterative process. In this article, first off, an analytical tool based on the subdomain model is briefly presented. This model is very accurate and much faster than FEM. However, it has high computational time for iterative design and optimization processes.... 

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 inexact nonmonotone filter sequential quadratic programming algorithm is presented for solving general constrained nonlinear programming problems. At every iteration, a steering direction is computed as a minimizer of a linear model of the constraint violation over a trust region. A possible infeasible stationary point can be detected using the steering direction. If the current iterate is not an infeasible stationary point, a strongly convex feasible quadratic programming subproblem is defined to compute a search direction as an inexact solution satisfying some loose and achievable conditions. We prove that the search direction is a descent direction for the constraint violation or the... 

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 inexact nonmonotone filter sequential quadratic programming algorithm is presented for solving general constrained nonlinear programming problems. At every iteration, a steering direction is computed as a minimizer of a linear model of the constraint violation over a trust region. A possible infeasible stationary point can be detected using the steering direction. If the current iterate is not an infeasible stationary point, a strongly convex feasible quadratic programming subproblem is defined to compute a search direction as an inexact solution satisfying some loose and achievable conditions. We prove that the search direction is a descent direction for the constraint violation or the... 

In this paper, a parallel algorithm for computing the roots of a given polynomial of degree n on a ring of processors is proposed. The algorithm implements Durand-Kerner's method and consists of two phases: initialization, and iteration. In the initialization phase all the necessary preparation steps are realized to start the parallel computation. It includes register initialization and initial approximation of roots requiring 3n-2 communications, 2 exponentiation, one multiplications, 6 divisions, and 4n-3 additions. In the iteration phase, these initial approximated roots are corrected repeatedly and converge to their accurate values. The iteration phase is composed of some iteration... 

In this study a structured multiblock grid is used to solve two-dimensional transient inverse heat conduction problems. The multiblock method is implemented for geometric decomposition of the physical domain into regions with blocked interfaces. The finite-element method is employed for direct solution of the transient heat conduction equation in a Cartesian coordinate system. Inverse algorithms used in this research are iterative Levenberg-Marquardt and adjoint conjugate gradient techniques for parameter and function estimations. The measured transient temperature data needed in the inverse solution are given by exact or noisy data. Simultaneous estimation of unknown linear/nonlinear... 

In many fast MR imaging techniques, K-space is sampled sparsely in order to gain a fast traverse of K-space. These techniques use non-Cartesian sampling trajectories like radial, zigzag, and spiral. In the reconstruction procedure, usually interpolation methods are used to obtain missing samples on a regular grid. In this paper, we propose an iterative method for image reconstruction which uses the black marginal area of the image. The proposed iterative solution offers a great enhancement in the quality of the reconstructed image in comparison with conventional algorithms like zero filling and neural network. This method is applied on MRI data and its improved performance over other methods... 

An iterative reconstruction-based method for suppression of clipping distortion in OFDM systems is proposed. Analysing the performance of the proposed method in Rician fading channels shows that it outperforms similar techniques, i.e. DFT-based reconstruction and iterative cancellation methods, on both BER performance and computational complexity. © IEE, 2005  

This paper presents a new method for optimization of the dynamic response of structures subjected to seismic excitation. This method is based on the concept of uniform distribution of deformation. In order to obtain the optimum distribution of structural properties, an iterative optimization procedure has been adopted. In this approach, the structural properties are modified so that inefficient material is gradually shifted from strong to weak areas of a structure, This process is continued until a state of uniform deformation is achieved. It is shown that, in general, for a MDOF structure, there exists a specific pattern for distribution of structural properties that results in an optimum... 

In this work, a multigrid acceleration technique is suitably developed for solving the two-dimensional incompressible Navier-Stokes equations using an implicit finite element volume method. In this regard, the solution domain is broken into a huge number of quadrilateral finite elements. The accurate numerical solution of a flow field can be achieved if very fine grid resolutions are utilized. Unfortunately, the standard implicit solvers need more computational time to solve larger size of algebraic set of equations which normally arise if fine grid distributions are used. Past experience has shown that the convergence of classical relaxation schemes perform an initial rapid decrease of... 

In this paper, the vulnerability of large-dimensional dynamic networks to false data injections is analysed. The malicious data can manipulate input injection at the control nodes and affect the outputs of the network. The objective is to analyse and quantify the potential vulnerability of the dynamics by such adversarial inputs when the opponents try to avoid being detected as much as possible. A joint set of most effective actuation nodes and most vulnerable target nodes are introduced with minimal detectability by the monitoring system. Detection of this joint set of actuation-target nodes is carried out by introducing a Gramian-based measure and reformulating the vulnerability problem as... 

In this paper, an analytical solution for the nonlinear free vibration of a conservative oscillator is presented. The nonlinear governing equation is solved by employing the Variational Iteration Method (VIM). This method is based on the use of Lagrange multipliers for identification of optimal values of parameters in a function. Obtained results reveal that the proposed method is very effective, simple and exact. In the present investigation, the results of this method are compared with those of the Homotopy Analysis Method (HAM), as well as those predicted by the Runge-Kutta method. The excellent accuracy of the obtained results is demonstrated by comparing them with available analytical...