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

ジャーナル

論文検索サイト

アカウント

© 2022 Steel Science Portal

ヘルプ

詳細検索

論文検索サイト

site
site
site
site

システム/制御/情報 Vol. 13 (2000), No. 5

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. 13 (2000), No. 5

安全装置の防護力を考慮したFAシステムのディペンダビリティ評価方法

峯尾 佳幸

pp. 213-220

DOI:

10.5687/iscie.13.5_213

抄録

The important factors for dependability are safety and reliability. When dependability is evaluated, in view of safety along with the probability of an accident occurring, both the degree of accident damage and the capability of installed-safety devices should be included as items to be evaluated. To establish a barometer to quantitatively determine the dependability of a system, a study to standardize and rationalize the safety index is currently under way. However, to standardize the Tree Analysis for Safety (TAS) which is used to determine the safety index of a system, TAS has been unable to deal with the degree of damage occurring in accidents and has not been able to cope with a wide range of accidents in a consistent manner. For a TAS standard that can be applied to accidents, we propose that a mechanism, to select safety devices applicable in accordance with protection capabilities, be built into TAS by identifying the upper limit of the protection capability of safety devices by considering the potential amounts of hazard potential factors which greatly affect the degree of accident damage. We have applied this system to accidents during normal hours and to maintenance in Factory Automation systems, and have confirmed that this system could be used as an evaluation method.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

安全装置の防護力を考慮したFAシステムのディペンダビリティ評価方法

twitter
facebook
mendeley

Bibtex

Ris

動的市場指向プログラミングに関する研究

貝原 俊也

pp. 221-227

DOI:

10.5687/iscie.13.5_221

抄録

Market price systems constitute a well-understood class of mechanisms that provide effective decentralisation of decision making with minimal communication overhead. In a market-oriented programming approach to distributed problem solving, the resource allocations for a set of computational agents are derived by computing competitive equilibrium of an artificial economy in static conditions. In this paper we newly propose a dynamic market-oriented programming. Each agent has transitional dynamic utilities and tries to find equilibrium point by evaluating the tradeoffs of acquiring different resources in dynamic environment. Careful constructions of the dynamic decision process according to economic principles can lead to efficient distributed resource allocation, and the behaviour of the system can be analysed in economic terms.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

動的市場指向プログラミングに関する研究

twitter
facebook
mendeley

Bibtex

Ris

作業順序決定と工具選択の同時決定アルゴリズム

Anas MA'RUF

pp. 228-235

DOI:

10.5687/iscie.13.5_228

抄録

In this study, a new heuristic method is proposed involving a non-recursive algorithm and priority rules to integrate the operation sequencing and tool selection phase in a CAM system. The object of the algorithm is to automatically define the operation sequence and tool to be used for each operation while minimizing the number of tool changes and the total number of tools. As an effective method for reducing tool preparatory task, resident tool practice is accommodated by comparing accumulated frequency record of the past use of candidate tools. A numerical example has been provided in this study. Also, the proposed algorithm is compared with other known algorithms and its advantages examined.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

作業順序決定と工具選択の同時決定アルゴリズム

twitter
facebook
mendeley

Bibtex

Ris

ファジィクラスタリングと回帰と主成分の同時分析法

本多 克宏, 山川 あす香, 市橋 秀友, 三好 哲也, 奥山 哲史

pp. 236-243

DOI:

10.5687/iscie.13.5_236

抄録

Hathaway and Bezdek's Fuzzy c-Regression Models (FCRM) is regarded as a simultaneous analysis of clustering and multiple regression. In high dimensional setting, the regression techniques do not perform well for reasonable sample sizes because of the inherent sparsity of samples in the cluster. This paper proposes a simultaneous approach to the clustering, principal component analysis and multiple regression analysis. Aiming at knowledge discovery from POS data that are recorded automatically into the cash register transactions, we analyze the relationship between meteorological information and sales of perishables.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

ファジィクラスタリングと回帰と主成分の同時分析法

twitter
facebook
mendeley

Bibtex

Ris

高解像イメージング用超音波リングアレイプローブ

大城 理, 南部 雅幸, 中塚 盛雄, 土居 元紀, 千原 國宏

pp. 244-249

DOI:

10.5687/iscie.13.5_244

抄録

This paper describes newly developed ultrasound ring array probes. In one probe, eight transducers were aligned circularly and turned toward the central axis of the probe. The other one has an ultrasound transducer with convex surface at the center of the probe and eight transducers was set to surround the transmitter and used as receivers. Using these probes, we performed experiments to reconstruct a 3D image of a measurement object. The experimental results indicated these probes has the availability for high resolution imaging.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

高解像イメージング用超音波リングアレイプローブ

twitter
facebook
mendeley

Bibtex

Ris

ニューラルネットを用いた移動ロボット車における軌道生成時間の短縮

大友 照彦, 大槻 恭士

pp. 250-257

DOI:

10.5687/iscie.13.5_250

抄録

In this paper, two time shortning methods are proposed in path planning calculation of the autonomous robot vehicle using the neural network. The first method is to automatically set the relay point in order to avoid the local minimum in the generation of optimum route, and the second method is to give initial value of motion command input into the cascaded neural networks from the look-up table learned. These methods used jointly are examined for the effectiveness by applying to the path planning in various environments.
As the results, the effectiveness of the system which used two methods jointly at the start and immediately excluded the restraint of the relay point passage afterwards was clarified.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

ニューラルネットを用いた移動ロボット車における軌道生成時間の短縮

twitter
facebook
mendeley

Bibtex

Ris

論文アクセスランキング

26 Dec. (Last 30 Days)

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

詳細検索

論文タイトル

著者

抄録

ジャーナル名

年

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

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