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. 12 (1999), No. 4

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. 12 (1999), No. 4

An Approximate Maximum Likelihood Estimation of a Class of Nonlinear Systems Using Neural Networks and Noise Models

Shigenobu YAMAWAKI, Masashi FUJINO, Syozo IMAO

pp. 203-211

DOI:

10.5687/iscie.12.203

Abstract

This paper proposes an identification method for a class of nonlinear systems using a neural network and a noise model. A three-layer neural network is used as a plant model of the nonlinear system, and the noise model is applied as a whitening filter. Since noise can not be observed directly, an identification method is proposed in which the neural network and the noise model are calculated with the bootstrap method. We are able to obtain the approximate maximum estimated value of the nonlinear system, where the estimated value is determined based on Akaike's information criterion.
Simulation results are shown to show the effectiveness of the proposed method. The validity of the obtained model is investigated by evaluating the covariance of an estimate error, means, and residual tests. Finally, the simulation result of the undisturbed output and the output of the obtained model are compared and it is shown that a neural network following the undisturbed output and a whitening filter are obtained.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

An Approximate Maximum Likelihood Estimation of a Class of Nonlinear Systems Using Neural Networks and Noise Models

twitter
facebook
mendeley

Bibtex

Ris

Associative Classification Using the Extended Associatron

Akihiro KANAGAWA, Mitsue SENOO, Hiromitsu TAKAHASHI

pp. 212-219

DOI:

10.5687/iscie.12.212

Abstract

This paper deals with classification problem, such as diagnosis, in which classes are defined by categorical forms. Supposing there are some sample data, and each datum has n kinds of characteristic values. The problem to classify these samples into given m classes based on their characteristic values has been discussed for a long period of time. However, classic methods including the discriminant analysis are difficult to be applied to actual problems, because the assumption of multivariate normal distribution and equality of variance-covariance matrices are needed.
In this paper we propose a classification method using the associatron as an associative memory machine. We extend the associatron so as to have stable three leveled outputs following in the steps of a method given by Kanagawa et al. Examples of diagnosis of liver disease and the problem of iris classification are demonstrated.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Associative Classification Using the Extended Associatron

twitter
facebook
mendeley

Bibtex

Ris

Stabilization of Periodic Discrete Systemsby Output Sample Hold Control

Michio KONO, Tatsuo SUZUKI, Nobuya TAKAHASHI, Osamu SATO

pp. 220-224

DOI:

10.5687/iscie.12.220

Abstract

In linear ω-periodic discrete-time systems, eigenvalues of the state transition matrix over the time interval nω dominate stability, where n is the dimension of the state vector. The periodic discrete-time system is called to be sample observable when the state can be determined from observation of output at only one time within one period. Under the assumption that eigenvalues of the monodromy matrix in an open-loop system are distinct, it is shown that the closed-loop system can be stabilized by applying the sampled output nω-periodic hold control if and only if the open-loop system is stabilizable and sample detectable at some time t0.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Stabilization of Periodic Discrete Systemsby Output Sample Hold Control

twitter
facebook
mendeley

Bibtex

Ris

The Back Propagation Method Using the Least Mean-Square Method for the Output Recurrent Neural Network

Shigenobu YAMAWAKI, Masashi FUJINO, Syozo IMAO

pp. 225-233

DOI:

10.5687/iscie.12.225

Abstract

The back propagation method on the basis of the gradient method is often utilized as a learning rule of a neural network. This paper proposes a back propagation method using the least mean-square method for the output recurrent neural network. The approach consists of the decision of the input vector and the parameter estimation of each layer. The input vector of the output layer is corrected to decrease the output error corresponding to learning rate and the learning value of the other layer. The parameter is calculated using the least-square method from the obtained input and output of each layer.
The identification result for the linear oscillation system shows the effectiveness of the proposed algorithm which is not based on the gradient method. It is shown that better estimate is obtained by the proposed algorithm compared with the classical back propagation method.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

The Back Propagation Method Using the Least Mean-Square Method for the Output Recurrent Neural Network

twitter
facebook
mendeley

Bibtex

Ris

A Frequency-Domain Validation Test for Uncertainty Models Having White Noise and Unmodeled Dynamics

Hiroaki FUKUSHIMA, Toshiharu SUGIE

pp. 234-239

DOI:

10.5687/iscie.12.234

Abstract

In this paper, we propose a new frequency-domain validation test for uncertainty models having white noises and norm-bounded unmodeled dynamics. In this method, a statistical whiteness test is integrated into the deterministic model validation methodology and we consider the whiteness test based on the averaged periodogram of data segments in order to reduce the validation problem into a convex problem with less computation burden. One of the distinguished features of our method is that the quality of the validation test can be improved by increasing the data segments because of the whiteness test. Also, one of the merits of our frequency-domain validation test is that we need a priori information in time-domain only. A numerical example is given to illustrate the effectiveness of the proposed method.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Frequency-Domain Validation Test for Uncertainty Models Having White Noise and Unmodeled Dynamics

twitter
facebook
mendeley

Bibtex

Ris

Adaptation to a Changing Environment by Means of the Thermodynamical Genetic Algorithm

Naoki MORI, Hajime KITA, Yoshikazu NISHIKAWA

pp. 240-249

DOI:

10.5687/iscie.12.240

Abstract

In the genetic algorithms (GAs), maintenance of the diversity of the population is an important issue to enhance their optimization and adaptation ability. The authors have proposed the thermodynamical genetic algorithm (TDGA), which can maintain the diversity explicitly and systematically by evaluating the diversity of the population as entropy and by selecting offspring so as to minimize the free energy. In applications of the GA to problems of adaptation to changing environments, maintenance of the diversity is an essential requirement because it is a key factor of the GA in yielding novel search points continuously for adaptation. This paper discusses adaptation to changing environment by means of TDGA. The authors propose a control method of the temperature, an adjustable parameter in the TDGA. That is, the temperature is controlled by a feedback technique so as to regulate the level of the entropy of the population. The adaptation ability of the proposed method is confirmed by computer simulation taking time-varying knapsack problems as examples.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Adaptation to a Changing Environment by Means of the Thermodynamical Genetic Algorithm

twitter
facebook
mendeley

Bibtex

Ris

Iterative Learning Control Based on the Gradient Method for Linear Discrete-Time Systems

Takuya SOGO, Kouji KINOSHITA, Norihiko ADACHI

pp. 250-259

DOI:

10.5687/iscie.12.250

Abstract

In this paper, we discuss convergence of iterative learning control based on the gradient method for linear discrete-time systems. First, it is shown that residuals generated by the algorithm converge exponentially and therefore, observation errors or disturbance does not cause divergence. Second, the convergence conditions are expressed as strictly positive realness of the ratio of transfer functions. Conditions for the strictly positive realness is presented when there exists uncertainty of parameters in the transfer function and it is known that they are in given intervals. We also propose a simple sufficient condition for the strictly positive realness, which is based on a special structure of the problem. Finally, we illustrate design procedure based on the results given in this paper. Applications of the results to sampled-data systems are also discussed.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Iterative Learning Control Based on the Gradient Method for Linear Discrete-Time Systems

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.