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. 10 (1997), No. 12

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. 10 (1997), No. 12

A Prediction Method of Psychological Response to Fluctuating Random Noise by Using Simplified Membership Functions

Tetsuro SAEKI, Shizuma YAMAGUCHI, Yuichi KATO

pp. 617-627

DOI:

10.5687/iscie.10.617

Abstract

In the psychological noise evaluation, the fuzziness caused by the human subjective judgment for the acoustical stimulus is inevitably obscure. From the above viewpoints, in this paper, the relationship between the physical sound insulation method and the psychological noise evaluation method for fluctuating random noise is considered, by using the fuzzy set theory. That is, A set of eight simplified patterns of the membership functions are first established by using the actually observed data for psychological impression. Next, a new systematical method for estimating and/or predicting the psychological impression by using the above simplified membership functions is proposed, in the case when the two physical characteristics of noise stimulus (the sound pressure level probability distribution and the power spectral density) being changed by the erection of the sound insulation barrier.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Prediction Method of Psychological Response to Fluctuating Random Noise by Using Simplified Membership Functions

twitter
facebook
mendeley

Bibtex

Ris

Selective Learning Algorithms with Forgetting Taking Account of the Balance between Learning and Forgetting

Eiji WATANABE

pp. 628-636

DOI:

10.5687/iscie.10.628

Abstract

In this paper, the relation between the correction and the forgetting of weights in the learning algorithm is examined and selective learning algorithms with forgetting are newly proposed. First, the relation between the direction of the correction and the direction where the weight is forgotten is examined and a learning algorithm with forgetting based on the learning error is proposed. Concretely, the weight is selectively forgotten by introducing the index to evaluate the learning ability. Next, a learning algorithm with forgetting based on the activity of the hidden unit is proposed in order to improve the structuring ability. Finally, the comparison examination of such learning algorithms with forgetting is done from the viewpoint of the learning ability, the structuring ability, and generalization ability by using the logical function learning problem, the classification problem of irises, and the time series prediction problem and the effectiveness of the proposed learning algorithm with forgetting is shown.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Selective Learning Algorithms with Forgetting Taking Account of the Balance between Learning and Forgetting

twitter
facebook
mendeley

Bibtex

Ris

A Method of Generating Pattern Descriptions for Robust Image Recognition via Fusion of Visual Information

Hajimu KAWAKAMI, Yasuaki KUROE, Takehiro MORI

pp. 637-646

DOI:

10.5687/iscie.10.637

Abstract

This paper describes a method which gives new pattern descriptions of observed images for computer vision with robustness to perturbation in the observed images. Although experimental results support that biological pattern vision should extract information about the observed images from signals with a variety of spatial frequencies over its broad receptive field, it is difficult to implement such an extraction due to the uncertainty relationship between the signal and its Fourier Transform; therefore, the biological pattern vision is considered to possess a function for suppression of this uncertainty relationship. We regard this function as fusion and consider that this fusion brings the robustness to the biological pattern vision; then, we propose a method of generating pattern descriptions of the observed images via this fusion. We first describe this fusion as a mathematical constraint. We second introduce a stochastic model satisfying this constraint. We consequently arrive at a Linear Programming; therefore, the pattern descriptions of the observed images can effectively be generated by the simplex method. We have made experiments on pattern matching with the proposed pattern descriptions. Their results have demonstrated that the proposed pattern descriptions are robust to the perturbations in contrast to a conventional method.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Method of Generating Pattern Descriptions for Robust Image Recognition via Fusion of Visual Information

twitter
facebook
mendeley

Bibtex

Ris

Prediction of Travel Time on Arterial Roads using Vehicle Detector Information

Toshihiko ODA

pp. 647-655

DOI:

10.5687/iscie.10.647

Abstract

Accurate prediction of travel time is useful for car drivers, and thus it is critical to develop a prediction system to provide the information. AVI (Automatic Vehicle Identification) system has been developed as a direct and precise measurement tool, however, because of the constrains of the installation points, a few dozen systems have been installed so far. On the other hand, we have more than eighty thousand vehicle detectors which collect traffic volumes at each point every five minutes. We note that vehicle detectors are not quite adequate for the prediction of travel time since the traffic volume alone does not lead to the travel time. This paper proposes a new method of predicting travel time in real time using efficiently the data collected from the detectors. The route is divided into several sections. Then, the travel time of each section is estimated by the approximated velocity where the approximation is done via the time-varying coefficients autoregressive model. In order to evaluate this approach, several field experiments were carried out. The results show that predicted travel time closely approximates the measured value.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Prediction of Travel Time on Arterial Roads using Vehicle Detector Information

twitter
facebook
mendeley

Bibtex

Ris

Parseval-Like Identity of Wavelet Transform and Its Applications to Noise Reduction

Handa CHEN, Hajime MAEDA

pp. 656-667

DOI:

10.5687/iscie.10.656

Abstract

In this paper we examine the noise-reducing property of continuous wavelet transform, and propose a concept of optimal wavelets in the sense of complete noise reduction for separable noises in the time-scale domain. We first discuss about the wavelet transform of stochastic processes, focusing mainly on certain properties of it, such as the stationarity preserving property and Parseval-like identity. We then show that the mean square power of separable noises in the time-scale domain is possible to be zero by inverse wavelet transform if the basic wavelet φ (t) is chosen properly. A numerical example is given for illustration.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Parseval-Like Identity of Wavelet Transform and Its Applications to Noise Reduction

twitter
facebook
mendeley

Bibtex

Ris

An Autoassociative Memory Model Derived from a Modular Neural Network and a Diversity of the Association Properties

Seiichi OZAWA, Kazuyoshi TSUTSUMI, Norio BABA

pp. 668-678

DOI:

10.5687/iscie.10.668

Abstract

In this paper, we propose a new autoassociative memory model which is derived from Cross-Coupled Hopfield Nets (CCHN). The CCHN is a modular neural network in which plural Hopfield networks are mutually connected via feedforward neural networks. The CCHN's architecture is determined by the following structural parameters : the number of modules, the numbers of units in the modules, the contribution of the module information processings and the interactions to the whole network information processing, and the module connectivity. If these parameters are changed, the network dynamics are also changed; therefore, it may be possible to implement a great number of autoassociative memories with different nature. Through some computer simulations, we will discuss a diversity of association properties in the proposed model.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

An Autoassociative Memory Model Derived from a Modular Neural Network and a Diversity of the Association Properties

twitter
facebook
mendeley

Bibtex

Ris

VFS Speaker Adaptation by a Control Method for Smoothing Parameters Based on Classification Error

Kazumi OHKURA

pp. 679-681

DOI:

10.5687/iscie.10.679
mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

VFS Speaker Adaptation by a Control Method for Smoothing Parameters Based on Classification Error

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.