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

ジャーナル

論文検索サイト

アカウント

© 2022 Steel Science Portal

ヘルプ

詳細検索

論文検索サイト

site
site
site
site

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

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

キーワードランキング

27 Dec. (Last 30 Days)

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

多様な需要モデルに適応する最適発注点・発注量同時決定

村瀬 康比古, 増田 士朗, 福田 収一

pp. 411-418

DOI:

10.5687/iscie.17.411

抄録

We have proposed the safety stock model for various demand conditions in the previous papers. The papers gave some solutions for various demand distribution models which change serially and quickly, and proposed the safety stock model whose control is enabled at the fill rate of setting demand sufficiency. This paper is based on the practice of application deployment on the previous study, and we propose the new model which makes the minimum total cost by determining Ordering Point and Order Quantity simultaneously.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

多様な需要モデルに適応する最適発注点・発注量同時決定

twitter
facebook
mendeley

Bibtex

Ris

補助人員を用いる混合品種組立ラインの製品投入順序づけ

柳 在圭, 石田 愛美, 清水 良明

pp. 419-425

DOI:

10.5687/iscie.17.419

抄録

This paper concerns with a sequencing problem to raise the efficiency of line handling in a mixed-model assembly line where products are assembled in the same cycle time. The goal of the sequencing is to attain two objectives simultaneously, i.e., smoothing of work-load and smoothing of part usage. On real mixed-assembly lines, there exist large variations in the assembly times among different product-models. This causes inefficiency such as line stop or increase in idle time. In this paper, we propose a sequencing method to achieve the above two objectives with the help of Relief Man in such situation. For this purpose, the sequencing problem of minimizing both line stop times and idle times is formulated. Since this problem refers to combinational optimization problems, we develop a hierarchical method that applies meta-heuristics like SA (Simulated Annealing) together with NNM (Nearest Neighbor Method). Finally, we examine effectivness of the proposed method through computer simulations.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

補助人員を用いる混合品種組立ラインの製品投入順序づけ

twitter
facebook
mendeley

Bibtex

Ris

ILQ設計法を用いた冷間タンデム圧延機のミルバランス制御

村上 晃, 新谷 裕和, 中山 万希志, 岡本 充央, 佐野 研一

pp. 426-434

DOI:

10.5687/iscie.17.426

抄録

We have developed a mill balance control system, which regulates the motor currents and rolling forces of tandem-cold-mill stands while maintaining finish gage accuracy.
The controller is designed using the ILQ design method and constructs a cascade loop outside an automatic-gage-control loop.
The experimental results showed that maximum rolling speeds have increased by 2.4% on average without deterioration of gage accuracy or strip shape.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

ILQ設計法を用いた冷間タンデム圧延機のミルバランス制御

twitter
facebook
mendeley

Bibtex

Ris

競合・協調型神経回路によるカラー画像の立体認識に関する研究

華 希俊, 横道 政裕, 河野 通夫

pp. 435-443

DOI:

10.5687/iscie.17.435

抄録

Stereo vision is a passive method of obtaining depth information of visible surface by measuring disparity of corresponding points in left and right stereo images. Stereo matching, which belongs to ill-posed problems, is the key issue of stereo vision. In the literature, almost all matching techniques only use gray-scale images. The color information is usually neglected, but undoubtedly it may be of great use in helping robot stereo systems perform better. In this paper, we use two layered self-organization neural network model to simulate the competitive and cooperative interaction of binocular neurons. We propose a special similarity function as initial input to make full use of the color information. In RGB color space, the similarity map is established by taking logical AND calculation of red, green and blue color value similarity. In stereo matching experiment, we first consider color random-dot stereogram for stereo correspondence. Then we take real image experiments by means of different color stereo matching approaches. Experiments results have shown that the quality and convergence speed of the stereo matching can be efficiently improved by using appropriate color matching algorithm comparing with the conventional grey value algorithm.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

競合・協調型神経回路によるカラー画像の立体認識に関する研究

twitter
facebook
mendeley

Bibtex

Ris

ワルラス型仮想市場の均衡解に対するパレート最適性の検証

貝原 俊也, 藤井 進, 吉村 徳泰

pp. 444-450

DOI:

10.5687/iscie.17.444

抄録

Walrasian market is one of the most common economic models for virtual market. In neoclassical economics, it is well-known that the allocation in an equilibrium state of Walrasian market is Pareto optimal. In this paper, we develop several Walrasian virtual markets based on multi-agent paradigm, and validate their Pareto optimality of the allocation by comparing our method with analytic approaches, such as the E-constraint method and the fixed point algorithm. We also discuss the efficiency of our method in terms of caliculation time.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

ワルラス型仮想市場の均衡解に対するパレート最適性の検証

twitter
facebook
mendeley

Bibtex

Ris

3次元有限オートマトンと3次元層を持った時間限定ボトムアップピラミッドセルラアクセプタの受理能力の関係

坂本 眞人, 野上 滋久, 井上 克司, 河野 通夫

pp. 451-458

DOI:

10.5687/iscie.17.451

抄録

In this paper, we introduce a new model of acceptor on a three-dimensional pattern, called the time-bounded bottom-up pyramid cellular acceptor with three-dimensional layers whose input tapes are restricted to cubic ones (3-UPC AC), and investigate a relationship between the accepting powers of 3-UPCAc's and three-dimesional finite automata whose input tapes are restricted to cubic ones (3-FAc's). We first show that nondeterministic 3-UPCAc's are more powerful than nondeterministic 3-FAc's. We next show that O ((diameter) 2 × log diameter) time is sufficient for deterministic 3-U PC Ac's to simulate deterministic 3-FAc's, and that O ((diameter) 3) time is sufficient for deterministic 3-UPCAc's to simulate nondeterministic 3-FAc's. Finally, we show that Ω ((diameter) 2 × log diameter) time is necessary for nondeterministic 3-UPCAc's to simulate alternating 3-FAc's.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

3次元有限オートマトンと3次元層を持った時間限定ボトムアップピラミッドセルラアクセプタの受理能力の関係

twitter
facebook
mendeley

Bibtex

Ris

外的基準がある場合の独立成分分析と局所的モデリングへの拡張

本多 克宏, 下村 直也, 市橋 秀友

pp. 459-467

DOI:

10.5687/iscie.17.459

抄録

This paper proposes an enhanced technique of independent component analysis (ICA), which extracts independent components uncorrelated to some external criteria. Fast ICA algorithm is performed after the preprocessing by principal component analysis with external criteria, in which the effects of the external criteria are removed from data sets using regression analysis. The proposed method can also be expanded into local ICA by using hybrid technique of fuzzy clustering and regression analysis. Numerical experiments including knowledge discovery from POS transaction data reveal the characteristic feature of the proposed method.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

外的基準がある場合の独立成分分析と局所的モデリングへの拡張

twitter
facebook
mendeley

Bibtex

Ris

論文アクセスランキング

27 Dec. (Last 30 Days)

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

詳細検索

論文タイトル

著者

抄録

ジャーナル名

年

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

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