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. 11 (1998), 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

21 Nov. (Last 30 Days)

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

An Improvement of Motion Compensation by Using Camera Position Information

Akihiko SUGIURA, Taisuke KIMURA

pp. 357-363

DOI:

10.5687/iscie.11.357

Abstract

This paper describes a new method of global motion compensation to achieve highly efficient video coding. First, we propose a method to extract the pan-tilt vector of an image sequence by using information about the motion of the camera. Second, we study the problem of distortion which is coused by the optical aberration and stands out at the joint of pictures. To solve this distortion, we propose to restore the image using a linear approximation function. The result of computer simulation indicate that the proposed methods reduce the distortion to less than 1 pixel and are effective in improving the picture quality.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

An Improvement of Motion Compensation by Using Camera Position Information

twitter
facebook
mendeley

Bibtex

Ris

Optimization of Coordinated Traffic Signal Timings in Urban Road Network

Toshihiko ODA, John LEO

pp. 364-374

DOI:

10.5687/iscie.11.364

Abstract

This paper describes a new method of optimally coordinating the traffic signal timings. The optimization is based on the information available from the vehicle detectors in urban road networks in Japan. The conventional methods are deficient in that the cycle length and the split are characterized only by the behavior of critical intersection, and offsets along a major road are chosen from a small set of prescribed patterns. In the first step of the proposed method, the cycle length and the split are obtained by minimizing the total traffic delay in a sub-area which consists of a series of intersections. In the second step, the offsets are determined by maximizing the bandwidth that is the fraction of a cycle in which vehicles may pass through all intersections in the sub-area without stopping. The results of simulation experiments indicate that the proposed method reduces the queue length significantly in comparison with the conventional methods.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Optimization of Coordinated Traffic Signal Timings in Urban Road Network

twitter
facebook
mendeley

Bibtex

Ris

Robust Stability Condition Using Phase Information and Achievement of Low Sensitivity

Kou YAMADA

pp. 375-383

DOI:

10.5687/iscie.11.375

Abstract

In this paper, we consider robust stability of single-input single-output continuous time-invariant systems with uncertainty. A robust stability (necessary and sufficient) condition for the system with a certain class of uncertainty is presented. The condition that a set of the plant and the nominal plant is contained in that class is clarified. In addition, it is shown that the robust stability (necessary and sufficient) condition does not depend on the number of poles of the plant and that of the nominal plant. In this framework, we can construct a control system with low sensitivity characeristics and robust stability.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Robust Stability Condition Using Phase Information and Achievement of Low Sensitivity

twitter
facebook
mendeley

Bibtex

Ris

Realization of Equivalent Luminous-Efficiency Function by a Neural Network Model

Jing-Long Wu, Yoshikazu NISHIKAWA

pp. 384-393

DOI:

10.5687/iscie.11.384

Abstract

In the previous studies, the luminous-efficiency function for the mesopic vision is proposed by several empirical formulas, and some discrepancies between the experimental data and the formulated results existed. In the present paper, we propose a model of the equivalent luminous-efficiency function based on the brightness perception which covers the scotopic, the mesopic and the photopic conditions. In order to realize the equivalent luminous-efficiency function, we construct a four layer neural network model. The neural network is composed of three parts : an input layer, two hidden layers and an output layer. This neural network model is trained by the back-propagation learning algorithm with use of training data obtained by psychological experiments. After completion of learning, the response functions of the two hidden units express the scotopic and the photopic coefficients functions which depend on the input light-intensity level. The analysis of the model output indicates that our neural network has acquired an excellent generalization capability. That is, the model of the equivalent luminous-efficiency function has a nice generalization capability in the scotopic, the mesopic and the photopic conditions. The analysis results of internal representation in the neural network model suggested that the scotopic coefficient function contribute to brightness at a larger range.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Realization of Equivalent Luminous-Efficiency Function by a Neural Network Model

twitter
facebook
mendeley

Bibtex

Ris

A Simulation-Based Production Scheduling Methodfor Minimizing the Number of Tardy Jobs

Masahiko FUYUKI, Masahiro ARAKAWA, Toshiaki SUGIHARA, Ichiro INOUE

pp. 394-400

DOI:

10.5687/iscie.11.394

Abstract

For minimizing the number of tardy jobs in a make-to-order production, a production scheduling method associated with Backward / Forward Hybrid Simulation (BFHS) is proposed. The significance of tardy job minimization in production management is first discussed. Then discussion centers on a production scheduling method which introduces two parameters, job grouping parameter and slack time adjustment parameter, in order to adjust job priorities in each dispatching point in the simulation process. The effectiveness is shown not only on a simple job shop model, but also on an actually working system.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Simulation-Based Production Scheduling Methodfor Minimizing the Number of Tardy Jobs

twitter
facebook
mendeley

Bibtex

Ris

An Approximate Realization of Nonlinear H∞ Control Based on Hamilton-Jacobi Equation

Masakatsu KAWATA, Naomitsu SHIMAZU, Kazuo INOUE

pp. 401-410

DOI:

10.5687/iscie.11.401

Abstract

In this paper, a novel numerical approach of the Hamilton-Jacobi Equation (HJE) in the nonlinear H∞ control problems is proposed. First of all, it is assumed that the solution of the HJE is an extended quadratic form, and a state-dependent Riccati Equation (sRE) is derived. Next, the solution of the sRE is approximated with a polynominal matrix by the least square method, and the approximated solution of the HJE is selected as the extended quadratic form approximately corresponding to this polynominal. Our proposal is applied to an inverted pendulum system, and its validity is shown through simulations as compared with the linear H∞ control and the nonlinearH∞ control based on the conventional methods.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

An Approximate Realization of Nonlinear H∞ Control Based on Hamilton-Jacobi Equation

twitter
facebook
mendeley

Bibtex

Ris

A Tardiness Analysis Support Tool in the Improvement Phase of Simulation-Based Production Scheduling

Masahiko FUYUKI, Masahiro ARAKAWA, Shintaro EGASHIRA, Ichiro INOUE

pp. 414-416

DOI:

10.5687/iscie.11.414
mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Tardiness Analysis Support Tool in the Improvement Phase of Simulation-Based Production Scheduling

twitter
facebook
mendeley

Bibtex

Ris

Article Access Ranking

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