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

ジャーナル

論文検索サイト

アカウント

© 2022 Steel Science Portal

ヘルプ

詳細検索

論文検索サイト

site
site
site
site

システム/制御/情報 Vol. 14 (2001), 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.8
    2. No.7
    3. No.6
    4. No.5
    5. No.4
    6. No.3
    7. No.2
    8. 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

キーワードランキング

23 Nov. (Last 30 Days)

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

今西進化論に基づく遺伝アルゴリズムによるモジュール配置問題の多様な最適解の探索

田川 聖治, 水谷 浩二, 井上 克已, 羽根田 博正

pp. 467-474

DOI:

10.5687/iscie.14.467

抄録

In order to find the plural number of optimal solutions for the module placement problem, which is of particular significance in the design of VLSI, a new Genetic Algorithm (GA) based on Imanishi's evolutionary theory is proposed. First of all, a phenotypic distance between two solutions, or individuals, is defined as the shortest Hamming distance between sets of isomorphic genotypes. If the phenotypic distance between two individuals is shorter than a threshold value, they are regarded as the same species. Then, a new generation alternation model that is analogous to the habitat segregation is presented. Since each individual in the population represents an isolating species, the diversity of the population is maintained spontaneously. Even though the selection of individuals based on their fitness is not employed, excellent individuals are created effectively by using the harmonic crossover operation combined with a local optimization method.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

今西進化論に基づく遺伝アルゴリズムによるモジュール配置問題の多様な最適解の探索

twitter
facebook
mendeley

Bibtex

Ris

二次最小化問題の超複素数への非凸緩和-性質とそれに基づく探索アルゴリズム

森 耕平, 原 辰次

pp. 475-482

DOI:

10.5687/iscie.14.475

抄録

This paper addresses a sort of non-convex relaxation problem for the minimization problem of a quadratic function. We define relaxation problems by generalizing the feasible region of the original problem to the space consisting of hypercomplex numbers. Computational experiments for 0-1 quadratic minimization problems reveal the effectiveness of two proposed algorithms based on the derived properties. Fundamental properties of the relaxation problem for a more general class of quadratic minimization problems are also discussed.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

二次最小化問題の超複素数への非凸緩和-性質とそれに基づく探索アルゴリズム

twitter
facebook
mendeley

Bibtex

Ris

インターポレータのサンプル値H∞設計

永原 正章, 山本 裕

pp. 483-489

DOI:

10.5687/iscie.14.483

抄録

A design procedure for interpolators is developed based on sampled-data control theory. The procedure provides an interpolator which minimizes the L2-induced norm of the error system between the interpolator and a time-delay, and the L2/l2-induced norm of the system between the quantization noise and the output of. the interpolator. While the system is multirate and has delay elements, the design problem can be reduced to a finite-dimensional discrete-time problem using the FSFH (fast-sample and fast-hold) approximation. Numerical examples are presented to illustrate the effectiveness of the proposed method.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

インターポレータのサンプル値H∞設計

twitter
facebook
mendeley

Bibtex

Ris

針路と速度を不規則に変更する移動体の拡張カルマンフィルタによるトラッキング

大住 晃, 安木 誠一, 平田 順士, 井尻 善久, 長山 剛久, 佐々木 啓人

pp. 490-498

DOI:

10.5687/iscie.14.490

抄録

In this paper, an effective tracking method for a maneuvering target moving at unknown variable speed on the 2-dimensional plane is proposed. First, dynamics are derived for the target which moves at variable speed by introducing the first-order dynamics for the target's jerk motion as a modified Singer model. Next, in order to get highly accurate tracking, the kinematic constraints are incorporated into measurement equation as pseudomeasurements. Based on the extended Kalman filter algorithm, the tracking filter is derived from the linear dynamics and the augmented nonlinear measurement equation. The efficacy of this method is shown by simulations using real data.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

針路と速度を不規則に変更する移動体の拡張カルマンフィルタによるトラッキング

twitter
facebook
mendeley

Bibtex

Ris

ハイブリッドGAによるLSIセルのCongestion-Driven並列配置手法とその評価

吉川 雅弥, 寺井 秀一, 山内 寛紀

pp. 499-510

DOI:

10.5687/iscie.14.499

抄録

A congestion-driven placement technique for LSI cells through hybrid genetic algorithm is presented. In particular, the procedure consists of a two-level hierarchical placement procedure and a hybrid genetic algorithm, in which the algorithm is combined with the approach of searching locally for an optimal solution. For selection control, new objective function are introduced to each phase for dispersing congestion, and a parallel processing technique suited to hierarchical placement is proposed as an effective approach to accelerating the processing speed of genetic algorithm-based placement. Regarding to total virtual wire length and wire congestion, the ratio of the proposed approach to the conventional one is 0.76 and 0.9, respectively. As a result, the effectiveness of the suggested approach is shown through a comparison with the conventional one.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

ハイブリッドGAによるLSIセルのCongestion-Driven並列配置手法とその評価

twitter
facebook
mendeley

Bibtex

Ris

共通リヤプノフ関数を持つシステムサブクラス間の関係について

森 禎弘, 森 武宏, 黒江 康明

pp. 511-513

DOI:

10.5687/iscie.14.511
mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

共通リヤプノフ関数を持つシステムサブクラス間の関係について

twitter
facebook
mendeley

Bibtex

Ris

論文アクセスランキング

23 Nov. (Last 30 Days)

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

詳細検索

論文タイトル

著者

抄録

ジャーナル名

年

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

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