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

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

21 Dec. (Last 30 Days)

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

Robust Scheduling in a Multi-Robot Welding System

Yoshihiro KANJO, Hajime ASE

pp. 369-376

DOI:

10.5687/iscie.16.369

Abstract

Multi-robot systems have been introduced actively in heavy industries in order to increase the productivity. However, since robots are disposed as densely as possible in a working stage in the multi-robot system, collisions between adjacent robots could occur. Because the collision prevents effective production, collision occurrence should be avoided. On the other hand, robustness of a schedule in a sense that small time lags between the schedule and the actual operation do not affect occurrence of collisions is also important. This paper deals with the scheduling system based on the genetic algorithm (GA) which attains these two objectives. Its effectiveness is shown by numerical simulations with practical workpieces.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Robust Scheduling in a Multi-Robot Welding System

twitter
facebook
mendeley

Bibtex

Ris

A Study on Modelling Formalism of Manufacturing System Simulation with Automated Updating Mechanism

He BAI, Susumu FUJII, Toshiya KAIHARA

pp. 377-387

DOI:

10.5687/iscie.16.377

Abstract

In real manufacturing system, changes take place in the shop floor frequently. When a manufacturing simulation system is developed and used for the daily operational planning and evaluation, the simulation model must be in a good correspondence with the real manufacturing system. Therefore, how to reflect various changes in the manufacturing system to the simulation model and thus keep the model updated become important issues to be answered. In this study, towards automated updating, simulation-modelling formalism for manufacturing system is proposed. This formalism makes use of change suppression technique as well as late binding and polymorphism in object-oriented technology to make the simulation model uniform, consistent and keep unchanging even for various changes so as to achieve the automated updating. A generic framework capable to deal with the automated updating for manufacturing system simulation is constructed. The proposed modelling formalism is proved to be effective through experimental simulation system construction.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Study on Modelling Formalism of Manufacturing System Simulation with Automated Updating Mechanism

twitter
facebook
mendeley

Bibtex

Ris

Models for Characterizing and Measuring Supply Chain Efficiency and Achieving Best Practice

Hiroshi MORITA, Joe ZHU

pp. 388-396

DOI:

10.5687/iscie.16.388

Abstract

An appropriate performance measurement system is the key to effective supply chain management. Two hurdles are present in measuring the performance of supply chain as a whole. One is the existence of multiple measures that characterize the performance of individual supply chain members. The other is the existence of conflicts between supply chain members with respect to specific measures. As a result, the efficiency of a supply chain cannot be characterized directly by the performance of supply chain members. The current study develops an approach for characterizing and measuring supply chain efficiency and achieving best practice. Models are provided to define the supply chain efficiency and to measure the performance of a supply chain as well as supply chain members. It is shown that a supply chain as a whole has potential to achieve more cost savings and a better performance through coordination and information sharing based upon our linear programming problems.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Models for Characterizing and Measuring Supply Chain Efficiency and Achieving Best Practice

twitter
facebook
mendeley

Bibtex

Ris

Swing-up Control of a Translational Inverted Pendulum Having Restricted Travel

Kazunobu YOSHIDA, Itaru MATSUMOTO

pp. 397-405

DOI:

10.5687/iscie.16.397

Abstract

Swing-up and stabilizing control of an inverted pendulum is one of the most common experiments used for illustrating nonlinear control techniques. Since an actual inverted pendulum has limited pivotal travel, the controllers have to be designed to satisfy this constraint. However, it is difficult to design controllers for underactuated systems with state constraints, like inverted pendulums. Consequently, there have been very few studies into this problem. In this paper, we propose a control law which can swing up and balance a translational inverted pendulum through limited pivot travel. Bearing in mind that the energy of the pendulum can be controlled according to the sign condition of pivot acceleration, we develop a method for swinging up the pendulum which involves controlling acceleration of the pivot as well as limiting its travel. The proposed balancing control law is a linear one designed by applying block control methods to the linearized model about an unstable equilibrium point, which can stabilize the whole system as keeping the amplitude of the pivot small. The results of our simulations and experiments demonstrate the effectiveness of the proposed control law.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Swing-up Control of a Translational Inverted Pendulum Having Restricted Travel

twitter
facebook
mendeley

Bibtex

Ris

Conference Timetabling by Grouping Genetic Algorithm

Masahiro TANAKA, Yasuyuki MORI

pp. 406-414

DOI:

10.5687/iscie.16.406

Abstract

Genetic algorithm (GA) has been widely used in combinatorial optimization problems, but direct application of GA to grouping problems often turns to fail. This difficulty arises from the large amount of constraints that are intrinsic to the problems of this category. Following this observation, this paper adopts an alternative encoding based on the “grouping genetic algorithm” (GGA) proposed by Falkenauer. The whole algorithm consists of two stages : session construction and session allocation. Keywords and category keywords are used for grouping. The experiments using real data will validate the usefulness of the proposed method.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Conference Timetabling by Grouping Genetic Algorithm

twitter
facebook
mendeley

Bibtex

Ris

Robust PID Rate-Based Control for Propagation Delay Variation

Seiji KUBO, Toshimitsu USHIO, Shigeru YAMAMOTO

pp. 415-420

DOI:

10.5687/iscie.16.415

Abstract

This paper proposes a rate-based control method for congestion control. Our proposed method is based on a PID controller predicting a queue length in a network switch. To stabilize the queue length for time-varying the propagation delays, we design a robust PID controller.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Robust PID Rate-Based Control for Propagation Delay Variation

twitter
facebook
mendeley

Bibtex

Ris

Maximum Margin Multilayer Neural Networks

Takahiro NISHIKAWA, Shigeo ABE

pp. 421-428

DOI:

10.5687/iscie.16.421

Abstract

In this paper, we propose the training method for three layer neural network classifiers in which we calculate the weights by maximizing margins in each layer. According to the CARVE algorithm, we need to find a hidden layer hyperplane that separates a set of data of one class from the remaining training data. Then, the separated set of data is removed from the training data. We repeat this procedure until the remaining data belong to one class. In the proposed method we use a heuristic algorithm to train the support vector machine so that the data on one side of the hidden layer hyperplane belong to one class. For the output layer, we use a quadratic optimization technique. The performance of this new algorithm is evaluated using some benchmark data sets.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Maximum Margin Multilayer Neural Networks

twitter
facebook
mendeley

Bibtex

Ris

Stabilization of Networked Control Systems with a Periodic Communication Constraint by a Periodic Output Feedback Gain

Kousuke SHINMYO, Shigeru YAMAMOTO, Toshimitsu USHIO

pp. 429-431

DOI:

10.5687/iscie.16.429
mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Stabilization of Networked Control Systems with a Periodic Communication Constraint by a Periodic Output Feedback Gain

twitter
facebook
mendeley

Bibtex

Ris

Article Access Ranking

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