Kazuki YOSHIDA Kentaro SAITO Keito SOGAI Masanori MIURA Kensaku KANOMATA Bashir AHMMAD Shigeru KUBOTA Fumihiko HIROSE
Nano crystalline zinc oxide (ZnO) is deposited by room temperature atomic layer deposition (RT-ALD) using dimethylzinc and a plasma excited humidified Ar without thermal treatments. The TEM observation indicated that the deposited ZnO films were crystallized with grain sizes of ∼20 nm on Si in the course of the RT-ALD process. The crystalline ZnO exhibited semiconducting characteristics in a thin film transistor, where the field-effect mobility was recorded at 1.29×10-3cm2/V·s. It is confirmed that the RT deposited ZnO film has an anticorrosion to hot water. The water vapor transmission rate of 8.4×10-3g·m-2·day-1 was measured from a 20 nm thick ZnO capped 40 nm thick Al2O3 on a polyethylene naphthalate film. In this paper, we discuss the crystallization of ZnO in the RT ALD process and its applicability to flexible electronics.
Motoharu SASAKI Mitsuki NAKAMURA Nobuaki KUNO Wataru YAMADA Naoki KITA Takeshi ONIZAWA Yasushi TAKATORI Hiroyuki NAKAMURA Minoru INOMATA Koshiro KITAO Tetsuro IMAI
Path loss in high frequency bands above 6GHz is the most fundamental and significant propagation characteristic of IMT-2020. To develop and evaluate such high frequency bands, ITU-R SG5 WP5D recently released channel models applicable up to 100GHz. The channel models include path loss models applicable to 0.5-100GHz. A path loss model is used for cell design and the evaluation of the radio technologies, which is the main purpose of WP5D. Prediction accuracy in various locations, Tx positions, frequency bands, and other parameters are significant in cell design. This article presents the prediction accuracy of UMa path loss models which are detailed in Report ITU-R M.2412 for IMT-2020. We also propose UMa_A' as an extension model of UMa_A. While UMa_A applies different equations to the bands below and above 6GHz to predict path loss, UMa_A' covers all bands by using the equations of UMa_A below 6GHz. By using the UMa_A' model, we can predict path loss by taking various parameters (such as BS antenna height) into account over a wide frequency range (0.5-100GHz). This is useful for considering the deployment of BS antennas at various positions with a wide frequency band. We verify model accuracy by extensive measurements in the frequency bands from 2 to 66GHz, distances up to 1600 m, and an UMa environment with three Tx antenna heights. The UMa_A' extension model can predict path loss with the low RMSE of about 7dB at 2-26.4GHz, which is more accurate than the UMa_A and UMa_B models. Although the applicability of the UMa_A' model at 66GHz is unclear and needs further verification, the evaluation results for 66GHz demonstrate that the antenna height may affect the prediction accuracy at 66GHz.
While online communities are important platforms for various social activities, many online communities fail to survive, which motivates researchers to investigate factors affecting the growth and survival of online communities. We comprehensively examine the effects of a wide variety of social network features on the growth and survival of communities in Reddit. We show that several social network features, including clique ratio, density, clustering coefficient, reciprocity and centralization, have significant effects on the survival of communities. In contrast, we also show that social network features examined in this paper only have weak effects on the growth of communities. Moreover, we conducted experiments predicting future growth and survival of online communities utilizing social network features as well as contents and activity features in the communities. The results show that prediction models utilizing social network features as well as contents and activity features achieve approximately 30% higher F1 measure, which evaluates the prediction accuracy, than the models only using contents and activity features. In contrast, it is also shown that social network features are not effective for predicting the growth of communities.
Keisuke OKANO Naoto SASAOKA Yoshio ITOH
We propose online feedback path modeling with a pre-inverse type active noise control (PIANC) system to track the fluctuation stably in the feedback path. The conventional active noise control (ANC) system with online feedback path modeling (FBPM) filter bases filtered-x least mean square (FxLMS) algorithm. In the FxLMS algorithm, the error of FBPM influences a control filter, which generates an anti-noise, and secondary path modeling (SPM) filter. The control filter diverges when the error is too large. Therefore, it is difficult for the FxLMS algorithm to track the feedback path without divergence. On the other hand, the proposed approach converges stably because the FBPM filter's error does not influence a control filter on the PIANC system. Thus, the proposed method can reduce noise while tracking the feedback path. This paper verified the effectiveness of the proposed method by convergence analysis, computer simulation, and implementation of a digital signal processor.
Rui LI Ruqi XIAO Hong GU Weimin SU
A novel direction of arrival (DOA) estimation method for the coherent signal is presented in this paper. The proposed method applies the eigenvector associated with max eigenvalue, which contains the DOAs of all signals, to form a Toeplitz matrix, yielding an unconstrained optimization problem. Then, the DOA is obtained by peak searching of the pseudo power spectrum without the knowledge of signal number. It is illustrated that the method has a great performance and low computation complexity for the coherent signal. Simulation results verify the usefulness of the method.
Kazuhisa YAMAGISHI Noritsugu EGI Noriko YOSHIMURA Pierre LEBRETON
Since the quality of video streaming services is degraded due to the encoding, network congestion, and lack of a playout buffer, the normality of services needs to be monitored by gathering the quality measured at the end clients. When measuring quality at the end clients, the computational power should be sufficiently low, the bitstream information cannot be accessed for the quality estimation due to the encryption, and reference video cannot be used at the end clients. Therefore, metadata-based models have been developed and standardized that take metadata such as the resolution, framerate, and bitrate, and stalling information as input and calculate the quality. However, calculated quality for linear TV and video on demand (VoD) services cannot be compared because metadata-based models cannot calculate the impacts of codec strategies (e.g., H.264/AVC, H.265/HEVC, and AV1) and configurations (e.g., 1-pass encoding for linear TV or 2-pass encoding for VoD) on the quality. To take into account the impact of codec strategies and configurations, coefficients of metadata-based model need to be optimized per codec strategy and configuration using subjective quality. However, extensive subjective assessment tests are difficult to frequently conduct because they are expensive and time consuming and need to be conducted by video quality experts. Therefore, to monitor the quality of several types of video streaming services (e.g., linear TV and VoD) and to compare these qualities, a derivation procedure is proposed for obtaining coefficients of metadata-based models using a full-reference model. To validate the procedure, extensive subjective assessment tests were conducted. Finally, it is shown that three metadata-based models (i.e., the P.1203.1 mode 0 model, extended P.1203.1 mode 0 model, and model proposed by Yamagishi et al.) based on the proposed procedure using the video multimethod assessment fusion (VMAF) algorithm estimate quality accurately in terms of root mean squared error.
Yuya OMORI Ken NAKAMURA Takayuki ONISHI Daisuke KOBAYASHI Tatsuya OSAWA Hiroe IWASAKI
This paper describes a novel 4K 120fps (frames per second) real-time HEVC (High Efficiency Video Coding) encoder for high-frame-rate video encoding and transmission. Motion portrayal problems such as motion blur and jerkiness may occur in video scenes containing fast-moving objects or quick camera panning. A high-frame-rate solves such problems and provides a more immersive viewing experience that can express even the fast-moving scenes without discomfort. It can also be used in remote operation for scenes with high motion, such as VAR (Video Assistant Referee) systems in sports. Real-time encoding of high-frame-rate videos with low latency and temporal scalability is required for providing such high-frame-rate video services. The proposed encoder achieves full 4K/120fps real-time encoding, which is twice the current 4K service frame rate of 60fps, by multichip configuration with two encoder LSI. Exchange of reference picture data near a spatially divided slice boundary provides cross-chip motion estimation, and maintains the coding efficiency. The encoder supports temporal-scalable coding mode, in which it output stream with temporal scalability transmitted over one or two transmission paths. The encoder also supports the other mode, low-delay coding mode, in which it achieves 21.8msec low-latency processing through motion vector restriction. Evaluation of the proposed encoder's multichip configuration shows that the BD-bitrate (the average rate of bitrate increase), compared to simple slice division without inter-chip transfer, is -2.86% at minimum and -2.41% on average in temporal-scalable coding mode. The proposed encoder system will open the door to the next generation of high-frame-rate UHDTV (ultra-high-definition television) services.
Takumi UCHIDA Keisuke ISHIBASHI Kensuke FUKUDA
This paper introduces a method to estimate latent traffic from its origin to destination from the link packet loss rate and traffic volume. In addition, we propose a method for the joint optimization of routing and link provisioning based on the estimated latent traffic. Observed traffic could deviate from the original traffic demand and become latent when the traffic passes through congested links because of changes in user behavioral and/or applications as a result of degraded quality of experience (QoE). The latent traffic is actualized by improving congested link capacity. When link provisioning is based on observed traffic, actual traffic might cause new congestion at other links. Thus, network providers need to estimate the origin-destination (OD) original traffic demand for network planning. Although the estimation of original traffic has been well studied, the estimation was only applicable for links. In this paper, we propose a method to estimate latent OD traffic by combining and expanding techniques. The method consists of three steps. The first step is to estimate the actual OD traffic and loss rate from the actual traffic and packet loss rate of the links. The second step is to estimate the latent traffic demand. Finally, using this estimated demand, the link capacity and routing matrix are optimized. We evaluate our method by simulation and confirm that congestion could be avoided by capacity provisioning based on estimated latent traffic, while provisioning based on observed traffic retains the congestion. The combined method can avoid congestion with an increment of 23% compared with capacity provisioning only. We also evaluated our method's adaptability, i.e., the ability to estimate the required parameter for the estimations using fewer given values, but values obtained in the environment.
Takuya KUWAHARA Takayuki KURODA Takao OSAKI Kozo SATODA
Network service providers need to appropriately design systems and carefully configuring the settings and parameters to ensure that the systems keep running consistently and deliver the desired services. This can be a heavy and error-prone task. Intent-based system design methods have been developed to help with such tasks. These methods receive service-level requirements and generate service configurations to fulfill the given requirements. One such method is search-based system design, which can flexibly generate systems of various architectures. However, it has difficulty dealing with constraints on the quantitative parameters of systems, e.g., disk volume, RAM size, and QoS. To deal with practical cases, intent-based system design engines need to be able to handle quantitative parameters and constraints. In this work, we propose a new intent-based system design method based on search-based design that augments search states with quantitative constraints. Our method can generate a system that meets both functional and quantitative service requirements by combining a search-based design method with constraint checking. Experimental results show that our method can automatically generate a system that fulfills all given requirements within a reasonable computation time.
Yasuhito SUMI Takuji TACHIBANA
In network function virtualization (NFV) environments, service chaining is an emerging technology that enables network operators to provide network service dynamically and flexibly by using virtual network function (VNF). In the service chaining, a service chain is expected to be constructed based on VNF performances such as dependences among VNFs and traffic changing effects in VNFs. For achieving optimal data transmission services in NFV environments, we focus on the optimal service chain construction based on VNF performances so that both the maximum amount of traffic on links and the total number of VNF instances are decreased. In this paper, at first, an optimization problem is formulated for determining placements of VNFs and a route for each service chain. The service chains can be constructed by solving this optimization problem with an optimization software or meta-heuristic algorithm. Then, for the optimization problem, we propose a heuristic service chain construction algorithm. By using our proposed algorithm, the service chains can be constructed appropriately more quickly. We evaluate the performance of the proposed heuristic algorithm with simulation, and we investigate the effectiveness of the heuristic algorithm from the performance comparison. From some numerical examples, we show that the proposed heuristic algorithm is effective to decrease the amount of traffic and the number of VNF instances. Moreover, it is shown that our proposed heuristic algorithm can construct service chains quickly.
This paper reports the results of a new test on what types of failure cause falls in the stock prices of telecommunication service providers. This analysis of stock price is complementary to our previous one on market share. A clear result of our new test is that the type of failure causing falls in stock price is different from the type causing decline in market share. Specifically, the previous study identified frequent failures as causes of decline in market share, while the current study indicates large failures affecting many users as causes of falls in stock price. Together, these analyses give important information for reliability designs of telecommunications networks.
Yan CHEN Chen LIU Mujun QIAN Yu HUANG Wenfeng SUN
This paper studies a harvested power-oriented simultaneous wireless information and power transfer (SWIPT) scheme over multiple-input multiple-output (MIMO) interference channels in which energy harvesting (EH) circuits exhibit nonlinearity. To maximize the power harvested by all receivers, we propose an algorithm to jointly optimize the transmit beamforming vectors, power splitting (PS) ratios and the receive decoding vectors. As all variables are coupled to some extent, the problem is non-convex and hard to solve. To deal with this non-convex problem, an iterative optimization method is proposed. When two variables are fixed, the third variable is optimized. Specifically, when the transmit beamforming vectors are optimized, the transferred objective function is the sum of several fractional functions. Non-linear sum-of-ratios programming is used to solve the transferred objective function. The convergence and advantage of our proposed scheme compared with traditional EH circuits are validated by simulation results.
Xi FU Yun WANG Zheng LI Atsushi SHIRANE Kenichi OKADA
There are enlarged requirements of millimeter-wave beamforming phased-array transceivers and high-order modulation multi-input multi-output (MIMO) transceivers. High-performance integrated RF switches are regarded as one of the most critical components for those transceivers to support signal channel distribution and path redundancy. This paper introduces a CMOS high-isolation and low-loss RF switch with a novel switched parallel LC resonance network. The proposed single-pole double-throw (SPDT) RF switch realizes 68dB port isolation and 1.0dB insertion loss with an active area of 0.034mm2. The SPDT RF switch is composed of two series-shunt transistor pairs with body-floating technology and a switched parallel LC network. The network uses a turned-off series transistor to resonate out off-capacitance Coff. The measured output third-order intercept (OIP3) is higher than 21dBm. The proposed SPDT RF switch maintains return losses of all working ports less than 10dB from 8GHz to 20GHz. The high-performance SPDT RF switch is fabricated in standard 65-nm CMOS technology.
Yuta UKON Shimpei SATO Atsushi TAKAHASHI
Advanced information-processing services such as computer vision require a high-performance digital circuit to perform high-load processing at high speed. To achieve high-speed processing, several image-processing applications use an approximate computing technique to reduce idle time of the circuit. However, it is difficult to design the high-speed image-processing circuit while controlling the error rate so as not to degrade service quality, and this technique is used for only a few applications. In this paper, we propose a method that achieves high-speed processing effectively in which processing time for each task is changed by roughly detecting its completion. Using this method, a high-speed processing circuit with a low error rate can be designed. The error rate is controllable, and a circuit design method to minimize the error rate is also presented in this paper. To confirm the effectiveness of our proposal, a ripple-carry adder (RCA), 2-dimensional discrete cosine transform (2D-DCT) circuit, and histogram of oriented gradients (HOG) feature calculation circuit are evaluated. Effective clock periods of these circuits obtained by our method with around 1% error rate are improved about 64%, 6%, and 12%, respectively, compared with circuits without error. Furthermore, the impact of the miscalculation on a video monitoring service using an object detection application is investigated. As a result, more than 99% of detection points required to be obtained are detected, and it is confirmed the miscalculation hardly degrades the service quality.
Thi Diem TRAN Yasuhiko NAKASHIMA
Convolutional neural networks (CNNs) have dominated a range of applications, from advanced manufacturing to autonomous cars. For energy cost-efficiency, developing low-power hardware for CNNs is a research trend. Due to the large input size, the first few convolutional layers generally consume most latency and hardware resources on hardware design. To address these challenges, this paper proposes an innovative architecture named SLIT to extract feature maps and reconstruct the first few layers on CNNs. In this reconstruction approach, total multiply-accumulate operations are eliminated on the first layers. We evaluate new topology with MNIST, CIFAR, SVHN, and ImageNet datasets on image classification application. Latency and hardware resources of the inference step are evaluated on the chip ZC7Z020-1CLG484C FPGA with Lenet-5 and VGG schemes. On the Lenet-5 scheme, our architecture reduces 39% of latency and 70% of hardware resources with a 0.456 W power consumption compared to previous works. Even though the VGG models perform with a 10% reduction in hardware resources and latency, we hope our overall results will potentially give a new impetus for future studies to reach a higher optimization on hardware design. Notably, the SLIT architecture efficiently merges with most popular CNNs at a slightly sacrificing accuracy of a factor of 0.27% on MNIST, ranging from 0.5% to 1.5% on CIFAR, approximately 2.2% on ImageNet, and remaining the same on SVHN databases.
This paper proposes a pulse-width modulated (PWM) signaling[1] to send clock and data over a pair of channels for in-vehicle network where a closed chain of point-to-point (P2P) interconnection between electronic control units (ECU) has been established. To improve detection speed and margin of proposed receiver, we also proposed a novel clock and data recovery (CDR) scheme with 0.5 unit-interval (UI) tuning range and a PWM generator utilizing 10 equally-spaced phases. The feasibility of proposed system has been proved by successfully detecting 1.25 Gb/s data delivered via 3 ECUs and inter-channels in 180 nm CMOS technology. Compared to previous study, the proposed system achieved better efficiency in terms of power, cost, and reliability.
Qi WEI Xiaolin YAO Luan LIU Yan ZHANG
We investigate an online problem of a robot exploring the outer boundary of an unknown simple polygon P. The robot starts from a specified vertex s and walks an exploration tour outside P. It has to see all points of the polygon's outer boundary and to return to the start. We provide lower and upper bounds on the ratio of the distance traveled by the robot in comparison to the length of the shortest path. We consider P in two scenarios: convex polygon and concave polygon. For the first scenario, we prove a lower bound of 5 and propose a 23.78-competitive strategy. For the second scenario, we prove a lower bound of 5.03 and propose a 26.5-competitive strategy.
Hao ZHOU Hailing XIONG Chuan LI Weiwei JIANG Kezhong LU Nian CHEN Yun LIU
Image dehazing is of great significance in computer vision and other fields. The performance of dehazing mainly relies on the precise computation of transmission map. However, the computation of the existing transmission map still does not work well in the sky area and is easily influenced by noise. Hence, the dark channel prior (DCP) and luminance model are used to estimate the coarse transmission in this work, which can deal with the problem of transmission estimation in the sky area. Then a novel weighted variational regularization model is proposed to refine the transmission. Specifically, the proposed model can simultaneously refine the transmittance and restore clear images, yielding a haze-free image. More importantly, the proposed model can preserve the important image details and suppress image noise in the dehazing process. In addition, a new Gaussian Adaptive Weighted function is defined to smooth the contextual areas while preserving the depth discontinuity edges. Experiments on real-world and synthetic images illustrate that our method has a rival advantage with the state-of-art algorithms in different hazy environments.
Aryo PINANDITO Yusuke HAYASHI Tsukasa HIRASHIMA
Concept map has been widely used as an interactive media to deliver contents in learning. Incorporating concept maps into collaborative learning could promote more interactive and meaningful learning environments. Furthermore, delivering concept maps in a digital form, such as in Kit-Build concept map, could improve learning interaction further. Collaborative learning with Kit-Build concept map has been shown to have positive effects on students' understanding. The way students compose their concept maps while discussing with others is presumed to affect their learning. However, supporting collaborative learning in an online setting is formidable to keep the interaction meaningful and fluid. This study proposed a new approach of real-time collaborative learning with Kit-Build concept map. This study also investigated how concept map recomposition with Kit-Build concept map could help students collaboratively learn EFL reading comprehension from a distance by comparing it with the traditional open-ended concept mapping approach. The learning effect and students' conversation during collaboration with the proposed online Kit-Build concept map system were investigated. Comparative analysis with a traditional collaborative concept mapping approach is also presented. The results suggested that collaborative learning with Kit-Build concept map yielded better outcomes and more meaningful discussion than the traditional open-end concept mapping.
Masakazu IWAMURA Shunsuke MORI Koichiro NAKAMURA Takuya TANOUE Yuzuko UTSUMI Yasushi MAKIHARA Daigo MURAMATSU Koichi KISE Yasushi YAGI
Most gait recognition approaches rely on silhouette-based representations due to high recognition accuracy and computational efficiency. A fundamental problem for those approaches is how to extract individuality-preserved silhouettes from real scenes accurately. Foreground colors may be similar to background colors, and the background is cluttered. Therefore, we propose a method of individuality-preserving silhouette extraction for gait recognition using standard gait models (SGMs) composed of clean silhouette sequences of various training subjects as shape priors. The SGMs are smoothly introduced into a well-established graph-cut segmentation framework. Experiments showed that the proposed method achieved better silhouette extraction accuracy by more than 2.3% than representative methods and better identification rate of gait recognition (improved by more than 11.0% at rank 20). Besides, to reduce the computation cost, we introduced approximation in the calculation of dynamic programming. As a result, without reducing the segmentation accuracy, we reduced 85.0% of the computational cost.