Sharif Digital Repository

In this letter, the problem of non-coherent direction of arrival (DOA) estimation is investigated exploiting the sign of the measurements in order to resolve the inherent ambiguity of the problem. Although the phase values are inaccurate, the sign of real and imaginary parts of the measurements will most likely remain correct under limited phase errors. Furthermore, a new approach for solving the problem is proposed employing a modified version of the Majorization-Minimization (MM) technique, without any prior information about the number of incident signals. Some theoretical analyses of our proposed algorithm are also provided in the paper. Finally, the simulation results are presented,... 

In multi-label classification problems, each instance can simultaneously have multiple labels. Since the whole number of available labels in real-world applications tends to be (very) large, multi-label classification becomes an important challenge and recently label space dimension reduction (LSDR) methods have received attention. These methods first encode the output space to a low-dimensional latent space. Afterwards, they predict the latent space from the feature space and reconstruct the original output space using a suitable decoding method. The encoding method can be implicit which learns a code matrix in the latent space by solving an optimization problem or explicit which learns a... 

The quickest path reliability problem evaluates the probability of transmitting some given units of flow from a source node to a sink node through a single minimal path in a stochastic-flow network within some specified units of time. This problem has been recently extended to the case of transmitting flow through q separate minimal paths (SMPs) simultaneously within a budget constraint. Here, we propose a new algorithm to solve such problems. The algorithm finds all the minimal vectors for which a given demand level d units of flow can be transmitted through q SMPs from a source node to a sink node satisfying some given time and budget limits. In our proposed algorithm, a special... 

In this research, the no-wait flowshop sequence dependent group scheduling problem with minimisation of total completion time, noted as Fm|nwt, fmls, Splk|∑Cj is approached. A mixed integer linear mathematical model is proposed for the research problem. Due to the NP-hard nature of the proposed problem, several metaheuristic algorithms based on particle swarm optimisation and variable neighbourhood search with different neighbourhood search structures are proposed to heuristically solve the problem. Also, an efficient heuristic algorithm is proposed to generate the initial feasible solutions for the proposed algorithms. The performances of the proposed algorithms are compared with each other... 

In this research, we approach the flowshop sequence-dependent group scheduling problem with minimisation of total weighted earliness and tardiness as the objective for the first time. A mixed integer linear programming model is developed to solve the problem optimally. Since the proposed research problem is proven to be NP-hard, a hybrid meta-heuristic algorithm based on the particle swarm optimisation (PSO) algorithm, enhanced with neighbourhood search is developed to heuristically solve the problem. Since the objective is a non-regular, a timing algorithm is developed to find the best schedule for each sequence provided by the metaheuristic algorithm. A lower bounding method is also... 

For a moving camera recognizing that it has seen a place before now, is one the most important issues in the 3D reconstruction problems. In these problems, the main goal is to create a three-dimensional model from a sequence of 2D captured images during different times. That part of the scene which is rendered by a camera is often modeled by a frustum. Calculating the amount of intersection of two camera view frustums at different times can help to solve this problem. However, there are two major difficulties. First, calculating the intersection of two frustums, in general, is so complicated. And second, there are some uncertainties in the moving camera parameters over time. In this paper,... 

One of the most important issues discussed in multi-agent systems, is communication between agents. Usually, a predefined communication protocol is used, but predefining a protocol between agents causes some problems; for example it is possible that agents recognize a subject that is not defined in their protocol so they can't express anything about it. In this paper we propose a new method for evolution of a communication protocol between intelligent agents by using natural selection mechanism. Experimental results will be discussed in detail. © 2006 IEEE  

In this study, two methods for solving economic dispatch problems, namely Hopfield neural network and X iteration method are compared. Three sample of power system with 3, 6 and 20 units have been considered. The time required for CPU, for solving economic dispatch of these two systems has been calculated. It has been shown that for on-line economic dispatch, Hopfield neural network is more efficient and the time required for convergence is considerably smaller compared to classical methods. © 2006 IEEE  

One of the most important issues that be discussed in multi-agent systems, is the communication between agents. In existing applications usually a communication protocol defined between agents. But defining a protocol between agents cause some problems; for example it is possible that agents recognize a subject, but because it is not defined in their protocol, they can't express any thing about that. In this paper we propose a new method for evolution of a communication protocol between intelligent agents, after that the experimental results will be discussed and at the end of the paper future works and conclusion. Copyright - World Automation Congress (WAC) 2006  

