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. 16 (2003), 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.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

29 Apr. (Last 30 Days)

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

Performance Evaluation of Genetic Algorithms Based on Markovian Analysis

Hiroyuki OKAMURA, Kazunori KITASUKA, Tadashi DOHI

pp. 303-312

DOI:

10.5687/iscie.16.303

Abstract

Genetic algorithm (GA) is a probabilistic algorithm for solving optimization problems, which is modeled on a genetic evolution process in biology, and is focused as an effective algorithm to find the global optimal solutions for many types of problems. Most research results on GAs are related to the design for some specific GAs and the simulation-based study for their applicability. It has not been established yet how to evaluate the performance of specific GAs in a general framework. In this paper, we give two theoretical results on the performance evaluation of GAs by using the Markovian analysis. First, we discuss convergence properties of GAs, and derive an associated performance measure, called the relaxation time for the Markov chain. Secondly, we develop an alternative Markovian analysis with rewards for real-coded GAs having real-vector individuals.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Performance Evaluation of Genetic Algorithms Based on Markovian Analysis

twitter
facebook
mendeley

Bibtex

Ris

An Evaluation of the Need for Software Process Improvement by Analytic Hierarchy Process

Satoru TAKAHASHI, Kiyotoshi KOMAYA, Hiroyuki TAMURA

pp. 313-320

DOI:

10.5687/iscie.16.313

Abstract

Software engineering organizations now tend to improve their processes according to such standards as CMM (Capability Maturity Model), a process evaluation model, in addition to improving their software products. This is because it is believed that mature engineering processes can bring high-quality products within the original schedule. It is reported, however, that the result of the improvement activities is strongly related with engineer satisfaction for the process, that is, effective improvement can be expected on the phases where engineers have not been satisfied with. This paper proposes a method to evaluate how much engineers feel the current engineering process needs to be improved, with Descriptive AHP (Descriptive Analytic Hierarchy Process), one of decision making tools. Our method, based on the idea that the necessity evaluation can be related with engineers satisfaction, evaluates four engineering phases under six criteria defined at CMM Level 2, determining which phases should be improved first. As a result of having system engineers use this method, we found that quality assurance activities in the manufacturing and examination phases need to be superior for improvement to other phases.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

An Evaluation of the Need for Software Process Improvement by Analytic Hierarchy Process

twitter
facebook
mendeley

Bibtex

Ris

Cellular Neural Networks for Associative Memory with Multiple Memory Tables

Michihiro NAMBA, Zhong ZHANG, Hiroaki KAWABATA

pp. 321-329

DOI:

10.5687/iscie.16.321

Abstract

It is reported that the CNNs (Cellular Neural Networks) have a high ability of associative memory. However, the number of memory patterns and their similarity influence the recall capability of conventional CNNs. Hence, it is considered that the appropriate number of memory patterns which gives the maximum of the recall capability exists. In this paper, we investigate the influence of memory patterns on the recall capability in CNNs, and estimate the range of the appropriate number of memory patterns.
Furthermore, we propose the CNN for associative memory with Multiple Memory Tables (MTT-CNN) in order to apply to practical fields. Thereupon, in order to verify the usefulness of the MMT-CNN, we performed the experiments by using 6×6, 12×12, 15×15 MMT-CNN, and examined the incomplete recall rate in each experiment. As a result, the incomplete recall rate of the MTT-CNN was far below that of the conventional CNN, and we could confirm an improvement of self-recall function. Moreover, we could avoid the incomplete recall completely by choosing more appropriate divisions.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Cellular Neural Networks for Associative Memory with Multiple Memory Tables

twitter
facebook
mendeley

Bibtex

Ris

Recognition of Operation with Hydraulic Excavators by Fuzzy Reasoning

Hirokazu ARAYA, Masayuki KAGOSHIMA, Hideki KINUGAWA, Tatsuo ARAI

pp. 330-338

DOI:

10.5687/iscie.16.330

Abstract

