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

ジャーナル

論文検索サイト

アカウント

© 2022 Steel Science Portal

ヘルプ

詳細検索

論文検索サイト

site
site
site
site

システム/制御/情報 Vol. 12 (1999), No. 2

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.9
    2. No.8
    3. No.7
    4. No.6
    5. No.5
    6. No.4
    7. No.3
    8. No.2
    9. 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

キーワードランキング

26 Dec. (Last 30 Days)

システム/制御/情報 Vol. 12 (1999), No. 2

想起機能と探索機能を行うシナジェティック・コンピュータのパラメータ設計法

奥原 浩之, 尾崎 俊治

pp. 73-81

DOI:

10.5687/iscie.12.73

抄録

Synergetic computers are applied for association of images consisting of many elements. Its dynamics and functions are given by a potential. The form of potential is determined by its parameters. This paper discusses the associative function and the searching function of synergetic computers. In the associative function, all embedded patterns are dealt with the likes of the same. In the searching function, on the other hand, we can consider the hierarchy and the belonging of each embedded pattern. We clarify the design of parameters in order to execute the associative function and the searching function by using synergetic computers.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

想起機能と探索機能を行うシナジェティック・コンピュータのパラメータ設計法

twitter
facebook
mendeley

Bibtex

Ris

観測雑音を有する離散型非線形システムに対するチェビシェフ補間型同定とその誤差限界

新宮 忠敏, 高田 等

pp. 82-89

DOI:

10.5687/iscie.12.82

抄録

In this paper, we propose an identification method of discrete-type nonlinear systems with additive measurement noises using Chebyshev polynomials. A nonlinear function is assumed to be approximately described by a linear combination of some Chebyshev polynomials. Each coefficient of the polynomials is easily evaluated by the least squares method. An error bound of the identification is also estimated here. Moreover, the optimal order of the Chebyshev polynomials is determined by using the Akaike's information criterion. The paper includes simulation experiments to demonstrate the effectiveness of the proposed method.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

観測雑音を有する離散型非線形システムに対するチェビシェフ補間型同定とその誤差限界

twitter
facebook
mendeley

Bibtex

Ris

希望を考慮した多目的時間割問題の解法

田中 雅博, 山田 真理

pp. 90-97

DOI:

10.5687/iscie.12.90

抄録

In this paper, the time tabling problem of schools is discussed where the teachers' preference of time slots for each lecture is considered. The teachers' preference and the students' wishes are aggregated into two objectives, and the problem is treated as the two objectives of the multicriteria optimization problem. The problem is solved by using the framework of multiobjective genetic algorithm. The primary difficulty of this problem is how to satisfy the constraints. Here this problem is solved by using the local search for each individual that does not satisfy the constraints, and the revised ones are used in the next generation.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

希望を考慮した多目的時間割問題の解法

twitter
facebook
mendeley

Bibtex

Ris

人間の視覚探索と音声知覚との関連特性について

呉 景龍, 水原 啓暁, 西川 〓一

pp. 98-105

DOI:

10.5687/iscie.12.98

抄録

Recently, the cause of many car accidents is to use car-phone while driving. We hypothesize that one of the causes of such traffic accidents is that the human visual information processing is affected by the auditory information. In order to evidence the hypothesis, human characteristics between visual search and speech perception have been measured by psychological experiments. On the measurement results, in the case of the auditory information is presented concurrently, the visual reaction time is longer than that in the case of the visual information is presented only. The results of fundamental experiments with human visual and auditory characteristic suggest one of the cause of traffic accidents in using car-phone is that the human visual information processing is affected by the auditory information.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

人間の視覚探索と音声知覚との関連特性について

twitter
facebook
mendeley

Bibtex

Ris

状態空間法による一般化予測制御系の2自由度構成法

矢納 陽, 増田 士朗, 井上 昭, 平嶋 洋一

pp. 106-114

DOI:

10.5687/iscie.12.106

抄録

Generalized Predictive Control (GPC) achieves the robust tracking for the step-type target signal by including an integrator in advance. But if there exists neither modeling error nor disturbance, the integral compensation may cause the degeneration of transient responce or an excessive control effort. That is, it is to be desired that the integral compensation shows itself only if there exists modeling error or disturbance. So we propose a design scheme of two degree-of-freedom GPC system. The proposed method reveals the effect of the integral compensation only if there exists modeling error or disturbance. Therefore, performance degradation due to an integral compensation, such as a slow response or an excessive control effort, can be avoided when the control system has no perturbation.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

状態空間法による一般化予測制御系の2自由度構成法

twitter
facebook
mendeley

Bibtex

Ris

前処理付き遺伝的アルゴリズムの大規模プラントケーブル敷設設計への適用

朝隈 康司, 宮本 昌明, 北風 和久, 木ノ内 康夫

pp. 115-126

DOI:

10.5687/iscie.12.115

抄録

This paper describes the application of genetic algorithm (GA) to a cable installation design in a large-scale plant. This application assumes that the design of plant equipment and cable trays has been completed. Here, to deal with the exceedingly large number of cable-route combinations in a large-scale plant, we propose a new preprocessing method using the Dijcstra method for constructing genes that significantly reduces the number of combinations and improves the search for the shortest route. Moreover, based on correlation analysis between evaluated values, we pay particular attention to cable grouping that skilled designers have come to emphasize in their design work, and propose a new method for installing cables that uses cable grouping as a genetic operator. This method achieves a level of optimization exceeding that of manual design and substantially reduces computational time. Comparing with actual design data from skilled designers, it was found that the above methods can produce an even more satisfactory solution in a practical period of time (within two hours) on a workstation.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

前処理付き遺伝的アルゴリズムの大規模プラントケーブル敷設設計への適用

twitter
facebook
mendeley

Bibtex

Ris

満足化トレードオフ法を用いた放射線外照射治療の照射条件決定

熊本 悦子, 藤井 進, 黒川 憲之, 塚本 康夫, 松尾 導昌

pp. 127-135

DOI:

10.5687/iscie.12.127

抄録

In the external beam radiotherapy, it is required to optimize the number of beams, the beam angles, and the strength of irradiation, which deliver the lethal dose to the tumor while limiting the dose absorbed in the normal tissue with fewer beams. In this study, we formulate this problem as a multiobjective linear programming, and propose a planning method to balance the dose distribution and the number of beams by using satisficing trade-off method. An aspiration level to each concerning point specifies the planner's direction for each objective. Therefore, we applied cluster analysis to classify the objective functions, enabling the planner to set up aspiration levels for clusters rather than each objective, which significantly ease the planning task. An illustrated plan of a treatment for cerebral tumor is given to demonstrate the effectiveness of the proposed method.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

満足化トレードオフ法を用いた放射線外照射治療の照射条件決定

twitter
facebook
mendeley

Bibtex

Ris

論文アクセスランキング

26 Dec. (Last 30 Days)

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

詳細検索

論文タイトル

著者

抄録

ジャーナル名

年

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

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