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

ジャーナル

論文検索サイト

アカウント

© 2022 Steel Science Portal

ヘルプ

詳細検索

論文検索サイト

site
site
site
site

システム/制御/情報 Vol. 4 (1991), No. 1

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

キーワードランキング

16 May. (Last 30 Days)

システム/制御/情報 Vol. 4 (1991), No. 1

可能性と必然性の概念に基づくニューラルネットの学習アルゴリズム

石渕 久生, 田中 英夫

pp. 1-10

DOI:

10.5687/iscie.4.1

抄録

In this paper, we propose two learning methods of neural networks for a two-group discriminant problem. One method corresponds to the possibility analysis and the other to the necessity analysis. The proposed methods are the same as the back-propagation algorithm except for the cost function. The cost function to be minimized in our methods is not the sum of squared errors but the weighted sum of squared errors. The value of weight relating to each data point varies in process of learning and depends on whether the data point belongs to group 1 or group 2. For example, if we consider the possibility of group 1, the weight relating to the data points in group 1 is constant but the weight of group 2 is gradually decreased in process of learning. On the other hand, if we consider the necessity of group 1, the weight relating to the data points in group 1 is gradually decreased but the weight of group 2 is constant.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

可能性と必然性の概念に基づくニューラルネットの学習アルゴリズム

twitter
facebook
mendeley

Bibtex

Ris

ニューラルネットを用いたリモートセンシングデータのパターン認識

吉田 知司, 大松 繁, 寺西 大

pp. 11-20

DOI:

10.5687/iscie.4.11

抄録

In this paper, we propose a method employing neural network to classify remote sensing data. Initially, we select training patterns based on the geographical knowledge and then the neural network is trained until the desired classification is attained. After training the neural network, the selected training patterns are again applied to the network. If the classification is not satisfactory, then the sample is deleted from the original training set and new training set is formed to classify the remote sensing data. Once the training is complete, the remote sensing data is applied to the trained network for classification. The experiments on LANDSAT TM data show that this approach produces excellent classification results which are more realistic and noiseless compared with usual Bayesian approach. Finally, the present neural network approach is also powerful to solve a problem of removal of cloud shadows.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

ニューラルネットを用いたリモートセンシングデータのパターン認識

twitter
facebook
mendeley

Bibtex

Ris

階層型神経回路モデルによる時空間パターンの認識

伊藤 崇之

pp. 21-27

DOI:

10.5687/iscie.4.21

抄録

In this paper, a neural network model is proposed which can recognize spatiotemporal patterns.
The model is composed of feature detection module and feature integration module. The former extracts time-pecific features such as onsets and offsets of input signals. The latter consists of two types of neurons, a P-neuron and a T-neuron. A P-neuro integrates features. A T-neuron has a memory mechanism with input-dependent decay time. Pairs of these two types of neural layers are connected in cascade in the model. Combination of these two types of layers in hierarchical structure produces an ability of duration-independent recognition of spatio-temporal patterns.
In a computer simulation, it has been shown that the model can tolerate wide range of distortion of input patterns such as elongation and shrink along the temporal axis, shift along spatial axis and deformation in shape.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

階層型神経回路モデルによる時空間パターンの認識

twitter
facebook
mendeley

Bibtex

Ris

チェビシェフネットワークによるパターン領域の識別

生天目 章, 上田 延寿

pp. 28-36

DOI:

10.5687/iscie.4.28

抄録

A connectionist classifier with a new network architecture, Chebychev networks, is proposed for classifying continuous patterns in non-covex decision regions. The conventional connectionist classifier with monotonic sigmoid functions as its units is shown to face the problems of scaling and generalization. The new multi-layer networks, Chebychev networks, consist of nonmonotonic, nonlinear Chebychev functions as their input units, and monotonic sigmoid functions as their hidden and output units. The proposed connectionist classifier consists of two modules, a Chebychev networks module and a classification module. The Chebychev networks module transforms a complex pattern space into a high-order simple space. The classification module works on this transformed simple space.
It is shown the problems of scaling and generalization can be overcome with the new connectionist classifier with Chebychev networks, and the classification performance is increased significantly compared with the conventional connectionist classifier.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

チェビシェフネットワークによるパターン領域の識別

twitter
facebook
mendeley

Bibtex

Ris

フィードバック誤差学習による閉ループシステムの学習制御

五味 裕章, 川人 光男

pp. 37-47

DOI:

10.5687/iscie.4.37

抄録

In this paper, we propose a new learning scheme using feedback-error-learning for a Neural network model applied to an adaptive Nonlinear Feedback Controller (NNFC). This system uses a Conventional Feedback Controller (CFC) both as a usual feedback controller to guarantee global asymptotic stability and as a reference model of the response. The output of the conventional feedback controller is used as the error signal for a neural network model for adaptive nonlinear feedback control. The response of the controlled object follows the response of the reference model after the learning period.
The convergence properties of this learning scheme are provided by using the averaged equation and the Liapunov method. This scheme was successfully applied to the control of an inverted pendulum by computer simulation. We also pointed out the relationship of this learning scheme to the cerebellum's posture and locomotion adaptive control mechanism in animals.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

フィードバック誤差学習による閉ループシステムの学習制御

twitter
facebook
mendeley

Bibtex

Ris

神経回路モデルによる最適化計算

喜多 一, 小谷 英之, 西川 〓一

pp. 48-56

DOI:

10.5687/iscie.4.48

抄録

Combinatorial optimization by means of an analog neural network proposed by J. J. Hopfield and D. W. Tank is one of the major subjects in neural computing. Though a good deal of reexaminations and various applications of the network have been reported so far, the effectiveness of the approach is not clarified in sufficient manner. In the present paper, the effectiveness of the Hopfield model is discussed through its application to a circuit block placement problem. The results of computer simulation show that, although the Hopfield model is not effective enough if it is used without sophisticated preexamination of combinatorial problems, it has ability to yield quite satisfactory solutions when it is endowed with an appropriate form and parameters of the energy function. The meaning of appropriate parameter values yielding good solutions is also investigated theoretically.

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

神経回路モデルによる最適化計算

twitter
facebook
mendeley

Bibtex

Ris

ニューラルネットワークによる巡回セールスマン問題の一解法

田村 坦之, 寺岡 照彦, 鳩野 逸生, 山縣 敬一

pp. 57-59

DOI:

10.5687/iscie.4.57

抄録

[in Japanese]

mendeley

ブックマーク

詳細

PDFダウンロード

SNSによる共有

論文タイトル

ニューラルネットワークによる巡回セールスマン問題の一解法

twitter
facebook
mendeley

Bibtex

Ris

論文アクセスランキング

16 May. (Last 30 Days)

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

詳細検索

論文タイトル

著者

抄録

ジャーナル名

年

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

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