Yasuo Uchida

Some properties of k -neighborhood Template A -type two-dimensional bounded cellular acceptors

In this paper, we investigate multi-dimensional computational model, k-neighborhood template A-type three-dimensional bounded cellular acceptor on four-dimensional tapes, and discuss some basic properties. This model consists of a pair of a converter and a configuration-reader. The former converts the given four-dimensional tape to three-dimensional configuration. The latter determines whether or not the derived three-dimensional configuration is accepted, and concludes the acceptance or non-acceptance of given four-dimensional tape. We mainly investigate some open problems about k-neighborhood template A-type three-dimensional bounded cellular acceptor on four-dimensional tapes whose configuration-readers are L(m) space-bounded deterministic (nondeterministic) three-dimensional Turing machines.

Parallel Turing machines on four-dimensional input tapes

The parallel Turing machine (PTM) proposed by Wiedermann is a set of identical usual sequential Turing machines (STMs) cooperating on two common tapes: storage tape and input tape. On the other hand, due to the advances in many application areas such as motion picture processing, computer animation, virtual reality systems, and so forth, it has become increasingly apparent that the study of four-dimensional patterns is of crucial importance. Therefore, we think that the study of four-dimensional automata as a computational model of four-dimensional pattern processing is also meaningful. In this article, we propose a four-dimensional parallel Turing machine (4-PTM), and investigate some of its properties based on hardware complexity.

Hierarchies based on the number of cooperating systems of three-dimensional finite automata

The question of whether processing three-dimensional digital patterns is much more difficult than two-dimensional ones is of great interest from both theoretical and practical standpoints. Recently, owing to advances in many application areas, such as computer vision, robotics, and so forth, it has become increasingly apparent that the study of three-dimensional pattern processing is of crucial importance. Thus, the study of three-dimensional automata as a computational model of three-dimensional pattern processing has become meaningful. This article introduces a cooperating system of three-dimensional finite automata as one model of three-dimensional automata. A cooperating system of three-dimensional finite automata consists of a finite number of three-dimensional finite automata and a three-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, i.e., every finite automaton is allowed to know the internal states of other finite automata on the cell it is scanning at the moment. In this article, we continue the study of cooperating systems of three-dimensional finite automata, and mainly investigate hierarchies based on the number of their cooperating systems.

A proposal for teaching programming through the Five-Step Method

We have proposed a new method of advancing from CS Unplugged through the new process of CS Plugged to fullfledged computer programming languages, as a means of deepening understanding in computer programming education. We also have proposed a new Five-Step Method consisting of the following steps: Step 1, A CS Unplugged activity; Step 2, A CS Plugged activity; Step 3, A trace table, Step 4, Preparing pseudocode; and Step 5, Writing Java source code.

Some properties of four-dimensional parallel Turing machines

Informally, the parallel Turing machine (PTM) proposed by Wiedermann is a set of identical usual sequential Turing machines (STMs) cooperating on two common tapes: a storage tape and an input tape. Moreover, STMs which represent the individual processors of a parallel computer can multiply themselves in the course of computation. On the other hand, during the past 7 years or so, automata on a four-dimensional tape have been proposed as computational models of four-dimensional pattern processing, and several properties of such automata have been obtained. We proposed a four-dimensional parallel Turing machine (4-PTM), and dealt with a hardware-bounded 4-PTM in which each side-length of each input tape is equivalent. We believe that this machine is useful in measuring the parallel computational complexity of three-dimensional images. In this work, we continued the study of the 3-PTM, in which each side-length of each input tape is equivalent, and investigated some of its accepting powers.

The TCE-RBV Framework for Information Systems Outsourcing: Empirical Testing using Survey Data in Japan

This paper investigates the factors that influence the motives of make-or-buy decisions on information systems from the viewpoints of Transaction cost economics (TCE) and the resource-based view (RBV). Using our original questionnaire survey data carried out in 2007 targeting Japanese firms, we analyze the relationships between the recognition related to the role of their information systems and the pattern of their make-or-buy decisions. As a result, we make it clear that there are two cases in which TCE-motive and RBV-motive are complement or contradictory each other. And in latter case, TCE-motive tends to dominate over RBV-motive. Finally, the implications for theory and practice are discussed.

Hierarchy Based on Configuration-Reader about k-Neighborhood Template A-Type Three-Dimensional Bounded Cellular Acceptor

Blum and Hewitt first proposed two-dimensional automata as computational models of two-dimensional pattern processing－two-dimensional finite automata and marker automata, and investigated their pattern recognition abilities in 1967. Since then, many researchers in this field have investigated the properties of automata on two- or three-dimensional tapes. On the other hand, the question of whether or not processing four-dimensional digital patterns is more difficult than processing two- or three-dimensional ones is of great interest from both theoretical and practical standpoints. Thus, the study of four-dimensional automata as the computational models of four-dimensional pattern processing has been meaningful. From this point of view, we are interested in four-dimensional computational models, In this paper, we introduce a new four-dimensional computational model, k-neighborhood template A-type three-dimensional bounded cellular acceptor on four-dimensional input tapes, and investigate about hierarchy based on configuration-reader about this model.

Cooperating systems of four-dimensional finite automata

M. Blum and C. Hewitt first proposed two-dimensional automata as a computational model of two-dimensional pattern processing in 1967, and investigated their pattern recognition abilities. Since then, many researchers in this field have investigated many properties of automata on a two- or three-dimensional tape. However, the question of whether processing four-dimensional digital patterns is much more difficult than processing two- or three-dimensional ones is of great interest from both theoretical and practical standpoints. Thus, the study of four-dimensional automata as a computational model of four-dimensional pattern processing has been meaningful. This article 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). The finite automata whose input heads scan the same cell of the input tape can communicate with each other, i.e., every finite automaton is allowed to know the internal states of other finite automata on the cell it is scanning at the moment. In this article we mainly investigate the accepting powers of a cooperating system of seven-way four-dimensional finite automata. The seven-way four-dimensional finite automaton is a four-dimensional finite automaton whose input head can move east, west, south, north, up, down, or in the future, but not in the past, on a four-dimensional input tape.

k-Neighborhood Template A-Type Two-Dimensional Bounded Cellular Acceptors

In this paper, we deal with three-dimensional computational model, k-neighborhood template A-type twodimensional bounded cellular acceptor on three-dimensional tapes, and discuss some basic properties. This model consists of a pair of a converter and a configuration-reader. The former converts the given three-dimensional tape to two-dimensional configuration. The latter determines whether or not the derived two-dimensional configuration is accepted, and concludes the acceptance or non-acceptance of given three-dimensional tape. We mainly investigate some open problems about k-neighborhood template A-type two-dimensional bounded cellular acceptor on threedimensional tapes whose configuration-readers are L(m) space-bounded deterministic (nondeterministic) twodimensional Turing machines.

Remarks on Four-Dimensional Probabilistic Finite Automata

This paper is a study of four-dimensional automata. Recently, due to the advances in many application areas such as dynamic image processing, computer animation, augmented reality (AR), and so on, it is useful for analyzing computation of four-dimensional information processing (three-dimensional pattern processing with time axis) to explicate the properties of four-dimensional automata. From this point of view, we have investigated many properties of four-dimensional automata and computational complexity. On the other hand, the class of sets accepted by probabilistic machines have been studied extensively. As far as we know, however, there is no results concerned with four-dimensional probabilistic machines. In this paper, we introduce four-dimensional probabilistic finite automata, and investigate some accepting powers of them.