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

ジャーナル

論文検索サイト

アカウント

© 2022 Steel Science Portal

ヘルプ

詳細検索

論文検索サイト

site
site
site
site

システム/制御/情報 Vol. 15 (2002), No. 4

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

キーワードランキング

22 Dec. (Last 30 Days)

システム/制御/情報 Vol. 15 (2002), No. 4

むだ時間系に対する同定とLQG制御の繰り返し設計

市原 裕之, 阿部 直人

pp. 159-166

DOI:

10.5687/iscie.15.159

抄録

This paper deals with an LQG control problem for input time delay systems using closed-loop identification. A virtual system is introduced to solve a spectral factorization, which does not include integral operator. The solution of the factorization is used as a prefilter of closed-loop identification. An iterative identification and control design method is applied and some numerical examples are shown.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

むだ時間系に対する同定とLQG制御の繰り返し設計

twitter
facebook
mendeley

Bibtex

Ris

協調型共進化GAによる動的施設配置問題の一解法

張 明, 大倉 和博, 上田 完次

pp. 167-174

DOI:

10.5687/iscie.15.167

抄録

A cooperative coecolutionary genetic algorithm (CCGA) to the dynamic facility layout problems (DFLP) is examined. The CCGA has two major features. Firstly, a multi-population approach is adopted. The entire solution is constructed by individuals picked up from each population which corresponds to layouts of a production period in DFLP. An individual's fitness value is calculated with the best individuals of the other populations so that the populations can co-evolve in a cooperative manner. Secondly, steady-state selection process is embedded in each population to promote the exploitation in the genetic search. Computer simulations on two benchmark problems are conducted. It is found that the CCGA outperforms the other GAs consistently.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

協調型共進化GAによる動的施設配置問題の一解法

twitter
facebook
mendeley

Bibtex

Ris

Webブラウジングを対象としたページ分割による情報フィルタリング手法の提案と評価

松田 憲幸, 野本 豊裕, 平嶋 宗, 豊田 順一

pp. 175-183

DOI:

10.5687/iscie.15.175

抄録

We propose a method of information filtering for Web browsing based on a model of user's interests. We have already proposed Context-Sensitive Filtering (CSF) for browsing on CD-ROM encyclopedia, which follows up shifting user's interests in this case. We confirmed the effectiveness of CSF. However, it is not very effective for Web browsing. We assumed that one of the reasons is the difference of pages between the Web and CD-ROM encyclopedia. We describe improvements of modeling to estimate user's interests and filtering method by dividing Web pages. We confirmed the effectiveness of our filtering through an experiment to compare several filtering methods.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

Webブラウジングを対象としたページ分割による情報フィルタリング手法の提案と評価

twitter
facebook
mendeley

Bibtex

Ris

ヒストグラムに基づいた再生関数のノンパラメトリック推定

神下 尚之, 土肥 正, 尾崎 俊治

pp. 184-193

DOI:

10.5687/iscie.15.184

抄録

When the statistical data such as failure data, which are realizations of an i.i.d. random variable, are given, the histogram is often used to understand the underlying distribution property. In this paper, we propose a non-parametric algorithm to estimate the renewal function from the histogram. The estimation algorithm is based on the direct Rieman-Stieltzes integration method. Also, it can be improved in terms of estimation accuracy by applying the interpolation with the spline function or the radial basis function neural network. Finally, in numerical examples, we evaluate the proposed algorithm and its improved versions, and refer to the potential applicability of them.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

ヒストグラムに基づいた再生関数のノンパラメトリック推定

twitter
facebook
mendeley

Bibtex

Ris

マルチロボット溶接における溶接経路の最適化

勘定 義弘, 阿瀬 始

pp. 194-202

DOI:

10.5687/iscie.15.194

抄録

Multi-robot systems have been introduced actively in heavy industry in order to increase the productivity. However, since the configuration of workpiece is complex due to multi-kind small lot production especially in shipbuilding and in multi-robot systems robots are disposed as densely as possible in a working area to get high productivity, collision between adjacent robots could occur. Because the collision prevents effective production, collision occurrence should be avoided. This paper reduces the problem of minimization of total welding time subject to collision/deadlock avoidance among multi-robots to a path optimization one, and solves it through genetic algorithm (GA). Its effectiveness is shown by numerical simulations with practical workpieces. Furthermore, a two-step GA algorithm is proposed, where the welding path of the maximal loaded robot is optimized first and then those of other robots are optimized.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

マルチロボット溶接における溶接経路の最適化

twitter
facebook
mendeley

Bibtex

Ris

単一工程モデルでの利益最大化生産スケジユーリング

栢木 紀哉, 柳川 佳也, 宮崎 茂次

pp. 203-212

DOI:

10.5687/iscie.15.203

抄録

Various scheduling methods have been proposed in order to minimize total flow time or total actual flow time, and thereby promote efficient production. However, such methods are not so effective to maximize company profit, given that requests from customers and the prices of products have grown widely diversified in recent years. In such a case, it must be determined whether the profit can be maximized when both flow times are minimized. This paper proposes an optimal scheduling method which maximizes total profit as a performance measure in a single machine model. Our computational experiments show the usefulness and characteristics of the proposed method.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

単一工程モデルでの利益最大化生産スケジユーリング

twitter
facebook
mendeley

Bibtex

Ris

2段階の能動ステレオ画像計測法を用いたハンドヘルド型3Dスキャナ

藤田 日出人, 蚊野 浩, 吉田 博明, 安田 昌司

pp. 213-219

DOI:

10.5687/iscie.15.213

抄録

A new 3D scanning device which consists of a hand-held 3D sensor head and a stereo camera, is developed. In the measuring process, the coordinates of observed points are computed relative to the 3D sensor head, and the 3D sensor head is located relative to the fixed stereo camera. The 3D coordinates of the measured object are reconstructed in the two-stage process. The unique two-stage method makes it possible to move the sensor head freely and to measure the whole shape of the object in one sequence, of scanning. In this paper, we describe the system structure, the principle of measurement, some examples of measurement and its accuracy.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

2段階の能動ステレオ画像計測法を用いたハンドヘルド型3Dスキャナ

twitter
facebook
mendeley

Bibtex

Ris

2自由度一般化最小分散制御則に基づくセルフチューニング2自由度PID補償器の設計法

佐藤 孝雄, 井上 昭, 平嶋 洋一

pp. 220-222

DOI:

10.5687/iscie.15.220
mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

2自由度一般化最小分散制御則に基づくセルフチューニング2自由度PID補償器の設計法

twitter
facebook
mendeley

Bibtex

Ris

論文アクセスランキング

22 Dec. (Last 30 Days)

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

詳細検索

論文タイトル

著者

抄録

ジャーナル名

年

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

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