The purpose of this research is to develop a new voice-communication medium called voiscape. By this medium, two or more persons can talk each other by using a virtual sound space based on spatial sound technology. People can move freely in the "sound room" and people can choose, enter, and exit from a room. Cocktail-party like situation can be created with this medium. In short, this project targets realizing Second-Life-like world by sound.

Papers on voiscape are available here.

Magazine articles etc. on voiscape

• Tech Analysis: Recapturing Original Sound, Nikkei Electronics Asia - May 2006.
• Recapturing Original Sound, Games, Business: Hitachi Ltd of Japan, meanwhile, is exploring business use. Yasushi Kanada, senior researcher, ...

The axis-specified search is a method of text search, especially for encyclopedia search. Users (searchers) specify an axis of search in addition to keywords. The search results are arranged along the axis. For example, if the axis is "year", the result is a chronological table. The axis can also be "geography" or various types of "quantity".

The most important paper on this research is "Axis-specified Search: A Fine-grained Full-text Search Method for Gathering and Structuring Excerpts". The method of extracting geographical names is described in "A Method of Geographical Name Extraction from Japanese Text for Thematic Geographical Search". Other papers are available here.

Thematic Search (Axis-specified Search) Page

This page contains information on "Net-de-hyakka" etc.

This is a small-scale research on developing a method for reproducing and displaying exactly or almost the same Web page as the original (i.e., complete or incomplete reproduction).

• Web pages for trying self-reproduction by yourself (You need Netscape Navigator 4.0 to test part of these pages.)
• An English paper and a Japanese paper

What is CCM?

CCM (Chemical Casting Model, or Chemical-Computation Model) is a model for emergent computation. CCM works only with local information, i.e., each reaction (unit action) in CCM refers only a few data, and there is no global plan (i..e., no program) for the computation. CCM is based on a production system (a type of rule-based computation method), which is similar to chemical reaction systems (rather than conventional production systems used for developing expert systems). Two features of CCM are as follows.

• CCM works with locally-defined evaluation functions, which is called local order degrees.
• The order of reactions (rule applications) is random (or, stochastic or non-deterministic). Randomness is a source of emergence.

In addition, catalysts do not change by reactions but affects the reaction velocity, a type of tunneling effect is caused by reaction rule composition, and annealing-like effects are caused by Frustration Accumulation Method (FAM).

• List of PDF or postscript papers
• Demos on CCM (The N queens, map coloring, and magic square problems are available.)
• A Report on Recent Research Results
• CCM home page, including a list of recent papers and several papers in HTML (hypertext papers).

I initially called this model "Chemical Programming Model". However, to stress the difference from conventional programming, I renamed it CCM. The "C" in the center was the capital of "Casting"; I used this word to stress the difference from computation using a program. However, now I think it should be the capital of "Computation" because it is more understandable.

What is RACA?

RACA is a model for complex systems. Conventional cellular automata, which was studied by Wolfram, are synchronous and deterministic. On the contrary, RACA are asynchronous and non-deterministic, or more precisely, they are randomized. RACA and CCM are similar in their stochastic behavior. The research of RACA was initially started when I computed cellular automata by using CCM.

• Kanada's cellular automata home page, including a paper in HTML (hypertext paper).
• List of PDF or postscript papers

Note

I spent only very limited time for this research, and it was accepted only as a poster in ALIFE IV. In spite of these facts, I found this paper, which was not included in the ALIFE IV proceedings, has been referred to by eleven papers and the article of Asynchronous Cellular Automaton in Wikipedia (in March 2007). It seems to be amazing for me. I found one of them at Citeseer. However, if Google Scholar did not exist, I could not find most of them.

Related pages

• VLAB (www.complexity.org.au)

The aim of this research was to establish methods of vector processing of logic programming languages and/or symbolic vector processing. The main target machines were vector supercomputers, such as Cray X-MP or Hitachi S-820. However, this research also aimed symbolic supercomputing on SIMD parallel processors, such as CM-1.

• List of PDF or postscript papers

I deveped a programming language called Dihybrid, which was for MIMD computers, as the graduation research of the university. However, the processor could not be completed. After I was employed, I developed several compilation techniques for a Fortran compiler for the SIMD-type supercomputer S-810 and others in a group of several people. The major techniques are methods of dataflow analysis to decide vectorizability, and a method of vector register assignment.

• Only a graduation thesis (in Japanese) is available for Dihybrid.
• Compilation techniques for the S-810 is outlined in "Compiling Algorithms and Techniques for the S-810 Vector Processor". We had several presentations on IPSJ national conferences, but I regret that I did not wrote a more detail in papers.
• Other papers on this R & D are available from Programming language and Programming Paper Archive.

I developed compilers for general-purpose computers since I was in the third grade of the university. The first one is a compiler of SIMPL, which appeared monthly in a Japanese magazine called "bit", but I developed it independently from the magazine article. When I was in the graduate school, I developed a Pascal compiler to be used in the Educational Computer Center of the University of Tokyo. After I was employed, I was involved in two Fortran compiler development projects. I described the first one, a development for vector processors, in another entry. In the redevelopment of compiler after so-called IBM case, we developed a dataflow analysis methods for arrays.

• No references exist on the SIMPL compiler because there was no issue to write a paper.
• On the Pascal compiler, there is a paper in the programming symposium.
• A Method of Global Dataflow Analysis for Arrays