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

ジャーナル

論文検索サイト

アカウント

© 2022 Steel Science Portal

ヘルプ

詳細検索

論文検索サイト

site
site
site
site

システム/制御/情報 Vol. 12 (1999), No. 7

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. 12 (1999), No. 7

株価指数オプションの価格評価と相関分析

田中 泰明, 角野 泰臣, 土肥 正, 尾崎 俊治

pp. 379-389

DOI:

10.5687/iscie.12.379

抄録

In this paper, we discuss the pricing of stock index options. Under a generalized assumption that the underlying individual stock price which is an element of the stock index follows a semi-martingale process with correrlation, we derive the partial differential equation which the corresponding European stock index option prices satisfy. More precisely, we calculate the respective equilibrium prices for the value line index (VLI) option and the average stock index (ASI) option analytically and numerically. Finally, we perform the sensitivity analysis of model parameters in the option prices and the position analysis. Throughout numerical examples, it is shown quantitatively that the correlation for underlying assets is one of the most important factors to price stock index options.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

株価指数オプションの価格評価と相関分析

twitter
facebook
mendeley

Bibtex

Ris

ゲインスケジューリング系の設計におけるディスクリプタ形式の利用について

増淵 泉, 示村 悦二郎

pp. 390-394

DOI:

10.5687/iscie.12.390

抄録

The descriptor form provides system representations that preserve structure of systems along with static constraints on descriptor variables. Based on the descriptor-form representations of LPV (linear parameter varying) -systems, this paper proposes an approach to gain-scheduling controller synthesis. First, we show a descriptor form with scheduling parameters on the coefficient matrices and discuss using it as a model of LPV-systems. Next, we give a synthesis method of quadratically stabilizing LPV-controllers via solving LMIs for both state-feedback and output-feedback systems.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

ゲインスケジューリング系の設計におけるディスクリプタ形式の利用について

twitter
facebook
mendeley

Bibtex

Ris

修正機能を導入したハイブリッド遺伝アルゴリズムによる多目的混合整数計画問題の解法

清水 良明

pp. 395-404

DOI:

10.5687/iscie.12.395

抄録

We have concerned, in this paper, with developing a practical method for multi-objective mixed-integer programming problems. To cope with the problem in the hierarchical framework, we have already proposed the hybrid genetic algorithm incorporated with a modeling method of a value function using neural networks. In its master problem, genetic algorithm will solve the unconstrained discrete optimization using the neural network model of the value function, and mathematical program will solve the slave problem given as the constrained continuous optimization. Due to such good matches between the solution methods and the problem properties, the hybrid strategy can derive the best-compromise solution very effectively while the so far methods were limited to derive the Pareto optimal solution set. Furthermore, we have proposed a repair operation of genetic algorithm which models the mechanism of DNA in nature. It enables us to reduce the search space in genetic algorithm and the derived best-compromise solution to be a Pareto optimal solution. Hence, we can improve both the efficiency and the reliability in solution much more compared with the foregoing method.
To examine effectiveness of the proposed method in an actual application, we have concerned with a site location problems of hazardous wastes disposal. As known from the term NIMBY (Not In My Back Yard), it is an eligible case study associated both with environmental and economic concerns. After describing the problem generally as a multi-objective mixed-integer linear program, through numerical experiments, we have confirmed the proposed method can derive the best-compromise solution effectively. In addition, we have shown the repair operation of genetic algorithm can work better compared with a penalty function approach against the inactive ε-constraints and the foregoing method paying no concern on it.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

修正機能を導入したハイブリッド遺伝アルゴリズムによる多目的混合整数計画問題の解法

twitter
facebook
mendeley

Bibtex

Ris

あるクラスのむだ時間系の平衡実現近似

泉 智紀, 児島 晃, 石島 辰太郎

pp. 405-416

DOI:

10.5687/iscie.12.405

抄録

