logo
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. 3 (1990), No. 11

ISIJ International
belloff
ONLINE ISSN: 2185-811X
PRINT ISSN: 1342-5668
Publisher: THE INSTITUTE OF SYSTEMS, CONTROL AND INFORMATION ENGINEERS (ISCIE)

Backnumber

  1. Vol. 36 (2023)

    1. No.6
    2. No.5
    3. No.4
    4. No.3
    5. No.2
    6. No.1

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

23 Sep. (Last 30 Days)

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

A Methodological Trial in the Hierarchical Form of Kalman Filter and a State Estimation in the Room Acoustical Field

Mitsuo OHTA, Kazutatsu HATAKEYAMA, Akira IKUTA, Yoshie KODERA

pp. 339-348

DOI:

10.5687/iscie.3.339

Abstract

In the actual random phenomena, the objective signal usually shows a complex fluctuation pattern apart from a standard Gaussian distribution due to the diversified causes of fluctuation. Furthermore, the observation data are very often contaminated by the external noise of arbitrary distribution type. In this paper, a new state estimation algorithm for the stochastic system with a random excitation of non-Gaussian distribution type is proposed by introducing a form of expansion expression with parameter differential type for the conditional probability density function. It is noticeable that the proposed wide sense digital filter is constructed in a hierarchical form based on the direct use of the well-known Kalman's filtering algorithm. Therefore, non-Gaussian properties of the fluctuation and various nonlinear correlation information are reflected hierarchically in this estimation algorithm. Finally, the effectiveness of the theory is experimentally confirmed too by applying it to the actual data in the room acoustical field.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Methodological Trial in the Hierarchical Form of Kalman Filter and a State Estimation in the Room Acoustical Field

twitter
facebook
mendeley

Bibtex

Ris

Determining Algorithm of Three-Dimensional Convex Hull Used for Set Operations of Solids and Its Application to Interference Problems

Tatsuya MOCHIZUKI, Naohiro YUHARA

pp. 349-357

DOI:

10.5687/iscie.3.349

Abstract

This paper discusses a determining algorithm for the three-dimensional convex hull which is well-fitted to deal with interference problems of solids requiring a three-dimensional convex hull of a given shape for their solution and is available for set operations. The paper also deals with the application of this algorithm to specific interference problems. The proposed algorithm is devised to determine the smallest convex polyhedron containing a concave polyhedron given by a solid model beforehand, as a solid model having the same data structure as that of the concave polyhedron. It features the use of Euler operators, a general method for determining a solid model. This means that the proposed algorithm does not depend on the data structure of a solid model and that all convex polyhedrons obtained during the process of determining a three-dimensional convex hull are also in the form of solid model. Because of such a feature, the three-dimensional convex hull determined by the algorithm can be used for set operations with the given concave polyhedrons, and therefore, the algorithm provides a convenient approach to interference problems of solids requiring a three-dimensional convex hull of a given shape for their solution. As an example of the application of the proposed algorithm to practical purposes, this paper also discusses a study on the extraction of undercuts in mold design using this algorithm. The findings indicate that the proposed algorithm is useful in solving such practical problems.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Determining Algorithm of Three-Dimensional Convex Hull Used for Set Operations of Solids and Its Application to Interference Problems

twitter
facebook
mendeley

Bibtex

Ris

Expert System Application to Flatness Control of Aluminum Foil Rolling

Hiroshi NARAZAKI, Toshiharu IWATANI, Kazuo NOSE, Masami KONISHI, Souichi KITAGAWA

pp. 358-371

DOI:

10.5687/iscie.3.358

Abstract

We discuss the application of the expert system technology to the flatness control problem of the aluminum foil rolling process. Our expert system can adjust the target shape pattern on line for the automatic flatness control system according to the material characteristics and operating conditions. We have modelled the knowledge structure and inference mechanism in the target shape adjustment process that has been done by the experts and developed an expert system. This system has ability to solve the conflict between rules, and keeps consistency in actions. This system infers adaptively considering applied results of the past inference to accomodate the change of the characteristics of the rolling process. Further our model is useful for a class of adjustment problems in the process control.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Expert System Application to Flatness Control of Aluminum Foil Rolling

twitter
facebook
mendeley

Bibtex

Ris

Connectionist Learning with High-order Functional Networks and Analyses of Its Interval Representation

Akira NAMATAME

pp. 372-380

DOI:

10.5687/iscie.3.372

Abstract

We show the Inductive capability or generality of a connectionist learning depends on the network architecture. It is shown that the conventional network architecture is inadequate for representing and learning complex nonlinear structure of the continuous mapping. We propose a new network architecture, high-order functional networks, with some nonmonotonic functional units as input units. It is shown that a high-order functional network trained with backpropagation can generalize and infer the nonlinear structure between the continuous variables. Nonlinear mappings are characterized by the positions and the number of their extreme points and the curvatures at the extreme points. It is shown that the combination of the, high-order functional input units and the sigmoid-type hidden units make it possible to realize and acquire a proper internal representation of the network and that extracts those features of the task domain.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Connectionist Learning with High-order Functional Networks and Analyses of Its Interval Representation

twitter
facebook
mendeley

Bibtex

Ris

Pattern Recognition System Insensitive to Translation and Rotation Using Neural Networks with Signum Functions

Minoru FUKUMI, Sigeru OMATU

pp. 381-388

DOI:

10.5687/iscie.3.381

Abstract

In this paper, a pattern recognition system by neurons with signum function is considered. The entire pattern recognition system is constructed by an invariance net of neurons with signum function and a trainable descrambler with CONE. The invariance net can be designed to produce a set of outputs that are insensitive to translation and rotation of the input patterns. The original patterns can be reproduced in standard position by the trainable descrambler. The system presented here produces a noise tolerant mapping and has a fast convergence rate with CNR algorithm.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Pattern Recognition System Insensitive to Translation and Rotation Using Neural Networks with Signum Functions

twitter
facebook
mendeley

Bibtex

Ris

Article Access Ranking

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