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

ジャーナル

論文検索サイト

アカウント

© 2022 Steel Science Portal

ヘルプ

詳細検索

論文検索サイト

site
site
site
site

システム/制御/情報 Vol. 17 (2004), No. 3

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. 17 (2004), No. 3

解の部分固定により探索空間を縮小するメタ戦略の検討

沼田 一道, 岩倉 行信

pp. 103-112

DOI:

10.5687/iscie.17.103

抄録

In this paper we present a new meta-heuristic approach to the traveling Salesman problem (TSP) and evaluate its performance. Proposed method reproduces and selects a population of local optima searched by random start modified Lin-Kernighan (mLK) method. It enhances the search power and efficiency of mLK by fixing the part of the solution whose values coincide each other and thus reducing the search space of solutions. Results of numerical experiments on TSPLIB95 (500 or so cities instances) show that it is superiorly competitive to existing meta-heuristic methods for TSP. The reason of enhanced search power is also investigated through obserbation of its search processes.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

解の部分固定により探索空間を縮小するメタ戦略の検討

twitter
facebook
mendeley

Bibtex

Ris

共通バッファ制限付きジョブショップスケジューリング問題の解法

傅 貴, 趙 勇, 三宮 信夫

pp. 113-121

DOI:

10.5687/iscie.17.113

抄録

A new jobshop scheduling problem with limited common buffers is dealt with in this paper. The standard genetic algorithm is not applicable to the present problem for deadlocks led by buffer constraints. A new algorithm is proposed by combining the genetic algorithm (GA) with a semi-active decoding which avoids deadlocks and satisfies the buffer constraints. Some benchmark problems appending with buffer constraints are tested by both the proposed GA and the multi-start local search method (MLS). Computation results show that the proposed GA outperforms MLS well. Computation is also made by varying the number of common buffers. These results are compared among the available results of the no-buffer jobshop problem and the normal jobshop problem. Consequently the results of the proposed GA are satisfactory.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

共通バッファ制限付きジョブショップスケジューリング問題の解法

twitter
facebook
mendeley

Bibtex

Ris

決定木に基づくペアワイズサポートベクトルマシンの構造決定方式

高橋 文武, 阿部 重夫

pp. 122-130

DOI:

10.5687/iscie.17.122

抄録

Decision Directed Acyclic Graph (DDAG) and Adaptive Directed Acyclic Graph (ADAG) are the decision-tree-based support vector machines for multiclass problems. These methods show high generalization abilities but their abilities depend on the structures. In this paper, we determine the structures so that the unclassifiable regions caused by voting are resolved by the decision boundaries for class pairs with low generalization ability. Namely, at the higher level of the tree, we select a pair of classes with higher generalization ability that is estimated by the error bounds proposed for SVMs. We demonstrate the effectiveness of our method using benchmark data sets.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

決定木に基づくペアワイズサポートベクトルマシンの構造決定方式

twitter
facebook
mendeley

Bibtex

Ris

過渡応答のロバスト性を考慮したモデル規範型ILQサ-ボ系の解析と設計

國松 禎明, 藤井 正和, 藤井 隆雄

pp. 131-138

DOI:

10.5687/iscie.17.131

抄録

In this paper, we propose a design method for servo systems with tracking robustness. Here we consider the control configuration of robust servo system plus a reference model, in which the robust servo system is designed by the ILQ design method as proposed by the third author. First, we show the configuration of this servo system and then provide a theoretical basis for parameter tuning. Second, we clarify the relation between these parameters and the closed loop performance such as robust stability and tracking robustness. Finally we establish a new design method of ILQ servo system with tracking robustness, and show its effectiveness by a numerical example.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

過渡応答のロバスト性を考慮したモデル規範型ILQサ-ボ系の解析と設計

twitter
facebook
mendeley

Bibtex

Ris

EMアルゴリズムを用いた確率的通信路に対する適応等化法

河本 孝生, 岩田 一貴, 池田 和司, 林 和則, 酒井 英昭

pp. 139-141

DOI:

10.5687/iscie.17.139
mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

EMアルゴリズムを用いた確率的通信路に対する適応等化法

twitter
facebook
mendeley

Bibtex

Ris

論文アクセスランキング

26 Dec. (Last 30 Days)

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

詳細検索

論文タイトル

著者

抄録

ジャーナル名

年

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

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