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. 16 (2003), 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. 16 (2003), No. 11

Learning Coefficient and Convergence Speed for Stereo Echo Cancelers with Pre-Processing

Kazushi IKEDA, Ryohei SAKAMOTO

pp. 551-557

DOI:

10.5687/iscie.16.551

Abstract

It is well-known that the so-called non-uniqueness problem appears in adaptive filters for stereo acoustic echo cancelers and one of the effective solutions is the input-sliding method that utilizes a time-varying preprocessor. In this paper, the convergence speed of the input-sliding method is examined. For adaptive algorithms based on orthogonal projection, such as the normalized LMS algorithm, the convergence speed is maximized when the learning coefficient is unity since the orthogonal projection is completed then. However, if the input signal vectors do not span the whole space but exist in a subspace which varies in time, then the learning coefficient which achieves the fastest convergence is found to be not unity but between one and two. The geometrical consideration of the tap-weight vector explains the phenomena and the theoretical results agree well with those of computer simulations.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Learning Coefficient and Convergence Speed for Stereo Echo Cancelers with Pre-Processing

twitter
facebook
mendeley

Bibtex

Ris

Homotopy Tracing of Static Output Feedback Gain for LQ Control

Masami SAEKI, Takuya KITAMOTO

pp. 558-564

DOI:

10.5687/iscie.16.558

Abstract

In this paper, a method of finding a local minimum is examined for LQ optimal control problem of constant output feedback. A necessary condition for optimality is given as matrix algebraic equations for a modified LQ performance index, and a method of tracing a solution path from a state feedback gain to an output feedback gain is proposed. In order to trace the solution curve that may have branch, a new homotopy method based on series expansion of approximate algebra is applied. Initial gains are obtained from not only a positive definite solution but also the other solutions of Riccati equation, then it is examined numerically whether more than one local minimum can be obtained by tracing the solutions starting from the initial gains. A numerical example which has two local minima shows that one local minimum is connected to the optimal state feedback gain, but the other is not connected to any gains given by the solutions of Riccati equation.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Homotopy Tracing of Static Output Feedback Gain for LQ Control

twitter
facebook
mendeley

Bibtex

Ris

Reactive Scheduling Based on Control Limit Policy with Delayed Tasks Measurement

Haruhiko SUWA, Hiroaki SANDOH

pp. 565-573

DOI:

10.5687/iscie.16.565

Abstract

Reactive scheduling approach is considered effective in manufacturing systems, which undergoes various types of delays due to disruption such as machine breakdowns, urgent jobs and so forth. This paper deal with a problem in what situation we should conduct schedule revision under reactive scheduling to obtain an efficient revised schedule. We propose a new model for reactive scheduling based on a control limit policy idea with critical number of delayed tasks which can be a measure to determine the suitable timing of schedule revision. Some computational experiments demonstrate the effectiveness of the proposed model by applying it to job shop scheduling problems with due date.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Reactive Scheduling Based on Control Limit Policy with Delayed Tasks Measurement

twitter
facebook
mendeley

Bibtex

Ris

Interactive Web Page Retrieval by Iterative Learning of Filtering Rules

Masayuki OKABE, Seiji YAMADA

pp. 574-582

DOI:

10.5687/iscie.16.574

Abstract

Web search engines are useful tools which can meet the various information needs of users. However they often return hit-lists which contain many unnecessary pages. This paper proposes a method which automatically removes those unnecessary pages by learning filters through relevance feedback. Filters consist of several rules, each of which describes conditions for discriminating relevant pages using useful cooccurences or proximities among words, and parts in a page where those conditions are applicable. Thus they enable to classify a variety of pages precisely. Moreover, users are free to generate and apply filters at anytime. Through experiments we demonstarate that our filters increase the number of relevant pages we can get in a retrieval, compared to representatives of web search engine and relevance feedback method.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Interactive Web Page Retrieval by Iterative Learning of Filtering Rules

twitter
facebook
mendeley

Bibtex

Ris

Matching Method as Pre-processing for Online Signature Verification Using Dynamical Tuning Parameters

Masahiro TANAKA, Yumi ISHINO, Hironori SHIMADA, Takashi INOUE

pp. 583-590

DOI:

10.5687/iscie.16.583

Abstract

Along the development of computer networks, the necessity of authenticating a person by biometrics is increasing. In this paper, we propose a method for matching of two online signatures. For online signature verification problems, it is necessary to assume that only one or very small number of real signatures can be used because of the property of the problem. We apply DP (Dynamic Programming) matching, where one signature is to be scaled and shifted by time-variant model. We propose a method to apply DP matching and the parameter estimation scheme interchangeably. Experiments using real data validate this method.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Matching Method as Pre-processing for Online Signature Verification Using Dynamical Tuning Parameters

twitter
facebook
mendeley

Bibtex

Ris

A Note on Continuation Method for Strongly Monotone Variational Inequalities under Slater's Constraint Qualification

Kouichi TAJI, Hiroyuki UCHIYAMA

pp. 591-596

DOI:

10.5687/iscie.16.591

Abstract

The continuation method is one approach to solve the system of nonlinear equations. For variational inequality problems, interior point like continuation methods based on the KKT conditions for VIP have been proposed. Kanzow and Jiang considered one parameter continuation method for strongly monotone variational inequality problems and showed that a continuation path exists under the linear independence constraint qualification condition. In this paper, we show that, the unique continuation path approaching to a solution exists for strongly monotone problems under the Slater's constraint qualification instead of the linear independence constraint qualification. Moreover, this theorem is shown to give another proof of the existence theorem for a continuation path of Chen and Harker.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Note on Continuation Method for Strongly Monotone Variational Inequalities under Slater's Constraint Qualification

twitter
facebook
mendeley

Bibtex

Ris

Robust Linear Clustering with Least Squares Criterion and Its Application to Collaborative Filtering

Katsuhiro HONDA, Nobukazu SUGIURA, Hidetomo ICHIHASHI

pp. 597-605

DOI:

10.5687/iscie.16.597

Abstract

Non-linear extensions of Principal Component Analysis (PCA) have been developed for detecting the lower-dimensional representations of real world data sets. Fuzzy c-Varieties (FCV) is the linear fuzzy clustering algorithm that can be regarded as a Local PCA technique. However least squares techniques often fail to account for “outliers”. This paper proposes a technique for making the FCV algorithm robust to intra-sample outliers. The objective function based on the lower rank approximation of the data matrix is minimized by a robust M-estimation algorithm that is similar to FCM-type iterative procedures. The new method is also useful for estimating missing values and a numerical experiment of Collaborative Filtering reveals an improvement in recommendation performance.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Robust Linear Clustering with Least Squares Criterion and Its Application to Collaborative Filtering

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.