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

A Network Model for Dynamic Traffic Assignment

Masayuki TSUJINO, Masao FUKUSHIMA, Toshihide IBARAKI

pp. 257-264

DOI:

10.5687/iscie.5.257

Abstract

Models for predicting traffic congestion over time on a road network have been formulated as non-linear optimization problems. In this paper, we construct a new dynamic flow model represented as an optimization problem on a time-space network. In this model, there is a one-to-one correspondence between any directed path on the time-space network and a travel actually taken by a user of the road network. This is an advantage over conventional dynamic flow models in which a travel by a user may correspond to multiple paths in the underlying time-space network. The proposed network model involves arc capacity constraints that depend on the amount of flows of relevant arcs. Since those capacity constraints prevent this model from being treated as network flow problem, we adopt a penalty function techinique to transfer them into the objective function, thereby obtaining a standard non-linear minimum cost flow problem. We report some numerical results to show the validity of the proposed model.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Network Model for Dynamic Traffic Assignment

twitter
facebook
mendeley

Bibtex

Ris

Bill Money Recognition Using Neural Network with FFT as Pre-Processor

Fumiaki TAKEDA, Sigeru OMATU, Takashi INOUE, Saizo ONAMI

pp. 265-273

DOI:

10.5687/iscie.5.265

Abstract

In conventional bill money recognition machine, we develop the recognition algorithm according to the transaction speed and difference of various specifications. However, development of the algorithm for the recognition has been based on the trial and error method. Many researchers have reported that neural networks are suitable for pattern recognition because of the ability of selforganization, parallel processing, and generalization. In this paper, we present, a new bill money recognition method with neural network and show the effectiveness of the present algorithm compared with the pattern matching. Furthemore, we transform bill money data by FFT into frequency domain. Data representation by FFT is more preferable to bill money recognition with neural network and we show that the recognition ability can be improved still more by introducing a new measure of reliability.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Bill Money Recognition Using Neural Network with FFT as Pre-Processor

twitter
facebook
mendeley

Bibtex

Ris

A New Disturbance Compensating Method in Model Reference Adaptive Control System

SHUMING Chen, Yukio NISHIMURA, Yoh YONEZAWA

pp. 274-282

DOI:

10.5687/iscie.5.274

Abstract

This paper proposes a design method of MRACS (Model Reference Adaptive Control System) for unknown plants in the presence of deterministic disturbance or periodic disturbance, so that the output error will converge to zero as time tends to infinity.
In the traditional adaptive control systems dealing with disturbance, the disturbance was usually restricted to be deterministic. To remove the effect of disterbance, the general way was to use extended system including a disturbance model, or to use integral compensators. Here, a new disturbance compensating method is proposed, in which disturbance compensating signals are introduced into MRACS, and are combined adaptively to cancel the effect of disturbance. In this proposed method, because the filter signals of input and output are composed in the same way as the disturbance free cases, the MRACS has a simple constructure. Even for the periodic disturbance with unknown shape, if the period is known, by using Fourier series, the proposed method is also possible to remove the effect of this sort of disturbance. Furthermore, being used, disturbance compensating signals in MRACS, it is possible to take the initial responses of filters into account, and the characteristics of parameter convergence can be improved. The effectiveness of this proposed method is illustrated by some computer simulations.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A New Disturbance Compensating Method in Model Reference Adaptive Control System

twitter
facebook
mendeley

Bibtex

Ris

An Assembly Planning for Robots Based on Constraint State Transition Difficulty

Tsuneo YOSHIKAWA, Yasuyoshi YOKOKOHJI, Yong Yu

pp. 283-293

DOI:

10.5687/iscie.5.283

Abstract

For autonomous assembly operations by a robot, it is required to build a planning function that can generate a series of operations to reach a goal state. This paper describes an automatic planning algorithm that synthesizes the assembly operation strategies. By making an criterion function based on the difficulty of state transitions be minimum, the method can find an optimal path based on the Contact State Network. The Degree of Constraint is proposed by regarding the assembly task as a process to change the constraint, state of the moving object. Then several policies for determining State Transition Difficulty are discussed where the variation of the degree of constraint and the shape information from the geometric model of objects are considered. A criterion function for state transitions is defined based on the discussed policies. Lastly, an algorithm which plans an optimal state transition path from an initial state to a goal state is proposed. Some examples are given to show the validity of this algorithm

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

An Assembly Planning for Robots Based on Constraint State Transition Difficulty

twitter
facebook
mendeley

Bibtex

Ris

A Tone Recognition of Polysyllabic Chinese Words Using an Approximation Model of Four Tone Pitch Patterns

Ya-dong Wu, Kazuo HEMMI, Kazuo INOUE

pp. 294-301

DOI:

10.5687/iscie.5.294

Abstract

In our previous paper, we proposed an approximation model of pitch pattern for the recognition of four tones of Chinese speech. In this paper, we describe how to use the approximation model to recognize the tones of polysyllabic Chinese words. In order to segment a phrase to the syllabic unit, we propose a new segmentation scheme based on the analysis of the sound linking characteristic between syllables. The phrases are classified into non-linked syllabic phrases and linked syllabic phrases. Applying pitch information directly to the former, power parameter and AMDF (Average Magnitude Differential Function) to the latter, phrases are segmented into two syllabic units. Using the approximation model and separated syllabic units, tone recognition of polysyllabic words are carried out. From the results of the recognition experiment which realized the recognition rate of 96. 6% in an average, it is evident that this method is effective to recognize the tone of polysyllabic Chinese words.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Tone Recognition of Polysyllabic Chinese Words Using an Approximation Model of Four Tone Pitch Patterns

twitter
facebook
mendeley

Bibtex

Ris

Multiple Axes Synchronizing. System under Adaptive Feedforward Control

Takuya KAMANO, Takayuki SUZUKI, Kenichi IIDA, Yu KATAOKA, Masayoshi TOMIZUKA

pp. 302-304

DOI:

10.5687/iscie.5.302
mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Multiple Axes Synchronizing. System under Adaptive Feedforward Control

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.