This paper describes the recognition method of operation with hydraulic excavators. Features of operation are extracted from the lever operating data to recognize the operation. Using fuzzy reasoning depending on these features, high accuracy recognition became possible for various operators. We have also developed tuning method for membership functions in fuzzy reasoning. Even if the type of hydraulic excavators is changed, high accuracy recognition is maintained by this method. These methods were experimentally shown to be useful and have been put to practical use.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Recognition of Operation with Hydraulic Excavators by Fuzzy Reasoning

twitter
facebook
mendeley

Bibtex

Ris

A Proposition for Simultaneous Determination of Ordering and Scheduling in a Manufacturing Process

Hitoshi IIMA, Nobuo SANNOMIYA

pp. 339-346

DOI:

10.5687/iscie.16.339

Abstract

This paper deals with simultaneous determination of ordering and scheduling in a manufacturing process. The objectives of this problem are to minimize both the out-of-stock ratio and the total inventory. We propose an iterative algorithm which solves successively the respective problems for the inventory control system and the manufacturing system. Moreover, a new ordering policy is proposed in the inventory control system. In this policy, the ordering amount is determined in such a way that the minimum of margin stock ratio in all items is maximized. In the manufacturing system, the schedule is determined for that order. It is confirmed from the computational result that the proposed method outperforms the method without iteration and a periodic inventory based method.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Proposition for Simultaneous Determination of Ordering and Scheduling in a Manufacturing Process

twitter
facebook
mendeley

Bibtex

Ris

Model Predictive Control for Max-plus Linear Systems with Adjustable Parameters

Hiroyuki GOTO, Shiro MASUDA, Takashi AMEMIYA, Kazuhiro TAKEYASU

pp. 347-355

DOI:

10.5687/iscie.16.347

Abstract

This paper proposes model predictive control (MPC) design method for the max-plus linear systems with adjustable parameters. The several studies have been done so far under the constraints that system parameters are constant. However, it is common and inevitable that system parameters are changed in practical systems, so, it is worthwhile to design a new MPC controller with variable parameters. In this paper, we handle a max-plus linear system with system parameters dependent upon event counters and the optimization method we proposed recenlty for an optimal inverse system of max-plus linear system with linear-parameter-varying structure is applied to MPC. Since MPC uses greater prediction step than that of the inverse systems, the controller can be made more robust and the operation cost can be reduced. Finally, the proposed method is applied to a production system with three machines, and the effectiveness of this method is verified through numerical simulations.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Model Predictive Control for Max-plus Linear Systems with Adjustable Parameters

twitter
facebook
mendeley

Bibtex

Ris

A Parallel Primal-Dual Interior Point Method for Multi-Period and Multi-Facility Production Planning Problems

Eiki YAMAKAWA, Genichi EMOTO

pp. 356-365

DOI:

10.5687/iscie.16.356

Abstract

A parallel implementation of a primal-dual interior point method is presented for multi-period and multi-facility production planning problems with nonlinear constraints. Exploiting the nested primal block-angular structure of the problem, the system of linear equations for calculating the search direction is decomposed into independent systems of linear equations and another system of linear equations which can be solved efficiently owing to the staircase structure of the coupling constraints. Computational experiments on the parallel computer VPP800 shows that the proposed method is very efficient for large-scale multi-period and multi-facility production planning problems.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Parallel Primal-Dual Interior Point Method for Multi-Period and Multi-Facility Production Planning Problems

twitter
facebook
mendeley

Bibtex

Ris

A Design of Generalized Predictive Control Law with Two Degree-of Freedom for Ramp Disturbances

Shin-ichi YOSHINAGA, Akira INOUE, Akira YANOU, Deng MINGCONG, Yoichi HIRASHIMA

pp. 366-368

DOI:

10.5687/iscie.16.366
mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Design of Generalized Predictive Control Law with Two Degree-of Freedom for Ramp Disturbances

twitter
facebook
mendeley

Bibtex

Ris

Article Access Ranking

29 Apr. (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.