logo
Language
Bookmarks
Log Out

Journals

Search Sites

Account

© 2022 Steel Science Portal

How to use

Advanced Search

Search Sites

site
site
site
site

Transactions of the Institute of Systems, Control and Information Engineers Vol. 15 (2002), No. 7

ISIJ International
belloff
ONLINE ISSN: 2185-811X
PRINT ISSN: 1342-5668
Publisher: 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

Keyword Ranking

03 Dec. (Last 30 Days)

Transactions of the Institute of Systems, Control and Information Engineers Vol. 15 (2002), No. 7

A Group Analytic Network Process (ANP) for Incomplete Information

Kouichi TAJI, Yosuke SAGAYAMA, Hiroyuki TAMUARA

pp. 305-311

DOI:

10.5687/iscie.15.305

Abstract

In this paper, we propose an ANP framework for group decision-making problem with incomplete information. The proposed method consists of three parts, namely, aggregation of weights of alternatives, aggregation of weights of criteria and evaluation of global weights. In aggregating weights of alternatives, we calculate group weights from individual weights, which have been calculated by some AHP, by using a quadratic programming problem. In aggregating the weights of criteria, we calculate the weights for evaluating an alternative from the matrix, which is geometric average of pairwise comparison matrices of decision makers only who evaluate the alternative. Then the weights of criteria may be different in each alternative. Hence, we use the supermatrix method of ANP for evaluating global weights. A small numerical example shows that our proposed framework enables us to obtain the global weights of a group decision-making problem with incomplete information.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Group Analytic Network Process (ANP) for Incomplete Information

twitter
facebook
mendeley

Bibtex

Ris

Agent Strategy and Resource Allocation Dynamism on Market-Oriented Programming-Basic Analysis

Toshiya KAIHARA

pp. 312-319

DOI:

10.5687/iscie.15.312

Abstract

Market-oriented programming is a multi-agent-based concept to facilitate distributed problem solving. In market-oriented programming we take the metaphor of an economy computing multiagent behaviour literally, and directly implement the distributed computation as a market price system. In a market-oriented programming approach to distributed problem solving, the resource allocation for a set of computational agents is derived by computing competitive market of an artificial economy. Since heterogeneous agent strategies have intensive effects on the resource allocation, dynamism, we analyse and systematise their relationship in supply chain simulation with a virtual market.The behaviour of the system can be analysed in agent interactions based on economic strategies.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Agent Strategy and Resource Allocation Dynamism on Market-Oriented Programming-Basic Analysis

twitter
facebook
mendeley

Bibtex

Ris

A Method for Numerical Computation of Jordan Canonical Form of Matrix

Go Ohtake, Masanobu Koga, Mitsuji Sampei

pp. 320-326

DOI:

10.5687/iscie.15.320

Abstract

The Jordan canonical form of a matrix plays an important role in control system theory. But the numerically stable computation method has not been established. In this paper, we propose a numerical algorithm for the computation of Jordan canonical form of matrix. The transformation matrix consists of principal vectors obtained by the intersection of the kernel of the eigen-vector spaces. And we define the numerical Jordan canonical form of matrix and propose a more stable numerical method. The numerical example shows that the proposed method is more reliable than the well-known commercially available software.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Method for Numerical Computation of Jordan Canonical Form of Matrix

twitter
facebook
mendeley

Bibtex

Ris

A Simulation Study on a Decision Measure for Revision Timing in Reactive Scheduling

Haruhiko SUWA, Hiroaki SANDOH

pp. 327-335

DOI:

10.5687/iscie.15.327

Abstract

Reactive scheduling approach is considered effective in a manufacturing system, which undergoes various types of delays due to disruption such as machine breakdowns, urgent jobs and so on. This is because it aims to reduce delays of the schedule by revising it partially for some jobs. This paper deals with the problem in what situation we should conduct schedule revision in reactive scheduling in order to obtain an efficient revised schedule. In this paper, we focus on the number of delayed tasks based on the concept ofmatch-upto demonstrate the existence of a suitable number of delayed tasks by computational simulation which can be a criterion to determine the schedule revision timing. An optimal policy to determine the timing of schedule revision is also suggested.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Simulation Study on a Decision Measure for Revision Timing in Reactive Scheduling

twitter
facebook
mendeley

Bibtex

Ris

Global Output Regulation of Nonminimum Phase Nonlinear Systems via State Feedback

Norio ONISHI, Yuh YAMASHITA, Hirokazu NISHITANI

pp. 336-343

DOI:

10.5687/iscie.15.336

Abstract

