Profile Information
- Affiliation
- (名誉教授), 理工学部 情報理工学科, 上智大学
- Degree
- Doctor of Engineering(Keio University)
- Researcher number
- 00146804
- J-GLOBAL ID
- 200901062366095741
- researchmap Member ID
- 5000064364
- External link
Tanaka Mamoru (Non-member) was born on 20 September 1948 in Kanagawa, Japan. He received the B.E, M.E amd Ph.D degrees in Electrical Engineering from Keio Univesity, Yokohama, Japan in the year 1972,1974 and 1981 recpectively. In 1974 he joined the Circuit Development Department, Computer Engineering Department of Nippon Electric Company (NEC) where he was engaged in design and development of NEC's LSI computers. He resigned from the company and entered in the graduate school of Keio Univesity in 1978. In April 1981, he became an Associate Professor with the Department of Electrical Electronics Engineering of Sophia Univesity, Tokyo, Japan. He is now a Professor of Sophia University. He has done research in analysis of a large scale of networks and architectures of new LSI computers, Data Mining, Machine Learning, Neural Networks and Circuit Analysis. He is now interested in the synthesis of Retina Chips by Cellular Neural Networks. He was an Associate Editor of the IEEE Transactions on Circuit and System. He is a fellow member of IEICE.
Research Interests
1Research Areas
1Research History
1Papers
129-
International Workshop on Cellular Nanoscale Networks and their Applications, 2018-August 74-77, 2018
-
IEICE NONLINEAR THEORY AND ITS APPLICATIONS, 7(4) 509-522, 2016
-
NEURAL INFORMATION PROCESSING, ICONIP 2016, PT I, 9947 403-412, 2016 Peer-reviewed
-
2015 EUROPEAN CONFERENCE ON CIRCUIT THEORY AND DESIGN (ECCTD), 101-104, 2015 Peer-reviewed
-
Journal of Signal Processing, 18(5) 259-265, 2014The maximum-flow neural network(MF-NN) is a novel neural network model for the maximum flow problem. From the max-flow min-cut theorem, it is known that the maximum flow problem and the minimum cut problem are dual problems. This indicates that MF-NN is applicable to the minimum cut algorithm. In this paper, we propose a novel minimum cut solution using MF-NN in directed and undirected graphs. Furthermore, since the proposed method is intended to circuit implementation based on nonlinear circuit theory, it has considerable potential for speeding up computation time.
Misc.
76Books and Other Publications
3Presentations
241-
2013 RISP International Workshop on Nonlinear Circuits and Signal Processing (NCSP’13), Island of Hawaii, Hawaii, USA, Mar, 2013
-
International Workshop on Nonlinear Circuits and Signal Processing (NCSP’13),Island of Hawaii, Hawaii, USA, Mar, 2013
-
2013 RISP International Workshop on Nonlinear Circuits and Signal Processing (NCSP’13),Island of Hawaii, Hawaii, USA, Mar, 2013
-
2013 RISP International Workshop on Nonlinear Circuits and Signal Processing (NCSP’13),Island of Hawaii, Hawaii, USA, Mar, 2013
-
2013 RISP International Workshop on Nonlinear Circuits and Signal Processing (NCSP’13), Mar, 2013
Research Projects
5-
Grants-in-Aid for Scientific Research, Japan Society for the Promotion of Science, 2008 - 2010
-
Grants-in-Aid for Scientific Research, Japan Society for the Promotion of Science, 1998 - 2000
-
Grants-in-Aid for Scientific Research, Japan Society for the Promotion of Science, 1995 - 1996
-
Grants-in-Aid for Scientific Research, Japan Society for the Promotion of Science, 1994 - 1995
-
科学研究費助成事業, 日本学術振興会, 1990 - 1991