Takao Ito

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.

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.

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.

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.

Perfect Play in Miniature Othello

In 1993, J. Feinstein reported that a perfect play on 6×6 board of Othello gives a 16-20 win for the second player. His result does not remain as a paper, since he reported it on the Newsletter of the British Othello Federation. In our previous paper, we found out a perfect play different from the Feinstein. They have the same score, but it will not be a proof of the Feinstein is a perfect play. In this paper, we confirm that the sequence reported by Feinstein is one of the perfect plays. In addition, we introduce one of perfect plays in each boards of 4×4, 4×6, 4×8 and 4×10. From these results, we discuss the feature of the Othello larger than or equal to 8×8 board.

An Empirical Research on Inter-firm Capital Relationship in Yokokai Using IDE Spatial Model

This paper introduces recent fundamental modifications to the Japanese alliance system known as the keiretsu, and analyses how these changes have affected corporate performance. More specially, the performance of Japanese auto manufacturers, such as Toyota, Nissan and others, has significantly improved due to sophisticated production system technologies, highly productive workers, and recurring transaction relationships with their network family partners. After economic bubble of the 1990s, the strong ties between automobile makers and their supplier partners experienced significant changes, which are known as “keiretsu loosening”. Consequently, what is the status quo of automotive keiretsus? Does cross-shareholding, which is one specific form of capital relationship in keiretsu, still contribute to improving corporate performance? To answer these questions, this research reports the results of a study that collected data on cross-shareholdings to shed light on the relationship between inter-firm capital relationship and corporate performance. The findings of this empirical investigation reveal that: (1) Keiretsu is a flexible, highly adaptive organizational form; its scale changes in response to economic situations; (2) Capital relationships still remain a significant determinant of increasing profits for keiretsu partners even after the bubble burst in the 1990s.

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.

Remarks on Recognizability of Four-Dimensional Topological Components

The study of four-dimensional automata as the computational model of four-dimensional pattern processing has been meaningful. However, it is conjectured that the three-dimensional pattern processing has its our difficulties not arising in two- or three-dimensional case. One of these difficulties occurs in recognizing topological properties of four-dimensional patterns because the four-dimensional neighborhood is more complicated than two- or three-dimensional case. Generally speaking, a property or relationship is topological only if it is preserved when an arbitrary ’ rubber-sheet ’ distortion is applied to the pictures . For example, adjacency and connectedness are topological ; area, elongatedness, convexity, straightness, etc. are not. In recent years, there have been many interesting papers on digital topological properties. For example, an interlocking component was defined as a new topological property in multi-dimensional digital pictures, and it was proved that no one marker automaton can recognize interlocking components in a three-dimensional digital picture. In this paper, we deal with recognizability of topological components by four-dimensional Turing machines, and investigate some properties.

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

Recently, due to the advance in dynamic image processing, computer animation, augmented reality (AR), and so forth, it has become increasingly apparent that the study of four-dimensional pattern processing (three-dimensional pattern processing with time axis) should be very important. Thus, the study of four-dimensional automata as the computational model of four-dimensional pattern processing has been meaningful. From this point of view, we first introduced a four-dimensional automaton in 2002. In the multi-dimensional pattern processing, designers often use a strategy whereby features are extracted by projecting high-dimensional space on low-dimensional space. In this paper, from this viewpoint, we introduce a new computational model, k-neighborhood template A-type three-dimensional bounded cellular acceptor (abbreviated as A -3BCA(k)) on four-dimensional input tapes, and discuss hierarchy based on neighborhood template about A-3BCA(k).

An Empirical Examination of Inter-firm Capital Relationships in Mazda’s Yokokai using the IDE Spatial Model

Just as workflow and transactional linkages, inter-firm capital relationships are similarly known to have an impact on corporate performance. Because of the superior performance of Japanese networks known as Keiretsu, many companies have begun to recognize the importance of capital linkages whereas other companies have placed emphasis on improving coordination of managerial resources. In this paper, we review the literature on network organizations with a lens focused on examining the capital relationships in Yokokai, the Mazda’s Keiretsu. Employing regression analysis, three significant indices, influence, degree, and efficiency, were selected from nine indices, including others that include dyadic redundancy, dyadic constraint, effective size, constraint, hierarchy, and density. We propose a new approach, called IDE spatial model, to calculate the strength of the inter-firm’s relationships. In order to ascertain the rational inter-firm relationships, network indices and corporate performance are analyzed. Therefore, this research suggests a new perspective to examine the rational inter-firm relationship that can be used in any network organization.