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. 29 (2016), No. 2

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.8
    2. No.7
    3. No.6
    4. No.5
    5. No.4
    6. No.3
    7. No.2
    8. 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 Nov. (Last 30 Days)

Transactions of the Institute of Systems, Control and Information Engineers Vol. 29 (2016), No. 2

Assigning Library Classification Numbers to People on the Web and Developing People-search Directory

Harumi Murakami, Yoshinobu Ura, Yusuke Kataoka

pp. 51-64

DOI:

10.5687/iscie.29.51

Abstract

To help users select and understand people while searching for them, we present a method of assigning Nippon Decimal Classification (NDC), which is a system of library classification numbers, to people on the web. By assigning NDC numbers to people, we can assign not only labels to people but also build a NDC-based people-search directory. We use a relative index in NDC, which lists the related index terms attached to NDC. We count the number of relative index terms contained in the titles of web pages (HTML files) and assign the top five NDC9 numbers to people. We developed a prototype of a people-search directory by assigning NDC9 numbers to HTML files that were manually classified from web people-search results. We evaluated the usefulness of our approach by comparing four methods and six documents and found that our method (extracting relative index terms) from the titles of web pages outperformed other methods and documents.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Assigning Library Classification Numbers to People on the Web and Developing People-search Directory

twitter
facebook
mendeley

Bibtex

Ris

The Active Search Algorithm to Automate the Adjustment of the Control Parameters and Its Applications

Akio Noda, Hikaru Nagano, Yukiyasu Domae, Tatsuya Nagatani, Ken-ichi Tanaka

pp. 65-75

DOI:

10.5687/iscie.29.65

Abstract

In the optimization task of the control parameters of some industrial processes, it is necessary to explore unknown response landscape of the system by performing plural sampling of the output for input parameter combination of the system. Skilled operators has been conducting such tasks based on their experience and knowledge. In this study, the authors had formulated this problem as a machine learning process, and had developed an algorithm that sequentially selects quasi-optimal next sampling. Experimental results discovered a case that the algorithm can reduce the control parameter optimization task which requires 3 months duration into about 1 week.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

The Active Search Algorithm to Automate the Adjustment of the Control Parameters and Its Applications

twitter
facebook
mendeley

Bibtex

Ris

Incremental Learning for a Calibration of a High-precision SAR-ADC by Using the Bayesian Linear Regression

Toshifumi Kurata, Keiji Tatsumi, Tetsuzo Tanino, Yusaku Hirai, Toshimasa Matsuoka, Sadahiro Tani

pp. 76-85

DOI:

10.5687/iscie.29.76

Abstract

In this paper, we discuss a high-precision and low-power analog-to-digital converter (ADC) which is required for wearable biomedical measurement sensors driven by a battery. In particular, we focus on the successive approximation register ADC (SAR-ADC), and propose its calibration algorithm using the machine learning. We derive a calibration function for the outputs of the SAR-ADC by taking into account its characteristics, and show the least squares method of determining the parameter values of the function to minimize the residual errors. Furthermore, from the practical viewpoint, we propose an incremental learning for the calibration, where additional data sets are selected on the basis of the Bayesian predictive distributions which are obtained at each additional learning step. Through numerical experiments, we observed that the mean residual errors obtained by the proposed method are less than 1 LSB, and the method needs a small amount of training data.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Incremental Learning for a Calibration of a High-precision SAR-ADC by Using the Bayesian Linear Regression

twitter
facebook
mendeley

Bibtex

Ris

Agent-based Energy Market toward the Optimal Trading in a Power Network

Masayoshi Suzuki, Kazutoshi Sakakibara, Masataka Seo, Ikuko Nishikawa

pp. 86-92

DOI:

10.5687/iscie.29.86

Abstract

Power trading market among ordinary houses equipped with solar power generators is considered.Trading is mediated by several brokers who represent the buying or selling by each house. Objective is to investigate whether the optimal power usage is able to be realized by the optimal trading strategy of each broker. The optimal power exchange is given by a linear programming (LP) model,which purely considers the power flow without any price. Each broker has a pricing strategy to maximize the reward, and the trading amount is assigned according to the relative price. Agent based simulation results show that reinforcement learning is effective to obtain the pricing strategy with the effective usage of the battery under the environment of unsteady and unbalanced amount of the power generation and consumption. The obtained trading results in a similar power flow with the optimal power exchange derived from the LP.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Agent-based Energy Market toward the Optimal Trading in a Power Network

twitter
facebook
mendeley

Bibtex

Ris

Algorithm to Compensate the Time Delay for the Appearance Control System using Camera and Projector

Kunioki Kono, Shun Ushida, Toshiyuki Amano

pp. 93-100

DOI:

10.5687/iscie.29.93

Abstract

The appearance control system is one of the visual feedback control systems that can manipulate the appearance of an object by using a projector-camera system. This system processes the captured image and projects the image on the object overlappingly for manipulating the appearance in real time. However, the afterimage is caused by a part of the image which is not overlapped on the object and remains in capture range of the camera. Therefore, this afterimage makes the appearance control system unstable. In this paper, we propose a new projection algorithm that can compensate the time delay for the appearance control system.We verify the effectiveness of our algorithm which can suppress the influence of the afterimage against the time delay in the visual feedback loop.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Algorithm to Compensate the Time Delay for the Appearance Control System using Camera and Projector

twitter
facebook
mendeley

Bibtex

Ris

Two-Stage System Identification Method Incorporating with Pre-Identification Result

Ayaka Matsubayashi, Masaki Inoue, Shuichi Adachi

pp. 101-103

DOI:

10.5687/iscie.29.101
mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Two-Stage System Identification Method Incorporating with Pre-Identification Result

twitter
facebook
mendeley

Bibtex

Ris

Article Access Ranking

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