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. 7 (1994), 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. 7 (1994), No. 8

An Adaptive Control Method Using Neural Network

Youichi HIRASHIMA, Youji IIGUNI, Norihiko ADACHI

pp. 281-286

DOI:

10.5687/iscie.7.281

Abstract

In this paper, a nonlinear control system incorporating a multi-layered neural network (MNN) with the Self-Tuning Regulator (STR) is designed. The MNN is used to compensate nonlinearity of plant dynamics that is not taken into consideration in the STR design. The control performance is thus improved as compared to the STR alone. Also, the learning time required for convergence and the network size of the MNN can be reduced as compared to conventional MNN based control systems. Because the STR quickly learns the linear part of plant dynamics based upon the least square method. Furthermore, the MNN can be trained on-line with the specialized learning architecture. Because the sensitivity of the system output to the changes of the input is calculated by using plant parameters estimated by the STR. Computer simulations are carried out to show the effectiveness of the proposed method.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

An Adaptive Control Method Using Neural Network

twitter
facebook
mendeley

Bibtex

Ris

A VLSI Systolic Array for SRIF (Square Root Information Filter)

Kazuhiko IWAMI, Koji TANAKA

pp. 287-294

DOI:

10.5687/iscie.7.287

Abstract

SRIF (Square Root Information Filter) is a method of solving for optimum estimate in the least square sense. SRIF finds optimum estimate by updating a square root matrix of an information matrix. In the paper, a new VLSI systolic array for SRIF parameter estimation is proposed. SRIF parameter estimation consists of orthogonal transformation and solving linear equations. The method that solves SRIF parameter estimation by use of Givens rotation and back substitution was proposed. But it is well known that complete pipelining of these two separate algorithms is impossible. To avoid this problem, we propose a new method of using the Faddeeva algorithm instead of back substitution. The Faddeeva algorithm is performed by Gauss elimination. Pipelining Givens rotation and Gauss elimination is now feasible as parallel architecture. Making use of this method, we constitute a high-speed VLSI systolic array for SRIF parameter estimation than a conventional one.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A VLSI Systolic Array for SRIF (Square Root Information Filter)

twitter
facebook
mendeley

Bibtex

Ris

Controller Reduction Considering 2nd-Order Information

Kazumi HORIGUCHI, Takuya NISHIMURA, Akira NAGATA

pp. 295-303

DOI:

10.5687/iscie.7.295

Abstract

We propose a method of controller reduction, which aims to replace an ideal high-order controller with a reduced-order one so that finite numbers of 1st-and 2nd-order information of the closed-loop system can be preserved. The preserved 1st-and 2nd-order information are those associated with the transfer characteristics of the closed-loop system and its power spectrum characteristics at appropriate complex frequency points, respectively. The proposed method provides the reduced-order controller which yields a frequency-weighted approximation of the closed-loop system considering its stability.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Controller Reduction Considering 2nd-Order Information

twitter
facebook
mendeley

Bibtex

Ris

Maximum Likelihood Estimate of TDOA for Cyclostationary Signals

Shuichi OHNO, Hideaki SAKAI

pp. 304-311

DOI:

10.5687/iscie.7.304

Abstract

Many communication signals exhibit cyclostationary property. Recently, Gardner and Chen introduced the estimate of the time difference of arrival (TDOA) of a cyclostationary signal at two separate sensors by exploiting the cyclic spectrum of this signal. But their method uses only a single slice from the cyclic spectrum. In this paper, we derive the maximum likehood estimator of the TDOA, using the stationary representation of a cyclostationary signal. We estimate the cyclic spectrum by the multivariate AR model fitting. As this method uses all parts of the cyclic spectrum, the performance of this method is better than the previous ones. This was clarified by the results of the computer simulation.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Maximum Likelihood Estimate of TDOA for Cyclostationary Signals

twitter
facebook
mendeley

Bibtex

Ris

Parameter Identification of the Image in Frequency Domain Using Adaptive Digital Filters

Hiroshi KINJO, Sigeru OMATU, Tetsuhiko YAMAMOTO, Shiro TAMAKI

pp. 312-321

DOI:

10.5687/iscie.7.312

Abstract

This paper discusses signal characteristics of a two-dimensional image transformed into frequency domain by using an adaptive digital filter (ADF). System identification using ADF is applied to the image data analysis in each frequency area. ADF determines the system parameters of the image signal. An adaptive Kalman filter which uses the system parameters adaptively obtained from ADF is proposed to restore a noise-contaminated image. The adaptive Kalman filter with the system parameters proposed in this paper contributes the image restoration. A smoothing image by an ε-filter is used to identify the system parameters in order to apply the adaptive Kalman filter. The ε-filter combined with the adaptive Kalman filters is proposed to improve the performance of the noise reduction of the image. Experimental results show that the proposed method has advantages for image restoration.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Parameter Identification of the Image in Frequency Domain Using Adaptive Digital Filters

twitter
facebook
mendeley

Bibtex

Ris

Finite-Horizon Minimax Estimation for Linear Discrete-Time Systems

Kiyotsugu TAKABA, Tohru KATAYAMA

pp. 322-331

DOI:

10.5687/iscie.7.322

Abstract

This paper considers the finite-horizon discrete-time minimax estimation problems related to the H∞ estimation cost. Based on the Lagrange multiplier technique, we show that the minimax estimators are identical to H∞ estimators in both filtering and onestep prediction cases. Moreover, necessary and sufficient conditions for the existence of the minimax estimators are given in terms of an H∞ type Riccati difference equation (RDE) satisfying the positive definiteness of certain matrices. Using the RDE, we compare the minimax estimators with Kalman filter, and investigate the some properties of the minimax estimators. A numerical example is also included to show the applicability of the present minimax estimators.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Finite-Horizon Minimax Estimation for Linear Discrete-Time Systems

twitter
facebook
mendeley

Bibtex

Ris

On the Precise Identification of Parameters of Mechanical Structure Systems

Jianxin SUN, Toshiro ONO, Koichi OSUKA

pp. 332-338

DOI:

10.5687/iscie.7.332

Abstract

With the aid of the state variable method, parameters of mechanical structure systems can be identified from the free decay responses. To measure the free decay responses, however, we must use a multi-channel data acquisition system.
This paper concerns the problem of precise identification, where the differences in dynamics of the multi-channels of a data acquisition system have been considered. Firstly, we investigate the influence of the differences on the identification results. Secondly, in order to eliminate the influence, we apply the relative dynamic compensation to the identification problem. Finally, we give a simulated example to show its feasibility.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

On the Precise Identification of Parameters of Mechanical Structure 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.