In this paper, we solve the problem of global output regulation for a single-input single-output nonlinear system driven by a globally stable exosystem. The proposed approach does not require the system to have a relative degree. Some invariant manifolds that specify the behavior of the system are introduced to transform the system repeatedly. In order to guarantee the global stability of the system on these manifolds, a backstepping-like design method is adopted. The global output regulation of the system is shown to be performed by a state feedback law under linear growth conditions and several assumptions. We demonstrate the effectiveness of proposed method through a numerical simulation.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Global Output Regulation of Nonminimum Phase Nonlinear Systems via State Feedback

twitter
facebook
mendeley

Bibtex

Ris

A Linear Matrix Inequality Approach to Robust Stability Conditions for Linear Time-Delay Systems

Kazunori YASUDA, Naofumi NISHIHIRA

pp. 344-349

DOI:

10.5687/iscie.15.344

Abstract

The robust stability problem for a class of uncertain linear systems with time-varying delays in the state is discussed. The uncertainty is assumed to be norm-bounded and appears in all matrices of the state-space model. A robust stability condition being dependent on the length of the delay is derived in the form of linear matrix inequalities (LMIs), which is less conservative than several previous delay independent or delay dependent conditions.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Linear Matrix Inequality Approach to Robust Stability Conditions for Linear Time-Delay Systems

twitter
facebook
mendeley

Bibtex

Ris

Hebbian Learning of a Behavior Network and its Application to a Collision Avoidance by an Autonomous Agent

Keisuke KONDO, Ikuko NISHIKAWA

pp. 350-358

DOI:

10.5687/iscie.15.350

Abstract

A behavior network and its learning rule are proposed as an autonomous motion acquisition method for an agent in an unknown environment. The proposed method is applied to a learning of the collision avoidance by a simulation model of Khepera. The motion is decomposed into 8 behavior elements, and the proposed behavior network is a simple one-layered network, which maps a vector in an input sensor space to one output unit corresponding to each behavior element. The weights are obtained by Hebbian type learning according to a given reward, which evaluates the behavior chosen by the network. The structure of the network, which is decomposable into the behavior elements, enables a straightforward expansion of the network by the addition of output units. A simulation shows the successful learning of the agent, and more various behavior patterns are obtained by the expansion of the network. The proposed method is easily applied to other motion acquisition tasks owing to the simplicity of the network structure and the learning rule, and an example is demonstrated by a learning simulation of the reaching task by the same model.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Hebbian Learning of a Behavior Network and its Application to a Collision Avoidance by an Autonomous Agent

twitter
facebook
mendeley

Bibtex

Ris

Parameter Identification for a Class of Stochastic Systems with Unknown Parameters via Modified Gauss-Newton Method

Tomoji TAKATSU, Akira OHSUMI, Atsushi NAKAGAWA

pp. 359-367

DOI:

10.5687/iscie.15.359

Abstract

In this paper, an identification problem of uncertain parameters which are involved in the mathematical model is investigated for a class of stochastic uncertain systems. First, it is shown that the parameter identification can be achieved by solving the state estimation and the least-squares problem simultaneously. Secondly, a modified Gauss-Newton method is proposed, showing that it has contraction property. Finally, a numerical example is shown to demonstrate the efficiancy of the identification method proposed here for a process modeled by a first-order system with time-delay.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Parameter Identification for a Class of Stochastic Systems with Unknown Parameters via Modified Gauss-Newton Method

twitter
facebook
mendeley

Bibtex

Ris

H∞ Control for Preview and Delayed Strategies

Akira KOJIMA, Shintaro ISHIJIMA

pp. 368-377

DOI:

10.5687/iscie.15.368

Abstract

Achievable performance of preview and delayed control is investigated in terms of H∞ criterion. We defined a generalized class of H∞ problem, in which both control and disturbance involve multiple delays, and provide a check method of solvability based on a solution to matrix Riccati equation. The posed problem covers robust H∞ preview control problem, the H∞ control for multiple input delay systems, and further it enables to derive formulas of LQ control for multiple input delay systems.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

H∞ Control for Preview and Delayed Strategies

twitter
facebook
mendeley

Bibtex

Ris

A Consideration on the Psychological Impression and the Listening Score in the Case of Listening to Audio Signal under the Existing of Meaningless Steady Noise

Takahiro TAMESUE, Shizuma YAMAGUCHI, Tetsuro SAEKI, Yuichi KATO

pp. 384-386

DOI:

10.5687/iscie.15.384
mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Consideration on the Psychological Impression and the Listening Score in the Case of Listening to Audio Signal under the Existing of Meaningless Steady Noise

twitter
facebook
mendeley

Bibtex

Ris

Article Access Ranking

03 Dec. (Last 30 Days)

You can use this feature after you logged into the site.
Please click the button below.

Advanced Search

Article Title

Author

Abstract

Journal Title

Year

Please enter the publication date
with Christian era
(4 digits).

Please enter your search criteria.