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. 10 (1997), 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. 38 (2025)

    1. No.3
    2. No.2
    3. No.1

  2. Vol. 37 (2024)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

14 Jul. (Last 30 Days)

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

Weakly Structured Representations for Flexible Queries

Kenji HANAKAWA, Hideaki TAKEDA, Toyoaki NISHIDA

pp. 341-350

DOI:

10.5687/iscie.10.341

Abstract

Most information systems always require us to represent our information in a formal and strict way. This lack of flexibility reduces the usefulness of the information systems. In this paper, we introduce two weakly structured representation techniques for easily constructing and retrieving ill-organized information. The first technique is a word-list-query which is a free ordered sequence of words used to represent user's information needs. The second is an associative graph which is a kind of semantic network consisting of concept nodes, IS-A links and unnamed horizontal links. To parse a word-list-query, we use a concept reduction method which is recursive rewriting of words according to information represented in associative graph. This integration of parsing and information retrieval disambiguates word-list-queries. We implemented an experimental system using these techniques, and show that this system is easy for unskilled users and its accuracy is reasonable.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Weakly Structured Representations for Flexible Queries

twitter
facebook
mendeley

Bibtex

Ris

A Design Method of Self-Tuning Pole-Assignment Controllers with a Parallel Feedforward Compensator

Toshitaka OKI, Toru YAMAMOTO, Masahiro KANEDA

pp. 351-360

DOI:

10.5687/iscie.10.351

Abstract

Many adaptive control schemes have been proposed for the systems whose parameters and time delays are unknown. Especially, from the simplicity of the control structure, self-tuning control (STC) schemes have been widely studied.
In this paper, a STC scheme based on the minimum variance control (MVC) method is proposed for the nonminimum phase and/or unknown time delay systems, considering an augmented system equipped with a feedforward compensator on a parallel to the system. Since the poles of the closed-loop system constructed by the proposed method can be assigned arbitrarily, the good performance can be obtained relatively easily. Moreover, it is shown that the closed-loop system can be interpreted as a system constructed by the generalized minimum variance control (GMVC) method, or as a system equipped with a local feedback compensator like a Smith predictor. Finally, a numerical example and an example applied to an experimental plant are shown to illustrate the effectiveness of the proposed method.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Design Method of Self-Tuning Pole-Assignment Controllers with a Parallel Feedforward Compensator

twitter
facebook
mendeley

Bibtex

Ris

A Method for Constructing Genetic Algorithm for a Re-scheduling Problem in an Open-shop Process

Hitoshi IIMA, Nobuo SANNOMIYA

pp. 361-368

DOI:

10.5687/iscie.10.361

Abstract

Recently a new approach is required for a scheduling system which has flexibility against change of condition. This paper deals with re-scheduling for change of the due date, addition of a product, trouble of a machine and increase of processing time, respectively, in an open-shop manufacturing process. For solving this problem, the genetic algorithm (GA) is applied. First a method for constructing GA is proposed for an open-shop problem without change of conditions. By comparing GA with the random search method and the local search method, it is confirmed that the accuracy of GA is better than those of other methods. Secondly, when we solve the re-scheduling problem for change of several conditions, the initial population is revised in such a way that a number of individuals made randomly are added to the population. The effectiveness of the revised algorithm is confirmed through numerical results as compared with the algorithm without revision of the initial population.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Method for Constructing Genetic Algorithm for a Re-scheduling Problem in an Open-shop Process

twitter
facebook
mendeley

Bibtex

Ris

Least Cores and Nucleoli in a Multi-Commodity Game

Ichiro NISHIZAKI, Masatoshi SAKAWA

pp. 369-379

DOI:

10.5687/iscie.10.369

Abstract

In a multi-commodity game, we consider e-cores, least cores and nucleoli, which are originally defined in a conventional n-person cooperative game in characteristic function form. First we review the definition of a multi-commodity game and the concept of the core, and then introduce concepts of e-cores and least cores. Employing excess functions in the multi-commodity game, the cores, the ε-cores and the least cores are redefined, and nucleoli are defined. To compute solutions, we classify excess functions into two categories and give two instances for each category, and briefly mention the difference among them. We develop computational methods for obtaining a point in each of the least cores under some assumptions and illustrate one of the methods with a numerical example. Finally we refer to methods for obtaining a point in each of the nucleoli.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Least Cores and Nucleoli in a Multi-Commodity Game

twitter
facebook
mendeley

Bibtex

Ris

Measurement of the 3D Position and Attitude of a Vehicle by Use of Corner Cubes and Laser Fan Beams

Nobuo KOMATSU, Toshihiro TSUMURA, Hiroshi OKUBO

pp. 380-390

DOI:

10.5687/iscie.10.380

Abstract

This paper proposes a method to measure the 3D position and attitude of a vehicle by use of corner cubes and laser fan beams. The method uses three sets of laser transceivers mounted on the vehicle and retro-reflecting targets (cornercubes) set along a side of the course. Each laser transceiver consists of a laser beam transmitter that emits a fan shaped laser and photo sensor for detecting the laser reflected by the retro-reflecting targets. The three laser beams are set with different angles and offset distances from each other, so that the time data of detecting the returned laser depend on the position and attitude of the vehicle. Then the on-board computer calculates the position and attitude from the time data. This paper reports the measurement principle, simulation and experimental results.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Measurement of the 3D Position and Attitude of a Vehicle by Use of Corner Cubes and Laser Fan Beams

twitter
facebook
mendeley

Bibtex

Ris

An Experimental Verification of Robustness of Model Predictive Control

Yasunori TADA, Shiro TAMAKI, Hiroshi KINJO, Tetsuhiko YAMAMOTO

pp. 391-393

DOI:

10.5687/iscie.10.391
mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

An Experimental Verification of Robustness of Model Predictive Control

twitter
facebook
mendeley

Bibtex

Ris

Article Access Ranking

14 Jul. (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.