AI (artificial intelligence) has grown at an overwhelming speed for the last decade, to the extent that it has become one of the mainstream tools that drive the advancements in science and technology. Meanwhile, the paradigm of edge computing has emerged as one of the foremost areas in which applications using the AI technology are being most actively researched, due to its potential benefits and impact on today's widespread networked computing environments. In this paper, we evaluate two major entry-level offerings in the state-of-the-art edge device technology, which highlight increased computing power and specialized hardware support for AI applications. We perform a set of deep learning benchmarks on the devices to measure their performance. By comparing the performance with other GPU (graphics processing unit) accelerated systems in different platforms, we assess the computational capability of the modern edge devices featuring a significant amount of hardware parallelism.
Kazuya TSUKAMOTO Hitomi TAMURA Yuzo TAENAKA Daiki NOBAYASHI Hiroshi YAMAMOTO Takeshi IKENAGA Myung LEE
In IoT era, the growth of data variety is driven by cross-domain data fusion. In this paper, we advocate that “local production for local consumption (LPLC) paradigm” can be an innovative approach in cross-domain data fusion, and propose a new framework, geolocation-centric information platform (GCIP) that can produce and deliver diverse spatio-temporal content (STC). In the GCIP, (1) infrastructure-based geographic hierarchy edge network and (2) adhoc-based STC retention system are interplayed to provide both of geolocation-awareness and resiliency. Then, we discussed the concepts and the technical challenges of the GCIP. Finally, we implemented a proof-of-concepts of GCIP and demonstrated its efficacy through practical experiments on campus IPv6 network and simulation experiments.
Vu-Tran-Minh KHUONG Khanh-Minh PHAN Huy-Quang UNG Cuong-Tuan NGUYEN Masaki NAKAGAWA
Many approaches enable teachers to digitalize students' answers and mark them on the computer. However, they are still limited for supporting marking descriptive mathematical answers that can best evaluate learners' understanding. This paper presents clustering of offline handwritten mathematical expressions (HMEs) to help teachers efficiently mark answers in the form of HMEs. In this work, we investigate a method of combining feature types from low-level directional features and multiple levels of recognition: bag-of-symbols, bag-of-relations, and bag-of-positions. Moreover, we propose a marking cost function to measure the marking effort. To show the effectiveness of our method, we used two datasets and another sampled from CROHME 2016 with synthesized patterns to prepare correct answers and incorrect answers for each question. In experiments, we employed the k-means++ algorithm for each level of features and considered their combination to produce better performance. The experiments show that the best combination of all the feature types can reduce the marking cost to about 0.6 by setting the number of answer clusters appropriately compared with the manual one-by-one marking.
Kiyoshi KURIHARA Nobumasa SEIYAMA Tadashi KUMANO
This paper describes a method to control prosodic features using phonetic and prosodic symbols as input of attention-based sequence-to-sequence (seq2seq) acoustic modeling (AM) for neural text-to-speech (TTS). The method involves inserting a sequence of prosodic symbols between phonetic symbols that are then used to reproduce prosodic acoustic features, i.e. accents, pauses, accent breaks, and sentence endings, in several seq2seq AM methods. The proposed phonetic and prosodic labels have simple descriptions and a low production cost. By contrast, the labels of conventional statistical parametric speech synthesis methods are complicated, and the cost of time alignments such as aligning the boundaries of phonemes is high. The proposed method does not need the boundary positions of phonemes. We propose an automatic conversion method for conventional labels and show how to automatically reproduce pitch accents and phonemes. The results of objective and subjective evaluations show the effectiveness of our method.
The Benchmarking Working Group of IETF has defined a benchmarking methodology for IPv6 transition technologies including stateless NAT64 (also called SIIT) in RFC 8219. The aim of our effort is to design and implement a test program for SIIT gateways, which complies with RFC 8219, and thus to create the world's first standard free software SIIT benchmarking tool. In this paper, we overview the requirements for the tester on the basis of RFC 8219, and make scope decisions: throughput, frame loss rate, latency and packet delay variation (PDV) tests are implemented. We fully disclose our design considerations and the most important implementation decisions. Our tester, siitperf, is written in C++ and it uses the Intel Data Plane Development Kit (DPDK). We also document its functional tests and its initial performance estimation. Our tester is distributed as free software under GPLv3 license for the benefit of the research, benchmarking and networking communities.
Bing LIU Zhengchun ZHOU Udaya PARAMPALLI
Inspired by an idea due to Levenshtein, we apply the low correlation zone constraint in the analysis of the weighted mean square aperiodic correlation. Then we derive a lower bound on the measure for quasi-complementary sequence sets with low correlation zone (LCZ-QCSS). We discuss the conditions of tightness for the proposed bound. It turns out that the proposed bound is tighter than Liu-Guan-Ng-Chen bound for LCZ-QCSS. We also derive a lower bound for QCSS, which improves the Liu-Guan-Mow bound in general.
Mingxing ZHANG Zhengchun ZHOU Meng YANG Haode YAN
The partial-period autocorrelation of sequences is an important performance measure of communication systems employing them, but it is notoriously difficult to be analyzed. In this paper, we propose an algorithm to design unimodular sequences with low partial-period autocorrelations via directly minimizing the partial-period integrated sidelobe level (PISL). The proposed algorithm is inspired by the monotonic minimizer for integrated sidelobe level (MISL) algorithm. Then an acceleration scheme is considered to further accelerate the algorithms. Numerical experiments show that the proposed algorithm can effectively generate sequences with lower partial-period peak sidelobe level (PPSL) compared with the well-known Zadoff-Chu sequences.
Fang LIU Kenneth W. SHUM Yijin ZHANG Wing Shing WONG
We consider all-to-all broadcast and unicast among nodes in a multi-channel single-hop ad hoc network, with no time synchronization. Motivated by the hard delay requirement for ultra-reliable and low-latency communication (URLLC) in 5G wireless networks, we aim at designing medium access control (MAC) schemes to guarantee successful node-to-node transmission within a bounded delay. To provide a hard guarantee on the transmission delay, deterministic sequence schemes are preferred to probabilistic schemes such as carrier sense multiple access (CSMA). Therefore, we mainly consider sequence schemes, with the goal to design schedule sequence set to guarantee successful broadcast/unicast within a common sequence period. This period should be as short as possible since it determines an upper bound on the transmission delay. In previous works, we have considered sequence design under time division duplex (TDD). In this paper, we focus on another common duplex mode, frequency division duplex (FDD). For the FDD case, we present a lower bound on period of feasible sequence sets, and propose a sequence construction method by which the sequence period can achieve the same order as the lower bound, for both broadcast and unicast models. We also compare the sequence length for FDD with that for TDD.
Go ISHII Takaaki HASEGAWA Daichi CHONO
In this paper, we build a microscopic simulator of traffic flow in a three-modal transport society for pedestrians/slow vehicles/vehicles (P/SV/V) to evaluate a post P/V society. The simulator assumes that the SV includes bicycles and micro electric vehicles, whose speed is strictly and mechanically limited up to 30 km/h. In addition, this simulator adopts an SV overtaking model. Modal shifts caused by modal diversity requires new valuation indexes. The simulator has a significant feature of a traveler-based traffic demand simulation not a vehicle-based traffic demand simulation as well as new evaluation indexes. New assessment taking this situation into account is conducted and the results explain new aspects of traffic flow in a three-mode transport society.
Zhouwen TAN Ziji MA Hongli LIU Keli PENG Xun SHAO
Impulsive noise (IN) is the most dominant factor degrading the performance of communication systems over powerlines. In order to improve performance of high-speed power line communication (PLC), this work focuses on mitigating burst IN effects based on compressive sensing (CS), and an adaptive burst IN mitigation method, namely combination of adaptive interleaver and permutation of null carriers is designed. First, the long burst IN is dispersed by an interleaver at the receiver and the characteristic of noise is estimated by the method of moment estimation, finally, the generated sparse noise is reconstructed by changing the number of null carriers(NNC) adaptively according to noise environment. In our simulations, the results show that the proposed IN mitigation technique is simple and effective for mitigating burst IN in PLC system, it shows the advantages to reduce the burst IN and to improve the overall system throughput. In addition, the performance of the proposed technique outpeformences other known nonlinear noise mitigation methods and CS methods.
Kazunori IWATA Hiroki YAMAMOTO Kazushi MIMURA
Shape matching with local descriptors is an underlying scheme in shape analysis. We can visually confirm the matching results and also assess them for shape classification. Generally, shape matching is implemented by determining the correspondence between shapes that are represented by their respective sets of sampled points. Some matching methods have already been proposed; the main difference between them lies in their choice of matching cost function. This function measures the dissimilarity between the local distribution of sampled points around a focusing point of one shape and the local distribution of sampled points around a referring point of another shape. A local descriptor is used to describe the distribution of sampled points around the point of the shape. In this paper, we propose an extended scheme for shape matching that can compensate for errors in existing local descriptors. It is convenient for local descriptors to adopt our scheme because it does not require the local descriptors to be modified. The main idea of our scheme is to consider the correspondence of neighboring sampled points to a focusing point when determining the correspondence of the focusing point. This is useful because it increases the chance of finding a suitable correspondence. However, considering the correspondence of neighboring points causes a problem regarding computational feasibility, because there is a substantial increase in the number of possible correspondences that need to be considered in shape matching. We solve this problem using a branch-and-bound algorithm, for efficient approximation. Using several shape datasets, we demonstrate that our scheme yields a more suitable matching than the conventional scheme that does not consider the correspondence of neighboring sampled points, even though our scheme requires only a small increase in execution time.
Zhenhui XU Tielong SHEN Daizhan CHENG
This paper studies the infinite time horizon optimal control problem for continuous-time nonlinear systems. A completely model-free approximate optimal control design method is proposed, which only makes use of the real-time measured data from trajectories instead of a dynamical model of the system. This approach is based on the actor-critic structure, where the weights of the critic neural network and the actor neural network are updated sequentially by the method of weighted residuals. It should be noted that an external input is introduced to replace the input-to-state dynamics to improve the control policy. Moreover, strict proof of convergence to the optimal solution along with the stability of the closed-loop system is given. Finally, a numerical example is given to show the efficiency of the method.
In this paper, we clarify the importance of performance evaluation using a plurality of smartphones in a positioning system based on radio waves. Specifically, in a positioning system using bluetooth low energy, the positioning performance of two types of positioning algorithms is performed using a plurality of smartphones. As a result, we confirmed that the fingerprint algorithm does not always provide sufficient positioning performance. It depends on the model of the smartphone used. On the other hand, the hybrid algorithm that the authors have already proposed is robust in the difference of the received signal characteristics of the smartphone. Consequently, we spotlighted that the use of multiple devices is essential for providing high-quality location-based services in real environments in the performance evaluation of radio wave-based positioning systems using smartphones.
Ayano NAKAI-KASAI Kazunori HAYASHI
Diffusion least-mean-square (LMS) is a method to estimate and track an unknown parameter at multiple nodes in a network. When the unknown vector has sparsity, the sparse promoting version of diffusion LMS, which utilizes a sparse regularization term in the cost function, is known to show better convergence performance than that of the original diffusion LMS. This paper proposes a novel choice of the coefficients involved in the updates of sparse diffusion LMS using the idea of message propagation. Moreover, we optimize the proposed coefficients with respect to mean-square-deviation at the steady-state. Simulation results demonstrate that the proposed method outperforms conventional methods in terms of the convergence performance.
Sho KANAMARU Kazushi KAWAMURA Shu TANAKA Yoshinori TOMITA Nozomu TOGAWA
Ising machines have attracted attention, which is expected to obtain better solutions of various combinatorial optimization problems at high speed by mapping the problems to natural phenomena. A slot-placement problem is one of the combinatorial optimization problems, regarded as a quadratic assignment problem, which relates to the optimal logic-block placement in a digital circuit as well as optimal delivery planning. Here, we propose a mapping to the Ising model for solving a slot-placement problem with additional constraints, called a constrained slot-placement problem, where several item pairs must be placed within a given distance. Since the behavior of Ising machines is stochastic and we map the problem to the Ising model which uses the penalty method, the obtained solution does not always satisfy the slot-placement constraint, which is different from the conventional methods such as the conventional simulated annealing. To resolve the problem, we propose an interpretation method in which a feasible solution is generated by post-processing procedures. We measured the execution time of an Ising machine and compared the execution time of the simulated annealing in which solutions with almost the same accuracy are obtained. As a result, we found that the Ising machine is faster than the simulated annealing that we implemented.
Shi QIU Daniel M. GERMAN Katsuro INOUE
Software copyright claims an exclusive right for the software copyright owner to determine whether and under what conditions others can modify, reuse, or redistribute this software. For Free and Open Source Software (FOSS), it is very important to identify the copyright owner who can control those activities with license compliance. Copyright notice is a few sentences mostly placed in the header part of a source file as a comment or in a license document in a FOSS project, and it is an important clue to establish the ownership of a FOSS project. Repositories of FOSS projects contain rich and varied information on the development including the source code contributors who are also an important clue to establish the ownership. In this paper, as a first step of understanding copyright owner, we will explore the situation of the software copyright in the Linux kernel, a typical example of FOSS, by analyzing and comparing two kinds of datasets, copyright notices in source files and source code contributors in the software repositories. The discrepancy between two kinds of analysis results is defined as copyright inconsistency. The analysis result has indicated that copyright inconsistencies are prevalent in the Linux kernel. We have also found that code reuse, affiliation change, refactoring, support function, and others' contributions potentially have impacts on the occurrence of the copyright inconsistencies in the Linux kernel. This study exposes the difficulty in managing software copyright in FOSS, highlighting the usefulness of future work to address software copyright problems.
Noriyuki TONAMI Keisuke IMOTO Ryosuke YAMANISHI Yoichi YAMASHITA
Sound event detection (SED) and acoustic scene classification (ASC) are important research topics in environmental sound analysis. Many research groups have addressed SED and ASC using neural-network-based methods, such as the convolutional neural network (CNN), recurrent neural network (RNN), and convolutional recurrent neural network (CRNN). The conventional methods address SED and ASC separately even though sound events and acoustic scenes are closely related to each other. For example, in the acoustic scene “office,” the sound events “mouse clicking” and “keyboard typing” are likely to occur. Therefore, it is expected that information on sound events and acoustic scenes will be of mutual aid for SED and ASC. In this paper, we propose multitask learning for joint analysis of sound events and acoustic scenes, in which the parts of the networks holding information on sound events and acoustic scenes in common are shared. Experimental results obtained using the TUT Sound Events 2016/2017 and TUT Acoustic Scenes 2016 datasets indicate that the proposed method improves the performance of SED and ASC by 1.31 and 1.80 percentage points in terms of the F-score, respectively, compared with the conventional CRNN-based method.
Teruki HAYAKAWA Masateru TSUNODA Koji TODA Keitaro NAKASAI Amjed TAHIR Kwabena Ebo BENNIN Akito MONDEN Kenichi MATSUMOTO
Various software fault prediction models have been proposed in the past twenty years. Many studies have compared and evaluated existing prediction approaches in order to identify the most effective ones. However, in most cases, such models and techniques provide varying results, and their outcomes do not result in best possible performance across different datasets. This is mainly due to the diverse nature of software development projects, and therefore, there is a risk that the selected models lead to inconsistent results across multiple datasets. In this work, we propose the use of bandit algorithms in cases where the accuracy of the models are inconsistent across multiple datasets. In the experiment discussed in this work, we used four conventional prediction models, tested on three different dataset, and then selected the best possible model dynamically by applying bandit algorithms. We then compared our results with those obtained using majority voting. As a result, Epsilon-greedy with ϵ=0.3 showed the best or second-best prediction performance compared with using only one prediction model and majority voting. Our results showed that bandit algorithms can provide promising outcomes when used in fault prediction.
Koichi KOBAYASHI Kyohei NAKAJIMA Yuh YAMASHITA
Event-triggered control is a method that the control input is updated only when a certain condition is satisfied (i.e., an event occurs). In this paper, event-triggered control over a sensor network is studied based on the notion of uniformly ultimate boundedness. Since sensors are located in a distributed way, we consider multiple event-triggering conditions. In uniformly ultimate boundedness, it is guaranteed that if the state reaches a certain set containing the origin, the state stays within this set. Using this notion, the occurrence of events in the neighborhood of the origin is inhibited. First, the simultaneous design problem of a controller and event-triggering conditions is formulated. Next, this problem is reduced to an LMI (linear matrix inequality) optimization problem. Finally, the proposed method is demonstrated by a numerical example.
Kosuke SHIMA Kazuki MARUTA Chang-Jun AHN
This paper proposes a novel weight derivation method to improve adaptive array interference suppression performance based on our previously conceived sample matrix inversion algorithm using common correlation matrix (CCM-SMI), by data-aided approach. In recent broadband wireless communication system such as orthogonal frequency division multiplexing (OFDM) which possesses lots of subcarriers, the computation complexity is serious problem when using SMI algorithm to suppress unknown interference. To resolve this problem, CCM based SMI algorithm was previously proposed. It computes the correlation matrix by the received time domain signals before fast Fourier transform (FFT). However, due to the limited number of pilot symbols, the estimated channel state information (CSI) is often incorrect. It leads limited interference suppression performance. In this paper, we newly employ a data-aided channel state estimation. Decision results of received symbols are obtained by CCM-SMI and then fed-back to the channel estimator. It assists improving CSI estimation accuracy. Computer simulation result reveals that our proposal accomplishes better bit error rate (BER) performance in spite of the minimum pilot symbols with a slight additional computation complexity.