Search Sites

Transactions of the Institute of Systems, Control and Information Engineers Vol. 22 (2009), No. 1

ISIJ International
belloff
ONLINE ISSN: 2185-811X
PRINT ISSN: 1342-5668
Publisher: THE INSTITUTE OF SYSTEMS, CONTROL AND INFORMATION ENGINEERS (ISCIE)

Backnumber

  1. Vol. 36 (2023)

  2. Vol. 35 (2022)

  3. Vol. 34 (2021)

  4. Vol. 33 (2020)

  5. Vol. 32 (2019)

  6. Vol. 31 (2018)

  7. Vol. 30 (2017)

  8. Vol. 29 (2016)

  9. Vol. 28 (2015)

  10. Vol. 27 (2014)

  11. Vol. 26 (2013)

  12. Vol. 25 (2012)

  13. Vol. 24 (2011)

  14. Vol. 23 (2010)

  15. Vol. 22 (2009)

  16. Vol. 21 (2008)

  17. Vol. 20 (2007)

  18. Vol. 19 (2006)

  19. Vol. 18 (2005)

  20. Vol. 17 (2004)

  21. Vol. 16 (2003)

  22. Vol. 15 (2002)

  23. Vol. 14 (2001)

  24. Vol. 13 (2000)

  25. Vol. 12 (1999)

  26. Vol. 11 (1998)

  27. Vol. 10 (1997)

  28. Vol. 9 (1996)

  29. Vol. 8 (1995)

  30. Vol. 7 (1994)

  31. Vol. 6 (1993)

  32. Vol. 5 (1992)

  33. Vol. 4 (1991)

  34. Vol. 3 (1990)

  35. Vol. 2 (1989)

  36. Vol. 1 (1988)

Transactions of the Institute of Systems, Control and Information Engineers Vol. 22 (2009), No. 1

Asynchronous Parallel Distributed Genetic Algorithm by Layered Server-Client Model

Kazunori Kojima, Masaaki Ishigame, Shozo Makino

pp. 1-12

Abstract

The most popular researches about Parallel GAs are implemented as; Population is devided into some subpopulations, each subpopulation executes GA independently and some individuals are migrated in fixed intervals or fixed probability. On the other hand, Grid Computing has been noticed and a research that implements Parallel GA by using Master-Worker model on Grid Computing has been reported. However, on the huge search space problems, Parallel GA by using Master-Worker model needs a lot of worker to get better solution quality. If there are a lot of workers, the traffic loads to the master.
In this paper, we propose Asynchronous Parallel Distributed GA by using Layered Server-Client model. This model is based on Elite Migration on Server-Client model we proposed before. In this model, an Elite Server manages some Subpopulation Clients, and a Master Server manages some Elite Servers. From this structure, the number of Subpopulation Clients that a Elite Server manages is able to be reduced and the traffic on an Elite Server is also able to be reduced. To evaluate our proposed model, we apply to some problems. As the results, we confirm that the fitness is as well as that of current methods and the traffic is less than that of current methods. We also confirm that the migration time is able to be reduced especially in large search space problems.

Bookmark

Share it with SNS

Article Title

Asynchronous Parallel Distributed Genetic Algorithm by Layered Server-Client Model

Identification of Hammerstein Systems using Trigonometric Polynomials

Hideyuki Tanaka, Shunsuke Hazue

pp. 13-20

Abstract

This paper studies a procedure for identifying Hammerstein systems from input-output data, where the static nonlinearity is approximated by the trigonometric polynomials. Signals generated by the trigonometric function with white Gaussian inputs are analyzed in terms of the persistent excitation of linear time-invariant systems. Based on the analysis, an identification algorithm for Hammerstein systems is proposed via a subspace identification method. Numerical simulation results are also included to illustrate the effectiveness of the present algorithm.

Bookmark

Share it with SNS

Article Title

Identification of Hammerstein Systems using Trigonometric Polynomials

A Novel Clustering Method Curbing the Number of States in Reinforcement Learning

Naoki Kotani, Masayuki Nunobiki, Kenji Taniguchi

pp. 21-28

Abstract

We propose an efficient state-space construction method for a reinforcement learning. Our method controls the number of categories with improving the clustering method of Fuzzy ART which is an autonomous state-space construction method. The proposed method represents weight vector as the mean value of input vectors in order to curb the number of new categories and eliminates categories whose state values are low to curb the total number of categories. As the state value is updated, the size of category becomes small to learn policy strictly. We verified the effectiveness of the proposed method with simulations of a reaching problem for a two-link robot arm. We confirmed that the number of categories was reduced and the agent achieved the complex task quickly.

Bookmark

Share it with SNS

Article Title

A Novel Clustering Method Curbing the Number of States in Reinforcement Learning

Control System Synthesis Based on Balance between Normal-Case Performance, Safety and Fault-Case Performance

Koichi Suyama, Noboru Sebe

pp. 29-36

Abstract

This paper presents control system synthesis of providing a balance between normal-case performance, safety and fault-case performance according to the international standard on safety, IEC 61508. It is based on multiobjective design for simultaneous problems for each context to optimize only normal-case performance out of the whole including fault-case performance.

Bookmark

Share it with SNS

Article Title

Control System Synthesis Based on Balance between Normal-Case Performance, Safety and Fault-Case Performance

Online Writer Verification Using Feature Parameters Basedonthe Document Examiners' Knowledge

Yoshikazu Nakamura, Masatsugu Kidode

pp. 37-47

Abstract

This paper investigates writer verification using feature parameters based on the knowledge of document examiners, which are automatically extracted from handwritten kanji characters on a digitizing tablet. Criteria of feature selection using the evaluation measure that is obtained by modifying the measure of decidability, d-prime, is established and the criteria are applied to the evaluation measures that are calculated from learning samples. Then two classifiers based on the frequency distribution of deviations of the selected features are proposed and its design method using learning samples is showed. The effectiveness of the proposed method is evaluated by verification experiments with the database including skilled forgeries. The experimental results show that the proposed methods are effective in writer verification.

Bookmark

Share it with SNS

Article Title

Online Writer Verification Using Feature Parameters Basedonthe Document Examiners' Knowledge

You can use this feature after you logged into the site.
Please click the button below.

Advanced Search

Article Title

Author

Abstract

Journal Title

Year

Please enter the publication date
with Christian era
(4 digits).

Please enter your search criteria.