Current massively parallel systems are often composed of hundreds or thousand of components (such as routers, channels and connectors) that collectively possess failure rates higher than what arise in the ordinary systems. Therefore, these systems are required to he equipped with fault-tolerant mechanisms to ensure that the system will keep running in a degraded made until the failed component in repaired. Normally, the faulty components are coalesced into fault regions which may be classified into two major categories: convex and concave regions. In this paper, we propose the first general solution to calculate the probability of occurrences of common fault patterns in torus networks which... 

In ubiquitous computing environments, many devices and agents interoperate with each other and use services provided by others. But the problem is that there may be requests that can not be fulfilled by available services. A solution to this problem is to use service brokers that compose existing services and create new value added services that can fulfill the clients' requests. In this paper, we present an architecture for a context-aware service broker that not only is able to compose services for responding to new requests, but also considers the context of its clients for providing customized and personalized outputs and behaviors. © 2006 IEEE  

We consider the problem of minimizing rank of a matrix under linear and nonlinear matrix inequality constraints. This problem arises in diverse applications such as estimation, control and signal processing and it is known to be computationally NP-hard even when constraints are linear. In this paper, we first formulize the RMP as an optimization problem with linear objective and simple nonlinear semialgebraic constraints. We then proceed to solve the problem with augmented Lagrangian method known in nonlinear optimization. Despite of other heuristic and approximate methods in the subject, this method guarantees to find the global optimum in the sense that it does not depends on the choice of... 

Predictive functional controller originally developed based on a first order reference model. In this paper the related equation of the predictive functional control is derived for an arbitrary reference model and then a simple approach to tune different parameters of the controller is examined by applying the controller on a benchmark problem. Finally, the robustness of the design is improved using the so called Youla parameterization approach. © 2005 IEEE  

The star graph, as an interesting network topology, has been extensively studied in the past. In this paper, we address some of the combinatorial properties of the star graph. In particular, we consider the problem of calculating the surface area of the star graph, answering an open problem previously posed in [12]. © 2005 IEEE  

Application of a flux search controller in direct torque control of induction motor drives produces divergence problem and steady state flux ripple, because of the disturbance in the control loop. In this paper, an investigation about the origin of this noise has been performed. It is shown that the variation of voltage harmonics is the main reason of disturbance in the flux control loop. The minimum allowable value of flux step has been determined based on this analysis to prevent the divergence problem. Feasibility of noise cancellation has been discussed. Experimental results are presented to justify the theoretical analysis. © 2005 IEEE  

In rail transportation, the process of finding the optimal movement of freight goods is considered a tactical level of rail planning. Solving this problem requires one simultaneously to address the railroad blocking problem and the train dispatching problem, which is difficult. Additionally, when these problems are represented by mathematical relations, application of the solution leads to unexpected results in the real world. The main objective of this research was to build a simulation environment to represent the key behaviours of typical and applicable constraints of a railway system. This environment provides a tool with which to evaluate different decisions among a list of candidate... 

This paper deals with learning an overcomplete set of atoms that have low mutual coherence. To this aim, we propose a new dictionary learning (DL) problem that enables a control on the amounts of the decomposition error and the mutual coherence of the atoms of the dictionary. Unlike existing methods, our new problem directly incorporates the mutual coherence term into the usual DL problem as a regularizer. We also propose an efficient algorithm to solve the new problem. Our new algorithm uses block coordinate descent, and updates the dictionary atom-by-atom, leading to closed-form solutions. We demonstrate the superiority of our new method over existing approaches in learning low-coherence... 

The dissimilar wedge with finite radius under antiplane shear deformation is analyzed. The finite Mellin transform is used to solve the governing differential equation. By simply letting the wedge radius approaches infinity, the solution is obtained  

This study presents a parallel evolutionary optimization approach to determine optimal management strategies of large-scale coastal groundwater problems. The population loops of evolutionary algorithms (EA) are parallelized using shared memory parallelism to address the high computational demands of such applications. This methodology is applied to solve the management problems in an aquifer system in Kish Island, Iran using a three-dimensional density-dependent groundwater numerical model. EAs of continuous ant colony optimization (CACO), particle swarm optimization, and genetic algorithm are utilized to solve the optimization problems. By implementing the parallelization strategy, a... 

Instead of charging tolls on individual links, this paper considers doing the same on paths. Path and link tolls are "valid" if they encourage motorists to use routes that collectively lead to a target distribution, e.g., one that minimizes travel delay. Because the numbers of valid link and path tolls are typically infinite, an objective in pricing tolls is to find a set of valid tolls that yields the least revenue to lessen the financial burden on motorists.Path tolls are generally more flexible than link tolls and this paper shows that this flexibility can substantially reduce the financial burden on motorists. Additionally, valid path tolls yielding the least revenue possess...