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. 11 (1998), No. 9

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

Backnumber

  1. Vol. 38 (2025)

    1. No.4
    2. No.3
    3. No.2
    4. No.1

  2. Vol. 37 (2024)

    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. 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

  4. 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

  5. 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

  6. 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

  7. 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

  8. 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

  9. 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

  10. 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

  11. 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

  12. 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

  13. 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

  14. 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

  15. 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

  16. 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

  17. 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

  18. 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

  19. 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

  20. 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

  21. 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

  22. 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

  23. 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

  24. 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

  25. 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

  26. 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

  27. 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

  28. 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

  29. 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

  30. 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

  31. 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

  32. 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

  33. 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

  34. 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

  35. 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

  36. 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

  37. 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

  38. 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

15 Jul. (Last 30 Days)

Transactions of the Institute of Systems, Control and Information Engineers Vol. 11 (1998), No. 9

Identification of the Smallest Unfalsified Model Set Based on Stochastic Noisy Data

Toshiharu SUGIE, Hiroaki FUKUSHIMA

pp. 477-482

DOI:

10.5687/iscie.11.477

Abstract

In this paper, we propose a new model set identification method using experimental data contaminated by stochastic noise. This method consists of two steps. In the first step, we separate the output error into the deterministic part due to the unmodelled dynamics and the stochastic noise part. In the second step, we find the smallest model set which is consistent with the deterministic part of the experimental data. Furthermore, the effectiveness of this method is shown by numerical examples.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Identification of the Smallest Unfalsified Model Set Based on Stochastic Noisy Data

twitter
facebook
mendeley

Bibtex

Ris

Motion Extraction of Time Varying Images Using Virtual Gradient Method

Miae LEE, Toshio ITO, Yukio KANEDA

pp. 483-490

DOI:

10.5687/iscie.11.483

Abstract

This paper proposes an extraction method of the motion of edges using the virtual gradient which is assumed to be around the edges. This method produces linear virtual intensity without any noise along the edges, and it introduces a constraint equation of gradient method to the edges of the time varying images. The optical flow can be extracted fastly by this method. We examined the accuracy of the virtual gradient method by use of simulation images. And we show the validity of this method through experimentations by use of the actual time varying images.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Motion Extraction of Time Varying Images Using Virtual Gradient Method

twitter
facebook
mendeley

Bibtex

Ris

A Study of Automatic Decision Making for Washing the Polluted Insulators in Coastal Substations Based on the Prediction by Use of Pollution Model with Weather Information

Satoru GOTO, Masatoshi NAKAMURA, Nishantha NANAYAKKARA, Takashi TANIGUCHI

pp. 491-498

DOI:

10.5687/iscie.11.491

Abstract

Insulators in coastal substations are rapidly polluted due to the salty wind blowing from the sea. The insulator pollution causes higher leakage current and ultimately gives rise to blackouts due to flash-over. This research is aimed at developing a method of reliable automatic decision making for washing the polluted insulators in substations near coastal areas. The proposed method makes use of a model of pollution deposits which was constructed based on the actual data of pollution deposits and weather information at Karatsu substation and Nishikyushu substation. Decision is made automatically using the predicted pollution deposits, which is obtained from the pollution deposits model. Effectiveness of the proposed method is assured by applying it to the actual data.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Study of Automatic Decision Making for Washing the Polluted Insulators in Coastal Substations Based on the Prediction by Use of Pollution Model with Weather Information

twitter
facebook
mendeley

Bibtex

Ris

A Feedback Control Design for Constrained Nonholonomic Systems

Joe IMAE, Takayuki MORI, Ryo TORISU

pp. 499-507

DOI:

10.5687/iscie.11.499

Abstract

We propose a time-varying feedback controller for constrained nonholonomic systems, which consists of feedforward and feedback controllers. Our approach is mainly based on two-degree-of-freedom (2-DOF) techniques for nonlinear systems. First, we obtain numerical solutions for certain nonlinear optimal control problems with state-constraints through off-line calculations, and then construct the feedforward controller with the help of the optimal solutions. Next, we construct a linear time-invariant feedback controller by making use of the regulator theory on the associated linearized systems. Combining such two controllers and introducing a simple scheme on how to avoid the obstacles, we obtain the 2-DOF based time-varying feedback controller. We demonstrate, by numerical simulations, practicability of the proposed controller.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Feedback Control Design for Constrained Nonholonomic Systems

twitter
facebook
mendeley

Bibtex

Ris

Remote Sensing Data Analysis by Using Kohonen Feature Map and Competitive Learning

Yoshikazu NOGAMI, Yoichi JYO, Michifumi YOSHIOKA, Sigeru OMATU

pp. 508-513

DOI:

10.5687/iscie.11.508

Abstract

The neural network approach to the land-use classification problem using the back-propagation method (BPM) has been discussed in recent years. In such a method, the accuracy of the result depends on the training data set which is selected manually and this selection procedure, which takes much time, has been considered the bottlenech of the method. In this paper, we propose to pre-classify the data using the Kohonen Feature Map (KFM) and the competitive learning (CL) in order to facilitate the selection procedure of the training data set.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Remote Sensing Data Analysis by Using Kohonen Feature Map and Competitive Learning

twitter
facebook
mendeley

Bibtex

Ris

Inspection of Unpolished Rice by Using Image Sensing

Kenji TERADA, Yuki TABUCHI, Shun'ichiro OE

pp. 514-520

DOI:

10.5687/iscie.11.514

Abstract

In this paper, we propose a new system of unpolished rice inspection by image sensing. The system classifies unpolished rice into 6 categories : speck rice, hull rice, ungrown rice, death rice, cracked rice and normal rice. To this end, the system employs the subspace method which uses five features : the gravity of the histogram, the variance of the histogram, the area of the object, the ratio of the major axis to the minor axis, and the area of the bright part. Some experimental results using a simple experimental system are also reported, which indicate effectiveness of the proposed method.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Inspection of Unpolished Rice by Using Image Sensing

twitter
facebook
mendeley

Bibtex

Ris

Deadbeat Control of MIMO Continuous-Time Systems

Eitaku NOBUYAMA, Seiichi SHIN

pp. 521-528

DOI:

10.5687/iscie.11.521

Abstract

This paper is concerned with a deadbeat tracking problem of multi-input-multi-output (MIMO) continuous-time systems. The problem is to find a deadbeat controller that achieves both the internal stability and deadbeat tracking. The objective of this paper is to show that even in MIMO continuous-time systems the deadbeat tracking problem has a solution on the assumption of the tracking condition.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Deadbeat Control of MIMO Continuous-Time Systems

twitter
facebook
mendeley

Bibtex

Ris

Article Access Ranking

15 Jul. (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.