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

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.9
    2. No.8
    3. No.7
    4. No.6
    5. No.5
    6. No.4
    7. No.3
    8. No.2
    9. 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

22 Dec. (Last 30 Days)

Transactions of the Institute of Systems, Control and Information Engineers Vol. 12 (1999), No. 2

A Design Method for Parameters of Synergetic Computers Executing the Associative Function and the Searching Function

Koji OKUHARA, Shunji OSAKI

pp. 73-81

DOI:

10.5687/iscie.12.73

Abstract

Synergetic computers are applied for association of images consisting of many elements. Its dynamics and functions are given by a potential. The form of potential is determined by its parameters. This paper discusses the associative function and the searching function of synergetic computers. In the associative function, all embedded patterns are dealt with the likes of the same. In the searching function, on the other hand, we can consider the hierarchy and the belonging of each embedded pattern. We clarify the design of parameters in order to execute the associative function and the searching function by using synergetic computers.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Design Method for Parameters of Synergetic Computers Executing the Associative Function and the Searching Function

twitter
facebook
mendeley

Bibtex

Ris

Identification by Chebyshev Interpolation and its Error Bound for a Discrete-Type Nonlinear System with Measurement Noise

Tadatoshi SHINGU, Hitoshi TAKATA

pp. 82-89

DOI:

10.5687/iscie.12.82

Abstract

In this paper, we propose an identification method of discrete-type nonlinear systems with additive measurement noises using Chebyshev polynomials. A nonlinear function is assumed to be approximately described by a linear combination of some Chebyshev polynomials. Each coefficient of the polynomials is easily evaluated by the least squares method. An error bound of the identification is also estimated here. Moreover, the optimal order of the Chebyshev polynomials is determined by using the Akaike's information criterion. The paper includes simulation experiments to demonstrate the effectiveness of the proposed method.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Identification by Chebyshev Interpolation and its Error Bound for a Discrete-Type Nonlinear System with Measurement Noise

twitter
facebook
mendeley

Bibtex

Ris

Solving Multiobjective Time Tabling Problem by Using Requests

Masahiro TANAKA, Mari YAMADA

pp. 90-97

DOI:

10.5687/iscie.12.90

Abstract

In this paper, the time tabling problem of schools is discussed where the teachers' preference of time slots for each lecture is considered. The teachers' preference and the students' wishes are aggregated into two objectives, and the problem is treated as the two objectives of the multicriteria optimization problem. The problem is solved by using the framework of multiobjective genetic algorithm. The primary difficulty of this problem is how to satisfy the constraints. Here this problem is solved by using the local search for each individual that does not satisfy the constraints, and the revised ones are used in the next generation.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Solving Multiobjective Time Tabling Problem by Using Requests

twitter
facebook
mendeley

Bibtex

Ris

On Human Related Characteristic between Visual Search and Speach Perception

Jing-Long WU, Hiroaki MIZUHARA, Ybshikazu NISHIKAWA

pp. 98-105

DOI:

10.5687/iscie.12.98

Abstract

Recently, the cause of many car accidents is to use car-phone while driving. We hypothesize that one of the causes of such traffic accidents is that the human visual information processing is affected by the auditory information. In order to evidence the hypothesis, human characteristics between visual search and speech perception have been measured by psychological experiments. On the measurement results, in the case of the auditory information is presented concurrently, the visual reaction time is longer than that in the case of the visual information is presented only. The results of fundamental experiments with human visual and auditory characteristic suggest one of the cause of traffic accidents in using car-phone is that the human visual information processing is affected by the auditory information.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

On Human Related Characteristic between Visual Search and Speach Perception

twitter
facebook
mendeley

Bibtex

Ris

Two Degree-of-Freedom of Generalized Predictive Control Based on State Space Approach

Akira YANOU, Shiro MASUDA, Akira INOUE, Yoichi HIRASHIMA

pp. 106-114

DOI:

10.5687/iscie.12.106

Abstract

Generalized Predictive Control (GPC) achieves the robust tracking for the step-type target signal by including an integrator in advance. But if there exists neither modeling error nor disturbance, the integral compensation may cause the degeneration of transient responce or an excessive control effort. That is, it is to be desired that the integral compensation shows itself only if there exists modeling error or disturbance. So we propose a design scheme of two degree-of-freedom GPC system. The proposed method reveals the effect of the integral compensation only if there exists modeling error or disturbance. Therefore, performance degradation due to an integral compensation, such as a slow response or an excessive control effort, can be avoided when the control system has no perturbation.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Two Degree-of-Freedom of Generalized Predictive Control Based on State Space Approach

twitter
facebook
mendeley

Bibtex

Ris

Application of Genetic Algorithm with Preprocessing to Cable Installation Design in Large-Scale Plant

Koji ASAKUMA, Masaaki MIYAMOTO, Kazuhisa KITAKAZE, Yasuo KINOUCHI

pp. 115-126

DOI:

10.5687/iscie.12.115

Abstract

This paper describes the application of genetic algorithm (GA) to a cable installation design in a large-scale plant. This application assumes that the design of plant equipment and cable trays has been completed. Here, to deal with the exceedingly large number of cable-route combinations in a large-scale plant, we propose a new preprocessing method using the Dijcstra method for constructing genes that significantly reduces the number of combinations and improves the search for the shortest route. Moreover, based on correlation analysis between evaluated values, we pay particular attention to cable grouping that skilled designers have come to emphasize in their design work, and propose a new method for installing cables that uses cable grouping as a genetic operator. This method achieves a level of optimization exceeding that of manual design and substantially reduces computational time. Comparing with actual design data from skilled designers, it was found that the above methods can produce an even more satisfactory solution in a practical period of time (within two hours) on a workstation.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Application of Genetic Algorithm with Preprocessing to Cable Installation Design in Large-Scale Plant

twitter
facebook
mendeley

Bibtex

Ris

Interactive Determination of Irradiate Condition for External Beam Radiotherapy Treatment by Satisficing Trade-off Method

Etsuko KUMAMOTO, Susumu FUJII, Noriyuki KUROKAWA, Yasuo TSUKAMOTO, Michimasa MATSUO

pp. 127-135

DOI:

10.5687/iscie.12.127

Abstract

In the external beam radiotherapy, it is required to optimize the number of beams, the beam angles, and the strength of irradiation, which deliver the lethal dose to the tumor while limiting the dose absorbed in the normal tissue with fewer beams. In this study, we formulate this problem as a multiobjective linear programming, and propose a planning method to balance the dose distribution and the number of beams by using satisficing trade-off method. An aspiration level to each concerning point specifies the planner's direction for each objective. Therefore, we applied cluster analysis to classify the objective functions, enabling the planner to set up aspiration levels for clusters rather than each objective, which significantly ease the planning task. An illustrated plan of a treatment for cerebral tumor is given to demonstrate the effectiveness of the proposed method.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Interactive Determination of Irradiate Condition for External Beam Radiotherapy Treatment by Satisficing Trade-off Method

twitter
facebook
mendeley

Bibtex

Ris

Article Access Ranking

22 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.