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. 17 (2004), No. 10

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. 17 (2004), No. 10

Simultaneous Determination of OP and OQ for Various Demand Models

Yasuhiko MURASE, Shiro MASUDA, Shuichi FUKUDA

pp. 411-418

DOI:

10.5687/iscie.17.411

Abstract

We have proposed the safety stock model for various demand conditions in the previous papers. The papers gave some solutions for various demand distribution models which change serially and quickly, and proposed the safety stock model whose control is enabled at the fill rate of setting demand sufficiency. This paper is based on the practice of application deployment on the previous study, and we propose the new model which makes the minimum total cost by determining Ordering Point and Order Quantity simultaneously.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Simultaneous Determination of OP and OQ for Various Demand Models

twitter
facebook
mendeley

Bibtex

Ris

A Sequencing Method for Mixed-Model Assembly Line with the Aid of Relief Man

Jae-Kyu YOO, Megumi ISHIDA, Yoshiaki SHIMIZU

pp. 419-425

DOI:

10.5687/iscie.17.419

Abstract

This paper concerns with a sequencing problem to raise the efficiency of line handling in a mixed-model assembly line where products are assembled in the same cycle time. The goal of the sequencing is to attain two objectives simultaneously, i.e., smoothing of work-load and smoothing of part usage. On real mixed-assembly lines, there exist large variations in the assembly times among different product-models. This causes inefficiency such as line stop or increase in idle time. In this paper, we propose a sequencing method to achieve the above two objectives with the help of Relief Man in such situation. For this purpose, the sequencing problem of minimizing both line stop times and idle times is formulated. Since this problem refers to combinational optimization problems, we develop a hierarchical method that applies meta-heuristics like SA (Simulated Annealing) together with NNM (Nearest Neighbor Method). Finally, we examine effectivness of the proposed method through computer simulations.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Sequencing Method for Mixed-Model Assembly Line with the Aid of Relief Man

twitter
facebook
mendeley

Bibtex

Ris

Mill Balance Control Technique for a Tandem Cold Mill using ILQ Design Method

Akira MURAKAMI, Hirokazu ARAYA, Makishi NAKAYAMA, Mitsuo OKAMOTO, Kenichi SANO

pp. 426-434

DOI:

10.5687/iscie.17.426

Abstract

We have developed a mill balance control system, which regulates the motor currents and rolling forces of tandem-cold-mill stands while maintaining finish gage accuracy.
The controller is designed using the ILQ design method and constructs a cascade loop outside an automatic-gage-control loop.
The experimental results showed that maximum rolling speeds have increased by 2.4% on average without deterioration of gage accuracy or strip shape.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Mill Balance Control Technique for a Tandem Cold Mill using ILQ Design Method

twitter
facebook
mendeley

Bibtex

Ris

Stereo Vision from Color Images Based on Competitive and Cooperative Neural Networks

Xijun HUA, Masahiro YOKOMICHI, Michio KONO

pp. 435-443

DOI:

10.5687/iscie.17.435

Abstract

Stereo vision is a passive method of obtaining depth information of visible surface by measuring disparity of corresponding points in left and right stereo images. Stereo matching, which belongs to ill-posed problems, is the key issue of stereo vision. In the literature, almost all matching techniques only use gray-scale images. The color information is usually neglected, but undoubtedly it may be of great use in helping robot stereo systems perform better. In this paper, we use two layered self-organization neural network model to simulate the competitive and cooperative interaction of binocular neurons. We propose a special similarity function as initial input to make full use of the color information. In RGB color space, the similarity map is established by taking logical AND calculation of red, green and blue color value similarity. In stereo matching experiment, we first consider color random-dot stereogram for stereo correspondence. Then we take real image experiments by means of different color stereo matching approaches. Experiments results have shown that the quality and convergence speed of the stereo matching can be efficiently improved by using appropriate color matching algorithm comparing with the conventional grey value algorithm.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Stereo Vision from Color Images Based on Competitive and Cooperative Neural Networks

twitter
facebook
mendeley

Bibtex

Ris

Validation on Pareto Optimality of Walrasian Virtual Market

Toshiya KAIHARA, Susumu FUJII, Noriyasu YOSHIMURA

pp. 444-450

DOI:

10.5687/iscie.17.444

Abstract

Walrasian market is one of the most common economic models for virtual market. In neoclassical economics, it is well-known that the allocation in an equilibrium state of Walrasian market is Pareto optimal. In this paper, we develop several Walrasian virtual markets based on multi-agent paradigm, and validate their Pareto optimality of the allocation by comparing our method with analytic approaches, such as the E-constraint method and the fixed point algorithm. We also discuss the efficiency of our method in terms of caliculation time.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Validation on Pareto Optimality of Walrasian Virtual Market

twitter
facebook
mendeley

Bibtex

Ris

A Relationship between the Accepting Powers of Three-Dimensional Finite Automata and Time-Bounded Bottom-Up Pyramid Cellular Acceptors with Three-Dimensional Layers

Makoto SAKAMOTO, Shigehisa NOGAMI, Katsushi INOUE, Michio KONO

pp. 451-458

DOI:

10.5687/iscie.17.451

Abstract

In this paper, we introduce a new model of acceptor on a three-dimensional pattern, called the time-bounded bottom-up pyramid cellular acceptor with three-dimensional layers whose input tapes are restricted to cubic ones (3-UPC AC), and investigate a relationship between the accepting powers of 3-UPCAc's and three-dimesional finite automata whose input tapes are restricted to cubic ones (3-FAc's). We first show that nondeterministic 3-UPCAc's are more powerful than nondeterministic 3-FAc's. We next show that O ((diameter) 2 × log diameter) time is sufficient for deterministic 3-U PC Ac's to simulate deterministic 3-FAc's, and that O ((diameter) 3) time is sufficient for deterministic 3-UPCAc's to simulate nondeterministic 3-FAc's. Finally, we show that Ω ((diameter) 2 × log diameter) time is necessary for nondeterministic 3-UPCAc's to simulate alternating 3-FAc's.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Relationship between the Accepting Powers of Three-Dimensional Finite Automata and Time-Bounded Bottom-Up Pyramid Cellular Acceptors with Three-Dimensional Layers

twitter
facebook
mendeley

Bibtex

Ris

Independent Component Analysis with External Criteria and Its Expansion into Local Modeling

Katsuhiro HONDA, Naoya SHIMOMURA, Hidetomo ICHIHASHI

pp. 459-467

DOI:

10.5687/iscie.17.459

Abstract

This paper proposes an enhanced technique of independent component analysis (ICA), which extracts independent components uncorrelated to some external criteria. Fast ICA algorithm is performed after the preprocessing by principal component analysis with external criteria, in which the effects of the external criteria are removed from data sets using regression analysis. The proposed method can also be expanded into local ICA by using hybrid technique of fuzzy clustering and regression analysis. Numerical experiments including knowledge discovery from POS transaction data reveal the characteristic feature of the proposed method.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Independent Component Analysis with External Criteria and Its Expansion into Local Modeling

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.