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

Editor's Message to Special Issue of Applications and the Internet in Conjunction with Main Topics of COMPSAC 2015

N/A
N/A
Protected

Academic year: 2021

シェア "Editor's Message to Special Issue of Applications and the Internet in Conjunction with Main Topics of COMPSAC 2015"

Copied!
1
0
0

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

全文

(1)Electronic Preprint for Journal of Information Processing Vol.24 No.4. Editor’s Message to Special Issue of Applications and the Internet in Conjunction with Main Topics of COMPSAC 2015 Hiroyuki Sato1,a) It is our great honour to have the special issue of “Applications and the Internet in Conjunction with Main Topics of COMPSAC 2015.” The Annual International Computer Software & Applications Conference (COMPSAC), sponsored by IEEE Computer Society and also technically sponsored by Information Processing Society of Japan (IPSJ), is one of the premium international forums for academia, industry, and government to discuss research results, advancements and future trends in computer and software technologies and applications. COMPSAC 2015 is held with the theme of “Mobile and Cloud Systems – Challenges and Applications,” in Taichung, Taiwan, on July 1–5, 2015. Among a wide range of topics covered by COMPSAC, several symposia cover a broad range of networking and computing technologies as well as advanced applications and services. We planned this special issue to publish premium research contributions of these research areas presented in COMPSAC 2015 together with contributions related to the main topics of COMPSAC. We received ten (10) submissions. Among those, we selected four (4) papers for publication. In addition to them, we invited two (2) papers from major researchers related to COMPSAC. Two prominent researhcers around COMPSAC accepted our invitation: Professor Sheikh Iqbal Ahamed and his group of Marquette University, and Professor Motonori Nakamura and his group of National Institute of Informatics, Japan. Finally, we would like to express our sincere gratitude to all the members of the editorial committee, who made great efforts to complete this special issue.. 1 a). The University of Tokyo, Bunkyo, Tokyo 113–8658, Japan [email protected]. c 2016 Information Processing Society of Japan . The Editorial Committee • Editor in-Chief: Hiroyuki Sato (The University of Tokyo) • Editorial Board: Takashi Imaizumi (Chiba University) • Editorial Committee: Toyokazu Akiyama (Kyoto Sangyo University) Eun-Sun Cho (Chungnam National U., Korea) Kazutoshi Fujikawa (NAIST) Katsuyoshi Iida (Tokyo Institute of Tech.) Masahiro Jibiki (NICT) Eiji Kawai (NICT) Shigeru Miyake (Hitachi) Yutaka Nakamura (Kyushu Inst. Tech.) Yasuo Okabe (Kyoto University) Katsunori Oyama (Nihon University) Junsok Song (KISTI, Korea) Hiroki Takakura (NII) Michiharu Takemoto (NTT) Nariyoshi Yamai (Tokyo University of Agriculture and Tech.) Katsuyuki Yamazaki (Nagaoka University of Tech.) Kenichi Yoshida (University of Tsukuba).

(2)

参照

関連したドキュメント

For example, a maximal embedded collection of tori in an irreducible manifold is complete as each of the component manifolds is indecomposable (any additional surface would have to

He thereby extended his method to the investigation of boundary value problems of couple-stress elasticity, thermoelasticity and other generalized models of an elastic

Keywords: continuous time random walk, Brownian motion, collision time, skew Young tableaux, tandem queue.. AMS 2000 Subject Classification: Primary:

Inside this class, we identify a new subclass of Liouvillian integrable systems, under suitable conditions such Liouvillian integrable systems can have at most one limit cycle, and

σ(L, O) is a continuous function on the space of compact convex bodies with specified interior point, and it is also invariant under affine transformations.. The set R of regular

[37] , Multiple solutions of nonlinear equations via Nielsen fixed-point theory: a survey, Non- linear Analysis in Geometry and Topology (T. G ´orniewicz, Topological Fixed Point

Then it follows immediately from a suitable version of “Hensel’s Lemma” [cf., e.g., the argument of [4], Lemma 2.1] that S may be obtained, as the notation suggests, as the m A

Applications of msets in Logic Programming languages is found to over- come “computational inefficiency” inherent in otherwise situation, especially in solving a sweep of