| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| MIKA (3rd) |
2023-10-10 15:35 |
Okinawa | Okinawa Jichikaikan (Primary: On-site, Secondary: Online) |
[Poster Presentation]
Channel Map Clustering for UAV Base Station Placement Method in Cell-Free Massive MIMO Networks Ryota Nosaka, Takahiro Matsuda (Tokyo Metropolitan Univ.) |
Although a cell-free massive MIMO network can provide users with uniformly good quality of services regardless of their ... [more] | |
| CQ, MIKA (Joint) (2nd) |
2023-08-30 15:00 |
Fukushima | Tenjin-Misaki Sports Park | [Poster Presentation]
Deployment of UAV Base Stations Using Channel Database in Cell-Free Massive MIMO Networks Ryota Nosaka, Takahiro Matsuda (Tokyo Metropolitan Univ) |
Although a cell-free massive MIMO network can provide users with uniformly good quality of services regardless of their ... [more] | |
| IN, NS, CS, NV (Joint) |
2021-09-09 13:05 |
Online | Online | Quantitative Evaluation of the Number of Servers Required to Obtain the Coverage of Community Formation Vertices in Autonomous Decentralized Management Graphs Satoshi Tanaka, Kunitake Kaneko (Keio Univ.)  IN2021-13 |
An autonomous decentralized management graph is a graph in which each of the multiple managers autonomously decides whic... [more] | IN2021-13 pp.7-12 |
| NLP, MSS (Joint) |
2021-03-15 13:25 |
Online | Online | Graph Structure Optimization Using Genetic Algorithms Hiroki Tajiri, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) NLP2020-59 |
There are many large and complex networks in the real world. These networks are modeled as graphs and analyzed using a v... [more] | NLP2020-59 pp.23-28 |
| MBE, NC (Joint) |
2020-12-18 16:40 |
Online | Online | A Consideration on Efficient Visual Search from the Perspective of Complex Networks Yoshinobu Maeda (Niigata Univ.), Makoto Ozawa, Taishin Nomura (Osaka Univ.), Akira Tsukada (NIT Toyama) MBE2020-23 |
Visual search is an operation so as to find visually a target symbol in many alternatives. It is efficient in the sense... [more] | MBE2020-23 pp.18-23 |
| ISEC, SITE, ICSS, EMM, HWS, BioX, IPSJ-CSEC, IPSJ-SPT [detail] | 2019-07-23 09:55 |
Kochi | Kochi University of Technology | Evaluation of Similarity Calculation Methods for Image Clustering based on PRNU Noise Mai Uchida, Yoichi Tomioka (UoA) ISEC2019-17 SITE2019-11 BioX2019-9 HWS2019-12 ICSS2019-15 EMM2019-20 |
In order to prevent crimes such as illegal uploading and secret photography, attractive attention has been paid to a met... [more] | ISEC2019-17 SITE2019-11 BioX2019-9 HWS2019-12 ICSS2019-15 EMM2019-20 pp.75-79 |
| EA, ASJ-H, ASJ-AA | 2019-07-17 14:50 |
Hokkaido | SAPPORO COMMUNITY PLAZA | A Study on Automatic Summarization of Music Data Based on Its Acoustic Features Yudai Kikuchi, Naofumi Aoki, Yoshinori Dobashi (Hokkaido Univ.) EA2019-19 |
This paper describes the method of automatic music summarization. Music has a repetitive structure, so we detect the rep... [more] | EA2019-19 pp.99-102 |
| AI | 2018-08-27 14:15 |
Osaka | Temporal Variability of Precipitation Events in Fukuoka, Kumamoto, and Kagoshima in Kyusyu Naoki Matsumoto, Kenta Ogino (Kumamoto Univ.), Ken-ichi Fukui (Osaka Univ.), Tomohiko Tomita (Kumamoto Univ.) AI2018-20 |
This work quantitatively evaluates the differences in rainfall events in Fukuoka, Kumamoto, and Kagoshima, which are lo... [more] | AI2018-20 pp.39-44 |
|
| EA, ASJ-H, ASJ-AA | 2018-07-24 13:00 |
Hokkaido | Hokkaido Univ. | [Poster Presentation]
A Study on the Calculation of Similarity of Music Data Based on Its Acoustic Features Yudai Kikuchi, Naofumi Aoki, Yoshinori Dobashi, Tsuyoshi Yamamoto (Hokkaido Univ.) EA2018-4 |
This paper explains a music similarity calculation method to provide a summary of music. There is a method for obtaining... [more] | EA2018-4 pp.19-23 |
| NLP, CAS | 2017-10-06 13:00 |
Niigata | Machinaka Campus Nagaoka | Derivation of Global Clustering Coefficient Maximizing Graphs in the Case Where the Size is Close to the Order Ryoka Kuriki, Norikazu Takahashi (Okayama Univ.) CAS2017-37 NLP2017-62 |
The clustering coefficient is a measure of the tendency of vertices in a network to form clusters. It is known that many... [more] | CAS2017-37 NLP2017-62 pp.69-74 |
| NLP | 2017-05-12 11:50 |
Okayama | Okayama University of Science | Analysis of oscillations occurring in the global coupling system of excitable elements Hirotaka Tominaga (Saga Univ.) NLP2017-20 |
We investigated a system which globally coupled FitzHugh-Nagumo model as the simplest model of excitatory element whic... [more] |
NLP2017-20 pp.99-102 |
| LOIS, IPSJ-DC | 2016-07-16 13:30 |
Hiroshima | Hiroshima RCC Culture Center | A study on Problems and the Solution of the Regional Linked Open Data Toshitaka Maki, Kazuki Takahashi, Toshihiko Wakahara, Akihiro Yamaguchi (FIT), Noboru Sonehara (NII) LOIS2016-17 |
Link Data are the data that the things are linked by URI based on Resource Description Framework (RDF). Linked Open Data... [more] | LOIS2016-17 pp.51-56 |
| DC, CPSY | 2015-04-17 14:15 |
Tokyo | Parallel Processor Architecture based on Small World Connection Hideki Mori (Meiji Univ.), Minoru Uehara, Katsuyoshi Matsumoto (Toyo Univ.) CPSY2015-10 DC2015-10 |
The technology of circuit refinement has achieved a tremendous large-scale integration, so huge VLSI systems have emerge... [more] | CPSY2015-10 DC2015-10 pp.53-58 |
|
| DC | 2013-12-13 15:35 |
Ishikawa | On the effects of the interaction between power line and SCADA networks on system robustness Yuki Matsui, Hideharu Kojima, Tatsuhiro Tsuchiya (Osaka Univ.) DC2013-74 |
In this work, we discuss the robustness of a power line network and a SCADA network to interacting failures. Previous re... [more] | DC2013-74 pp.35-39 |
|
| ITS, IE, ITE-AIT, ITE-HI, ITE-ME [detail] | 2012-02-21 11:00 |
Hokkaido | Hokkaido Univ. | A Note on User Clustering Using Measurement of Levels of Interest Estimated from Viewing Behavior Tetsuo Shiraishi, Takahiro Ogawa, Miki Haseyama (Hokkaido Univ.) |
This paper presents a user clustering method using levels of interest estimated from viewing behavior.In the proposed me... [more] | |
| CAS | 2012-01-19 09:50 |
Fukuoka | Kyushu Univ. | On graphs with maximum clustering coefficient in 2-switch neighborhood Tatsuya Fukami, Norikazu Takahashi (Kyushu Univ.) CAS2011-87 |
Given a simple undirected connected graph, let us consider the problem to find a graph such that it has the same degree ... [more] | CAS2011-87 pp.13-18 |
| NLP, CAS | 2010-08-02 14:45 |
Tokushima | Naruto University of Education | A Study on Global and Local Maxima of the Clustering Coefficient Saki Koizuka, Norikazu Takahashi (Kyushu Univ.) CAS2010-42 NLP2010-58 |
The clustering coefficient is one of the most important indices characterizing complex networks. It is often said that m... [more] | CAS2010-42 NLP2010-58 pp.49-54 |
| COMP | 2010-06-25 16:35 |
Tokyo | Tokyo Tech | On the Existence and Reconstruction of a Simple Graph with a Given Joint-Degree Sequence Shigeo Shioda (Chiba Univ.) COMP2010-23 |
We refer to a pair of degrees of two end nodes of a link as a {\it joint degree}, and refer to a list of joint degrees o... [more] | COMP2010-23 pp.53-60 |
| NS, IN (Joint) |
2010-03-05 11:00 |
Miyazaki | Miyazaki Phoenix Seagaia Resort (Miyazaki) | Comparative Analysis on AS-Level and Router-Level Topologies Using Degree Correlation Models
-- Can degree correlation define the network topology? -- Asuka Izumi, Masato Yoshihara, Youhei Tachikawa, Shigeo Shioda (Chiba Univ.) NS2009-231 |
In this article, we present a comparative analysis of AS- and router-level topologies using Degree Correlation Model. Ou... [more] | NS2009-231 pp.387-392 |
| NS | 2009-10-16 11:40 |
Kumamoto | Prefectural University of Kumamoto (Kumamoto) | Markovian Property of Scale-Free Networks: Its Implications and Experimental Verification Youhei Tachikawa, Asuka Izumi, Masato Yoshihara, Shigeo Shioda (Chiba Univ.) NS2009-101 |
Many networks found in the real world have a tendency that small-degree nodes are more likely to be connected to large-d... [more] | NS2009-101 pp.139-144 |
[Return to Top Page]