論文 - 山森 一人
-
高信頼化モデル構築用サンプルを用いたGMDHによる生理活性値推定
山森 一人，春日亀 裕也，吉原 郁夫
宮崎大学工学部紀要 ( 40 ) 245 - 250 2011年7月
記述言語：日本語 掲載種別：研究論文（大学，研究機関等紀要）
-
非しきい値型活性化関数を持つ神経回路網群による生理活性推定法
近藤 弘，山森 一人，吉原 郁夫
宮崎大学工学部紀要 ( 40 ) 239 - 244 2011年7月
記述言語：日本語 掲載種別：研究論文（大学，研究機関等紀要）
-
An Efficient Approach for Simultaneous Estimation of the Multiple Health-Promoting Effects of Foods 査読あり
K.Nagahama, N.Eto, K.Yamamori, K.Nishiyama,Y.Sakakibara, T.Iwata, A.Uchida, I.Yoshihara, M.Suiko
Journal of Agricultural and Food Chemistry 59 ( 16 ) 8575 - 8588 2011年7月
記述言語：英語 掲載種別：研究論文（学術雑誌）
-
サンプル選別と半教師有り学習型SOMを統合したたんぱく質発現量からの食品機能性推定法
山森一人，吉原郁夫，江藤望，西山和夫
情報処理学会研究報告 2011-MPS-83 ( 5 ) 1 - 6 2011年5月
記述言語：日本語 掲載種別：研究論文（その他学術会議資料等）
-
Development of a novel crossover of hybrid genetic algorithms for large-scale traveling salesman problems 査読あり
M.Kuroda, K.Yamamori, M.Munetomo, M.Yasunaga, I.Yoshihara
Artificial Life and Robotics 15 ( 4 ) 547 - 550 2011年4月
記述言語：英語 掲載種別：研究論文（学術雑誌）
-
Classification of species by information entropy and visualization by self-organizing map 査読あり
Kentaro NISHIMUTA, Ikuo YOSHIHARA, Kunihito YAMAMORI, Moritoshi YASUNAGA
Proc. Sixteenth International Symposium on Artificial Life and Robotics 371 - 374 2011年1月
記述言語：英語 掲載種別：研究論文（国際会議プロシーディングス）
-
Asynchronous migration for parallel genetic programming on computer cluster with multi-core processers 査読あり
Shingo KUROSE, Kunihito YAMAMORI, Masaru AIKAWA, Ikuo YOSHIHARA
Proc. Sixteenth International Symposium on Artificial Life and Robotics 367 - 370 2011年1月
記述言語：英語 掲載種別：研究論文（国際会議プロシーディングス）
-
Neural network with exponential output neuron for estimation of physiological activities from protein expression levels 査読あり
Kazuhiro KONDO, Kunihito YAMAMORI, Ikuo YOSHIHARA
Proc. Sixteenth International Symposium on Artificial Life and Robotics 363 - 366 2011年1月
記述言語：英語 掲載種別：研究論文（国際会議プロシーディングス）
-
A design of Self-defect-compensatable hardware neuron for multi-layer neural networks
Yamamori K., Tashiro K., Kusano M., Yoshihara I.
Proceedings - IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems 82 - 89 2010年12月
記述言語：日本語 掲載種別：研究論文（学術雑誌） 出版者・発行元：Proceedings - IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems
Neural network has a problem that learning time becomes so long for real world problems. To achieve fast learning, some researchers proposed to implement a neural network into Wafer Scale Integration (WSI). Since WSI uses one wafer as a parallel computer, a part of defect leads entire system fault. Therefore a defect compensation method is necessary to implement a neural network into WSI. Partial Retraining (PR) method has proposed as one of the defect compensation methods for neural network. However PR method is not verified whether it will perform well on digital hardware or not. It is also not clear how much is circuit required. In this paper we report a design of self-defect-compensatable neuron with PR method by VHDL, and evaluate it by simulations. © 2010 IEEE.
DOI： 10.1109/DFT.2010.17
-
Kuroda M., Yamamori K., Munetomo M., Yasunaga M., Yoshihara I.
Artificial Life and Robotics 15 ( 4 ) 547 - 550 2010年12月
記述言語：日本語 掲載種別：研究論文（学術雑誌） 出版者・発行元：Artificial Life and Robotics
This article proposes a novel crossover operator of hybrid genetic algorithms (HGAs) with a Lin-Kernighan (LK) heuristic for solving large-scale traveling salesman problems (TSPs). The proposed crossover, tentatively named sub-tour recombination crossover (SRX), collects many short sub-tours from both parents under some set of rules, and reconnects them to construct a new tour of the TSP. The method is evaluated from the viewpoint of tour quality and CPU time for ten well-known benchmarks, e. g., dj38, qa194, ..., ch71009. tsp, in the TSP website of the Georgia Institute of Technology. We compare the SRX with three conventional crossover operators, a variant of the maximal preservative crossover operator (MPX3), a variant of the greedy sub-tour crossover operator (GSX2), and a variant of the edge recombination crossover operator (ERX6), and show that the SRX succeeded in finding a better solution and running faster than the conventional methods mentioned above. © 2010 International Symposium on Artificial Life and Robotics (ISAROB).
-
Kuroda M., Yamamori K., Munetomo M., Yasunaga M., Yoshihara I.
Proceedings of the 15th International Symposium on Artificial Life and Robotics, AROB 15th'10 828 - 831 2010年12月
記述言語：日本語 掲載種別：研究論文（学術雑誌） 出版者・発行元：Proceedings of the 15th International Symposium on Artificial Life and Robotics, AROB 15th'10
In this paper, we propose a novel crossover operator for solving the traveling salesman problem (TSP) with a Hybrid Genetic Algorithm (HGA) involving Lin-Kernighan (LK) heuristic for local search. We call the crossover operator Sub-tour Recombination Crossover (SRX) which divides each tour of the parents into many sub-tours under some rules and reconnects sub-tours from both the parents so as to construct a new tour of TSP. The method is evaluated from the viewpoint of tour quality and CPU time for ten well-known benchmarks e.g. dj38, qa194 ... ch71009.tsp in the TSP website of Georgia Institute of Technology. We compare SRX with the conventional crossover operators; variant of the Maximal Preservative Crossover operator (MPX3), variant of the Greedy Sub-tour Crossover operator (GSX2) and variant of the Edge Recombination Crossover operator (ERX6), and show that the SRX succeeded in finding better solution and running faster than the conventional methods. © 2010 ISAROB.
-
Kuroda M., Yamamori K., Munetomo M., Yasunaga M., Yoshihara I.
2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010 2010年12月
記述言語：日本語 掲載種別：研究論文（学術雑誌） 出版者・発行元：2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010
This paper proposes a novel crossover operator for solving large-scale traveling salesman problems (TSPs) by using a Hybrid Genetic Algorithm (HGA) with Lin-Kernighan heuristic for local search and we tentatively name Zoning Crossover (Z-Cross). The outline of Z-Cross is firstly to set a zone in the travelling area according to some rules, secondly to cut edges connecting cities between inside and outside the zone, thirdly to exchange edges inside the zone of one parent and those of the other parent, and lastly to reconnect sub-tours and isolated cities, which come about in the 3rd step mentioned above, so as to construct a new tour of TSP. The method is compared with conventional three crossovers; those are the Maximal Preservative Crossover, the Greedy Sub-tour Crossover and the Edge Recombination Crossover, and evaluated from the viewpoints of tour quality and CPU time. Ten benchmarks are selected from the well-known TSP website of Georgia Institute of Technology, whose names are xqf131, xqg237, ..., sra104815. The experiments are performed ten times for each crossover and each benchmark and show that the Z-Cross succeeds in finding better solution and running faster than the conventional methods. Six benchmarks with size from 39,603 to 104,815 cities are selected from the TSP website and challenged the records of tour lengths. The Z-Cross betters the record of the problem rbz43748 and approaches to solutions less than only 0.02% over the known best solutions for five instances. © 2010 IEEE.
-
Quest for genetic information hidden behind disorder in DNA sequences
Koyama Y., Nishimuta K., Yamamori K., Yasunaga M., Yoshihara I.
Proceedings of the 15th International Symposium on Artificial Life and Robotics, AROB 15th'10 824 - 827 2010年12月
記述言語：日本語 掲載種別：研究論文（学術雑誌） 出版者・発行元：Proceedings of the 15th International Symposium on Artificial Life and Robotics, AROB 15th'10
Most of conventional base sequences are analyzed by order of base sequences, for example, pattern matching. Pattern matching compares unknown base sequences with that of known gene to find similar patterns and to identify gene information. We try to search for hidden information in DNA sequences without pattern matching. We focus on disorder of base sequences, because disorder analysis is available, if we do not know particular function of genes. We use the exponent α of 1/f α fluctuation and self-information as indices of disorder. Our experimental data are ribosomal protein of eukaryotic species. The exponent α is calculated for three kinds of data, i.e. whole base sequences, base sequences in exon or intron. The average of α in exon regions are smaller than that in intron regions. It suggests that exon regions are somewhat more ordered than intron regions. SOM is used to look for similarity of species by self-information which is calculated for codons of base sequences. SOM shows that self-information is usable for a classification of species. © 2010 ISAROB.
-
A Design of Self-defect-compensatable Hardware Neuron for Multi-layer Neural Networks 査読あり
Kunihito YAMAMORI, Keisuke TASHIRO, Masamichi KUSANO, Ikuo YOSHIHARA
Proceedings of 2010 IEEE International Symposium of Defect and Fault Tolerance in VLSI Systems 82 - 89 2010年10月
記述言語：英語 掲載種別：研究論文（国際会議プロシーディングス）
-
A Proposal for Zoning Crossover of Hybrid Genetic Algorihms for Large-scale Travelling Salesman Problems 招待あり
Masafumi KURODA, Kunihito YAMAMORI, Masaharu MUNETOMO, Morotoshi YASUNAGA, Ikuo YOSHIHARA
Proceeding of the 2010 IEEE World Congress on Computational Intelligence, IEEE CEC 2010 646 - 651 2010年7月
記述言語：英語 掲載種別：研究論文（国際会議プロシーディングス）
-
遺伝的プログラミングを用いた食品の機能性評価手法の提案
上口真由美、山森一人、吉原郁夫、西山和夫、永濱清子
火の国情報シンポジウム２０１０論文集（A-6-4） 1 - 8 2010年3月
記述言語：日本語 掲載種別：研究論文（その他学術会議資料等）
-
リモートメモリアクセスとマルチスレッドを併用した遺伝的プログラミングの並列化
黒瀨慎吾、上口真由美、山森一人、相川勝、吉原郁夫
火の国情報シンポジウム２０１０論文集(A-2-3) 1 - 8 2010年3月
記述言語：日本語 掲載種別：研究論文（その他学術会議資料等）
-
Quest for Genetic Information behind Disorder in DNA Sequences 査読あり
Yuka KOYAMA, Kentaro NISHIMUTA, Kunihito YAMAMORI, Moritoshi YASUNAGA, Ikuo YOSHIHARA
Proceedings of the fifteenth International Symposium on Artificial Life and Robotics 828 - 831 2010年2月
記述言語：英語 掲載種別：研究論文（国際会議プロシーディングス）
-
Development of A Novel Crossover of Hybrid Genetic Algorithms for Large-scale Traveling Salesman Problems 査読あり
Masafuni KURODA, Kunihito YAMAMORI, Masaharu MUNETOMO, Morotoshi YASUNAGA, Ikuo YOSHIHARA
Proceedings of the fifteenth International Symposium on Artificial Life and Robotics 832 - 835 2010年2月
記述言語：英語 掲載種別：研究論文（国際会議プロシーディングス）
-
Kuno T., Kamiguchi M., Yamamori K., Yoshihara I., Nagahama K.
Proceedings of the 14th International Symposium on Artificial Life and Robotics, AROB 14th'09 630 - 633 2009年12月
記述言語：日本語 掲載種別：研究論文（学術雑誌） 出版者・発行元：Proceedings of the 14th International Symposium on Artificial Life and Robotics, AROB 14th'09
We developed a system to estimate physiological activities of foods from protein expression levels using artificial neural networks (ANNs). Since protein expression levels and physiological activities are measured in multiple times for a constituent, we employ a simple regression analysis to find appropriate correspondence between physiological activities and protein expression levels. The range of physiological activities are from 0 to Z (Z > 1), they cannot directly use training signals of ANNs because the output of a neuron is limited from zero to one. To tackle this problem, we introduce two parameters K and l to the activation function of our system like as (f(x) = K/1+e -1x ). Our system is based on three-layer ANN and back-propagation algorithm is employed as training algorithm. Experimental results showed that our system can estimate more accurate than that of ANNs with normalized training samples for antioxidant stress activity. ©ISAROB 2009.