TETSURO NISHINO
| Emeritus Professor etc. | Emeritus Professor |
Researcher Information
Educational Background
Member History
- 2015 - 2016
審査・評価第二部会 情報学小委員会委員, 日本学術振興会 科学研究費委員会, Society - Apr. 2013 - 2016
ゲーム情報学研究会 運営委員, 情報処理学会 - Apr. 2013 - 2016
数理モデル化と問題解決研究会 編集委員, 情報処理学会 - 2016
領域アドバイザー：研究領域「量子状態の高度な制御に基づく革新的量子技術基盤の創出」, 科学技術振興機構 戦略的創造研究推進事業（CREST）, Society - 1999 - 1999
論文誌編集委員会主査, 情報処理学会, Society - 1998 - 1998
論文誌編集委員会副査, 情報処理学会, Society - 1996 - 1998
コンピュテーション研究専門委員, 電子情報通信学会, Society - 1996 - 1998
人工知能基礎論研究会幹事, 人工知能学会, Society - 1994 - 1996
コンピュテーション研究会幹事, 電子情報通信学会, Society - 1992 - 1992
学会誌編集委員会主査, 情報処理学会, Society
Research Activity Information
Award
Paper
- Automatic extractive summarization for Japanese documents by LDA
Hideyuki Sawahata; Tetsuro Nishino
Proceedings of 11th International Congress on Advanced Applied Informatics, 81, 41-52, 17 Dec. 2021, Peer-reviwed
International conference proceedings, English - Distinguishing between humans and computers in a card game with imperfect information
Seiya Okubo; Masato Konishi; Mitsuo Wakatsuki; Tetsuro Nishino
Proceedings of the 34th International Conference on CAINE 2021, EPiC Series in Computing, 79, 140-149, Oct. 2021, Peer-reviwed
International conference proceedings, English - The Characteristics of the Card Game Daihinmin
Mitsuo Wakatsuki; Seiya Okubo; Yuta Kado; Yamato Takeuchi; Tetsuro Nishino
Information Engineering Express, International Institute of Applied Informatics, 7, 2, 11-21, 2021, Peer-reviwed
Scientific journal, English - New applications of the Monte-Carlo tree search to Computer Daihinmin
Seiya Okubo; Mitsuo Wakatsuki; Tasuku Mitsuishi; Yasuki Dobashi; Tetsuro Nishino
International Journal of Smart Computing and Artificial Intelligence, 4, 1, 18-35, 2020, Peer-reviwed
Scientific journal, English - What are the characteristics of the card game Daihinmin?
Mitsuo Wakatsuki; Yuta Kado; Yamato Takeuchi; Seiya Okubo; Tetsuro Nishino
Proceedings of the 8th International Congress on Advanced Applied Informatics 2019, 587-529, 07 Jul. 2019, Peer-reviwed
International conference proceedings, English - New applications of the Monte Carlo method for computer Daihinmin
Seiya Okubo; Tasuku Mitsuishi; Yasuki Dobashi; Mitsuo Wakatsuki; Tetsuro Nishino
Proceedings of the 8th International Congress on Advanced Applied Informatics 2019, 623-628, 07 Jul. 2019, Peer-reviwed
International conference proceedings, English - Toward a statistical characterization of Computer Daihinmin
Seiya Okubo; Yuuta Kado; Yamato Takeuchi; Mitsuo Wakatsuki; Tetsuro Nishino
International Journal of Software Innovation, 7, 1, 63-79, 2019, Peer-reviwed
Scientific journal, English - Route search method for autonomous mobile robots using machine learning
Mitsuo Wakatsuki; Seiya Okubo; Tetsuro Nishino
31th International Conference on Computer Applications in Industry and Engineering (CAINE 2018), 71-76, Oct. 2018, Peer-reviwed
International conference proceedings, English - A decision tree analysis of a multi-player card game with imperfect information
Masato Konishi; Seiya Okubo; Tetsuro Nishino; Mitsuo Wakatsuki
International Journal of Software Innovation, Taru Publications, 6, 3, 1-17, 01 Jul. 2018, Peer-reviwed, This article describes how computer Daihinmin involves playing Daihinmin, a popular card game in Japan, by using a player program. Because strong player programs of Computer Daihinmin use machine-learning techniques, such as the Monte Carlo method, predicting the program's behavior is difficult. In this article, the authors extract the features of the player program through decision tree analysis. The features of programs are extracted by generating decision trees based on three types of viewpoints. To show the validity of their method, computer experiments were conducted. The authors applied their method to three programs with relatively obvious behaviors, and they confirmed that the extracted features were correct by observing real behaviors of the programs.
Scientific journal, English - Improve example-based machine translation quality for low-resource language using ontology
Khan Md Anwarus Salam; Setsuo Yamada; Nishio Tetsuro
Studies in Computational Intelligence, Springer Verlag, 727, 2017, 67-90, 2018, Peer-reviwed, In this research we propose to use ontology to improve the performance of an EBMT system for low-resource language pair. The EBMT architecture use (CSTs) and unknown word translation mechanism. CSTs consist of a chunk in source-language, a string in target-language, and word alignment information. For unknown word translation, we used WordNet hypernym tree and English-Bengali dictionary. CSTs improved the wide-coverage by 57 points and quality by 48.81 points in human evaluation. Currently 64.29% of the test-set translations by the system were acceptable. The combined solutions of CSTs and unknown words generated 67.85% acceptable translations from the test-set. Unknown words mechanism improved translation quality by 3.56 points in human evaluation.
Scientific journal, English - Decision tree analysis in game informatics
Masato Konishi; Seiya Okubo; Tetsuro Nishino; Mitsuo Wakatsuki
Studies in Computational Intelligence, Springer Verlag, 727, 13-27, 2018, Peer-reviwed, Computer Daihinmin involves playing Daihinmin, a popular card game in Japan, by using a player program. Because strong player programs of Computer Daihinmin use machine-learning techniques, such as the Monte Carlo method, predicting the program’s behavior is difficult. In this study, we extract the features of the player program through decision tree analysis. The features of programs are extracted by generating decision trees based on three types of viewpoints. To show the validity of our method, computer experiments were conducted. We applied our method to three programs with relatively obvious behaviors, and we confirmed that the extracted features were correct by observing real behaviors of the programs.
Scientific journal, English - Example-Based Machine Translation Quality for Low-Resource Language Using Ontology
Khan Md; Anwarus Salam; Setsuo Yamada; Tetsuro Nishino
5th International Conference on Applied Computing & Information Technology (ACIT 2017), July 9-13,, 2017, 176-191, 2017, Peer-reviwed
International conference proceedings, English - Toward A Statistical Analysis of Computer Daihinmin
Seiya Okubo; Yuuta Kado; Yamato Takeuchi; Mitsuo Wakatsuki; Tetsuro Nishino
5th International Conference on Applied Computing & Information Technology (ACIT 2017), July 9-13,, 2017, 2017, Peer-reviwed
International conference proceedings, English - Strengthening Methods of Computer Daihinmin Programs
Mitsuo Wakatsuki; Yasuki Dobashi; Tasuku Mitsuishi; Seiya Okubo; Tetsuro Nishino
ISCA 30th International Conference on Computer Applications in Industry and Engineering (CAINE-2017), October 2-4,, 2017, 2017, Peer-reviwed
International conference proceedings, English - A decision making method based on society of mind theory in multi-player imperfect information games
Mitsuo Wakatsuki; Mari Fujimura; Tetsuro Nishino
International Journal of Software Innovation, 4, 2, 58-70, 01 Apr. 2016, Peer-reviwed
Scientific journal, English - Cluster Analysis Using N-gram Statistics for Daihinmin Programs and Performance Evaluations
Seiya Okubo; Takaaki Ayabe; Tetsuro Nishino
International Journal of Software Innovation, Vol.4, No.2, 33-57, 2016, Peer-reviwed
Scientific journal, English - Feature Extraction and Cluster Analysis Using N-gram Statistics for DAIHINMIN Programs
Seiya Okubo; Takaaki Ayabe; Tetsuro Nishino
APPLIED COMPUTING & INFORMATION TECHNOLOGY, SPRINGER-VERLAG BERLIN, 619, 27-41, 2016, Peer-reviwed, In this paper, we elucidate the characteristics of the computer program to play DAIHINMIN, which is a popular Japanese card game with imperfect information. First, we propose a method to extract feature values using the n-gram statistics and a cluster analysis method using the feature values. By representing the program hands as several symbols and representing the order of hands as simplified symbol strings, we obtained the data suitable for feature extraction. Next, we evaluated the effectiveness of the proposed method through computer experiments. In these experiments, we applied our method to ten programs which were used in UECda contest. Finally, we show that our proposed method can successfully cluster DAIHINMIN programs with high probability.
International conference proceedings, English - A prototyping tool for developing ICT based course material for children with developmental disability
Hirokazu Asano; Takaaki Goto; Tetsuro Nishino
28th International Conference on Computer Applications in Industry and Engineering, CAINE 2015, International Society of Computers and Their Applications (ISCA), 221-225, 2015, Education programs for children with developmental disabilities have attempted to include information and communication technology (ICT) teaching materials. Thus, the Chofu Special Needs School and the University of Electro-Communications collaborated to develop teaching materials suitable for each child with developmental disabilities. Obtaining the requirements for ICT-based materials is difficult because teachers often have problems communicating with students regarding software specifications. In this study, we propose a tool for developing ICT-based course material for children with developmental disabilities and describe the results of the evaluation of the proposed tool.
International conference proceedings, English - A polynomial-time algorithm for checking the inclusion of deterministic restricted one-counter transducers which accept by final state
Mitsuo Wakatsuki; Etsuji Tomita; Tetsuro Nishino
Proceedings of the 30th International Conference on Computers and Their Applications, CATA 2015, The International Society for Computers and Their Applications (ISCA), 11-18, 2015, This paper is concerned with a subclass of deterministic pushdown transducers, called deterministic restricted one-counter transducers (droct's), and studies the inclusion problem for droct's which accept by final state. In the previous study, we presented a polynomialtime algorithm for checking the equivalence of these droct's. By extending this technique, we present a polynomial-time algorithm for checking the inclusion of these droct's.
International conference proceedings, English - Parsing of UML package diagrams
Takaaki Goto; Tadaaki Kirishima; Tetsuro Nishino; Takeo Yaku; Kensei Tsuchida
Proceedings of the 30th International Conference on Computers and Their Applications, CATA 2015, 25-30, 2015, Copyright © 2015 by The International Society for Computers and Their Applications (ISCA). Program diagrams are used when we develop software. Unified Modeling Language (UML) is also used in software development. Package diagram is one of a diagram used in UML. Package diagram plays an important role to design or analyze structures of systems. So far we proposed a graph grammar for package diagram in order to formalize manipulation of package diagram. In this paper, we propose a parsing method of proposed a graph grammar for package diagram.
International conference proceedings - A Polynomial-Time Algorithm for Checking the Equivalence of Deterministic Restricted One-Counter Transducers Which Accept by Final State
Mitsuo Wakatsuki; Etsuji Tomita; Tetsuro Nishino
SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING AND PARALLEL/DISTRIBUTED COMPUTING, SPRINGER-VERLAG BERLIN, 569, 131-144, 2015, Peer-reviwed, This paper is concerned with a subclass of deterministic pushdown transducers, called deterministic restricted one-counter transducers (droct's), and studies the equivalence problem for droct's which accept by final state. In the previous study, we presented a polynomial-time algorithm for checking the equivalence of real-time droct's. By extending the technique, we present a polynomial-time algorithm for checking the equivalence of non-real-time droct's.
International conference proceedings, English - A Decision Making Method Based on Society of Mind Theory in Multi-player Imperfect Information Games
Mitsuo Wakatsuki; Mari Fujimura; Tetsuro Nishino
3RD INTERNATIONAL CONFERENCE ON APPLIED COMPUTING AND INFORMATION TECHNOLOGY (ACIT 2015) 2ND INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND INTELLIGENCE (CSI 2015), IEEE, 67-72, 2015, Peer-reviwed, We are concerned with a card game called Daihinmin, which is a multi-player imperfect information game. Using Marvin Minsky's "Society of Mind" theory, we attempt to model the workings of the minds of game players. The UEC Computer Daihinmin Championship is held at The University of Electro-Communications every year, to bring together competitive client programs that correspond to players of Daihinmin, and contest their strengths. In this paper, we extract the behavior of client programs from actual competition records of the computer Daihinmin, and propose a method of building a system that determines the parameters of Daihinmin agencies by machine learning.
International conference proceedings, English - Methodology for developing ICT based course material for children with a developmental disability based on EPISODE
Takahiro Kaneyama; Takaaki Goto; Tetsuro Nishino
PROCEEDINGS 2015 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL INFORMATICS (INDIN), IEEE, 1654-1658, 2015, Peer-reviwed, Education curricula for children with developmental disabilities have attempted to include information and communication technology (ICT) teaching materials. However, such children demonstrate individual differences at the developmental stage of their cognitive faculties. Thus, it is difficult to adopt commercially available ICT teaching materials when working with them. In this study, we introduce the concept of inclusive design in the implementation of ICT teaching materials for children with developmental disabilities. Inclusive design allows for the participation of the elderly as well as those with disabilities at the early stages of development and can be used to identify special needs associated with the development. In addition to ICT teaching materials, the use of Extreme Programming Method for Innovative Software Based on Systems Design (EPISODE), which has agile development and innovation techniques at its core, has been proposed. Therefore, in this study, we attempt to develop a method comprising inclusive design and EPISODE to develop ICT teaching materials. Finally, we report on the practice of developing ICT teaching materials for children with developmental disabilities.
International conference proceedings, English - Generation of UML package diagrams based on an attribute graph grammar
Takaaki Goto; Tadaaki Kirishima; Tetsuro Nishino; Takeo Yaku; Kensei Tsuchida
JOURNAL OF COMPUTATIONAL SCIENCE, ELSEVIER SCIENCE BV, 5, 4, 606-615, Jul. 2014, Peer-reviwed, Graphical representations are often used in software design and development because of their expressiveness. So far, various graphical program description languages have been reported. The Unified Modeling Language (UML), developed for modeling in software development was proposed recently, and in 2005 was standardized as the ISO/IEC 19501 standard.
Some tools for drawing UML diagrams have been proposed in recent years. However, it is hard for developers to draw UML diagrams using the UML tool because diagram layouts generally should be manually adjusted. Of course, there are tools that can automatically provide layout diagrams, though, sometimes such functions provide unexpected layouts.
In order to automate the drawing of these graphical representations aesthetically, a syntax for program diagrams must first be defined. We propose a framework for specifying these diagrams using a graph grammar, and a syntax-directed editor based on the graph grammar. (C) 2014 Elsevier B.V. All rights reserved.
Scientific journal, English - 最大クリーク問題の多項式時間的可解性の拡張の改良
中西裕陽; 富田悦次; 若月光夫; 西野哲朗
電子情報通信学会論文誌D分冊, J97-D, 6, 1106-1121, Jun. 2014, Peer-reviwed
Scientific journal, Japanese - Software Ontology Design to Support Organized Open Source Software Development
Md Mahfuzus Salam Khan; Md Anwarus Salam Khan; Takaaki Goto; Tetsuro Nishino; Narayan Debnath
2014 15TH IEEE/ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING AND PARALLEL/DISTRIBUTED COMPUTING (SNPD), IEEE, 393-398, 2014, Peer-reviwed, In the field of software engineering, a very old and important issue is how to understand the software. Understanding software means more than understanding the source code; it also refers to the other facts related to that particular software. Sometimes even experienced developers can be overwhelmed by a project's extensive development capabilities. In the development process, project leaders (PLs) have overall knowledge about the project and are keenly aware of its vision. Other members have only partial knowledge of the functions assigned to them. In this research, we propose a model to design ontology to support software comprehension and handle issues of knowledge management throughout the development process. By applying our methodology, understanding software and managing knowledge can become possible in a systematic way for open source and commercial projects. Furthermore, it will help beginners become more involved in a project and contribute to it in a productive way.
International conference proceedings, English - EPISODE: An Extreme Programming Method for Innovative Software Based on Systems Design
Takaaki Goto; Kensei Tsuchida; Tetsuro Nishino
2014 IIAI 3RD INTERNATIONAL CONFERENCE ON ADVANCED APPLIED INFORMATICS (IIAI-AAI 2014), IEEE, 780-784, 2014, Peer-reviwed, In software development, the waterfall model is commonly used, especially for large-scale software systems. For smaller-scale software development, agile software development approaches such as extreme programming or scrum are used. Traditional software development methodologies are mainly targeted toward customer-centric development, and therefore, new software methodologies are often not well received in the industry. In this study, we propose a new software development methodology that is aimed at developing innovative software using artificial intelligence (AI), idea creation, value engineering, and systems design. The name of our method is named as EPISODE (Extreme Programming method for Innovative SOftware based on systems DEsign). EPISODE supports the efficient and creative development of open source software (OSS) by small groups.
International conference proceedings, English - A Source Code Plagiarism Detecting Method Using Alignment with Abstract Syntax Tree Elements
Hiroshi Kikuchi; Takaaki Goto; Mitsuo Wakatsuki; Tetsuro Nishino
2014 15TH IEEE/ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING AND PARALLEL/DISTRIBUTED COMPUTING (SNPD), IEEE, 375-380, 2014, Peer-reviwed, Learning to program is an important subject in computer science courses. During programming exercises, plagiarism by copying and pasting can lead to problems for fair evaluation. Some methods of plagiarism detection are currently available, such as sim. However, because sim is easily influenced by changing the identifier or program statement order, it fails to do enough to support plagiarism detection.
In this paper, we propose a plagiarism detection method which is not influenced by changing the identifier or program statement order. We also explain our method's capabilities by comparing it to the sim plagiarism detector. Furthermore, we reveal how our method successfully detects the presence of plagiarism.
International conference proceedings, English - EPISODE: An Extreme Programming Method for Innovative Software Baed on Systems Design and its Practical Study
Takaaki Goto; Kensei Tsuchida; Tetsuro Nishino
International Journal of Software Engineering & Applications, 5, 5, 1-13, 2014, Peer-reviwed
Scientific journal, English - A source code plagiarism detecting method using alignment with abstract syntax tree elements
Hiroshi Kikuchi; Takaaki Goto; Mitsuo Wakatsuki; Tetsuro Nishino
2014 IEEE/ACIS 15th International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2014 - Proceedings, Institute of Electrical and Electronics Engineers Inc., 3, 3, 41-56, 2014, Peer-reviwed, Learning to program is an important subject in computer science courses. During programming exercises, plagiarism by copying and pasting can lead to problems for fair evaluation. Some methods of plagiarism detection are currently available, such as sim. However, because sim is easily influenced by changing the identifier or program statement order, it fails to do enough to support plagiarism detection. In this paper, we propose a plagiarism detection method which is not influenced by changing the identifier or program statement order. We also explain our method's capabilities by comparing it to the sim plagiarism detector. Furthermore, we reveal how our method successfully detects the presence of plagiarism.
International conference proceedings, English - Web Based UNL Ontology Visualization
Khan Md; Anwarus Salam; Hiroshi Uchida; Setsuo Yamada; Tetsuro Nishino
Journal of Convergence Information Technology, 8, 13, Aug. 2013, Peer-reviwed
Scientific journal, English - A polynomial-time algorithm for checking the equivalence for real-time deterministic restricted one-counter transducers which accept by final state
Mitsuo Wakatsuki; Etsuji Tomita; Tetsuro Nishino
Proceedings of the 14th IEEE/ACIS International Conference of Software engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD2013), 459-465, 01 Jul. 2013, Peer-reviwed
International conference proceedings, English - An attribute labeled grid graph grammar and its application to program specification forms
Tomokazu Arita; Tetsuro Nishino; Kimio Sugita; Kensei Tsuchida; Takeo Yaku
Studies in Computational Intelligence, Springer Verlag, 443, 201-214, 2013, In this paper, we introduce attribute graph grammars for labeled grid graphs, and propose their application to generating tabular forms representing program specification forms with grid structures, such as two-dimensional arrays. An attribute graph grammar to formalize tabular forms with grid structures and their layout information is defined by a context-sensitive graph grammar with semantic rules attached to its productions. Formalization of tabular forms based on an attribute graph grammar is enables detection of syntactic errors in item placement and solving of tabular form layout problems by evaluating the grammar's semantic rules. A parsing algorithm is proposed for detecting syntactic errors that is based on an attribute graph grammar for labeled grid graphs representing tabular forms. The production sequence for a tabular form is obtained by this parsing process. A table layout problem for a tabular form with a grid structure is solved by evaluating the grammar's semantic rules based on the production sequence. © 2013 Springer-Verlag Berlin Heidelberg.
International conference proceedings, English - How to translate unknown words for english to bangla machine translation using transliteration
Khan Md. Anwarus Salam; Setsuo Yamada; Tetsuro Nishino
Journal of Computers (Finland), 8, 5, 1167-1174, 2013, Peer-reviwed, Due to small available English-Bangla parallel corpus, Example-Based Machine Translation (EBMT) system has high probability of handling unknown words. To improve translation quality for Bangla language, we propose a novel approach for EBMT using WordNet and International-Phonetic-Alphabet(IPA)-based transliteration. Proposed system first tries to find semantically related English words from WordNet for the unknown word. From these related words, we choose the semantically closest related word whose Bangla translation exists in English-Bangla dictionary. If no Bangla translation exists, the system uses IPA-based-transliteration. If unknown word is not found in the English IPA dictionary, the system uses Akkhor transliteration mechanism. We implemented the proposed approach in EBMT, which improved the quality of good translation by 16 points. © 2013 ACADEMY PUBLISHER.
Scientific journal, English - Universal Words relationship question-answering from UNL Ontology
Khan Md. Anwarus Salam; Hiroshi Uchida; Setsuo Yamada; Tetsuro Nishino
2013 IEEE/ACIS 12th International Conference on Computer and Information Science, ICIS 2013 - Proceedings, ICIS 2013, 423-427, 2013, Peer-reviwed, Universal Networking Language (UNL) represents natural language sentences as a semantic network of Universal Words (UWs). UNL Ontology provides the semantic background using relations for each UWs. However UWs are formal and all information provided by the UNL Ontology may not be understandable for human without the UNL specification. Especially we need to ensure the UW dictionary editors can understand the UWs information stored in UNL Ontology. To understand the UWs information, this research propose a question-answering system to provide the relationship information by explaining UWs relations with natural language. Using this system, the editors can easily understand the relationship information stored in UNL ontology. © 2013 IEEE.
International conference proceedings, English - Brain-inspired motion programming for hobby-use humanoid robots
Mamoru Kubota; Tadashi Yamazaki; Tetsuro Nishino
SNPD 2013 - 14th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2013.37, 472-477, 2013, Peer-reviwed, Dynamic motion of hobby-use humanoid robots is defined by a sequence of static poses. Each pose is defined by specifying joint angles numerically for each joint. This is a difficult task, because typical hobby-use humanoid robots have motions easier. Our brain employs a different strategy for motion programming. Instead of specifying each joint angle or each muscle tone, the primary motor cortex has a set of primitive motions called motor primitives, and higher cortical areas and the basal ganglia generates a sequence of combinations of such motor primitives. Thus, our brain uses more abstract form to compose dynamic motions. In this article, we employ self-organizing maps (SOMs), which is an unsupervised learning algorithm used in machine learning and computational neuroscience communities, to extract motor primitives from a set of motion data of a hobby use humanoid robot. Then, we reprogram the original dynamic motions by the sequence of combinations of extracted primitives. We are able to reproduce the same motions by the proposed method. These results suggest that our brain-inspired method provides an easier means to program hobby-use humanoid robots than existing software bundled with the robots. © 2013 IEEE.
International conference proceedings, English - 高信頼細粒度部品再利用による形式手法におけるソフトウェア合成
中村丈洋; 織田健; 西野哲朗
情報処理学会論文誌, pp.2012-2024, 2013., 54, 8, 2012-2024, 2013, Peer-reviwed, 部品再利用によるソフトウェア合成は開発コスト低減や信頼性向上に有効であるが，高信頼な部品の整備が容易でなく，また，適用可能な問題領域が限定される点が問題となる．本稿ではこの問題に対してモデル充足ソフトウェア合成（MSSS）を提案する．MSSSは形式手法B Methodの信頼性保証を応用したモデル充足細粒度部品に数学的判定による健全性の高い再利用を適用してソフトウェアを合成する．これにより部品の信頼性を静的に保証でき，また変数名や部品名の解釈に起因する誤りを排除できる．一方で変数名や部品名に意味を持たせないため，部品名での機能の呼び出しによる合成ができず，変数名の書き換えや結合が必要になる．よって，本稿ではMSSSの信頼性を'モデル充足'として数学的に定義し，そこからMSSSの手順を定めることで，互いに矛盾しない部品群を再利用したソフトウェアがB Methodの信頼性を満たすことを保証する．また，MSSSでは要求仕様を一意の粒度に細分化して部品の仕様に対する検索キーとするため，検索キーを不足部品の仕様として提示でき，さらに，部品自動生成により部品を容易に整備できる．これにより，合成手法を適用可能な問題領域の拡大と，それによる高信頼ソフトウェア開発の低コスト化と迅速化が期待できる．Software synthesis by reusing software components is effective to reduce development cost and to increase dependency. Nevertheless, it is not easy to prepare components, so domains to apply synthesis are limited. we must prepare components for each software domain to apply synthesis, and it's difficult to prepare dependable components. In this paper, we propose 'Model Satisfiable Software Synthesis (MSSS)' to resolve these problems. MSSS synthesises software by reusing 'Model Satisfiable Fine-grained Component (MSFC)' mathematically. We can ensure static dependability of MSFC by B Method. And mathematical reuse prevents bugs caused by misunderstanding of function name. However, MSSS needs intricate rewriting and combination to interlock MSFCs, because we can't reuse them by name of function. So we define mathematical dependency of MSSS as 'model satisfiable' to define procedure of it. MSSS slices requirement uniquely to search components by sliced requirement. So we can make lacked components easily by using search-keys as specification of them. And also we can generate MSFCs from existing software. MSSS will enable us to apply synthesis to more software domains, and to develop dependable software quickly in lower cost.
Scientific journal, Japanese - A Case Study of Calculation of Source Code Module Importance
Takaaki Goto; Setsuo Yamada; Tetsuro Nishino; Kensei Tsuchida
Proceedings of The 2013 International Conference on Parallel and Distributed Processing Techniques and Applications, I, 155-160, 2013, Peer-reviwed
International conference proceedings, English - A polynomial-time algorithm for checking the equivalence for real-time deterministic restricted one-counter taransducers which accept by final state
Mitsuo Wakatsuki; Etsuji Tomita; Tetsuro Nishino
International Journal of Computer and Information Science, 14, 2, 45-53, 2013, Peer-reviwed
Scientific journal, English - Imperfect Information Game Analysis on Realtime Video Games
Junji Nishino; Tetsuro Nishino
Proceedings of the Fuzzy System Symposium, Japan Society for Fuzzy Theory and Intelligent Informatics, 28, 799-800, 2012, Video Games are not only an important products but a good test bed for Realtime AI methods. In this paper, we modeled them as a imperfect information theoretical game. - O(n) and O(n 2) time algorithms for drawing problems of tree-structured diagrams
Tadaaki Kirishima; Tomoo Sumida; Yasunori Shiono; Goto Takaaki; Takeo Yaku; Tetsuro Nishino; Kensei Tsuchida
Proceedings - 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, SNPD 2012, 530-535, 2012, Peer-reviwed, We investigate sets of conditions with respect to narrower drawing of tree-structured diagrams on an integral lattice. We found that under certain sets of conditions there are practical procedural algorithms for narrower drawing of tree-structured diagrams, while under other sets of conditions there are none. Based on our findings, we present efficient algorithms that provide narrower placement satisfying given amorphous conditions. In intractable conditions, we propose a constraint-based algorithm for drawing tree-structured diagrams with a minimum-width by limiting the number of cells. Our results provide a criterion for deciding under given conditions, whether to use procedural or constraint-based algorithms to draw a tree-structured diagram. © 2012 IEEE.
International conference proceedings, English - UNL ontology visualization for web
Khan Md. Anwarus Salam; Hiroshi Uchida; Setsuo Yamada; Tetsuro Nishino
Proceedings - 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, SNPD 2012, 542-545, 2012, Peer-reviwed, Universal Networking Language (UNL) is an artificial language for computers to represent human language using graphs. UNL system consists of UNL Ontology, which provides the semantic background for each Universal Words (UWs) or concepts. UNL Ontology includes possible relations between UWs, UWs definition and UNL system hierarchy. UNL Ontology store all these information in a lattice structure, where UWs are inter-connected through relations including hierarchical relations such as icl (a-kind-of) and iof (an-instance-of). However, it is difficult for human to visualize the UNL ontology. To solve this problem, we have developed a web system to visualize UNL Ontology. This paper describes the web system and its real life applications. © 2012 IEEE.
International conference proceedings, English - Developing the First Balanced Corpus for Bangla Language
Khan Md. Anwarus Salam; Setsuo Yamada; Tetsuro Nishino
2012 INTERNATIONAL CONFERENCE ON INFORMATICS, ELECTRONICS & VISION (ICIEV), IEEE, 1081-1084, 2012, Peer-reviwed, The objective of this paper is to propose the development process of the first Bangladeshi National Corpus. The purpose of the study is to specify the domains to create a balanced Bangla corpus based on some selection criteria. This study focuses on three independent selection criteria: domain, time and medium. This paper also explains domain classifications and weight percentage for each domain. We also identify the prospective source of information for preparing the corpus.
International conference proceedings, English - Software Development Education Based on UEC Software Repository
Takaaki Goto; Takahiro Homma; Kensei Tsuchida; Tetsuro Nishino
SOFTWARE AND NETWORK ENGINEERING, SPRINGER-VERLAG BERLIN, 413, 55-+, 2012, Peer-reviwed, Most of the software developed in universities is primarily used by the developers themselves. Normally, most of this software is managed and stored on servers in the research laboratories, but since the software is generally lacking in documentation and is not developed with third-party use in mind, it tends to be used only by the original developers. It is seldom reused after the developers have graduated, and is often not in a fit state for use by third parties. Today's information systems graduates have not been provided with sufficient education with regard to the knowledge, techniques and experience needed for the usual software development process of actual software development businesses from project planning through to execution and management (requirements analysis, development, implementation, testing, etc.) and lack the basic skills for handling actual business situations. In this paper, we report on our approach to software management using the UEC software repository to consolidate software assets, and on practical software development education based on this repository.
International conference proceedings, English - Parallel Monte Carlo search for imperfect information game Daihinmin
Junji Nishino; Tetsuro Nishino
2012 FIFTH INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS AND PROGRAMMING (PAAP), IEEE, 3-6, 2012, Peer-reviwed, Computer games, such as chess, have recently become an important research topic in the field of computation intelligence. Monto Carlo massive searching is very successful in the game of GO as it has a huge intractable search space and no good partial evaluation heuristics. Imperfect information games also have intractable properties, such as large scale search space, less heuristics, and unknown state information. Monte Carlo search is therefore effective to make computer players for the imperfect information game. There is always a time limit for using computational intelligence in actual applications. Such constraints require parallel processing to be speed up the Monte Carlo simulations.
We introduce a parallel Monte Carlo searching method for imperfect information card game Daihinmin, a familiar card game in Japan. Computer Daihinmin competitions have been held since 2006. We present two kinds of parallelization algorithms for Monte Carlo computer Daihinmin players.
International conference proceedings, English - 最大クリーク問題の多項式時間的可解性の拡張
中西裕陽; 富田悦次; 若月光夫; 西野哲朗
電子情報通信学会論文誌D分冊, J95-D, 9, 1716-1728, 2012, Peer-reviwed
Scientific journal, Japanese - Practice and Evaluation of Open Source Software evelopment Education Based on the UEC Software Repository
Takaaki Goto; Kensei Tsuchida; Tetsuro Nishino
ACIS International Journal of Computer & Information Science, 13, 2, 37-45, 2012, Peer-reviwed
Scientific journal, English - Stimulus-Dependent State Transition between Synchronized Oscillation and Randomly Repetitive Burst in a Model Cerebellar Granular Layer
Takeru Honda; Tadashi Yamazaki; Shigeru Tanaka; Soichi Nagao; Tetsuro Nishino
PLOS COMPUTATIONAL BIOLOGY, PUBLIC LIBRARY SCIENCE, 7, 7, Jul. 2011, Peer-reviwed, Information processing of the cerebellar granular layer composed of granule and Golgi cells is regarded as an important first step toward the cerebellar computation. Our previous theoretical studies have shown that granule cells can exhibit random alternation between burst and silent modes, which provides a basis of population representation of the passage-of-time (POT) from the onset of external input stimuli. On the other hand, another computational study has reported that granule cells can exhibit synchronized oscillation of activity, as consistent with observed oscillation in local field potential recorded from the granular layer while animals keep still. Here we have a question of whether an identical network model can explain these distinct dynamics. In the present study, we carried out computer simulations based on a spiking network model of the granular layer varying two parameters: the strength of a current injected to granule cells and the concentration of Mg2+ which controls the conductance of NMDA channels assumed on the Golgi cell dendrites. The simulations showed that cells in the granular layer can switch activity states between synchronized oscillation and random burst-silent alternation depending on the two parameters. For higher Mg2+ concentration and a weaker injected current, granule and Golgi cells elicited spikes synchronously (synchronized oscillation state). In contrast, for lower Mg2+ concentration and a stronger injected current, those cells showed the random burst-silent alternation (POT-representing state). It is suggested that NMDA channels on the Golgi cell dendrites play an important role for determining how the granular layer works in response to external input.
Scientific journal, English - How to develop universal vocabularies using automatic generation of the meaning of each word
Md. Anwarus Salam Khan; Hiroshi Uchida; Tetsuro Nishino
NLP-KE 2011 - Proceedings of the 7th International Conference on Natural Language Processing and Knowledge Engineering, 243-246, 2011, Peer-reviwed, To develop a computer-understandable and international-communication- language, we need not to develop a pivot language but an artificial language which can express every meaning in each natural language. That artificial language needs enough vocabulary to express the meanings contained in each language. Those vocabularies can only be developed by native speakers and should be defined by formal ways. Considering the situation, at this moment Universal Networking Language (UNL) is the best solution and Universal Words (UWs) are the most promising candidates. But UWs itself are formal and not always to be understandable for human. We need to provide the way to express the correct meaning of UWs for humans, to ensure every language speakers can create the correct UWs. The semantic backgrounds of each UWs are provided by UNL Ontology. This research proposes the way to auto generate the meaning of each UWs using UNL Ontology. © 2011 IEEE.
International conference proceedings, English - 最大クリーク問題の多項式時間的可解性の更なる改良結果
中西裕陽; 富田悦次; 若月光夫; 西野哲朗
電子情報通信学会論文誌D分冊, J94-D, 12, 2037-2046, 2011, Peer-reviwed
Scientific journal, Japanese - 小脳スパイキングネットワークモデルにおける条件刺激強度依存性タイミング制御
本多武尊; 山崎匡; 田中繁; 西野哲朗
情報処理学会論文誌数理モデル化と応用, 情報処理学会, 3, 2, 1-10, Mar. 2010, Peer-reviwed, 我々がこれまで構築してきた小脳顆粒層の大規模スパイキングネットワークモデルは，苔状線維刺激呈示からの時間経過を表現する．本研究では，時間経過表現が苔状線維刺激の強度によって制御されるかどうかを調べた．瞬目反射の条件付けの計算機シミュレーションを行い，条件刺激と侵害刺激のペアを繰り返し与えると，プルキンエ細胞が侵害刺激呈示のタイミングの直前で発火を停止するようになることを確認した．その後条件刺激の強度を上げると，プルキンエ細胞の発火停止のタイミングがより早まることを示した．この結果は，条件反応のタイミングを決定するプルキンエ細胞の発火停止のタイミングが条件刺激強度に依存して変化することを示唆する．We have been developing a large-scale spiking network model of the cerebellar granular layer that represents the passage of time (POT) from the mossy fibre (MF) stimulus onset. In this study, we examined whether the POT representation can be controlled by changing the strength of the MF stimulus. We conducted simulations of the delay eyeblink conditioning, in which pairing of a sustained conditioned stimulus (CS) conveyed by MFs with a delayed unconditioned stimulus (US) showed that the Purkinje cell (PC) learned to pause slightly earlier than the onset of the US. When we increased the CS strength, the PC pause shifted earlier. This result suggests that the timing of the conditioned response determined by that of PC pause is adaptively changed by the CS strength.
Scientific journal, Japanese - 多人数不完全情報ゲームの簡略化評価値による探索を用いた終盤データベースの構築
西野順二; 西野哲朗
情報処理学会論文誌数理モデル化と応用, 3, 2, 11-21, Mar. 2010, Peer-reviwed
Scientific journal, Japanese - Behavioral verification in hichart development environment for embedded software
Takaaki Goto; Yasunori Shiono; Tetsuro Nishino; Takeo Yaku; Kensei Tsuchida
Proceedings - 9th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2010, 337-340, 2010, Peer-reviwed, Developing embedded systems is becoming more complicated. However, the time taken to develop an embedded system must be shortened. Software development environments especially for test purposes are still inadequate. To reduce bugs, specifications in the upper process need to be checked, and model checking-methodologies are often used to do so. So far we have developed a visual software development environment for Hichart that targets LEGO MINDSTORM. We also enhanced the behavioral specifications table function to make it applicable to the environment for checking physical parameters of real machine. In this paper, we adopt model-checking methodologies to the environment. We propose a visual software development environment for embedded software with physical and logical checking. © 2010 IEEE.
International conference proceedings, English - A Possible Mechanism for Controlling Timing Representation in the Cerebellar Cortex.
Takeru Honda; Tadashi Yamazaki; Shigeru Tanaka; Tetsuro Nishino
Advances in Neural Networks - ISNN 2010, 7th International Symposium on Neural Networks, ISNN 2010, Shanghai, China, June 6-9, 2010, Proceedings, Part I, Springer, 67-76, 2010, Peer-reviwed - A Feasible Approach for Automatic Detection and Recognition of the Bengalese Finch Songnotes and Their Sequences
Khan Md; Mahfuzus Salam; Tetsuro Nishino; Kazutoshi Sasahara; Miki Takahasi; Kazuo Okanoya
Journal of Intelligent Learning Systems and Applications, 2, 221-228, 2010, Peer-reviwed
Scientific journal, English - Automatic generation of SVG program documents with animation based on attribute graph grammars
Takaaki Goto; Tomoo Sumida; Tadaaki Kirishima; Takeo Yaku; Kensei Tsuchida
Proceedings - 9th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2010, 13, 2, 347-350, 2010, Peer-reviwed, We have been developing a software development environment using the program diagram "Hichart" [1, 2, 3]. In our research, we have implemented a graphical editor for Hichart. We add new features and capabilities to the editor, including calculation of a cyclomatic complexity and generation of SVG files for a given Hichart diagram. In this paper, we present a method of automatically generating a SVG file for a given program diagram based on attribute graph grammars. The thus obtained SVG file can animate a process of calculating a cyclomatic complexity of a given Hichart diagram on any readily available Web browsers. We also describe an automatic generation of a SVG file which can be displayed when diagrams are aesthetically drawn. © 2010 IEEE.
International conference proceedings, English - Hichart development environment for embedded software
Takaaki Goto; Yasunori Shiono; Takeo Yaku; Kensei Tsuchida; Tetsuro Nishino
TriSAI 2009 - Proceedings of Triangle Symposium on Advanced ICT 2009, 17-20, 01 Dec. 2009, Embedded systems are becoming increasingly large and complicated, so development methodologies and efficient testing systems for embedded systems are highly desirable. Checking behavioral specification of upstream operations is especially important. At the same time, we have been studying a diagram called Hichart for many years and also developed a visual software development environment for Hichart. In this study, we expand our visual software development environment to support developing embedded systems. The target of this research is NQC, which is the program language for LEGO MINDSTORM. Our visual software development system for embedded system can (I) treat source codes for embedded Software as Hichart diagrams and (II) set physical parameters on behavioral specification table. - Strength of a conditional stimulus controls the timing of a conditional response: Computational study of the dynamics of a cerebellar spiking network model
T. Honda; T. Yamazaki; S. Tanaka; T. Nishino
Proc. of SfN 2009, N. 367.3/DD25, Oct. 2009, Peer-reviwed
International conference proceedings, English - Ethological data mining: an automata-based approach to extract behavioral units and rules
Yasuki Kakishita; Kazutoshi Sasahara; Tetsuro Nishino; Miki Takahasi; Kazuo Okanoya
DATA MINING AND KNOWLEDGE DISCOVERY, SPRINGER, 18, 3, 446-471, Jun. 2009, Peer-reviwed, We propose an efficient automata-based approach to extract behavioral units and rules from continuous sequential data of animal behavior. By introducing novel extensions, we integrate two elemental methods-the N-gram model and Angluin's machine learning algorithm into an ethological data mining framework. This allows us to obtain the minimized automaton-representation of behavioral rules that accept (or generate) the smallest set of possible behavioral patterns from sequential data of animal behavior. With this method, we demonstrate how the ethological data mining works using real birdsong data; we use the Bengalese finch song and perform experimental evaluations of this method using artificial birdsong data generated by a computer program. These results suggest that our ethological data mining works effectively even for noisy behavioral data by appropriately setting the parameters that we introduce. In addition, we demonstrate a case study using the Bengalese finch song, showing that our method successfully grasps the core structure of the singing behavior such as loops and branches.
Scientific journal, English - Automation in extracting the songnote and it's sequence of the Bengalese finch song by using image processing
Khan Md. Mahfuzus Salam; Tetsuro Nishino; Kazutoshi Sasahara; Miki Takahasi; Kazuo Okanoya
TriSAI 2009 - Proceedings of Triangle Symposium on Advanced ICT 2009, 21-26, 2009, The Bengalese finch song has been widely studied for its unique features and similarity to human language. For computational analysis of the songs, they must first be represented in terms of behavioral sequences. This paper introduces a new approach for automatic detection and reorganization of the behavioral sequences via image processing. This approach is based on the recognition process used by a human to visually identify patterns in a sonogram image. The behavioral elements of birdsong are independent to birds (i.e. similar pattern does not appear in two birds). Considering this constraint, we believe that the proposed method is a generalized approach. On real birdsong data, we find that our method achieves a high accuracy rate. Thus, we consider our method a feasible approach.
International conference proceedings, English - Development of Web Counseling System
Yasunori Shiono; Takaaki Goto; Tetsuro Nishino; Chieko Kato; Kensei Tsuchida
2009 INTERNATIONAL CONFERENCE ON NETWORK-BASED INFORMATION SYSTEMS, IEEE, 370-+, 2009, Peer-reviwed, Some areas in Asian have no medical facilities and proper mental health care is unavailable. Therefore, online counseling systems are needed. We have been studying and putting into practice online counseling for people assigned overseas. We constructed a system using agile software development for those assigned overseas in Asia. The first step involved developing a prototype system based on system requirements after we repeatedly discussed system development with people in charge of a clinic. Next, we conducted interviews about the online counseling system. We also discussed and analyzed the interviews. Finally, we completed the online Web counseling system by repeatedly discussing possible improvements with the clinic and then incorporating the changes in the system. We report on the construction of the system.
International conference proceedings, English - The P Versus NP Problem
Tetsuro Nishino
SUGAKU EXPOSITIONS, Vol.22, No.2, 215-228, 2009, Peer-reviwed
Scientific journal, English - 小脳顆粒層をモデル化したスパイキングネットワークの研究:NMDA受容体を介した同期発火状態と時間表現状態の遷移
本多武尊; 山崎匡; 田中繁; 西野哲朗
電子情報通信学会論文誌 D, 一般社団法人電子情報通信学会, J91-D, 11, 2709-2718, Nov. 2008, Peer-reviwed, 本研究では,小脳穎粒層のスパイキングネットワークモデルを構築し,その挙動を解析した.入力刺激が弱いときは,穎粒細胞は9Hz程度で同期発火した.入力刺激が強いときは,穎粒細胞は間欠的にスパイク発射状態と停止状態を繰り返し,細胞集団の発火パターンにより時間経過を表現した.よって,小脳穎粒層の活動状態は苔状線維信号の強さによって制御されることが示唆された.また,時間経過を表現する発火パターンの生成には再現性があった.NMDAチャネルをブロックすると,このような状態遷移は見られなくなった.更に,瞬目反射のタイミング学習のシミュレーションも行った.音刺激(CS)が苔状線維から入力されると,穎粒細胞の発火パターンがCS呈示開始からの時間経過を表現し,平行線維-プルキンエ細胞間シナプスで長期抑圧(LTD)が生じ,プルキンエ細胞は侵害刺激(US)入力の前後でスパイク発射を停止することを学習した.
Japanese - A Spiking Network Model of the Cerebellar Granule Cell Layer: NMDAR-Mediated Transition between Synchronized Oscillation and Time Representation
Takeru Honda; Tadashi Yamazaki; Shigeru Tanaka; Tetsuro Nishino
The IEICE Transactions on Information and Systems, J91-D, 11, 1-10, 2008, Peer-reviwed
Scientific journal, English - 小脳顆粒層をモデル化したスパイキングネットワークの研究：NMDA受容体を介した同期発火状態と時間表現状態の遷移
本多武尊; 山崎匡; 田中繁; 西野哲朗
電子情報通信学会論文誌 D, Vol.J91-D, No.11, 1-10, 2008, Peer-reviwed
Scientific journal, Japanese - Pattern extraction improves automata-based syntax analysis in songbirds
Yasuki Kakishita; Kazutoshi Sasahara; Tetsuro Nishino; Miki Takahasi; Kazuo Okanoya
PROGRESS IN ARTIFICIAL LIFE, PROCEEDINGS, SPRINGER-VERLAG BERLIN, 4828, 320-+, 2007, Peer-reviwed, We propose an automata induction approach to modeling birdsongs on the basis of Angluin's induction algorithm, which ensures that k-reversible languages can be learned from positive samples in polynomial time. There are similarities between Angluin's algorithm and the vocal learning of songbirds; for example, during a critical period, songbirds learn songs from positive samples of conspecific birds. In our previous method, we could not construct song syntaxes for complex songs. In this paper, we introduce a pattern extraction method to improve our previous method and propose a new birdsong modeling method. We estimate the robustness and properness of our method by using artificial song data, and demonstrate that the song syntaxes of the Bengalese finch can be successfully represented as reversible automata. As a result, almost all Bengalese finchs' song syntaxes can be represented with lower k-reversibility; further, one song has 3-reversibility song syntax showing the highest reversibility.
International conference proceedings, English - A Study on Practical Applications of an Internal Clock Model
Hideaki Manabe; Tetsuro Nishino; Tadashi Yamazaki; Shigeru Tanaka
IPSJ Transactions on Mathematical Modeling and its Applications, 48, SIG19(TOM19), 139-154, 2007, Peer-reviwed
Scientific journal, Japanese - Constructing song syntax by automata induction
Kazutoshi Sasahara; Yasuki Kakishita; Tetsuro Nishino; Miki Takahasi; Kazuo Okanoya
GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, PROCEEDINGS, SPRINGER-VERLAG BERLIN, 4201, 351-353, 2006, Peer-reviwed
Scientific journal, English - A reversible automata approach to modeling birdsongs
Kazutoshi Sasahara; Yasuki Kakishita; Tetsuro Nishino; Miki Takahasi; Kazuo Okanoya
CIC 2006: 15TH INTERNATIONAL CONFERENCE ON COMPUTING, PROCEEDINGS, IEEE COMPUTER SOC, 80-+, 2006, Peer-reviwed, We propose a new automata-based approach to modeling birdsongs on the basis of Angluin's induction algorithm, which ensures that k-reversible languages can be learned from positive samples with polynomial time. There are similarities between Angluin's algorithm and the vocal learning of songbirds; for example, during a critical period, songbirds also learn songs from positive samples of conspecific birds. Using the proposed method, we demonstrate that the song syntaxes of the Bengalese finch can be represented as reversible automata with lower k-reversibility and that juvenile song syntaxes have two types of development. Our approach provides an effective way to understand the vocal learning of songbirds in terms of computational learning.
International conference proceedings, English - 物理的実現可能性に優れた量子探索アルゴリズム
大久保誠也; 西野哲朗; 太田和夫; 國廣昇
情報処理学会論文誌, 46, 6, 1416-1425, 2005, Peer-reviwed
Scientific journal, Japanese - Bulk量子計算モデル上におけるGroverのアルゴリズムの繰り返し回数について
大久保誠也; 西野哲朗; 太田和夫; 國廣昇
情報処理学会論文誌：数理モデル化と応用, 46, SIG17(TOM13), 2005, Peer-reviwed
Scientific journal, Japanese - A Quantum Algorithm for Finding the Minimum on NMR Quantum Computers
Seiya Okubo; Tetsuro Nishino; Kazuo Ohta; Noboru Kunihiro
ERATO Workshop on Quantum Information Science 2004, ?, 2004, Peer-reviwed
International conference proceedings, English - A quantum algorithm using NMR computers to break secret-key cryptosystems
K Ohta; T Nishino; S Okubo; N Kunihiro
NEW GENERATION COMPUTING, SPRINGER-VERLAG, 21, 4, 347-361, 2003, Peer-reviwed, In this paper, we discuss quantum algorithms that, for a given plaintext m(O) and a given ciphertext c(O), will find a secret key, k(O), satisfying c(O) = E(k(O), m(O)), where an encryption algorithm, E, is publicly available. We propose a new algorithm suitable for an NMR (Nuclear Magnetic Resonance) computer based on the technique used to solve the counting problem. The complexity of our algorithm decreases as the measurement accuracy of the NMR computer increases. We discuss the possibility that the proposed algorithm is superior to Grover's algorithm based on initial experimental results.
Scientific journal, English - The study on quantum algorithm using NMR computers for code breaking of secret key cryptosystems
Kazuo Ohta; Tetsuro Nishino; Seiya Okubo
ERATO Workshop on Quantum Information Science 2002, 54-55, Sep. 2002, Peer-reviwed
International conference proceedings, English - A mathematical theory of NMR quantum computations
T Nishino
ENABLING SOCIETY WITH INFORMATION TECHNOLOGY, SPRINGER-VERLAG TOKYO, 340-347, 2002, Peer-reviwed, In this paper, we develop a theory of bulk quantum computations such as NMR (Nuclear Magnetic Resonance) quantum computations, For this purpose, we first define bulk quantum Turing machines (BQTMs for short) as a model of bulk quantum computation. Then, we define complexity classes EBQP, BBQP and ZBQP as counterparts of the quantum complexity classes EQP, BQP and ZQP, respectively, and show that EBQP=EQP, BBQP=BQP, and ZBQP=ZQP. This implies that BQTMs are polynomially related to ordinary QTMs as long as they are used to solve decision problems. We also show that these two types of QTMs are also polynomially related when they solve a function problem which has a unique solution. Furthermore, we show that BQTMs can solve certain instances of NP-complete problems efficiently.
International conference proceedings, English - 制限された離散的拡張単純回帰ネットワークと実時間 DPDA の等価性
守谷純之介; 西野哲朗
電子情報通信学会論文誌 D-I, J85-D-I, 2, 160-167, 2002, Peer-reviwed
Japanese - Mathematical models of quantum computation
T Nishino
NEW GENERATION COMPUTING, SPRINGER-VERLAG, 20, 4, 317-337, 2002, Peer-reviwed, In this paper, we introduce two mathematical models of realistic quantum computation. First, we develop a theory of bulk quantum computation such as NMR (Nuclear Magnetic Resonance) quantum computation. For this purpose, we define bulk quantum Turing machine (BQTM for short) as a model of bulk quantum computation. Then, we define complexity classes EBQP, BBQP and ZBQP as counterparts of the quantum complexity classes EQP, BQP and ZQP, respectively, and show that EBQP=EQP, BBQP=BQP and ZBQP=ZQP. This implies that BQTMs are polynomially related to ordinary QTMs as long as they are used to solve decision problems. We also show that these two types of QTMs are also polynomially related when they solve a function problem which has a unique solution. Furthermore, we show that BQTMs can solve certain instances of NP-complete problems efficiently.
On the other hand, in the theory of quantum computation, only feed-forward quantum circuits are investigated, because a quantum circuit represents a sequence of applications of time evolution operators. But, if a quantum computer is a physical device where the gates are interactions controlled by a current computer such as laser pulses on trapped ions, NMR and most implementation proposals, it is natural to describe quantum circuits as ones that have feedback loops if we want to visualize the total amount of the necessary hardware. For this purpose, we introduce a quantum recurrent circuit model, which is a quantum circuit with feedback loops. Let C be a quantum recurrent circuit which solves the satisfiability problem for a blackbox Boolean function including n variables with probability at least 1/2. And let s be the size of C (i.e. the number of the gates in C) and t be the number of iterations that is needed for C to solve the satisfiability problem. Then, we show that, for those quantum recurrent circuits, the minimum value of max(s, t) is O(n(2)2(n/3)).
Scientific journal, English - 効率的量子アルゴリズムの設計手法
西野哲朗
情報処理学会論文誌：数理モデル化と応用, 43, SIG7(TOM6), 1-9, 2002, Peer-reviwed
Scientific journal, Japanese - NMR 量子計算による NP 完全問題と因数分解の解法
渥美賢嗣; 西野哲朗
情報処理学会論文誌：数理モデル化と応用, Information Processing Society of Japan (IPSJ), 43, SIG7(TOM6), 10-18, 2002, Peer-reviwed, In 1985, David Deutsch introduced quantum Turing machines (QTMs for short) as Turing machines which can perform so called quantum parallel computations. Then, in 1994, Peter Shor showed that QTM can factor integers with arbitrary small error probability in polynomial time. Since it is widely believed that any deterministic Turing machines cannot factor integers in polynomial time, it is very likely that QTM is an essentially new model of computation. On the other hand, many researchers are studying how to physically implement quantum computers based on QTM. Among others, NMR (Nuclear Magnetic Resonance) offers an appealing prospect for implementation of quantum computers because of a number of reasons. But, quantum computations performed on NMR is slightly different from those performed on QTMs. For example, Shor's factoring algorithm cannot be executed on an NMR quantum computer as it is. In this paper, we first define bulk quantum Turing machine (BQTM for short) as a model of the NMR quantum computation. Then, we show that BQTMs can solve certain instances of NP-complete problems efficiently, and can factor integers in polynomial time.
Japanese - Mathematical Theories of Quantum Computations
西野哲朗
Fourth Annual Symposium on Japanese-American Frontiers of Science (JAFoS), October 10-12, 2001, Tokyo, Japan （日本の JST と米国の NAS が主催）における招待講演, Oct. 2001
English - Quantum Recurrent Networks
西野哲朗
Workshop on ERATO Quantum Information Science (EQIS) 2001, September 6-8, 2001, Tokyo Japan における招待講演, Sep. 2001
English - Relationships between the computational capabilities of simple recurrent networks and finite automata
J Moriya; T Nishino
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG, E84A, 5, 1184-1194, May 2001, Peer-reviwed, In the filed of cognitive psychology, simple recurrent networks are used for modeling the natural language processing in the human brain. For example, Elman experimentally showed that the simple recurrent networks can predict the rightmost word in sentential forms of a particular grammar which can generate compound sentences with high probability. Concerning these results, it is natural to ask whether the computational capability of the simple recurrent networks is sufficient to recognize natural languages. In this paper, we assume that the range of ct function computed at each gate of a simple recurrent network is a finite set. This is a quite realistic assumption, because we cannot physically implement a gate whose range is an infinite set. Then, we define equivalence relations between simple recurrent networks and Mealy machines or Moore machines, which are finite automata with output. Then. under our assumption, we show (1) a construction of a Mealy machine which simulates a given simple recurrent network, and (2) a construction of a simple recurrent network which simulates a given Moore machine. From these two constructions, we can conclude that the computational capability of the simple recurrent networks is equal to that of finite automata with output under our assumption.
Scientific journal, English - 量子計算量理論
西野哲朗
電子情報通信学会論文誌 D-I, The Institute of Electronics, Information and Communication Engineers, J84-D-I, 1, 3-17, 2001, 本論文では, 量子計算量理論の主要結果について概観する.最初に, 量子Turing機械の定義を述べ, 次に, 効率の良い万能量子Turing機械の構成法を示す.そのために, 接続, 分岐, 繰返しのような量子Turing機械の構成における基本操作の実行方法を示し, 更に, 計算基底の変換や, ユニタリ変換の実行といった, 量子力学的な基本操作も導入する.また, 量子Turing機械で, 誤り確率限定多項式時間で決定できる言語のクラスBQPは, BPP⊂__=BQP⊂__=PSPACEという関係を満たすことを示す.更に, 量子計算量理論における最近の研究の流れを概観する.通常の量子計算量は, 量子Turing機械上で計算に要するステップ数などに基づいて定義されるが, 最近では, 量子回路計算量, 量子質問量, 量子通信量といった計算量尺度を用いて, 量子計算量の研究が盛んに行われている.そこで, まず, これらの計算量尺度の定義を紹介し, 次に, これら尺度の相互関係, 及び, 定理の証明において用いられる手法について概観する.また, 最近注目を集めているNMR量子計算の理論についても紹介する.
Scientific journal, Japanese - 実時間決定性PDAと等価な拡張単純回帰ネットワークについて
守谷純之介; 西野哲朗
電子情報通信学会コンピュテーション研究会資料，COMP2000-75, 17-24, 2001
Japanese - A characterization of k-th powers Pn,k of paths in terms of k-trees
Koich Yamazaki; Sei'Ichi Tani; Tetsuro Nishino
International Journal of Foundations of Computer Science, 12, 4, 435-443, 2001, Peer-reviwed, Let G be a k-tree such that |{v V(G): degG(v) = k}| = 2, n = |V(G)| ≥ 2k + 2, and the maximum degree of G is at most 2k. In this paper, we will show that such a k-tree G is isomorphic to Pn,k. In this way, we give a new characterization of k-th power (i.e. Pn,k) of paths with n vertices in terms of k-trees. © 2001 World Scientific Publishing Company.
Scientific journal, English - ニューロイダルネットの計算能力について
西野哲朗
電子情報通信学会論文誌 D-I, J83-D-I, 1, 36-44, 2000
Scientific journal, Japanese - NMR量子計算を用いた因数分解アルゴリズム
渥美賢嗣; 西野哲朗
電子情報通信学会コンピュテーション研究会試料，COMP99-96, 135-142, 2000, Peer-reviwed
Japanese - NMR量子計算による数え上げ問題の解法
芝田 浩; 西野哲朗
電子情報通信学会コンピュテーション研究会試料，COMP99-97, 143-150, 2000
Japanese - NMR量子計算の初期設定法について
志摩孝夫; 西野哲朗
電子情報通信学会コンピュテーション研究会試料，COMP99-98, 151-158, 2000
Japanese - Quantum Computation and NP-Complete Problems
Tetsuro Nishino
In: T. Hida and K. Saito（Eds.），Quantum Information, World Scientific, World Scientific, 125-134, 2000, Peer-reviwed
Research society, English - NMR 量子計算の理論
西野哲朗
量子情報技術研究会資料，QIT2000-3, 2000
Japanese - グラフの同型性判定問題に対する量子アルゴリズムの設計に関する研究
伊藤邦明; 西野哲朗
量子情報技術研究会資料，QIT2000-46, 119-124, 2000
Japanese - 連想記憶とプライミング現象に対する回路モデル
長吉亮拓; 築地賢一; 西野哲朗
2000年度人工知能学会全国大会（第14回）論文集, 483-487, 2000
Japanese - ニューロイダルネット上における屈折のモデル化
大坪一紀; 木下暁央; 西野哲朗
2000年度人工知能学会全国大会（第14回）論文集, 494-497, 2000
Japanese - ニューロイダルネット上における最適性理論のモデル化
伊藤太一; 西野哲朗
2000年度人工知能学会全国大会（第14回）論文集, 498-501, 2000
Japanese - 量子コンピュータ／量子計算
西野哲朗
Computer Today, 1999年1月号, 14-18, Jan. 1999
Japanese - On the Computational Power of Bounded Error Quantum Turing Machines
T. Nishino
T. Hida and K. Sait(]E86CC[)(Eds.), Quantum Information, World Scientific, World Scientific, 125-131, 1999
English - NMR量子計算の理論
西野哲朗
1999年電子情報通信学会総合大会講演論文集（シンポジウム講演），SA-5-4, 466-467, 1999
Japanese - 非線形量子計算の時間量について
金田直樹; 西野哲朗
1999年電子情報通信学会総合大会講演論文集（シンポジウム講演），SA-5-6, 479-471, 1999
Japanese - ニューロイダルネット上における順序情報の生成と学習
辻倉正徳; 田中 繁; 西野哲朗
ニューロコンピューティング研究会試料，NC98-132, 265-272, 1999
Japanese - 効率的量子アルゴリズムの設計について
西野哲朗; 與語一真
人工知能基礎論研究会試料，SIG-FAI-9804, 103-108, 1999
Japanese - ニューロイダルネット上における語彙獲得のモデル化
木下暁央; 西野哲朗
1999年度人工知能学会全国大会（第13回）論文集, 332-335, 1999
Japanese - 最短ベクトル探索問題の効率的量子アルゴリズムの設計について
西野哲朗; 與語一真
量子情報技術研究会試料，QIT99-2, 7-12, 1999
Japanese - ネバンリンナ受賞者紹介P. Shor氏の業績
西野哲朗
数学, 51, 2, 80-82, 1999
Japanese - 量子計算論-Shorのアルゴリズムの意義-
西野哲朗
数理科学, 1998年10月号, 21-28, Oct. 1998
Japanese - On the complexity of negation-limited Boolean networks
R Beals; T Nishino; K Tanaka
SIAM JOURNAL ON COMPUTING, SIAM PUBLICATIONS, 27, 5, 1334-1347, Oct. 1998, A theorem of Markov precisely determines the number r of NEGATION gates necessary and sufficient to compute a system of boolean functions F. For a system of boolean functions on n variables, r less than or equal to b(n) = [log(2)(n + 1)]. We call a circuit using b(n) NEGATION gates negation-limited. We continue recent investigations into negation-limited circuit complexity, giving both upper and lower bounds.
A circuit with inputs x(1),..., x(n) and outputs -x(1),..., -x(n) is called an inverter, for which r = [log(2)(n + 1)]. Fischer has constructed negation-limited inverters of size O(n(2)log n) and depth O(log n). Recently, Tanaka and Nishino have reduced the circuit size to O(n log n) at the expense of increasing the depth to log(2)n. We construct negation-limited inverters of size O(n log n), with depth only O(log n), and we conjecture that this is optimal. We also improve a technique of Valiant for constructing monotone circuits for slice functions (introduced by Berkowitz).
Next, we introduce some lower bound techniques for negation-limited circuits. We provide a 5n + 3 log(n + 1) - c lower bound for the size of a negation-limited inverter. In addition, we show that for two different restricted classes of circuit, negation-limited inverters require superlinear size.
Scientific journal, English - 因数分解に関する量子アルゴリズムのシミュレーション
渥美賢嗣; 西野哲朗
電子情報通信学会論文誌A, The Institute of Electronics, Information and Communication Engineers, J81-A, 12, 1670-1677, 1998, 1994年にShorは, 自然数Nの因数分解を行うために, 任意のχmodNのオーダを多項式時間内の求める量子アルゴリズムを示した[3].しかし, 現在多数の量子ビットをもつ量子コンピュータは存在しないため, そのアルゴリズムが実際のどのような計算結果を出力するかを知る方法がない.このような状況においては, 既存の計算機を用いて, Shorの量子アルゴリズムをシミュレーションし, その振舞いや性質を考察することの意義は大きい.本研究ではShorの因数分解に対する量子アルゴリズムを, パーソナルコンピュータ上でシミュレーションすることにより, Shorのアルゴリズムの振舞いや種々の性質を明らかにする.
Scientific journal, Japanese - ニューロイダルネット上におけるPinkerの言語獲得理論のモデル化
平尾孝史; 木下暁央; 西野哲朗
1998年度人工知能学会全国大会（第12回）論文集, 396-399, 1998
Japanese - 単純回帰ネットワークを模倣するMealy機械の構成法
守谷純之介; 西野哲朗
電子情報通信学会コンピュテーション研究会資料，COMP98-27, The Institute of Electronics, Information and Communication Engineers, 98, 186, 51-58, 1998, Elman showed that simple recurrent networks can simulate finite automata on an experimental basis. Furthermore, he also showed that simple recurrent networks can predict the rightmost word in sentential forms of a particular context-free grammar with high probability, after a learning process based on the sample words which are generated by the grammar. On the other hand, it is not known, for each simple recurrent network, whether there exists a finite automaton which simulates the network. In this paper, we first give a mathematical definition of simple recurrent networks, and constructively show that they can be simulated by Mealy Machines, which are finite automata with output.
Japanese - ニューロイダルネットとコネクショニズム-「脳を創る」ための計算機科学からのアプローチ-
西野哲朗
京都大学数理解析研究所講究録，1054, 京都大学, 1054, 1-10, 1998
Japanese - 量子計算の理論
西野哲朗
日本物理学会講演概要集，1998年秋の分科会, 53, 2, 437, 1998
Japanese - NP完全問題に対する非線形量子アルゴリズムの線形領域シミュレーション
金田直樹; 西野哲朗
電子情報通信学会コンピュテーション研究会資料，COMP98-41, 25-32, 1998
Japanese - NMR量子計算による関数問題とNP完全問題の解法について
西野哲朗; 芝田 浩; 渥美賢嗣; 志摩孝夫
電子情報通信学会コンピュテーション研究会資料，COMP98-71, The Institute of Electronics, Information and Communication Engineers, 98, 442, 65-72, 1998, In this paper, we develop a theory of NMR (Nuclear Magnetic Resonance) quantum computations. For this purpose, we first define bulk quantum Turing machine (BQTM for short) as a model of NMR quantum computation. Then, we introduce NMR quantum complexity classes EBQP, BBQP and ZBQP as counterparts of the quantum complexity classes EQP, BQP and ZQP, respectively, and show that EBQP=EQP, BBQP=BQP and ZBQP=ZQP. This implies that BQTMs are polynomially equivalent to ordinary QTMs as long as they are used to solve decision problems. We also show that these two types of QTMs are also polynomially equivalent when they solve a function problem which has a unique solution. Furthermore, we show that BQTMs can solve certain instances of NP-complete problems efficiently.
Japanese - 量子コンピュータ
三原孝志; 西野哲朗
日本ファジィ学会誌, 10, 1, 11-20, 1998
Japanese - ニューロイダルネットによる脳機能のシミュレーション
西野哲朗
日本の科学者, 33, 6, 20-24, 1998
Japanese - 量子計算論
西野哲朗
情報処理, 39, 6, 592-595, 1998
Japanese - The complexity of threshold circuits for parity functions
SC Sung; T Nishino
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG, E80D, 1, 91-93, Jan. 1997, In this paper, we show that a parity function with n variables can be computed by a threshold circuit of depth O((log n)/c) and size O((2(c) log n)/c), for all 1 less than or equal to c less than or equal to [log(n + 1)] - 1. From this construction, we obtain an O(log n/log log n) upper bound for the depth of polylogarithmic size threshold circuits for parity functions. By using the result of Impagliazzo, Paturi and Saks [5], we also show an Omega(log n/log log n) lower bound for the depth of the threshold circuits. This is an answer ot the open question posed in [11].
Scientific journal, English - Negation-limited circuit complexity of symmetric functions
K Tanaka; T Nishino; R Beals
INFORMATION PROCESSING LETTERS, ELSEVIER SCIENCE BV, 59, 5, 273-279, Sep. 1996, A theorem of Markov precisely determines the number r(F) of NEGATION gates necessary and sufficient to compute a system of boolean functions F. For a system of boolean functions on n variables, r(F) less than or equal to inverted right perpedicular log(n + 1) inverted left perpendicular. We call a circuit using the minimum number of NEGATION gates negation-limited. Continuing recent research on negation-limited circuit complexity, we investigate the complexity of negation-limited circuits which compute symmetric functions. First, we shall prove a main technical lemma on functions computed at NEGATION gates in negation-limited circuits computing symmetric functions, Using this lemma, we show a number of lower bounds on the size and depth of negation-limited circuits computing several symmetric functions such as PARITY(n), PARITY(n), MOD(n)(k) and others, For example, a 4n + 3 log(2)(n + 1) - c lower bound is given on the size of circuits computing the PARITY(n) function using r(PARITY(n)) = inverted right perpendicular log(2)(n+ 1) - 1 inverted left perpendicular NEGATION gates. Furthermore, we show nonlinear lower bounds on the size of certain kinds of negation-limited circuits computing symmetric functions.
Scientific journal, English - A relationship between the number of negations and the circuit size
K Tanaka; T Nishino
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, IEICE-INST ELECTRON INFO COMMUN ENG, E79D, 9, 1355-1357, Sep. 1996, We show a relationship between the number of negations In circuits and the size of circuits. More precisely, we construct a Boolean Function H-n, ana show that there exists an integer i, which can range over only two different values, such that the removal of one NEGATION gate causes an exponential growth of the optimal circuit size for H-n.
Scientific journal, English - Recognition of Devanagari characters using neural networks
K Keeni; H Shimodaira; T Nishino; Y Tan
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, IEICE-INST ELECTRON INFO COMMUN ENG, E79D, 5, 523-528, May 1996, Devanagari is the most widely used script in India. Here, a method is introduced for recognizing Devanagari characters using Neural network. The proposed method reduces the number of output unit necessary for a conventional neural network where the classification is based on a winner take all basis. An automatic coding procedure for representing the output layer of the network and a different method for the final classification is also proposed. Along with the automatic coding procedure, a heuristic method for representing the output units by exploiting the structural information of Devanagari character is also demonstrated. Besides, it has been shown by random representation of the output layer that the representation effects the generalization/performance of the network. The proposed automatic representation gave the recognition rate of 98.09% for 44 categories.
Scientific journal, English - ON THE NEGATION-LIMITED CIRCUIT COMPLEXITY OF CLIQUE FUNCTIONS
T NISHINO; K TANAKA
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, IEICE-INST ELECTRON INFO COMMUN ENG, E78D, 1, 86-89, Jan. 1995, A negation-limited circuit is a combinational circuit which includes at most inverted left perpendicularlog(n + 1)inverted right perpendicular NOT gates. We show a relationship between the size of negation-limited circuits computing clique functions and the number of NOT gates in the circuits.
Scientific journal, English - ON THE NUMBER OF NEGATIONS NEEDED TO COMPUTE PARITY FUNCTIONS
T NISHINO; J RADHAKRISHNAN
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, IEICE-INST ELECTRON INFO COMMUN ENG, E78D, 1, 90-91, Jan. 1995, We exactly determine the number of negations needed to compute the parity functions and the complement of the parity functions. We show that with k NOT gates, parity can be computed on at most 2k+1 - 1 variables, and parity complement on at most 2k+1 - 2 variables. The two bounds are shown to be tight.
Scientific journal, English - More on the Complexity of Negation-Limited Circuits
BEALS R.
Proceedings of the 27th ACM Symposium on Theory of Computing, Las Vegas, NV, May 29-June 1, 585-595, 1995
English - On the complexity of negation-limited boolean networks (Preliminary version)
Keisuke Tanaka; Tetsuro Nishino
Proceedings of the Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 129502, 38-47, 23 May 1994, A negation-limited circuit is a combinational circuit which includes at most log(n + 1) NOT gates. In this paper, we investigate the complexity of negation-limited circuits. We first study the complexity of inverters as a foundation of negation-limited circuit complexity. For the size of negation-limited inverters, we give a new 0(n(logn)2) upper bound as well as a 5n+31og(n+l)-6 lower bound. Furthermore, we show two superlinear lower bounds 011 the size of certain kinds of negation- limited inverters. Finally, we investigate the negation- limited circuit complexity of Boolean functions, and present (1) several general theorems on the relationship between combinational complexity and negation- limited complexity, (2) new upper bounds on the size of negation-limited circuits for symmetric functions including exactly-k-functions, and (3) a relationship between the circuit size and the number of NOT gates for the case of clique functions.
International conference proceedings, English - The Emptiness Problem for Lexical-Functional Grammars is Undecidable
Tetsuro Nishino
IEICE Transactions on Information and Systems, E77-D, 6, 720-722, 1994
Scientific journal, English - A Simulation Result for Simultaneously Bounded AuxPDAs
IEICE Transactions on Information and Systems, E77-D, 5, 597-600, 1994
English - RELATING ATTRIBUTE GRAMMARS AND LEXICAL-FUNCTIONAL GRAMMARS
T NISHINO
INFORMATION SCIENCES, ELSEVIER SCIENCE INC, 66, 1-2, 1-22, Dec. 1992, In this paper, some similarities between attribute grammars (AGs) and lexical-functional grammars (LFGs) are shown from computational theoretic points of view. First we introduce two types of LFGs that are called restricted LFGs (RLFGs) and polynomial LFGs. Then we characterize these LFGs as string-valued AGs (SAGs) or strongly polynomial AGs (SPAGs). To be precise, it is shown that (1) a set of f-descriptions of an RLFG can be characterized as an output set of an SAG, and (2) a language generated by a polynomial RLFG can be characterized as a language generated by an SPAG. Using these characterizations, we estimate the complexity of languages generated by these LFGs.
Scientific journal, English - 木構造図式の描画問題
海野浩; 安斎公士; 小倉耕一; 西野哲朗; 中西美智子; 夜久竹夫
情報処理学会論文誌, Information Processing Society of Japan (IPSJ), 33, 7, 879-886, 1992, 木構造図式は各頂点が次の四つの属性を持った属性付き木である:すなわち属性は(1)頂点の幅 (2)頂点の深さ，(3)頂点の水平座標と (4)頂点の垂直座標である木構造図式を与えられた美的条件を満たすように配置する問題は"美的描画問題"といわれる．木構造図式に対する プログラム図式を指向した美的条件は 木に対する美的条件を変形することによリ定式化された．その美的条件を満たす配置を与える手法も提案された．本論文でわれわれははじめに，従来の美的条件を満たす配置を与える手法定形式化しO(n^3)時間アルゴリズムを詳細に定める次に上の美的条件に条件をひとつおきかえて新たな美的条件を考えると われわれのアルゴリズムが新たな美的条件を満たす最も狭い配置を与えることを示すその結果美的条件と計算量に関する新たな関係を得る
Scientific journal, Japanese - Mathematical Analysis of Lexical - Functional Grammars - Complexity, Parsability and Learnability -
Tetsuro Nishino
Language Research, 27, 1, 119-141, 1991
Scientific journal, English - Attribute Graph Grammars with Applications to Hichart Program Chart Editors
Tetsuro Nishino
Advances in Software Science and Technology, 1, 1, 89-104, 1989
Scientific journal, English - CRITAC - AN EXPERIMENTAL SYSTEM FOR JAPANESE TEXT PROOFREADING
K TAKEDA; E SUZUKI; T NISHINO; T FUJISAKI
IBM JOURNAL OF RESEARCH AND DEVELOPMENT, IBM CORP, 32, 2, 201-216, Mar. 1988
Scientific journal, English - 漢字複合語の確率的構造解析
西野哲朗; 藤崎哲之助
Transactions of Information Processing Society of Japan, 29, 11, 1034-1042, 1988
Scientific journal, English - Attribute Grammars and Lexical-Functional Grammars
Proceedings of International Computer Science Conference'88, Hong Kong., 426-433, 1988
English - The Intrinsically Exponential Complexity of the k-visit Property Problem for Attribute Grammars
NISHINO T.
Topology and Computer Science (Kinokuniya), Kinokuniya, 473-486, 1987
English
MISC
- A Further Improved Extended Result on Polynomial-Time Solvability of the Maximum Clique Problem
Hiroaki Nakanishi; Etsuji Tomita; Mitsuo Wakatsuki; Tetsuro Nishino
This paper presents a further improved extended result for polynomial-time solvability of the maximum clique problem, that is: for any adjacent pair of vertices p and q where the degree of p is less than or equal to that of q in a graph with n vertices, if the degree of p is less than or equal to 3.486d lg n (d≧0: a constant), then the maximum clique problem is solvable in the polynomial time of O(n2+max{d,1}). This result is obtained by more detailed analysis and the corresponding detailed algorithm., Information Processing Society of Japan (IPSJ), 06 Jun. 2014, IPSJ SIG Notes, 2014, 14, 1-8, Japanese, 0913-5685, 110009785574, AN1009593X - A Further Improved Extended Result on Polynomial-Time Solvability of the Maximum Clique Problem
NAKANISHI Hiroaki; TOMITA Etsuji; WAKATSUKI Mitsuo; NISHINO Tetsuro
This paper presents a further improved extended result for polynomial-time solvability of the maximum clique problem, that is: for any adjacent pair of vertices p and q where the degree of p is less than or equal to that of q in a graph with n vertices, if the degree of p is less than or equal to 3.486dlgn (d≧0: a constant), then the maximum clique problem is solvable in the polynomial time of O(n^<2+max{d,1}>). This result is obtained by more detailed analysis and the corresponding detailed algorithm., The Institute of Electronics, Information and Communication Engineers, 06 Jun. 2014, IEICE technical report. Theoretical foundations of Computing, 114, 80, 85-92, Japanese, 110009925280, AN10013152 - Efficient Distributional Similarity Calculation by Using Case Particle's Clusters
Nakayama Hiroki; Setsuo Yamada; Tetsuro Nishino
This paper proposes an efficient method for distributional similarity calculation by using case particle's clusters. The proposed method constructs clusters according to the case particles in the context before calculating distributional similarity. Experimental results show that the proposed method is more efficient than the existing method with almost same quality., Information Processing Society of Japan (IPSJ), 19 Sep. 2013, IPSJ SIG Notes, 2013, 14, 1-6, Japanese, 0913-5685, 110009606414, AN10505667 - 大貧民プログラムのn-gram統計による特徴抽出とクラスタ分析
綾部孝樹; 大久保誠也; 西野哲朗
本論では，人気の高い不完全情報カードゲームである大貧民をプレイするプログラムの特徴を明らかにする．はじめに，n-gram統計を用いた特徴量の抽出法，ならびに得られた特徴量を用いたクラスタ分析法を提案する．次に，いくつかの実験により，その提案手法が大貧民プログラムを，高い確率で正しくクラスタリングできる事を示す．, 一般社団法人情報処理学会, 16 May 2013, 研究報告数理モデル化と問題解決（MPS）, 2013, 2, 1-6, Japanese, 0919-6072, 110009579808, AN10505667 - A Learning Support System for Children with Disabilities Using Learning Games.
Takahiro Kaneyama; Kumiko Asano; Tetsuro Nishino; Mitsuo Wakatsuki
In this study, we developed a learning support system for children with physical or mental disabilities. In order to reduce the burden of supervisors in education of these children. Educating these children is a burden for teachers. Because these children difficult to maintain the motivation for learning Therefore we developed this system to apply learning game for pull these child's interest. Through discussions with teachers, I incorporated the function difficulty settings, question setting, and automatic recording. In order to verify the validity of this system, it experimented in the special support school. As a result, this system which pull these child's interest and concentration time was increased. Furthermore, it turned out that the burden placed on preparation of teaching materials is mitigable by employing the feature of ICT teaching materials efficiently., Information Processing Society of Japan (IPSJ), 16 May 2013, IPSJ SIG Notes, 2013, 8, 1-6, Japanese, 0919-6072, 110009579814, AN10505667 - Chance Node Sensitivity of the game of Computer Daihinmin
西野順二; 西野哲朗
大貧民プレイヤプログラムなど不完全情報ゲームでは他プレイヤの手の情報を推定することが重要と考えられるが，局面によっては推定の必用が無い場合もある．本稿では不完全情報ゲームの性質を計る指標として偶然手番感度を提案し，これを用いて多人数不完全情報ゲームの大貧民の特性を調べることを目的とする．偶然手番感度は，相手手札の可能性を決める偶然手番がある場面での着手の利得に与える影響度であり，情報集合に含まれる局面可能性による利得の振れ幅を数値化したものである．大貧民を縮小した単貧民について，2人から5人に2から5枚を配布し合計12枚の全ての配布パターンについてその完全探索結果から，相手手札の可能性に対して最適着手は変わらず，偶然手番感度が低いことを示した．53枚5人プレイヤにおいても，モンテカルロシミュレーションによる推定利得から偶然手番感度を求める実験によってやはり偶然手番感度が低いことを示した．, 25 Feb. 2013, 研究報告ゲーム情報学（GI）, 2013, 5, 1-8, Japanese, 110009550129, AA11362144 - Automatic Generation of Diagram Explanation based on an Attribute Graph Grammar
Takaaki Goto; Tetsuro Nishino; Kensei Tsuchida
Unified Modeling Language (UML) has already been used in the analysis, design, and implementation of many systems. Open Source Software (OSS) is often used in software development. However, it is often the case that OSS does not contain adequate documents, so the generation of software documents is important. Documents with diagrams are especially important to understand software, so it is important to generate documents with diagrams. In order to process large-scale diagrams, or many source codes automatically, formal and declarative representation is needed. In this paper, we propose automatic generation of documentation based on an attribute graph grammar.Unified Modeling Language (UML) has already been used in the analysis, design, and implementation of many systems. Open Source Software (OSS) is often used in software development. However, it is often the case that OSS does not contain adequate documents, so the generation of software documents is important. Documents with diagrams are especially important to understand software, so it is important to generate documents with diagrams. In order to process large-scale diagrams, or many source codes automatically, formal and declarative representation is needed. In this paper, we propose automatic generation of documentation based on an attribute graph grammar., 09 Jul. 2012, 研究報告数理モデル化と問題解決（MPS）, 2012, 9, 1-6, English, 110009421225, AN10505667 - Application of Tempolal Difference Learning to Computer Daihinmin
小沼啓; 本多武尊; 保木邦仁; 西野哲朗
15 Apr. 2012, 情報処理学会研究報告(CD-ROM), 2011, 6, ROMBUNNO.GI-27,NO.1, Japanese, 2186-2583, 201202214845735767 - 脳・神経系汎用シミュレータGENESISのGPU実装による高速化
岩佐歩; 中山智章; 本多武尊; 山崎匡; 西野哲朗
17 Jan. 2012, ハイパフォーマンスコンピューティングと計算科学シンポジウム論文集, 2012, 72-72, Japanese, 170000069157 - Information-theoretic Analysis for Understanding the Behavior of Song Learning by the Bengalese Finch
KhanMd.MahfuzusSalam; Tetsuro Nishino; Kazutoshi Sasahara; Miki Takahasi; Kazuo Okanoya
Songbirds have been actively studied for their complex brain mechanism of sensor-motor integration during song learning. Male Bengalese finches learn singing by imitating external models to produce songs. In general, birdsong which is string of sounds is represented by a sequence of letters called song notes. In this study, we focus on information-theoretic analysis of these sequential data to explore the complexity and diversity of birdsong, and learning process throughout song development. We design and develop the analysis tool which has many features to do analysis for the sequential data. For experiment, we employ thirteen male Bengalese finches, each with different bouts of song data. By applying ethological data mining to these data, we discover that the finches follow two types of song learning mechanism: practice mode and adopt mode. In addition, over the analysis we find that it is possible to visualize the song features, e.g., traditional transmission, by contour surface diagram of the transition matrix. Furthermore, we can easily identify the families from these contour surface diagrams, which is a very challenging task in general. Our obtained results indicate that analysis based on data mining is a versatile technique to explore new aspects related to behavioral science.Songbirds have been actively studied for their complex brain mechanism of sensor-motor integration during song learning. Male Bengalese finches learn singing by imitating external models to produce songs. In general, birdsong which is string of sounds is represented by a sequence of letters called song notes. In this study, we focus on information-theoretic analysis of these sequential data to explore the complexity and diversity of birdsong, and learning process throughout song development. We design and develop the analysis tool which has many features to do analysis for the sequential data. For experiment, we employ thirteen male Bengalese finches, each with different bouts of song data. By applying ethological data mining to these data, we discover that the finches follow two types of song learning mechanism: practice mode and adopt mode. In addition, over the analysis we find that it is possible to visualize the song features, e.g., traditional transmission, by contour surface diagram of the transition matrix. Furthermore, we can easily identify the families from these contour surface diagrams, which is a very challenging task in general. Our obtained results indicate that analysis based on data mining is a versatile technique to explore new aspects related to behavioral science., 20 Jul. 2011, 情報処理学会論文誌数理モデル化と応用（TOM）, 4, 3, 49-58, English, 1882-7780, 170000066487, AA11464803 - Information-Theoretic Analysis for Understanding the Behavior of Song Learning by the Bengalese Finch
KhanMd.MahfuzusSalam; Tetsuro Nishino; Kazutoshi Sasahara; Miki Takahasi; Kazuo Okanoya
Songbirds have been actively studied for their complex brain mechanism of sensor-motor integration during song learning. Male Bengalese finches learn singing by imitating external models. Birdsongs are strings of sounds represented by a sequence of letters called song notes. In this study, we focused on information-theoretic analysis of these sequential data to explore the complexity and diversity of birdsong throughout song development. We present ethological data mining results for birdsong, which showed that there are 2 types of song development: linear and non-linear. We found that all male birds in the early stages of development sing complex songs, which are gradually crystallized by the elimination of extra transitions. In contrast, this is not true in the case of non-linear song development, wherein there are no practice modes, and all activity counts toward selecting, constructing, and maintaining behavioral outcomes. We also found that contour surface diagrams of the transition matrix can be a good visual representation to distinguish song features. Our results indicate that information-theoretic analysis of behavioral sequences is important for the discovery of new aspects related to behavioral science.Songbirds have been actively studied for their complex brain mechanism of sensor-motor integration during song learning. Male Bengalese finches learn singing by imitating external models. Birdsongs are strings of sounds represented by a sequence of letters called song notes. In this study, we focused on information-theoretic analysis of these sequential data to explore the complexity and diversity of birdsong throughout song development. We present ethological data mining results for birdsong, which showed that there are 2 types of song development: linear and non-linear. We found that all male birds in the early stages of development sing complex songs, which are gradually crystallized by the elimination of extra transitions. In contrast, this is not true in the case of non-linear song development, wherein there are no practice modes, and all activity counts toward selecting, constructing, and maintaining behavioral outcomes. We also found that contour surface diagrams of the transition matrix can be a good visual representation to distinguish song features. Our results indicate that information-theoretic analysis of behavioral sequences is important for the discovery of new aspects related to behavioral science., 09 Dec. 2010, 研究報告バイオ情報学（BIO）, 2010, 8, 1-6, English, 110007990862, AA12055912 - Conditioned Stimulus‐strength‐dependent Timing Control in a Spiking Network Model of the Cerebellum
本多武尊; 山崎匡; 田中繁; 西野哲朗
15 Apr. 2010, 情報処理学会論文誌トランザクション(CD-ROM), 2009, 2, SURIMODERU.VOL.3,NO.2,1-10, Japanese, 1882-7772, 201002201570445810 - A study of the timing mechanism in a cerebellar network model implemented on FPGA
松野香菜子; 本多武尊; 眞鍋秀聡; 田中繁; 西野哲朗
11 Jan. 2010, 電子情報通信学会技術研究報告, 109, 363(NC2009 71-86), 7-12, Japanese, 0913-5685, 201002258829748304 - Phase diagram of cerebellar granular layer dynamics: A model study
Takeru Honda; Tadashi Yamazaki; Shigeru Tanaka; Tetsuro Nishino
ELSEVIER IRELAND LTD, 2010, NEUROSCIENCE RESEARCH, 68, E211-E212, English, Summary international conference, 0168-0102, WOS:000208443701320 - Conditioned Stimulus‐strength‐dependent timing control in a spiking network model of the cerebellum
本多武尊; 山崎匡; 田中繁; 西野哲朗
15 Oct. 2009, 情報処理学会研究報告(CD-ROM), 2009, 3, ROMBUNNO.MPS-75,28, Japanese, 2186-2583, 200902250418852680 - 小脳顆粒層のスパイキングネットワークモデルの研究:条件刺激強度依存性タイミング制御
本多武尊; 山崎匡; 田中繁; 西野哲朗
24 Sep. 2009, 日本神経回路学会全国大会講演論文集, 19th, 64-65, Japanese, 200902261700055795 - Conditioned Stimulus-strength-dependent timing control in a spiking network model of the cerebellum
HONDA TAKERU; YAMAZAKI TADASHI; TANAKA SHIGERU; NISHINO TETSURO
我々がこれまで構築してきた小脳顆粒層の大規模スパイキングネットワークモデルは，苔状線維刺激呈示からの時間経過を表現する．本研究では，時間経過表現が苔状線維刺激の強度によって制御されるかどうかを調べた．瞬目反射の条件付けの計算機シミュレーションを行い，条件刺激と侵害刺激のペアを繰り返し与えると，プルキンエ細胞が侵害刺激呈示のタイミングの直前で発火を停止するようになることを確認した．その後条件刺激の強度を上げると，プルキンエ細胞の発火停止のタイミングがより早まることを示した．この結果は，条件反応のタイミングを決定するプルキンエ細胞の発火停止のタイミングが条件刺激強度に依存して変化することを示唆する．We have been developing a large-scale spiking network model of the cerebellar granular layer that represents the passage of time (POT) from the mossy fibre (MF) stimulus onset. In this study, we examined whether the POT representation can be controlled by changing the strength of the MF stimulus. We conducted simulations of the delay eyeblink conditioning, in which pairing of a sustained conditioned stimulus (CS) conveyed by MFs with a delayed unconditioned stimulus (US) showed that the Purkinje cell (PC) learned to pause slightly earlier than the onset of the US. When we increased the CS strength, the PC pause shifted earlier. This result suggests that the timing of the conditioned response determined by that of PC pause is adaptively changed by the CS strength., 情報処理学会, 03 Sep. 2009, 研究報告数理モデル化と問題解決（MPS）, 2009, 28, 1-6, Japanese, 0919-6072, 110007993844, AN10505667 - Development of Web Counseling System”,Proceedings of the 12th International Conference on Network-Based Information Systems
加藤 千恵子; Shiono,Y; Takaaki Goto; Tetsuro Nishino; Kensei Tsuchida
Aug. 2009, Proceedings of the 12th International Conference on Network-Based Information Systems, 370-375 - Report of the Third UEC computer DAIHINMIN championship (UECda-2008)
OKUBO Seiya; HONDA Takeru; MANABE Hideaki; IIZUKA Takurou; SALAM Khan Md. Mahfuzus; TOKIDA Hirokazu; GIMA Takeaki; SUZUKI Tomoya; TANAKA Aimi; MATSUNO Kanako; WAKATSUKI Mitsuo; NISHINO Tetsuro
In this talk, we give a summary report of the Third UEC computer DAIHINMIN championship (UECda-2008) held at UEC (The University of Electronic-Communications) on November 22, 2008. DAIHINMIN is one of the most popular card game played in Japan. In this championship, computer DAIHINMIN engines compete against each other. We present the outline of the championship, the adopted rules, number of participants, used programs, and the result of the final match., Information Processing Society of Japan (IPSJ), 02 Mar. 2009, 研究報告ゲーム情報学（GI）, 2009, 27, 17-24, Japanese, 0919-6072, 110007162375, AA11362144 - GroverのアルゴリズムのシミュレーションにおけるGPGPUの利用について
芝田浩; 鈴木智也; 大久保誠也; 西野哲朗
2009, 電子情報通信学会 第21回量子情報技術研究会資料, QIT2009-58 pp.72-77 - A study of timing mechanism and state transition in a spiking network model of the cerebellar granule cell layer
本多武尊; 山崎匡; 田中繁; 西野哲朗
08 Jan. 2008, 電子情報通信学会技術研究報告, 107, 413(NC2007 87-111), 49-54, Japanese, 0913-5685, 200902280775629350 - GPGPUによるGroverのアルゴリズムのシミュレーション
芝田浩; 西野哲朗; 大久保誠也; 鈴木智也
2008, 情報処理学会アルゴリズム研究会資料, AL-120-5, pp.22-40 - Report of the First UEC computer DAIHINMIN championship (UECda‐2006)
大久保誠也; 小林正人; 本多武尊; 眞鍋秀聡; 青木輝人; 柿下容弓; 小松原頌之; 西野哲朗
05 Mar. 2007, 情報処理学会研究報告, 2007, 20(GI-17), 25-32, Japanese, 0919-6072, 200902269683946576 - NMR量子計算の定式化
西野哲朗; 志摩孝夫; 芝田浩
1998, 電子情報通信学会コンピュテーション研究会資料, COMP97-114, pp.63-70
Books and other publications
- デザイン思考に基づく新しいソフトウェア開発手法 EPISODE
西野哲朗
Scholarly book, Japanese, Single work, コロナ社, 25 Mar. 2022 - 量子計算
西野哲朗; 岡本龍明; 三原孝志
Scholarly book, Japanese, Joint work, 近代科学社, 13 Oct. 2015 - 情報工学のための離散数学入門
西野哲朗; 若月光夫
Scholarly book, Japanese, Joint work, 第４章～第７章, 数理工学社, 25 Aug. 2015, 9784864810326 - Applied Automata Engineering
Tetsuro Nishino; Mitsuo Wakatsuki; Takaaki Goto
Japanese, Joint work, 第３章 文法学習，第４章 画像圧縮, CORONA PUBLISHING CO., LTD, Feb. 2012 - Various Approaches to P vs. NP Question
Tetsuro Nishino
Japanese, Editor, Nippon-Hyoron-sha Co. Ltd., Aug. 2009 - Grammatical Inference: Algorithms and Applications, 8th International Colloquium, ICGI 2006, Tokyo, Japan, September 2006, Proceedings, LNAI 4201
Y. Sakakibara; S. Kobayashi; K. Sato; T. Nishino; E. Tomita
English, Editor, Springer, 2006 - 量子コンピュータと量子暗号
西野哲朗
Japanese, 岩波書店，物理の世界 59, 2002 - 量子コンピュータの理論
西野哲朗
Japanese, Editor, 培風館, 2002 - 量子コンピューティング
C. P. ウィリアムズ; S. H; クリアウォータ著; 西野哲朗; 荒井 隆; 渡邊 昇訳
Japanese, Editor, シュプリンガー・フェアラーク東京, 2000 - 中国人郵便配達問題=コンピュータサイエンス最大の難関
西野哲朗
Japanese, 講談社, 1999 - 形式言語の理論
有川節夫監修; 西野哲朗; 石坂裕毅著
Japanese, Editor, 丸善, 1999 - An Introduction to Quantum Computers
Tetsuro Nishino
Japanese, Editor, 東京電機大学出版局, 1997 - 属性文法入門
Tetsuro Nishino
Japanese, Editor, 共立出版, 1996 - 形式言語理論入門
Tetsuro Nishino
Japanese, Editor, 東京電機大学出版局, 1995 - An Introduction to Computational Complexity Theory
Akeo Adachi; Tetsuro Nishino
English, Editor, 朝倉書店, 1988
Lectures, oral presentations, etc.
- 量子アニーリングマシンの実行時エラーについて
山川拓人; 大久保誠也; 西野哲朗
Oral presentation, Japanese, 電子情報通信学会第43回量子情報技術研究会, Domestic conference
2020 - コンピュータ大貧民におけるレーティング手法について
五ヶ谷純平; 大久保誠也; 若月光夫; 西野哲朗
Oral presentation, Japanese, 情報処理学会研究報告. GI(ゲーム情報学), Domestic conference
2020 - 大貧民におけるプレイヤーの提出手の傾向に関する研究
武内大和; 大久保誠也; 若月光夫; 西野哲朗
Oral presentation, Japanese, 情報処理学会研究報告, 情報処理学会ゲーム情報学研究会, 東京, Domestic conference
2019 - コンピュータ大貧民におけるローカルルールの効果に関する研究
門裕太; 大久保誠也; 若月光夫; 西野哲朗
Oral presentation, Japanese, 情報処理学会研究報告, 情報処理学会ゲーム情報学研究会, 東京, Domestic conference
2019 - 大貧民におけるモンテカルロ法の報酬値に関する研究
土橋康希; 大久保誠也; 若月光夫; 西野哲朗
Oral presentation, Japanese, 情報処理学会研究報告, 情報処理学会ゲーム情報学研究会, 東京, Domestic conference
2019 - コンピュータ大貧民における提出手の影響に関する研究
三石亮; 大久保誠也; 若月光夫; 西野哲朗
Oral presentation, Japanese, 情報処理学会研究報告, 情報処理学会ゲーム情報学研究会, Domestic conference
2019
Courses
- ３大学協働基礎ゼミ
The University of Electro-Communications - ３大学協働基礎ゼミ
電気通信大学 - 国際科学技術コミュニケーション論
The University of Electro-Communications - 形式言語理論
The University of Electro-Communications - 形式言語理論
The University of Electro-Communications - 形式言語理論
電気通信大学 - 計算機科学特論
The University of Electro-Communications - 実践ソフトウェア開発概論 III
The University of Electro-Communications - 国際科学技術コミュニケーション論
The University of Electro-Communications - 国際科学技術コミュニケーション論
電気通信大学 - 実践ソフトウェア開発基礎論
The University of Electro-Communications - 実践ソフトウェア開発概論 III
The University of Electro-Communications - 実践ソフトウェア開発概論 III
電気通信大学 - 実践ソフトウェア開発基礎論
The University of Electro-Communications - 実践ソフトウェア開発基礎論
電気通信大学 - 計算機科学特論
The University of Electro-Communications - 計算機科学特論
電気通信大学 - 計算機工学
The University of Electro-Communications - 計算機工学
電気通信大学
Research Themes
- 効率的な最大および極大クリーク抽出アルゴリズムの開発と応用
富田 悦次; 若月 光夫; 西野 哲朗; 伊藤 大雄
日本学術振興会, 科学研究費助成事業, 電気通信大学, 基盤研究(C), 最大クリーク厳密解抽出の分枝限定アルゴリズムに対するこれまでの研究により，最大クリークの近似解が非常に有効に活用出来ることを明らかにしてきている．その近似精度が良くなれば分枝限定はより有効に働く．しかし，近似解抽出のために時間を要すると，総実行時間としては必ずしも短縮とはならず，近似精度と時間との兼ね合いが重要となる．そこで先ず，最大クリーク近似解の抽出を一層高速化し，その上で精度を向上させることにより，総合的に最大クリーク厳密解抽出を効率化した． 続いて，分枝限定のために近似彩色だけでなくMaxSATも用いることにより分枝限定がより強力化されることをこれまでに確認してきたが，MaxSATあるいはその簡略形実行のためのオーバーヘッドの大きさが最大クリーク厳密解抽出総実行時間短縮の妨げとなっていた．これに対しては，MaxSATの簡略形と従来提唱してきていた再番号付け（再彩色）との類似性に着目して両者を融合させることにより，これまでよりも少ないオーバーヘッドによって，有効な分枝限定効果を発揮出来るようにした．さらに，分枝限定アルゴリズムの内部動作は入力グラフの特徴に応じて効率が左右されるため，出来る限り効率がより発揮されるようにと内部動作を適応的に切り替えるようにした． 以上を総合することにより，最大クリーク厳密解抽出のための従来の分枝限定アルゴリズムを有意に高速化することに成功した． このような最大クリーク厳密解抽出アルゴリズムは，容易に最大クリーク全列挙アルゴリズムへと拡張出来る．これにより，符号理論における最良な多元単一削除訂正符号の構成に関しての新たな知見を得ることが出来た． 極大クリーク全列挙問題についてもさらに理論的，実験的に検討を続け，有効な進展結果を得た．, 17K00006
01 Apr. 2017 - 31 Mar. 2022 - Feature extraction of multi-person imperfect information games by using data mining methods
Tetsuro Nishino
Japan Society for the Promotion of Science, Grants-in-Aid for Scientific Research, The University of Electro-Communications, Grant-in-Aid for Scientific Research (C), Computer Daihinmin involves playing Daihinmin, a popular card game in Japan, by using a player program. Because strong player programs of Computer Daihinmin use machine-learning techniques, such as the Monte Carlo method, predicting the program’s behavior is difficult. In this study, we extract the features of the player program through decision tree analysis. The features of programs are extracted by generating decision trees based on three types of viewpoints. To show the validity of our method, computer experiments were conducted. We applied our method to three programs with relatively obvious behaviors, and we confirmed that the extracted features were correct by observing real behaviors of the programs., 17K00297
01 Apr. 2017 - 31 Mar. 2020 - IoT図書館を活用した映像とセンサデータに基づく行動分析
西野哲朗
コニカミノルタ（株）, 共同研究, Principal investigator
01 Jul. 2018 - 31 Mar. 2019 - Much faster algorithms for finding maximum and maximal cliques and their applications
TOMITA Etsuji
Japan Society for the Promotion of Science, Grants-in-Aid for Scientific Research, The University of Electro-Communications, Grant-in-Aid for Scientific Research (C), We have developed much faster algorithms for finding a maximum clique. These have been accomplished by introducing a near-maximum clique finding algorithm and by applying appropriately sorting and coloring vertices to the underlying branch-and-bound algorithm for finding a maximum clique. The effectiveness of the above algorithms has been confirmed by extensive computational experiments. In addition, we have also given a weaker condition under that the maximum clique problem can be solved in polynomial time in theory. Our previous algorithm for enumerating maximal cliques has been extended to have algorithms for enumerating maximal pseudo-cliques. They are confirmed to work effectively for the analysis of networks., 25330009
01 Apr. 2013 - 31 Mar. 2018 - Research on the game AI that makes human-lile mistakes
Takeshi Ito; HOKI KUNIHITO; NISHINO TETSURO; MUNEKATA NAGISA; KATAYOSE HARUHIRO; IKEDA KOKOLO
Japan Society for the Promotion of Science, Grants-in-Aid for Scientific Research, The University of Electro-Communications, Grant-in-Aid for Scientific Research (B), In this research, we focused on mistakes of human. We got the following research results by aiming at making game AI that makes human-like mistakes. 1) Classification by focusing on the cause of a mistake in human playing games.2) Proposal of a game AI with the model in consideration of human biological restrictions.3) Proposal and estimation of a game AI that adjust the strength in a game automatically and direct to a good game.4) Proposal of a game AI that realizes a human-like play by giving the "flow". These research results bring new evaluation other than the directivity of "strength" to game AI and serve as new indicator to generate the various game AI., 25280130
01 Apr. 2013 - 31 Mar. 2016 - Development of efficient learning algorithms of formal languages and construction of their application systems
WAKATSUKI Mitsuo; TOMITA Etsuji; NISHINO Tetsuro
Japan Society for the Promotion of Science, Grants-in-Aid for Scientific Research, The University of Electro-Communications, Grant-in-Aid for Scientific Research (C), We have developed a polynomial-time algorithm for checking the equivalence of deterministic restricted one-counter transducers (DROCT's for short), which are deterministic pushdown transducers having just one stack symbol, that accept by final state with possible epsilon-moves. By extending this technique, we have also developed a polynomial-time algorithm for checking the inclusion of these DROCT's. Then, we have presented a polynomial-time algorithm for learning real-time DROCT's which accept by final state via membership and equivalence queries. Furthermore, we have shown that the regularity of the behavior of some programs for playing games of Daihinmin, which is one of card games, on computers can be extracted by using the EUREKA system which incorporated an identification algorithm of the class of k-reversible languages, which is a subclass of regular languages, for analyzing songs of the Bengalese finch., 23500011
28 Apr. 2011 - 31 Mar. 2015 - 電気通信大学 データアントレプレナープログラム
田村元紀
住友電工グループ社会貢献基金
2015 - Simulating brain functions based on computational learning theory
NISHINO Tetsuro; TANAKA Shigeru; YAMAZAKI Tadashi; HOKI Kunihito
Japan Society for the Promotion of Science, Grants-in-Aid for Scientific Research, The University of Electro-Communications, Grant-in-Aid for Scientific Research (B), In this study, we construct various models of brain functions, such as motion, thinking and memory based on computational learning theory, and analyze their behavior in the following fashion: (1) we construct a state transition model for the motion and simulate the robot motion using this model, (2) we construct a neural network model for the memory and analyze its behavior, and (3) we design an efficient algorithm for card game playing using Monte Carlo Simulation. Finally we construct a unified methodology for simulating brain functions based on the above results., 23300055
01 Apr. 2011 - 31 Mar. 2014 - Development of efficient algorithms for finding a maximum clique with theoretical and experimental evaluations and their applications
TOMITA Etsuji
Japan Society for the Promotion of Science, Grants-in-Aid for Scientific Research, The University of Electro-Communications, Grant-in-Aid for Scientific Research (C), We developed some sufficient conditions and algorithms for arbitrary graphs by which the maximum clique problem can be solved in polynomial time. These algorithms can find an exact maximum clique in any arbitrary graph without any condition. We also confirmed experimentally that our newly developed another maximum-clique-finding algorithm works very efficiently. These algorithms were effectively applied for some problems as in bioinformatics., 22500009
2010 - 2012 - Developments of efficient algorithms for learning from examples of formal languages and their applications
WAKATSUKI Mitsuo; TOMITA Etsuji; NISHINO Tetsuro
Japan Society for the Promotion of Science, Grants-in-Aid for Scientific Research, The University of Electro-Communications, Grant-in-Aid for Scientific Research (C), We have developed polynomial time algorithms for checking the equivalence of deterministic restricted one-counter transducers, which are deterministic pushdown transducers having just one stack symbol, that accept by empty stack or by final state. We have proved that a subclass of deterministic pushdown automata called Szilard strict deterministic restricted one-counter automata and a subclass of finite state transducers(FST's for short)called strict prefix deterministic FST's are polynomial time identifiable in the limit from positive data. Furthermore, we have improved the method for analyzing songs of the Bengalese finch using an identification algorithm for the class of k-reversible languages, which is a subclass of regular languages., 20500007
2008 - 2010 - Modeling the acquisition process of bird song grammars based on computational learning theory
NISHINO Tetsuro; TOMITA Etsuji; OKANOYA Kazuo; TANAKA Shigeru; YAMAZAKI Tadashi
Japan Society for the Promotion of Science, Grants-in-Aid for Scientific Research, The University of Electro-Communications, Grant-in-Aid for Scientific Research (B), Songbird has been actively studied as a good model for their complex brain mechanism in song learning. Male Bengalese Finch learns singing by imitating external models. Birdsongs are strings of sounds as represented by sequence of alphabets. We implemented an automatic system which extracts a song grammar from a given phoneme data by using computational method, and use it to build a model of development processes of song grammars whose validity was checked by real data. Our experimental results suggest such kind of experiment on behavioral sequence is important to discover new knowledge., 20300056
2008 - 2010 - Improvement and extension of maximum-clique-finding algorithms with complexity analysis and their applications
TOMITA Etsuji; TAKAHASHI Haruhisa; NISHINO Tetsuro; WAKATSUKI Mitsuo; TARUI Jun
Japan Society for the Promotion of Science, Grants-in-Aid for Scientific Research, The University of Electro-Communications, Grant-in-Aid for Scientific Research (C), 最大クリークを抽出する新しいアルゴリズムMCSを開発し,格段に高速であることを明らかにした.これにより,従来では100日以上かかっても解けなかった幾つかの問題を100秒以内で解くことに成功した.最大クリーク問題が多項式時間的に可解となる基本的結果も確立した.また,最大クリーク抽出アルゴリズムがハイパーグラフにおいても効率的に稼働する様に拡張した.更に,これらのアルゴリズムをデータマイニングなどの実問題に応用して有効な結果を得た., 19500010
2007 - 2009 - Development on automations of security analysis for cryptographic primitives
OHTA Kazuo; NISHINO Tetsuro; SAKIYAMA Kazuo; KUNIHIRO Noboru
Japan Society for the Promotion of Science, Grants-in-Aid for Scientific Research, The University of Electro-Communications, Grant-in-Aid for Scientific Research (C), 暗号プロトコルの安全性自動検証手法APSG,およびT-PIOAの改良と事例研究の拡張を行い,各手法の性能を評価するとともに実用性を向上させた.また,低資源向き認証プロトコルGPS方式とHB-PUF方式の安全性解析を行い,既存方式の問題点を指摘するとともに,改良方式を提案した., 19500009
2007 - 2009 - A Computational Learning Theoretic Approach to Birdsong Syntax Analysis
NISHINO Tetsuro; SASAHARA Kazutoshi; TAKAHASHI Miki
Japan Society for the Promotion of Science, Grants-in-Aid for Scientific Research, The University of Electro-Communications, Grant-in-Aid for Scientific Research (C), We propose an efficient automata-based approach to extract behavioral units and rules from continuous sequential data of animal behavior. Introducing original extensions, we integrate two elemental methods-the Ngram model and the Angluin's machine learning algorithm into an ethological data mining framework. It allows us to obtain the simplest finite automaton representation of behavioral rule that accepts (or generates) the smallest set of possible behavioral patterns from sequential data of animal behavior. With this method, we demonstrate how the ethological data mining works using real birdsong data and performs experimental evaluations of this method using artificial birdsong data generated by a computer program. These results suggest that our ethological data mining effectively works even for noisy ethological data by appropriately setting the parameters. In addition, we demonstrate a case study using the Bengalese finch song, showing that our method successfully grasps the core structure of the singing behavior such as loops and branchings., 18500109
2006 - 2007 - Developments of Efficient Combinatorial Algorithms and Their Applications
TOMITA Etsuji; TAKAHASHI Haruhisa; NISHINO Tetsuro; KOBAYASHI Satoshi; HOTTA Kazuhiro; WAKATSUKI Mitsuo
Japan Society for the Promotion of Science, Grants-in-Aid for Scientific Research, The University of Electro-Communications, Grant-in-Aid for Scientific Research (B), (1)We are mainly concerned with the maximum clique problem that is very important and is one of the most typical NP hard combinatorial problems. We employed a branch-and-bound algorithm for the problem and established an efficient ordering of vertices to search them. In addition, we developed a new approximate coloring algorithm to give an upper bound of the size of a maximum clique in question in order to bound the search. By combining these techniques, we developed very efficient algorithms for finding a maximum clique. The superiority of our algorithms over the other algorithms were confirmed by extensive computational experiments on random graphs and DIMACS benchmark graphs. (2)We developed an algorithm for generating all the maximal cliques in a graph and proved that it is theoretically optimum and runs very fast in practice. A more efficient algorithm that generates only large maximal cliques was also developed, that is important for practical uses. In addition, efficient algorithms that generate maximal bipartite graphs in a bipartite graph was developed. (3)These algorithms were successfully applied for practical problems in bioinformatics such as a protein side-chain packing problem and a protein threading problem. (4)We obtained new results of algorithmic learning of simple languages via queries, learning of Boolean functions from noisy samples, learning of a certain kind of counter language from positive data, and gave a unified approach for identification in the limit from positive data., 16300001
2004 - 2006 - 量子アルゴリズムに対する公開鍵暗号及び秘密鍵暗号の安全性評価
太田 和夫; 西野 哲朗; 國廣 昇
日本学術振興会, 科学研究費助成事業, 電気通信大学, 特定領域研究, 本研究の主題は,量子計算機の実現が公開鍵暗号及び,秘密鍵暗号にどのような影響を及ぼすかを明らかにすることである.そこで,本年度は最短ベクトル問題の困難さに安全性の根拠をおいた公開鍵暗号系に対する安全性評価を行なった. 最短ベクトル問題に対しては,古典・量子を問わず,多くの研究が行われている.この問題に対する量子アルゴリズムとして,提案されているほとんどのものは近似アルゴリズムであり,真に最短のベクトルを探索するアルゴリズムは考案されていない.そこで,古典アルゴリズムと量子アルゴリズムを組み合わせることで真の最短ベクトルを探すアルゴリズムを提案した. 提案アルゴリズムは次の2つのステップからなっている.最初に,最短ベクトルの探索範囲を古典計算機上で決定する.そして,固定した探索範囲内から,真の最短ベクトルをDurrとHoyerの最小値探索量子アルゴリズムを用いて探索する. 量子計算機を用いて最小値の探索を行う際の計算量は,探索空間のサイズに依存する.そのため,探索範囲をより限定するほど,最短ベクトルを高速に発見することができる.探索範囲の素朴な決定法として,入力した基底の中の最短ベクトルの長さを利用することが出来るが,より小さい探索範囲を決定する方法として,我々は,LLL簡約基底の最短ベクトルの長さを用いることを提案した.LLL簡約基底を計算するアルゴリズムは,パラメータδによって,計算時間と出力ベクトルの長さとのtrade offが制御される. 我々は,LLL簡約基底計算アルゴリズムのパラメータδを用いて,提案アルゴリズム全体の計算量を詳細に評価し,計算量を最小にする値を理論的に評価した.その結果,最適となるδと,その際の計算量が明らかとなった. 数値実験によると,提案方式は,前述した素朴な方法よりも一般に高速である.しかしながら,現時点では,最良の古典アルゴリズムの計算量を上回ることはできていない., 16016235
2004 - 2005 - Construction of an Optimality-Theoretic Theory of Case and Linking and Its Realization on a Neural Network
NAKAMURA Wataru; NIISHINO Tetsuro; SAKAMOTO Maki
Japan Society for the Promotion of Science, Grants-in-Aid for Scientific Research, Grant-in-Aid for Scientific Research (C), The aim of this year's study was to provide a foundation for transforming a mufti-layered perceptron with a back propagation learning algorithm which realizes an accusative/ergative case system into a neural neywork which adopts a Hebbian learning algorithm as used in our brain. Specifically, er presented and wrote a paper which examined the computational capabilities of a quantum neural network (see Matsumoto, Okubo, and Nishino 2004). This work investigated whether it is possible to apply a very powerful computational capability of a quantum neural network to neuroidal network which is is designed to simulate the process of language acquisition. We were not able to simulate a post-'Verb Island' phase on a neuroidal network, but we are in the process of investigating how to simulate the process of acquiring an accusative linking system as found in English and Japanese under the assumption that syntactic categories such as NP, VP, or AP are innate. Specifically, we are planning to construct a neuroidal network which acquires an accusative system of grammatical relations on the basis of a bundle of semantic features as proposed by Dowry's (1995) and Ackerman and Moore's (2003) protorole theory. Finally, we examined how the human brain comprehends an active/passive sentence, using the functional brain imaging with a particular focus on how Japanese understands (see Yokoyama., Uchida, Nakamura, Kawashima, and others 2004). a Japanese or English sentence., 14510616
2002 - 2004 - 量子アルゴリズムに対する公開鍵及び共通鍵暗号の安全性評価
太田 和夫; 國廣 昇; 西野 哲朗
日本学術振興会, 科学研究費助成事業, 電気通信大学, 特定領域研究, 平成15年度の主な成果は以下の通り. 1.量子アルゴリズムに対する公開鍵暗号に対する安全性 Shorのアルゴリズムにより,素因数分解が多項式時間で完了することは明らかになっている.しかしながら,量子計算機固有の問題,すなわち,原理的に可逆計算でなければならないこと,一回の演算時間が古典計算機より遅いこと,などの理由により,必ずしも,意味のある時間で素因数分解が完了するかどうかは明らかではない.本研究では,Shorのアルゴリズムをいくつかの手法により,量子回路で記述し,実際に必要となるgate数,qubit数を厳密に求め,必要となる計算時間を評価した.その結果,演算時間の遅いデバイスを用いた場合や,qubitを節約する回路を用いた場合には,現実的な時間で素因数分解が完了しないことを示した.具体的には,古典計算機よりも,量子計算機が真に有効であるためには,1592qubit以上で,演算時間が70μ秒以内,もしくは,1064qubitで,演算時間が16μ秒以内の量子計算機が実現しなくてはならないこと明らかにした. 2.NMR量子計算機に対する共通鍵暗号の安全性評価 平成13,14年度に引き続き,量子計算機に対する共通鍵暗号の安全性評価を行った.本年度は,GroverのアルゴリズムのNMR量子計算機への適用可能性に関して考察を行なった.さまざまな物理的条件(すなわち,可能な観測誤差)に対して評価を行ない,従来の量子計算機よりも高速に,暗号化鍵の探索が行なえることを確認した.具体的には,58bit鍵の探索において,測定誤差が1/256であるとき,従来の方式よりも12.5倍高速実行可能であることを数値実験により確認した., 15017236
2003 - 2003 - Studies on Efficient Learning Algorithms from Examples
TOMITA Etsuji; WAKATSUKI Mitsuo; NISHINO Tetsuro; KOBAYASHI Satoshi
Japan Society for the Promotion of Science, Grants-in-Aid for Scientific Research, The University of Electro-Communications, Grant-in-Aid for Scientific Research (C), We have established a polynomial-time algorithm for exactly learning simple deterministic languages via membership queries, given a representative sample of the target language. This algorithm sophisticatedly employs a polynomial-time algorithm for checking the equivalence of simple deterministic languages that was devised by ourselves previously. For a real-time deterministic restricted one counter automation (droca) which has exactly one transition rule per one terminal symbol, a polynomial-sized characteristic sample is exactly obtained. Based on this result, we have devised an algorithm for identifying droca's in the limit with polynomial updating time and polynomial number of updates. We have developed an algorithm for approximately learn certain Boolean functions, called AC^0, from examples of their behavior with possibly attribute and classification noise, provided we are given the upper bound of the noise ratio which is less than 1/2. Subsequently, we devised an algorithm for guessing the upper bound of the noise ratio. Combining these results, we have succeeded in designing and algorithm for approximately learn such functions without any knowledge of the noise ratio in advance. Some algorithms were devised to identify some subregular languages in the limit from positive samples. Then we gave a unified method to identify some classes of languages in the limit from positive examples. Algorithms for finding a maximum clique in a graph are important for clustering problems. Then we devised a very fast algorithm for finding a maximum clique together with some extensions. We have successfully applied these algorithms for some practical problems as in bioinformatics, image processing, and so on., 13680435
2001 - 2003 - 量子アルゴリズムに対する共通鍵暗号の安全性評価
太田 和夫; 國廣 昇; 西野 哲朗
日本学術振興会, 科学研究費助成事業, 電気通信大学, 特定領域研究, 平成14年度の主な成果は以下の通り. 1.NMR量子計算機に対する共通鍵暗号の安全性評価 公開された暗号化アルゴリズムE,平文m_0及び暗号文c_0が与えられた時,c_0=E(k_0,m_0)の関係をみたす秘密鍵K_0を見つける既知平文攻撃のシナリオにおける,共通鍵暗号の安全性の評価を行った.平成13年度にNMR量子計算機を一般化した,Bulk Quantum Turing Machine(BQTM)による数え上げ技法を応用した新しい共通鍵暗号解読アルゴリズムの提案を行ったが,今年度は,数値実験により,本提案アルゴリズムの有効性に関して詳細に検討を行った.その結果,NMR量子計算機の観測精度Lと秘密鍵の長さnが,L>(3n+2)/4となる場合には,提案方式が従来の結果(Groverのアルゴリズムの適用)を上回ることを明らかにした.現在の状況では,この条件式は,数値実験により求めたいくつかの仮定に基づいているため,今後の研究課題として,この仮定の理論的な証明が残されている.また,今後,暗号化関数の内部構造を利用した新たな攻撃法に関する研究を行う予定である. 2.量子アルゴリズムに対する公開鍵暗号の安全性 共通鍵暗号に対してだけでなく,量子アルゴリズムに対する公開鍵暗号の安全性評価も開始した.Shorの素因数分解アルゴリズムにおいて,もっとも計算時間が必要であり,難しい制御が必要なのは,べき乗剰余演算であると言われている.このべき乗剰余演算を行う量子回路の構成に関して,いくつかの成果を出した.例えば,Montgomery Reductionや右向きBinary Methodを量子回路に導入すれば,効率的にべき乗剰余演算を行えることを明らかにした.今後の課題として,さらなる効率的な量子回路の探索および,物理デバイスに応じた回路の探索を考えている., 14019040
2002 - 2002 - 量子アルゴリズムに対する共通鍵暗号の安全性評価
太田 和夫; 西野 哲郎
日本学術振興会, 科学研究費助成事業, 電気通信大学, 特定領域研究(C), 平成13年度の主な成果は以下の通り. 1.鍵の総当り攻撃のファイル探索問題への帰着 公開された暗号アルゴリズムE,平分m_0および暗号文c_0が与えられたとき,c_0=E(k_0,m_0)の関係をみたす秘密鍵k_0を見つける既知平文攻撃のシナリオでの鍵の総当り攻撃を,ファイル探索問題に帰着させる変換(攻撃法)を提案した.その変換が従来の結果(Groverのアルゴリズムを素朴に適用する場合)よりも有利となる条件を洗い出した. マシン実験を用いて案際に使用されている暗号系において,その条件が成立つかを調べたところ,成立しないことが判明した.よって,ここで提案した変換では安全性の心配はないことを確認した. 2.中間一致攻撃型の暗号解読の実現可能性について Chiらが提案しているファイル探索問題の高速化技法(http://xxx.lanl.gov/archive/quant-ph/9707011)の妥当性を評価して,彼等の主張に誤り(存在を仮定しているオラクル関数に問題点)があることを発見した.よって,中間一致攻撃型の暗号解読は,現在のところ,それほどの脅威ではないと思われる. 3.NMR計算機に対する共通鍵暗号の安全性 NMR計算機等を一般化した,Bulk Quantum Turing Machine (BQTM)による数え上げ(counting problem)技法にを応用した新しい共通鍵解読アルゴリズムを提案した. 提案アルゴリズムでは,ブール関数F^<(d)>_rを導入することで,暗号アルゴリズムEを実現するオラクルの呼び出し回数とNMR計算機の観測の精度との間にトレードオフが成立つことを示した.妥当な仮定のもとで計算の複雑度を予想し,小規模な実験を行ったところ,従来の結果をしのぐ可能性があること分かった. 現在,このアプローチの有効性を調べるために,マシン実験を継続している., 13224039
2001 - 2001 - A neural model of the binding in the human brain and its application to pattern recognition
HARUHISA Takahashi; MITSUO Wakatsuki; TETSURO Nishino; ETSUJI Tomita
Japan Society for the Promotion of Science, Grants-in-Aid for Scientific Research, The Unicersity of Electro-Communications, Grant-in-Aid for Scientific Research (C), The information binding in human brain is getting important to explain and to understand how human being can recognize the outer world so easily. Besides this, we expect that applying the binding mechanism to recognizer, we can get much better recognition performance. In this research we developed the neural networks that can well explain the information binding in the human brain. Based on the fact that the previous neural models are difficult to represent the spike synchronization or asynchronization, we developed two phasor neural models. One is the phase-rate oscillating neural model, in which the phase represents the sinusoidal phase. The other is covariance neural model, in which the cosine of the phase difference between two neurons represents the covariance coefficient. In both model we implemented the Hebb learning and Boltzmann learning rules to get the efficient learning. From the computer simulation results, we showed that the proposed learning rules work much more efficient than ordinal models. Applying the knowledge obtained from these models, we proposed the brain wave recognizer which shows much higher performance than previous. We also developed the theory of generalization in learning., 10650353
1998 - 2000 - 順序情報の生成・学習を説明する計算論的神経回路モデル
田中 繁; 西野 哲朗
日本学術振興会, 科学研究費助成事業, 理化学研究所, 特定領域研究(A), 今年度は、基底核を表す部分ネットについて、前年度のものよりも詳細な解剖学的構造を考慮に入れて精緻化を図り、基底核のindirect pathwayをモデルに組み込んだ。すなわち、indirect pathwayの回路としては、解剖学的に確認されている(1)線条体熬W蒼球外節燻居-下核熬W蒼球内節と(2)線条体熬W蒼球外節熬W蒼球内節を採用した。さらに、淡蒼球内節においては、indirect pathwayはdirect pathwayに比べて神経投射の選択性は弱いと仮定した。 本モデルによって、ドーパミンの代謝異常による運動障害のシミュレーションが可能になり、病理学的所見を再現することができたと考えている。 例えば、Hyperkinesiaにおいては、我々のモデルによると、線条体でのドーパミン過剰はdirect pathwayの活動亢進によって淡蒼球内節のmovement-related neuronsのトニックな活動を強く抑制する一方で、線条体からindirect pathwayへの出力はドーパミンによって抑圧されるので結果的には淡蒼球外節の出力は脱抑制によって亢進し、(1),(2)の経路を経て淡蒼球内節の活動を強く抑制する。これによって視床ニューロンの脱抑制を介して大脳皮質にポジティブフィードバックが掛かり、ある種の運動要素をコードしたニューロン活動がビルドアップされる。しかしながらindirect pathwayの方がdirect pathwayよりも神経結合の特異性が弱いと仮定しているために、ある運動要素をコードしているmovement-related neuronsの活動が変化している時に別の運動要素をコードしているmovement-related neuronsの活動が変化してしまい、ひとつの運動に留まることができなくなると解釈できる。これによってハンチントン舞踏病に見られるような不随運動が説明できるものと考える。, 11145243
1999 - 1999 - 量子コンピュータによる効率的計算の研究
西野 哲朗
日本学術振興会, 科学研究費助成事業, 電気通信大学, 奨励研究(A), 本研究では、巡回セールスマン問題のような極めて難しい組合せ最適化問題に、状態の重ね合わせ等の、量子計算のメカニズムがどのように応用しうるかについて検討を重ねてきた。 多項式時間アルゴリズムが知られていない問題が、量子チューリング機械を用いれば、少ない誤り確率で効率良く解けることを証明することは、量子チューリング機械の計算能力を明らかにする上で非常に重要である。そのような結果が証明できれば、少なくとも、量子並列化機能にによって得られた余分な計算能力を、古典的計算によって達成するのが難しいことが示されたことになる。ところで、ショアが対象とした因数分解の問題は、多項式時間では解けず、しかもNP完全でもないだろうと予想されている。そこで本研究では、量子チューリング機械上で、NP完全な組合せ最適化問題を少ない誤り率で効率良く解けるか否かについて検討を行なった。 本研究において申請者は、量子チューリング機械を用いたSAT(論理式の充足可能性判定問題)の解法について研究を行ない、以下のような結果を得た。 仮定 A: 様相の重ね合わせのなかに、ある特定の様相Cが存在することを観測したときに、Cがその重ね合わせ内に存在していれば、そのことを確率1でCの入力サイズに関する多項式時間で観測することができる。 定理 仮定Aのもとでは、SATを多項式時間で解く量子チューリング機械が存在する。, 07780244
1995 - 1995 - 「DEVELOPMENT OF A STEREOTAXIC DEVICE USING SOFT X-RAY FLUOROGRAPY」
HAYASHI Shinji; HONMA Hideaki; NAKAMITSU Kuniaki; NISHINO Tetsuro; YAKU Takeo
Japan Society for the Promotion of Science, Grants-in-Aid for Scientific Research, TOKYO METROPOLITAN INSTITUTE FOR NEUROSCIENCES, Grant-in-Aid for Developmental Scientific Research, For accurate brain stereotaxy in various experimental animal species, a device with soft X- rays was improved in this project. The fluorography of the animal head can be observed on a monitor during the brain operation, so that the efficacy and accuracy of the brain stereataxy can be greatly improved. The device is 1700 high, 2000 wide and 1150 in depth (mm). It is composed of the X-ray generator, movements for adjustment of animal position, X-ray camera, steel shield for protection of the operator from x-ray irradiation, image processor for enhancement of fluorography, a personal computer for generation of three dimensional standard axes, color monitor, micromanipulators for intracranial operation and their hydraulic driving systems. The animal is placed an a operation stage on the Movements I and II which are controlled by remote drive systems. By movement I, which can adjust the position in three dimensions (X,Y and Z) and pitching (alpha) and rolling (beta) manners, the animal head can be placed in the most appropriate position between the X-ray source and the camera. Then the animal and electrode can be moved altogether by the Movement II. By rotating the Movement II in 90 degrees, lateral and frontal views of the animal head can be observed. The videosignals are processed by a video processor and the clarity of the fluorography can be enhanced. Vertical and horizontal standard axes are generated by a personal computer, superimposed onto the fluorography of the animal head and observed on a color monitor altogether. By defining the stereotaxic zero at an appropriate structure in the skull, any position in the brain can be accessed itereotaxically., 62840023
1987 - 1989
