logo
Language
Bookmarks
Log Out

Journals

Search Sites

Account

© 2022 Steel Science Portal

How to use

Advanced Search

Search Sites

site
site
site
site

Transactions of the Institute of Systems, Control and Information Engineers Vol. 14 (2001), No. 8

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

Backnumber

  1. Vol. 37 (2024)

    1. No.8
    2. No.7
    3. No.6
    4. No.5
    5. No.4
    6. No.3
    7. No.2
    8. No.1

  2. Vol. 36 (2023)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  3. Vol. 35 (2022)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  4. Vol. 34 (2021)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  5. Vol. 33 (2020)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  6. Vol. 32 (2019)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  7. Vol. 31 (2018)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  8. Vol. 30 (2017)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  9. Vol. 29 (2016)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  10. Vol. 28 (2015)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  11. Vol. 27 (2014)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  12. Vol. 26 (2013)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  13. Vol. 25 (2012)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  14. Vol. 24 (2011)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  15. Vol. 23 (2010)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  16. Vol. 22 (2009)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  17. Vol. 21 (2008)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  18. Vol. 20 (2007)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  19. Vol. 19 (2006)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  20. Vol. 18 (2005)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  21. Vol. 17 (2004)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  22. Vol. 16 (2003)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  23. Vol. 15 (2002)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  24. Vol. 14 (2001)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  25. Vol. 13 (2000)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  26. Vol. 12 (1999)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  27. Vol. 11 (1998)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  28. Vol. 10 (1997)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  29. Vol. 9 (1996)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  30. Vol. 8 (1995)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  31. Vol. 7 (1994)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  32. Vol. 6 (1993)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  33. Vol. 5 (1992)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  34. Vol. 4 (1991)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  35. Vol. 3 (1990)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  36. Vol. 2 (1989)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  37. Vol. 1 (1988)

    1. No.7
    2. No.6
    3. No.5
    4. No.4
    5. No.3
    6. No.2
    7. No.1

Keyword Ranking

21 Nov. (Last 30 Days)

Transactions of the Institute of Systems, Control and Information Engineers Vol. 14 (2001), No. 8

Coevolution and Symbiosis in Metapopulation Models

Kanji UEDA, Kazuhiro OHKURA, Ming CHANG

pp. 379-386

DOI:

10.5687/iscie.14.379

Abstract

Symbiosis in the natural world is of great evolutionary significance. The concept of symbiosis has been applied for designing evolutionary algorithms. In this paper, symbiosis is considered an operator instead of a state, and symbiotic association is regarded as a result of the emergent cost-benefit properties during an evolutionary process. A coevolutionary individual-based metapopulation model of an endosymbiont-host system is introduced in which two species, the potential host and parasite, are assumed. All the subpopulations in the model are represented by NKC models. A random-parasitism model is applied for representing symbiotic associations between a parasite and a host with no predefined intrinsic cost-benefit property. The symbiostic associations between hosts and parasites are considered genetic relationship through which genome of the parasite is transferred to the host. We investigated the coevolutionary dynamics through computer simulations and found the qualitative conditions where symbiosis stably emerges in the model.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Coevolution and Symbiosis in Metapopulation Models

twitter
facebook
mendeley

Bibtex

Ris

On Robustness of a Stabilization Method Based on Generalized Canonical Transformations

Kenji FUJIMOTO, Keitaro ISHIKAWA, Toshiharu SUGIE

pp. 387-394

DOI:

10.5687/iscie.14.387

Abstract

This paper studies the robustness analysis of feedback systems for two-wheeled vehicle systems which are designed based on generalized canonical transformations. Firstly the relation between the design parameter in the stabilization procedure and the sensitivity against external disturbances is discussed. Secondly a sufficient condition for the robust stability against unknown physical parameter variations is derived. Finally the effectiveness of our method is demonstrated by experiments.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

On Robustness of a Stabilization Method Based on Generalized Canonical Transformations

twitter
facebook
mendeley

Bibtex

Ris

