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

ジャーナル

論文検索サイト

アカウント

© 2022 Steel Science Portal

ヘルプ

詳細検索

論文検索サイト

site
site
site
site

システム/制御/情報 Vol. 11 (1998), 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.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. 10

GuardNet : マルチエージェント系のコミュニケーション機構の分散開発・実行環境

鷹合 基行, 武田 英明, 西田 豊明

pp. 529-537

DOI:

10.5687/iscie.11.529

抄録

In this paper, we propose a new environment that supports cooperative development of Multi-agent systems (MAS). For this purpose, we suggest a system called GuardNet. In GuardNet, which is also realized as MAS, there exists an agent called Guardant for every agent in target MAS. Guardants can store requirement specifications of their for target and relevant agents, and exchange them with each other on behalf of agent programmers. Another feature of GuardNet is agent-imitating facilities for debugging and testing. In agent-imitating, a Guardant behaves as a proxy either for the target agent or relevant agents. Using agent-imitating facilities, we can test the agent system which includes incomplete agents.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

GuardNet : マルチエージェント系のコミュニケーション機構の分散開発・実行環境

twitter
facebook
mendeley

Bibtex

Ris

情報エントロピーによる質的変量モデルについて

尾崎 都司正, 山本 重夫, 宮阪 信次, 原 敬, 木下 栄蔵

pp. 538-545

DOI:

10.5687/iscie.11.538

抄録

In the Osaka bay areas, where many regional development projects have been planned and carried out, the infrastructures such as electricity and gas are being consolidated. It is necessary to make optimum design considering future demands for those utilities. Qualitative response model based on utility value is effective to estimate demands for the project under indefinite conditions, especially the Logit model is popular tool to estimate demands. However, this model does not be clarified the choice behavior of a decision-maker in its inducing process, and is called in question in the supposition. This report showed that the Logit model can be derived from information entropy without positing an extreme value distribution. Besides, this paper showed that new aggregate conception was suggested for statistical calculation and that it was verified by applying to the amusement institutions.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

情報エントロピーによる質的変量モデルについて

twitter
facebook
mendeley

Bibtex

Ris

照明環境の変化にロバストな顔画像照合

土居 元紀, 佐藤 宏介, 千原 國宏

pp. 546-553

DOI:

10.5687/iscie.11.546

抄録

When realizing a practical face identification system, higher robustness against fluctuation of the lighting condition is required. In this paper, a new face template-matching method dedicating to facial features (eye, nose and mouth) is proposed. It uses a special template for each facial feature, which consists of sub-divided region with compensated intensity. First, the size and incline of the input face image is normalized. Secondly, the facial features are extracted and separated into some small regions. Next, the intensity values in each region are compensated according to their average and variance. Finally, the correlation coefficients between the compensated features and templates are evaluated as an identification score. Experiments with face images taken in various lighting conditions prove that the proposed method is more robust than conventional methods based on the normalized correlation coefficient.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

照明環境の変化にロバストな顔画像照合

twitter
facebook
mendeley

Bibtex

Ris

次数指定のH∞制御器設計法-双線形行列不等式からの接近

井前 讓, 古館 貴

pp. 554-567

DOI:

10.5687/iscie.11.554

抄録

In this paper, we deal with fixed-order H∞ controller design problems, based on bilinear matrix inequalities. BMI problems are nonlinear, non-differentiable and non-convex, and therefore very difficult to obtain global solutions numerically. First, we convert BMI problems into differentiable problems introducing so-called shift-parameters. Next, combining the shift-parameter scheme with quasi-Newton methods, we propose a new computational technique as BMI solvers. Lastly, we demonstrate the effectiveness of our approach by simulations, with applications to the design of fixed-order H∞ controllers.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

次数指定のH∞制御器設計法-双線形行列不等式からの接近

twitter
facebook
mendeley

Bibtex

Ris

弱い情報構造を用いたコミュニティの情報共有システム

前田 晴美, 梶原 史雄, 足立 秀和, 沢田 篤史, 武田 英明, 西田 豊明

pp. 568-575

DOI:

10.5687/iscie.11.568

抄録

We first discuss the requirements for community information sharing. We then propose an information representation called weak information structures to integrate heterogeneous information such as static information (e.g. local sites information) and dynamic information created in word-of-mouth communication. The weak information structures connects various information media without defining the semantics rigorously. By leaving the interpretation of the semantics to tacit human background knowledge, it becomes compact and robust. We have developed an information sharing system for community called InfoCommon which provides people with intelligent assistance for exchanging and sharing knowledge and ideas. We have evaluated InfoCommon at the ICMAS'96 Mobile Assistant Project.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

弱い情報構造を用いたコミュニティの情報共有システム

twitter
facebook
mendeley

Bibtex

Ris

周波数重み付き最適サーボ系設計への逆問題的アプローチ

塩出 一洋, 黒江 祐希, 藤井 隆雄, 須田 信英

pp. 576-584

DOI:

10.5687/iscie.11.576

抄録

This paper presents a design method of optimal servo systems with frequency weights from the view point of the inverse LQ problem. This design method allows us to assign desirable closed-loop transfer functions directly and in addition, to obtain the desired optimal control law in a closed form in terms of design parameters and the system parameters. A numerical example is also shown to illustrate the design method proposed here as well as to show its usefulness.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

周波数重み付き最適サーボ系設計への逆問題的アプローチ

twitter
facebook
mendeley

Bibtex

Ris

マルチレートD/A変換器のサンプル値H∞, H2/H∞設計

石井 秀明, 山本 裕

pp. 585-592

DOI:

10.5687/iscie.11.585

抄録

A procedure is developed to design a D/A converter via sampled-data control theory. A multirate converter with oversampling is designed to reconstruct a delayed original analog signal via H∞ and H2/H∞ design method. In spite of the multirate and delay elements, these problems are shown to be reducible to a finite dimensional discrete-time problem and furthermore to linear matrix inequality (LMI) conditions. Some numerical examples are presented to illustrate the results.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

マルチレートD/A変換器のサンプル値H∞, H2/H∞設計

twitter
facebook
mendeley

Bibtex

Ris

論文アクセスランキング

16 May. (Last 30 Days)

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

詳細検索

論文タイトル

著者

抄録

ジャーナル名

年

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

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