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

ジャーナル

論文検索サイト

アカウント

© 2022 Steel Science Portal

ヘルプ

詳細検索

論文検索サイト

site
site
site
site

システム/制御/情報 Vol. 16 (2003), 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.2
    2. 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

キーワードランキング

16 May. (Last 30 Days)

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

順列循環型ビークル・ルーティングについて

呂 明哲, 胡 貴彦, 木瀬 洋

pp. 433-438

DOI:

10.5687/iscie.16.433

抄録

This paper discusses a vehicle routing problem for a permutation circulation-type vehicle routing system. In the system, several stages are located along by a single loop, and a fleet of vehicles travel on the loop unidirectionally and repeatedly. Traveling on the loop, each vehicle receives an object from the loading stage and then carries it to a certain processing stage, or receives an object from a certain processing stage and then carries it to the unloading stage per a turnaround. No passing is allowed for the vehicles on the loop. This paper proposes a heuristic algorithm for operating the system, which intends to reduce interferences between the vehicles. This paper also gives the numerical results with respect to the performance measures of the system such as the mean travel time of vehicles and the throughput of the system.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

順列循環型ビークル・ルーティングについて

twitter
facebook
mendeley

Bibtex

Ris

セルアレイ構造の逆量子化処理における性能評価

畑野 文博, 小椋 清孝, 森下 賢幸, 寺本 巖

pp. 439-450

DOI:

10.5687/iscie.16.439

抄録

The performance of the Cell Array's structure for the Dynamically Reconfigurable Cell-Array Processor (DRCAP), which we first proposed in 1997, in actual program execution is examined. In the DRCAP, the processing of c-language program sentences, such as “if” and “for”, is remarkably accelerated by applying the pipeline or the parallel operation to repeating calculations. The performance of the Cell Array's structure in actual program execution is evaluated for the MPEG de-quantization process. It is found that a processing rate 30 times as higher as those in the conventional microprocessors can be realized in the present DRCAP.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

セルアレイ構造の逆量子化処理における性能評価

twitter
facebook
mendeley

Bibtex

Ris

納期遅れジョブの削減・解消を目的とする能力追加を考慮したシミュレーションベース生産スケジューリング法

荒川 雅裕, 冬木 正彦, 井上 一郎

pp. 451-460

DOI:

10.5687/iscie.16.451

抄録

Aiming at elimination of tardy jobs in a job shop production schedule, a simulation-based scheduling method with functions to control job allocation and capacity addition is proposed. In order to determine pertinent additional capacities and to control job allocations simultaneously, the proposed method incorporates the parameter-space search improvement (PSSI) method in which four parameters are introduced into the scheduling procedure. Furthermore, the proposed method adopts a local search method in order to reduce the computation time to search for the best solution on the parameter space. Performances of the proposed method with respect to the reduction of tardy jobs and the computation time are evaluated not only on a simple job shop model but also by using practical planning condition data prepared for an actual scheduling system. The results show that the proposed method gives significant performance for reducing tardy jobs as well as the amount of additional capacities and it is available for practical use.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

納期遅れジョブの削減・解消を目的とする能力追加を考慮したシミュレーションベース生産スケジューリング法

twitter
facebook
mendeley

Bibtex

Ris

半正定値計画法を用いたLMS適応フィルタの設計とアクティブ消音への応用

若佐 裕治, 疋田 幹人, 山本 裕

pp. 461-467

DOI:

10.5687/iscie.16.461

抄録

The least mean square (LMS) algorithm has been widely used in adaptive signal processing applications, because of its simplicity and low complexity. This paper proposes a design method for an LMS-type algorithm which is robust in some sense and converges faster than the conventional LMS algorithm. The design problem is reduced to a semidefinite program which is an efficiently solvable optimization problem. Moreover the proposed design method is extended to the filtered-X LMS algorithm for active noise control, and an experimental result is provided to illustrate the effectiveness of the proposed method.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

半正定値計画法を用いたLMS適応フィルタの設計とアクティブ消音への応用

twitter
facebook
mendeley

Bibtex

Ris

ネットワーク型囚人のジレンマにおける協調行動の創発に関する研究

井寄 幸平, 鳩野 逸生, 小田 宗兵衛, 上田 完次

pp. 468-475

DOI:

10.5687/iscie.16.468

抄録

This paper describes how people establish or fail to establish long-run cooperation in the Prisoner's Dilemma Network (PDN), where subjects are allowed to nominate a subject with whom they want to play the Prisoner's Dilemma (PD) game at the beginning of each round. We have done a series of experiments with undergraduates and computer simulations of the PDN games. In the experiments most subjects either continued to play the PD game cooperatively with the same partner or never played the PD game cooperatively in the long run, and those who were more cooperative earned more. Since the simulations reproduced the results of the experiments, we can guess the subjects' strategies, which were not as apparent and controllable as the programs of agents.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

ネットワーク型囚人のジレンマにおける協調行動の創発に関する研究

twitter
facebook
mendeley

Bibtex

Ris

定常ゲインを考慮したモデル低次元化手法とその電力系統縮約への応用

桑原 丈, 細川 琢磨, 蛯原 義雄, 萩原 朋道, 森岡 靖夫

pp. 476-483

DOI:

10.5687/iscie.16.476

抄録

This paper is concerned with a model reduction method taking account of the steady-state gain, while keeping the H∞ norm of the associated error system as small as possible with the LMI optimization technique. Taking account of the steady-state gain leads to decreasing the integrated square error between the step response of the original system and that of the reduced order system. The proposed method is applied to the reduction of the model of a multi-machine electric power system to demonstrate its effectiveness.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

定常ゲインを考慮したモデル低次元化手法とその電力系統縮約への応用

twitter
facebook
mendeley

Bibtex

Ris

道路ネットワークにおける最も近い目的地の最速探索法

馮 鈞, 渡辺 豊英

pp. 484-491

DOI:

10.5687/iscie.16.484

抄録

This paper proposes a fast method, called cyclic optimal multi-step method, for searching nearest target object in the road network under the spatial database, in which both target objects and road network are indexed by R-trees. This method consists of filtering and refinement steps, which run cyclically. By using this method, the nearest search begins from selecting a target with the shortest straight-line, measured from a source, as the candidate for path search and then determines a search region which contains the selected candidate target and road-based path. To implement this method, a priority queue is introduced to record nodes of R-tree and candidate objects, and also a variable which indicates the radius of search region is done to record the mediate results in searching the minimum path. In this case, the key by which the elements on the queue are to be ordered is the distance from the source object. Since in our method the path search process is limited only inside the search region and moreover only the object located at the head of the queue is considered, the search process is greatly accelerated.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

道路ネットワークにおける最も近い目的地の最速探索法

twitter
facebook
mendeley

Bibtex

Ris

論文アクセスランキング

16 May. (Last 30 Days)

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

詳細検索

論文タイトル

著者

抄録

ジャーナル名

年

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

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