In this paper, the problem of control reconfiguration in the presence of actuator failure preserving the nominal controller is addressed. In the actuator failure condition, the processing algorithm of the control signal should be adapted in order to re-achieve the desired performance of the control loop. To do so, the so-called reconfiguration block, is inserted into the control loop to reallocate nominal control signals among the remaining healthy actuators. This block can be either a constant mapping or a dynamical system. In both cases, it should be designed so that the states or output of the system are fully recovered. All these situations are completely analysed in this paper using a novel structural approach leading to some theorems which are supported in each section by appropriate simulations.

High temperature adversely impacts on circuit's reliability, performance, and leakage power. During behavioral synthesis, both resource usage allocation and resource binding influence thermal profile. Current thermal-aware behavioral syntheses do not utilize location information of resources from floorplan and in addition only focus on binding, ignoring allocation. This paper proposes thermal-aware behavioral synthesis with resource usage allocation. Based on a hybrid metric of physical location information and temperature, we rebind operations and reallocate the number of resources under area constraint. Our approach effectively controls peak temperature and creates even power densities among resources of different types and within resources of the same type. Experimental results show an average of 8.6 drop in peak temperature and 5.3% saving of total power consumption with little latency overhead.

In a population which consists of a large number of players interacting with each other, the payoff of each player often conflicts with the total payoff of the population which he/she belongs to. In such a situation, a "government" which has the comprehensive perspective is needed to govern the population. Recently, to discuss the population with the government, the authors have proposed replicator dynamics with reallocation of payoffs to analyze an effect of the government. In this model, the government is willing to lead the population to a desirable target state by collecting a part of players' payoffs and reallocating them depending on the target state. The government's action is the rate of collecting payoffs from players and the rate is assumed to be constant and independent of the population state. Thus, in this paper, we suppose that the government change their intervention strategy depending on the current population state. We consider the government as a game player and define the government's payoff as a sum of a benefit and a cost of intervention. We propose a model which describes the evolution of the government's reallocation strategy and investigate stability of its equilibrium points.

Based on an estimation model of video subjective quality, a bandwidth reallocation strategy for video communications on NGN is presented. Experimental results show that the average PSNR of recovery video quality can be greatly increased by using the proposed method when the network bandwidth decreases.

In a community which consists of a large number of people interacting with each other, social dilemma is an important problem. This problem occurs when the payoff of each person conflicts with the total payoff of the community which he/she belongs to. Evolutionary game theory has been used as a powerful mathematical framework to analyze such a social problem. Recently, the authors have proposed replicator dynamics with reallocation of payoffs. In this model, the government is willing to lead the population to a desirable goal state by using collections and reallocations of payoffs. In this paper, we investigate this model, and show conditions for the goal state to be a locally or a globally asymptotically stable equilibrium point, respectively. We also propose a government's strategy depends on population states which can stabilize the goal state globally.

A reallocation problem is defined as determining whether blocks can be moved from their current boxes to their destination boxes in the number of moves less than or equal to a given positive integer. This problem is defined simply and has many practical applications. We previously proved the following results: The reallocation problem such that the block volume is restricted to one volume unit for all blocks can be solved in linear time. But the reallocation problem such that the block volume is not restricted is NP-complete, even if no blocks have bypass boxes. But the computational complexity of the reallocation problems such that the range of the block volume is restricted has not yet been known. We prove that the reallocation problem is NP-complete even if the block volume is restricted to one or two volume units for all blocks and no blocks have bypass boxes. Furthermore, we prove that the reallocation problem is NP-complete, even if there are only two blocks such that each block has the volume units of fixed positive integer greater or equal than two, the volume of the other blocks is restricted to one volume unit, and no blocks have bypass boxes. Next, we consider such a block that must stays in a same box both in the initial state and in the final state but can be moved to another box for making room for other blocks. We prove that the reallocation problem such that an instance has such blocks is also NP-complete even if the block volume is restricted to one volume unit for all blocks.

The reallocation problem is defined as determining whether products can be moved from their current storehouses to their target storehouses in a number of moves that is less than or equal to a given number. This problem is defined simply and has many practical applications. We previously presented necessary and sufficient conditions whether an instance of the reallocation problem is feasible, as well as a linear-time algorithm that determines whether aall products can be moved, when the volume of the products is restricted to one. However, a linear-time algorithm that generates the order of moving the products has not been reported yet. Such an algorithm is proposed in this paper. We have also previously proved that the reallocation problem is NP-complete in the strong sense when the volume of the products is not restricted and the products have evacuation storehouses show that the reallocation problem is NP-complete in the strong sense even when none of the products has evacuation storehouses.

We define the Reallocation Problem to determine whether we can move products from their current store-houses to target storehouses in a number of moves which is less than or equal to a given number. This problem is defined simply and can be applied to many practical problems. We give necessary and sufficient conditions for feasibility for Reallocation Problems under various conditions, and propose liner time algorithms, when the volume of the products is restricted to 1. Moreover, we show that the Reallocation Problem is NP-complete in the strong sense, when the volume of the products is not restricted.