Prof. Dr. Yasuo Uchida

Committee: International Scientific Committee of Electronics and Communication Engineering
University: National Institute of Technology, Ube College
Department:
Research Fields: cellular acceptor, configuration-reader, converter, finite automaton, four-dimension, on-line tessellation acceptor, parallel/sequential array acceptor, Turing machine.,

Publications

2 k-Neighborhood Template A-Type Three-Dimensional Bounded Cellular Acceptor

Authors: Yasuo Uchida, Makoto Sakamoto, Makoto Nagatomo, Takao Ito, Tsunehiro Yoshinaga, Satoshi Ikeda, Masahiro Yokomichi, Hiroshi Furutani, Tuo Zhang, Tatsuma Kurogi

Abstract:

This paper presents a four-dimensional computational model, k-neighborhood template A-type three-dimensional bounded cellular acceptor (abbreviated as A-3BCA(k)), and discusses the hierarchical properties. An A-3BCA(k) is a four-dimensional automaton which consists of a pair of a converter and a configuration-reader. The former converts the given four-dimensional tape to the three- and two- dimensional configuration and the latter determines the acceptance or nonacceptance of given four-dimensional tape whether or not the derived two-dimensional configuration is accepted. We mainly investigate the difference of the accepting power based on the difference of the configuration-reader. It is shown that the difference of the accepting power of the configuration-reader tends to affect directly that of the A-3BCA(k) for the case when the converter is deterministic. On the other hand, results are not analogous for the nondeterministic case.

Keywords: Turing Machine, converter, four-dimension, Cellular acceptor, configuration-reader, finite automaton, on-line tessellation acceptor, parallel/sequential array acceptor

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 840
1 Hierarchies Based On the Number of Cooperating Systems of Finite Automata on Four-Dimensional Input Tapes

Authors: Yasuo Uchida, Makoto Sakamoto, Makoto Nagatomo, Takao Ito, Tsunehiro Yoshinaga, Satoshi Ikeda, Masahiro Yokomichi, Hiroshi Furutani

Abstract:

In theoretical computer science, the Turing machine has played a number of important roles in understanding and exploiting basic concepts and mechanisms in computing and information processing [20]. It is a simple mathematical model of computers [9]. After that, M.Blum and C.Hewitt first proposed two-dimensional automata as a computational model of two-dimensional pattern processing, and investigated their pattern recognition abilities in 1967 [7]. Since then, a lot of researchers in this field have been investigating many properties about automata on a two- or three-dimensional tape. On the other hand, the question of whether processing fourdimensional digital patterns is much more difficult than two- or threedimensional ones is of great interest from the theoretical and practical standpoints. Thus, the study of four-dimensional automata as a computasional model of four-dimensional pattern processing has been meaningful [8]-[19],[21]. This paper introduces a cooperating system of four-dimensional finite automata as one model of four-dimensional automata. A cooperating system of four-dimensional finite automata consists of a finite number of four-dimensional finite automata and a four-dimensional input tape where these finite automata work independently (in parallel). Those finite automata whose input heads scan the same cell of the input tape can communicate with each other, that is, every finite automaton is allowed to know the internal states of other finite automata on the same cell it is scanning at the moment. In this paper, we mainly investigate some accepting powers of a cooperating system of eight- or seven-way four-dimensional finite automata. The seven-way four-dimensional finite automaton is an eight-way four-dimensional finite automaton whose input head can move east, west, south, north, up, down, or in the fu-ture, but not in the past on a four-dimensional input tape.

Keywords: Computational complexity, Hierarchy, cooperating system, finite automaton, four-dimension, multihead

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1524

Abstracts

1 Green Supply Chain Management and Corporate Performance: The Mediation Mechanism of Information Sharing among Firms

Authors: Yasuo Uchida, Seigo Matsuno, Shozo Tokinaga

Abstract:

This paper proposes and empirically tests a model of the relationships between green supply chain management (GSCM) activities and corporate performance. From the literature review, we identified five constructs, namely, environmental commitment, supplier collaboration, supplier assessment, information sharing among suppliers, and business process improvement. These explanatory variables are used to form a structural model explaining the environmental and economic performance. The model was analyzed using the data from a survey of a sample of manufacturing firms in Japan. The results suggest that the degree of supplier collaboration has an influence on the environmental performance directly. While, the impact of supplier assessment on the environmental performance is mediated by the information sharing and/or business process improvement. And the environmental performance has a positive relationship on the economic performance. Academic and managerial implications of our findings are discussed.

Keywords: Corporate Performance, green supply chain management, empirical study, path modeling

Procedia PDF Downloads 261