logo
言語
ブックマーク
ログアウト

ジャーナル

論文検索サイト

アカウント

© 2022 Steel Science Portal

ヘルプ

詳細検索

論文検索サイト

site
site
site
site

システム/制御/情報 Vol. 4 (1991), No. 9

ISIJ International
belloff
オンライン版ISSN: 2185-811X
冊子版ISSN: 1342-5668
発行機関: 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

キーワードランキング

21 Nov. (Last 30 Days)

システム/制御/情報 Vol. 4 (1991), No. 9

多変数制御による熱延仕上げミルの板幅制御システム

北村 章, 中山 万希志, 能勢 和夫, 小西 正躬, 浅田 秀樹

pp. 347-359

DOI:

10.5687/iscie.4.347

抄録

To attain a successful width control for hot strip mill, it is important to control a width at each stand preventing excessive tension imbalance for some specified stands.
Our research goal is to develop a multivariable control algorithm for the new width control system. In the proposed algorithm, the width is controlled by modifying the inter-stands tension, which value is derived from the measured width and the on-line calculated width. An optimal control principle is applied and the tension balance can be maintained by tuning the weighting matrix in the performance index. The on-line control algorithm is designed such that the tension modification value can be obtained in short time, compared with the optimal regulator. This calculation is realized using a formula manipulating procedure and the control performance is same to that by the optimal regulator.
The control system based on this algorithm has been applied to the hot strip mill and the width deviation can be remarkably reduced than before.

他の人はこちらも検索

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

多変数制御による熱延仕上げミルの板幅制御システム

twitter
facebook
mendeley

Bibtex

Ris

状態空間手法によるCARIMA系の一般化予測制御

渡辺 桂吾

pp. 360-368

DOI:

10.5687/iscie.4.360

抄録

A generalized predictive control (GPC) which can be designed in a state-space framework is proposed for single-input/single-output CARIMA systems. It is first shown that, in designing the steady-state 1-step Kalman predictor by applying the innovation model, there are two ways depending on whether the output value of the plant is directly used or not ; one is called here “direct output method” and another is called “output deviation method”. When solving the 1-step predicted estimate of the original output, the latter method can be further classified into two approaches which differ in respect of the interpretation of the predicted estimate for the output deviation. Thus, three different j-step ahead state-space output predictors can be designed for the GPC strategy. Finally, the performances of three GPCs are compared through some numerical simulations.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

状態空間手法によるCARIMA系の一般化予測制御

twitter
facebook
mendeley

Bibtex

Ris

フィードバック結合を含むニューラルネットワークの学習について

加藤 泰久, 山本 裕

pp. 369-374

DOI:

10.5687/iscie.4.369

抄録

This paper presents a learning algorithm for neural networks having general feedback connections. Simulation results are presented to compare the algorithm with the existing backpropagation algorithm; the former is shown to have a greater capability in realizing complex tasks.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

フィードバック結合を含むニューラルネットワークの学習について

twitter
facebook
mendeley

Bibtex

Ris

ルールベースを用いたフレキシブル生産システムのオンライン・スケジューリング

鳩野 逸生, 山縣 敬一, 田村 坦之

pp. 375-381

DOI:

10.5687/iscie.4.375

抄録

This paper deals with rule-based on-line scheduling of Flexible Manufacturing Systems (FMS). Operations research methods and simulation methods, which have been often used in off-line scheduling, cannot be applied to on-line scheduling, because of the computational complexity. To cope with this difficulty, we propose to apply a rule base to resolve the conflicts arised in machine tools or transports. To generate and evaluate the rule base for on-line schedulings, we construct an FMS simulation system to describe stochastic behavior, such as failures of machine tools, repair time and variations of processing times using hierarchical stochastic Petri nets. By using the FMS simulation system, we construct and evaluate the rule base for on-line scheduling.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

ルールベースを用いたフレキシブル生産システムのオンライン・スケジューリング

twitter
facebook
mendeley

Bibtex

Ris

Gödel含意を導入した様相制約条件計画問題と種々のファジィ数理計画問題

乾口 雅弘, 久米 靖文

pp. 382-392

DOI:

10.5687/iscie.4.382

抄録

The modality constrained programming (MCP) problem is previously proposed as the base model for unifying various fuzzy mathematical programming (FMP) problems. The relationships between MCP problems and six kinds of FMP problems have been discussed. However, some FMP problems, such as robust programming problem, FMP problem using fuzzy max, etc., did not have the relationships to MCP problems.
In this paper, introducing the Gödel implication into modality measures, a fuzzy relation between elements is extended to eight kinds of relations between possibility distributions. MCP problems are reformulated using these eight kinds of relations. The relationships between reformulated MCP problems and four kinds of FMP problems, i. e., robust programming problem, FMP problem using fuzzy max, FMP problem proposed by Luhandjula and modality goal programming problem, are investigated. Itis emphasized that most of FMP problems are interpreted in the framework of MCP problems and formulated based on the modal concept.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

Gödel含意を導入した様相制約条件計画問題と種々のファジィ数理計画問題

twitter
facebook
mendeley

Bibtex

Ris

論文アクセスランキング

21 Nov. (Last 30 Days)

この機能はログイン後に利用できます。
下のボタンをクリックしてください。

詳細検索

論文タイトル

著者

抄録

ジャーナル名

年

出版日を西暦で入力してください（4桁の数字）。

検索したいキーワードを入力して下さい