In this paper, we propose a method of determining the pension in the generation-based funding scheme. In this proposal, we include two types of pensions in the scheme. One is the payment-amount related pension and the other is the payment-frequency related pension. We set the ratio of the total amount of payment-amount related pension to the total amount of both pensions, and simulate income gaps and the relationship between contributions and benefits for each individual when the proposed method is applied.
In this paper, we aim at achieving accurate positioning control of a pneumatic actuation mechanism of antagonist-type by means of the simple adaptive control (SAC) method. Since this plant does not satisfy the ASPR-ness condition, we introduce a parallel feedforward compensator (PFC) so that the SAC strategy can be applied. However, the introduction of PFC leads to performance deterioration and in particular causes a steady state error. To suppress the steady-state error while keeping the fundamental structure of the SAC system, we introduce a “constant scaling” to the SAC system. We also consider a “dynamic scaling” so that the transient response of the controlled system can be improved. Through experiments, we show that the SAC strategy with these scalings is indeed effective in achieving accurate positioning control.
This paper proposes a decentralized model predictive control method based on a dual decomposition technique. A model predictive control problem for a system with multiple subsystems is formulated as a convex optimization problem. In particular, we deal with the case where the control outputs of the subsystems have coupling constraints represented by linear equalities. A dual decomposition technique is applied to this problem in order to derive the dual problem with decoupled equality constraints. A projected subgradient method is used to solve the dual problem, which leads to a decentralized algorithm. In the algorithm, a small-scale problem is solved at each subsystem, and information exchange is performed in each group consisting of some subsystems. Also, it is shown that the computational complexity in the decentralized algorithm is reduced if the dynamics of the subsystems are all the same.
Collaborative filtering is a computational realization of “word-of-mouth” in network community, in which the items prefered by “neighbors” are recommended. This paper proposes a new item-selection model for extracting user-item clusters from rectangular relation matrices, in which mutual relations between users and items are denoted in an alternative process of “liking or not”. A technique for sequential co-cluster extraction from rectangular relational data is given by combining the structural balancing-based user-item clustering method with sequential fuzzy cluster extraction appraoch. Then, the tecunique is applied to the collaborative filtering problem, in which some items may be shared by several user clusters.