logo
言語
ブックマーク
ログアウト

ジャーナル

論文検索サイト

アカウント

© 2022 Steel Science Portal

ヘルプ

詳細検索

論文検索サイト

site
site
site
site

システム/制御/情報 Vol. 29 (2016), No. 2

ISIJ International
belloff
オンライン版ISSN: 2185-811X
冊子版ISSN: 1342-5668
発行機関: 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

キーワードランキング

22 Dec. (Last 30 Days)

システム/制御/情報 Vol. 29 (2016), No. 2

Web上の人物への図書館の分類記号の付与と人物ディレクトリの開発

村上 晴美, 浦 芳伸, 片岡 祐輔

pp. 51-64

DOI:

10.5687/iscie.29.51

抄録

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

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

Web上の人物への図書館の分類記号の付与と人物ディレクトリの開発

twitter
facebook
mendeley

Bibtex

Ris

制御パラメータの調整作業を自動化するための能動型探索アルゴリズムと，その適用事例について

野田 哲男, 長野 陽, 堂前 幸康, 永谷 達也, 田中 健一

pp. 65-75

DOI:

10.5687/iscie.29.65

抄録

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

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

制御パラメータの調整作業を自動化するための能動型探索アルゴリズムと，その適用事例について

twitter
facebook
mendeley

Bibtex

Ris

ベイズ線形回帰を用いた高精度逐次比較型 A/D 変換器の誤差補正のための追加学習法

倉田 宗史, 巽 啓司, 谷野 哲三, 平井 雄作, 松岡 俊匡, 谷　　貞宏

pp. 76-85

DOI:

10.5687/iscie.29.76

抄録

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

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

ベイズ線形回帰を用いた高精度逐次比較型 A/D 変換器の誤差補正のための追加学習法

twitter
facebook
mendeley

Bibtex

Ris

電力売買エージェント群による取引市場と電力ネットワークにおける最適融通

鈴木 将義, 榊原 一紀, 瀬尾 昌孝, 西川 郁子

pp. 86-92

DOI:

10.5687/iscie.29.86

抄録

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

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

電力売買エージェント群による取引市場と電力ネットワークにおける最適融通

twitter
facebook
mendeley

Bibtex

Ris

プロジェクタとカメラを用いた見かけの制御に対するむだ時間補償アルゴリズムの提案

河野 邦起, 牛田 俊, 天野 敏之

pp. 93-100

DOI:

10.5687/iscie.29.93

抄録

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

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

プロジェクタとカメラを用いた見かけの制御に対するむだ時間補償アルゴリズムの提案

twitter
facebook
mendeley

Bibtex

Ris

論文アクセスランキング

22 Dec. (Last 30 Days)

この機能はログイン後に利用できます。
下のボタンをクリックしてください。

詳細検索

論文タイトル

著者

抄録

ジャーナル名

年

出版日を西暦で入力してください（4桁の数字）。

検索したいキーワードを入力して下さい