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. 13 (2000), No. 2

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. 13 (2000), No. 2

A Dynamic Scheduling Method for Painting Process with JIT Production System

Jae Kyu Yoo, Masafumi NOGUCHI, Itsuo HATONO, Shinji TOMIYAMA, Hiroyuki TAMURA

pp. 65-71

DOI:

10.5687/iscie.13.65

Abstract

Scheduling method have been investigated for Just-In-Time (JIT) production systems with painting process that has longer lead time than the planning period of assemble line, followed by the painting prosess. In such JIT production systems, it is difficult to keep stable production between painting process and assemble line.Therefore, it is necessary that painting process has independent production schedule forecasted on the processing requirement jobs of assemble line. However, when multi-volume production is done or defective jobs occur in painting process, production balance between painting process and assemble line is destroyed, and then delays of due dates often occurred. To cope with this difficulty, we propose a scheduling method based on heuristic algorithm for painting process in the JIT production system in order to prevent delays of due date and to keep the smallest inventory in buffer of painting process. We have evaluated the scheduling method by computer simulation.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Dynamic Scheduling Method for Painting Process with JIT Production System

twitter
facebook
mendeley

Bibtex

Ris

Bias-Compensated Least-Squares Estimation and Parameter Transformation in Identification with Over-Parameterized Models

Kazushi NAKANO, Mitsuki MASHINO, Masayoshi TOMIZUKA

pp. 72-79

DOI:

10.5687/iscie.13.72

Abstract

For the problem of estimating unknown parameters of the transfer function model from input and output (I/O) data contaminated by colored measurement noise, a three-step estimation procedure has been previously proposed to exploit the I/O correlation information with respect to the correlation time. This paper analyzes this procedure from the compatibility between the parameter transformation and the bias-compensated least-squares (BCLS) estimation used in the third step. The transformation is made from the over-parameterized model in the first and second steps to the final model with the true order in the final step, and is based on the minimization of the mean square error (MSE) between the outputs of the two models. The BCLS estimation is based on the minimization of MSE between the final model output and the process output. It is verified that the condition for compatibility, i.e. the equivalence of two minimizations, is a consequence of the two over-parameterized estimation equations in the first two steps, and that the over-parameterization assures an inclusive expansion of the I/O correlation information. Simulation results are presented to demonstrate the equivalence.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Bias-Compensated Least-Squares Estimation and Parameter Transformation in Identification with Over-Parameterized Models

twitter
facebook
mendeley

Bibtex

Ris

Dead-Beat Optimal Tracking Control in Input-Output Data Space

Yiran DUAN, Yasumasa FUJISAKI, Masao IKEDA

pp. 80-86

DOI:

10.5687/iscie.13.80

Abstract

The system representation in the input-output data space, which was proposed recently, leads to a new control strategy for a linear time-invariant plant. The control input is computed directly from the input-output data of the plant without using any traditional mathematical model, such as transfer function or state space equation. This paper considers a dead-beat tracking problem for arbitrary reference signals in that framework, and presents the optimal control for a quadratic performance index

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Dead-Beat Optimal Tracking Control in Input-Output Data Space

twitter
facebook
mendeley

Bibtex

Ris

Improvement of Generalization Ability of a Fuzzy Classifier with Ellipsoidal Regions by the Optimum Division of Data

Masaaki KOBAYASHI, Masayuki KIMATA, Shigeo ABE

pp. 87-94

DOI:

10.5687/iscie.13.87

Abstract

In this paper, we discuss methods for improving the generalization ability of a fuzzy classifier with ellipsoidal regions. In the fuzzy classifier, each cluster is approximated by a center and a covariance matrix, and the membership function is calculated using the inverse of the covariance matrix. Thus when the number of training data is small, the covariance matrix becomes singular and the generalization ability decreases. In addition, when the characteristics of the training and test data differ, the generalization ability decreases. In this paper, we improve the generalization ability controlling the number of singular values in the covariance matrix. Then we propose to divide the sampled data set into training and test data sets so that the centers and the covariance matrices of each class become similar. Finally, we demonstrate the validity of our methods by computer simulations.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Improvement of Generalization Ability of a Fuzzy Classifier with Ellipsoidal Regions by the Optimum Division of Data

twitter
facebook
mendeley

Bibtex

Ris

A Design Method for a Multivariable Generalized Predictive Control with a Terminal Matching Condition in a State-space Approach

Takao SATOU, Shiro MASUDA, Akira INOUE, Yoichi HIRASHIMA

pp. 95-102

DOI:

10.5687/iscie.13.95

Abstract

In this paper, the generalized predictive control (GPC) with a terminal matching condition for single-input single-output (SISO) plants proposed by Kwok and Shah [6] is extended so that it can be applied to multi-input multi-output (MIMO) plants. For the extension to MIMO case, a state-space approach is used in the proposed method while a polynomial approach is used in the conventional method. This is because a state-space approach for the design of the proposed GPC makes the extension to MIMO case possible. In addition, a steady-state predictor originally derived in this paper using a state-space approach is shown to be completely equivalent to that in the conventional method when SISO plant is designed. Finally, a numerical example is demonstrated to show that a terminal matching condition in the MIMO case has the same role for improving performances of the controlled system as in the SISO case using conventional method.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Design Method for a Multivariable Generalized Predictive Control with a Terminal Matching Condition in a State-space Approach

twitter
facebook
mendeley

Bibtex

Ris

Two-Step Design Method for Strictly Positive Real H2 Controllers

Takashi SHIMOMURA, Takaaki TOKURA, Takao FUJII

pp. 103-109

DOI:

10.5687/iscie.13.103

Abstract

This paper proposes an interesting technique for LMI-based multiobjective control design. We deal with strictly positive real H2 controller synthesis. If we partially fix both LMI solutions and controllers in the first step, a set of jointly convex LMI formula is obtained in the second step. The first step restricts the range of the parameter set to some degree, and the second step searches within these boundaries. However, if these constraints include the standard result for a common LMI solution, then the second step may improve this result while allowing uncommon LMI solutions. A numerical example is included.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Two-Step Design Method for Strictly Positive Real H2 Controllers

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.