Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
NS, NWS (Joint) |
2024-01-25 15:55 |
Hiroshima |
Higashisenda Campus, HiroshimaUniversity + Online (Primary: On-site, Secondary: Online) |
Performance of Backup Resources Allocation based on Unavailability Analysis Against Failures of Virtual and Physical Machines Nozomi Kita, Eiji Oki (Kyoto Univ.) NS2023-164 |
This paper presents the performance of our introduced backup allocation model for virtual machines that minimizes the un... [more] |
NS2023-164 pp.26-31 |
RCS, NS (Joint) |
2022-12-16 10:20 |
Aichi |
Nagoya Institute of Technology, and Online (Primary: On-site, Secondary: Online) |
Implementation and Evaluation of Cellular Resource Allocation Method for 5G-based C-V2X Itsuki Nakamura, Shin'ichi Arakawa (Osaka Univ), Takuya Miyasaka, Atsushi Tagami (KDDI Research), Go Hasegawa (Tohoku Univ), Masayuki Murata (Osaka Univ) NS2022-142 |
With recent advances in embedded systems and communication technologies, Cyber-Physical Systems (CPS) are being pratcita... [more] |
NS2022-142 pp.70-75 |
CCS, NLP |
2022-06-10 09:25 |
Osaka |
(Primary: On-site, Secondary: Online) |
On Auto-Correlation Properties of Random Numbers Generated by Two Markov Binary Sequences Shuzo Okuno, Akio Tsuneda (Kumamoto Univ.) NLP2022-13 CCS2022-13 |
Markov binary sequences generated by 2-state Markov source are one of typical information sources and they have exponent... [more] |
NLP2022-13 CCS2022-13 pp.62-65 |
CQ, CS (Joint) |
2022-05-12 16:35 |
Fukui |
Fukui (Fuku Pref.) (Primary: On-site, Secondary: Online) |
Study on an Autonomous Adaptive Mechanism for Robustness of the User-Aware Resource Assignment against Demand Fluctuation Keita Tatebe, Yusuke Sakumoto (Kwansei Gakuin Univ.) CQ2022-10 |
The assignment problem on networks is a fundamental problem associated with various methods such as distributed computin... [more] |
CQ2022-10 pp.50-55 |
NLP |
2021-12-18 11:05 |
Oita |
J:COM Horuto Hall OITA |
Markov Binary Sequences Generated by Post-Processing Based on Nonlinear Feedback Shift Registers Akio Tsuneda (Kumamoto Univ.), Naruaki Maeda (NEC) NLP2021-59 |
In general, random numbers are required to be uniform and uncorrelated. However, it is known that correlated random numb... [more] |
NLP2021-59 pp.72-75 |
QIT (2nd) |
2021-12-01 15:20 |
Online |
Online |
Non-Markovian dynamics of the quantum Otto cycle Miku Ishizaki, Naomichi Hatano (UTokyo), Hiroyasu Tajima (UEC) |
From the viewpoint of investigating the efficient use of heat by means of quantum resources, quantum heat engines, which... [more] |
|
WBS, IT, ISEC |
2021-03-05 14:45 |
Online |
Online |
Analysis of Optimal Error Exponents on Classification for Markov Sources Hiroto Kuramata, Hideki Yagi, Tsutomu Kawabata (UEC) IT2020-152 ISEC2020-82 WBS2020-71 |
We consider a classification problem for a test sequence to determine from which source the sequence generates. The syst... [more] |
IT2020-152 ISEC2020-82 WBS2020-71 pp.245-250 |
R |
2020-12-11 15:15 |
Online |
Online |
A Note on Variance-Based Sensitivity Analysis for Continuous-Time Markov Chains Based on Moment Approximation Jiahao Zhang (Hiroshima Univ.), Junjun Zheng (Ritsumeikan Univ.), Hiroyuki Okamura, Tadashi Dohi (Hiroshima Univ.) R2020-33 |
Sensitivity analysis plays a critical role in quantifying uncertainty in the design of computer systems. In particular, ... [more] |
R2020-33 pp.18-23 |
CQ |
2020-09-03 11:20 |
Osaka |
Osaka University Nakanoshima Center (Primary: On-site, Secondary: Online) |
The Effect of Scale-Free Structure of Network on Autonomous Decentralized Allocation Control of Content Replicas Toshitaka Kashimoto, Yusuke Sakumoto (Kwansei Univ.) CQ2020-36 |
Information centric network (ICN) aims to realize efficient content delivery by using in-network caching. Some studies ... [more] |
CQ2020-36 pp.9-14 |
PN |
2020-04-24 15:05 |
Online |
Online |
[Invited Talk]
AIFV Code Construction Method and Optimization Method for Average Performance of Markov Chains with Finite States Ken-ichi Iwata, Ryusei Fujita (Univ. of Fukui), Hirosuke Yamamoto (Univ. of Tokyo) PN2020-3 |
We describe a construction method to design the optimal binary AIFV codes, which are defined by Yamamoto, Tsuchihashi, H... [more] |
PN2020-3 pp.15-21 |
IT, ISEC, WBS |
2019-03-07 09:30 |
Tokyo |
University of Electro-Communications |
Analysis of Zero-Redundancy Estimator with a Finite Window for Markovian Source
-- When the Statewise Alphabets are Unknown -- Yusuke Hashimoto, Tstutomu Kawabata (Univ. of Electro-Comm.) IT2018-89 ISEC2018-95 WBS2018-90 |
A Bayesian (Laplace or Krichevski-Trofimov) estimator for Markov source can be used to build a lossless
source code. Ho... [more] |
IT2018-89 ISEC2018-95 WBS2018-90 pp.85-90 |
WBS, IT, ISEC |
2018-03-08 13:25 |
Tokyo |
Katsusika Campas, Tokyo University of Science |
Optimality for the Iterative Construction Scheme of AIFV-$m$ codes Ryusei Fujita, Ken-ichi Iwata (Univ. of Fukui), Hirosuke Yamamoto (The Univ. of Tokyo) IT2017-111 ISEC2017-99 WBS2017-92 |
Yamamoto, Tsuchihashi, and Honda proposed binary AIFV (almost instantaneous fixed-to-variable length) codes, which allow... [more] |
IT2017-111 ISEC2017-99 WBS2017-92 pp.49-54 |
IBISML |
2018-03-05 14:15 |
Fukuoka |
Nishijin Plaza, Kyushu University |
Exponential Family of Markov Kernels and Asymptotic Exponential Family of Markov Sources Jun'ichi Takeuchi (Kyushu Univ.), Hiroshi Nagaoka (UEC) IBISML2017-93 |
For parametric models of Markov sources, we prove that the notion of asymptotic exponential family is equivalent to the ... [more] |
IBISML2017-93 pp.21-25 |
ICM, CQ, NS, NV (Joint) |
2017-11-17 12:20 |
Kagawa |
|
Information Diffusion Model for Analyzing Temporal Variation of Contents Posted to SNSs Keisuke Nakajima, Masato Minamikawa, Shigeo Shioda (Chiba Univ.) CQ2017-84 |
When an impressive event occurs in the real world, several contents related to the event are posted to the SNSs; the pop... [more] |
CQ2017-84 pp.79-84 |
IT |
2017-07-14 15:10 |
Chiba |
Chiba University |
On Information Geometry of Tree Models Jun'ichi Takeuchi (Kyushu Univ.), Hiroshi Nagaoka (UEC) IT2017-35 |
We discuss information geometrical properties of the familes of Markov sources defined based on context trees. [more] |
IT2017-35 pp.109-113 |
IT |
2017-07-14 15:35 |
Chiba |
Chiba University |
Asymptotic Exponential Family of Markov Sources is Equivalent to Exponential Family of Markov Kernels Jun'ichi Takeuchi (Kyushu Univ.), Hiroshi Nagaoka (UEC) IT2017-36 |
For familes of Markov models, we prove that the notion of asymptotic exponential familly is equivalent to the notion of ... [more] |
IT2017-36 pp.115-119 |
IT |
2016-07-29 14:00 |
Fukuoka |
Seminar House, Fukuoka Univ. |
Source coding with side information at the decoder for a class of correlated information sources with memory Yasutada Oohama (UEC) IT2016-27 |
We consider the one helper source coding problem posed and investigated by Ahlswede, K"orner, and Wyner for a class of i... [more] |
IT2016-27 pp.37-42 |
RCS, RCC, ASN, NS, SR (Joint) |
2016-07-21 13:20 |
Aichi |
|
[Encouragement Talk]
The Effect of Network Topology on the Spread of Self-Evolving Botnets Takanori Kudo (Setsunan Univ.), Tomotaka Kimura (Tokyo Univ. of Science), Yoshiaki Inoue (Osaka Univ.), Hirohisa Aman (Ehime Univ.), Kouji Hirata (Kansai Univ.) NS2016-63 |
As the previous work, we have proposed an epidemic model of new botnets
named self-evolving botnets that autonomously ... [more] |
NS2016-63 pp.69-74 |
IT, ISEC, WBS |
2016-03-10 10:40 |
Tokyo |
The University of Electro-Communications |
Redundancy of Bayesian Code with Markov Fractal Prior Distributions Naoya Matsukami, Tsutomu Kawabata (UEC) IT2015-103 ISEC2015-62 WBS2015-86 |
Bayesian code method is used as a standard in realizing a universal noiseless source code. For a memoryless source, a mi... [more] |
IT2015-103 ISEC2015-62 WBS2015-86 pp.13-17 |
SR |
2015-05-28 15:15 |
Hyogo |
Akashi-Sangyou-Koryu-Center |
Rario Environment Statistical Recognition Based on State Transition Model with Considering of Intersystem Interference in Spectrum Sharing Scenarios Hirofumi Sasaki, Takayuki Yamada, Jun Mashino, Takatoshi Sugiyama (NTT) SR2015-6 |
In heterogeneous wireless networks with spectrum sharing, radio wave collisions often occur randomly by not only intra-s... [more] |
SR2015-6 pp.31-38 |