• 検索結果がありません。

FOREWORD

N/A
N/A
Protected

Academic year: 2021

シェア "FOREWORD"

Copied!
1
0
0

読み込み中.... (全文を見る)

全文

(1)

IEICE TRANS. INF. & SYST., VOL.E90–D, NO.2 FEBRUARY 2007

387

FOREWORD

Special Section on Foundations of Computer Science

We are very happy to publish this special section on Foundations of Computer Science. This is the fourth section on this title. The main goal of this special section is to review and promote recent progress in the field of foundations of computer science.

The special section includes nine full papers, which cover a variety of topics in the area such as approxima-tion algorithms, finite automata, formal language, graph algorithms, graph theory, optimizing algorithms, parallel computing and quantum computing. These nine papers were selected among eighteen submissions through careful review.

As the Guest Editor of this special section, I would like to express my sincere thanks to all authors for their contributions. I greatly appreciate the voluntary work of all reviewers and also the remarkable efforts of the members of the Editorial Committee listed below.

Editorial Committee Members

Akihiro Fujiwara (Kyushu Institute of Technology) Chuzo Iwamoto (Hiroshima University)

Yuichi Kaji (Nara Institute of Science and Technology) Takuya Kida (Hokkaido University)

Yosuke Kikuchi (Tsuyama National College of Technology) Mitsuo Motoki (JAIST)

Yoshio Okamoto (Toyohashi University of Technology) Masahiko Sakai (Nagoya University)

Shinichi Shimozono (Kyushu Institute of Technology)

Yasuhiko Takenaga (The University of Electro-Communications) Eiji Takimoto (Tohoku University)

Keisuke Tanaka (Tokyo Institute of Technology) Yushi Uno (Osaka Prefecture University)

Shin-ichi Nakano

,Guest Editor

Shin-ichi Nakano(Member) received his B.E. and M.E. degrees from Tohoku Univer-sity, Sendai, Japan, in 1985 and 1987, respectively. In 1987 he joined Seiko Epson Corp. and in 1990 he joined Tohoku University. In 1992, he received D.E. degree from Tohoku Univer-sity. Since 2004 he is a Professor in the Department of Computer Science, Gunma UniverUniver-sity. His research interests are graph algorithms and graph theory. He is a member of IPSJ, JSIAM, ACM and IEEE Computer Society.

参照

関連したドキュメント

(at least a proof can be reconstructed from it, after correcting a number of misprinted formulae). Other authors have subsequently given different proofs, see for instance [Kn1,

From this, one can easily find an induced splitting of the computational energy space V n , where the condition number is independent of the anisotropy of the problem and

In order to demonstrate that the CAB algorithm provides a better performance, it has been compared to other optimization approaches such as metaheuristic algorithms Section 4.2

This paper develops a recursion formula for the conditional moments of the area under the absolute value of Brownian bridge given the local time at 0.. The method of power series

modular proof of soundness using U-simulations.. & RIMS, Kyoto U.). Equivalence

The layout produced by the VDCB algorithm is more evenly distributed according to the CP model, and is more similar to the original layout according to the similarity measures

7.1. Formal Chern-Simons theory and graph cocycles. In previous section we have described how one can construct the graph cycles, see examples 6.3, 6.4 and 6.5. At the same time the

The dynamic nature of our drawing algorithm relies on the fact that at any time, a free port on any vertex may safely be connected to a free port of any other vertex without