An Application of FEERL (Fuzzy Environment Evaluation Reinforcement Learning) to LightsOut Game and Avoidance of Detour Actions in Search

Yukinobu HOSHINO, Katsuari KAMEI

pp. 395-401

DOI:

10.5687/iscie.14.395

Abstract

Many machine learning methods have been proposed to learn techniques of specialists. A machine has to learn techniques by trial and error when there are no training examples. A reinforcement learning is a powerful machine learning system, which is able to learn without giving training examples to a learning unit. But it is impossible for the reinforcement learning to support large environments because the number of if-then rules defined by combinations of a relationship between one environment and one action becomes huge. In a previous paper, we proposed a new reinforcement learning with fuzzy evaluation environment, called FEERL (Fuzzy Environment Evaluation Reinforcement Learning). The FEERL is made up from a fuzzy evaluation, an environment simulator and a search. It was applied to the chess and its effectiveness was confirmed. In this paper, we apply the FEERL to LightsOut game having no opponent as an example of huge environment and show that the FEERL avoids detour actions in search and then get a proper solution.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

An Application of FEERL (Fuzzy Environment Evaluation Reinforcement Learning) to LightsOut Game and Avoidance of Detour Actions in Search

twitter
facebook
mendeley

Bibtex

Ris

Construction of Piecewise Linear Lyapunov Functions and Its Fast Method

Yuzo OHTA, Izumi MASUBUCHI, Kenichiro YAMAMOTO

pp. 402-408

DOI:

10.5687/iscie.14.402

Abstract

In this paper, the issue of constructing piecewise linear Lyapunov functions (PWLLF) for stability analysis of nonlinear systems satisfying generalized sector conditions is addressed. The existence condition of PWLLF is represented by a linear programming problem (LP in brief). If the optimal value of the LP is negative, then PWLLF is constructed by using the optimal solution of it. When the optimal value of the LP is nonnegative, the candidate of PWLLF is modified with additional freedom and a new LP is formulated corresponding to the new PWLLF candidiate. It is shown that the optimal value of the resulting new LP is always less than or equal to that of the old LP. The main purpose of this paper is to propose a fast method to solve LPs which appear repeatedly in constructing PWLLF. The method is based on a kind of sensitivity analysis approach of LP and utilizes the special structure of LPs that appears in constructing PWLLF.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Construction of Piecewise Linear Lyapunov Functions and Its Fast Method

twitter
facebook
mendeley

Bibtex

Ris

Evolutionary Programming that Utilizes Genetic Drift

Kazuhiro OHKURA, Yoshiyuki MATSUMURA, Kanji UEDA

pp. 409-417

DOI:

10.5687/iscie.14.409

Abstract

Evolutionary Programming (EP) belongs to a class of general optimization algorithms based on the model of natural evolution. EP has also been applied to real-valued function optimization since the early 90's. However, recent research results have proved that EP is not so robust as expected; EP performs very well only when the lower bound of strategy parameters is adjusted to each problem. In order to overcome this difficulty, an extended EP, called Robust EP (REP), is proposed. A major feature of REP is that genetic drift is introduced as another source of changing strategy parameters. Computer simulations are conducted in order to illustrate the robust performance of REP against the lower bound on a set of popular benchmark problems. Some evolutionary characteristics of REP are also clarified by calculating basic statistical values.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Evolutionary Programming that Utilizes Genetic Drift

twitter
facebook
mendeley

Bibtex

Ris

Physical Parameter Estimation of Semiconductor Exposure Apparatus Supported by Anti-Vibration Units Based on Multivariable System ldentification Results

Hiroyuki TAKANASHI, Takehiko MAYAMA, Shinji WAKUI, Shuichi ADACHI

pp. 418-420

DOI:

10.5687/iscie.14.418
mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Physical Parameter Estimation of Semiconductor Exposure Apparatus Supported by Anti-Vibration Units Based on Multivariable System ldentification Results

twitter
facebook
mendeley

Bibtex

Ris

Article Access Ranking

21 Nov. (Last 30 Days)

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.