ログイン
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

  1. B. 理工学域; 数物科学類・物質化学類・機械工学類・フロンティア工学類・電子情報通信学類・地球社会基盤学類・生命理工学類
  2. b 10. 学術雑誌掲載論文
  3. 1.査読済論文(工)

Neural networks following a binary approach applied to the integer prime-factorization problem

http://hdl.handle.net/2297/6796
http://hdl.handle.net/2297/6796
c3f92f43-c723-4c60-bc95-e9e45591b25f
名前 / ファイル ライセンス アクション
TE-PR-NAKAYAMA-K-2577.pdf TE-PR-NAKAYAMA-K-2577.pdf (221.9 kB)
Item type 会議発表論文 / Conference Paper(1)
公開日 2017-10-03
タイトル
タイトル Neural networks following a binary approach applied to the integer prime-factorization problem
言語
言語 eng
資源タイプ
資源タイプ識別子 http://purl.org/coar/resource_type/c_5794
資源タイプ conference paper
著者 Jansen, Boris

× Jansen, Boris

WEKO 9873

Jansen, Boris

Search repository
Nakayama, Kenji

× Nakayama, Kenji

WEKO 353
e-Rad 00207945
研究者番号 00207945

Nakayama, Kenji

Search repository
書誌情報 Proceedings of the International Joint Conference on Neural Networks

巻 4, p. 2577-2582, 発行日 2005-08-01
DOI
関連タイプ isIdenticalTo
識別子タイプ DOI
関連識別子 10.1109/IJCNN.2005.1556309
出版者
出版者 IEEE(Institute of Electrical and Electronics Engineers)
抄録
内容記述タイプ Abstract
内容記述 Nowadays, the integer prime-factorization problem finds its application often in modern cryptography. Artificial Neural Networks (ANNs) have been applied to the integer prime-factorization problem. A composed number N is applied to the ANNs, and one of its prime factors p is obtained as the output. Previously, neural networks dealing with the input and output data in a decimal format have been proposed. However, accuracy is not sufficient. In this paper, a neural network following a binary approach is proposed. The input N as well as the desired output p were expressed in a binary form. The proposed neural network is expected to be more stable, i.e. less sensitive to small errors in the network outputs. Simulations have been performed and the results are compared with the results reported in the previous study. The number of required search times for the true prime number can be well reduced. Furthermore, the probability density function of the training patterns is investigated and the need for different data creation and/or selection techniques is shown. © 2005 IEEE.
著者版フラグ
出版タイプ VoR
出版タイプResource http://purl.org/coar/version/c_970fb48d4fbd8a85
戻る
0
views
See details
Views

Versions

Ver.1 2023-07-28 02:23:22.191375
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR 2.0
  • OAI-PMH JPCOAR 1.0
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3