Sharif Digital Repository

We investigate the possibility of correcting errors occurring on a multipartite system through a feedback mechanism that acquires information through partial access to the environment. A partial control scheme of this type might be useful in dealing with correlated errors. In fact, in such a case, it could be enough to gather local information to decide what kind of global recovery to perform. Then, we apply this scheme to the depolarizing and correlated errors and quantify its performance by means of entanglement fidelity  

Partially-observed network data collected by link-tracing based sampling methods is often being studied to obtain the characteristics of a large complex network. However, little attention has been paid to sampling from directed networks such as WWW and Peer-to-Peer networks. In this paper, we propose a novel two-step (sampling/estimation) framework to measure nodal characteristics which can be defined by an average target function in an arbitrary directed network. To this end, we propose a personalized PageRank-based algorithm to visit and sample nodes. This algorithm only uses already visited nodes as local information without any prior knowledge about the latent structure of the network.... 

Signal machines form an abstract and idealized model of collision computing. Based on dimensionless signals moving on the real line, they model particle/signal dynamics in Cellular Automata. Each particle, or signal, moves at constant speed in continuous time and space. When signals meet, they get replaced by other signals. A signal machine defines the types of available signals, their speeds, and the rules for replacement in collision. A signal machine A simulates another one B if all the space-time diagrams of B can be generated from space-time diagrams of A by removing some signals and renaming other signals according to local information. Given any finite set of speeds S we construct a... 

Multiscale finite volume (MSFV) method have been developed and applied in various complicated physics. The most important advantage of MSFV method is its computational efficiency. In this paper we present a new set of boundary condition for calculation of basis and correction functions which leads to further reduction in computational time in problems with medium heterogeneity and therefore improves computational efficiency. In standard MSFV (sMSFV) method reduced boundary condition is used to determine the basis and correction functions which is based on local information, however in modified MSFV (mMSFV) method global information is used at initial time for constructing boundary condition... 

Partially-observed data collected by sampling methods is often being studied to obtain the characteristics of information diffusion networks. However, these methods usually do not consider the behavior of diffusion process. In this paper, we propose a novel two-step (sampling/estimation) measurement framework by utilizing the diffusion process characteristics. To this end, we propose a link-tracing based sampling design which uses the infection times as local information without any knowledge about the latent structure of diffusion network. To correct the bias of sampled data, we introduce three estimators for different categories, link-based, node-based, and cascade-based. To the best of... 

In this study, a hierarchical optimal robust controller is presented for the power system load-frequency control problem. In this approach, the multi-area power system is first decomposed into several sub-systems (areas). Then by using a two-level control strategy, the overall optimal solution is obtained. At the first level, the optimal control of each area is obtained with respect to local information and also considering interactions coming from other areas. At the second level, by using a coordination strategy, the local controllers will converge to global solution and optimal robust controller is achieved. This approach is applicable to both single-area and multi-area interconnected... 

In this paper, we consider a control strategy of multi-robot systems, or simply, swarms, based on emotional control technique. First, we briefly discuss a "kinematic" swarm model in n-dimensional space introduced in an earlier paper. In that model, motion of every swarm member is governed by predefined inter-individual interactions. Limitations of every member's field of view are also considered in that model. After that, we consider a general model for vehicle dynamics of each swarm member, and use emotional control theory to force their motion to obey the dynamics of the kinematic model. Based on the kinematic model, stability (cohesion) analysis is performed and coordination controller.is... 

Flocking through leader following structures in mobile networks raises attractive control problems. Due to limited sensing radii, leaders locally influence a network of agents. In this paper, we consider the problem of real-time maximization of flocking velocity. By using local information and a Particle-Swarm-Optimization (PSO) algorithm, a Leader Agent (LA) actively motivates flocking at high speed. The LA manages topology of the network in its neighborhood and increases flocking velocity. PSO output quality and calculation costs show that the proposed optimization algorithm is practically feasible. A case-study is also presented  

Flocking through leader following structures in mobile networks raises attractive control problems. Due to limited sensing radii, leaders locally influence a network of agents. In this paper, we consider the problem of real-time maximization of flocking velocity. By using local information and a Particle-Swarm-Optimization (PSO) algorithm, a Leader Agent (LA) actively motivates flocking at high speed. The LA manages topology of the network in its neighborhood and increases flocking velocity. PSO output quality and calculation costs show that the proposed optimization algorithm is practically feasible. A case-study is also presented  

A task migration scheme for homogeneous chip multiprocessors (CMP) is presented in this paper. The proposed migration mechanism focuses on the communication sub-system and aims to reduce the total power consumption and latency of the network-on-chip (NoC). In this work, starting from an initial mapping, the tasks migrate to new cores in such a way that the distance between the end-point nodes of high-volume communication flows is reduced. Finding the new place for a task is done in a distributed manner by applying an iterative local search that relies on the local information of each task about its communication demand. The task migration procedure also includes a pre-migration step that... 

In this paper, we consider a control strategy of multi-robot systems, or simply, swarms, based on emotional control technique. First, we briefly discuss a "kinematic" swarm model in n-dimensional space introduced in an earlier paper. In that model, motion of every swarm member is governed by predefined inter-individual interactions. Limitations of every member's field of view are also considered in that model. After that, we consider a general model for vehicle dynamics of each swarm member, and use emotional control theory to force their motion to obey the dynamics of the kinematic model. Based on the kinematic model, stability (cohesion) analysis is performed and coordination controller is... 

Rate, energy and delay are three main parameters of interest in ad-hoc networks. In this paper, we discuss the problem of maximizing network utility and minimizing energy consumption while satisfying a given transmission delay constraint for each packet. We formulate this problem in the standard convex optimization form and subsequently discuss the tradeoff between utility, energy and delay in such framework. Also, in order to adapt for the distributed nature of the network, a distributed algorithm where nodes decide on choosing transmission rates and probabilities based on their local information is introduced. ©2009 IEEE  

This paper addresses the problem of optimal power allocation in multiuser OFDM ad-hoc networks. Our objective is to maximize the weighted rate-sum of users under total transmit power constraint. Maximizing a weighted rate-sum is more amenable whereas appropriate weight assignment to different users, guarantees fairness among users. We propose a distributed algorithm for optimal power allocation based on reaching a consensus among users for power allocation. The proposed algorithm is tractable in the sense of computational complexity and requires only local information at each node. Simulation results and the analysis of the algorithm are presented to support the proposed idea. © 2006 IEEE