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

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

Scheduling of Valve Operations in Fuel Supply Facilities

Hajime ASE, Toshihide IBARAKI

pp. 223-232

DOI:

10.5687/iscie.11.223

Abstract

In the fuel supply facilities where fuels are unloaded from tankers to tanks and supplied through pipelines, reducing the number of valve operations is important to improve the efficiency of facility utilization. This is a combinatorial optimization problem that asks to minimize the number of changing the assignment patterns of tank groups to berths. We propose here an effective heuristic algorithm which exploits the special structure of the problem. Computational results indicate that this can be used as a scheduler in real-world supply facilities.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Scheduling of Valve Operations in Fuel Supply Facilities

twitter
facebook
mendeley

Bibtex

Ris

Application of Genetic Algorithm to Time Tabling Problems Incorporating Requests

Masahiro TANAKA, Osamu MATSUO, Mari YAMADA

pp. 233-240

DOI:

10.5687/iscie.11.233

Abstract

The time tabling problem is an important combinatorial optimization problem that arises in schools and so on. In this paper, we treat the problem of time tabling by incorporating the requests. This kind of problem occurs when the problem is commercially-based so that the applicants' requests must be highly satisfied, or many of the applicants are so busy that they can be assigned only to the time slots which they request. For such problems, we propose an approach using the genetic algorithm (GA). We formulate this problem as the permutation problem of the order of assignment of the requests, where the permutation is defined as the chromosome of the GA code. We circumvent the hard constraints by using the allocation module, and try to pursue the local optimality by using the minor tuning module.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Application of Genetic Algorithm to Time Tabling Problems Incorporating Requests

twitter
facebook
mendeley

Bibtex

Ris

Stochastic Process Representation and Analysis of the Homogenizing Process in a Cement Plant

Kenji OZAKI, Osamu HABATA, Masaki FUKUOKA

pp. 241-250

DOI:

10.5687/iscie.11.241

Abstract

This paper presents a predicting method for standard deviations of chemical composition fluctuations of raw meal at a kiln inlet using chemical analysis results of boring samples for raw materials in a quarry. A stochastic process representation for their fluctuations at the inlet of the plant is presented to specify their time domain fluctuations. The authors have also presented dedicated transfer functions which represent homogenizing effect of each constituent process and the raw material mixing control system. Using these representations, the Bode-diagrams to obtain decreasing performances of the fluctuations are finally presented. The theoretical calculation result of the standard deviation is compared with the result measured in an actual plant. As a result of a succession of these analyses, moreover, the authors could also present the structure of the mixing control system as a multivariable stochastic control system.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Stochastic Process Representation and Analysis of the Homogenizing Process in a Cement Plant

twitter
facebook
mendeley

Bibtex

Ris

Structural Learning with M-Apoptosis in Neurofuzzy GMDH

Takashi OHTANI, Hidetomo ICHIHASHI, Tetsuya MIYOSHI, Kazunori NAGASAKA, Yoshihiko KANAUMI

pp. 251-260

DOI:

10.5687/iscie.11.251

Abstract

It is known in the physiology that the apoptosis is an active form of cell death in most multicellular organisms and one of the two mechanisms by which cell death occurs (the other being the pathological process of necrosis). Apoptosis is the mechanism responsible for the physiological deletion of cells and appears to be intrinsically programmed. We propose a procedure called M-apoptosis for the structure clarification of Neurofuzzy GMDH model whose partial descriptions are represented by the Radial Basis Functions network. The proposed method prunes the larger network to identify, still more to clarify the network structure by minimizing the Minkowski norm of the gradient with respect to input variables of the partial descriptions. The method was validated through graphical representations of the identified structures in the numerical example of function approximation and classification of Iris data.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Structural Learning with M-Apoptosis in Neurofuzzy GMDH

twitter
facebook
mendeley

Bibtex

Ris

A Class of Continuous-Time Linear Systems Having a Common Lyapunov Function

Yoshihiro MORI, Takehiro MORI, Yasuaki KUROE

pp. 261-266

DOI:

10.5687/iscie.11.261

Abstract

The common Lyapunov function problem arises in association with stability analysis of diverse fields of systems. The problem is numerically solvable. However, it is not an easy task to fully characterize such a class of systems which have a common quadratic Lyapunov function. It is thus far known that a set of linear stable systems has a common quadratic Lyapunov function if their system matrices are in a commuting family. But this condition is considerably restrictive.
Our objective here is to find another class of systems which has a common quadratic Lyapunov function. It turns out that if all systems have stable system matrices which have an upper (lower) triangular structure, then they have a common quadratic Lyapunov function. Note that such system matrices are not necessarily in a commuting family. The obtained results would give an insight into further exploration of the common Lyapunov function problem. Numerical examples are worked out for illustration.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Class of Continuous-Time Linear Systems Having a Common Lyapunov Function

twitter
facebook
mendeley

Bibtex

Ris

Design of a Frequency-Shaping ILQ Controller to Suppress Vibration in a Magnetic Levitation System

Masaya SAKAI, Yuuki KUROE, Ken'ichi NAKASHIMA, Takao FUJII

pp. 267-276

DOI:

10.5687/iscie.11.267

Abstract

In the preceding paper, experimental results on the control of a magnetic levitation system using the ILQ and the H∞. control theories were reported. In the ILQ case, a spillover was caused by unmodeled dynamics, where the dimention of the controller was lower than that in the H∞ case. In this paper, we shape the closed loop frequency response of the ILQ control system to suppress the spillover by introducing additional design freedom of the observer. As a result almost the same closed loop performance as the H∞ controller can be achieved by this lower dimensional controller.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Design of a Frequency-Shaping ILQ Controller to Suppress Vibration in a Magnetic Levitation System

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.