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. 14 (2001), No. 5

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. 14 (2001), No. 5

Design of a Running Robot Based on Motion Analysis of Animals

Takayuki IKEDA, Yasushi IWATANI, Koichi SUSE, Tsutomu MITA

pp. 233-243

DOI:

10.5687/iscie.14.233

Abstract

In order to create a running and jumping quadruped robot composed of all articular joints, we have developed a mono-leg robot which simulates the landing and lift-off motions of kangaroos. From the photograph data of the gait motion of kangaroo, time responses of four fundamental quantities are approximated by solutions of first or second order differential equations. Then we propose a control strategy of the robot which realizes these differential equations as controlled constraints. Experimental results show that a running mono-leg robot is produced which has a smooth jumping gaits.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Design of a Running Robot Based on Motion Analysis of Animals

twitter
facebook
mendeley

Bibtex

Ris

Machine-Oriented Decomposition of Flowshop Scheduling Problems Using Lagrangian Relaxation

Tatsushi NISHI, Shinji HASEBE, Iori HASHIMOTO

pp. 244-251

DOI:

10.5687/iscie.14.244

Abstract

In this paper, the Lagrangian decomposition and coordination technique is applied to flowshop scheduling problems in which the sum of the changeover cost and the tardiness penalty is minimized. The proposed method possesses a feature that the scheduling problem is decomposed not into single job-level subproblems but into single machine-level subproblems. By decomposing the problem into one-machine multi-operation subproblems, the changeover cost and/or changeover time can easily be embedded in the objective function. In the proposed method, each subproblem for a single machine is solved by combining the simulated annealing method and the neighborhood search algorithm. In order to avoid oscillations in multiplier values, a new Lagrangian function is used to solve each subproblem. The effectiveness of the proposed method is verified by comparing the results of the example problems solved by the proposed method with those solved by the simulated annealing method in which a schedule of the entire machine is successively improved.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Machine-Oriented Decomposition of Flowshop Scheduling Problems Using Lagrangian Relaxation

twitter
facebook
mendeley

Bibtex

Ris

Extraction of Local Independent Components by Using Fuzzy c-Varieties

Katsuhiro HONDA, Masayuki OHUE, Katsushi KITAGUCHI, Hidetomo ICHIHASHI

pp. 252-258

DOI:

10.5687/iscie.14.252

Abstract

Even though Independent Component Analysis (ICA) has become an important technique for Blind Source Separation (BSS), it can provide only a crude approximation for general nonlinear data distributions. Karhunen et al. proposed Local ICA, in which K-means clustering method was used before the application of linear ICA. The clustering part was responsible for an overall coarse nonlinear representation of the underlying data, while linear independent components of each cluster were used for describing local features of the data. In this paper, we propose a method for extracting local independent components by using Fuzzy c-Varieties (FCV) clustering, which seems to be more natural than K-means or the like. Because FCV can be regarded as a simultaneous approach to clustering and Principal Component Analysis (PCA), the FCV takes part of the preprocessing of Fast ICA by Hyvärinen et al..

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Extraction of Local Independent Components by Using Fuzzy c-Varieties

twitter
facebook
mendeley

Bibtex

Ris

Partially Adaptive Control of an Inverted Pendulum and Cart System

Takanori FUKAO, Norihiko ADACHI

pp. 259-264

DOI:

10.5687/iscie.14.259

Abstract

It is difficult to apply the existing adaptive control methods to an inverted pendulum and cart system if it is assumed that all physical parameters are unknown, because the number of control inputs is less than that of outputs. Regarding the inverted pendulum system, the parameter uncertainties of the cart are larger than those of the pendulum. In this paper, the partially adaptive control system is designed considering that the parameter uncertainties exist only in the cart. The inverted pendulum and cart system is divided into the known part which includes only the parameters of the pendulum and the unknown part which includes the parameters of the cart. Therefore, LQ control is applied to the known part and adaptive control treats the unknown part based on the backgtepping technique. Finally, the experimental results are provided and the usefulness of this technique is confirmed.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Partially Adaptive Control of an Inverted Pendulum and Cart System

twitter
facebook
mendeley

Bibtex

Ris

Fast Forward Feature Selection by Analyzing Class Regions Approximated by Ellipsoids

Kota KAWARATANI, Shigeo ABE

pp. 265-272

DOI:

10.5687/iscie.14.265

Abstract

In our previous work, we have developed the backward selection method based on class regions approximated by ellipsoids. In this paper, we accelerate feature selection by the forward selection search, the symmetric Cholesky factorization, and deletion of duplicated calculations between consecutive factorizations. The feature selection for four data sets shows that our method is faster than and as robust as the previous method.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Fast Forward Feature Selection by Analyzing Class Regions Approximated by Ellipsoids

twitter
facebook
mendeley

Bibtex

Ris

Rules Reduction of Fuzzy Reasoning Model of Multiple Division Layers by Minkowski Norm and Its Application to Modeling of Ceramic Kiln

Jun-an ZOU, Katsuari KAMEI, Kazuo INOUE

pp. 273-279

DOI:

10.5687/iscie.14.273

Abstract

The simplified fuzzy reasoning model having multi-layer structure has a feature that generation of fuzzy rules is easy even under actual conditions. However, it is reported that redundant fuzzy rules are generated as division layers are iteratively increased. In this paper, we propose a fuzzy reasoning model of multiple division layers, which has a weight in the reasoning output. We reduce redundant fuzzy rules by tuning up the weight using an evaluation function based on Minkowski norm. Moreover, the validity of the proposed method is verified by identification experiments of two nonlinear functions having sparse domains in teaching data. Finally, we apply the proposed method to a modeling of ceramic kiln, and confirm that it is also effective for actual problems.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Rules Reduction of Fuzzy Reasoning Model of Multiple Division Layers by Minkowski Norm and Its Application to Modeling of Ceramic Kiln

twitter
facebook
mendeley

Bibtex

Ris

Investigation of Vibration Characteristics of Excitation Equipment

Kouji OBAYASHI, Yoshitomo OKADA, Kazuaki KITAMURA

pp. 280-282

DOI:

10.5687/iscie.14.280
mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Investigation of Vibration Characteristics of Excitation Equipment

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.