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. 15 (2002), No. 1

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

21 Dec. (Last 30 Days)

Transactions of the Institute of Systems, Control and Information Engineers Vol. 15 (2002), No. 1

Compact Speech Recognition Algorithm Based on Vowel Identification and Its Evaluation on a DSP Board

Yukikuni NISHIDA, Yoshio NAKADAI, Yoshitake SUZUKI, Tetsuma SAKURAI

pp. 1-9

DOI:

10.5687/iscie.15.1

Abstract

This paper describes a low-cost speech recognition system for controlling terminals and systems. The speech recognition system uses a compact speech recognition algorithm that is based on symbol matching for the five Japanese vowel sounds and a few consonant categories instead of conventional speech parameters. The algorithm has a significant advantage over conventional speaker-independent speech recognition algorithms that use complicated matching techniques; it reduces the memory required (by a factor from 4 to 200) for storing the reference templates and instruction sets and so can be implemented on low-cost processors. We implement this recognition algorithm on a fixed-point, 20-MIPS digital signal processor board with 10-k x 16-bit on-chip memory. Recognition experiments using 10 (20) Japanese city names indicate an accuracy of 96.2% (90.3%). By restricting the target vocabulary 20 words, the proposed speech recognition system can be integrated into many devices at Very low cost.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Compact Speech Recognition Algorithm Based on Vowel Identification and Its Evaluation on a DSP Board

twitter
facebook
mendeley

Bibtex

Ris

Reconstructions and Predictions of Nonlinear Dynamical Systems Weighted by Model Marginal Likelihoods

Motoki SAITO, Tsuyoshi ENOMOTO, Takashi MATSUMOTO

pp. 10-16

DOI:

10.5687/iscie.15.10

Abstract

A hierarchical Bayesian approach is formulated for nonlinear time series prediction problems with neural nets. The proposed scheme consists of several steps :
(i) Formulae for posterior distributions of parameters, hyper parameters as well as models via Bayes formula.
(ii) Derivation of predictive distributions of future values taking into account model marginal likelihoods.
(iii) Using several drastic approximations for computing predictive mean of time series incorporating model marginal likelihoods.
The proposed scheme is tested against two examples; (A) Time series data generated by noisy chaotic dynamical system, and (B) Building air-conditioning load prediction problem. The proposed scheme outperforms the algorithm previously used by the authors.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Reconstructions and Predictions of Nonlinear Dynamical Systems Weighted by Model Marginal Likelihoods

twitter
facebook
mendeley

Bibtex

Ris

A Measure for Decision-Making Problem on Direct Product Space

Naoyuki TAIRA, Hayao MIYAGI, Katsumi YAMASHITA

pp. 17-24

DOI:

10.5687/iscie.15.17

Abstract

In usual decision-making problems, attributes for an alternative are evaluated, and then, total evaluation for the alternative is done. Therefore, it is necessary to develop a suitable measure to integrate evaluations of given attributes. The difficulties in this process lie in : (i) dealing with the interaction among evaluations, (ii) taking into account some factors influencing an evaluation. However, any conventional literature on fuzzy measure has not discussed (ii) sufficiently. In this paper, P-measure which is defined on direct product space is proposed, to deal with (ii). Furthermore, we propose human measure, through t-conorm, which is possible to handle complexities (i) and (ii) simultaneously. Thus, the proposed human measure is found to be effective in decision-making problems.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Measure for Decision-Making Problem on Direct Product Space

twitter
facebook
mendeley

Bibtex

Ris

Fast Training of Support Vector Machines and Performance Comparison with Fuzzy Classifiers

Takuya INOUE, Takahiro UEOKA, Hisashi TAMAKI, Shigeo ABE

pp. 25-33

DOI:

10.5687/iscie.15.25

Abstract

In this paper, we discuss fast training of a support vector machine for pattern classification by extracting training data around the class boundaries, and then compare performance of the support vector machine with that of a fuzzy classifier with ellipsoidal regions. First, we discuss the architecture and the training method of the support vector machine. Then, we discuss how to extract boundary data from the training data. Next, we summarize the architecture of the fuzzy classifier and discuss a feature extraction method using a two-layer neural network. Finally, we compare performance of the support vector machine with the fuzzy classifier combined with the two-layer neural network for several benchmark data sets and demonstrate the effectiveness of the fast training method.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Fast Training of Support Vector Machines and Performance Comparison with Fuzzy Classifiers

twitter
facebook
mendeley

Bibtex

Ris

A Sequential Quadratic Programming Decomposition Method for Real-Time Optimization in Process Industries

Genichi EMOTO, Masao FUKUSHIMA

pp. 34-40

DOI:

10.5687/iscie.15.34

Abstract

In the process industry, the closed-loop real-time optimization technology has become widespread with several commercial packages. However, the current technology mainly focuses on snapshot optimization, and it may not be used effectively in a time-variant process such as a reactor with catalyst degradation and a boiler with fouling growth. Ideally it is required to consider multi-period optimization that can handle future constraints and the total run-time cost on the process. The main difficulty in treating a multi-period process optimization problem resides in heavy computation due to the size of the problem. This paper proposes an efficient SQP algorithm that decomposes a QP subproblem into individual single-period QP problems by exploiting the particular structure of the multi-period optimization problem. Our numerical experiments indicate that the proposed SQP decomposition algorithm may be advantageous for problems with long time horizon.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Sequential Quadratic Programming Decomposition Method for Real-Time Optimization in Process Industries

twitter
facebook
mendeley

Bibtex

Ris

Approximate Scheduling Algorithms with Performance Guarantee for a Two-Machine Robotic Unit with an Intermediate Station

Yoshiyuki KARUNO, Hiroshi KISE, Kenta YAMAMOTO

pp. 41-49

DOI:

10.5687/iscie.15.41

Abstract

In this paper we consider the scheduling problem of minimizing the maximum completion time (i.e., the makespan) for a two-machine robotic unit of flowshop type, in which each of n jobs is processed on the first machine and later on the second machine. There is an intermediate station between the two machines for intermediate operations such as washing, chip disposal, cooling, drying and/or quenching. If only permutation schedules are allowed (i.e., sequences of jobs on the two machines have to be the same), the problem can be solved in polynomial time, although non-permutation problem (i.e., the original problem) is NP-hard in the strong sense. It is already known that, if the optimal permutation schedule is used as an approximate solution for the non-permutation problem, it gives a maximum completion time within twice the optimal. In this paper, we present a different approximate algorithm which is based on a relaxation to the single-machine problem with delivery times, and show that its non-permutation schedule also gives a maximum completion time within twice the optimal. Moreover, we examine its approximation performance by means of numerical experiments, comparing with the optimal permutation scheduling.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Approximate Scheduling Algorithms with Performance Guarantee for a Two-Machine Robotic Unit with an Intermediate Station

twitter
facebook
mendeley

Bibtex

Ris

Discrete-Time Sliding Mode Control for Linear Systems with Uncertainties

Hiromitsu HIKITA, Naohiko HANAJIMA, Mitsuhisa YAMASHITA

pp. 50-52

DOI:

10.5687/iscie.15.50
mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Discrete-Time Sliding Mode Control for Linear Systems with Uncertainties

twitter
facebook
mendeley

Bibtex

Ris

Article Access Ranking

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