A calculation method of Hankel singular values is discussed for input and unilateral time delay systems. For input time delay systems, whose channels involve different value of time delays independently, the Hankel singular values are obtained based on a matrix Lyapunov equation. By introducing auxiliary systems for the unilateral time delay system, it is shown that the singular values are characterized based on the preliminary results for input time delay systems. When Hankel singular values and vectors are derived for input and unilateral time delay systems, the calculation method of balanced reduction is constructed. We investigate balanced reduction with numerical examples.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

あるクラスのむだ時間系の平衡実現近似

twitter
facebook
mendeley

Bibtex

Ris

機械式立体駐車場出庫スケジューリング

阿瀬 始, 茨木 俊秀, 柳浦 睦憲

pp. 417-427

DOI:

10.5687/iscie.12.417

抄録

Multi-story mechanical parking facilities are becoming popular in crowded cities, as they are space efficient. Each floor of such a facility consists of two rail-mounted automated carriers on a pair of rails running from one end to the other, and rows of cells along the rails, where each cell can accommodate one car. The number of rows varies from one to four. There are two elevators connecting all floors, which are dedicated to removal and placing of the cars, respectively. When many cars are waiting to enter and to leave, it is important to schedule the movement of carriers so that the required time is minimized. As a basic subproblem for an efficient scheduling of the total system, we consider here the problem of finding an optimal schedule when an ordered set of car removals is given. We present here an exact algorithm based on dynamic programming, which shows the problem can be solved in polynomial time even if it is a quite complicated combinatorial problem. Some computational results of nontrivial sizes are presented.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

機械式立体駐車場出庫スケジューリング

twitter
facebook
mendeley

Bibtex

Ris

連想表現を用いたコミュニティにおける知識の視覚化とその評価実験

平田 高志, 村上 晴美, 西田 豊明

pp. 428-436

DOI:

10.5687/iscie.12.428

抄録

This paper describes a method for knowledge sharing in a community using associative representation. We propose two ideas. One is associative representation for facilitating externalization of both personal and community information. The associative representation links heterogenenous information without definding the semantics strictly. We leave the interpretation of the semantics to human tacit knowledge. The other is visualization of information interaction using talking-agents metaphor. Taking-agents metaphor mimics a salon in which agents representing each community member interact with each others, thereby the user can see how their own or others' knowledge interact. We have developed a system called CoMeMo-Community that pursues collaborative story generation based on the talking-agents metaphor. We investigated how far people can exchange ideas with associative representation and how people react the talking-agents metaphor.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

連想表現を用いたコミュニティにおける知識の視覚化とその評価実験

twitter
facebook
mendeley

Bibtex

Ris

外部入力を有する拘束システムに対するスイッチング状態フィードバック制御則の構成法

平田 研二, 藤田 政之

pp. 437-443

DOI:

10.5687/iscie.12.437

抄録

This paper considers switching state feedback control of systems with unknown but bounded disturbance inputs subject to state and control constraints, and resolves convergence problems which arise with the effects of unknown disturbances. This difficulties have not been handled by the switching control laws which were proposed in the literatures. The proposed switching control law assures convergence of the state and successive controller switching even in the presence of unknown disturbances. The main idea is to construct an upper bound of the state reachable set ' such that convergence of the state is assured by restricting this set to some subset of the state space. The resulting optimization problems which provide a sequence of feedback gains are more difficult to solve than those with no disturbances. However, this optimization problems may be solved with some heuristic manners. In addition, required on-line computational burden is the same as that in case of no disturbance inputs.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

外部入力を有する拘束システムに対するスイッチング状態フィードバック制御則の構成法

twitter
facebook
mendeley

Bibtex

Ris

ロバストパフォーマンス制御則の存在を条件とする状態空間型モデル集合の同定法

木村 雅孝, 山本 茂, 長棟 亮三

pp. 444-446

DOI:

10.5687/iscie.12.444
mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

ロバストパフォーマンス制御則の存在を条件とする状態空間型モデル集合の同定法

twitter
facebook
mendeley

Bibtex

Ris

論文アクセスランキング

16 May. (Last 30 Days)

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

詳細検索

論文タイトル

著者

抄録

ジャーナル名

年

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

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