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

ジャーナル

論文検索サイト

アカウント

© 2022 Steel Science Portal

ヘルプ

詳細検索

論文検索サイト

site
site
site
site

システム/制御/情報 Vol. 11 (1998), No. 8

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. 11 (1998), No. 8

自動車故障診断システム構築における知識集約法

大塚 敬, 西田 眞, 一方井 義也

pp. 417-425

DOI:

10.5687/iscie.11.417

抄録

The paper investigates a methodology on knowledge compilation and refinement after its acquisition through a process of car diagnostics on the case of abnormal noise and vibration. The knowledge compilation and refinement involve three basic steps; making knowledge hierarchic, finding useful features of knowledge, and designing a simpler decision tree. The better the useful features of knowledge are found, the better the decision tree is designed. This led to effective use of the domain knowledge obtained in cooperation with experts. In order to facilitate the actual fault diagnosis, the decision tree was designed by solving a combinatorial problem to minimize the number of total branches on each primary subset of classification. As a result of the knowledge compilation and refinement, the number of queries on the fault diagnosis was reduced by 83 to 88 percent and the error rate of diagnosis was 10 percent in comparison with the judgement of experts.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

自動車故障診断システム構築における知識集約法

twitter
facebook
mendeley

Bibtex

Ris

相似パターンの多層ネットによる認識および回転角と拡大縮小比の検出

五反田 博, 川合 弘作, 山岡 立弥

pp. 426-433

DOI:

10.5687/iscie.11.426

抄録

For practical pattern recognition, it is required not only to recognize geometrically similar patterns but also to detect the difference of translation, rotation and size from their templates. This paper proposes a method to recognize the similar patterns by a multilayer net and then detect the difference on the common basis of well-known geometrical characteristics (center of gravity, angle of principal axis, and variance). It is found from experimental results that, with the proposed method, a small net can classify the similar patterns at a high recognition rate and detect their rotated angles and scale ratios with a high accuracy.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

相似パターンの多層ネットによる認識および回転角と拡大縮小比の検出

twitter
facebook
mendeley

Bibtex

Ris

プログラマブルコントローラを用いた制御システムにおけるリアルタイム故障検出用モデルの自動生成

鳩野 逸生, 馬場 健治, 古川 久生, 富山 伸司, 田村 坦之

pp. 434-440

DOI:

10.5687/iscie.11.434

抄録

This paper describes a method of generating the real-time fault detection model for manufacturing systems controlled by PC (Programmable Controller) automatically using Complementary-places Petri nets. To generate a fault detection model, we use two kinds of information : logging data of limit switches and ladder programs. By using the generated model, we can detect failures in the PC based manufacturing systems. Furthermore, we evaluate the method proposed in this paper by applying it to fault detection of a virtual production system.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

プログラマブルコントローラを用いた制御システムにおけるリアルタイム故障検出用モデルの自動生成

twitter
facebook
mendeley

Bibtex

Ris

電線加工工程におけるスケジューリング問題の遺伝アルゴリズムによる解法

飯間 等, 三井 修, 三宮 信夫, 榊原 隆太

pp. 441-448

DOI:

10.5687/iscie.11.441

抄録

This paper deals with a scheduling problem in a real electric wire production process. The process is of a flow-shop with two processes. In each process plural equipments are arranged in parallel. The scheduling problem is large-scale and has complicated constraints. A genetic algorithm (GA) is applied to the problem. If GA is designed so as to search all solutions in the fundamental space, it is inefficient because the number of such solutions is enormous. On the other hand some dispatching rules can be applied to scheduling problems if they are effective. However it is not easy to find an effective rule for complicated production processes. In this paper, GA is designed in such a way that appropriate dispatching rules are combined with the conventional GA operator. Consequently, a part of decision variables are determined by appropriate rules and the others are determined by the operation of GA. The effectiveness of the proposed method is confirmed by computational results.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

電線加工工程におけるスケジューリング問題の遺伝アルゴリズムによる解法

twitter
facebook
mendeley

Bibtex

Ris

散乱モデルとニューラルネットワークによるポラリメトリックSARデータの分類法

伊藤 陽介, 大松 繁

pp. 449-457

DOI:

10.5687/iscie.11.449

抄録

We consider a polarimetric SAR data classification method which uses scattering models. The proposed method is a neural network classifier composed of two classification procedures. First, SAR data is pre-classified into three scattering classes (odd, even, and diffuse & unable to classify) by individually computing the Mueller matrix and Stokes vector based on the van Zyl approach. Second, a neural network which suits to each scattering class is constructed and the data is identified as a final land cover type. Either the competitive or back-propagation neural network can be employed as a classifier. It is possible to identify more detail category in order to analyze scattering classes. As a result of the procedure using SIR-C C band data, 11 land cover types by combination of five categories and three scattering classes are identified. We assume the effectiveness of the proposed method in comparison to classification by checking the ground truth data.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

散乱モデルとニューラルネットワークによるポラリメトリックSARデータの分類法

twitter
facebook
mendeley

Bibtex

Ris

機能と挙動に基づくプラント異常時対応操作候補の導出

五福 明夫, 足立 和寛, 田中 豊

pp. 458-465

DOI:

10.5687/iscie.11.458

抄録

This paper proposes a technique to derive candidates of counter actions applying both functional modeling and qualitative reasoning methods with the purpose of supporting operator actions in an anomalous situation of engineering plants. A plant model is constructed by adding necessary knowledge to derive counter actions to a functional model of a target system by the MFM (Multilevel Flow Modelling). Algorithms are given to infer the affection of an anomaly, to determine the priority of plant states and/or goals to be recovered, and to derive candidates of counter actions. The applicability of the proposed technique is discussed using an anomalous case in a fluidized-bed refuse incineration plant.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

機能と挙動に基づくプラント異常時対応操作候補の導出

twitter
facebook
mendeley

Bibtex

Ris

メタヒューリスティックスによる都市街路網におけるサブエリア構成最適化

織田 利彦, 音喜多 亨, 津久家 智光, 橋場 加奈

pp. 466-476

DOI:

10.5687/iscie.11.466

抄録

For the purpose of implementing the coordinated traffic signal control, urban road networks in Japan are divided into several sub-areas. Each sub-area consists of a series of signal intersections. The traffic signal timing is optimized within each sub-area and reflects the local traffic situation. Since there is no well-established method of decomposing a traffic network into sub-areas, the decomposition is determined by skillful engineers based on their experience. This paper proposes a new method of decomposition, which is based on an effectiveness index reflecting the traffic delay and the topological structure of the sub-area network. To evaluate the performance of our approach, simulation experiments are carried out for an actual road network. The results show that the decomposition obtained by our method outperforms the conventional decomposition in terms of the employed performance index.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

メタヒューリスティックスによる都市街路網におけるサブエリア構成最適化

twitter
facebook
mendeley

Bibtex

Ris

論文アクセスランキング

16 May. (Last 30 Days)

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

詳細検索

論文タイトル

著者

抄録

ジャーナル名

年

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

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