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

Special Section on Frontiers of Information Network Science

N/A
N/A
Protected

Academic year: 2021

シェア "Special Section on Frontiers of Information Network Science"

Copied!
1
0
0

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

全文

(1)

IEICE TRANS. COMMUN., VOL.E95–B, NO.5 MAY 2012

1487

FOREWORD

Special Section on Frontiers of Information Network Science

Information networking technologies have been achieving tremendous growth as an indispensable infras- tructure in our society. Their conventional theoretical fundamentals, however, lose their ability to resolve new quantitative and qualitative challenges posed in current and future networks. That is, frontiers of in- formation network science, also called internet science or network science of complex systems etc, have been highly demanded. In addition, multidisciplinary approaches will be highly necessary including math- ematical engineering, theoretical physics, brain sciences, etc. Because of such reasons, this special section was planned to further promote research and development in the frontiers of information network science.

The Call for Papers attracted 25 submissions: 22 full papers and 3 letters. After careful review and much discussions, the editorial committee selected 9 papers (including two invited papers) and 2 letters. The selected articles cover a variety of topics, including basic mathematical, physical investigation for infor- mation networks, novel analysis of information networks, nature-inspired information networks, social- or security-related basic issues in information networks, etc. The submitted papers indeed cover a wide variety of and novel approaches; it was hard for the committee to select the ones for publications. We hope that the special section will help the readers share new knowledge and ideas and encourage further exciting investigations to create the frontiers of information network sciences.

As the guest editor-in-chief, I would like to express my sincere appreciation to all authors for their con- tributions and to all reviews and members of the editorial committee for their great efforts in the review process.

Special Section Editorial Committee Members

Guest Editors: Makoto Naruse (NICT), Hiroyoshi Miwa (Kwansei Gakuin Univ.)

Guest Associate Editors: Masaki Aida (Tokyo Metro. Univ.), Tetsuya Asai (Hokkaido Univ.), Kenji Ishida (Hiroshima City Univ.), Takeru Inoue (JST ERATO), Masato Uchida (Kyushu Inst. Tech.), Nobuharu Kami (NEC), Shinya Sato (NTT labs.), Hajime Nakamura (KDDI), Yukio Hayashi (JAIST), Naoki Wakamiya (Osaka Univ.), Naoya Wada (NICT)

Masayuki Murata

,Guest Editor-in-Chief

Masayuki Murata(Fellow) received the M.E. and D.E. degrees in Information and Computer Science from Osaka University, Japan, in 1984 and 1988, respectively. In April 1984, he joined Tokyo Research Laboratory, IBM Japan, as a Researcher. From September 1987 to January 1989, he was an Assistant Professor with the Computation Center, Osaka University. In February 1989, he moved to the Department of Information and Computer Sciences, Faculty of Engineering Science, Osaka University. In April 1999, he became a Professor of the Cybermedia Center, Osaka University, and is now with the Graduate School of Information Science and Technology, Osaka University since April 2004. He has more than four hundred papers in international and domestic journals and conferences. His research interests include computer communication networks, performance modeling and evaluation.

He is a Member of IEEE and ACM.

Copyright c2012 The Institute of Electronics, Information and Communication Engineers

参照

関連したドキュメント

The collected samples in this study may not have been representative of conditions throughout Cambodia be- cause of the limited area of sample collection, insufficient sample size

By adapting tools from information theory, I construct optimal, nonlinear local statistical predictors for random fields on networks; these take the form of minimal

We present the new multiresolution network flow minimum cut algorithm, which is es- pecially efficient in identification of the maximum a posteriori (MAP) estimates of corrupted

Rybko, A.N., Stationary distributions of time homogeneous Markov processes modeling message switching communication networks, Problems of Information Transmission 17.

We present the new multiresolution network flow minimum cut algorithm, which is es- pecially efficient in identification of the maximum a posteriori (MAP) estimates of corrupted

Eskandani, “Stability of a mixed additive and cubic functional equation in quasi- Banach spaces,” Journal of Mathematical Analysis and Applications, vol.. Eshaghi Gordji, “Stability

4 because evolutionary algorithms work with a population of solutions, various optimal solutions can be obtained, or many solutions can be obtained with values close to the

Therefore, motivated by the impact of topological structures and the delays on the dynamics of the networks, this paper mainly focuses on the effect of delays on inner