In this paper we present how to reconfigure dynamically a complete binary tree in faulty hypercubes. First, we use a dynamic algorithm to reconfigure a complete binary tree of height h (h≥0) in an (h+1)-dimensional faulty hypercube. If there is a faulty node in the hypercube, both the dilation and congestion are 2 after reconfiguration. If there are two faulty nodes in the hypercube, both the d...

Reconfiguration allows a self-reconfiguring modular robot to adapt to its environment. The reconfiguration planning problem is one of the key algorithmic challenges in realizing self-reconfiguration. Many existing successful approaches rely on grouping modules together to act as meta-modules. However, we are interested in reconfiguration planning that does not impose fixed meta-module relations...

We propose the redistribution-reconfiguration~(red-rec) algorithm to efficiently compute control protocols assemble compact-centered configurations of atoms in two-dimensional arrays optical traps with lattice geometries. The red-rec redistributes among pairs donor-receiver columns and reconfigures each column using an exact displacement-minimizing algorithm, harnessing parallel operations that...

This article presents a decentralized control technique applied to Cascaded Full-Bridge Multilevel Converter (CFBMC) balance the amount of power provided by its independent cells connected in series. It is based on use elementary modular controllers, associated with each converter cell, communicating their close neighbors obtain appropriate balancing. A complete theoretical study system terms m...

In recent years, in Iran and other countries the power systems are going to move toward creating a competition structure for selling and buying electrical energy. These changes and the numerous advantages of DGs have made more incentives to use these kinds of generators than before. Therefore, it is necessary to study all aspects of DGs, such as size selection and optimal placement and impact o...

Exploitation of the wiring flexibility in Networks of Workstations demands configuration methods that can handle dynamic changes in irregular topologies. During reconfiguration of a network based on virtual cut-through or wormhole switching, however, deadlocks in the transition phase between the old and the new routing function must be avoided. The avoidance of such deadlocks will in general ma...

This report surveys recent results and approaches from the field of control reconfiguration within a general fault-tolerant control framework. Open problems for future research are identified. Control reconfiguration is embedded within a wider fault-tolerant control context and set apart from other approaches to achieve fault tolerance. It is explained why simpler approaches than control reconf...

The increasing importance of distributed and decentralized software architectures entails more and more attention for adaptive software. Obtaining adaptiveness, however, is a difficult task as the software design needs to foresee and cope with a variety of situations. Using reconfiguration of components facilitates this task, as the adaptivity is conducted on an architecture level instead of di...