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

A Financial Analysis System on Optimistic-Pessimistic Axis by Intuitive Reasonings

Kyuichiro TANI, Katsuari KAMEI

pp. 515-521

DOI:

10.5687/iscie.14.515

Abstract

The purpose of our work is to design a financial analysis system by an intuitive reasoning on an optimistic-pessimistic axis. The intuitive reasoning is totally different from a logical reasoning used in AI and is defined by subjective information such as adjectives high, low, good, bad and etc. A Computer-Aided Financial Analysis Systems (CAFAS) based on fuzzy theory and the intuitive reasonings are a new challenge to computer technology experts and management science specialists.
In this paper, we propose a new financial analysis system based on the intuitive reasonings. Firstly, we describe the intuitive reasonings. Secondly, the intuitive reasoning is applied to financial data. Thirdly, the results of the intuitive reasoning are projected on the optimistic-pessimistic axis. In the projection, fuzzy membership functions for financial analysis are calculated. Finally, practical analyses of four computer enterprises are given in this paper and four membership functions of typical financial condition for financial analysts are shown.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Financial Analysis System on Optimistic-Pessimistic Axis by Intuitive Reasonings

twitter
facebook
mendeley

Bibtex

Ris

Construction of Segmental Unit Input with Dual-Width Window for Speech Recogniton

Kazunori NINOMIYA, Takashi OTSUKI, Teruhiko OHTOMO

pp. 522-529

DOI:

10.5687/iscie.14.522

Abstract

In this paper, we propose the dual-width windowed segment (DWWS) which consists of a short cepstrum segment and a long Δ cepstrum segment, as a more effective segmental input vector than the conventional one. First, using a criterion for cluster analysis, we evaluate various compositions of feature vectors based on their ability of phoneme separation to show the effectiveness of DWWS. Then we carry out discrete HMM speech recognition experiments to verify the result of evaluation. As a result, it is shown that the DWWS brings on high recognition performance when a categories-dependent codebook is used for vector quantization.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Construction of Segmental Unit Input with Dual-Width Window for Speech Recogniton

twitter
facebook
mendeley

Bibtex

Ris

A Solution to the JIT Scheduling Problem Using Binary Neural Network

Akihiro MATSUNAGA, Yuki NAKASHIMA, Akihiro KANAGAWA, Ikuo ARIZONO

pp. 530-535

DOI:

10.5687/iscie.14.530

Abstract

Recently, Just-In-Time (JIT) production systems have much influence on the production fields. Miyazaki et al. propose a concept of actual flow time, which is a performance measure for scheduling in a JIT production environment. Scheduling problems are one of representative combinatorial optimization problems. Hopfield and Tank show that some combinatorial optimization problems can be solved by the artificial neural network system. Arizono et al. propose a neural solution for minimizing total actual flow time by the Gaussian machine. However, their method retains some problems which originate in the analog neurons. Then, we use interconnected neural networks which consist of the binary neurons whose output states take values either 0 or 1 unlike the Arizono's system. We call such a network the binary neural network. This paper deals with the scheduling problem for minimizing total actual flow time by the binary neural network.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Solution to the JIT Scheduling Problem Using Binary Neural Network

twitter
facebook
mendeley

Bibtex

Ris

Application of Meta-Heuristics Accompanied with Reinforcement Learning Mechanism to Optimization of Rolling Sequence

Toyohiro UMEDA, Akira KITAMURA, Masami KONISHI

pp. 536-544

DOI:

10.5687/iscie.14.536

Abstract

It is known that ants and bees are working cooperatively as a group by detecting the information transmission material called pheromone. In this paper, this idea is combined with meta-heuristics search, and applied to the problem of finding an optimal operational sequence. In modeling, one job is treated as an agent such as ant or bee. Each agent scatters its peculiar pheromone on each processing order corresponding to decision variable, and exchanges the orders statistically among agents according to the distribution of pheromone. The results of the exchanges are evaluated as a whole and the update value of each pheromone is determined. We propose a method that generates a processing sequence converging to the optimal processing order by regulating the related parameters through such iteration. We have developed a computer program based on the algorithm. The usefulness of the proposed method is confirmed by numerical experiments for scheduling of the hot rolling process.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Application of Meta-Heuristics Accompanied with Reinforcement Learning Mechanism to Optimization of Rolling Sequence

twitter
facebook
mendeley

Bibtex

Ris

Active Knee-Lock Algorithms and Virtual Coupling Control for Variable Walking Pattern of a Kneed Biped

Fumihiko ASANO, Masaki YAMAKITA

pp. 545-553

DOI:

10.5687/iscie.14.545

Abstract

In our previous works, we have proposed “virtual passive dynamic walking” with virtual gravity for biped robots in order to realize active walking on the level ground without any gait design in advance. In this paper we discuss some control problems of a kneed biped robot and propose “modified compass-like virtual passive dynamic walking” with active knee-lock algorithms in order to avoid “foot scuffing” problem during the single support phase. Furthermore, a virtual coupling control law is proposed which can realize variable walking pattern with respect to the robot's energy levels. By the effect of the control law, the robot which is a hybrid dynamical system can be regarded as a passive system which does not include any collisions, and variable walking pattern can be realized without loss of properties of a virtual passive walk. The validity of the proposed methods has been examined by numerical simulations.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Active Knee-Lock Algorithms and Virtual Coupling Control for Variable Walking Pattern of a Kneed Biped

twitter
facebook
mendeley

Bibtex

Ris

An Off-Line Reference Management Technique for Constraint Fulfillment

Kenji HIRATA, Kiminao KOGISO

pp. 554-559

DOI:

10.5687/iscie.14.554

Abstract

This paper considers an off-line reference management technique for constraint fulfillment. The proposed finite dimensional optimization program provides the managed reference signal which assures infinite-time constraint fulfillment. The main idea is to restrict the state variable at the final instance of finite-time reference management to a certain invariant subset of the state space such that fulfilling constraints for the primary designed closed-loop system is equivalent to restricting the state dynamics to this set. The proposed technique also, enables us to improve the control performance of systems with constraints. The control scheme is proved to fulfill the specified state and control constraints and shown to improve the set-point tracking performance.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

An Off-Line Reference Management Technique for Constraint Fulfillment

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.